simon/ocaml-containers
1
0
Fork 0
mirror of https://github.com/c-cube/ocaml-containers.git synced 2025-12-06 11:15:31 -05:00
Code Issues Projects Releases Packages Wiki Activity Actions

update of readme and build files

Browse source
This commit is contained in:
Simon Cruanes 2013-08-20 11:31:30 +02:00
parent 1d476e3000
commit 1d39fd1d5b
3 changed files with 6 additions and 0 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

2
README.md
View file

@ -23,6 +23,7 @@ data structures
- `RAL`, a random-access list structure, with `O(1)` cons/hd/tl and `O(ln(n))` - `RAL`, a random-access list structure, with `O(1)` cons/hd/tl and `O(ln(n))`
access to elements by their index. access to elements by their index.
- `Leftistheap`, a polymorphic heap structure. - `Leftistheap`, a polymorphic heap structure.
- `SmallSet`, a sorted list implementation behaving like a set.
Other structures are: Other structures are:
@ -37,6 +38,7 @@ monadic futures, and MVars (concurrent boxes)
- `FlatHashtbl`, a (deprecated) open addressing hashtable with - `FlatHashtbl`, a (deprecated) open addressing hashtable with
a functorial interface (replaced by PHashtbl) a functorial interface (replaced by PHashtbl)
- `Gen` and `Sequence`, generic iterators structures. - `Gen` and `Sequence`, generic iterators structures.
- `UnionFind`, a functorial imperative Union-Find structure.
Some serialisation formats are also implemented, with a streaming, non-blocking Some serialisation formats are also implemented, with a streaming, non-blocking
interface that allows the user to feed the input in chunk by chunk (useful interface that allows the user to feed the input in chunk by chunk (useful

2
containers.mllib
View file

@ -22,3 +22,5 @@ Bencode
Sexp Sexp
RAL RAL
MultiSet MultiSet
UnionFind
SmallSet

2
containers.odocl
View file

@ -22,3 +22,5 @@ Bencode
Sexp Sexp
RAL RAL
MultiSet MultiSet
UnionFind
SmallSet