Gist ec627b32670dd31f4028

100%

Gist ec627b32670dd31f4028

✓ Published0🌍 Public

Last edited Jun 17, 2014

Created on Aug 2, 2014

This example demonstrates a modular approach to building and testing effectful programs using the free monad pattern in Scala. It defines a `Free` monad to sequence interactions like console prompts and authentication checks, with interpreters separating execution from logic. The code uses type classes `Monad`, natural transformations (`~>`), and coproducts to compose independent algebras (`Interact` and `Auth`). It shows both a production interpreter (`Console`) and a pure test interpreter (`TestConsole`) that returns output lists from a static input map, highlighting how to decouple I/O from program structure.

AI-generated description

Similar vizzes

Loading thumbnail…

Gist 0e59d1c2d63aaea35573

This example demonstrates benchmark-driven optimization of recursion schemes in Haskell, using the Criterion library’s `defaultMain`, `bgroup`, and `bench` functions to measure performance. The code defines catamorphisms (`ffold`), anamorphisms (`funfold`), hylomorphisms, and build functions (`fbuild`, `funbuild`), then applies them to natural numbers, lists, and trees. It highlights how `INLINE` pragmas and `RULES` for fusion (e.g., `ffold/fbuild`) improve execution speed, as shown in benchmarks like `lengthL`, `mapL`, and `depthT` over sample data structures.

FFranklin Chen

58% match

Loading thumbnail…

Example of point-free style

This example demonstrates how to compose functions in a point-free style using Haskell’s `Control.Category` operator `(>>>)`. The code defines a `matches` function that checks whether a given string equals an `Option`’s name prefixed with `"--"`, without explicitly mentioning the arguments. It shows the data flow by chaining `name`, `("--" ++)`, and `(==)` together, making the logic declarative. The example uses a custom `Option` data type and a sample `helpOption` to test the matching with `"--help"`. The source is a gist by FranklinChen, illustrating readable point-free composition in a functional programming context.

FFranklin Chen

58% match

Loading thumbnail…

Gist 7d6a7404e99051bb7d2f36c61f0113ae

This example demonstrates functional programming techniques in JavaScript, including currying, composition, and generator functions. It shows how currying enables partial application, as seen with the `sum` function and reusable helpers like `getName` and `mapUserNames`. The code uses `compose` with `reduceRight` to chain array transformations, filtering user names by length. It also illustrates generator behavior with `next(true)` to control iteration completion. The data is a hardcoded array of user objects, and output is logged to the console via `console.log`.

IIliaIdakiev

54% match

Loading thumbnail…

requirebin sketch

This example demonstrates two MobX patterns for managing derived state in a React application. It shows how `mobx.observable` creates reactive state objects, while `mobx.autorun` automatically tracks dependencies and re-runs a "someReallyExpensiveTest" function whenever the input changes. The visualization contrasts an imperative approach using `autorun` with a declarative approach using computed getters that chain `isBoolean` and `isString` properties. Console output logs state transitions as inputs toggle between booleans and strings, highlighting MobX's reactivity model.

HHypercubed

54% match

Loading thumbnail…

Gist 23733

This example visualizes the distinction between local variables, instance variables, and block scoping in Ruby through a sequence of short code snippets. It shows how assignment semantics affect values across method calls and blocks, culminating in a Numeric class monkey-patch. The visualization likely renders each snippet as annotated code blocks with output values, using a custom layout or a library like D3.js to arrange the snippets and highlight variable bindings. The data originates from the gist’s source code, presented without external datasets, focusing on the logic of variable scope rather than numerical or spatial data.

DDylanFM

54% match

Loading thumbnail…

Clojure thoughts and tips

The example shows a Clojure gist that clarifies the distinct behaviors of the standard functions `comp` and `juxt` through commented code and live map calls. It first demonstrates `juxt` with `map`, `name`, and `str/capitalize` to produce pairs like `["name" ":name"]`, then examines `comp` to reveal its right-to-left application order, correcting an initial misuse. The code uses Clojure core APIs such as `clojure.core/comp`, `clojure.core/juxt`, `map`, and `str/capitalize` directly in the REPL. The source is a gist authored by Eleonore9, with rendering limited to text output from the function calls.

EEleonore9

52% match

Loading thumbnail…

Coding Adelante: Challenges

This example shows a progression of coding challenges for learning JavaScript, starting with basic functions and building up to object-oriented programming. The gist presents a series of exercises that ask the reader to implement functions like `hello`, `multiply`, `sum`, `isEven`, and `isDivisible`, each with sample inputs and expected outputs shown in commented code. The visible API is plain JavaScript, using console output via `console.log` and standard function declarations. The examples gradually introduce arrays, conditional logic, and higher-order patterns, with the source being a single Markdown file from a gist. The rendering approach is purely text-based, with code blocks and comments that illustrate function behavior without any graphical or external library dependencies.

HHerbCaudill

52% match

Loading thumbnail…

Fibonacci in Scala

This example demonstrates a functional definition of the Fibonacci sequence in Scala, highlighting two equivalent recursive implementations: one using nested conditionals and another using pattern matching with a match expression. The visualization shows how the recursive calls unfold, with the second implementation (fib2) called for inputs 10 and 200 to illustrate growth. The code relies on Scala’s standard library, including the Int type and the match keyword, but does not use external visualization libraries. The rendering approach is minimal, focusing on the source code itself as the primary visual artifact, with no graphical output or data source beyond the hardcoded integers passed to the functions.

CCliffordAnderson

51% match