sig
module type OrderedType =
sig
type t
val compare : Kwlookup.OrderedType.t -> Kwlookup.OrderedType.t -> int
end
module type S =
sig
type key
type 'a t
val empty : 'a Kwlookup.S.t
val is_empty : 'a Kwlookup.S.t -> bool
val cardinal : 'a Kwlookup.S.t -> int
val mem : Kwlookup.S.key -> 'a Kwlookup.S.t -> bool
val find : Kwlookup.S.key -> 'a Kwlookup.S.t -> 'a
val singleton : Kwlookup.S.key -> 'a -> 'a Kwlookup.S.t
val add : Kwlookup.S.key -> 'a -> 'a Kwlookup.S.t -> 'a Kwlookup.S.t
val remove : Kwlookup.S.key -> 'a Kwlookup.S.t -> 'a Kwlookup.S.t
val fold :
(Kwlookup.S.key -> 'a -> 'b -> 'b) -> 'a Kwlookup.S.t -> 'b -> 'b
end
module Map :
functor (Ord : OrderedType) ->
sig
type key = Ord.t
type 'a t
val empty : 'a t
val is_empty : 'a t -> bool
val cardinal : 'a t -> int
val mem : key -> 'a t -> bool
val find : key -> 'a t -> 'a
val singleton : key -> 'a -> 'a t
val add : key -> 'a -> 'a t -> 'a t
val remove : key -> 'a t -> 'a t
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
end
module Alist :
functor (Ord : OrderedType) ->
sig
type key = Ord.t
type 'a t
val empty : 'a t
val is_empty : 'a t -> bool
val cardinal : 'a t -> int
val mem : key -> 'a t -> bool
val find : key -> 'a t -> 'a
val singleton : key -> 'a -> 'a t
val add : key -> 'a -> 'a t -> 'a t
val remove : key -> 'a t -> 'a t
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
end
module Hash :
functor (Ord : OrderedType) ->
sig
type key = Ord.t
type 'a t
val empty : 'a t
val is_empty : 'a t -> bool
val cardinal : 'a t -> int
val mem : key -> 'a t -> bool
val find : key -> 'a t -> 'a
val singleton : key -> 'a -> 'a t
val add : key -> 'a -> 'a t -> 'a t
val remove : key -> 'a t -> 'a t
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
end
end