Snippets tagged fold
-
Composing a list of functions
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".]
86 people like this
Like the snippet!Posted: 13 years ago by Novox
-
Split a list
Three ways to split a list in half (but not necessarily in the middle). A forth version added that's very short and should be fast, as we only use List.fold. New champ found.
83 people like this
Like the snippet!Posted: 13 years ago by Dmitri Pavlenkov
-
Seq.sumBy implemented in terms of Seq.fold
Seq.sumBy implemented in terms of Seq.fold
2 people like this
Like the snippet!Posted: 13 years ago by ildjarn
-
Earth Similarity Index
Calculating the Earth Similarity Index of a planet. http://phl.upr.edu/projects/earth-similarity-index-esi
0 people like this
Like the snippet!Posted: 12 years ago by Kit Eason
-
Pex4fun - Merging strings
A random pex4fun puzzle to write a snippet to merge two strings.
2 people like this
Like the snippet!Posted: 11 years ago by Joel Huang
-
Create a histogram of a sequence using map
Creates a map containing each item and its frequency as a key/value pair. Then sort by value in reverse order before printing each item.
2 people like this
Like the snippet!Posted: 10 years ago by Bjørn Bæverfjord
-
Event Sourcing
Playing with simplified domain modules and event sourcing in F#
6 people like this
Like the snippet!Posted: 9 years ago by mavnn
-
Fibonacci sequence with fold
Fibonacci nth term with fold
6 people like this
Like the snippet!Posted: 9 years ago by Andriy Tolstoy
-
An Associative Fold
A prototype of an associative fold operation when the function passed in arguments is a Semigroup(*) Operation. (*) Semigroup from Abstract Algebra.
2 people like this
Like the snippet!Posted: 8 years ago by Fabio Galuppo
-
Fast Fibonacci numbers calculation
This snippet based on Binet's formula combined with fast power algorithm. Four multiplications run in parallel, thus processor with four cores recommended. Bitwise operators improve divisions and multiplications by pow of 2.
0 people like this
Like the snippet!Posted: 4 years ago by Pavel Tatarintsev
-
Exponentiation by squaring
Function, what calculates x^n by non-recursive basic exponentiation squaring algorithm. This method uses the bits of the exponent to determine computing powers. Generic parameter x suitable for any type what supports multiplication. I do not suppose existence of inverse operator like "/", thus parameter n must be a positive integer only. It is not difficult to define an extended variant for a type what supports division.
3 people like this
Like the snippet!Posted: 4 years ago by Pavel Tatarintsev
-
Extensions to the Fold function
This snippet is helpfull in the following cases: 1) After a consolidation operation using the fold function we need to know how many elements have been processed. 2) A consolidation operation needs to use the index of each of the elements processed and we don't want to use the mapi function first. 3) A combination of the above. Since the following snippet just adds a wrapper to the existing Fold function we can repeat the approach for arrays and sequences (including the plinq ones)
31 people like this
Like the snippet!Posted: 13 years ago by Horacio Nuñez
-
Chronological sequence window beginnings
An abstraction of the following use case: Given a sequence of dates and max temperatures for each date, extract out the initial dates on which the temp is greater than a given threshold for n consecutive days. (Originally posted as an answer to this StackOverflow question: http://stackoverflow.com/questions/5267055 )
13 people like this
Like the snippet!Posted: 13 years ago by ildjarn
-
Folding over prime factors
Let's have some fun with higher order functions and instead of folding over a list, fold over the prime factors of a number. It can be optimized further by dividing out real primes instead of numbers of the form 6k+/-1, but it's not embarrassingly slow.
2 people like this
Like the snippet!Posted: 12 years ago by Arjen Kopinga
-
Successive fold functions
fold by applying a list of function to a list of arg, last one behaving as usual
1 people like this
Like the snippet!Posted: 12 years ago by nicolas2
-
Array Shuffle
Shuffling array using Seq.fold
6 people like this
Like the snippet!Posted: 10 years ago by Karlkim Suwanmongkol
-
Convert booleans to bits using fold
@Samuel - saw your post and thought one part was similar to bit shifting I was playing with yesterday, so rewrote the FromBooleans function using a fold instead of ref cells. Probably not as readable as your version though :)
2 people like this
Like the snippet!Posted: 10 years ago by Chris Ballard
-
Parallel fold
Idea from Guy L. Steele - Organizing Functional Code for Parallel Execution; or, foldl and foldr Considered Slightly Harmful - https://vimeo.com/6624203
9 people like this
Like the snippet!Posted: 9 years ago by Tuomas Hietanen
-
Type-level Fold
Generic Type-level Fold for Boolean Algebra
0 people like this
Like the snippet!Posted: 8 years ago by Nick Palladinos
-
SIMD fold extension for Array
A SIMD enhanced fold function that adds on to the Array type
2 people like this
Like the snippet!Posted: 8 years ago by Jack Mott
-
Project Euler #1
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.
3 people like this
Like the snippet!Posted: 4 years ago by Eugene Gavrin
-
Fold functions over static values builder
Fold it!
1 people like this
Like the snippet!Posted: 2 years ago by Evgeniy Andreev