This library exposes the following toplevel modules:
CCBV
Imperative Bitvectors.CCBijection
Functor to build a bijection Represents 1-to-1 mappings between two types. Each element from the "left" is mapped to one "right" value, and conversely.CCBitField
Efficient Bit Field for up to 31 or 61 fielsCCCache
Caches UtilsCCDeque
Imperative dequeCCFQueue
Functional queuesCCFun_vec
Functional VectorsCCGraph
Simple Graph InterfaceCCHashSet
Mutable SetCCHashTrie
Hash TriesCCHet
Associative containers with Heterogeneous ValuesCCImmutArray
Immutable ArraysCCIntMap
Map specialized for Int keysCCKTree
Lazy Tree Structure This structure can be used to represent trees and directed graphs (as infinite trees) in a lazy fashion. It is a structural type.CCLazy_list
Lazy ListCCMixmap
Maps with Heterogeneous ValuesCCMixset
Set of Heterogeneous ValuesCCMixtbl
Hash Table with Heterogeneous KeysCCMultiMap
Map that can map key to several valuesCCMultiSet
MultisetCCMutHeap
Mutable HeapsCCMutHeap_intf
CCPersistentArray
Persistent ArraysCCPersistentHashtbl
Persistent hash-table on top of OCaml's hashtablesCCRAL
Random-Access ListsCCRingBuffer
Circular Buffer (Deque)CCSimple_queue
Functional queues (fifo)CCTrie
Prefix TreeCCWBTree
Weight-Balanced TreeCCZipper
List ZipperThe entry point of this library is the module: Containers_data_top
.