Get Bitcoin wallet account balance by public key
0 people like thisPosted: yesterday by Tuomas Hietanen
An approach to using annotated types in F# using overloaded methods.
1 people like thisPosted: 6 days ago by Eirik Tsarpalis
An approach to using annotated types in F# using SRTPs.
1 people like thisPosted: 6 days ago by Eirik Tsarpalis
Store rarely accessed efficiently compressed (only for unmanaged types). Efficient decompression with no temporary arrays by utilizing NativePtr with UnmanagedMemoryStream. Uncompressed resultant array stored with WeakReference to save multiple uncompression steps.
1 people like thisPosted: 8 days ago by manofstick
A simple continuation monad that encodes extensible and type-safe effects.
2 people like thisPosted: 12 days ago by Eirik Tsarpalis
This checks if a string contains all uppercase characters.
5 people like thisPosted: 19 days ago by LuisFX
This snippet is code that solves first Project Euler problem. It finds the sum of all the multiples of 3 or 5 below 1000. Please add other (more efficient, succinct or interesting) solutions to this snippet.
72 people like thisPosted: 7 years ago by Eugene Gavrin
get the list of ethernet sql servers
89 people like thisPosted: 7 years ago by nCdy
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".]
78 people like thisPosted: 7 years ago by Novox
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).
75 people like thisPosted: 6 years ago by Tao Liu
Unlike the previous chain of responsibility, this version use the pipeline to chain responsibilities.
98 people like thisPosted: 6 years ago by Tao Liu
This snippet is code that solves first Project Euler problem. It finds the sum of all the multiples of 3 or 5 below 1000. Please add other (more efficient, succinct or interesting) solutions to this snippet.
72 people like thisPosted: 7 years ago by Eugene Gavrin
collections (16) dsl (22) lazy (18) silverlight (21) recursion (27) monad (20) kata (17) computation builder (14) wpf (19) design patterns (18) tryfsharp (48) math (32) http (15) string (19) web (24) algorithms (25) array (19) quotations (17) reflection (18) regex (13)
Daniel Robinson (7) mavnn (17) devshorts (11) Rick Minerich (15) Ankur Dhama (20) Joel Huang (14) Dmitry Soshnikov (7) NIck Palladinos (14) Carsten König (10) Nick Palladinos (66) fholm (26) Robert Pickering (11) Tao Liu (17) Cesar Mendoza (17) Taha Hachana (12) Mauricio Scheffer (7) Gauthier Segay (11) Eirik Tsarpalis (73) Tuomas Hietanen (64) Tomas Petricek (143)
Database contains 2206 snippets out of which 1510 is public.