Core_kernel.Maybe_boundThis module extends Base.Maybe_bound with bin_io and with compare functions in the form of As_lower_bound and As_upper_bound modules.
include Bin_prot.Binable.S1 with type 'a t := 'a tval bin_shape_t : Bin_prot.Shape.t -> Bin_prot.Shape.tval bin_size_t : ('a, 'a t) Bin_prot.Size.sizer1val bin_write_t : ('a, 'a t) Bin_prot.Write.writer1val bin_read_t : ('a, 'a t) Bin_prot.Read.reader1val __bin_read_t__ : ('a, int -> 'a t) Bin_prot.Read.reader1val bin_writer_t : ('a, 'a t) Bin_prot.Type_class.S1.writerval bin_reader_t : ('a, 'a t) Bin_prot.Type_class.S1.readerval bin_t : ('a, 'a t) Bin_prot.Type_class.S1.tinclude module type of struct include Base.Maybe_bound end with type 'a t := 'a tval all : 'a list -> 'a t listinclude Base.Sexpable.S1 with type 'a t := 'a tval t_of_sexp : (Sexplib0.Sexp.t -> 'a) -> Sexplib0.Sexp.t -> 'a tval sexp_of_t : ('a -> Sexplib0.Sexp.t) -> 'a t -> Sexplib0.Sexp.tval is_lower_bound : 'a t -> of_:'a -> compare:('a -> 'a -> int) -> boolval is_upper_bound : 'a t -> of_:'a -> compare:('a -> 'a -> int) -> boolinterval_contains_exn ~lower ~upper x ~compare raises if lower and upper are crossed.
bounds_crossed ~lower ~upper ~compare returns true if lower > upper.
It ignores whether the bounds are Incl or Excl.
val sexp_of_interval_comparison : interval_comparison -> Base.Sexp.tval interval_comparison_of_sexp : Base.Sexp.t -> interval_comparisonval compare_interval_comparison : interval_comparison -> interval_comparison -> intval hash_fold_interval_comparison : Base.Hash.state -> interval_comparison -> Base.Hash.stateval hash_interval_comparison : interval_comparison -> Base.Hash.hash_valueval compare_to_interval_exn : lower:'a t -> upper:'a t -> 'a -> compare:('a -> 'a -> int)
-> interval_comparisoncompare_to_interval_exn ~lower ~upper x ~compare raises if lower and upper are crossed.
module As_lower_bound : sig ... endCompares t values as lower bounds, where Unbounded is lowest, Incl x < Excl x, and other cases of Incl and/or Excl are compared based on 'a. If As_lower_bound.compare compare t1 t2 <= 0 and is_lower_bound t2 ~of_:a ~compare, then is_lower_bound t1 ~of_:a ~compare. For example, for int As_lower_bound.t:
module As_upper_bound : sig ... endCompares t values as upper bounds, where Unbounded is highest, Incl x > Excl x, and other cases of Incl and/or Excl are compared based on 'a. If As_upper_bound.compare compare_a t1 t2 <= 0 and is_upper_bound t1 ~of_:a ~compare, then is_upper_bound t2 ~of_:a ~compare. For example, for int As_upper_bound.t:
module Stable : sig ... end