sig
module type S = Interval_intf.S
module type S1 = Interval_intf.S1
type 'a t = 'a Interval.t
val sexp_of_t : ('a -> Sexplib.Sexp.t) -> 'a t -> Sexplib.Sexp.t
val t_of_sexp : (Sexplib.Sexp.t -> 'a) -> Sexplib.Sexp.t -> 'a t
val bin_size_t : 'a Bin_prot.Size.sizer -> 'a t Bin_prot.Size.sizer
val bin_write_t :
'a Bin_prot.Unsafe_write_c.writer -> 'a t Bin_prot.Write_ml.writer
val bin_write_t_ :
'a Bin_prot.Unsafe_write_c.writer -> 'a t Bin_prot.Unsafe_write_c.writer
val bin_writer_t :
'a Bin_prot.Type_class.writer -> 'a t Bin_prot.Type_class.writer
val bin_read_t :
'a Bin_prot.Unsafe_read_c.reader -> 'a t Bin_prot.Read_ml.reader
val bin_read_t_ :
'a Bin_prot.Unsafe_read_c.reader -> 'a t Bin_prot.Unsafe_read_c.reader
val bin_read_t__ :
'a Bin_prot.Unsafe_read_c.reader ->
(int -> 'a t) Bin_prot.Unsafe_read_c.reader
val bin_reader_t :
'a Bin_prot.Type_class.reader -> 'a t Bin_prot.Type_class.reader
val bin_t : 'a Bin_prot.Type_class.t -> 'a t Bin_prot.Type_class.t
type 'a interval = 'a t
module T : sig type 'a bound = 'a type 'a t = 'a t end
val create : 'a T.bound -> 'a T.bound -> 'a T.t
val empty : 'a T.t
val intersect : 'a T.t -> 'a T.t -> 'a T.t
val is_empty : 'a T.t -> bool
val is_empty_or_singleton : 'a T.t -> bool
val bounds : 'a T.t -> ('a T.bound * 'a T.bound) option
val lbound : 'a T.t -> 'a T.bound option
val ubound : 'a T.t -> 'a T.bound option
val bounds_exn : 'a T.t -> 'a T.bound * 'a T.bound
val lbound_exn : 'a T.t -> 'a T.bound
val ubound_exn : 'a T.t -> 'a T.bound
val contains : 'a T.t -> 'a T.bound -> bool
val compare_value :
'a T.t ->
'a T.bound -> [ `Above | `Below | `Interval_is_empty | `Within ]
val bound : 'a T.t -> 'a T.bound -> 'a T.bound option
val is_superset : 'a T.t -> of_:'a T.t -> bool
val is_subset : 'a T.t -> of_:'a T.t -> bool
val map : f:('a T.bound -> 'b T.bound) -> 'a T.t -> 'b T.t
val are_disjoint : 'a T.t list -> bool
val are_disjoint_as_open_intervals : 'a T.t list -> bool
val list_intersect : 'a T.t list -> 'a T.t list -> 'a T.t list
val half_open_intervals_are_a_partition : 'a T.t list -> bool
module Set :
sig
type 'a t = 'a Interval.Set.t
val sexp_of_t : ('a -> Sexplib.Sexp.t) -> 'a t -> Sexplib.Sexp.t
val t_of_sexp : (Sexplib.Sexp.t -> 'a) -> Sexplib.Sexp.t -> 'a t
val bin_size_t : 'a Bin_prot.Size.sizer -> 'a t Bin_prot.Size.sizer
val bin_write_t :
'a Bin_prot.Unsafe_write_c.writer -> 'a t Bin_prot.Write_ml.writer
val bin_write_t_ :
'a Bin_prot.Unsafe_write_c.writer ->
'a t Bin_prot.Unsafe_write_c.writer
val bin_writer_t :
'a Bin_prot.Type_class.writer -> 'a t Bin_prot.Type_class.writer
val bin_read_t :
'a Bin_prot.Unsafe_read_c.reader -> 'a t Bin_prot.Read_ml.reader
val bin_read_t_ :
'a Bin_prot.Unsafe_read_c.reader ->
'a t Bin_prot.Unsafe_read_c.reader
val bin_read_t__ :
'a Bin_prot.Unsafe_read_c.reader ->
(int -> 'a t) Bin_prot.Unsafe_read_c.reader
val bin_reader_t :
'a Bin_prot.Type_class.reader -> 'a t Bin_prot.Type_class.reader
val bin_t : 'a Bin_prot.Type_class.t -> 'a t Bin_prot.Type_class.t
module T :
sig
type 'a t = 'a t
type 'a bound = 'a
type 'a interval = 'a interval
end
val create : ('a T.bound * 'a T.bound) list -> 'a T.t
val create_from_intervals : 'a T.interval list -> 'a T.t
val contains : 'a T.t -> 'a T.bound -> bool
val contains_set : container:'a T.t -> contained:'a T.t -> bool
val ubound_exn : 'a T.t -> 'a T.bound
val lbound_exn : 'a T.t -> 'a T.bound
val ubound : 'a T.t -> 'a T.bound option
val lbound : 'a T.t -> 'a T.bound option
end
module Make :
functor
(M : sig
type t
type comparable = t
val ( >= ) : comparable -> comparable -> bool
val ( <= ) : comparable -> comparable -> bool
val ( = ) : comparable -> comparable -> bool
val ( > ) : comparable -> comparable -> bool
val ( < ) : comparable -> comparable -> bool
val ( <> ) : comparable -> comparable -> bool
val equal : comparable -> comparable -> bool
val compare : comparable -> comparable -> int
val ascending : comparable -> comparable -> int
val descending : comparable -> comparable -> int
val min : comparable -> comparable -> comparable
val max : comparable -> comparable -> comparable
module Map :
sig
type key = comparable
type +'a t
module T : sig type 'a key = key type ('a, 'b) t = 'b t end
type 'a sexpable = 'a t
val sexp_of_t :
('a -> Sexplib.Sexp.t) -> 'a sexpable -> Sexplib.Sexp.t
val t_of_sexp :
(Sexplib.Sexp.t -> 'a) -> Sexplib.Sexp.t -> 'a sexpable
val empty : 'a t
val singleton : key -> 'a -> 'a t
val is_empty : 'a t -> bool
val cardinal : 'a t -> int
val add : key:key -> data:'a -> 'a t -> 'a t
val add_multi : key:key -> data:'a -> 'a list t -> 'a list t
val change : 'a t -> key -> ('a option -> 'a option) -> 'a t
val find_exn : 'a t -> key -> 'a
val find : 'a t -> key -> 'a option
val remove : 'a t -> key -> 'a t
val mem : 'a t -> key -> bool
val iter : f:(key:key -> data:'a -> unit) -> 'a t -> unit
val map : f:('a -> 'b) -> 'a t -> 'b t
val mapi : f:(key:key -> data:'a -> 'b) -> 'a t -> 'b t
val fold :
f:(key:key -> data:'a -> 'b -> 'b) ->
'a t -> init:'b -> 'b
val fold_right :
f:(key:key -> data:'a -> 'b -> 'b) ->
'a t -> init:'b -> 'b
val filter : f:(key:key -> data:'a -> bool) -> 'a t -> 'a t
val filter_map : f:('a -> 'b option) -> 'a t -> 'b t
val filter_mapi :
f:(key:key -> data:'a -> 'b option) -> 'a t -> 'b t
val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int
val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
val keys : 'a t -> key list
val has_key : 'a t -> key -> bool
val data : 'a t -> 'a list
val of_alist :
(key * 'a) list -> [ `Duplicate_key of key | `Ok of 'a t ]
val of_alist_exn : (key * 'a) list -> 'a t
val of_alist_multi : (key * 'a) list -> 'a list t
val to_alist : 'a t -> (key * 'a) list
val combine_alist :
(key * 'a) list -> init:'b -> f:('a -> 'b -> 'b) -> 'b t
val merge :
f:(key:key -> 'a option -> 'b option -> 'c option) ->
'a t -> 'b t -> 'c t
val min_elt : 'a t -> (key * 'a) option
val min_elt_exn : 'a t -> key * 'a
val max_elt : 'a t -> (key * 'a) option
val max_elt_exn : 'a t -> key * 'a
val for_all : f:('a -> bool) -> 'a t -> bool
val exists : f:('a -> bool) -> 'a t -> bool
val fold_range_inclusive :
'a t ->
min:key ->
max:key ->
init:'b -> f:(key:key -> data:'a -> 'b -> 'b) -> 'b
val range_to_alist :
'a t -> min:key -> max:key -> (key * 'a) list
val prev_key : 'a t -> key -> key option
val next_key : 'a t -> key -> key option
val rank : 'a t -> key -> int option
end
module Set :
sig
type elt = comparable
type t
module T : sig type 'a elt = elt type 'a t = t end
type sexpable = t
val sexp_of_t : sexpable -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> sexpable
val empty : t
val is_empty : t -> bool
val mem : t -> elt -> bool
val add : t -> elt -> t
val singleton : elt -> t
val remove : t -> elt -> t
val union : t -> t -> t
val union_list : t list -> t
val inter : t -> t -> t
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : t -> f:(elt -> unit) -> unit
val fold : t -> init:'a -> f:(elt -> 'a -> 'a) -> 'a
val fold_until :
t ->
init:'a ->
f:(elt -> 'a -> [ `Continue of 'a | `Stop of 'a ]) -> 'a
val for_all : t -> f:(elt -> bool) -> bool
val exists : t -> f:(elt -> bool) -> bool
val filter : t -> f:(elt -> bool) -> t
val partition : t -> f:(elt -> bool) -> t * t
val cardinal : t -> int
val length : t -> int
val elements : t -> elt list
val min_elt : t -> elt option
val min_elt_exn : t -> elt
val max_elt : t -> elt option
val max_elt_exn : t -> elt
val choose : t -> elt option
val choose_exn : t -> elt
val of_list : elt list -> t
val to_list : t -> elt list
val of_array : elt array -> t
val to_array : t -> elt array
val split : elt -> t -> t * bool * t
val group_by : t -> equiv:(elt -> elt -> bool) -> t list
val find : t -> f:(elt -> bool) -> elt option
val find_exn : t -> f:(elt -> bool) -> elt
val find_index : t -> int -> elt option
val remove_index : t -> int -> t
end
type sexpable = t
val sexp_of_t : sexpable -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> sexpable
type binable = t
val bin_size_t : binable Bin_prot.Size.sizer
val bin_write_t : binable Bin_prot.Map_to_safe.writer
val bin_write_t_ : binable Bin_prot.Unsafe_write_c.writer
val bin_read_t : binable Bin_prot.Read_ml.reader
val bin_read_t_ : binable Bin_prot.Unsafe_read_c.reader
val bin_read_t__ :
(int -> binable) Bin_prot.Unsafe_read_c.reader
val bin_writer_t : binable Bin_prot.Type_class.writer
val bin_reader_t : binable Bin_prot.Type_class.reader
val bin_t : binable Bin_prot.Type_class.t
end) ->
sig
type t = Interval.Make(M).t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val bin_size_t : t Bin_prot.Size.sizer
val bin_write_t : t Bin_prot.Write_ml.writer
val bin_write_t_ : t Bin_prot.Unsafe_write_c.writer
val bin_writer_t : t Bin_prot.Type_class.writer
val bin_read_t : t Bin_prot.Read_ml.reader
val bin_read_t_ : t Bin_prot.Unsafe_read_c.reader
val bin_read_t__ : (int -> t) Bin_prot.Unsafe_read_c.reader
val bin_reader_t : t Bin_prot.Type_class.reader
val bin_t : t Bin_prot.Type_class.t
type 'a poly_t = M.t t
val sexp_of_poly_t :
('a -> Sexplib.Sexp.t) -> 'a poly_t -> Sexplib.Sexp.t
val poly_t_of_sexp :
(Sexplib.Sexp.t -> 'a) -> Sexplib.Sexp.t -> 'a poly_t
val bin_size_poly_t :
'a Bin_prot.Size.sizer -> 'a poly_t Bin_prot.Size.sizer
val bin_write_poly_t :
'a Bin_prot.Unsafe_write_c.writer ->
'a poly_t Bin_prot.Write_ml.writer
val bin_write_poly_t_ :
'a Bin_prot.Unsafe_write_c.writer ->
'a poly_t Bin_prot.Unsafe_write_c.writer
val bin_writer_poly_t :
'a Bin_prot.Type_class.writer ->
'a poly_t Bin_prot.Type_class.writer
val bin_read_poly_t :
'a Bin_prot.Unsafe_read_c.reader ->
'a poly_t Bin_prot.Read_ml.reader
val bin_read_poly_t_ :
'a Bin_prot.Unsafe_read_c.reader ->
'a poly_t Bin_prot.Unsafe_read_c.reader
val bin_read_poly_t__ :
'a Bin_prot.Unsafe_read_c.reader ->
(int -> 'a poly_t) Bin_prot.Unsafe_read_c.reader
val bin_reader_poly_t :
'a Bin_prot.Type_class.reader ->
'a poly_t Bin_prot.Type_class.reader
val bin_poly_t :
'a Bin_prot.Type_class.t -> 'a poly_t Bin_prot.Type_class.t
type interval = t
type bound = M.t
module T : sig type 'a bound = bound type 'a t = t end
val create : 'a T.bound -> 'a T.bound -> 'a T.t
val empty : 'a T.t
val intersect : 'a T.t -> 'a T.t -> 'a T.t
val is_empty : 'a T.t -> bool
val is_empty_or_singleton : 'a T.t -> bool
val bounds : 'a T.t -> ('a T.bound * 'a T.bound) option
val lbound : 'a T.t -> 'a T.bound option
val ubound : 'a T.t -> 'a T.bound option
val bounds_exn : 'a T.t -> 'a T.bound * 'a T.bound
val lbound_exn : 'a T.t -> 'a T.bound
val ubound_exn : 'a T.t -> 'a T.bound
val contains : 'a T.t -> 'a T.bound -> bool
val compare_value :
'a T.t ->
'a T.bound -> [ `Above | `Below | `Interval_is_empty | `Within ]
val bound : 'a T.t -> 'a T.bound -> 'a T.bound option
val is_superset : 'a T.t -> of_:'a T.t -> bool
val is_subset : 'a T.t -> of_:'a T.t -> bool
val map : f:('a T.bound -> 'b T.bound) -> 'a T.t -> 'b T.t
val are_disjoint : 'a T.t list -> bool
val are_disjoint_as_open_intervals : 'a T.t list -> bool
val list_intersect : 'a T.t list -> 'a T.t list -> 'a T.t list
val half_open_intervals_are_a_partition : 'a T.t list -> bool
val to_poly : t -> bound poly_t
module Set :
sig
type t = Interval.Make(M).Set.t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val bin_size_t : t Bin_prot.Size.sizer
val bin_write_t : t Bin_prot.Write_ml.writer
val bin_write_t_ : t Bin_prot.Unsafe_write_c.writer
val bin_writer_t : t Bin_prot.Type_class.writer
val bin_read_t : t Bin_prot.Read_ml.reader
val bin_read_t_ : t Bin_prot.Unsafe_read_c.reader
val bin_read_t__ : (int -> t) Bin_prot.Unsafe_read_c.reader
val bin_reader_t : t Bin_prot.Type_class.reader
val bin_t : t Bin_prot.Type_class.t
type 'a poly_t = 'a Interval.Make(M).Set.poly_t
val sexp_of_poly_t :
('a -> Sexplib.Sexp.t) -> 'a poly_t -> Sexplib.Sexp.t
val poly_t_of_sexp :
(Sexplib.Sexp.t -> 'a) -> Sexplib.Sexp.t -> 'a poly_t
val bin_size_poly_t :
'a Bin_prot.Size.sizer -> 'a poly_t Bin_prot.Size.sizer
val bin_write_poly_t :
'a Bin_prot.Unsafe_write_c.writer ->
'a poly_t Bin_prot.Write_ml.writer
val bin_write_poly_t_ :
'a Bin_prot.Unsafe_write_c.writer ->
'a poly_t Bin_prot.Unsafe_write_c.writer
val bin_writer_poly_t :
'a Bin_prot.Type_class.writer ->
'a poly_t Bin_prot.Type_class.writer
val bin_read_poly_t :
'a Bin_prot.Unsafe_read_c.reader ->
'a poly_t Bin_prot.Read_ml.reader
val bin_read_poly_t_ :
'a Bin_prot.Unsafe_read_c.reader ->
'a poly_t Bin_prot.Unsafe_read_c.reader
val bin_read_poly_t__ :
'a Bin_prot.Unsafe_read_c.reader ->
(int -> 'a poly_t) Bin_prot.Unsafe_read_c.reader
val bin_reader_poly_t :
'a Bin_prot.Type_class.reader ->
'a poly_t Bin_prot.Type_class.reader
val bin_poly_t :
'a Bin_prot.Type_class.t -> 'a poly_t Bin_prot.Type_class.t
module T :
sig
type 'a t = t
type 'a bound = bound
type 'a interval = interval
end
val create : ('a T.bound * 'a T.bound) list -> 'a T.t
val create_from_intervals : 'a T.interval list -> 'a T.t
val contains : 'a T.t -> 'a T.bound -> bool
val contains_set : container:'a T.t -> contained:'a T.t -> bool
val ubound_exn : 'a T.t -> 'a T.bound
val lbound_exn : 'a T.t -> 'a T.bound
val ubound : 'a T.t -> 'a T.bound option
val lbound : 'a T.t -> 'a T.bound option
val to_poly : t -> bound poly_t
end
end
module Float :
sig
type t = Interval.Float.t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val bin_size_t : t Bin_prot.Size.sizer
val bin_write_t : t Bin_prot.Write_ml.writer
val bin_write_t_ : t Bin_prot.Unsafe_write_c.writer
val bin_writer_t : t Bin_prot.Type_class.writer
val bin_read_t : t Bin_prot.Read_ml.reader
val bin_read_t_ : t Bin_prot.Unsafe_read_c.reader
val bin_read_t__ : (int -> t) Bin_prot.Unsafe_read_c.reader
val bin_reader_t : t Bin_prot.Type_class.reader
val bin_t : t Bin_prot.Type_class.t
type 'a poly_t = Float.t t
val sexp_of_poly_t :
('a -> Sexplib.Sexp.t) -> 'a poly_t -> Sexplib.Sexp.t
val poly_t_of_sexp :
(Sexplib.Sexp.t -> 'a) -> Sexplib.Sexp.t -> 'a poly_t
val bin_size_poly_t :
'a Bin_prot.Size.sizer -> 'a poly_t Bin_prot.Size.sizer
val bin_write_poly_t :
'a Bin_prot.Unsafe_write_c.writer ->
'a poly_t Bin_prot.Write_ml.writer
val bin_write_poly_t_ :
'a Bin_prot.Unsafe_write_c.writer ->
'a poly_t Bin_prot.Unsafe_write_c.writer
val bin_writer_poly_t :
'a Bin_prot.Type_class.writer -> 'a poly_t Bin_prot.Type_class.writer
val bin_read_poly_t :
'a Bin_prot.Unsafe_read_c.reader -> 'a poly_t Bin_prot.Read_ml.reader
val bin_read_poly_t_ :
'a Bin_prot.Unsafe_read_c.reader ->
'a poly_t Bin_prot.Unsafe_read_c.reader
val bin_read_poly_t__ :
'a Bin_prot.Unsafe_read_c.reader ->
(int -> 'a poly_t) Bin_prot.Unsafe_read_c.reader
val bin_reader_poly_t :
'a Bin_prot.Type_class.reader -> 'a poly_t Bin_prot.Type_class.reader
val bin_poly_t :
'a Bin_prot.Type_class.t -> 'a poly_t Bin_prot.Type_class.t
type interval = t
type bound = Float.t
module T : sig type 'a bound = bound type 'a t = t end
val create : 'a T.bound -> 'a T.bound -> 'a T.t
val empty : 'a T.t
val intersect : 'a T.t -> 'a T.t -> 'a T.t
val is_empty : 'a T.t -> bool
val is_empty_or_singleton : 'a T.t -> bool
val bounds : 'a T.t -> ('a T.bound * 'a T.bound) option
val lbound : 'a T.t -> 'a T.bound option
val ubound : 'a T.t -> 'a T.bound option
val bounds_exn : 'a T.t -> 'a T.bound * 'a T.bound
val lbound_exn : 'a T.t -> 'a T.bound
val ubound_exn : 'a T.t -> 'a T.bound
val contains : 'a T.t -> 'a T.bound -> bool
val compare_value :
'a T.t ->
'a T.bound -> [ `Above | `Below | `Interval_is_empty | `Within ]
val bound : 'a T.t -> 'a T.bound -> 'a T.bound option
val is_superset : 'a T.t -> of_:'a T.t -> bool
val is_subset : 'a T.t -> of_:'a T.t -> bool
val map : f:('a T.bound -> 'b T.bound) -> 'a T.t -> 'b T.t
val are_disjoint : 'a T.t list -> bool
val are_disjoint_as_open_intervals : 'a T.t list -> bool
val list_intersect : 'a T.t list -> 'a T.t list -> 'a T.t list
val half_open_intervals_are_a_partition : 'a T.t list -> bool
val to_poly : t -> bound poly_t
module Set :
sig
type t = Interval.Float.Set.t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val bin_size_t : t Bin_prot.Size.sizer
val bin_write_t : t Bin_prot.Write_ml.writer
val bin_write_t_ : t Bin_prot.Unsafe_write_c.writer
val bin_writer_t : t Bin_prot.Type_class.writer
val bin_read_t : t Bin_prot.Read_ml.reader
val bin_read_t_ : t Bin_prot.Unsafe_read_c.reader
val bin_read_t__ : (int -> t) Bin_prot.Unsafe_read_c.reader
val bin_reader_t : t Bin_prot.Type_class.reader
val bin_t : t Bin_prot.Type_class.t
type 'a poly_t = 'a Interval.Float.Set.poly_t
val sexp_of_poly_t :
('a -> Sexplib.Sexp.t) -> 'a poly_t -> Sexplib.Sexp.t
val poly_t_of_sexp :
(Sexplib.Sexp.t -> 'a) -> Sexplib.Sexp.t -> 'a poly_t
val bin_size_poly_t :
'a Bin_prot.Size.sizer -> 'a poly_t Bin_prot.Size.sizer
val bin_write_poly_t :
'a Bin_prot.Unsafe_write_c.writer ->
'a poly_t Bin_prot.Write_ml.writer
val bin_write_poly_t_ :
'a Bin_prot.Unsafe_write_c.writer ->
'a poly_t Bin_prot.Unsafe_write_c.writer
val bin_writer_poly_t :
'a Bin_prot.Type_class.writer ->
'a poly_t Bin_prot.Type_class.writer
val bin_read_poly_t :
'a Bin_prot.Unsafe_read_c.reader ->
'a poly_t Bin_prot.Read_ml.reader
val bin_read_poly_t_ :
'a Bin_prot.Unsafe_read_c.reader ->
'a poly_t Bin_prot.Unsafe_read_c.reader
val bin_read_poly_t__ :
'a Bin_prot.Unsafe_read_c.reader ->
(int -> 'a poly_t) Bin_prot.Unsafe_read_c.reader
val bin_reader_poly_t :
'a Bin_prot.Type_class.reader ->
'a poly_t Bin_prot.Type_class.reader
val bin_poly_t :
'a Bin_prot.Type_class.t -> 'a poly_t Bin_prot.Type_class.t
module T :
sig
type 'a t = t
type 'a bound = bound
type 'a interval = interval
end
val create : ('a T.bound * 'a T.bound) list -> 'a T.t
val create_from_intervals : 'a T.interval list -> 'a T.t
val contains : 'a T.t -> 'a T.bound -> bool
val contains_set : container:'a T.t -> contained:'a T.t -> bool
val ubound_exn : 'a T.t -> 'a T.bound
val lbound_exn : 'a T.t -> 'a T.bound
val ubound : 'a T.t -> 'a T.bound option
val lbound : 'a T.t -> 'a T.bound option
val to_poly : t -> bound poly_t
end
end
module Int :
sig
type t = Interval.Int.t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val bin_size_t : t Bin_prot.Size.sizer
val bin_write_t : t Bin_prot.Write_ml.writer
val bin_write_t_ : t Bin_prot.Unsafe_write_c.writer
val bin_writer_t : t Bin_prot.Type_class.writer
val bin_read_t : t Bin_prot.Read_ml.reader
val bin_read_t_ : t Bin_prot.Unsafe_read_c.reader
val bin_read_t__ : (int -> t) Bin_prot.Unsafe_read_c.reader
val bin_reader_t : t Bin_prot.Type_class.reader
val bin_t : t Bin_prot.Type_class.t
type 'a poly_t = Core_int.t t
val sexp_of_poly_t :
('a -> Sexplib.Sexp.t) -> 'a poly_t -> Sexplib.Sexp.t
val poly_t_of_sexp :
(Sexplib.Sexp.t -> 'a) -> Sexplib.Sexp.t -> 'a poly_t
val bin_size_poly_t :
'a Bin_prot.Size.sizer -> 'a poly_t Bin_prot.Size.sizer
val bin_write_poly_t :
'a Bin_prot.Unsafe_write_c.writer ->
'a poly_t Bin_prot.Write_ml.writer
val bin_write_poly_t_ :
'a Bin_prot.Unsafe_write_c.writer ->
'a poly_t Bin_prot.Unsafe_write_c.writer
val bin_writer_poly_t :
'a Bin_prot.Type_class.writer -> 'a poly_t Bin_prot.Type_class.writer
val bin_read_poly_t :
'a Bin_prot.Unsafe_read_c.reader -> 'a poly_t Bin_prot.Read_ml.reader
val bin_read_poly_t_ :
'a Bin_prot.Unsafe_read_c.reader ->
'a poly_t Bin_prot.Unsafe_read_c.reader
val bin_read_poly_t__ :
'a Bin_prot.Unsafe_read_c.reader ->
(int -> 'a poly_t) Bin_prot.Unsafe_read_c.reader
val bin_reader_poly_t :
'a Bin_prot.Type_class.reader -> 'a poly_t Bin_prot.Type_class.reader
val bin_poly_t :
'a Bin_prot.Type_class.t -> 'a poly_t Bin_prot.Type_class.t
type interval = t
type bound = Core_int.t
module T : sig type 'a bound = bound type 'a t = t end
val create : 'a T.bound -> 'a T.bound -> 'a T.t
val empty : 'a T.t
val intersect : 'a T.t -> 'a T.t -> 'a T.t
val is_empty : 'a T.t -> bool
val is_empty_or_singleton : 'a T.t -> bool
val bounds : 'a T.t -> ('a T.bound * 'a T.bound) option
val lbound : 'a T.t -> 'a T.bound option
val ubound : 'a T.t -> 'a T.bound option
val bounds_exn : 'a T.t -> 'a T.bound * 'a T.bound
val lbound_exn : 'a T.t -> 'a T.bound
val ubound_exn : 'a T.t -> 'a T.bound
val contains : 'a T.t -> 'a T.bound -> bool
val compare_value :
'a T.t ->
'a T.bound -> [ `Above | `Below | `Interval_is_empty | `Within ]
val bound : 'a T.t -> 'a T.bound -> 'a T.bound option
val is_superset : 'a T.t -> of_:'a T.t -> bool
val is_subset : 'a T.t -> of_:'a T.t -> bool
val map : f:('a T.bound -> 'b T.bound) -> 'a T.t -> 'b T.t
val are_disjoint : 'a T.t list -> bool
val are_disjoint_as_open_intervals : 'a T.t list -> bool
val list_intersect : 'a T.t list -> 'a T.t list -> 'a T.t list
val half_open_intervals_are_a_partition : 'a T.t list -> bool
val to_poly : t -> bound poly_t
module Set :
sig
type t = Interval.Int.Set.t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val bin_size_t : t Bin_prot.Size.sizer
val bin_write_t : t Bin_prot.Write_ml.writer
val bin_write_t_ : t Bin_prot.Unsafe_write_c.writer
val bin_writer_t : t Bin_prot.Type_class.writer
val bin_read_t : t Bin_prot.Read_ml.reader
val bin_read_t_ : t Bin_prot.Unsafe_read_c.reader
val bin_read_t__ : (int -> t) Bin_prot.Unsafe_read_c.reader
val bin_reader_t : t Bin_prot.Type_class.reader
val bin_t : t Bin_prot.Type_class.t
type 'a poly_t = 'a Interval.Int.Set.poly_t
val sexp_of_poly_t :
('a -> Sexplib.Sexp.t) -> 'a poly_t -> Sexplib.Sexp.t
val poly_t_of_sexp :
(Sexplib.Sexp.t -> 'a) -> Sexplib.Sexp.t -> 'a poly_t
val bin_size_poly_t :
'a Bin_prot.Size.sizer -> 'a poly_t Bin_prot.Size.sizer
val bin_write_poly_t :
'a Bin_prot.Unsafe_write_c.writer ->
'a poly_t Bin_prot.Write_ml.writer
val bin_write_poly_t_ :
'a Bin_prot.Unsafe_write_c.writer ->
'a poly_t Bin_prot.Unsafe_write_c.writer
val bin_writer_poly_t :
'a Bin_prot.Type_class.writer ->
'a poly_t Bin_prot.Type_class.writer
val bin_read_poly_t :
'a Bin_prot.Unsafe_read_c.reader ->
'a poly_t Bin_prot.Read_ml.reader
val bin_read_poly_t_ :
'a Bin_prot.Unsafe_read_c.reader ->
'a poly_t Bin_prot.Unsafe_read_c.reader
val bin_read_poly_t__ :
'a Bin_prot.Unsafe_read_c.reader ->
(int -> 'a poly_t) Bin_prot.Unsafe_read_c.reader
val bin_reader_poly_t :
'a Bin_prot.Type_class.reader ->
'a poly_t Bin_prot.Type_class.reader
val bin_poly_t :
'a Bin_prot.Type_class.t -> 'a poly_t Bin_prot.Type_class.t
module T :
sig
type 'a t = t
type 'a bound = bound
type 'a interval = interval
end
val create : ('a T.bound * 'a T.bound) list -> 'a T.t
val create_from_intervals : 'a T.interval list -> 'a T.t
val contains : 'a T.t -> 'a T.bound -> bool
val contains_set : container:'a T.t -> contained:'a T.t -> bool
val ubound_exn : 'a T.t -> 'a T.bound
val lbound_exn : 'a T.t -> 'a T.bound
val ubound : 'a T.t -> 'a T.bound option
val lbound : 'a T.t -> 'a T.bound option
val to_poly : t -> bound poly_t
end
end
module Time :
sig
type t = Interval.Time.t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val bin_size_t : t Bin_prot.Size.sizer
val bin_write_t : t Bin_prot.Write_ml.writer
val bin_write_t_ : t Bin_prot.Unsafe_write_c.writer
val bin_writer_t : t Bin_prot.Type_class.writer
val bin_read_t : t Bin_prot.Read_ml.reader
val bin_read_t_ : t Bin_prot.Unsafe_read_c.reader
val bin_read_t__ : (int -> t) Bin_prot.Unsafe_read_c.reader
val bin_reader_t : t Bin_prot.Type_class.reader
val bin_t : t Bin_prot.Type_class.t
type 'a poly_t = Time.t t
val sexp_of_poly_t :
('a -> Sexplib.Sexp.t) -> 'a poly_t -> Sexplib.Sexp.t
val poly_t_of_sexp :
(Sexplib.Sexp.t -> 'a) -> Sexplib.Sexp.t -> 'a poly_t
val bin_size_poly_t :
'a Bin_prot.Size.sizer -> 'a poly_t Bin_prot.Size.sizer
val bin_write_poly_t :
'a Bin_prot.Unsafe_write_c.writer ->
'a poly_t Bin_prot.Write_ml.writer
val bin_write_poly_t_ :
'a Bin_prot.Unsafe_write_c.writer ->
'a poly_t Bin_prot.Unsafe_write_c.writer
val bin_writer_poly_t :
'a Bin_prot.Type_class.writer -> 'a poly_t Bin_prot.Type_class.writer
val bin_read_poly_t :
'a Bin_prot.Unsafe_read_c.reader -> 'a poly_t Bin_prot.Read_ml.reader
val bin_read_poly_t_ :
'a Bin_prot.Unsafe_read_c.reader ->
'a poly_t Bin_prot.Unsafe_read_c.reader
val bin_read_poly_t__ :
'a Bin_prot.Unsafe_read_c.reader ->
(int -> 'a poly_t) Bin_prot.Unsafe_read_c.reader
val bin_reader_poly_t :
'a Bin_prot.Type_class.reader -> 'a poly_t Bin_prot.Type_class.reader
val bin_poly_t :
'a Bin_prot.Type_class.t -> 'a poly_t Bin_prot.Type_class.t
type interval = t
type bound = Time.t
module T : sig type 'a bound = bound type 'a t = t end
val create : 'a T.bound -> 'a T.bound -> 'a T.t
val empty : 'a T.t
val intersect : 'a T.t -> 'a T.t -> 'a T.t
val is_empty : 'a T.t -> bool
val is_empty_or_singleton : 'a T.t -> bool
val bounds : 'a T.t -> ('a T.bound * 'a T.bound) option
val lbound : 'a T.t -> 'a T.bound option
val ubound : 'a T.t -> 'a T.bound option
val bounds_exn : 'a T.t -> 'a T.bound * 'a T.bound
val lbound_exn : 'a T.t -> 'a T.bound
val ubound_exn : 'a T.t -> 'a T.bound
val contains : 'a T.t -> 'a T.bound -> bool
val compare_value :
'a T.t ->
'a T.bound -> [ `Above | `Below | `Interval_is_empty | `Within ]
val bound : 'a T.t -> 'a T.bound -> 'a T.bound option
val is_superset : 'a T.t -> of_:'a T.t -> bool
val is_subset : 'a T.t -> of_:'a T.t -> bool
val map : f:('a T.bound -> 'b T.bound) -> 'a T.t -> 'b T.t
val are_disjoint : 'a T.t list -> bool
val are_disjoint_as_open_intervals : 'a T.t list -> bool
val list_intersect : 'a T.t list -> 'a T.t list -> 'a T.t list
val half_open_intervals_are_a_partition : 'a T.t list -> bool
val to_poly : t -> bound poly_t
module Set :
sig
type t = Interval.Time.Set.t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val bin_size_t : t Bin_prot.Size.sizer
val bin_write_t : t Bin_prot.Write_ml.writer
val bin_write_t_ : t Bin_prot.Unsafe_write_c.writer
val bin_writer_t : t Bin_prot.Type_class.writer
val bin_read_t : t Bin_prot.Read_ml.reader
val bin_read_t_ : t Bin_prot.Unsafe_read_c.reader
val bin_read_t__ : (int -> t) Bin_prot.Unsafe_read_c.reader
val bin_reader_t : t Bin_prot.Type_class.reader
val bin_t : t Bin_prot.Type_class.t
type 'a poly_t = 'a Interval.Time.Set.poly_t
val sexp_of_poly_t :
('a -> Sexplib.Sexp.t) -> 'a poly_t -> Sexplib.Sexp.t
val poly_t_of_sexp :
(Sexplib.Sexp.t -> 'a) -> Sexplib.Sexp.t -> 'a poly_t
val bin_size_poly_t :
'a Bin_prot.Size.sizer -> 'a poly_t Bin_prot.Size.sizer
val bin_write_poly_t :
'a Bin_prot.Unsafe_write_c.writer ->
'a poly_t Bin_prot.Write_ml.writer
val bin_write_poly_t_ :
'a Bin_prot.Unsafe_write_c.writer ->
'a poly_t Bin_prot.Unsafe_write_c.writer
val bin_writer_poly_t :
'a Bin_prot.Type_class.writer ->
'a poly_t Bin_prot.Type_class.writer
val bin_read_poly_t :
'a Bin_prot.Unsafe_read_c.reader ->
'a poly_t Bin_prot.Read_ml.reader
val bin_read_poly_t_ :
'a Bin_prot.Unsafe_read_c.reader ->
'a poly_t Bin_prot.Unsafe_read_c.reader
val bin_read_poly_t__ :
'a Bin_prot.Unsafe_read_c.reader ->
(int -> 'a poly_t) Bin_prot.Unsafe_read_c.reader
val bin_reader_poly_t :
'a Bin_prot.Type_class.reader ->
'a poly_t Bin_prot.Type_class.reader
val bin_poly_t :
'a Bin_prot.Type_class.t -> 'a poly_t Bin_prot.Type_class.t
module T :
sig
type 'a t = t
type 'a bound = bound
type 'a interval = interval
end
val create : ('a T.bound * 'a T.bound) list -> 'a T.t
val create_from_intervals : 'a T.interval list -> 'a T.t
val contains : 'a T.t -> 'a T.bound -> bool
val contains_set : container:'a T.t -> contained:'a T.t -> bool
val ubound_exn : 'a T.t -> 'a T.bound
val lbound_exn : 'a T.t -> 'a T.bound
val ubound : 'a T.t -> 'a T.bound option
val lbound : 'a T.t -> 'a T.bound option
val to_poly : t -> bound poly_t
end
val create_ending_after : Ofday.t * Ofday.t -> now:Time.t -> t
val create_ending_before : Ofday.t * Ofday.t -> ubound:Time.t -> t
end
end