sig
module type INDEX =
sig
type t
type gen
module Set :
sig
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> 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 : (elt -> unit) -> t -> unit
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val max_elt : t -> elt
val choose : t -> elt
val split : elt -> t -> t * bool * t
end
module Map :
sig
type key = t
type +'a t
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 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
end
val start : Store_intf.INDEX.gen
val next_ix : Store_intf.INDEX.gen -> Store_intf.INDEX.t
val next :
Store_intf.INDEX.gen -> Store_intf.INDEX.t * Store_intf.INDEX.gen
val remove_ix :
Store_intf.INDEX.gen -> Store_intf.INDEX.t -> Store_intf.INDEX.gen
val int_of_ix : Store_intf.INDEX.t -> int
end
module type STORE =
sig
module Ix : INDEX
type +'a t
val empty : 'a Store_intf.STORE.t
val is_empty : 'a Store_intf.STORE.t -> bool
val cardinal : 'a Store_intf.STORE.t -> int
val next_ix : 'a Store_intf.STORE.t -> Ix.t
val singleton : 'a -> Ix.t * 'a Store_intf.STORE.t
val add : 'a -> 'a Store_intf.STORE.t -> Ix.t * 'a Store_intf.STORE.t
val find : Ix.t -> 'a Store_intf.STORE.t -> 'a
val update :
Ix.t -> 'a -> 'a Store_intf.STORE.t -> 'a Store_intf.STORE.t
val remove : Ix.t -> 'a Store_intf.STORE.t -> 'a Store_intf.STORE.t
val iter : ('a -> unit) -> 'a Store_intf.STORE.t -> unit
val iteri : (Ix.t -> 'a -> unit) -> 'a Store_intf.STORE.t -> unit
val map : ('a -> 'b) -> 'a Store_intf.STORE.t -> 'b Store_intf.STORE.t
val mapi :
(Ix.t -> 'a -> 'b) -> 'a Store_intf.STORE.t -> 'b Store_intf.STORE.t
val fold : ('a -> 'b -> 'b) -> 'a Store_intf.STORE.t -> 'b -> 'b
val foldi :
(Ix.t -> 'a -> 'b -> 'b) -> 'a Store_intf.STORE.t -> 'b -> 'b
val to_list : 'a Store_intf.STORE.t -> (Ix.t * 'a) list
val choose : 'a Store_intf.STORE.t -> Ix.t * 'a
val filter :
(Ix.t -> 'a -> bool) ->
'a Store_intf.STORE.t -> 'a Store_intf.STORE.t
val partition :
(Ix.t -> 'a -> bool) ->
'a Store_intf.STORE.t ->
'a Store_intf.STORE.t * 'a Store_intf.STORE.t
val eq_classes :
('a -> 'a -> bool) ->
'a Store_intf.STORE.t -> ('a * 'a Store_intf.STORE.t) list
val get_ix_map : 'a Store_intf.STORE.t -> 'a Ix.Map.t
end
end