This module implements a generic union-find data structure (from https://gist.github.com/vanaur/bea2b0ea57b58140b9c1d39a9b02e998).
2 people like thisPosted: 14 days ago by vanaur
76a9142220867b1e79c403fafe339a809a65ed01cb697988ac
0 people like thisPosted: 1 month ago by The streets
Stubbed methods for a computation expression with some explanations
4 people like thisPosted: 2 months ago by Jimmy Byrd
A function that will take a sequence of directory names and return a sequence of all file names within.
4 people like thisPosted: 2 months ago by Shankar Velayudhan
The example uses Seq.splitBy and Seq.tryHeadTail twice to split the input file in two and then into several pieces collecting the output file names in the first section and the content in the subsequent pieces It can efficiently split a huge 2.2GB file into several subfiles without having to rescan the file or cache in memory any portions of the file apart from the current line.
5 people like thisPosted: 4 months ago by amieres
High-performance JSON parsing with System.Text.Json and F#
1 people like thisPosted: 5 months ago by Tuomas Hietanen
Composition of functions in F# is easily achieved by using the >> operator. You can also chain an arbitary amount of functions (represented as a list or sequence) together by folding the list/seq with >>. [More formally: the set of endomorphisms 'a -> 'a forms a monoid with the binary, associative operator ">>" (or "<<") and the neutral element "id".]
83 people like thisPosted: 13 years ago by Novox
Get Stock Quote Data and Historical Stock Prices from Yahoo Finance.
237 people like thisPosted: 13 years ago by Tuomas Hietanen
This example shows how to load a Xaml file allowing to use WPF from F#. It also shows how to access WPF objects and register event handlers.
107 people like thisPosted: 13 years ago by Antonio Cisternino
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 thisPosted: 13 years ago by Alex Muscar
Three functions showing how to implement projection for functional lists. First version uses naive recursion and the second one is tail-recursive using the accumulator parameter. The third version extends this with continuation passing.
70 people like thisPosted: 13 years ago by Tomas Petricek
Classical "Hello world" example that prints a message to the console output. This version uses F# printfn function to do the printing.
183 people like thisPosted: 13 years ago by Tomas Petricek
design patterns (18) agent (20) reflection (19) fparsec (15) tutorial (17) game (32) regex (17) html (15) fold (22) http (18) dsl (23) math (35) web (29) kata (17) generic programming (17) f# (43) computation expression (15) collections (16) json (15) list (56)
devshorts (11) Faisal Waris (37) David Klein (16) Brian Berns (9) Samuel Bosch (12) Tomas Petricek (148) Vesa Karvonen (8) Evgeniy Andreev (13) Cesar Mendoza (17) Ankur Dhama (20) Phillip Trelford (87) Robert Pickering (10) Kit Eason (51) Tuomas Hietanen (75) Joel Huang (13) Fabio Galuppo (14) Gauthier Segay (11) Rick Minerich (15) NIck Palladinos (14) Ryan Riley (25)
Database contains 3183 snippets out of which 1709 is public.