Recent snippets

  • Missile Command playable in tsunami.io

    Click on the tsunami.io button below to launch the online tsunami.io IDE with this snippet. Then select all the code (CTRL+A) and hit the Run button to start the game window, then just dock the window to the right of the code.. Click in the game window to launch missiles and save your cities.

    0 people like this

    Posted: 2 months ago by Phillip Trelford

  • Minimal Adaptive Cells (fable compatible)

    An implementation of minimal adaptive cells

    0 people like this

    Posted: 3 months ago by Onur Gumus

  • Functional wrappers for TryParse APIs

    Exemplary convenience wrappers for some of the System..TryParse APIs, using the combined power of F#' return value deconstruction mechanism via pattern matching, active patterns and option types instead of "out/ref" parameters. Added support for newest versions of F# to determine which overload of TryParse should be used.

    1 people like this

    Posted: 5 months ago by Cody

Popular snippets

  • The Haskell const function

    The const function is simple, but you can use it to make your code more legible. In this example we convert a unary function to a function of arity 2 (that ignores the second argument). Also by using the flip function from Haskell (which is equally easy to define) you can ignore the first argument.

    119 people like this

    Posted: 14 years ago by Alex Muscar

  • WPF / SilverLight Converter II

    version 1 is http://fssnip.net/62. This new version support convert from any existing function to a converter function by using composition and pipeline. The convert function is to make the function signature agree to the IValueConverter interface. You can add new functions in the FunctionLibrary module and reuse the class definition to reduce the coding effort. The first sample is to show how to make the converter pipeline work, the second one is a debugger converter used to debug the data binding problem.

    90 people like this

    Posted: 13 years ago by Tao Liu

  • Continuation-Passing Mnemonics

    Continuations provide a means whereby heap space can be traded for stack depth (heap space being generally more plentiful than stack depth). They are especially useful where tail recursion is not possible. Here are a couple of simple continuation examples that can be extended to cover more complex scenarios.

    100 people like this

    Posted: 14 years ago by Neil Carrier

Snippets by tags

dsl (23) async (98) sequences (48) list (56) recursion (33) array (22) generic programming (17) silverlight (22) json (15) lazy (20) computation expression (15) f# (43) quotations (21) web (29) kata (17) reflection (19) sequence (32) lists (15) pattern matching (15) design patterns (18)

View all...

Database contains 3200 snippets out of which 1714 is public.