Posts Tagged ‘purely functional data structures’

This post describes the F# implementation of the implicit queue from Chris Okasaki’s “Purely functional data structures”.

Read more »

This post describes the F# implementation of the bootstrapped queue from Chris Okasaki’s “Purely functional data structures”.

Read more »

This post describes the F# implementation of the alternative binary random access list from Chris Okasaki’s “Purely functional data structures”.

Read more »

This post describes the F# implementation of the Bankers double-ended queue from Chris Okasaki’s “Purely functional data structures”.

Read more »

This post describes the F# implementation of the skew binomial heap from Chris Okasaki’s “Purely functional data structures”.

Read more »

This post describes the F# implementation of the real-time double-ended queue from Chris Okasaki’s “Purely functional data structures”.

Read more »

This post describes the F# implementation of the skew binary random access list from Chris Okasaki’s “Purely functional data structures”.

Read more »

This post describes the F# implementation of the binary random access list from Chris Okasaki’s “Purely functional data structures”.

Read more »

This post describes the F# implementation of the Hood-Melville queue from Chris Okasaki’s “Purely functional data structures”.

Read more »

This post describes the F# implementation of the scheduled bottom-up merge sort from Chris Okasaki’s “Purely functional data structures”.

Read more »

This post describes the F# implementation of the scheduled binomial heap from Chris Okasaki’s “Purely functional data structures”.

Read more »

This post describes the F# implementation of the bottom-up merge sort from Chris Okasaki’s “Purely functional data structures”.

Read more »

This post describes the F# implementation of the real-time queue from Chris Okasaki’s “Purely functional data structures”.

Read more »

This post describes the F# implementation of the lazy pairing heap from Chris Okasaki’s “Purely functional data structures”.

Read more »

This post describes the F# implementation of the physicist queue from Chris Okasaki’s “Purely functional data structures”.

Read more »