Module Main.Type.IMap


module IMap: sig .. end

type 'a t = (int * int * 'a) AvlTree.tree 
type key = int 
val empty : 'a t
val is_empty : 'a t -> bool
val add : ?eq:('a -> 'a -> bool) ->
int -> 'a -> 'a t -> 'a t
val add_range : ?eq:('a -> 'a -> bool) ->
int -> int -> 'a -> 'a t -> 'a t
val find : int -> 'a t -> 'a
val remove : int -> 'a t -> 'a t
val remove_range : int -> int -> 'a t -> 'a t
val from : int -> 'a t -> 'a t
val after : int -> 'a t -> 'a t
val until : int -> 'a t -> 'a t
val before : int -> 'a t -> 'a t
val mem : int -> 'a t -> bool
val iter : (int -> 'a -> unit) -> 'a t -> unit
val iter_range : (int -> int -> 'a -> unit) -> 'a t -> unit
val map : ?eq:('a -> 'a -> bool) ->
('b -> 'a) -> 'b t -> 'a t
val mapi : ?eq:('a -> 'a -> bool) ->
(int -> 'b -> 'a) -> 'b t -> 'a t
val fold : (int -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val fold_range : (int -> int -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val set_to_map : Main.Type.ISet.t -> 'a -> 'a t
val domain : 'a t -> Main.Type.ISet.t
val map_to_set : ('a -> bool) -> 'a t -> Main.Type.ISet.t