sig
module type OrderedType =
sig
type t
val compare : Rangemap.OrderedType.t -> Rangemap.OrderedType.t -> int
end
type fuzzy_order = Above | Below | Match
module type S =
sig
type key
type 'a t =
Empty
| Node of 'a Rangemap.S.t * Rangemap.S.key * 'a * 'a Rangemap.S.t *
int
val empty : 'a Rangemap.S.t
val is_empty : 'a Rangemap.S.t -> bool
val add : Rangemap.S.key -> 'a -> 'a Rangemap.S.t -> 'a Rangemap.S.t
val find : Rangemap.S.key -> 'a Rangemap.S.t -> 'a
val remove : Rangemap.S.key -> 'a Rangemap.S.t -> 'a Rangemap.S.t
val mem : Rangemap.S.key -> 'a Rangemap.S.t -> bool
val iter : (Rangemap.S.key -> 'a -> unit) -> 'a Rangemap.S.t -> unit
val map : ('a -> 'b) -> 'a Rangemap.S.t -> 'b Rangemap.S.t
val mapi :
(Rangemap.S.key -> 'a -> 'b) -> 'a Rangemap.S.t -> 'b Rangemap.S.t
val mapii :
(Rangemap.S.key -> 'a -> Rangemap.S.key * 'b) ->
'a Rangemap.S.t -> 'b Rangemap.S.t
val fold :
(Rangemap.S.key -> 'a -> 'b -> 'b) -> 'a Rangemap.S.t -> 'b -> 'b
val compare :
('a -> 'a -> int) -> 'a Rangemap.S.t -> 'a Rangemap.S.t -> int
val equal :
('a -> 'a -> bool) -> 'a Rangemap.S.t -> 'a Rangemap.S.t -> bool
val fold_range :
(Rangemap.S.key -> Rangemap.fuzzy_order) ->
(Rangemap.S.key -> 'a -> 'b -> 'b) -> 'a Rangemap.S.t -> 'b -> 'b
val height : 'a Rangemap.S.t -> int
val concerned_intervals :
(Rangemap.S.key -> Rangemap.S.key -> Rangemap.fuzzy_order) ->
Rangemap.S.key -> 'a Rangemap.S.t -> (Rangemap.S.key * 'a) list
exception Empty_rangemap
val lowest_binding : 'a Rangemap.S.t -> Rangemap.S.key * 'a
exception No_such_binding
val lowest_binding_above :
(Rangemap.S.key -> bool) -> 'a Rangemap.S.t -> Rangemap.S.key * 'a
val merge : 'a Rangemap.S.t -> 'a Rangemap.S.t -> 'a Rangemap.S.t
val add_whole :
(Rangemap.S.key -> Rangemap.S.key -> Rangemap.fuzzy_order) ->
Rangemap.S.key -> 'a -> 'a Rangemap.S.t -> 'a Rangemap.S.t
val remove_whole :
(Rangemap.S.key -> Rangemap.S.key -> Rangemap.fuzzy_order) ->
Rangemap.S.key -> 'a Rangemap.S.t -> 'a Rangemap.S.t
end
module Make :
functor (Ord : OrderedType) ->
sig
type key = Ord.t
type 'a t = Empty | Node of 'a t * key * 'a * 'a t * int
val empty : 'a t
val is_empty : 'a t -> bool
val add : key -> 'a -> 'a t -> 'a t
val find : key -> 'a t -> 'a
val remove : key -> 'a t -> 'a t
val mem : key -> 'a t -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val map : ('a -> 'b) -> 'a t -> 'b t
val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t
val mapii : (key -> 'a -> key * 'b) -> 'a t -> 'b t
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int
val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
val fold_range :
(key -> fuzzy_order) -> (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val height : 'a t -> int
val concerned_intervals :
(key -> key -> fuzzy_order) -> key -> 'a t -> (key * 'a) list
exception Empty_rangemap
val lowest_binding : 'a t -> key * 'a
exception No_such_binding
val lowest_binding_above : (key -> bool) -> 'a t -> key * 'a
val merge : 'a t -> 'a t -> 'a t
val add_whole :
(key -> key -> fuzzy_order) -> key -> 'a -> 'a t -> 'a t
val remove_whole : (key -> key -> fuzzy_order) -> key -> 'a t -> 'a t
end
end