UuidThread-safe generation of random identifiers in the UUID format.
This library is not RFC 4122 compliant: the version is set in the output, but the variant is not.
When am_running_test, sexp_of_t masks the UUID, showing only "<uuid-omitted-in-test>". You can use Unstable.sexp_of_t if you definitely want to see it within your tests.
include Ppx_hash_lib.Hashable.S_any with type t := tinclude Core.Comparator.S__portable with type t := tinclude Core.Identifiable.S__local
with type t := t
and type comparator_witness := comparator_witnessinclude Bin_prot.Binable.S__local with type t := tinclude Bin_prot.Binable.S_only_functions__local with type t := tval bin_read_t : t Bin_prot.Read.readerval __bin_read_t__ : t Bin_prot.Read.vtag_readerThis function only needs implementation if t exposed to be a polymorphic variant. Despite what the type reads, this does *not* produce a function after reading; instead it takes the constructor tag (int) before reading and reads the rest of the variant t afterwards.
val bin_shape_t : Bin_prot.Shape.tval bin_writer_t : t Bin_prot.Type_class.writerval bin_reader_t : t Bin_prot.Type_class.readerval bin_t : t Bin_prot.Type_class.tinclude Ppx_hash_lib.Hashable.S_any with type t := tinclude Sexplib0.Sexpable.S with type t := tinclude Sexplib0.Sexpable.Of_sexp with type t := tinclude Sexplib0.Sexpable.Sexp_of with type t := tinclude Ppx_compare_lib.Comparable.S with type t := tinclude Ppx_compare_lib.Comparable.S__local with type t := tinclude Ppx_hash_lib.Hashable.S_any with type t := tval sexp_of_t : t -> Sexplib0.Sexp.tinclude Base.Pretty_printer.S with type t := tval pp : Base.Formatter.t -> t -> unitinclude Base.Comparable.S__local
with type t := t
with type comparator_witness := comparator_witnessinclude Base.Comparisons.S__local with type t := tcompare t1 t2 returns 0 if t1 is equal to t2, a negative integer if t1 is less than t2, and a positive integer if t1 is greater than t2.
ascending is identical to compare. descending x y = ascending y x. These are intended to be mnemonic when used like List.sort ~compare:ascending and List.sort ~cmp:descending, since they cause the list to be sorted in ascending or descending order, respectively.
clamp_exn t ~min ~max returns t', the closest value to t such that between t' ~low:min ~high:max is true.
Raises if not (min <= max).
val clamp : t -> min:t -> max:t -> t Base.Or_error.tinclude Base.Comparator.S
with type t := t
with type comparator_witness := comparator_witnessval validate_lbound : min:t Core.Maybe_bound.t -> t Validate.checkval validate_ubound : max:t Core.Maybe_bound.t -> t Validate.checkval validate_bound :
min:t Core.Maybe_bound.t ->
max:t Core.Maybe_bound.t ->
t Validate.checkmodule Replace_polymorphic_compare :
Base.Comparable.Comparisons__local with type t := tinclude Core.Comparator.S
with type t := t
with type comparator_witness := comparator_witnessval comparator : (t, comparator_witness) Base.Comparator.T.comparatormodule Map :
Core.Map.S_binable
with type Key.t = t
with type Key.comparator_witness = comparator_witnessmodule Set :
Core.Set.S_binable
with type Elt.t = t
with type Elt.comparator_witness = comparator_witnessinclude Core.Hashable.S_binable with type t := tinclude Ppx_hash_lib.Hashable.S_any with type t := tval hash_fold_t : t Ppx_hash_lib.hash_foldval hash : t -> Ppx_hash_lib.Std.Hash.hash_valueval hashable : t Base.Hashable.tmodule Table : Core.Hashtbl.S_binable with type key = tmodule Hash_set : Core.Hash_set.S_binable with type elt = tmodule Hash_queue : Core.Hash_queue.S with type key = tinclude Core.Invariant.S with type t := tval invariant : t -> unitinclude Core.Quickcheckable.S with type t := tval quickcheck_generator : t Base_quickcheck.Generator.tval quickcheck_observer : t Base_quickcheck.Observer.tval quickcheck_shrinker : t Base_quickcheck.Shrinker.tval t_of_sexp : Core.Sexp.t -> t @@ portableval create_random : Core.Random.State.t -> t @@ portableval nil : t @@ portableval arg_type : t Core.Command.Arg_type.t @@ portablemodule Unstable : sig ... endmodule Stable : sig ... end