A | |
| Arr [CCThread] |
Array of threads
|
| Array [CCRingBuffer.S] |
The module type of Array for this ring buffer
|
| Array [CCRingBuffer] |
The abstract type for arrays
|
| Array [Containers] | |
| ArrayLabels [Containers] | |
| Array_slice [Containers] | |
| Assoc [CCListLabels] | |
| Assoc [CCList] | |
B | |
| Barrier [CCThread] | |
| Bool [Containers] | |
| Byte [CCRingBuffer] |
An efficient byte based ring buffer
|
| Byte [CCRingBuffer.Array] |
Efficient array version for the
char type
|
C | |
| CCArray |
Array utils
|
| CCArrayLabels |
Array utils
|
| CCArray_slice |
Array Slice
|
| CCBV |
Imperative Bitvectors
|
| CCBitField |
Bit Field
|
| CCBlockingQueue |
Blocking Queue
|
| CCBool |
Basic Bool functions
|
| CCCache |
Caches
|
| CCChar |
Utils around char
|
| CCDeque |
Imperative deque
|
| CCEqual |
Equality Combinators
|
| CCFQueue |
Functional queues
|
| CCFlatHashtbl |
Open-Addressing Hash-table
|
| CCFloat |
Basic Float functions
|
| CCFormat |
Helpers for Format
|
| CCFun |
Basic Functions
|
| CCGraph |
Simple Graph Interface
|
| CCHash |
Hash combinators
|
| CCHashSet |
Mutable Set
|
| CCHashTrie |
Hash Tries
|
| CCHashtbl |
Extension to the standard Hashtbl
|
| CCHeap |
Leftist Heaps following Okasaki
|
| CCHet |
Associative containers with Heterogenerous Values
|
| CCIO |
IO Utils
|
| CCImmutArray |
Immutable Arrays
|
| CCInt |
Basic Int functions
|
| CCInt64 |
Int64
|
| CCIntMap |
Map specialized for Int keys
|
| CCKList |
Continuation List
|
| CCKTree |
Lazy Tree Structure
This structure can be used to represent trees and directed
graphs (as infinite trees) in a lazy fashion.
|
| CCLazy_list |
Lazy List
|
| CCList |
complements to list
|
| CCListLabels |
complements to list
|
| CCLock |
Utils around Mutex
|
| CCMap |
Extensions of Standard Map
|
| CCMixmap |
Maps with Heterogeneous Values
|
| CCMixset |
Set of Heterogeneous Values
|
| CCMixtbl |
Hash Table with Heterogeneous Keys
|
| CCMultiMap |
Multimap
|
| CCMultiSet |
Multiset
|
| CCOpt |
Options
|
| CCOrd |
Comparisons
|
| CCPair |
Tuple Functions
|
| CCParse |
Very Simple Parser Combinators
|
| CCPersistentArray |
Persistent Arrays
|
| CCPersistentHashtbl |
Persistent hash-table on top of OCaml's hashtables
|
| CCPool |
Thread Pool, and Futures
|
| CCRAL |
Random-Access Lists
|
| CCRandom |
Random Generators
|
| CCRef |
References
|
| CCResult |
Error Monad
|
| CCRingBuffer |
Circular Buffer (Deque)
|
| CCSemaphore |
Semaphores
|
| CCSet |
Wrapper around Set
|
| CCSexp |
Handling S-expressions
|
| CCSexp_lex | |
| CCSimple_queue |
Functional queues (fifo)
|
| CCString |
Basic String Utils
|
| CCThread |
Threads
|
| CCTimer |
Event timer
|
| CCTrie |
Prefix Tree
|
| CCUnix |
High-level Functions on top of Unix
|
| CCVector |
Growable, mutable vector
|
| CCWBTree |
Weight-Balanced Tree
|
| CCZipper |
List Zipper
|
| Char [Containers] | |
| Containers |
Drop-In replacement to Stdlib
|
D | |
| Decoder [CCSexp] | |
| Dot [CCGraph] | |
| Dot [CCKTree] | |
| Dump [CCFormat] | |
E | |
| Equal [Containers] | |
| Event [CCGraph.Traverse] |
More detailed interface
|
F | |
| File [CCIO] | |
| Find [CCString] | |
| Float [Containers] | |
| Format [Containers] | |
| Fun [Containers] | |
| Fut [CCPool.Make] |
Futures
|
H | |
| Hash [Containers] | |
| Hashtbl [Containers] | |
| Heap [Containers] | |
I | |
| IO [Containers] | |
| Infix [CCUnix] | |
| Infix [CCPool.Make.Fut] | |
| Infix [CCSimple_queue] | |
| Infix [CCRAL] | |
| Infix [CCLazy_list] | |
| Infix [CCKList] | |
| Infix [CCEqual] | |
| Infix [CCListLabels] | |
| Infix [CCParse] | |
| Infix [CCResult] | |
| Infix [CCOrd] | |
| Infix [CCFloat] |
Infix Operators
|
| Infix [CCInt] |
Infix Operators
|
| Infix [CCOpt] | |
| Infix [CCList] | |
| Int [Containers] | |
| Int64 [Containers] | |
K | |
| Key [CCHet] | |
L | |
| Lazy_tree [CCGraph] | |
| List [Containers] | |
| ListLabels [Containers] | |
| LockRef [CCLock] |
Type allowing to manipulate the lock as a reference
|
M | |
| Make [CCPool] |
Create a new Pool
|
| Make [CCWBTree] | |
| Make [CCHashTrie] |
Functors
|
| Make [CCBitField] |
Create a new bitfield type
|
| Make [CCHashSet] | |
| Make [CCRingBuffer] |
Buffer using regular arrays
|
| Make [CCRingBuffer.Array] |
Makes an array given an arbitrary element type
|
| Make [CCMixmap] | |
| Make [CCPersistentHashtbl] | |
| Make [CCFlatHashtbl] | |
| Make [CCTrie] | |
| Make [CCMultiSet] | |
| Make [CCMultiMap] | |
| Make [CCMap] | |
| Make [CCHashtbl] | |
| Make [CCSet] | |
| Make [CCHeap] | |
| Make' [Containers.Hashtbl] | |
| MakeArray [CCTrie] | |
| MakeBidir [CCMultiMap] | |
| MakeFromArray [CCRingBuffer] |
Makes a ring buffer module with the given array type.
|
| MakeFull [CCWBTree] |
Use the custom
X.weight function
|
| MakeList [CCTrie] | |
| Map [CCHet] |
Immutable map
|
| Map [CCGraph] | |
| Map [Containers] | |
| Monad [CCFun] | |
O | |
| Option [Containers] | |
| Ord [Containers] | |
P | |
| Pair [Containers] | |
| Parse [Containers] | |
| Poly [CCHashtbl] | |
R | |
| Random [Containers] | |
| Ref [Containers] | |
| Ref [CCListLabels] | |
| Ref [CCList] | |
| Result [Containers] | |
S | |
| Seq [CCGraph] | |
| Set [Containers] | |
| Split [CCString] | |
| String [CCTrie] | |
| String [Containers] | |
| Sub [CCString] | |
T | |
| Tbl [CCHet] |
Imperative table indexed by
CCHet.Key
|
| Transient [CCHashTrie] |
Transient Identifiers
|
| Traverse [CCGraph] | |
| Traverse [CCKList] | |
| Traverse [CCListLabels] | |
| Traverse [CCResult] | |
| Traverse [CCList] | |
U | |
| U [CCParse] | |
V | |
| Vector [Containers] |