Index of modules

Parsing of command line arguments.

Float arrays with packed representation.

Array operations.

Zero-dimensional arrays.

One-dimensional arrays.

Two-dimensional arrays.

Three-dimensional arrays.

Float arrays with packed representation (labeled functions).

Array operations.

This module provides a purely sequential implementation of the concurrent atomic references provided by the Multicore OCaml standard library:

Large, multi-dimensional, numerical arrays.

Boolean values.

Extensible buffers.

Byte sequence operations.

Byte sequence operations.

Registering OCaml values with the C runtime.

Run-time support for lazy values.

Run-time support for recursive modules.

Run-time support for objects and classes.

Character operations.

Complex numbers.

Condition variables to synchronize between threads.

MD5 message digest.

Dynamic loading of .cmo, .cma and .cmxs files.

Either type.

Ephemerons and weak hash tables.

First-class synchronous communication.

Operations on file names.

Floating-point arithmetic.

Pretty-printing.

Using the Format module

Function manipulation.

Memory management control and statistics; finalised values.

Hash tables on generic containers with notion of death and aliveness.

A generic lexical analyzer.

Hash tables and hash functions.

Input channels.

Integer values.

32-bit integers.

64-bit integers.

Ephemerons with one key.

Ephemerons with two keys.

Ephemerons with arbitrary number of keys of the same type.

File operations on large files.

File operations on large files.

Deferred computations.

The run-time library for lexers generated by ocamllex.

List operations.

List operations.

Functor building an implementation of the weak hash set structure.

Functor building an implementation of the set structure given a totally ordered type.

Functor building an implementation of the set structure given a totally ordered type.

Functor building an implementation of the map structure given a totally ordered type.

Functor building an implementation of the hashtable structure.

Functor building an implementation of the map structure given a totally ordered type.

Functor building an implementation of the hashtable structure.

Functor building an implementation of a weak hash table

Functor building an implementation of a weak hash table

Functor building an implementation of a weak hash table

Functor building an implementation of the hashtable structure.

Functor building an implementation of the hashtable structure.

Functor building an implementation of an hash table that use the container for keeping the information given

Functor building an implementation of a weak hash table.

Functor building an implementation of a weak hash table.

Functor building an implementation of a weak hash table.

Association tables over ordered types.

Marshaling of data structures.

Memprof is a sampling engine for allocated memory words.

Extra labeled libraries.

Locks for mutual exclusion.

Processor-native integers.

Operations on internal representations of values.

Precedence level and associativity of operators

Operations on objects

Option values.

Output channels.

The run-time library for parsers generated by ocamlyacc.

Facilities for printing exceptions and inspecting current call stack.

Formatted output functions.

First-in first-out queues.

Pseudo-random number generators (PRNG).

Result values.

Formatted input functions.

Semaphores

Sequences.

Sets over ordered types.

Last-in first-out stacks.

Standard labeled libraries.

The OCaml Standard library.

Regular expressions and high-level string processing

Streams and parsers.

Strings.

Strings.

System interface.

Lightweight threads for Posix 1003.1c and Win32.

Unicode characters.

Unit values.

Interface to the Unix system.

Interface to the Unix system.

Arrays of weak pointers and hash sets of weak pointers.