sig
type t =
Abstract
| Structure of Unmarshal.structure
| Transform of Unmarshal.t * (Obj.t -> Obj.t)
| Return of Unmarshal.t * (unit -> Obj.t)
| Dynamic of (unit -> Unmarshal.t)
and structure =
Sum of Unmarshal.t array array
| Dependent_pair of Unmarshal.t * (Obj.t -> Unmarshal.t)
| Array of Unmarshal.t
val input_val : Pervasives.in_channel -> Unmarshal.t -> 'a
val null : Obj.t
val id : Obj.t -> Obj.t
val t_int : Unmarshal.t
val t_string : Unmarshal.t
val t_float : Unmarshal.t
val t_bool : Unmarshal.t
val t_int32 : Unmarshal.t
val t_int64 : Unmarshal.t
val t_nativeint : Unmarshal.t
val t_record : Unmarshal.t array -> Unmarshal.t
val t_tuple : Unmarshal.t array -> Unmarshal.t
val t_list : Unmarshal.t -> Unmarshal.t
val t_ref : Unmarshal.t -> Unmarshal.t
val t_option : Unmarshal.t -> Unmarshal.t
val t_hashtbl_unchangedhashs : Unmarshal.t -> Unmarshal.t -> Unmarshal.t
val t_hashtbl_changedhashs :
(int -> 'a) ->
('a -> 'b -> 'c -> unit) -> Unmarshal.t -> Unmarshal.t -> Unmarshal.t
val t_set_unchangedcompares : Unmarshal.t -> Unmarshal.t
val t_map_unchangedcompares : Unmarshal.t -> Unmarshal.t -> Unmarshal.t
val register_custom : string -> (Pervasives.in_channel -> Obj.t) -> unit
val arch_sixtyfour : bool
val arch_bigendian : bool
val getword : Pervasives.in_channel -> Int32.t
val read8s : Pervasives.in_channel -> int
val read16s : Pervasives.in_channel -> int
val read32s : Pervasives.in_channel -> int
val read64s : Pervasives.in_channel -> int
val read8u : Pervasives.in_channel -> int
val read16u : Pervasives.in_channel -> int
val read32u : Pervasives.in_channel -> int
val read64u : Pervasives.in_channel -> int
val readblock : Pervasives.in_channel -> Obj.t -> int -> int -> unit
val readblock_rev : Pervasives.in_channel -> Obj.t -> int -> int -> unit
module type ORDEREDDESCR =
sig val descr : Unmarshal.t type t val compare : t -> t -> int end
module type SetDescr =
sig
val descr : Unmarshal.t
type elt
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
end
module SetWithDescr :
functor (Data : ORDEREDDESCR) ->
sig
val descr : t
type elt = Data.t
type t = Set.Make(Data).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
end
module type MapDescr =
sig
val descr : Unmarshal.t -> Unmarshal.t
type key
type +'a t
val empty : 'a t
val is_empty : 'a t -> bool
val add : key -> 'a -> 'a t -> 'a t
val find : key -> 'a t -> 'a
val remove : key -> 'a t -> 'a t
val mem : key -> 'a t -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val map : ('a -> 'b) -> 'a t -> 'b t
val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int
val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
end
module MapWithDescr :
functor (Data : ORDEREDDESCR) ->
sig
val descr : t -> t
type key = Data.t
type 'a t = 'a Map.Make(Data).t
val empty : 'a t
val is_empty : 'a t -> bool
val add : key -> 'a -> 'a t -> 'a t
val find : key -> 'a t -> 'a
val remove : key -> 'a t -> 'a t
val mem : key -> 'a t -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val map : ('a -> 'b) -> 'a t -> 'b t
val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int
val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
end
end