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

updated doc and readme

Browse source
This commit is contained in:
Simon Cruanes 2015-01-26 20:10:43 +01:00
parent 3ae7c59289
commit ae4c356874
2 changed files with 10 additions and 25 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

27
README.md
View file

@ -144,27 +144,16 @@ In the module `Containers_advanced`:
See [doc](http://cedeela.fr/~simon/software/containers/misc). This list See [doc](http://cedeela.fr/~simon/software/containers/misc). This list
is not necessarily up-to-date. is not necessarily up-to-date.
- `PHashtbl`, a polymorphic hashtable (with open addressing)
- `SplayTree`, a polymorphic splay heap implementation (not quite finished)
- `SplayMap`, a polymorphic functional map based on splay trees
- `Heap`, an imperative heap based on `SplayTree`
- `Graph`, a polymorphic imperative directed graph (on top of `PHashtbl`)
- `Hashset`, a polymorphic imperative set on top of `PHashtbl`
- `LazyGraph`, a lazy graph structure on arbitrary (hashable+eq) types, with
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.
- `SmallSet`, a sorted list implementation behaving like a set.
- `AbsSet`, an abstract Set data structure, a bit like `LazyGraph`. - `AbsSet`, an abstract Set data structure, a bit like `LazyGraph`.
- `Univ`, a universal type encoding with affectation - `Automaton`, `CSM`, state machine abstractions
- `FlatHashtbl`, a (deprecated) open addressing hashtable with - `Bij`, a GADT-based bijection language used to serialize/deserialize your data structures
a functorial interface (replaced by PHashtbl) - `LazyGraph`, a lazy graph structure on arbitrary (hashable+eq) types, with basic graph functions that work even on infinite graphs, and printing to DOT.
- `RoseTree`, a tree with an arbitrary number of children and its associated - `PHashtbl`, a polymorphic hashtable (with open addressing)
zipper - `RAL`, a random-access list structure, with `O(1)` cons/hd/tl and `O(ln(n))` access to elements by their index.
- `RoseTree`, a tree with an arbitrary number of children and its associated zipper
- `SmallSet`, a sorted list implementation behaving like a set.
- `UnionFind`, a functorial imperative Union-Find structure - `UnionFind`, a functorial imperative Union-Find structure
- `Univ`, a universal type encoding with affectation
### Others ### Others

8
doc/intro.txt
View file

@ -115,19 +115,15 @@ This list is not necessarily up-to-date.
{!modules: {!modules:
AbsSet AbsSet
Automaton
Bij Bij
FlatHashtbl CSM
Hashset
Heap
Heap
LazyGraph LazyGraph
PHashtbl PHashtbl
PrintBox PrintBox
RAL RAL
RoseTree RoseTree
SmallSet SmallSet
SplayMap
SplayTree
UnionFind UnionFind
Univ Univ
} }