Index of modules

Array of threads

The module type of Array for this ring buffer

The abstract type for arrays

An efficient byte based ring buffer

Efficient array version for the char type

Array utils

Array utils

Array Slice

Imperative Bitvectors

Bit Field

Blocking Queue

Basic Bool functions

Caches

Utils around char

Imperative deque

Equality Combinators

Functional queues

Open-Addressing Hash-table

Basic Float functions

Helpers for Format

Basic Functions

Simple Graph Interface

Hash combinators

Mutable Set

Hash Tries

Extension to the standard Hashtbl

Leftist Heaps following Okasaki

Associative containers with Heterogenerous Values

IO Utils

Immutable Arrays

Basic Int functions

Int64

Map specialized for Int keys

Continuation List

Lazy Tree Structure This structure can be used to represent trees and directed graphs (as infinite trees) in a lazy fashion.

Lazy List

complements to list

complements to list

Utils around Mutex

Extensions of Standard Map

Maps with Heterogeneous Values

Set of Heterogeneous Values

Hash Table with Heterogeneous Keys

Multimap

Multiset

Options

Comparisons

Tuple Functions

Very Simple Parser Combinators

Persistent Arrays

Persistent hash-table on top of OCaml's hashtables

Thread Pool, and Futures

Random-Access Lists

Random Generators

References

Error Monad

Circular Buffer (Deque)

Semaphores

Wrapper around Set

Handling S-expressions

Basic String Utils

Threads

Event timer

Prefix Tree

High-level Functions on top of Unix

Growable, mutable vector

Weight-Balanced Tree

List Zipper

Drop-In replacement to Stdlib

More detailed interface

Futures

Infix Operators

Infix Operators

Type allowing to manipulate the lock as a reference

Create a new Pool

Functors

Create a new bitfield type

Buffer using regular arrays

Makes an array given an arbitrary element type

Makes a ring buffer module with the given array type.

Use the custom X.weight function

Immutable map

Imperative table indexed by CCHet.Key

Transient Identifiers