Nice thing you can do in F# that you can't do in C#, pulling a reference to an array element as a local var.
26 people like thisPosted: 13 years ago by fholm
Copy an array into a new one, changing the value at index 42 to 123. Uses "function" and pattern patching.
1 people like thisPosted: 12 years ago by Johann Deneux
A typical problem when working with arrays and indices is that it's easy to access an array with the wrong index. Units of measure in F# can be applied to integers, which makes it possible to abuse them to prevent this kind of error.
7 people like thisPosted: 12 years ago by Johann Deneux
A function to initialize 2D array that supports failures - if the initializer fails to produce value for any of the array locations, the construction is stopped and the function returns 'None'
3 people like thisPosted: 10 years ago by Tomas Petricek
This is a simple way to flat a two dimensional array in a linear one
1 people like thisPosted: 9 years ago by Riccardo Terrell
To avoid too huge lists when doing recursion, SQL-IN-clauses, etc... Use the F# core version: chunkBySize
2 people like thisPosted: 9 years ago by Tuomas Hietanen
Slicing arrays without copying using .Net's ArraySegment struct
2 people like thisPosted: 8 years ago by Phillip Trelford
Magic 8 Ball in your console/terminal
2 people like thisPosted: 8 years ago by Fabio Galuppo
Imperative and fast implementation of an intersperse function for array. if you search for a functional implemenation you should look [here](http://www.fssnip.net/7S3/title/Intersperse-a-list).
0 people like thisPosted: 7 years ago by Tobias Burger
Performs binary search on sorted arrays. Both ascending and descending-ordered arrays are supported. Pass a reverse comparer to the tryBinarySearchWith function to search on descending-ordered arrays.
2 people like thisPosted: 5 years ago by Bang Jun-young
String.Join (" ", [| "This" ; "is"; "a" ; "way" ; "to" ; "generate" ; "a" ; "shuffled" ; "array" ; "with" ; "given" ; "elements" ; "from" ; "an" ; "(ordered)" ; "array." |]) |> printf "\n >> %A\n"
1 people like thisPosted: 4 years ago by you
A circular queue implemented over an array.
4 people like thisPosted: 13 years ago by Johann Deneux
A function that takes a random subset from a seq<'T>.
1 people like thisPosted: 12 years ago by Taha Hachana
Match the first elements of an array an returns tail.
3 people like thisPosted: 10 years ago by thinkbeforecoding
Shuffling array using Seq.fold
6 people like thisPosted: 10 years ago by Karlkim Suwanmongkol
Fibonacci nth term with fold
6 people like thisPosted: 9 years ago by Andriy Tolstoy
Fast version - http://www.fssnip.net/sB
2 people like thisPosted: 9 years ago by Zhukoff Dima
BELLMAN-FORD algorithm to the shortest path based on pseudo code in Algortihms Unlocked
4 people like thisPosted: 8 years ago by Fabio Galuppo
A SIMD enhanced fold function that adds on to the Array type
2 people like thisPosted: 8 years ago by Jack Mott
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.
4 people like thisPosted: 6 years ago by manofstick
Creates a random string of length `n` with characters available in `chars` array.
1 people like thisPosted: 4 years ago by Johan Irvall
Shuffle an array
2 people like thisPosted: 2 years ago by Josh DeGraw