Yet another resource for collecting articles, videos etc. regarding functional programming
awsome awesome-list functional-languages awesome-functional-programming recursion-schemes recursion f-algebrasAlgo Deck is an open-source collection of 200+ algorithmic flash cards. It helps you preparing and succeeding in your algorithm & data structure interview. The code examples are in Java.
tree algorithm linked-list stack queue math algorithms graph array recursion bit-manipulation data-structures complexity sorting-algorithms heap interview-practice dynamic-programming hashtable greedy-algorithmsReal applications have real data, and real data nests. Objects inside of objects inside of lists of objects. Anything you can do at the command line readily translates to Python code, so you've always got a path forward when complexity starts to ramp up.
declarative data recursion utilities cli nested-structuresThis is just for exposition. For production, use chaos-pp which is superior in every way.
preprocessor cplusplus recursion mini-preprocessor-library c99 turing-tarpit cpreprocessorThink of it like an async version of while (true) {}.Here we create some numbered fixtures. The createFixture() function returns a Promise.
promise forever infinitely infinite while whilst repeat repeatedly recursive recursion times number count loop iterate serial serially async await promises bluebirdSimple and non-recursive JSON parse/stringify library. The vuvuzela is a coarse instrument, but it's lightweight, and it gets the job done.
vuvuzela json.parse stringify recursionThis is a very early draft! It is not exhaustive at all, but I figured it was worth sharing the parts that were ready. This resource focuses on the techniques of functional programming.
elm functional-programming recursionA compiler plugin to add a new phase to the compiler which supports mutual tail recursion. TwoTails adds in a code transforming phase to the compiler. As such, code using macros or code enhancing techniques (such as that in Spring) may fail to compile at best or work in an unexpected manner at worst. We want to specifically call out AoP libraries such as AspectJ where the intention of an author is to have each "loop" of the recursive call trigger some side-effect. In such cases, similar to code using @tailcall, only the first "loop" will induce the effect; all others will have been compiled away.
typelevel compiler-plugin recursionRecurserator is a set of recursive generators for recursively accessing an object. You can also use named imports.
generators es2015 recursion utilityA set of recursion problems to be solved (solutions included). The aim is to work under the directory /problems. First, write a test(s) for the recursive function. Then implement a solution to get the test(s) to pass. You can find solutions under /solutions.
recursion es2015 unit-testing recursion-joy recursion-problemTrampolines, to emulate tail-call recursion. isTrampoline(t: obj): bool — Returns, whether t is a trampolined object.
trampoline tail recursion tailcallThis tiny library helps you to write recursive functions without any ''stack overflow'' related pain. It works fine until the value thing is less then a sys.getrecursionlimit().
trampoline stack recursionIt is also possible to "fork" the timeline...which enables multiple queueing/chaining, independent of each other.
concurrency queueing recursion design-patternAdditionally, the convert(Array,VA::AbstractVectorOfArray) function is provided which transforms the VectorOfArray into a matrix/tensor. Also, vecarr_to_vectors(VA::AbstractVectorOfArray) returns a vector of the series for each component, that is A[i,:] for each i. A plot recipe is provided which plots the A[i,:] series. This is a VectorOfArray which stores A.t which matches A.u. This will plot (A.t[i],A[i,:]). The function tuples(diffeq_arr) returns tuples of (t,u).
vector array recursionThis is a library providing recursion schemes for Idris. It it is loosely based on Edward Kmett's Haskell library. The classic paper Functional programming with bananas, lenses, envelopes and barbed wire is the inspiration behind the Haskell library and is the standard reference on the topic. You may also find Law and Order in Algorithmics to be of use.
idris recursion-schemes idris-ecosystem control-flow recursionThis program generates geometry and recursively subdivides it into triangles. It doesn't really do anything useful, it just looks pretty. Run it on a big screen, use it as screen saver, do whatever you want. It's written in Rust and uses the glium library for drawing to the screen.
geometry recursion fractal graphics generative-arttailcall is a browserify transform and command line utility that can be used for eliminating tail calls in recursive functions (TCO = tail call optimization). This prevents excessive growth of the used call stack and generally speaking increases performance (in most cases). tailcall uses acorn to generate and traverse the AST.
browserify-transform browserify ast acorn perf optimization recursion es6 shim
We have large collection of open source products. Follow the tags from
Tag Cloud >>
Open source products are scattered around the web. Please provide information
about the open source projects you own / you use.
Add Projects.