Module type Time_ns_intf.Option
include Core__.Import.Immediate_option.S_int63
include Core_kernel.Immediate_option_intf.S_without_immediate with type t := t
val compare : t -> t -> Core_kernel__.Import.int
val hash_fold_t : Base.Hash.state -> t -> Base.Hash.state
val hash : t -> Base.Hash.hash_value
val sexp_of_t : t -> Ppx_sexp_conv_lib.Sexp.t
include Typerep_lib.Typerepable.S with type t := t
val typerep_of_t : t Typerep_lib.Std_internal.Typerep.t
val typename_of_t : t Typerep_lib.Typename.t
include Core_kernel.Immediate_option_intf.S_without_immediate_plain with type t := t
type value
The immediate value carried by the immediate option.
Given the presence of
unchecked_value
, thevalue
type should not have operations that depend on the value's validity for memory safety. In particular,unchecked_value
is not calledunsafe_value
as it would be if it could return a value that later resulted in a segmentation fault. For pointer-like values, useExt
.Nullable, for example.
type t
Represents
value option
without allocating aSome
tag. The interface does not enforce thatt
is immediate because some types, likeInt63.t
, are only immediate on 64-bit platforms. For representations whose type is immediate, useS
below which adds the[@@immediate]
annotation.
val none : t
val some : value -> t
val some_is_representable : value -> Core_kernel__.Import.bool
For some representations of immediate options, the encodings of
none
andsome
overlap. For these representations,some_is_representable value = false
ifvalue
cannot be represented as an option. For example,Int.Option
usesmin_value
to representnone
. For other representations,some_is_representable
always returnstrue
.
val is_none : t -> Core_kernel__.Import.bool
val is_some : t -> Core_kernel__.Import.bool
val value : t -> default:value -> value
value (some x) ~default = x
andvalue none ~default = default
.
val value_exn : t -> value
value_exn (some x) = x
.value_exn none
raises. UnlikeOption.value_exn
, there is no?message
argument, so that calls tovalue_exn
that do not raise also do not have to allocate.
val unchecked_value : t -> value
unchecked_value (some x) = x
.unchecked_value none
returns an unspecified value.unchecked_value t
is intended as an optimization ofvalue_exn t
whenis_some t
is known to be true.
val to_option : t -> value Core_kernel__.Import.option
val of_option : value Core_kernel__.Import.option -> t
module Optional_syntax : Core_kernel.Optional_syntax.S with type t := t with type value := value
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.sizer
val bin_write_t : t Bin_prot.Write.writer
val bin_read_t : t Bin_prot.Read.reader
val __bin_read_t__ : (int -> t) Bin_prot.Read.reader
This 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 variantt
afterwards.
val bin_shape_t : Bin_prot.Shape.t
val bin_writer_t : t Bin_prot.Type_class.writer
val bin_reader_t : t Bin_prot.Type_class.reader
val bin_t : t Bin_prot.Type_class.t
val hash_fold_t : Base.Hash.state -> t -> Base.Hash.state
val hash : t -> Base.Hash.hash_value
include Ppx_sexp_conv_lib.Sexpable.S with type t := t
val t_of_sexp : Sexplib0.Sexp.t -> t
val sexp_of_t : t -> Sexplib0.Sexp.t
include Core_kernel.Identifiable.S_common with type t := t
val compare : t -> t -> Core_kernel__.Import.int
val hash_fold_t : Base.Hash.state -> t -> Base.Hash.state
val hash : t -> Base.Hash.hash_value
val 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 -> int
ascending
is identical tocompare
.descending x y = ascending y x
. These are intended to be mnemonic when used likeList.sort ~compare:ascending
andList.sort ~cmp:descending
, since they cause the list to be sorted in ascending or descending order, respectively.
val descending : t -> t -> int
val between : t -> low:t -> high:t -> bool
between t ~low ~high
meanslow <= t <= high
val clamp_exn : t -> min:t -> max:t -> t
clamp_exn t ~min ~max
returnst'
, the closest value tot
such thatbetween t' ~low:min ~high:max
is 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.check
val validate_ubound : max:t Base.Maybe_bound.t -> t Base.Validate.check
val 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 := t
include 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_witness
module Set : Core_kernel.Set.S_binable with type Elt.t = t with type Elt.comparator_witness = comparator_witness
include Core_kernel.Hashable.S_binable with type t := t
val hash_fold_t : Base.Hash.state -> t -> Base.Hash.state
val hash : t -> Base.Hash.hash_value
val hashable : t Core_kernel.Hashtbl.Hashable.t
module Table : Core_kernel.Hashtbl.S_binable with type key = t
module Hash_set : Core_kernel.Hash_set.S_binable with type elt = t
module Hash_queue : Core_kernel.Hash_queue.S with type key = t