From 4f08badd8416a6584308560c14a846069bb5fc61 Mon Sep 17 00:00:00 2001 From: Simon Cruanes Date: Tue, 2 Jul 2013 10:17:26 +0200 Subject: [PATCH] updated README --- README.md | 11 +++++++++++ 1 file changed, 11 insertions(+) diff --git a/README.md b/README.md index af42946d..bcec58b6 100644 --- a/README.md +++ b/README.md @@ -20,6 +20,9 @@ basic graph functions that work even on infinite graphs, and printing to DOT. - `Heap`, a purely functional polymorphic heap - `Bij`, a GADT-based bijection language used to serialize/deserialize your data structures +- `RAL`, a random-access list structure, with `O(1)` cons/hd/tl and `O(ln(n))` +access to elements by their index. +- `Leftistheap`, a polymorphic heap structure. Other structures are: @@ -33,6 +36,14 @@ monadic futures, and MVars (concurrent boxes) - `Vector`, a growable array (pure OCaml, no C; not tested) - `FlatHashtbl`, a (deprecated) open addressing hashtable with a functorial interface (replaced by PHashtbl) +- `Gen` and `Sequence`, generic iterators structures. + +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 +in combination with Lwt/Async). Currently, the modules are: + +- `Bencode`, for the [B-encode format](http://en.wikipedia.org/wiki/Bencode), +- `Sexp`, for S-expressions. ## Use