sig
val formatter : Format.formatter Pervasives.ref
val pp : ('a, Format.formatter, unit) Pervasives.format -> 'a
module StringSet :
sig
type elt = string
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
end
module StringMap :
sig
type key = string
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
val identity : 'a -> 'a
val ( |> ) : 'a -> ('a -> 'b) -> 'b
val ( |>> ) : 'a -> ('a -> unit) -> 'a
val ( >> ) : ('a -> 'b) -> ('b -> 'c) -> 'a -> 'c
val ( >>= ) : 'a option -> ('a -> 'b option) -> 'b option
module List :
sig
val length : 'a list -> int
val hd : 'a list -> 'a
val tl : 'a list -> 'a list
val nth : 'a list -> int -> 'a
val rev : 'a list -> 'a list
val append : 'a list -> 'a list -> 'a list
val rev_append : 'a list -> 'a list -> 'a list
val concat : 'a list list -> 'a list
val flatten : 'a list list -> 'a list
val iter : ('a -> unit) -> 'a list -> unit
val map : ('a -> 'b) -> 'a list -> 'b list
val rev_map : ('a -> 'b) -> 'a list -> 'b list
val fold_left : ('a -> 'b -> 'a) -> 'a -> 'b list -> 'a
val fold_right : ('a -> 'b -> 'b) -> 'a list -> 'b -> 'b
val iter2 : ('a -> 'b -> unit) -> 'a list -> 'b list -> unit
val map2 : ('a -> 'b -> 'c) -> 'a list -> 'b list -> 'c list
val rev_map2 : ('a -> 'b -> 'c) -> 'a list -> 'b list -> 'c list
val fold_left2 :
('a -> 'b -> 'c -> 'a) -> 'a -> 'b list -> 'c list -> 'a
val fold_right2 :
('a -> 'b -> 'c -> 'c) -> 'a list -> 'b list -> 'c -> 'c
val for_all : ('a -> bool) -> 'a list -> bool
val exists : ('a -> bool) -> 'a list -> bool
val for_all2 : ('a -> 'b -> bool) -> 'a list -> 'b list -> bool
val exists2 : ('a -> 'b -> bool) -> 'a list -> 'b list -> bool
val mem : 'a -> 'a list -> bool
val memq : 'a -> 'a list -> bool
val find : ('a -> bool) -> 'a list -> 'a
val filter : ('a -> bool) -> 'a list -> 'a list
val find_all : ('a -> bool) -> 'a list -> 'a list
val partition : ('a -> bool) -> 'a list -> 'a list * 'a list
val assoc : 'a -> ('a * 'b) list -> 'b
val assq : 'a -> ('a * 'b) list -> 'b
val mem_assoc : 'a -> ('a * 'b) list -> bool
val mem_assq : 'a -> ('a * 'b) list -> bool
val remove_assoc : 'a -> ('a * 'b) list -> ('a * 'b) list
val remove_assq : 'a -> ('a * 'b) list -> ('a * 'b) list
val split : ('a * 'b) list -> 'a list * 'b list
val combine : 'a list -> 'b list -> ('a * 'b) list
val sort : ('a -> 'a -> int) -> 'a list -> 'a list
val stable_sort : ('a -> 'a -> int) -> 'a list -> 'a list
val fast_sort : ('a -> 'a -> int) -> 'a list -> 'a list
val merge : ('a -> 'a -> int) -> 'a list -> 'a list -> 'a list
val last : 'a list -> 'a
val fold : ('a -> 'b -> 'b) -> 'a list -> 'b -> 'b
val fold_cons : ('a -> 'b) -> 'a list -> 'b list -> 'b list
val fold_append : ('a -> 'b list) -> 'a list -> 'b list -> 'b list
val lifted_fold : ('a -> 'b -> 'b option) -> 'a list -> 'b -> 'b option
val reduce : ('a -> 'b list -> 'b list) -> 'a list -> 'b list
val reduce_append : ('a -> 'b list) -> 'a list -> 'b list
val filter_not : ('a -> bool) -> 'a list -> 'a list
val map_partial : ('a -> 'b option) -> 'a list -> 'b list
val map_option : ('a -> 'b option) -> 'a list -> 'b list option
end
type component
val component_is_field : Misc.component -> bool
val component_of_string : string -> Misc.component
val string_of_component : Misc.component -> string
val string_of_field_component : Misc.component -> string
val compare_component : Misc.component -> Misc.component -> int
val compare_components : Misc.component list -> Misc.component list -> int
val node_component : Misc.component
val list_link_tag : Misc.component
val list_data_tag : Misc.component
val dl_Llink_tag : Misc.component
val dl_Rlink_tag : Misc.component
val tree_link_tags : Misc.component * Misc.component
val tree_data_tag : Misc.component
val is_value_field : Misc.component -> bool
val is_lock_field : Misc.component -> bool
val possible_link_fields : Misc.component list Pervasives.ref
module CompSet :
sig
type elt = component
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
end
type ('a, 'b) plist = PNil | PCons of 'a * 'b * ('a, 'b) Misc.plist
module PList :
sig
val nil : ('a, 'b) Misc.plist
val cons : 'a -> 'b -> ('a, 'b) Misc.plist -> ('a, 'b) Misc.plist
val rev_append :
('a, 'b) Misc.plist -> ('a, 'b) Misc.plist -> ('a, 'b) Misc.plist
val for_all : ('a -> 'b -> bool) -> ('a, 'b) Misc.plist -> bool
val exists : ('a -> 'b -> bool) -> ('a, 'b) Misc.plist -> bool
val fold : ('a -> 'b -> 'c -> 'c) -> ('a, 'b) Misc.plist -> 'c -> 'c
val fold_val : ('b -> 'c -> 'c) -> ('a, 'b) Misc.plist -> 'c -> 'c
val lifted_fold :
('a -> 'b -> 'c -> 'c option) ->
('a, 'b) Misc.plist -> 'c -> 'c option
val iter : ('a -> 'b -> unit) -> ('a, 'b) Misc.plist -> unit
val iter_val : ('b -> unit) -> ('a, 'b) Misc.plist -> unit
val length : ('a, 'b) Misc.plist -> int
val filter :
('a -> 'b -> bool) -> ('a, 'b) Misc.plist -> ('a, 'b) Misc.plist
val rev_partition :
('a -> 'b -> bool) ->
('a, 'b) Misc.plist -> ('a, 'b) Misc.plist * ('a, 'b) Misc.plist
val map_val : ('b -> 'b) -> ('a, 'b) Misc.plist -> ('a, 'b) Misc.plist
val mem_assq : 'a -> ('a, 'b) Misc.plist -> bool
val assq : 'a -> ('a, 'b) Misc.plist -> 'b
val try_assq : 'a -> ('a, 'b) Misc.plist -> 'b option
val remove_assq : 'a -> ('a, 'b) Misc.plist -> ('a, 'b) Misc.plist
val findq : ('a, 'b) Misc.plist -> 'b -> 'a -> 'b
val merge :
('a -> 'a -> int) ->
('a, 'b) Misc.plist -> ('a, 'b) Misc.plist -> ('a, 'b) Misc.plist
val get_first :
('a -> 'b -> 'c option) -> ('a, 'b) Misc.plist -> 'c option
val combine : 'a list -> 'b list -> ('a, 'b) Misc.plist
val common :
('a -> 'b -> 'a -> 'b -> int) ->
('a, 'b) Misc.plist ->
('a, 'b) Misc.plist ->
('a, 'b) Misc.plist * ('a, 'b) Misc.plist * ('a, 'b) Misc.plist
end
end