randomly permute an array.

This module implements a very low level interface to a mutable AVL tree.

Imperative set-like data structure.

Extensible string buffers based on Bigstrings.

Utility functions for marshalling to and from bigstring

String type based on Bigarray, for use in I/O and C-bindings

Packs and unpacks various types of integers into and from strings.

A simple boolean domain-specific language

A Bounded_int_table is a table whose keys can be mapped to integers in a fixed range, 0 ...

create measure value creates a t from value units of the given measure.

Basic types and definitions required throughout the system.

A signature for a commutative group (in the group-theory sense).

Used for specifying a bound (either upper or lower) as inclusive, exclusive, or unbounded.

lexicographic cmps x y compares x and y lexicographically using functions in the list cmps.

A Comparator.t is a type-indexed value that allows you to compare (and for generating error messages, serialize) values of the type in question.

The idiom for using Container.Make is to bind the resulting module and to explicitly import each of the functions that one wants:

Parsing of command line arguments.

Maximum length of a normal array.

Character operations.

Memory management control and statistics; finalised values.

Values returned by hash must be non-negative.

For many students of ocaml, using hashtables is complicated by the functors.

The size of Int63 is always at least 63 bits.

ceil_pow2 x returns the smallest power of 2 that is greater than or equal to x.

A value of type 'a Lazy.t is a deferred computation, called a suspension, that has a result of type 'a.

Tail recursive version of standard List functions, plus additional operations.

This module defines interfaces used in Core.Std.Map.

This module defines the Map module for Core.Std.

This module is here to ensure that we don't use the functions in Caml.Printexc inadvertently

Formatting error and exit functions

Core_queue is a wrapper around OCaml's standard Queue module that follows Core idioms and adds some functions.

Pseudo-random number generators (PRNG).

This module defines interfaces used in Core.Std.Set.

This module defines the Set module for Core.Std.

no_raise is the identity, but by using 'a no_raise in a sexpable type, the resulting use sexp_of_no_raise protects the conversion of 'a to a sexp so that if it fails, one gets a sexp with an error message about the failure, rather than an exception being raised.

A stack implemented with an array.

An extension of the standard StringLabels.

Weak is like the OCaml standard library module of the same name, except that it requires that the values in the weak set are heap blocks.

For representing a day of the week.

A double ended queue that can shrink and expand on both ends.

doubly-linked lists

This module defines signatures that are to be included in other signatures to ensure a consistent interface to equal functions.

failwiths message value sexp_of_value raises an exception with the supplied message and value, by constructing an Error.t and using Error.raise.

Raised when finalization after an exception failed, too.

module Flags implements Unix-style sets of flags that are represented as an int with various bits set, one bit for each flag.

See flags_intf.ml for documentation.

Floating-point representation and utilities.

various combinators for functions

A "force_once" is a thunk that can only be forced once.

A simple polymorphic functional queue.

A hash-heap is a combination of a heap and a hashtbl that supports constant time lookup, and log(n) time removal and replacement of elements in addition to the normal heap operations.

a hash-queue, where the values are of type 'a

A heap block is a value that is guaranteed to live on the OCaml heap, and is hence guaranteed to be usable with finalization or in a weak pointer.

Min-heap implementation, adapted from CLR.

a signature for opaque identifier types.

In_channel collects all of the pervasive functions that work on in_channels.

Info is a library for lazily constructing human-readable information as a string or sexp, with a primary use being error messages.

Provides a functor for creating an interned string type.

An implementation of compressed integer sets using lists of integer ranges.

This module defines signatures that are to be included in other signatures to ensure a consistent interface to invariant-style functions.

A stack implemented with a list.

Memoization code -- not re-entrant!

t >>= f returns a computation that sequences the computations represented by two monad elements.

of_string s accepts three-character abbreviations with 3 capitalizations (e.g.

An uninhabited type.

This module can be used to safely expose functions and values in signatures that can only be used in unit tests.

Option wraps the output x of successful functions in Some x.

normalize length_fun thing_with_length i is just i, unless i is negative, in which case it's length_fun thing_with_length + i.

Ordering is intended to make code that matches on the result of a comparison more concise and easier to read.

Type for tracking errors in an Error.t.

Outputs a list of lines, each terminated by a newline character

Interfaces used for hiding and replacing polymorphic compare.

ascending is identical to compare.

A list of pretty printers for various types, for use in toplevels.

Module for easily generating unit tests.

swap t1 t2 swaps the values in t1 and t2.

Result is often used to handle error messages.

This module implements an option ref that starts out as None, and may be set only once.

An interface for stacks that follows Core's conventions, as opposed to OCaml's standard Stack module.

A type for making staging explicit in the type of a function.

stable_dedup Same as dedup but maintains the order of the list and doesn't allow compare function to be specified (otherwise, the implementation in terms of Set.t would hide a heavyweight functor instantiation at each call).

create ?pos ?len base creates a substring of the base sequence of * length len starting at position pos, i.e.

Functors and signatures for dealing with modules for tuples.

For representing type equalities otherwise not known by the type-checker.

Imperative data structure for representing disjoint sets.

Signature for use by module : Unique_id.

Functors for creating modules that mint unique identifiers.

Module for the type unit.

Universal/heterogeneous maps.

An extensible "universal" variant type, that can be extended by adding new constructors with arguments of arbitrary type.

A buffer for incremental decoding of an input stream.

For making an abstract version of a type that ensures a validation check has passed.

See Validated_intf for documentation.

A module for organizing validations of data structures.

This is include'd and documented in module: Common.

For determining the word size that the program is using.