provides support for displaying stylized text using the ANSI escape codes.

Provides in situ sorting of polymorphic arrays using the quicksort algorithm.

Provides in situ sorting of monomorphic arrays using the quicksort algorithm.

provides hashed strings that have fast equality testing.

Provides support for Base-64 encoding/decoding as specified by RFC 4648.

Provides a balanced-binary-tree implementation of the ORD_MAP signature parameterized over the key type.

Provides a balanced-binary-tree implementation of the ORD_SET signature parameterized over the element type.

Provides mutable arrays of booleans represented by one bit per element.

Provides binary search on sorted monomorphic arrays.

Provides fast, read-only, maps from 8-bit characters to values.

Provides dynamically sized polymorphic arrays.

Provides dynamically sized monomorphic arrays.

Provides a function for computing Levenshtein between distance between strings.

Provides a functional queue data structure.

Provides an implementation of the Fowler-Noll-Vo hashing algorithm.

Provides printf-style string formatting.

To be written

Provides command-line argument processing.

Provides an algorithm for computing the strongly-connected components of a directed graph.

Provides hash tables that are keyed by two different key types.

Defines an interface to a monomorphic type with an equality test and hashing function.

Provides a hash-table-based implementation of imperative sets parameterized over a Key structure.

Provides hashing functions for strings and substrings.

Provides an implementation of polymorphic hash tables.

Provides a functor that implements the MONO_HASH_TABLE signature.

Defines a representation of an abstract ordered domain that is used as an argument to the IntervalSetFn functor.

Provides sets over a discrete ordered domain, where the sets are represented by intervals.

Provides support for redirecting the standard input and output streams.

Provides a simple way to support a table of keyword (or reserved) identifiers in a scanner.

Provides a functional implementation of priority queues using leaftist heaps.

Provides some common definitions that are shared across the SML/NJ Lbrary.

Provides some utility functions for converting lists into strings (and back).

Provides a sorted-list implementation of the ORD_MAP signature parameterized over the key type.

Provides a merge-sort algorithm for lists.

Provides a sorted-list implementation of the ORD_SET signature parameterized over the element type.

Provides list combinators for computing over the "Cartesian product" of two lists.

Provides easy construction of new monomorphic array structures.

Defines an interface to imperative hash tables with monomorphic keys.

An alias to the native-sized integer structure (e.g., Int64).

An alias to the native-sized word structure (e.g., Word64).

Defines an interface to an abstract type of keys with a comparison function.

Defines an interface to finite maps over ordered keys.

Defines an interface to finite sets of ordered elements.

Provides parser combinators over character readers.

Provides support for searching for files in the file system using a list of possible locations.

Provides a extensible, but type safe, implementation of property lists.

Provides an imperative queue data structure.

Provides a simple random number generator.

Pseudo-random-number generation using the Mersenne Twister algorithm.

To be written

Provides a red-black-tree implementation of the ORD_MAP signature parameterized over the key type.

Provides a red-black-tree implementation of the ORD_SET signature parameterized over the element type.

To be written

Provides a splay-tree implementation of the ORD_MAP signature parameterized over the key type.

Provides a splay-tree implementation of the ORD_SET signature parameterized over the element type.

Provides a mechanism for limiting the execution time of a computation.

To be written

Provides mutable references with Union-Find semantics.

Provides support for working with UTF-8 encoded strings.