sig
type cache_type =
NoCache
| PersistentCache of string
| TemporaryCache of string
module type S =
sig
type key
type v
type 'a shape
type prefix
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
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 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 choose : t -> elt
val find : elt -> t -> elt
val of_list : elt list -> t
val min_elt : t -> elt
val max_elt : t -> elt
val split : elt -> t -> t * bool * t
val nearest_elt_le : elt -> t -> elt
val nearest_elt_ge : elt -> t -> elt
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 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 find_opt : key -> 'a t -> 'a option
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 filter_map_inplace : (key -> 'a -> 'a option) -> '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 iter_sorted_by_entry :
cmp:(key * 'a -> key * 'a -> int) ->
(key -> 'a -> unit) -> 'a t -> unit
val fold_sorted_by_entry :
cmp:(key * 'a -> key * 'a -> int) ->
(key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val iter_sorted_by_value :
cmp:('a -> 'a -> int) -> (key -> 'a -> unit) -> 'a t -> unit
val fold_sorted_by_value :
cmp:('a -> 'a -> int) ->
(key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val find_opt : 'a t -> key -> 'a option
val find_def : 'a t -> key -> 'a -> 'a
val memo : 'a t -> key -> (key -> 'a) -> 'a
val structural_descr : Structural_descr.t -> Structural_descr.t
val make_type : 'a Type.t -> 'a t Type.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
val id : t -> int
val self : State.t
val empty : t
val is_empty : t -> bool
val add : Hptmap_sig.S.key -> Hptmap_sig.S.v -> t -> t
val replace :
(Hptmap_sig.S.v option -> Hptmap_sig.S.v option) ->
Hptmap_sig.S.key -> t -> t
val find : Hptmap_sig.S.key -> t -> Hptmap_sig.S.v
val find_check_missing : Hptmap_sig.S.key -> t -> Hptmap_sig.S.v
val find_key : Hptmap_sig.S.key -> t -> Hptmap_sig.S.key
val remove : Hptmap_sig.S.key -> t -> t
val mem : Hptmap_sig.S.key -> t -> bool
val iter : (Hptmap_sig.S.key -> Hptmap_sig.S.v -> unit) -> t -> unit
val map : (Hptmap_sig.S.v -> Hptmap_sig.S.v) -> t -> t
val map' :
(Hptmap_sig.S.key -> Hptmap_sig.S.v -> Hptmap_sig.S.v option) ->
t -> t
val filter : (Hptmap_sig.S.key -> bool) -> t -> t
val fold :
(Hptmap_sig.S.key -> Hptmap_sig.S.v -> 'b -> 'b) -> t -> 'b -> 'b
val fold_rev :
(Hptmap_sig.S.key -> Hptmap_sig.S.v -> 'b -> 'b) -> t -> 'b -> 'b
val for_all : (Hptmap_sig.S.key -> Hptmap_sig.S.v -> bool) -> t -> bool
val exists : (Hptmap_sig.S.key -> Hptmap_sig.S.v -> bool) -> t -> bool
type empty_action =
Neutral
| Absorbing
| Traversing of
(Hptmap_sig.S.key -> Hptmap_sig.S.v -> Hptmap_sig.S.v option)
val merge :
cache:Hptmap_sig.cache_type ->
symmetric:bool ->
idempotent:bool ->
decide_both:(Hptmap_sig.S.key ->
Hptmap_sig.S.v ->
Hptmap_sig.S.v -> Hptmap_sig.S.v option) ->
decide_left:Hptmap_sig.S.empty_action ->
decide_right:Hptmap_sig.S.empty_action -> t -> t -> t
val generic_join :
cache:Hptmap_sig.cache_type ->
symmetric:bool ->
idempotent:bool ->
decide:(Hptmap_sig.S.key ->
Hptmap_sig.S.v option ->
Hptmap_sig.S.v option -> Hptmap_sig.S.v) ->
t -> t -> t
val join :
cache:Hptmap_sig.cache_type ->
symmetric:bool ->
idempotent:bool ->
decide:(Hptmap_sig.S.key ->
Hptmap_sig.S.v -> Hptmap_sig.S.v -> Hptmap_sig.S.v) ->
t -> t -> t
val inter :
cache:Hptmap_sig.cache_type ->
symmetric:bool ->
idempotent:bool ->
decide:(Hptmap_sig.S.key ->
Hptmap_sig.S.v -> Hptmap_sig.S.v -> Hptmap_sig.S.v option) ->
t -> t -> t
val inter_with_shape : 'a Hptmap_sig.S.shape -> t -> t
type decide_fast = Done | Unknown
val generic_predicate :
exn ->
cache:string * 'a ->
decide_fast:(t -> t -> Hptmap_sig.S.decide_fast) ->
decide_fst:(Hptmap_sig.S.key -> Hptmap_sig.S.v -> unit) ->
decide_snd:(Hptmap_sig.S.key -> Hptmap_sig.S.v -> unit) ->
decide_both:(Hptmap_sig.S.v -> Hptmap_sig.S.v -> unit) ->
t -> t -> unit
type predicate_type = ExistentialPredicate | UniversalPredicate
type predicate_result = PTrue | PFalse | PUnknown
val binary_predicate :
Hptmap_sig.cache_type ->
Hptmap_sig.S.predicate_type ->
decide_fast:(t -> t -> Hptmap_sig.S.predicate_result) ->
decide_fst:(Hptmap_sig.S.key -> Hptmap_sig.S.v -> bool) ->
decide_snd:(Hptmap_sig.S.key -> Hptmap_sig.S.v -> bool) ->
decide_both:(Hptmap_sig.S.key ->
Hptmap_sig.S.v -> Hptmap_sig.S.v -> bool) ->
t -> t -> bool
val generic_symmetric_predicate :
exn ->
decide_fast:(t -> t -> Hptmap_sig.S.decide_fast) ->
decide_one:(Hptmap_sig.S.key -> Hptmap_sig.S.v -> unit) ->
decide_both:(Hptmap_sig.S.v -> Hptmap_sig.S.v -> unit) ->
t -> t -> unit
val symmetric_binary_predicate :
Hptmap_sig.cache_type ->
Hptmap_sig.S.predicate_type ->
decide_fast:(t -> t -> Hptmap_sig.S.predicate_result) ->
decide_one:(Hptmap_sig.S.key -> Hptmap_sig.S.v -> bool) ->
decide_both:(Hptmap_sig.S.key ->
Hptmap_sig.S.v -> Hptmap_sig.S.v -> bool) ->
t -> t -> bool
val decide_fast_inclusion : t -> t -> Hptmap_sig.S.predicate_result
val decide_fast_intersection : t -> t -> Hptmap_sig.S.predicate_result
val cached_fold :
cache_name:string ->
temporary:bool ->
f:(Hptmap_sig.S.key -> Hptmap_sig.S.v -> 'b) ->
joiner:('b -> 'b -> 'b) -> empty:'b -> t -> 'b
val cached_map :
cache:string * int ->
temporary:bool ->
f:(Hptmap_sig.S.key -> Hptmap_sig.S.v -> Hptmap_sig.S.v) -> t -> t
val singleton : Hptmap_sig.S.key -> Hptmap_sig.S.v -> t
val is_singleton : t -> (Hptmap_sig.S.key * Hptmap_sig.S.v) option
val on_singleton :
(Hptmap_sig.S.key -> Hptmap_sig.S.v -> bool) -> t -> bool
val cardinal : t -> int
val min_binding : t -> Hptmap_sig.S.key * Hptmap_sig.S.v
val max_binding : t -> Hptmap_sig.S.key * Hptmap_sig.S.v
val compositional_bool : t -> bool
val clear_caches : unit -> unit
val from_shape :
(Hptmap_sig.S.key -> 'a -> Hptmap_sig.S.v) ->
'a Hptmap_sig.S.shape -> t
val shape : t -> Hptmap_sig.S.v Hptmap_sig.S.shape
val fold2_join_heterogeneous :
cache:Hptmap_sig.cache_type ->
empty_left:('a Hptmap_sig.S.shape -> 'b) ->
empty_right:(t -> 'b) ->
both:(Hptmap_sig.S.key -> Hptmap_sig.S.v -> 'a -> 'b) ->
join:('b -> 'b -> 'b) -> empty:'b -> t -> 'a Hptmap_sig.S.shape -> 'b
val pretty_debug : Format.formatter -> t -> unit
val comp_prefixes : t -> t -> unit
val pretty_prefix :
Hptmap_sig.S.prefix -> Format.formatter -> t -> unit
type subtree
exception Found_prefix of Hptmap_sig.S.prefix * Hptmap_sig.S.subtree *
Hptmap_sig.S.subtree
val find_prefix :
t -> Hptmap_sig.S.prefix -> Hptmap_sig.S.subtree option
val hash_subtree : Hptmap_sig.S.subtree -> int
val equal_subtree :
Hptmap_sig.S.subtree -> Hptmap_sig.S.subtree -> bool
end
end