Uses StringBuilder to achieve performance.
0 people like thisPosted: 18 hours ago by shazmodan
Pseudoword generator based on code from Evan Fosmark circa 2009.
0 people like thisPosted: 9 days ago by Phillip Trelford
Interactive computation that asks the user questions
9 people like thisPosted: 3 months ago by Tomas Petricek
Making QR-code image having contact information (VCard) with Google Chart API. If you scan this image with mobile phone, you can directly add new person to your contacts.
7 people like thisPosted: 4 months ago by Tuomas Hietanen
An example showing how to process list in a pipeline. We first use List.filter to return only even numbers and then use List.map to format them as strings.
4 people like thisPosted: 5 months ago by Tomas Petricek
This module implements a generic union-find data structure (from https://gist.github.com/vanaur/bea2b0ea57b58140b9c1d39a9b02e998).
6 people like thisPosted: 6 months ago by vanaur
This snippet provides a very small internal DSL for creating and querying XML using the underlying XLinq classes.
373 people like thisPosted: 13 years ago by Blake Coverett
Here is an improved version twice shorter, than original
72 people like thisPosted: 13 years ago by Nick Canzoneri
Invoke the methods from incompatible types
110 people like thisPosted: 13 years ago by Tao Liu
I'm working on parallel computations and I thought it would be useful to break work into chunks, especially when processing each element asynchronously is too expensive. The neat thing is that this function is general even though motivation for it is specific. Another neat thing is that this is true lazy sequence unlike what you'd get if you used Seq.groupBy. There are three versions for your enjoyment.
73 people like thisPosted: 13 years ago by Dmitri Pavlenkov
The following sample wants to make sure the person’s age is between 18 and 65, weight is no more than 200 and tall enough (>120).
82 people like thisPosted: 13 years ago by Tao Liu
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 thisPosted: 13 years ago by Neil Carrier
mailboxprocessor (27) parsing (28) reflection (19) collections (16) seq (54) regex (17) sequences (48) agent (20) tutorial (17) recursion (33) game (32) http (18) dsl (23) list (56) fold (22) f# (43) pattern matching (15) lazy (20) learning f# (16) wpf (20)
Vesa Karvonen (8) Brian Berns (9) Ankur Dhama (20) nagat01 (19) Rick Minerich (15) Nick Palladinos (66) Samuel Bosch (12) Ryan Riley (25) Eirik Tsarpalis (89) Evgeniy Andreev (13) Phillip Trelford (87) Joel Huang (13) Tao Liu (17) Tuomas Hietanen (75) mavnn (17) Taha Hachana (12) NIck Palladinos (14) Kit Eason (51) fholm (26) Antonio Cisternino (8)
Database contains 3195 snippets out of which 1711 is public.