Index of modules


A
AdaptMap [CCLinq]
AdaptSet [CCLinq]
App_parse [Containers_string]
Arr [CCThread]
Array of threads
Arr [CCAllocCache]
Array [CCLinq]
Array [CCRingBuffer.S]
The module type of Array for this ring buffer
Array [CCRingBuffer]
The abstract type for arrays
Array [Containers]
Assoc [CCList]

B
Barrier [CCThread]
Batch [Containers_advanced]
Bool [CCArray1]
Bool [Containers]
Byte [CCRingBuffer]
An efficient byte based ring buffer
Byte [CCRingBuffer.Array]
Efficient array version for the char type

C
CCAllocCache
Simple Cache for Allocations
CCApp_parse
Applicative Parser Combinators
CCArray
Array utils
CCArray1
Bigarrays of dimension 1
CCBV
Imperative Bitvectors
CCBatch
Batch Operations on Collections Define and combine operations on a collection of elements, then run the composition of those operations on some collection.
CCBigstring
Interface to 1-dimension Bigarrays of bytes (char)
CCBitField
Bit Field
CCBlockingQueue
Blocking Queue
CCBloom
Bloom Filter
CCBool
Basic Bool functions
CCCache
Caches
CCCat
Categorical Constructs
CCChar
Utils around char
CCDeque
Imperative deque
CCError
Error Monad
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
CCHashconsedSet
Hashconsed Sets
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
CCKMP
Knuth-Morris-Pratt
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
CCLevenshtein
Levenshtein distance
CCLinq
LINQ-like operations on collections
CCList
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
CCMonadIO
IO Monad
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
CCPrint
Printer Combinators
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
CCSexpM
Simple and efficient S-expression parsing/printing
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
Cat [Containers_advanced]
Chan [CCApp_parse]
Char [Containers]
Containers
Drop-In replacement to Stdlib
Containers_advanced
Containers_io_is_deprecated
CCIO has moved into Containers, the main library.
Containers_string
Counter [Containers.Hashtbl]

D
D [CCSexpM]
Decoder that just blocks when input is not available
Dot [CCGraph]
Dot [CCKTree]

E
Error [Containers]
Event [CCGraph.Traverse]
More detailed interface

F
F [CCCat.FREE_MONAD]
File [CCMonadIO]
File [CCIO]
Float [CCArray1.View]
Float [CCArray1]
Float [Containers]
Format [Containers]
Fun [Containers]
Fut [CCPool.Make]
Futures

H
Hash [Containers]
Hashtbl [Containers]

I
ID_MONAD [CCSexpM]
The monad that just uses blocking calls as bind
IO [CCLinq]
Idx [CCList]
Index [CCLevenshtein.S]
Infix [CCUnix]
Infix [CCLinq]
Infix [CCPool.Make.Fut]
Infix [CCArray1.S]
Infix [CCApp_parse]
Infix [CCRAL]
Infix [CCLazy_list]
Infix [CCKList]
Infix [CCResult]
Infix [CCFloat]
Infix Operators
Infix [CCInt]
Infix Operators
Infix [CCOpt]
Infix [CCList]
Infix [CCError]
Int [CCArray1.View]
Int [CCArray1]
Int [Containers]
Int64 [Containers]

K
KMP [Containers_string]
Key [CCHet]

L
LazyTree [CCGraph]
Levenshtein [Containers_string]
Linq [Containers_advanced]
List [CCLinq]
List [Containers]
LockRef [CCLock]
Type allowing to manipulate the lock as a reference

M
M [CCCat.MONAD_TRANSFORMER]
Make [CCBatch]
Functor
Make [CCPool]
Create a new Pool
Make [CCLevenshtein]
Make [CCKMP]
Make [CCApp_parse]
Make [CCWBTree]
Make [CCHashTrie]
Functors
Make [CCBitField]
Create a new bitfield type
Make [CCHashSet]
Make [CCHashconsedSet]
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 [CCHash]
Make [CCHeap]
Make' [Containers.Hashtbl]
MakeArray [CCTrie]
MakeBidir [CCMultiMap]
MakeCounter [CCHashtbl]
Create a new counter type The type t is exposed
MakeDecode [CCSexpM]
MakeDefault [Containers.Hashtbl]
MakeDefault [CCHashtbl]
MakeFree [CCCat]
MakeFreeFold [CCCat]
MakeFromArray [CCRingBuffer]
Makes a ring buffer module with the given array type.
MakeFromReader [CCApp_parse]
MakeFull [CCWBTree]
Use the custom X.weight function
MakeIO [CCPrint]
Example:
 module PrintLwt = CCPrint.MakeIO(struct
    include Lwt
    type output = Lwt_io.output_channel
    let write = Lwt_io.write
  end);;

  PrintLwt.printl Lwt_io.stdout (CCList.pp CCInt.pp) [1;2;3;4];;
  - : unit Lwt.t
MakeList [CCTrie]
Map [CCHet]
Immutable map
Map [CCGraph]
Map [Containers]
MemoTbl [CCParse]
Monad [CCFun]
MonadIO [Containers_advanced]

O
Option [Containers]

P
PMap [CCLinq]
Polymorphic Maps
Pair [Containers]
Parse [Containers_string]

R
Random [Containers]
Raw [CCMonadIO]
Low level access
Ref [Containers]
Ref [CCList]
Result [Containers]

S
Seq [CCMonadIO]
Seq [CCGraph]
Set [Containers]
Set [CCList]
Split [CCString]
Str [CCApp_parse]
String [CCTrie]
String [Containers]
Sub [CCString]
Sub [CCArray]

T
Tbl [CCHet]
Imperative table indexed by CCHet.Key
Transient [CCHashTrie]
Transient Identifiers
Traverse [CCSexp]
Traverse [CCGraph]
Traverse [CCKList]
Traverse [CCResult]
Traverse [CCList]
Traverse [CCError]

U
U [CCParse]

V
Vector [Containers]
View [CCArray1]

W
WrapMonad [CCCat]
Implement the applicative and functor modules from only return and bind

Z
Zipper [CCList]