Index of modules

Parsing of command line arguments.

Decipher command line arguments of the form <value> | <key>=<value>,... (as used for example for the specification of inlining parameters varying by simplification round).

Flags that control rational arithmetic.

Array operations.

One-dimensional arrays.

Two-dimensional arrays.

Three-dimensional arrays.

Array operations.

Helpers to produce Parsetree fragments

Check AST invariants

Ast_iterator.iterator allows to implement AST inspection using open recursion.

The interface of a -ppx rewriter

Auxiliary AST types used by parsetree and typedtree.

Helpers for attributes

Operations on arbitrary-precision integers.

Large, multi-dimensional, numerical arrays.

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.

Class fields

Character operations.

Classes

Class expressions

Optimization parameters represented as ints indexed by round number.

Complex numbers.

Condition variables to synchronize between threads.

Class signatures

Class structures

Class type fields

Class type expressions

Module dependencies.

MD5 message digest.

Documentation comments

Dynamic loading of object files.

Ephemerons and weak hash table

First-class synchronous communication.

Expressions

Operations on file names.

Optimization parameters represented as floats indexed by round number.

Pretty printing.

Memory management control and statistics; finalised values.

A generic lexical analyzer.

Machine-independent graphics primitives.

Additional graphics primitives for the X Windows system.

Hash tables and hash functions.

Uniform interface for common data structures over various things.

Includes

32-bit integers.

64-bit integers.

File operations on large files.

File operations on large files.

Operations on large files.

Deferred computations.

The run-time library for lexers generated by ocamllex.

List operations.

List operations.

Source code locations (ranges of positions), used in parsetree.

Long identifiers, used in parsetree.

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 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 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.

Module bindings

Module declarations

protect_refs l f temporarily sets r to v for each R (r, v) in l while executing f.

Module expressions

Extra labeled libraries.

Module type declarations

Module type expressions

Locks for mutual exclusion.

Processor-native integers.

Operation on arbitrary-precision numbers.

Modules about numbers that satisfy Identifiable.S.

Operations on internal representations of values.

Operations on objects

Opens

Entry points in the parser

Abstract syntax tree produced by parsing

The run-time library for parsers generated by ocamlyacc.

Patterns

The initially opened module.

Facilities for printing exceptions and inspecting current call stack.

Formatted output functions.

First-in first-out queues.

Pseudo-random number generators (PRNG).

Operation on rational numbers.

Formatted input functions.

Sets over ordered types.

Signature items

Sorting and merging lists.

Profiling of a program's space behaviour over time.

Last-in first-out stacks.

Standard labeled libraries.

Regular expressions and high-level string processing

Structure items

Streams and parsers.

String operations.

String operations.

Kosaraju's algorithm for strongly connected components.

Auxiliary type for reporting syntax errors

System interface.

Type extensions

Lightweight threads for Posix 1003.1c and Win32.

Thread-compatible system calls.

Compiler performance recording

Type expressions

Type declarations

Unicode characters.

Interface to the Unix system.

Interface to the Unix system.

Value declarations

Value bindings

Arrays of weak pointers and hash sets of weak pointers.