include Immediate_option_intf.S with type value := t
include Immediate_option_intf.S_without_immediate with type value := t and type t := t
val compare : t -> t -> Base.Int.tval 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 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
include Immediate_option_intf.S_without_immediate_plain with type value := t and type t := t
val none : tval some : t -> tval some_is_representable : t -> Base.Bool.tFor some representations of immediate options, the encodings of
noneandsomeoverlap. For these representations,some_is_representable value = falseifvaluecannot be represented as an option. For example,Int.Optionusesmin_valueto representnone. For other representations,some_is_representablealways returnstrue.
val is_none : t -> Base.Bool.tval is_some : t -> Base.Bool.tval value : t -> default:t -> tvalue (some x) ~default = xandvalue none ~default = default.
val value_exn : t -> tvalue_exn (some x) = x.value_exn noneraises. UnlikeOption.value_exn, there is no?messageargument, so that calls tovalue_exnthat do not raise also do not have to allocate.
val unchecked_value : t -> tunchecked_value (some x) = x.unchecked_value nonereturns an unspecified value.unchecked_value tis intended as an optimization ofvalue_exn twhenis_some tis known to be true.
val to_option : t -> t Base.Option.tval of_option : t Base.Option.t -> t
module Optional_syntax : Optional_syntax.S with type t := t with type value := tinclude Comparable.S_plain with type t := t
include Base.Comparable.S with type t := t
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
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 : sig ... endmodule Map : Map.S_plain with type Key.t = t with type Key.comparator_witness = comparator_witnessmodule Set : Set.S_plain with type Elt.t = t with type Elt.comparator_witness = comparator_witnessinclude Quickcheckable.S with type t := t
val quickcheck_generator : t Base_quickcheck.Generator.tval quickcheck_observer : t Base_quickcheck.Observer.tval quickcheck_shrinker : t Base_quickcheck.Shrinker.t