Index of values

Integer multiplication.

Exponentiation.

Floating-point multiplication.

( and* ) is Result.product.

( let* ) is Result.bind.

!r returns the current contents of reference r.

Negation of Repr.phys_equal.

The boolean 'and'.

e0 && e1 is the lazy boolean conjunction of expressions e0 and e1.

Integer addition.

Floating-point addition.

Integer subtraction.

Floating-point subtraction.

Integer division.

Floating-point division.

r := a stores the value of a in reference r.

See (>=).

See (>=).

Negation of Repr.equal.

Alias of Repr.equal Left-associative operator, see Ocaml_operators for more information.

Alias of Repr.phys_equal.

See (>=).

Structural ordering functions.

l0 @ l1 appends l1 to l0.

Application operator: g @@ f @@ x is exactly equivalent to g (f (x)).

String concatenation.

f1 ^^ f2 catenates format strings f1 and f2.

n asr m shifts n to the right by m bits.

Bitwise logical and.

Bitwise logical or.

n lsl m shifts n to the left by m bits.

n lsr m shifts n to the right by m bits.

Bitwise logical exclusive or.

Integer remainder.

Reverse-application operator: x |> f |> g is exactly equivalent to g (f (x)).

The boolean 'or'.

e0 || e1 is the lazy boolean disjunction of expressions e0 and e1.

Unary addition.

Unary addition.

Unary negation.

Unary negation.

__FILE__ returns the name of the file currently being parsed by the compiler.

__FUNCTION__ returns the name of the current function or method, including any enclosing modules or classes.

__LINE_OF__ expr returns a pair (line, expr), where line is the line number at which the expression expr appears in the file currently being parsed by the compiler.

__LINE__ returns the line number at which this expression appears in the file currently being parsed by the compiler.

__LOC_OF__ expr returns a pair (loc, expr) where loc is the location of expr in the file currently being parsed by the compiler, with the standard error format of OCaml: "File %S, line %d, characters %d-%d".

__LOC__ returns the location at which this expression appears in the file currently being parsed by the compiler, with the standard error format of OCaml: "File %S, line %d, characters %d-%d".

__MODULE__ returns the module name of the file being parsed by the compiler.

__POS_OF__ expr returns a pair (loc,expr), where loc is a tuple (file,lnum,cnum,enum) corresponding to the location at which the expression expr appears in the file currently being parsed by the compiler.

__POS__ returns a tuple (file,lnum,cnum,enum), corresponding to the location at which this expression appears in the file currently being parsed by the compiler.

Terminate the calling process immediately, returning the given status code to the operating system: usually 0 to indicate no errors, and a small positive integer to indicate failure.

Terminate the calling process immediately, returning the given status code to the operating system: usually 0 to indicate no errors, and a small positive integer to indicate failure.

abs x is the absolute value of x.

abs x is the absolute value of x.

abs x is the absolute value of x.

abs x is the absolute value of x.

abs x is the absolute value of x.

abs f returns the absolute value of f.

abs_float f returns the absolute value of f.

Accept connections on the given socket.

Accept connections on the given socket.

Check that the process has the given permissions over the named file.

Check that the process has the given permissions over the named file.

Arc cosine.

Arc cosine.

Hyperbolic arc cosine.

Hyperbolic arc cosine.

acquire s blocks the calling thread until the semaphore s has value 1 (is available), then atomically sets it to 0 and returns.

acquire s blocks the calling thread until the value of semaphore s is not zero, then atomically decrements the value of s and returns.

In bytecode, the identity function.

add t x adds x to t.

add x s returns a set containing all elements of s, plus x.

add x q adds the element x at the end of the queue q.

add q x adds the element x in the priority queue q.

Addition.

add x s returns a set containing all elements of s, plus x.

add ~key ~data m returns a map containing the same bindings as m, plus a binding of key to data.

Hashtbl.add tbl ~key ~data adds a binding of key to data in table tbl.

add key data m returns a map containing the same bindings as m, plus a binding of key to data.

Addition.

Addition.

add x y is the addition x + y.

Hashtbl.add tbl key data adds a binding of key to data in table tbl.

Floating-point addition.

Add an ephemeron to the bucket.

Add an ephemeron to the bucket.

Add an ephemeron to the bucket.

Addition

add_buffer b1 b2 appends the current contents of buffer b2 at the end of buffer b1.

add_bytes b s appends the byte sequence s at the end of buffer b.

add_channel b ic n reads at most n characters from the input channel ic and stores them at the end of buffer b.

add_char b c appends the character c at the end of buffer b.

add_int16_be b i appends a binary big-endian signed 16-bit integer i to b.

add_int16_le b i appends a binary little-endian signed 16-bit integer i to b.

add_int16_ne b i appends a binary native-endian signed 16-bit integer i to b.

add_int32_be b i appends a binary big-endian 32-bit integer i to b.

add_int32_le b i appends a binary little-endian 32-bit integer i to b.

add_int32_ne b i appends a binary native-endian 32-bit integer i to b.

add_int64_be b i appends a binary big-endian 64-bit integer i to b.

add_int64_ne b i appends a binary little-endian 64-bit integer i to b.

add_int64_ne b i appends a binary native-endian 64-bit integer i to b.

add_int8 b i appends a binary signed 8-bit integer i to b.

add_iter q iter x adds each element of x to the end of q.

add_last a x adds the element x at the end of the array a.

Add the elements from the sequence on the top of the stack.

Add the given elements to the set, in order.

Add the elements from a sequence to the end of the queue.

Add the given elements to the set, in order.

Add the given bindings to the map, in order.

Add the given bindings to the table, using MoreLabels.Hashtbl.add

Add the given bindings to the map, in order.

Add the given bindings to the table, using Hashtbl.add

Add chars to the buffer

add_string b s appends the string s at the end of buffer b.

add_subbytes b s ofs len takes len characters from offset ofs in byte sequence s and appends them at the end of buffer b.

add_substitute b f s appends the string pattern s at the end of buffer b with substitution.

add_substring b s ofs len takes len characters from offset ofs in string s and appends them at the end of buffer b.

add_symbolic_output_item sob itm adds item itm to buffer sob.

add_to_list ~key ~data m is m with key mapped to l such that l is data :: Map.find key m if key was bound in m and [data] otherwise.

add_to_list key data m is m with key mapped to l such that l is data :: Map.find key m if key was bound in m and [data] otherwise.

add_uint16_be b i appends a binary big-endian unsigned 16-bit integer i to b.

add_uint16_le b i appends a binary little-endian unsigned 16-bit integer i to b.

add_uint16_ne b i appends a binary native-endian unsigned 16-bit integer i to b.

add_uint8 b i appends a binary unsigned 8-bit integer i to b.

add_user_event ty callback t extends t to additionally subscribe to user events of type ty.

add_utf_16be_uchar b u appends the UTF-16BE encoding of u at the end of buffer b.

add_utf_16le_uchar b u appends the UTF-16LE encoding of u at the end of buffer b.

add_utf_8_uchar b u appends the UTF-8 encoding of u at the end of buffer b.

Schedule a SIGALRM signal after the given number of seconds.

Schedule a SIGALRM signal after the given number of seconds.

Align the documentation strings by inserting spaces at the first alignment separator (tab or, if tab is not found, space), according to the length of the keyword.

Return the list of compilation units that form the main program together with those that have been dynamically loaded via loadfile (and not via loadfile_private).

Return the number of bytes allocated by this domain and potentially a previous domain.

allow_only units sets the list of allowed units to be the intersection of the existing allowed units and the given list of units.

Govern whether unsafe object files are allowed to be dynamically linked.

always v returns an event that is always ready for synchronization.

( and+ ) is Result.product.

append xs ys is the concatenation of the sequences xs and ys.

append l0 l1 appends l1 to l0.

append l0 l1 appends l1 to l0.

append v1 v2 returns a fresh immutable array containing the concatenation of the immutable arrays v1 and v2.

append v1 v2 returns a fresh floatarray containing the concatenation of the floatarrays v1 and v2.

append v1 v2 returns a fresh floatarray containing the concatenation of the floatarrays v1 and v2.

append a b is like append_array a b, but b is itself a dynamic array instead of a fixed-size array.

append v1 v2 returns a fresh array containing the concatenation of the arrays v1 and v2.

append v1 v2 returns a fresh array containing the concatenation of the arrays v1 and v2.

append_array a b adds all elements of b at the end of a, in the order they appear in b.

append_iter a iter x adds each element of x to the end of a.

Like Dynarray.append_array but with a list.

Like Dynarray.append_array but with a sequence.

Argument.

The command line arguments given to the process.

Return the zero-dimensional Bigarray corresponding to the given generic Bigarray.

Return the one-dimensional Bigarray corresponding to the given generic Bigarray.

Return the two-dimensional Bigarray corresponding to the given generic Bigarray.

Return the three-dimensional Bigarray corresponding to the given generic Bigarray.

ascii_width s ~pos ~len is len.

Arc sine.

Arc sine.

Hyperbolic arc sine.

Hyperbolic arc sine.

Same as printf above, but instead of printing on a formatter, returns a string containing the result of formatting the arguments.

assoc a l returns the value associated with key a in the list of pairs l.

assoc a l returns the value associated with key a in the list of pairs l.

assoc_opt a l returns the value associated with key a in the list of pairs l.

assoc_opt a l returns the value associated with key a in the list of pairs l.

Same as ListLabels.assoc, but uses physical equality instead of structural equality to compare keys.

Same as List.assoc, but uses physical equality instead of structural equality to compare keys.

Same as ListLabels.assoc_opt, but uses physical equality instead of structural equality to compare keys.

Same as List.assoc_opt, but uses physical equality instead of structural equality to compare keys.

Register the given function to be called at program termination time.

at_exit f registers f to be called when the current domain exits.

Arc tangent.

Arc tangent.

atan2 y x returns the arc tangent of y /. x.

atan2 y x returns the arc tangent of y /. x.

Hyperbolic arc tangent.

Hyperbolic arc tangent.

Backend type currently executing the OCaml program.

Returns the slots of a raw backtrace, or None if none of them contain useful information.

Returns the slots of a single raw backtrace entry, or None if this entry lacks debug information.

Printexc.backtrace_status() returns true if exception backtraces are currently recorded, false if not.

Split a file name into directory name / base file name.

before_first_spawn f registers f to be called before the first domain is spawned by the program.

Scanning.beginning_of_input ic tests the beginning of input condition of the given Scanf.Scanning.in_channel formatted input channel.

Whether the machine currently executing the Caml program is big-endian.

Bind a socket to an address.

Bind a socket to an address.

bind r f is f v if r is Ok v and r if r is Error _.

bind o f is f v if o is Some v and None if o is None.

Return the list of all bindings of the given map.

Return the list of all bindings of the given map.

Return 30 random bits in a nonnegative integer.

Random.bits32 () returns 32 random bits as an integer between Int32.min_int and Int32.max_int.

Random.bits64 () returns 64 random bits as an integer between Int64.min_int and Int64.max_int.

Return the internal representation of the given float according to the IEEE 754 floating-point 'double format' bit layout.

Return the internal representation of the given float according to the IEEE 754 floating-point 'single format' bit layout.

Weak.blit ar1 off1 ar2 off2 len copies len weak pointers from ar1 (starting at off1) to ar2 (starting at off2).

Same as Bytes.blit_string which should be preferred.

Same as Bytes.blit_string which should be preferred.

blit ~src ~src_pos ~dst ~dst_pos ~len copies len elements from floatarray src, starting at element number src_pos, to floatarray dst, starting at element number dst_pos.

blit src src_pos dst dst_pos len copies len elements from floatarray src, starting at element number src_pos, to floatarray dst, starting at element number dst_pos.

blit ~src ~src_pos ~dst ~dst_pos ~len copies len elements from a source dynarray src, starting at index src_pos, to a destination dynarray dst, starting at index dst_pos.

blit ~src ~src_pos ~dst ~dst_pos ~len copies len bytes from byte sequence src, starting at index src_pos, to byte sequence dst, starting at index dst_pos.

blit src src_pos dst dst_pos len copies len bytes from byte sequence src, starting at index src_pos, to byte sequence dst, starting at index dst_pos.

Buffer.blit src srcoff dst dstoff len copies len characters from the current contents of the buffer src, starting at offset srcoff to dst, starting at character dstoff.

Copy the first Bigarray to the second Bigarray.

Copy the first Bigarray to the second Bigarray.

Copy the first Bigarray to the second Bigarray.

Copy the first Bigarray to the second Bigarray.

Copy all elements of a Bigarray in another Bigarray.

blit ~src ~src_pos ~dst ~dst_pos ~len copies len elements from array src, starting at element number src_pos, to array dst, starting at element number dst_pos.

blit src src_pos dst dst_pos len copies len elements from array src, starting at element number src_pos, to array dst, starting at element number dst_pos.

blit_string ~src ~src_pos ~dst ~dst_pos ~len copies len bytes from string src, starting at index src_pos, to byte sequence dst, starting at index dst_pos.

blit_string src src_pos dst dst_pos len copies len bytes from string src, starting at index src_pos, to byte sequence dst, starting at index dst_pos.

bom is U+FEFF, the byte order mark (BOM) character.

Random.bool () returns true or false with probability 0.5 each.

Same as bool_of_string_opt, but raise Invalid_argument "bool_of_string" instead of returning None.

Convert the given string to a boolean.

Same as Str.bounded_split_delim, but returns the delimiters as well as the substrings contained between delimiters.

Same as Str.split, but splits into at most n substrings, where n is the extra integer parameter.

Same as Str.bounded_split, but occurrences of the delimiter at the beginning and at the end of the string are recognized and returned as empty strings in the result.

Same as Printf.fprintf, but instead of printing on an output channel, append the formatted arguments to the given extensible buffer (see module Buffer).

broadcast c wakes up all threads waiting on the condition variable c.

bscanf_format ic fmt f reads a format string token from the formatted input channel ic, according to the given format string fmt, and applies f to the resulting format string value.

Same as Scanf.bscanf, but returns None in case of scanning failure.

Return the digest of the given byte sequence.

Return the digest of the given byte sequence.

capacity a is the length of a's backing array.

capitalize_ascii s is s with the first character set to uppercase, using the US-ASCII character set.

capitalize_ascii s is s with the first character set to uppercase, using the US-ASCII character set.

Return a copy of the argument, with the first character set to uppercase, using the US-ASCII character set.

Return a copy of the argument, with the first character set to uppercase, using the US-ASCII character set.

Return the number of elements of a set.

Return the number of elements of a set.

Return the number of bindings of a map.

Return the number of bindings of a map.

cat s1 s2 concatenates s1 and s2 (s1 ^ s2).

cat s1 s2 concatenates s1 and s2 (s1 ^ s2).

cat s1 s2 concatenates s1 and s2 and returns the result as a new byte sequence.

cat s1 s2 concatenates s1 and s2 and returns the result as a new byte sequence.

Printexc.catch fn x is similar to Printexc.print, but aborts the program with exit code 2 after printing the uncaught exception.

catch_break governs whether interactive interrupt (ctrl-C) terminates the program or raises the Break exception.

Cube root.

Round above to an integer value.

Round above to an integer value.

Array3.change_layout a layout returns a Bigarray with the specified layout, sharing the data with a (and hence having the same dimensions as a).

Array2.change_layout a layout returns a Bigarray with the specified layout, sharing the data with a (and hence having the same dimensions as a).

Array1.change_layout a layout returns a Bigarray with the specified layout, sharing the data with a (and hence having the same dimension as a).

Array0.change_layout a layout returns a Bigarray with the specified layout, sharing the data with a.

Genarray.change_layout a layout returns a Bigarray with the specified layout, sharing the data with a (and hence having the same dimensions as a).

Read characters from the channel and return their digest.

If len is nonnegative, Digest.channel ic len reads len characters from channel ic and returns their digest, or raises End_of_file if end-of-file is reached before len characters are read.

As shown by the types of the values above, Bigarrays of kind float16_elt, float32_elt and float64_elt are accessed using the OCaml type float.

Return the character with the given ASCII code.

Change the process working directory.

Change the process working directory.

Change the current working directory of the process.

Weak.check ar n returns true if the nth cell of ar is full, false if it is empty.

Check if the formatter geometry is valid: 1 < max_indent < margin < Format.pp_infinity

check_suffix name suff returns true if the filename name ends with the suffix suff.

Change the permissions of the named file.

Change the permissions of the named file.

Return one element of the given set, or raise Not_found if the set is empty.

Return one element of the given set, or raise Not_found if the set is empty.

Return one binding of the given map, or raise Not_found if the map is empty.

Return one binding of the given map, or raise Not_found if the map is empty.

choose evl returns the event that is the alternative of all the events in the list evl.

Return one element of the given set, or None if the set is empty.

Return one element of the given set, or None if the set is empty.

Return one binding of the given map, or None if the map is empty.

Return one binding of the given map, or None if the map is empty.

Same as Filename.remove_extension, but raise Invalid_argument if the given name has an empty extension.

chop_suffix name suff removes the suffix suff from the filename name.

chop_suffix_opt ~suffix filename removes the suffix from the filename if possible, or returns None if the filename does not end with the suffix.

Change the owner uid and owner gid of the named file.

Change the owner uid and owner gid of the named file.

Return the character with the given integer code.

Change the process root directory.

Change the process root directory.

Return the class of the given floating-point number: normal, subnormal, zero, infinite, or not a number.

Return the class of the given floating-point number: normal, subnormal, zero, infinite, or not a number.

remove all dead bindings.

remove all dead bindings.

Remove all elements from the table.

Discard all elements from a stack.

Discard all elements from a queue.

clear q removes all elements from q.

Empty a hash table.

Empty a hash table.

Remove all ephemerons from the bucket.

Remove all ephemerons from the bucket.

Remove all ephemerons from the bucket.

clear a is truncate a 0, it removes all the elements of a.

Empty the buffer.

Clear the ``close-on-exec'' flag on the given descriptor.

Clear the ``close-on-exec'' flag on the given descriptor.

Clear the ``non-blocking'' flag on the given descriptor.

Clear the ``non-blocking'' flag on the given descriptor.

Empty the parser stack.

clear_symbolic_output_buffer sob resets buffer sob.

Close a file descriptor.

Close a file descriptor.

Close the given channel, flushing all buffered write operations.

Close the given channel.

Closes the most recently open pretty-printing box.

Close the given channel.

Closes the in_channel associated with the given Scanf.Scanning.in_channel formatted input channel.

Same as close_in, but ignore all errors.

Same as Out_channel.close, but ignore all errors.

Same as In_channel.close, but ignore all errors.

Close the given channel, flushing all buffered write operations.

Same as close_out, but ignore all errors.

Close channels opened by UnixLabels.open_process, wait for the associated command to terminate, and return its termination status.

Close channels opened by Unix.open_process, wait for the associated command to terminate, and return its termination status.

Close channels opened by UnixLabels.open_process_full, wait for the associated command to terminate, and return its termination status.

Close channels opened by Unix.open_process_full, wait for the associated command to terminate, and return its termination status.

Close channels opened by UnixLabels.open_process_in, wait for the associated command to terminate, and return its termination status.

Close channels opened by Unix.open_process_in, wait for the associated command to terminate, and return its termination status.

Close channels opened by UnixLabels.open_process_out, wait for the associated command to terminate, and return its termination status.

Close channels opened by Unix.open_process_out, wait for the associated command to terminate, and return its termination status.

pp_close_stag ppf () closes the most recently opened semantic tag t.

Closes the most recently opened tabulation box.

Close a directory descriptor.

Close a directory descriptor.

Return the integer code of the argument.

Transform a pair of lists into a list of pairs: combine [a1; ...; an] [b1; ...; bn] is [(a1,b1); ...; (an,bn)].

Transform a pair of lists into a list of pairs: combine [a1; ...; an] [b1; ...; bn] is [(a1,b1); ...; (an,bn)].

combine [|a1; ...; an|] [|b1; ...; bn|] is [|(a1,b1); ...; (an,bn)|].

combine [|a1; ...; an|] [|b1; ...; bn|] is [|(a1,b1); ...; (an,bn)|].

combine [|a1; ...; an|] [|b1; ...; bn|] is [|(a1,b1); ...; (an,bn)|].

Execute the given shell command and return its exit code.

Perform a full major collection and compact the heap.

compare u1 u2 is 0.

compare u u' is Stdlib.compare u u'.

compare s0 s1 sorts s0 and s1 in lexicographical order.

Alias of Repr.compare.

compare s0 s1 sorts s0 and s1 in lexicographical order.

A total ordering function over the set elements.

Total ordering between sets.

Provided the function cmp defines a preorder on elements, compare cmp xs ys compares the sequences xs and ys according to the lexicographic preorder.

compare ~ok ~error r0 r1 totally orders r0 and r1 using ok and error to respectively compare values wrapped by Ok _  and Error _.

compare x y returns 0 if x is equal to y, a negative integer if x is less than y, and a positive integer if x is greater than y.

compare is a total order on values of type Pqueue.OrderedPolyType.t.

A total ordering function to compare elements.

compare cmpa cmpb is a total order on pairs using cmpa to compare the first component, and cmpb to compare the second component.

compare cmp o0 o1 is a total order on options using cmp to compare values wrapped by Some _.

The comparison function for native integers, with the same specification as compare.

A total ordering function over the set elements.

Total ordering between sets.

A total ordering function over the keys.

Total ordering between maps.

A total ordering function over the keys.

Total ordering between maps.

compare cmp [a1; ...; an] [b1; ...; bm] performs a lexicographic comparison of the two input lists, using the same 'a -> 'a -> int interface as compare:

compare cmp [a1; ...; an] [b1; ...; bm] performs a lexicographic comparison of the two input lists, using the same 'a -> 'a -> int interface as compare:

The comparison function for 64-bit integers, with the same specification as compare.

The comparison function for 32-bit integers, with the same specification as compare.

compare x y is compare x y but more efficient.

Provided the function cmp defines a preorder on elements, compare cmp a b compares first a and b by their length, and then, if equal, by their elements according to the lexicographic preorder.

compare cmp a b compares a and b according to the shortlex order, that is, shorter arrays are smaller and equal-sized arrays are compared in lexicographic order using cmp to compare elements.

compare cmp a b compares a and b according to the shortlex order, that is, shorter arrays are smaller and equal-sized arrays are compared in lexicographic order using cmp to compare elements.

compare x y returns 0 if x is equal to y, a negative integer if x is less than y, and a positive integer if x is greater than y.

compare ~left ~right e0 e1 totally orders e0 and e1 using left and right to respectively compare values wrapped by Left _  and Right _.

compare cmp a b compares a and b according to the shortlex order, that is, shorter arrays are smaller and equal-sized arrays are compared in lexicographic order using cmp to compare elements.

Compare two digests, with the same specification as compare.

The comparison function for 16-byte digests, with the same specification as compare and the implementation shared with String.compare.

The comparison function for characters, with the same specification as compare.

The comparison function for byte sequences, with the same specification as compare.

The comparison function for byte sequences, with the same specification as compare.

compare b0 b1 is a total order on boolean values.

compare cmp a b compares a and b according to the shortlex order, that is, shorter arrays are smaller and equal-sized arrays are compared in lexicographic order using cmp to compare elements.

compare cmp a b compares a and b according to the shortlex order, that is, shorter arrays are smaller and equal-sized arrays are compared in lexicographic order using cmp to compare elements.

compare_and_set r seen v sets the new value of r to v only if its current value is physically equal to seen -- the comparison and the set occur atomically.

Compare the length of a list to an integer.

Compare the length of a list to an integer.

Compare the lengths of two lists.

Compare the lengths of two lists.

See Bigarray.char.

See Bigarray.char.

compose f g is a function composition of applying g then f.

concat sep ss concatenates the list of strings ss, inserting the separator string sep between each.

concat ~sep ss concatenates the list of strings ss, inserting the separator string sep between each.

If xss is a sequence of sequences, then concat xss is its concatenation.

Concatenate a list of lists.

Concatenate a list of lists.

Same as Iarray.append, but concatenates a list of immutable arrays.

Same as Float.ArrayLabels.append, but concatenates a list of floatarrays.

Same as Float.Array.append, but concatenates a list of floatarrays.

concat dir file returns a file name that designates file file in directory dir.

concat ~sep sl concatenates the list of byte sequences sl, inserting the separator byte sequence sep between each, and returns the result as a new byte sequence.

concat sep sl concatenates the list of byte sequences sl, inserting the separator byte sequence sep between each, and returns the result as a new byte sequence.

Same as ArrayLabels.append, but concatenates a list of arrays.

Same as Array.append, but concatenates a list of arrays.

concat_map f xs is equivalent to concat (map f xs).

concat_map ~f l gives the same result as ListLabels.concat (ListLabels.map f l).

concat_map f l gives the same result as List.concat (List.map f l).

Conjugate: given the complex x + i.y, returns x - i.y.

Connect a socket to an address.

Connect a socket to an address.

cons x xs is the sequence that begins with the element x, followed with the sequence xs.

cons x xs is x :: xs

cons x xs is x :: xs

const c is a function that always returns the value c.

contains s c is String.contains_from s 0 c.

contains s c is String.contains_from s 0 c.

contains s c tests if byte c appears in s.

contains s c tests if byte c appears in s.

contains_from s start c is true if and only if c appears in s after position start.

contains_from s start c is true if and only if c appears in s after position start.

contains_from s start c tests if byte c appears in s after position start.

contains_from s start c tests if byte c appears in s after position start.

Return a copy of the current contents of the buffer.

continue k x resumes the continuation k by passing x to k.

continue_with k v h resumes the continuation k with value v with the handler h.

Extracts the user-friendly backtrace_slot from a low-level raw_backtrace_slot.

Return a copy of the given stack.

Return a copy of the given state.

Return a copy of the given queue.

copy q is a new priority queue with the same elements q has.

Oo.copy o returns a copy of object o, that is a fresh object with the same methods and instance variables as o.

Return a copy of the given hashtable.

Return a copy of the given hashtable.

copy a returns a copy of a, that is, a fresh floatarray containing the same elements as a.

copy a returns a copy of a, that is, a fresh floatarray containing the same elements as a.

copy a is a shallow copy of a, a new array containing the same elements as a.

Return a new byte sequence that contains the same bytes as the argument.

Return a new byte sequence that contains the same bytes as the argument.

copy a returns a copy of a, that is, a fresh array containing the same elements as a.

copy a returns a copy of a, that is, a fresh array containing the same elements as a.

copy_sign x y returns a float whose absolute value is that of x and whose sign is that of y.

copysign x y returns a float whose absolute value is that of x and whose sign is that of y.

Cosine.

Cosine.

Hyperbolic cosine.

Hyperbolic cosine.

Count the number of elements in the table.

Return (minor_words, promoted_words, major_words) for the current domain or potentially previous domains.

If busy-waiting, calling cpu_relax () between iterations will improve performance on some CPU architectures

Thread.create funct arg creates a new thread of control, in which the function application funct arg is executed concurrently with the other threads of the domain.

create n creates a new empty weak hash set, of initial size n.

Weak.create n returns a new weak array of length n.

Return a new stack, initially empty.

Create a Callback that optionally subscribes to one or more runtime events.

Return a new queue, initially empty.

Return a new priority queue, initially empty.

create n returns an ephemeron with n keys.

Return a new mutex.

Hashtbl.create n creates a new, empty hash table, with initial size greater or equal to the suggested size n.

Hashtbl.create n creates a new, empty hash table, with initial size greater or equal to the suggested size n.

create n returns a fresh floatarray of length n, with uninitialized data.

create n returns a fresh floatarray of length n, with uninitialized data.

create () is a new, empty array.

create() creates and returns a new condition variable.

create n returns a new byte sequence of length n.

create n returns a new byte sequence of length n.

create n returns a fresh buffer, initially empty.

Array3.create kind layout dim1 dim2 dim3 returns a new Bigarray of three dimensions, whose size is dim1 in the first dimension, dim2 in the second dimension, and dim3 in the third.

Array2.create kind layout dim1 dim2 returns a new Bigarray of two dimensions, whose size is dim1 in the first dimension and dim2 in the second dimension.

Array1.create kind layout dim returns a new Bigarray of one dimension, whose size is dim.

Array0.create kind layout returns a new Bigarray of zero dimension.

Genarray.create kind layout dimensions returns a new Bigarray whose element kind is determined by the parameter kind (one of float32, float64, int8_signed, etc) and whose layout is determined by the parameter layout (one of c_layout or fortran_layout).

create_alarm f will arrange for f to be called at the end of major GC cycles, not caused by f itself, starting with the current cycle or the next one.

create_cursor path_pid creates a cursor to read from an runtime_events.

create_float n returns a fresh float array of length n, with uninitialized data.

create_float n returns a fresh float array of length n, with uninitialized data.

create_process ~prog ~args ~stdin ~stdout ~stderr creates a new process that executes the program in file prog, with arguments args.

create_process prog args stdin stdout stderr creates a new process that executes the program in file prog, with arguments args.

create_process_env ~prog ~args ~env ~stdin ~stdout ~stderr works as UnixLabels.create_process, except that the extra argument env specifies the environment passed to the program.

create_process_env prog args env stdin stdout stderr works as Unix.create_process, except that the extra argument env specifies the environment passed to the program.

Position (in Sys.argv) of the argument being processed.

The conventional name for the current directory (e.g.

cycle xs is the infinite sequence that consists of an infinite number of repetitions of the sequence xs.

True if Sys.os_type = "Cygwin".

See Marshal.header_size.

Decrement the integer contained in the given reference.

decr r atomically decrements the value of r by 1.

Thread.default_uncaught_exception_handler will print the thread's id, exception and backtrace (if available).

Printexc.default_uncaught_exception_handler prints the exception and backtrace on standard error output.

delay d suspends the execution of the calling thread for d seconds.

delete_alarm a will stop the calls to the function associated to a.

Return the descriptor corresponding to an input channel.

Return the descriptor corresponding to an input channel.

Return the descriptor corresponding to an output channel.

Return the descriptor corresponding to an output channel.

true if this is a development version, false otherwise.

Set difference: diff s1 s2 contains the elements of s1 that are not in s2.

Set difference: diff s1 s2 contains the elements of s1 that are not in s2.

digit_of_int n is an ASCII decimal digit for the decimal value abs (n mod 10).

digit_to_int c is the numerical value of a digit that satisfies Char.Ascii.is_digit.

Return the size (dimension) of the given one-dimensional Bigarray.

Return the first dimension of the given three-dimensional Bigarray.

Return the first dimension of the given two-dimensional Bigarray.

Return the second dimension of the given three-dimensional Bigarray.

Return the second dimension of the given two-dimensional Bigarray.

Return the third dimension of the given three-dimensional Bigarray.

Genarray.dims a returns all dimensions of the Bigarray a, as an array of integers of length Genarray.num_dims a.

The directory separator (e.g.

See Filename.basename.

Discards all profiling state for a stopped profile, which prevents any more callbacks for it.

discontinue k e resumes the continuation k by raising the exception e in k.

discontinue_with k e h resumes the continuation k by raising the exception e with the handler h.

discontinue_with k e bt h resumes the continuation k by raising the exception e with the handler h using the raw backtrace bt as the origin of the exception.

discontinue_with_backtrace k e bt resumes the continuation k by raising the exception e in k using bt as the origin for the exception.

Test if two sets are disjoint.

Test if two sets are disjoint.

Integer division.

Integer division.

Integer division.

div x y is the division x / y.

Floating-point division.

Division

Return the socket domain adequate for the given socket address.

Return the socket domain adequate for the given socket address.

Same as Format.fprintf, except the formatter is the last argument.

drop s removes the topmost element in stack s, or raises Stack.Empty if the stack is empty.

drop n xs is the sequence xs, deprived of its first n elements.

drop q removes the first element in queue q, or raises Queue.Empty if the queue is empty.

drop n l returns the suffix of l after n elements, or [] if n > length l.

drop n l returns the suffix of l after n elements, or [] if n > length l.

drop_while p xs is the sequence xs, deprived of the prefix take_while p xs.

drop_while p l is the longest (possibly empty) suffix of l starting at the first element that does not satisfy p.

drop_while p l is the longest (possibly empty) suffix of l starting at the first element that does not satisfy p.

A value of type position, guaranteed to be different from any valid position.

Return a new file descriptor referencing the same file as the given descriptor.

Return a new file descriptor referencing the same file as the given descriptor.

dup2 ~src ~dst duplicates src to dst, closing dst if already opened.

dup2 src dst duplicates src to dst, closing dst if already opened.

edit_distance s0 s1 is the number of single character edits (understood as insertion, deletion, substitution, transposition) that are needed to change s0 into s1.

edit_distance s0 s1 is the number of single character edits (understood as insertion, deletion, substitution, transposition) that are needed to change s0 into s1.

Return the list of all elements of the given set.

Return the list of all elements of the given set.

The empty string.

The empty string.

The empty set.

empty is the empty sequence.

The empty set.

The empty map.

The empty map.

A byte sequence of size 0.

A byte sequence of size 0.

Control whether the OCaml runtime system can emit warnings on stderr.

Scanning.end_of_input ic tests the end-of-input condition of the given Scanf.Scanning.in_channel formatted input channel.

ends_with ~suffix s is true if and only if s ends with suffix.

ends_with ~suffix s is true if and only if s ends with suffix.

ends_with ~suffix s is true if and only if s ends with suffix.

ends_with ~suffix s is true if and only if s ends with suffix.

ensure_capacity a n makes sure that the capacity of a is at least n.

ensure_extra_capacity a n is ensure_capacity a (length a + n), it makes sure that a has room for n extra items.

Return the process environment, as an array of strings with the format ``variable=value''.

Return the process environment, as an array of strings with the format ``variable=value''.

Same as Printf.fprintf, but output on stderr.

Same as fprintf above, but output on get_err_formatter ().

The difference between 1.0 and the smallest exactly representable floating-point number greater than 1.0.

The difference between 1.0 and the smallest exactly representable floating-point number greater than 1.0.

equal u1 u2 is true.

equal u u' is u = u'.

equal s0 s1 is true if and only if s0 and s1 are character-wise equal.

equal s0 s1 is true if and only if s0 and s1 are character-wise equal.

equal s1 s2 tests whether the sets s1 and s2 are equal, that is, contain equal elements.

Provided the function eq defines an equality on elements, equal eq xs ys determines whether the sequences xs and ys are pointwise equal.

equal ~ok ~error r0 r1 tests equality of r0 and r1 using ok and error to respectively compare values wrapped by Ok _ and Error _.

equal e1 e2 tests for structural equality of e1 and e2.

equal eqa eqb (a1, b1) (a2, b2) is true if and only if eqa a1 a2 and eqb b1 b2 are both true.

equal eq o0 o1 is true if and only if o0 and o1 are both None or if they are Some v0 and Some v1 and eq v0 v1 is true.

The equal function for native ints.

equal s1 s2 tests whether the sets s1 and s2 are equal, that is, contain equal elements.

equal ~cmp m1 m2 tests whether the maps m1 and m2 are equal, that is, contain equal keys and associate them with equal data.

The equality predicate used to compare keys.

The equality predicate used to compare keys.

equal cmp m1 m2 tests whether the maps m1 and m2 are equal, that is, contain equal keys and associate them with equal data.

equal eq [a1; ...; an] [b1; ..; bm] holds when the two input lists have the same length, and for each pair of elements ai, bi at the same position we have eq ai bi.

equal eq [a1; ...; an] [b1; ..; bm] holds when the two input lists have the same length, and for each pair of elements ai, bi at the same position we have eq ai bi.

The equal function for int64s.

The equal function for int32s.

equal x y is true if and only if x = y.

eq [|a1; ...; an|] [|b1; ..; bm|] holds when the two input immutable arrays have the same length, and for each pair of elements ai, bi at the same position we have eq ai bi.

The equality predicate used to compare keys.

The equality predicate used to compare keys.

equal eq a b is true if and only if a and b have the same length n and for all i in [0;n-1], eq a.(i) b.(i) is true.

equal eq a b is true if and only if a and b have the same length n and for all i in [0;n-1], eq a.(i) b.(i) is true.

The equal function for floating-point numbers, compared using Float.compare.

equal ~left ~right e0 e1 tests equality of e0 and e1 using left and right to respectively compare values wrapped by Left _ and Right _.

equal eq a b holds when a and b have the same length, and for all indices i we have eq (get a i) (get b i).

Test two digests for equality.

The equal function for 16-byte digests.

The equal function for chars.

The equality function for byte sequences.

The equality function for byte sequences.

equal b0 b1 is true if and only if b0 and b1 are both true or both false.

equal eq a b is true if and only if a and b have the same length n and for all i in [0;n-1], eq a.(i) b.(i) is true.

equal eq a b is true if and only if a and b have the same length n and for all i in [0;n-1], eq a.(i) b.(i) is true.

Error function.

Complementary error function (erfc x = 1 - erf x).

The initial domain's formatter to write to standard error.

error e is Error e.

Return a string describing the given error code.

Return a string describing the given error code.

Convert an error description to a printable message.

error_to_failure r is v if r is Ok v and raises Failure e if r is Error e.

escaped s is s with special characters represented by escape sequences, following the lexical conventions of OCaml.

escaped s is s with special characters represented by escape sequences, following the lexical conventions of OCaml.

Return a string representing the given character, with special characters escaped following the lexical conventions of OCaml.

Return a copy of the argument, with special characters represented by escape sequences, following the lexical conventions of OCaml.

Return a copy of the argument, with special characters represented by escape sequences, following the lexical conventions of OCaml.

Establish a server on the given address.

Establish a server on the given address.

Set a new value for the atomic reference, and return the current value.

The name of the file containing the executable currently running.

execv prog args execute the program in file prog, with the arguments args, and the current process environment.

execv prog args execute the program in file prog, with the arguments args, and the current process environment.

Same as UnixLabels.execv, except that the third argument provides the environment to the program executed.

Same as Unix.execv, except that the third argument provides the environment to the program executed.

Same as UnixLabels.execv, except that the program is searched in the path.

Same as Unix.execv, except that the program is searched in the path.

Same as UnixLabels.execve, except that the program is searched in the path.

Same as Unix.execve, except that the program is searched in the path.

exists p s checks if at least one character of s satisfies the predicate p.

exists p s checks if at least one character of s satisfies the predicate p.

exists f s checks if at least one element of the set satisfies the predicate f.

exists p xs determines whether at least one element x of the sequence xs satisfies p x.

exists ~f s checks if at least one element of the set satisfies the predicate f.

exists ~f m checks if at least one binding of the map satisfies the predicate f.

exists f m checks if at least one binding of the map satisfies the predicate f.

exists ~f [a1; ...; an] checks if at least one element of the list satisfies the predicate f.

exists f [a1; ...; an] checks if at least one element of the list satisfies the predicate f.

exists f [|a1; ...; an|] checks if at least one element of the immutable array satisfies the predicate f.

exists f [|a1; ...; an|] checks if at least one element of the floatarray satisfies the predicate f.

exists f [|a1; ...; an|] checks if at least one element of the floatarray satisfies the predicate f.

exists f a is true if some element of a satisfies f.

exists p s checks if at least one character of s satisfies the predicate p.

exists p s checks if at least one character of s satisfies the predicate p.

exists ~f [|a1; ...; an|] checks if at least one element of the array satisfies the predicate f.

exists f [|a1; ...; an|] checks if at least one element of the array satisfies the predicate f.

exists2 p xs ys determines whether some pair (x, y) of elements drawn synchronously from the sequences xs and ys satisfies p x y.

Same as ListLabels.exists, but for a two-argument predicate.

Same as List.exists, but for a two-argument predicate.

Same as Iarray.exists, but for a two-argument predicate.

Same as Dynarray.exists, but for a two-argument predicate.

Same as ArrayLabels.exists, but for a two-argument predicate.

Same as Array.exists, but for a two-argument predicate.

Raise the Thread.Exit exception.

Terminate the process, returning the given status code to the operating system: usually 0 to indicate no errors, and a small positive integer to indicate failure.

Printexc.exn_slot_id returns an integer which uniquely identifies the constructor used to create the exception value exn (in the current runtime).

Printexc.exn_slot_name exn returns the internal name of the constructor used to create the exception value exn.

Exponential.

Exponential.

Exponentiation.

Base 2 exponential function.

expm1 x computes exp x -. 1.0, giving numerically-accurate results even if x is close to 0.0.

expm1 x computes exp x -. 1.0, giving numerically-accurate results even if x is close to 0.0.

extend s ~left ~right returns a new byte sequence that contains the bytes of s, with left uninitialized bytes prepended and right uninitialized bytes appended to it.

extend s left right returns a new byte sequence that contains the bytes of s, with left uninitialized bytes prepended and right uninitialized bytes appended to it.

extension name is the shortest suffix ext of name0 where:

Raise exception Failure with the given string.

Same as ListLabels.sort or ListLabels.stable_sort, whichever is faster on typical input.

Same as List.sort or List.stable_sort, whichever is faster on typical input.

Same as Iarray.sort or Iarray.stable_sort, whichever is faster on typical input.

Same as Float.ArrayLabels.sort or Float.ArrayLabels.stable_sort, whichever is faster on typical input.

Same as Float.Array.sort or Float.Array.stable_sort, whichever is faster on typical input.

Same as ArrayLabels.sort or ArrayLabels.stable_sort, whichever is faster on typical input.

Same as Array.sort or Array.stable_sort, whichever is faster on typical input.

Change the permissions of an opened file.

Change the permissions of an opened file.

Change the owner uid and owner gid of an opened file.

Change the owner uid and owner gid of an opened file.

fetch_and_add r n atomically increments the value of r by n, and returns the current value (before the increment).

fiber f constructs a continuation that runs the computation f.

Return the digest of the file whose name is given.

Return the digest of the file whose name is given.

Test if a file with the given name exists.

Weak.fill ar ofs len el sets to el all pointers of ar from ofs to ofs + len - 1.

fill a ~pos ~len x modifies the floatarray a in place, storing x in elements number pos to pos + len - 1.

fill a pos len x modifies the floatarray a in place, storing x in elements number pos to pos + len - 1.

fill s ~pos ~len c modifies s in place, replacing len characters with c, starting at pos.

fill s pos len c modifies s in place, replacing len characters with c, starting at pos.

Fill the given Bigarray with the given value.

Fill the given Bigarray with the given value.

Fill the given Bigarray with the given value.

Fill the given Bigarray with the given value.

Set all elements of a Bigarray to a given value.

fill a ~pos ~len x modifies the array a in place, storing x in elements number pos to pos + len - 1.

fill a pos len x modifies the array a in place, storing x in elements number pos to pos + len - 1.

filter f s returns the set of all elements in s that satisfy predicate f.

filter p xs is the sequence of the elements x of xs that satisfy p x.

filter ~f s returns the set of all elements in s that satisfy predicate f.

filter ~f m returns the map with all the bindings in m that satisfy predicate p.

filter f m returns the map with all the bindings in m that satisfy predicate p.

filter ~f l returns all the elements of the list l that satisfy the predicate f.

filter f l returns all the elements of the list l that satisfy the predicate f.

filter f a is a new array of all the elements of a that satisfy f.

filter_map f s returns the set of all v such that f x = Some v for some element x of s.

filter_map f xs is the sequence of the elements y such that f x = Some y, where x ranges over xs.

filter_map ~f s returns the set of all v such that f x = Some v for some element x of s.

filter_map ~f m applies the function f to every binding of m, and builds a map from the results.

filter_map f m applies the function f to every binding of m, and builds a map from the results.

filter_map ~f l applies f to every element of l, filters out the None elements and returns the list of the arguments of the Some elements.

filter_map f l applies f to every element of l, filters out the None elements and returns the list of the arguments of the Some elements.

filter_map f a is a new array of elements y such that f x is Some y for an element x of a.

Hashtbl.filter_map_inplace ~f tbl applies f to all bindings in table tbl and update each binding depending on the result of f.

Hashtbl.filter_map_inplace f tbl applies f to all bindings in table tbl and update each binding depending on the result of f.

Same as Seq.filter, but the predicate is applied to the index of the element as first argument (counting from 0), and the element itself as second argument.

Same as ListLabels.filter, but the predicate is applied to the index of the element as first argument (counting from 0), and the element itself as second argument.

Same as List.filter, but the predicate is applied to the index of the element as first argument (counting from 0), and the element itself as second argument.

finalise f v registers f as a finalisation function for v.

same as Gc.finalise except the value is not given as argument.

A finalisation function may call finalise_release to tell the GC that it can launch the next finalisation function without waiting for the current one to return.

find t x returns an instance of x found in t.

find x s returns the element of s equal to x (according to Ord.compare), or raise Not_found if no such element exists.

find p xs returns Some x, where x is the first element of the sequence xs that satisfies p x, if there is such an element.

find x s returns the element of s equal to x (according to Ord.compare), or raise Not_found if no such element exists.

find x m returns the current value of x in m, or raises Not_found if no binding for x exists.

Hashtbl.find tbl x returns the current binding of x in tbl, or raises Not_found if no such binding exists.

find x m returns the current value of x in m, or raises Not_found if no binding for x exists.

find ~f l returns the first element of the list l that satisfies the predicate f.

find f l returns the first element of the list l that satisfies the predicate f.

Hashtbl.find tbl x returns the current binding of x in tbl, or raises Not_found if no such binding exists.

Returns the data of the most-recently added ephemeron with the given keys, or None if there is no such ephemeron.

Returns the data of the most-recently added ephemeron with the given keys, or None if there is no such ephemeron.

Returns the data of the most-recently added ephemeron with the given key, or None if there is no such ephemeron.

find_all t x returns a list of all the instances of x found in t.

Hashtbl.find_all tbl x returns the list of all data associated with x in tbl.

find_all is another name for ListLabels.filter.

find_all is another name for List.filter.

Hashtbl.find_all tbl x returns the list of all data associated with x in tbl.

find_first f s, where f is a monotonically increasing function, returns the lowest element e of s such that f e, or raises Not_found if no such element exists.

find_first ~f s, where f is a monotonically increasing function, returns the lowest element e of s such that f e, or raises Not_found if no such element exists.

find_first ~f m, where f is a monotonically increasing function, returns the binding of m with the lowest key k such that f k, or raises Not_found if no such key exists.

find_first f m, where f is a monotonically increasing function, returns the binding of m with the lowest key k such that f k, or raises Not_found if no such key exists.

find_first_opt f s, where f is a monotonically increasing function, returns an option containing the lowest element e of s such that f e, or None if no such element exists.

find_first_opt ~f s, where f is a monotonically increasing function, returns an option containing the lowest element e of s such that f e, or None if no such element exists.

find_first_opt ~f m, where f is a monotonically increasing function, returns an option containing the binding of m with the lowest key k such that f k, or None if no such key exists.

find_first_opt f m, where f is a monotonically increasing function, returns an option containing the binding of m with the lowest key k such that f k, or None if no such key exists.

find_index p xs returns Some i, where i is the index of the first element of the sequence xs that satisfies p x, if there is such an element.

find_index ~f xs returns Some i, where i is the index of the first element of the list xs that satisfies f x, if there is such an element.

find_index f xs returns Some i, where i is the index of the first element of the list xs that satisfies f x, if there is such an element.

find_index f a returns Some i, where i is the index of the first element of the array a that satisfies f x, if there is such an element.

find_index ~f a returns Some i, where i is the index of the first element of the array a that satisfies f x, if there is such an element.

find_index f a returns Some i, where i is the index of the first element of the array a that satisfies f x, if there is such an element.

find_index f a returns Some i, where i is the index of the first element of the array a that satisfies f x, if there is such an element.

find_index ~f a returns Some i, where i is the index of the first element of the array a that satisfies f x, if there is such an element.

find_index f a returns Some i, where i is the index of the first element of the array a that satisfies f x, if there is such an element.

find_last f s, where f is a monotonically decreasing function, returns the highest element e of s such that f e, or raises Not_found if no such element exists.

find_last ~f s, where f is a monotonically decreasing function, returns the highest element e of s such that f e, or raises Not_found if no such element exists.

find_last ~f m, where f is a monotonically decreasing function, returns the binding of m with the highest key k such that f k, or raises Not_found if no such key exists.

find_last f m, where f is a monotonically decreasing function, returns the binding of m with the highest key k such that f k, or raises Not_found if no such key exists.

find_last a is None if a is empty and Some (get_last a) otherwise.

find_last_opt f s, where f is a monotonically decreasing function, returns an option containing the highest element e of s such that f e, or None if no such element exists.

find_last_opt ~f s, where f is a monotonically decreasing function, returns an option containing the highest element e of s such that f e, or None if no such element exists.

find_last_opt ~f m, where f is a monotonically decreasing function, returns an option containing the binding of m with the highest key k such that f k, or None if no such key exists.

find_last_opt f m, where f is a monotonically decreasing function, returns an option containing the binding of m with the highest key k such that f k, or None if no such key exists.

find_left (Left v) is Some v, find_left (Right _) is None

find_map f xs returns Some y, where x is the first element of the sequence xs such that f x = Some _, if there is such an element, and where y is defined by f x = Some y.

find_map ~f l applies f to the elements of l in order, and returns the first result of the form Some v, or None if none exist.

find_map f l applies f to the elements of l in order, and returns the first result of the form Some v, or None if none exist.

find_map f a applies f to the elements of a in order, and returns the first result of the form Some v, or None if none exist.

find_map f a applies f to the elements of a in order, and returns the first result of the form Some v, or None if none exist.

find_map ~f a applies f to the elements of a in order, and returns the first result of the form Some v, or None if none exist.

find_map f a applies f to the elements of a in order, and returns the first result of the form Some v, or None if none exist.

Same as find_map, but the predicate is applied to the index of the element as first argument (counting from 0), and the element itself as second argument.

Same as find_map, but the predicate is applied to the index of the element as first argument (counting from 0), and the element itself as second argument.

Same as find_map, but the predicate is applied to the index of the element as first argument (counting from 0), and the element itself as second argument.

Same as find_map, but the predicate is applied to the index of the element as first argument (counting from 0), and the element itself as second argument.

Same as find_map, but the predicate is applied to the index of the element as first argument (counting from 0), and the element itself as second argument.

Same as find_map, but the predicate is applied to the index of the element as first argument (counting from 0), and the element itself as second argument.

Same as find_map, but the predicate is applied to the index of the element as first argument (counting from 0), and the element itself as second argument.

Same as find_map, but the predicate is applied to the index of the element as first argument (counting from 0), and the element itself as second argument.

Same as find_map, but the predicate is applied to the index of the element as first argument (counting from 0), and the element itself as second argument.

find_opt t x returns an instance of x found in t or None if there is no such element.

find_opt x s returns the element of s equal to x (according to Ord.compare), or None if no such element exists.

find_opt x s returns the element of s equal to x (according to Ord.compare), or None if no such element exists.

find_opt x m returns Some v if the current value of x in m is v, or None if no binding for x exists.

Hashtbl.find_opt tbl x returns the current binding of x in tbl, or None if no such binding exists.

find_opt x m returns Some v if the current value of x in m is v, or None if no binding for x exists.

find ~f l returns the first element of the list l that satisfies the predicate f.

find f l returns the first element of the list l that satisfies the predicate f.

find_opt f a returns the first element of the immutable array a that satisfies the predicate f, or None if there is no value that satisfies f in the array a.

Hashtbl.find_opt tbl x returns the current binding of x in tbl, or None if no such binding exists.

find_opt f a returns the first element of the array a that satisfies the predicate f, or None if there is no value that satisfies f in the array a.

find_opt ~f a returns the first element of the array a that satisfies the predicate f, or None if there is no value that satisfies f in the array a.

find_opt f a returns the first element of the array a that satisfies the predicate f, or None if there is no value that satisfies f in the array a.

find_right (Right v) is Some v, find_right (Left _) is None

first_chars s n returns the first n characters of s.

fit_capacity a reallocates a backing array if necessary, so that the resulting capacity is exactly length a, with no additional empty space at the end.

flat_map f xs is equivalent to concat (map f xs).

Same as ListLabels.concat.

Same as List.concat.

flip f reverses the argument order of the binary function f.

Same as float_of_int.

Random.float bound returns a random floating-point number between 0 and bound (inclusive).

See Bigarray.char.

See Bigarray.char.

See Bigarray.char.

Return the floating-point number whose internal representation, according to the IEEE 754 floating-point 'double format' bit layout, is the given int64.

Return the floating-point number whose internal representation, according to the IEEE 754 floating-point 'single format' bit layout, is the given int32.

Convert an integer to floating-point.

Same as float_of_string_opt, but raise Failure "float_of_string" instead of returning None.

Convert the given string to a float.

Round below to an integer value.

Round below to an integer value.

Flush the buffer associated with the given output channel, performing all pending writes on that channel.

Flush the buffer associated with the given output channel, performing all pending writes on that channel.

Flush all open output channels; ignore errors.

Flush all open output channels; ignore errors.

Discard the contents of the buffer and reset the current position to 0.

Returns the material printed with str_formatter of the current domain, flushes the formatter and resets the corresponding buffer.

flush_symbolic_output_buffer sob returns the contents of buffer sob and resets buffer sob.

fma x y z returns x * y + z, with a best effort for computing this expression with a single rounding, using either hardware instructions (providing full IEEE compliance) or a software emulation.

fold f t init computes (f d1 (... (f dN init))) where d1 ... dN are the elements of t in some unspecified order.

fold f accu s is (f (... (f (f accu x1) x2) ...) xn) where x1 is the top of the stack, x2 the second element, and xn the bottom element.

fold f s init computes (f xN ... (f x2 (f x1 init))...), where x1 ... xN are the elements of s, in increasing order.

fold ~ok ~error r is ok v if r is Ok v and error e if r is Error e.

fold f accu q is equivalent to List.fold_left f accu l, where l is the list of q's elements.

fold f (a, b) applies f to a and b.

fold ~none ~some o is none if o is None and some v if o is Some v.

fold ~f s init computes (f xN ... (f x2 (f x1 init))...), where x1 ... xN are the elements of s, in increasing order.

fold ~f m ~init computes (f kN dN ... (f k1 d1 init)...), where k1 ... kN are the keys of all bindings in m (in increasing order), and d1 ... dN are the associated data.

Hashtbl.fold ~f tbl ~init computes (f kN dN ... (f k1 d1 init)...), where k1 ... kN are the keys of all bindings in tbl, and d1 ... dN are the associated values.

fold f m init computes (f kN dN ... (f k1 d1 init)...), where k1 ... kN are the keys of all bindings in m (in increasing order), and d1 ... dN are the associated data.

Hashtbl.fold f tbl init computes (f kN dN ... (f k1 d1 init)...), where k1 ... kN are the keys of all bindings in tbl, and d1 ... dN are the associated values.

fold ~left ~right (Left v) is left v, and fold ~left ~right (Right v) is right v.

fold_left f x s computes f (... (f (f x s.[0]) s.[1]) ...) s.[n-1], where n is the length of the string s.

fold_left f x s computes f (... (f (f x s.[0]) s.[1]) ...) s.[n-1], where n is the length of the string s.

fold_left f _ xs invokes f _ x successively for every element x of the sequence xs, from left to right.

fold_left ~f ~init [b1; ...; bn] is f (... (f (f init b1) b2) ...) bn.

fold_left f init [b1; ...; bn] is f (... (f (f init b1) b2) ...) bn.

fold_left f init a computes f (... (f (f init (get a 0)) (get a 1)) ...) (get a n-1), where n is the length of the immutable array a.

fold_left ~f x ~init computes f (... (f (f x init.(0)) init.(1)) ...) init.(n-1), where n is the length of the floatarray init.

fold_left f x init computes f (... (f (f x init.(0)) init.(1)) ...) init.(n-1), where n is the length of the floatarray init.

fold_left f acc a folds f over a in order, starting with accumulator acc.

fold_left f x s computes f (... (f (f x (get s 0)) (get s 1)) ...) (get s (n-1)), where n is the length of s.

fold_left f x s computes f (... (f (f x (get s 0)) (get s 1)) ...) (get s (n-1)), where n is the length of s.

fold_left ~f ~init a computes f (... (f (f init a.(0)) a.(1)) ...) a.(n-1), where n is the length of the array a.

fold_left f init a computes f (... (f (f init a.(0)) a.(1)) ...) a.(n-1), where n is the length of the array a.

fold_left2 f _ xs ys invokes f _ x y successively for every pair (x, y) of elements drawn synchronously from the sequences xs and ys.

fold_left2 ~f ~init [a1; ...; an] [b1; ...; bn] is f (... (f (f init a1 b1) a2 b2) ...) an bn.

fold_left2 f init [a1; ...; an] [b1; ...; bn] is f (... (f (f init a1 b1) a2 b2) ...) an bn.

fold_left_map is a combination of fold_left and map that threads an accumulator through calls to f.

fold_left_map is a combination of fold_left and map that threads an accumulator through calls to f.

fold_left_map is a combination of Iarray.fold_left and Iarray.map that threads an accumulator through calls to f.

fold_left_map is a combination of ArrayLabels.fold_left and ArrayLabels.map that threads an accumulator through calls to f.

fold_left_map is a combination of Array.fold_left and Array.map that threads an accumulator through calls to f.

fold_lefti f _ xs invokes f _ i x successively for every element x located at index i of the sequence xs.