Module Core__Core_time_ns.Span
type t= Core_kernel.Time_ns.Span.t
include Typerep_lib.Typerepable.S with type t := t
val typerep_of_t : t Typerep_lib.Std_internal.Typerep.tval typename_of_t : t Typerep_lib.Typename.t
val sexp_of_t : t -> Ppx_sexp_conv_lib.Sexp.t
include Core__.Import.Identifiable with type t := t
include Bin_prot.Binable.S with type t := t
include Bin_prot.Binable.S_only_functions with type t := t
val bin_size_t : t Bin_prot.Size.sizerval bin_write_t : t Bin_prot.Write.writerval bin_read_t : t Bin_prot.Read.readerval __bin_read_t__ : (int -> t) Bin_prot.Read.readerThis function only needs implementation if
texposed 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 varianttafterwards.
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.t
val hash_fold_t : Base.Hash.state -> t -> Base.Hash.stateval hash : t -> Base.Hash.hash_value
include Ppx_sexp_conv_lib.Sexpable.S with type t := t
val t_of_sexp : Sexplib0.Sexp.t -> tval sexp_of_t : t -> Sexplib0.Sexp.t
include Core_kernel.Identifiable.S_common with type t := t
val compare : t -> t -> Core_kernel__.Import.intval hash_fold_t : Base.Hash.state -> t -> Base.Hash.stateval hash : t -> Base.Hash.hash_valueval sexp_of_t : t -> Ppx_sexp_conv_lib.Sexp.t
include Core_kernel__.Import.Stringable.S with type t := t
include Core_kernel__.Import.Pretty_printer.S with type t := t
val pp : Base.Formatter.t -> t -> unit
include Core_kernel.Comparable.S_binable with type t := t
include Core_kernel__.Comparable_intf.S_common
include Base.Comparable.S
include Base__.Comparable_intf.Polymorphic_compare
val ascending : t -> t -> intascendingis identical tocompare.descending x y = ascending y x. These are intended to be mnemonic when used likeList.sort ~compare:ascendingandList.sort ~cmp:descending, since they cause the list to be sorted in ascending or descending order, respectively.
val descending : t -> t -> intval between : t -> low:t -> high:t -> boolbetween t ~low ~highmeanslow <= t <= high
val clamp_exn : t -> min:t -> max:t -> tclamp_exn t ~min ~maxreturnst', the closest value totsuch thatbetween t' ~low:min ~high:maxis true.Raises if
not (min <= max).
val clamp : t -> min:t -> max:t -> t Base.Or_error.t
include Base.Comparator.S with type t := t
val comparator : (t, comparator_witness) Base.Comparator.comparator
include Base__.Comparable_intf.Validate with type t := t
val validate_lbound : min:t Base.Maybe_bound.t -> t Base.Validate.checkval validate_ubound : max:t Base.Maybe_bound.t -> t Base.Validate.checkval validate_bound : min:t Base.Maybe_bound.t -> max:t Base.Maybe_bound.t -> t Base.Validate.check
module Replace_polymorphic_compare : Core_kernel__.Comparable_intf.Polymorphic_compare with type t := tinclude Core_kernel__.Comparable_intf.Map_and_set_binable with type t := t with type comparator_witness := comparator_witness
include Core_kernel.Comparator.S with type t := t
val comparator : (t, comparator_witness) Core_kernel.Comparator.comparator
module Map : Core_kernel.Map.S_binable with type Key.t = t with type Key.comparator_witness = comparator_witnessmodule Set : Core_kernel.Set.S_binable with type Elt.t = t with type Elt.comparator_witness = comparator_witnessinclude Core_kernel.Hashable.S_binable with type t := t
val hash_fold_t : Base.Hash.state -> t -> Base.Hash.stateval hash : t -> Base.Hash.hash_value
val hashable : t Core_kernel.Hashtbl.Hashable.t
module Table : Core_kernel.Hashtbl.S_binable with type key = tmodule Hash_set : Core_kernel.Hash_set.S_binable with type elt = tmodule Hash_queue : Core_kernel.Hash_queue.S with type Key.t = tinclude Core__.Import.Comparable.With_zero with type t := t
val validate_positive : t Base.Validate.checkval validate_non_negative : t Base.Validate.checkval validate_negative : t Base.Validate.checkval validate_non_positive : t Base.Validate.checkval is_positive : t -> boolval is_non_negative : t -> boolval is_negative : t -> boolval is_non_positive : t -> boolval sign : t -> Base__.Sign0.tReturns
Neg,Zero, orPosin a way consistent with the above functions.
val arg_type : t Core_kernel.Command.Arg_type.t
module Parts : sig ... endSimilar to
Time.Span.Parts.
val nanosecond : tval microsecond : tval millisecond : tval second : tval minute : tval hour : tval day : tval of_ns : float -> tval of_us : float -> tval of_ms : float -> tval of_sec : float -> tval of_min : float -> tval of_hr : float -> tval of_day : float -> tval to_ns : t -> floatval to_us : t -> floatval to_ms : t -> floatval to_sec : t -> floatval to_min : t -> floatval to_hr : t -> floatval to_day : t -> floatval of_int_us : int -> tval of_int_ms : int -> tval of_int_sec : int -> tval to_int_us : t -> intval to_int_ms : t -> intval to_int_sec : t -> intval zero : tval min_value : tval max_value : tval (+) : t -> t -> toverflows silently
val abs : t -> tval neg : t -> tval scale : t -> float -> tval scale_int : t -> int -> toverflows silently
val div : t -> t -> Core__.Import.Int63.tval (/) : t -> float -> tval (//) : t -> t -> floatval create : ?sign:Core__.Import.Sign.t -> ?day:int -> ?hr:int -> ?min:int -> ?sec:int -> ?ms:int -> ?us:int -> ?ns:int -> unit -> tOverflows silently.
val to_short_string : t -> stringval randomize : t -> percent:Core__.Import.Percent.t -> tval to_parts : t -> Parts.tval to_unit_of_time : t -> Core__.Import.Unit_of_time.tval of_unit_of_time : Core__.Import.Unit_of_time.t -> tval to_string_hum : ?delimiter:char -> ?decimals:int -> ?align_decimal:bool -> ?unit_of_time:Core__.Import.Unit_of_time.t -> t -> stringSee
Time.Span.to_string_hum.
val to_span : t -> Core__.Import_time.Time.Span.tval of_span : Core__.Import_time.Time.Span.t -> tval to_span_float_round_nearest : t -> Core__.Import_time.Time.Span.tval to_span_float_round_nearest_microsecond : t -> Core__.Import_time.Time.Span.tval of_span_float_round_nearest : Core__.Import_time.Time.Span.t -> tval of_span_float_round_nearest_microsecond : Core__.Import_time.Time.Span.t -> t
val to_int63_ns : t -> Core__.Import.Int63.tFast, implemented as the identity function.
val of_int63_ns : Core__.Import.Int63.t -> tSomewhat fast, implemented as a range check.
val to_int_ns : t -> intWill raise on 32-bit platforms with spans corresponding to contemporary
now. Considerto_int63_nsinstead.
val of_int_ns : int -> tval to_proportional_float : t -> floatThe only condition
to_proportional_floatis supposed to satisfy is that for allt1, t2 : t:to_proportional_float t1 /. to_proportional_float t2 = t1 // t2.
module Stable : sig ... endval random : ?state:Core__.Import.Random.State.t -> unit -> t
module Option : sig ... endSpan.Option.tis likeSpan.t option, except that the value is immediate on architectures whereInt63.tis immediate. This module should mainly be used to avoid allocations.