📦 ocaml-doc

A

• Arg(3o)Parsing of command line arguments.✨
• Arg_helper(3o)Decipher command line arguments of the form <value> | <key>=<value>,...✨
• Arg_helper.Make(3o)no description✨
• Array(3o)Array operations.✨
• ArrayLabels(3o)Array operations.✨
• Ast_helper(3o)Helpers to produce Parsetree fragments✨
• Ast_helper.Attr(3o)Attributes✨
• Ast_helper.Cf(3o)Class fields✨
• Ast_helper.Ci(3o)Classes✨
• Ast_helper.Cl(3o)Class expressions✨
• Ast_helper.Const(3o)no description✨
• Ast_helper.Csig(3o)Class signatures✨
• Ast_helper.Cstr(3o)Class structures✨
• Ast_helper.Ctf(3o)Class type fields✨
• Ast_helper.Cty(3o)Class type expressions✨
• Ast_helper.Exp(3o)Expressions✨
• Ast_helper.Incl(3o)Includes✨
• Ast_helper.Mb(3o)Module bindings✨
• Ast_helper.Md(3o)Module declarations✨
• Ast_helper.Mod(3o)Module expressions✨
• Ast_helper.Ms(3o)Module substitutions✨
• Ast_helper.Mtd(3o)Module type declarations✨
• Ast_helper.Mty(3o)Module type expressions✨
• Ast_helper.Of(3o)Object fields✨
• Ast_helper.Opn(3o)Opens✨
• Ast_helper.Pat(3o)Patterns✨
• Ast_helper.Rf(3o)Row fields✨
• Ast_helper.Sig(3o)Signature items✨
• Ast_helper.Str(3o)Structure items✨
• Ast_helper.Te(3o)Type extensions✨
• Ast_helper.Typ(3o)Type expressions✨
• Ast_helper.Type(3o)Type declarations✨
• Ast_helper.Val(3o)Value declarations✨
• Ast_helper.Vb(3o)Value bindings✨
• Ast_invariants(3o)Check AST invariants✨
• Ast_iterator(3o)Ast_iterator.iterator enables AST inspection using open recursion.✨
• Ast_mapper(3o)The interface of a -ppx rewriter✨
• Asttypes(3o)Auxiliary AST types used by parsetree and typedtree.✨
• Atomic(3o)Atomic references.✨
• Attr_helper(3o)Helpers for attributes✨

B

• Bigarray(3o)Large, multi-dimensional, numerical arrays.✨
• Bigarray.Array0(3o)Zero-dimensional arrays.✨
• Bigarray.Array1(3o)One-dimensional arrays.✨
• Bigarray.Array2(3o)Two-dimensional arrays.✨
• Bigarray.Array3(3o)Three-dimensional arrays.✨
• Bigarray.Genarray(3o)no description✨
• Binutils(3o)no description✨
• Bool(3o)Boolean values.✨
• Buffer(3o)Extensible buffers.✨
• Build_path_prefix_map(3o)Rewrite paths for reproducible builds✨
• Builtin_attributes(3o)Support for the builtin attributes:✨
• Bytes(3o)Byte sequence operations.✨
• BytesLabels(3o)Byte sequence operations.✨

C

• Callback(3o)Registering OCaml values with the C runtime.✨
• CamlinternalAtomic(3o)no description✨
• CamlinternalFormat(3o)no description✨
• CamlinternalFormatBasics(3o)no description✨
• CamlinternalLazy(3o)Run-time support for lazy values.✨
• CamlinternalMenhirLib(3o)no description✨
• CamlinternalMenhirLib.Convert(3o)no description✨
• CamlinternalMenhirLib.Convert.Simplified(3o)no description✨
• CamlinternalMenhirLib.Engine(3o)no description✨
• CamlinternalMenhirLib.Engine.Make(3o)no description✨
• CamlinternalMenhirLib.EngineTypes(3o)no description✨
• CamlinternalMenhirLib.EngineTypes.ENGINE(3o)no description✨
• CamlinternalMenhirLib.EngineTypes.INCREMENTAL_ENGINE_START(3o)no description✨
• CamlinternalMenhirLib.EngineTypes.MONOLITHIC_ENGINE(3o)no description✨
• CamlinternalMenhirLib.EngineTypes.TABLE(3o)no description✨
• CamlinternalMenhirLib.EngineTypes.TABLE.Log(3o)no description✨
• CamlinternalMenhirLib.ErrorReports(3o)no description✨
• CamlinternalMenhirLib.General(3o)no description✨
• CamlinternalMenhirLib.IncrementalEngine(3o)no description✨
• CamlinternalMenhirLib.IncrementalEngine.EVERYTHING(3o)no description✨
• CamlinternalMenhirLib.IncrementalEngine.INCREMENTAL_ENGINE(3o)no description✨
• CamlinternalMenhirLib.IncrementalEngine.INSPECTION(3o)no description✨
• CamlinternalMenhirLib.IncrementalEngine.SYMBOLS(3o)no description✨
• CamlinternalMenhirLib.InfiniteArray(3o)no description✨
• CamlinternalMenhirLib.InspectionTableFormat(3o)no description✨
• CamlinternalMenhirLib.InspectionTableFormat.TABLES(3o)no description✨
• CamlinternalMenhirLib.InspectionTableInterpreter(3o)no description✨
• CamlinternalMenhirLib.InspectionTableInterpreter.Make(3o)no description✨
• CamlinternalMenhirLib.InspectionTableInterpreter.Symbols(3o)no description✨
• CamlinternalMenhirLib.LexerUtil(3o)no description✨
• CamlinternalMenhirLib.LinearizedArray(3o)no description✨
• CamlinternalMenhirLib.PackedIntArray(3o)no description✨
• CamlinternalMenhirLib.Printers(3o)no description✨
• CamlinternalMenhirLib.Printers.Make(3o)no description✨
• CamlinternalMenhirLib.RowDisplacement(3o)no description✨
• CamlinternalMenhirLib.StaticVersion(3o)no description✨
• CamlinternalMenhirLib.TableFormat(3o)no description✨
• CamlinternalMenhirLib.TableFormat.TABLES(3o)no description✨
• CamlinternalMenhirLib.TableInterpreter(3o)no description✨
• CamlinternalMenhirLib.TableInterpreter.MakeEngineTable(3o)no description✨
• CamlinternalMod(3o)Run-time support for recursive modules.✨
• CamlinternalOO(3o)Run-time support for objects and classes.✨
• Ccomp(3o)Compiling C files and building C libraries✨
• Char(3o)Character operations.✨
• Clflags(3o)Command line flags✨
• Clflags.Compiler_pass(3o)no description✨
• Clflags.Float_arg_helper(3o)Optimization parameters represented as floats indexed by round number.✨
• Clflags.Int_arg_helper(3o)Optimization parameters represented as ints indexed by round number.✨
• Compiler_libs(3o)Warning This library is part of the internal OCaml compiler API, and is not the language standard library.✨
• Complex(3o)Complex numbers.✨
• Condition(3o)Condition variables.✨
• Config(3o)System configuration✨
• Consistbl(3o)Consistency tables: for checking consistency of module CRCs✨
• Consistbl.Make(3o)no description✨

D

• Depend(3o)Module dependencies.✨
• Depend.String(3o)no description✨
• Diffing(3o)Parametric diffing✨
• Diffing.Define(3o)Define(Defs) creates the diffing types from the types defined in Defs and the functors that need to be instantatied with the diffing algorithm parameters✨
• Diffing.Define.Left_variadic(3o)Variadic diffing✨
• Diffing.Define.Parameters(3o)no description✨
• Diffing.Define.Right_variadic(3o)no description✨
• Diffing.Define.S(3o)no description✨
• Diffing.Define.Simple(3o)no description✨
• Diffing.Defs(3o)The core types of a diffing implementation✨
• Diffing_with_keys(3o)When diffing lists where each element has a distinct key, we can refine the diffing patch by introducing two composite edit moves: swaps and moves.✨
• Diffing_with_keys.Define(3o)no description✨
• Diffing_with_keys.Define.Parameters(3o)no description✨
• Diffing_with_keys.Define.Simple(3o)no description✨
• Digest(3o)Message digest.✨
• Docstrings(3o)Documentation comments✨
• Docstrings.WithMenhir(3o)no description✨
• Domainstate(3o)no description✨
• Dynlink(3o)Dynamic loading of .cmo, .cma and .cmxs files.✨

E

• Either(3o)Either type.✨
• Ephemeron(3o)Ephemerons and weak hash tables.✨
• Ephemeron.GenHashTable(3o)Hash tables on generic containers with notion of death and aliveness.✨
• Ephemeron.GenHashTable.MakeSeeded(3o)Functor building an implementation of an hash table that use the container for keeping the information given✨
• Ephemeron.K1(3o)Ephemerons with one key.✨
• Ephemeron.K1.Bucket(3o)no description✨
• Ephemeron.K1.Make(3o)Functor building an implementation of a weak hash table✨
• Ephemeron.K1.MakeSeeded(3o)Functor building an implementation of a weak hash table.✨
• Ephemeron.K2(3o)Ephemerons with two keys.✨
• Ephemeron.K2.Bucket(3o)no description✨
• Ephemeron.K2.Make(3o)Functor building an implementation of a weak hash table✨
• Ephemeron.K2.MakeSeeded(3o)Functor building an implementation of a weak hash table.✨
• Ephemeron.Kn(3o)Ephemerons with arbitrary number of keys of the same type.✨
• Ephemeron.Kn.Bucket(3o)no description✨
• Ephemeron.Kn.Make(3o)Functor building an implementation of a weak hash table✨
• Ephemeron.Kn.MakeSeeded(3o)Functor building an implementation of a weak hash table.✨
• Ephemeron.S(3o)The output signature of the functors Ephemeron.K1.Make and Ephemeron.K2.Make.✨
• Ephemeron.SeededS(3o)The output signature of the functors Ephemeron.K1.MakeSeeded and Ephemeron.K2.MakeSeeded.✨
• Event(3o)First-class synchronous communication.✨

F

• Filename(3o)Operations on file names.✨
• Float(3o)Floating-point arithmetic.✨
• Float.Array(3o)Float arrays with packed representation.✨
• Float.ArrayLabels(3o)Float arrays with packed representation (labeled functions).✨
• Format(3o)Pretty-printing.✨
• Format_tutorial(3o)Using the Format module✨
• Fun(3o)Function manipulation.✨

G

• Gc(3o)Memory management control and statistics; finalised values.✨
• Gc.Memprof(3o)Memprof is a profiling engine which randomly samples allocated memory words.✨
• Genlex(3o)A generic lexical analyzer.✨

H

• Hashtbl(3o)Hash tables and hash functions.✨
• Hashtbl.HashedType(3o)The input signature of the functor Hashtbl.Make.✨
• Hashtbl.Make(3o)Functor building an implementation of the hashtable structure.✨
• Hashtbl.MakeSeeded(3o)Functor building an implementation of the hashtable structure.✨
• Hashtbl.S(3o)The output signature of the functor Hashtbl.Make.✨
• Hashtbl.SeededHashedType(3o)The input signature of the functor Hashtbl.MakeSeeded.✨
• Hashtbl.SeededS(3o)The output signature of the functor Hashtbl.MakeSeeded.✨

I

• Identifiable(3o)Uniform interface for common data structures over various things.✨
• Identifiable.Make(3o)no description✨
• Identifiable.Map(3o)no description✨
• Identifiable.Map.T(3o)no description✨
• Identifiable.Pair(3o)no description✨
• Identifiable.S(3o)no description✨
• Identifiable.S.Map(3o)no description✨
• Identifiable.S.Set(3o)no description✨
• Identifiable.S.T(3o)no description✨
• Identifiable.S.Tbl(3o)no description✨
• Identifiable.Set(3o)no description✨
• Identifiable.Set.T(3o)no description✨
• Identifiable.Tbl(3o)no description✨
• Identifiable.Tbl.T(3o)no description✨
• Identifiable.Thing(3o)no description✨
• In_channel(3o)Input channels.✨
• Int(3o)Integer values.✨
• Int32(3o)32-bit integers.✨
• Int64(3o)64-bit integers.✨
• Int_replace_polymorphic_compare(3o)no description✨

L

• Lazy(3o)Deferred computations.✨
• Lazy_backtrack(3o)no description✨
• Lexer(3o)The lexical analyzer✨
• Lexing(3o)The run-time library for lexers generated by ocamllex.✨
• List(3o)List operations.✨
• ListLabels(3o)List operations.✨
• Load_path(3o)Management of include directories.✨
• Load_path.Dir(3o)no description✨
• Local_store(3o)This module provides some facilities for creating references (and hash tables) which can easily be snapshotted and restored to an arbitrary version.✨
• Location(3o)Source code locations (ranges of positions), used in parsetree.✨
• Longident(3o)Long identifiers, used in parsetree.✨

M

• Map(3o)Association tables over ordered types.✨
• Map.Make(3o)Functor building an implementation of the map structure given a totally ordered type.✨
• Map.OrderedType(3o)Input signature of the functor Map.Make.✨
• Map.S(3o)Output signature of the functor Map.Make.✨
• Marshal(3o)Marshaling of data structures.✨
• Misc(3o)Miscellaneous useful types and functions✨
• Misc.Color(3o)Color support detection✨