| Backtrace | |
| Bag |
A bag is a data structure like a set, except that:
|
| Bigbuffer |
Bigbuffer
|
| Bigstring |
Types and exceptions
|
| Binary_packing |
unpack a signed 1 byte int from the given buf starting at pos
|
| Bool | |
| Caml | |
| Comparable |
Inherit comparability from a component.
|
| Container | |
| Core_arg | |
| Core_array |
A better Array module.
|
| Core_char |
Predicates
|
| Core_filename | make_absolute ~dir file
If file is relative, returns the path of the file file relative to
directory dir.
|
| Core_gc |
Memory management control and statistics; finalised values.
|
| Core_hashtbl | Hashtbl.find_exn
|
| Core_int | |
| Core_int32 | |
| Core_int64 | |
| Core_list |
Tail recursive version of standard List functions, plus
additional operations.
|
| Core_mutex |
A fast_mutex is just like a mutex, except that it uses try_lock to acquire
locks, and is hence faster when it acquires the lock.
|
| Core_nativeint | |
| Core_printf |
failwith and invalid_arg accepting printf's format.
|
| Core_queue |
Core_queue is a re-implementation of OCaml's standard Queue module that
follows Core idioms and adds some functions.
|
| Core_sexp | |
| Core_stack |
Core_stack is a replacement for OCaml's standard Stack module that follows
Core idioms and adds some functions.
|
| Core_string |
An extension of the standard StringLabels.
|
| Core_sys | |
| Core_unix |
Interface to the Unix system.
|
| Crc |
Crc functions
|
| Dequeue |
An array that can shrink and expand on both ends - the minimum index needs not be 0.
|
| Doubly_linked |
creating doubly-linked lists
|
| Equatable | |
| Error_check | |
| Exn |
Raised when finalization after an exception failed, too.
|
| Fast_hashtbl |
Hashtbl which stores a reference to the data for faster replace.
|
| Float |
Ordinary t-only nan test.
|
| Floatable | |
| Force_once |
A "force_once" is a thunk that can only be forced once.
|
| Fqueue |
Simple implementation of a polymorphic functional queue.
|
| Hash_queue | |
| Hash_set | |
| Hashable | |
| Heap |
Min-heap implementation, adapted from CLR.
|
| In_channel |
In_channel collects all of the pervasive functions that work on in_channels.
|
| Int_conversions | |
| Int_intf | |
| Interfaces | |
| Interned | |
| Interval_set | |
| Linebuf |
Line-by-line reading of a file.
|
| Linux_ext |
Interface to Linux-specific system calls
|
| Memo |
Memoization code
|
| Monad | t >>= f returns a computation that sequences the computations
represented by two monad elements.
|
| Month | of_string s accepts three-character abbreviations with any capitalization
|
| Option |
Options form a monad, where
return x = Some x
None >>= f = None
Some x >>= f = f x
|
| Ordered_collection_common | |
| Out_channel | |
| PSet |
Polymorphic set module.
|
| Piecewise_linear |
piece-wise linear interpolation from float-like types to float
|
| Pretty_printer | |
| Quickcheck |
Module for easily generating unit tests.
|
| Ref | equal t1 t2 returns true if t1 and t2 are the same ref cell.
|
| Result | |
| Robustly_comparable | |
| Setable | |
| Sexpable | |
| Space_safe_tuple |
The raison d'ĂȘtre for Space_safe_tuple<N> is that OCaml doesn't properly
free variables matched in tuple patterns.
|
| Squeue | create maxsize returns a synchronized queue bounded to have no more than
maxsize elements.
|
| Std | |
| Stringable | |
| Thread_safe_queue |
There are four variants of thread-safe queue, depending on whether there
are one/many readers or one/many writers.
|
| Timer |
Timed events
|
| Tuple | |
| Unique_id |
an abstract unique identifier based on 64 bit integers.
|
| Unix_ext |
Interface to additional Unix-system calls
|
| Word_size |