sig
exception Found_inter
module Tag_comp :
sig
type t
val get_tag : Hptmap.Tag_comp.t -> int
val get_comp : Hptmap.Tag_comp.t -> bool
val encode : int -> bool -> Hptmap.Tag_comp.t
end
module Comp_unused :
sig
val e : bool
val f : 'a -> 'b -> bool
val compose : bool -> bool -> bool
val default : bool
end
type prefix
val sentinel_prefix : Hptmap.prefix
type ('k, 'v, 't) tree = private
Empty
| Leaf of 'k * 'v * bool
| Branch of int * int * ('k, 'v, 't) Hptmap.tree *
('k, 'v, 't) Hptmap.tree * 't
module Make :
functor
(Key : sig
type t
val ty : t Type.t
val name : string
val descr : t Descr.t
val packed_descr : Structural_descr.pack
val reprs : t list
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pretty_code : Format.formatter -> t -> unit
val internal_pretty_code :
Type.precedence -> Format.formatter -> t -> unit
val pretty : Format.formatter -> t -> unit
val varname : t -> string
val mem_project : (Project_skeleton.t -> bool) -> t -> bool
val copy : t -> t
val id : t -> int
end) ->
functor (V : Datatype.S) ->
functor
(Comp : sig
val e : bool
val f : Key.t -> V.t -> bool
val compose : bool -> bool -> bool
val default : bool
end) ->
functor
(Initial_Values : sig val v : (Key.t * V.t) list list end) ->
functor (Datatype_deps : sig val l : State.t list end) ->
sig
type key = Key.t
type leaf_annot = bool
type branch_annot = Hptmap.Tag_comp.t
type tt = (Key.t, V.t, Hptmap.Tag_comp.t) Hptmap.tree
type t = tt
val ty : t Type.t
val name : string
val descr : t Descr.t
val packed_descr : Structural_descr.pack
val reprs : t list
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pretty_code : Format.formatter -> t -> unit
val internal_pretty_code :
Type.precedence -> Format.formatter -> t -> unit
val pretty : Format.formatter -> t -> unit
val varname : t -> string
val mem_project : (Project_skeleton.t -> bool) -> t -> bool
val copy : t -> t
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
val ty : t Type.t
val name : string
val descr : t Descr.t
val packed_descr : Structural_descr.pack
val reprs : t list
val hash : t -> int
val internal_pretty_code :
Type.precedence -> Format.formatter -> t -> unit
val pretty_code : Format.formatter -> t -> unit
val pretty : Format.formatter -> t -> unit
val varname : t -> string
val mem_project :
(Project_skeleton.t -> bool) -> t -> bool
val copy : t -> t
end
module Map :
sig
type key = t
type +'a t
val empty : 'a t
val is_empty : 'a t -> bool
val mem : key -> 'a t -> bool
val add : key -> 'a -> 'a t -> 'a t
val singleton : key -> 'a -> 'a t
val remove : key -> 'a t -> 'a t
val merge :
(key -> 'a option -> 'b option -> 'c option) ->
'a t -> 'b t -> 'c t
val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int
val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val for_all : (key -> 'a -> bool) -> 'a t -> bool
val exists : (key -> 'a -> bool) -> 'a t -> bool
val filter : (key -> 'a -> bool) -> 'a t -> 'a t
val partition :
(key -> 'a -> bool) -> 'a t -> 'a t * 'a t
val cardinal : 'a t -> int
val bindings : 'a t -> (key * 'a) list
val min_binding : 'a t -> key * 'a
val max_binding : 'a t -> key * 'a
val choose : 'a t -> key * 'a
val split : key -> 'a t -> 'a t * 'a option * 'a t
val find : key -> 'a t -> 'a
val map : ('a -> 'b) -> 'a t -> 'b t
val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t
module Key :
sig
type t = key
val ty : t Type.t
val name : string
val descr : t Descr.t
val packed_descr : Structural_descr.pack
val reprs : t list
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pretty_code : Format.formatter -> t -> unit
val internal_pretty_code :
Type.precedence -> Format.formatter -> t -> unit
val pretty : Format.formatter -> t -> unit
val varname : t -> string
val mem_project :
(Project_skeleton.t -> bool) -> t -> bool
val copy : t -> t
end
module Make :
functor (Data : Datatype.S) ->
sig
type t = Data.t t
val ty : t Type.t
val name : string
val descr : t Descr.t
val packed_descr : Structural_descr.pack
val reprs : t list
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pretty_code : Format.formatter -> t -> unit
val internal_pretty_code :
Type.precedence -> Format.formatter -> t -> unit
val pretty : Format.formatter -> t -> unit
val varname : t -> string
val mem_project :
(Project_skeleton.t -> bool) -> t -> bool
val copy : t -> t
end
end
module Hashtbl :
sig
type key = t
type 'a t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Hashtbl.statistics
val iter_sorted :
?cmp:(key -> key -> int) ->
(key -> 'a -> unit) -> 'a t -> unit
val fold_sorted :
?cmp:(key -> key -> int) ->
(key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val structural_descr :
Structural_descr.t -> Structural_descr.t
val make_type : 'a Type.t -> 'a t Type.t
val memo : 'a t -> key -> (key -> 'a) -> 'a
module Key :
sig
type t = key
val ty : t Type.t
val name : string
val descr : t Descr.t
val packed_descr : Structural_descr.pack
val reprs : t list
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pretty_code : Format.formatter -> t -> unit
val internal_pretty_code :
Type.precedence -> Format.formatter -> t -> unit
val pretty : Format.formatter -> t -> unit
val varname : t -> string
val mem_project :
(Project_skeleton.t -> bool) -> t -> bool
val copy : t -> t
end
module Make :
functor (Data : Datatype.S) ->
sig
type t = Data.t t
val ty : t Type.t
val name : string
val descr : t Descr.t
val packed_descr : Structural_descr.pack
val reprs : t list
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pretty_code : Format.formatter -> t -> unit
val internal_pretty_code :
Type.precedence -> Format.formatter -> t -> unit
val pretty : Format.formatter -> t -> unit
val varname : t -> string
val mem_project :
(Project_skeleton.t -> bool) -> t -> bool
val copy : t -> t
end
end
val self : State.t
val empty : t
val tag : t -> int
val hash_debug : t -> int
val is_empty : t -> bool
val add : Hptmap.Make.key -> V.t -> t -> t
val find : Hptmap.Make.key -> t -> V.t
val remove : Hptmap.Make.key -> t -> t
val mem : Hptmap.Make.key -> t -> bool
val iter : (Key.t -> V.t -> unit) -> t -> unit
val map : (V.t -> V.t) -> t -> t
val fold : (Key.t -> V.t -> 'b -> 'b) -> t -> 'b -> 'b
val fold_rev : (Key.t -> V.t -> 'b -> 'b) -> t -> 'b -> 'b
val comp_prefixes : t -> t -> unit
val pretty_prefix :
Hptmap.prefix -> Format.formatter -> t -> unit
type subtree
exception Found_prefix of Hptmap.prefix *
Hptmap.Make.subtree * Hptmap.Make.subtree
val find_prefix :
t -> Hptmap.prefix -> Hptmap.Make.subtree option
val hash_subtree : Hptmap.Make.subtree -> int
val equal_subtree :
Hptmap.Make.subtree -> Hptmap.Make.subtree -> bool
val generic_merge :
cache:string * int ->
decide:(Key.t -> V.t option -> V.t option -> V.t) ->
t -> t -> t
val symetric_merge :
cache:string * int ->
decide_none:(Key.t -> V.t -> V.t) ->
decide_some:(V.t -> V.t -> V.t) -> t -> t -> t
val generic_is_included :
exn ->
cache:string * int ->
decide_fst:(Key.t -> V.t -> unit) ->
decide_snd:(Key.t -> V.t -> unit) ->
decide_both:(V.t -> V.t -> unit) -> t -> t -> unit
val generic_symetric_existential_predicate :
exn ->
(t -> t -> bool) ->
decide_one:(Key.t -> V.t -> unit) ->
decide_both:(V.t -> V.t -> unit) -> t -> t -> unit
val do_it_intersect : t -> t -> bool
val cached_fold :
cache:string * int ->
temporary:bool ->
f:(Hptmap.Make.key -> V.t -> 'b) ->
joiner:('b -> 'b -> 'b) -> empty:'b -> t -> 'b
val cached_map :
cache:string * int ->
temporary:bool ->
f:(Hptmap.Make.key -> V.t -> V.t) -> t -> t
val singleton : Hptmap.Make.key -> V.t -> t
val is_singleton : t -> (Hptmap.Make.key * V.t) option
val cardinal : t -> int
val min_binding : t -> Hptmap.Make.key * V.t
val max_binding : t -> Hptmap.Make.key * V.t
val split : Hptmap.Make.key -> t -> t * V.t option * t
val clear_caches : unit -> unit
end
end