"A set is an abstract data structure that stores its elements without duplicates and permits efficient insertion, removal and search. The most popular concrete implementation of a set is the hash table but this is an inherently mutable collection. Purely functional sets, including the `Set` collection provided by F#, are based upon balanced trees. This article looks at the design and implementation of a new purely functional set that has very different performance characteristics and, in particular, is much faster in some circumstances..."
If you subscribe to the F# Journal then can read this article here otherwise subscribe to the The F# Journal today to read this article and many more!