randomly permute an array.

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

A bag is a data structure like a set, except that:

Extensible string buffers.

Types and exceptions

Utility functions for marshalling to and from bigstring

As with integers, floats can be be packed big endian or little endian, depending on the order in which the bytes of the float are layed out.

Simple boolean language: propositional logic

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

purely functional command line parsing

Basic types and definitions required throughout the system.

Inherit comparability from a component.

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.

Parsing of command line arguments.

Maximum length of a normal array.

Character operations.

timedwait cond mtx timeout waits on condition variable cond with mutex mtx until either the condition is signalled, or until timeout expires.

Warning! this library assumes we are in a POSIX compliant OS.

Memory management control and statistics; finalised values.

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

Values returned by hash must be non-negative.

mod and div operators that have the right behavior on negative numbers, that is, x % y always returns a value between 0 and y-1.

The size of Int63 is always at least 63 bits.

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 the Map module for Core.Std.

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

lock mtx locks mtx, possibly waiting for it to be released first by another thread.

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 the Set module for Core.Std.

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

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.

Core_stack is a replacement for OCaml's standard Stack module that follows Core idioms and adds some functions.

An extension of the standard StringLabels.

System interface.

Lightweight threads.

File descriptor.

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.

Crc functions

daemonize makes the executing process a daemon.

converts a string to a date, in formats: * m/d/y * y-m-d (* valid iso8601_extended *) * DD MMM YYYY * DDMMMYYYY * YYYYMMDD

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

doubly-linked lists

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.

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

Min-heap implementation, adapted from CLR.

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.

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.

Module for simple closed intervals over arbitrary types that are ordered correctly using polymorphic compare.

Module for simple closed intervals over arbitrary types that are ordered correctly using polymorphic compare.

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

Interface to Linux-specific system calls

Mutual exclusion between processes using flock and lockf.

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.

create like Mutex.create, but creates an error-checking mutex.

create () returns a new, unlocked mutex.

add t s shifts the time of day t by the span s.

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.

Type for tracking errors in an Error.t.

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

piece-wise linear interpolation from float-like types to float

Interfaces used for hiding and replacing polymorphic compare.

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.

of_system_int and to_system_int return and take respectively a signal number corresponding to those in the system's /usr/include/bits/signum.h (or equivalent).

The raison d'etre for Space_safe_tuple<N> is that OCaml doesn't properly free variables matched in tuple patterns.

Basic operations on spans

Thread-safe queue module, using locks.

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.

This module is here to avoid holding the runtime lock when doing an open_in_gen lock.

Our time module.

Timed events

The difference between Hashable and Hashable_t functors is that the former's result type doesn't contain type t and the latter does.

Disjoint-sets.

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

universal/heterogeneous maps

If unpack_one : ('value, 'partial_unpack) unpack_one, then unpack_one buf ?pos ?len ?partial_unpack must unpack at most one value of type 'value from buf starting at pos, and not using more than len characters.

of_string s accepts three-character abbreviations with any capitalization

find name looks up a t by its name and returns it.