This post describes the F# implementation of the real-time double-ended queue from Chris Okasaki’s “Purely functional data structures”.
5 Feb'10
Real-time double-ended queue
5 Feb'10
Skew binary random access list
This post describes the F# implementation of the skew binary random access list from Chris Okasaki’s “Purely functional data structures”.
5 Feb'10
Binary random access list
This post describes the F# implementation of the binary random access list from Chris Okasaki’s “Purely functional data structures”.
We had previously given a way to implement two-way traffic control on a strict basis using a function which looped constantly to see if any data was available o read/write, and which processed it accordingly.
The following approach is based on a per-request basis. That is, an actors asks for n tokens to read (or write), and the manager sends it an answer when the actor is allowed perform the action. In effect, if the actor asks for 100 bytes and only 50 bytes can be exchanged per second, it will get a green light only after two seconds have elapsed.
27 Jan'10
Rate meter in F#
The following code allows us to measure (and keep track of) the exchange rate (whether upload or download), and the time needed to exchange n additional bytes (assuming the rate is stable).
21 Jan'10
Hood-Melville queue
This post describes the F# implementation of the Hood-Melville queue from Chris Okasaki’s “Purely functional data structures”.
21 Jan'10
Scheduled bottom-up merge sort
This post describes the F# implementation of the scheduled bottom-up merge sort from Chris Okasaki’s “Purely functional data structures”.
21 Jan'10
Scheduled binomial heap
This post describes the F# implementation of the scheduled binomial heap from Chris Okasaki’s “Purely functional data structures”.
7 Jan'10
Bottom-up merge sort
This post describes the F# implementation of the bottom-up merge sort from Chris Okasaki’s “Purely functional data structures”.
7 Jan'10
Real-time queue
This post describes the F# implementation of the real-time queue from Chris Okasaki’s “Purely functional data structures”.
7 Jan'10
Lazy pairing heap
This post describes the F# implementation of the lazy pairing heap from Chris Okasaki’s “Purely functional data structures”.
31 Dec'09
Physicist queue
This post describes the F# implementation of the physicist queue from Chris Okasaki’s “Purely functional data structures”.
31 Dec'09
Lazy binomial heap
This post describes the F# implementation of the lazy binomial heap from Chris Okasaki’s “Purely functional data structures”.
31 Dec'09
Bankers queue
This post describes the F# implementation of the bankers queue from Chris Okasaki’s “Purely functional data structures”.
21 Dec'09
Cleaning temporary internet files
A quick and dirty F# script to clean temporary internet files (including Flash cookies which don’t get deleted by the browsers).
Read more »