core_kernel v0.16.0

Libraries

This package provides the following libraries (via ocamlobjinfo):

weak_pointer

Documentation:

• Weak_pointer A weak pointer is a pointer to a heap block that does not cause the heap block to remain live during garbage collection.

weak_hashtbl

Documentation:

• Weak_hashtbl A hashtable that keeps a weak pointer to each key's data and uses a finalizer to detect when the data is no longer referenced (by any non-weak pointers).

weak_array

Documentation:

• Weak_array Module for dealing with weak pointers, i.e., pointers that don't prevent garbage collection of what they point to.

version_util

Documentation:

• Version_util This module gives access to the same version/build information returned by Command-based executables when called with the -version or -build-info flags by $0 version (-build-info | -version) or $0 (-build-info | -version).

vec

Documentation:

• Vec

uuid

Documentation:

• Uuid Thread-safe generation of random identifiers in the UUID format.

uopt

Documentation:

• Uopt Uopt.t is an unboxed option: an option-like type that incurs no allocation, without requiring a reserved value in the underlying type.

unpack_buffer

Documentation:

• Unpack_buffer A buffer for incremental decoding of an input stream.

univ

Documentation:

• Univ An extensible "universal" variant type.

tuple_pool

Documentation:

• Tuple_pool

total_map

Documentation:

• Total_map A map that includes an entry for every possible value of the key type.

timing_wheel

Documentation:

• Timing_wheel

thread_safe_queue

Documentation:

• Thread_safe_queue A thread-safe non-blocking queue of unbounded size.

thread_pool_cpu_affinity

Documentation:

• Thread_pool_cpu_affinity

sexp_hidden_in_test

Documentation:

• Sexp_hidden_in_test

reversed_list

Documentation:

• Reversed_list

pooled_hashtbl

Documentation:

• Pooled_hashtbl A polymorphic hashtbl that uses Pool to avoid allocation.

pairing_heap

Documentation:

• Pairing_heap Heap implementation based on a pairing-heap.

nonempty_list

Documentation:

• Nonempty_list

moption

Documentation:

• Moption A Moption is a mutable option, like 'a option ref, but with a more efficient implementation; in particular, set_some does not allocate.

limiter

Documentation:

• Limiter Implements a token-bucket-based throttling rate limiter. This module is useful for limiting network clients to a sensible query rate, or in any case where you have jobs that consume a scarce but replenishable resource.

iobuf

Documentation:

• Iobuf A non-moving (in the GC sense) contiguous range of bytes, useful for I/O operations.

int_set

Documentation:

• Int_set An implementation of compressed integer sets using lists of integer ranges. Operations such as adding and membership are O(n) where n is the number of contiguous ranges in the set. For data that is mostly serial, n should remain very small.

hash_heap

Documentation:

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

force_once

Documentation:

• Force_once A "force_once" is a thunk that can only be forced once. Subsequent forces will raise an exception.

flags

Documentation:

• Flags

fheap

Documentation:

• Fheap Functional heaps (implemented as pairing heaps).

enum

Documentation:

• Enum

composition_infix

Documentation:

• Composition_infix Infix composition operators.

caml_unix

Documentation:

• Caml_unix

caml_threads

Documentation:

• Caml_threads

bus

Documentation:

• Bus A Bus is a publisher/subscriber system within the memory space of the program. A bus has a mutable set of subscribers, which can be modified using subscribe_exn and unsubscribe.

bounded_int_table

Documentation:

• Bounded_int_table A Bounded_int_table is a table whose keys can be mapped to integers in a fixed range, 0 ... num_keys - 1, where num_keys is specified at table-creation time. The purpose of Bounded_int_table is to be faster than Hashtbl in situations where one is willing to pay a space cost for the speed.

binary_packing

Documentation:

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

balanced_reducer

Documentation:

• Balanced_reducer A Balanced_reducer.t stores a mutable fixed-length sequence of optional values, and incrementally maintains the result of folding an associative operation (reduce) over the sequence as its elements change.

ansi_kernel

Documentation:

• Ansi_kernel Common ANSI display attribute definitions.

core_kernel

Documentation:

• Core_kernel