[Ocaml-lib-devel] Ocaml Libs

[Brian H. <bri...@ql...>]

More comments comming soon.

I have 2.5 libraries I've written I'd like to see included.  They (and 
their status) are:

- Psqueue, implementing a Priority Search Queue ala:
http://www.informatik.uni-bonn.de/~ralf/talks/ICFP01.pdf
This data structure has the best features of both a priority queue (O(1) 
find the highest priority element, O(log n) remove the highest priority 
element) and search trees (O(log n) to add, find, modify the priority of, 
or remove any element).  It is purely applicative.  It is commented, 
cleaned up, and forgotten at home at the moment.

- Bitset, implementing an unordered set of unique small integers as a 
bitfield.  Adding or removing and element and checking to see if an 
element is contained in the set are all O(1).  It is imperitive in style.  
I need to add a couple of functions (just remembered I forgot union and 
intersection) and commenting and it'll be ready to go.

- Regex, a regular expressions library.  This is the .5- it's about half 
written at this point.

Brian