This post describes the F# implementation of the lazy binomial heap from Chris Okasaki’s “Purely functional data structures”.
Posts Tagged ‘data structure’
31 Dec'09
Lazy binomial heap
31 Dec'09
Bankers queue
This post describes the F# implementation of the bankers queue from Chris Okasaki’s “Purely functional data structures”.
17 Dec'09
Splay heap
This post describes the F# implementation of the splay heap from Chris Okasaki’s “Purely functional data structures”.
17 Dec'09
Double-ended queue
This post describes the F# implementation of the double-ended queue from Chris Okasaki’s “Purely functional data structures”.
17 Dec'09
Pairing heap
This post describes the F# implementation of the pairing heap from Chris Okasaki’s “Purely functional data structures”.
10 Dec'09
Batched queue
This post describes the F# implementation of the batched queue from Chris Okasaki’s “Purely functional data structures”.
10 Dec'09
Binomial heap
This post describes the F# implementation of the binomial heap from Chris Okasaki’s “Purely functional data structures”.
10 Dec'09
Red-black set
This post describes the F# implementation of the red-black set from Chris Okasaki’s “Purely functional data structures”.
3 Dec'09
Leftist heap
This post describes the F# implementation of the leftist heap from Chris Okasaki’s “Purely functional data structures”.
3 Dec'09
Finite map
This post describes the F# implementation of the finite map from Chris Okasaki’s “Purely functional data structures”.
27 Nov'09
Custom Stack
This post describes the F# implementation of the custom stack from Chris Okasaki’s “Purely functional data structures”.
This is the first of a series of posts relating to Chris Okasaki’s “Purely functional data structures” (see his thesis, and his book).
Note : the code given in his aforementionned book assumes much more laziness than will be used in the coming examples, mainly for simplification purposes.
In the following piece of code, we shall only define a few exceptions and extend the LazyList module from the FSharp Powerpack with a few functions needed to implement Chris Okasaki’s “purely functional data structures”.
27 Oct'09
An immutable queue library in F#
An immutable queue library in F#. The queue is divided into two lists : one for dequeueing, and one for enqueueing. All operations are based on the List module.
There are a few exceptions however : operations involving arithmetic (such as List.sum) are not included.
15 Oct'09
Tries and Anagrams with F#
An implementation of tries and an example anagrams application relying on ispell word lists.