Wednesday, 20 May 2009

Purely functional data structures: real-time queues and catenable lists

The F#.NET Journal just published an article about data structures:

"This is the second article in a series describing the design and implementation of some purely functional data structures. Real-time queues and catenable lists that provide reliable O(1) time complexity operations are described in detail. In particular, laziness is used to ensure that operations are performed efficiently even when the data structures are used persistently. This culminates in the creation of some useful new data structure implementations...."

To read this article and more, subscribe to The F#.NET Journal today!

No comments: