Module Btype
module TypeSet : sig
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 find : elt -> t -> elt
val of_list : elt list -> t
end
module TypeMap : sig
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
end
module TypeHash : sig
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
end
val generic_level : int
val dummy_method : Asttypes.label
val hash_variant : Asttypes.label -> int
val is_row_name : string -> bool
type type_iterators = {
it_signature_item : type_iterators -> Types.signature_item -> unit;
it_value_description : type_iterators -> Types.value_description -> unit;
it_type_declaration : type_iterators -> Types.type_declaration -> unit;
it_extension_constructor : type_iterators -> Types.extension_constructor -> unit;
it_module_declaration : type_iterators -> Types.module_declaration -> unit;
it_modtype_declaration : type_iterators -> Types.modtype_declaration -> unit;
it_class_declaration : type_iterators -> Types.class_declaration -> unit;
it_class_type_declaration : type_iterators -> Types.class_type_declaration -> unit;
it_module_type : type_iterators -> Types.module_type -> unit;
it_class_type : type_iterators -> Types.class_type -> unit;
}
val type_iterators : type_iterators
val unmark_iterators : type_iterators
val cleanup_types : unit -> unit
val lowest_level : int
val pivot_level : int
val cleanup_abbrev : unit -> unit
val memorize_abbrev : Types.abbrev_memo Pervasives.ref -> Asttypes.private_flag -> Path.t -> Types.type_expr -> Types.type_expr -> unit
val is_optional : Asttypes.label -> bool
val label_name : Asttypes.label -> Asttypes.label
val prefixed_label_name : Asttypes.label -> Asttypes.label
val extract_label : Asttypes.label -> (Asttypes.label * 'a) list -> (Asttypes.label * 'a * (Asttypes.label * 'a) list * (Asttypes.label * 'a) list)
type snapshot
val snapshot : unit -> snapshot
val backtrack : snapshot -> unit