Index of modules

Parsing of command line arguments.

Decipher command line arguments of the form <value> | <key>=<value>,...

Array operations.

Float arrays with packed representation.

Zero-dimensional arrays.

One-dimensional arrays.

Two-dimensional arrays.

Three-dimensional arrays.

Array operations.

Float arrays with packed representation (labeled functions).

Helpers to produce Parsetree fragments

Check AST invariants

Ast_iterator.iterator enables AST inspection using open recursion.

The interface of a -ppx rewriter

Auxiliary AST types used by parsetree and typedtree.

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

Attributes

Helpers for attributes

Large, multi-dimensional, numerical arrays.

Boolean values.

Extensible buffers.

Rewrite paths for reproducible builds

Support for some of the builtin attributes

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.

Compiling C files and building C libraries

Class fields

Character operations.

Classes

Class expressions

Command line flags

Complex numbers.

Condition variables to synchronize between threads.

System configuration

Consistency tables: for checking consistency of module CRCs

Class signatures

Class structures

Class type fields

Class type expressions

Module dependencies.

MD5 message digest.

Documentation comments

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

Either type.

Ephemerons and weak hash tables.

First-class synchronous communication.

Expressions

Operations on file names.

Floating-point arithmetic.

Optimization parameters represented as floats indexed by round number.

Pretty-printing.

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.

Uniform interface for common data structures over various things.

Includes

Integer values.

32-bit integers.

64-bit integers.

Optimization parameters represented as ints indexed by round number.

Ephemerons with one key.

Emphemerons with two keys.

Emphemerons with arbitrary number of keys of the same type.

File operations on large files.

File operations on large files.

Deferred computations.

The lexical analyzer

The run-time library for lexers generated by ocamllex.

List operations.

List operations.

Management of include directories.

This module provides some facilities for creating references (and hash tables) which can easily be snapshoted and restored to an arbitrary version.

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

Module bindings

Module declarations

Memprof is a sampling engine for allocated memory words.

Miscellaneous useful types and functions

Module expressions

Extra labeled libraries.

Module substitutions

Module type declarations

Module type expressions

Locks for mutual exclusion.

Processor-native integers.

Modules about numbers, some of which satisfy Identifiable.S.

Operations on internal representations of values.

Precedence level and associativity of operators

Object fields

Operations on objects

Opens

Option values.

Entry points in the parser

Abstract syntax tree produced by parsing

The run-time library for parsers generated by ocamlyacc.

Patterns

Driver for the parser and external preprocessors.

Pretty-printers for Parsetree

Raw printer for Parsetree

Facilities for printing exceptions and inspecting current call stack.

Formatted output functions.

Compiler performance recording

First-in first-out queues.

Pseudo-random number generators (PRNG).

Result values.

Row fields

Formatted input functions.

Semaphores

Functional iterators.

Sets over ordered types.

Signature items

Last-in first-out stacks.

Standard labeled libraries.

The OCaml Standard library.

Structure items

Regular expressions and high-level string processing

Streams and parsers.

Strings.

Strings.

Kosaraju's algorithm for strongly connected components.

Auxiliary type for reporting syntax errors

System interface.

Target processor-native integers.

Type extensions

Basic interface to the terminfo database

Lightweight threads for Posix 1003.1c and Win32.

Type expressions

Type declarations

Unicode characters.

Unit values.

Interface to the Unix system.

Interface to the Unix system.

Value declarations

Value bindings

Warning definitions

Arrays of weak pointers and hash sets of weak pointers.