mirror of
https://github.com/c-cube/ocaml-containers.git
synced 2025-12-06 03:05:28 -05:00
move RAL into containers.data as CCRAL
This commit is contained in:
parent
c6e3471ae5
commit
f4381a736f
5 changed files with 5 additions and 3 deletions
|
|
@ -138,6 +138,8 @@ Documentation [here](http://cedeela.fr/~simon/software/containers).
|
||||||
- `CCGraph`, a small collection of graph algorithms
|
- `CCGraph`, a small collection of graph algorithms
|
||||||
- `CCBitField`, a type-safe implementation of bitfields that fit in `int`
|
- `CCBitField`, a type-safe implementation of bitfields that fit in `int`
|
||||||
- `CCWBTree`, a weight-balanced tree, implementing a map interface
|
- `CCWBTree`, a weight-balanced tree, implementing a map interface
|
||||||
|
- `CCRAL`, a random-access list structure, with `O(1)` cons/hd/tl and `O(ln(n))`
|
||||||
|
access to elements by their index.
|
||||||
|
|
||||||
### Containers.io
|
### Containers.io
|
||||||
|
|
||||||
|
|
@ -199,7 +201,6 @@ is not necessarily up-to-date.
|
||||||
- `Hashset`, a polymorphic imperative set 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.
|
- `LazyGraph`, a lazy graph structure on arbitrary (hashable+eq) types, with basic graph functions that work even on infinite graphs, and printing to DOT.
|
||||||
- `PHashtbl`, a polymorphic hashtable (with open addressing)
|
- `PHashtbl`, a polymorphic hashtable (with open addressing)
|
||||||
- `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
|
- `RoseTree`, a tree with an arbitrary number of children and its associated zipper
|
||||||
- `SmallSet`, a sorted list implementation behaving like a set.
|
- `SmallSet`, a sorted list implementation behaving like a set.
|
||||||
- `UnionFind`, a functorial imperative Union-Find structure
|
- `UnionFind`, a functorial imperative Union-Find structure
|
||||||
|
|
|
||||||
4
_oasis
4
_oasis
|
|
@ -85,7 +85,7 @@ Library "containers_data"
|
||||||
CCPersistentHashtbl, CCDeque, CCFQueue, CCBV, CCMixtbl,
|
CCPersistentHashtbl, CCDeque, CCFQueue, CCBV, CCMixtbl,
|
||||||
CCMixmap, CCRingBuffer, CCIntMap, CCPersistentArray,
|
CCMixmap, CCRingBuffer, CCIntMap, CCPersistentArray,
|
||||||
CCMixset, CCHashconsedSet, CCGraph, CCHashSet, CCBitField,
|
CCMixset, CCHashconsedSet, CCGraph, CCHashSet, CCBitField,
|
||||||
CCHashTrie, CCBloom, CCWBTree
|
CCHashTrie, CCBloom, CCWBTree, CCRAL
|
||||||
BuildDepends: bytes
|
BuildDepends: bytes
|
||||||
FindlibParent: containers
|
FindlibParent: containers
|
||||||
FindlibName: data
|
FindlibName: data
|
||||||
|
|
@ -123,7 +123,7 @@ Library "containers_misc"
|
||||||
Path: src/misc
|
Path: src/misc
|
||||||
Pack: true
|
Pack: true
|
||||||
Modules: AbsSet, Automaton, Bij, CSM, Hashset, LazyGraph, PHashtbl,
|
Modules: AbsSet, Automaton, Bij, CSM, Hashset, LazyGraph, PHashtbl,
|
||||||
PrintBox, RAL, RoseTree, SmallSet, UnionFind, Univ, Puf,
|
PrintBox, RoseTree, SmallSet, UnionFind, Univ, Puf,
|
||||||
Backtrack
|
Backtrack
|
||||||
BuildDepends: containers, containers.data
|
BuildDepends: containers, containers.data
|
||||||
FindlibName: misc
|
FindlibName: misc
|
||||||
|
|
|
||||||
|
|
@ -79,6 +79,7 @@ CCMultiMap
|
||||||
CCMultiSet
|
CCMultiSet
|
||||||
CCPersistentArray
|
CCPersistentArray
|
||||||
CCPersistentHashtbl
|
CCPersistentHashtbl
|
||||||
|
CCRAL
|
||||||
CCRingBuffer
|
CCRingBuffer
|
||||||
CCTrie
|
CCTrie
|
||||||
CCWBTree
|
CCWBTree
|
||||||
|
|
|
||||||
Loading…
Add table
Reference in a new issue