sig
type t
type comparable = t
val ( >= ) : comparable -> comparable -> bool
val ( <= ) : comparable -> comparable -> bool
val ( = ) : comparable -> comparable -> bool
val ( > ) : comparable -> comparable -> bool
val ( < ) : comparable -> comparable -> bool
val ( <> ) : comparable -> comparable -> bool
val compare : comparable -> comparable -> int
val ascending : comparable -> comparable -> int
val descending : comparable -> comparable -> int
val min : comparable -> comparable -> comparable
val max : comparable -> comparable -> comparable
module Map :
sig
type key = comparable
type +'a t
module T : sig type 'a key = key type ('a, 'b) t = 'b t end
type 'a sexpable = 'a t
val sexp_of_t : ('a -> Sexplib.Sexp.t) -> 'a sexpable -> Sexplib.Sexp.t
val t_of_sexp : (Sexplib.Sexp.t -> 'a) -> Sexplib.Sexp.t -> 'a sexpable
val empty : 'a t
val singleton : key -> 'a -> 'a t
val is_empty : 'a t -> bool
val cardinal : 'a t -> int
val add : key:key -> data:'a -> 'a t -> 'a t
val add_multi : key:key -> data:'a -> 'a list t -> 'a list t
val change : 'a t -> key -> ('a option -> 'a option) -> 'a t
val find_exn : 'a t -> key -> 'a
val find : 'a t -> key -> 'a option
val remove : 'a t -> key -> 'a t
val mem : 'a t -> key -> bool
val iter : f:(key:key -> data:'a -> unit) -> 'a t -> unit
val map : f:('a -> 'b) -> 'a t -> 'b t
val mapi : f:(key:key -> data:'a -> 'b) -> 'a t -> 'b t
val fold : f:(key:key -> data:'a -> 'b -> 'b) -> 'a t -> init:'b -> 'b
val fold_right :
f:(key:key -> data:'a -> 'b -> 'b) -> 'a t -> init:'b -> 'b
val filter : f:(key:key -> data:'a -> bool) -> 'a t -> 'a t
val filter_map : f:('a -> 'b option) -> 'a t -> 'b t
val filter_mapi : f:(key:key -> data:'a -> 'b option) -> 'a t -> 'b t
val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int
val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
val keys : 'a t -> key list
val has_key : 'a t -> key -> bool
val data : 'a t -> 'a list
val of_alist :
(key * 'a) list -> [ `Duplicate_key of key | `Ok of 'a t ]
val of_alist_exn : (key * 'a) list -> 'a t
val of_alist_multi : (key * 'a) list -> 'a list t
val to_alist : 'a t -> (key * 'a) list
val combine_alist :
(key * 'a) list -> init:'b -> f:('a -> 'b -> 'b) -> 'b t
val merge :
f:(key:key -> 'a option -> 'b option -> 'c option) ->
'a t -> 'b t -> 'c t
val min_elt : 'a t -> (key * 'a) option
val min_elt_exn : 'a t -> key * 'a
val max_elt : 'a t -> (key * 'a) option
val max_elt_exn : 'a t -> key * 'a
val for_all : f:('a -> bool) -> 'a t -> bool
val exists : f:('a -> bool) -> 'a t -> bool
val fold_range_inclusive :
'a t ->
min:key ->
max:key -> init:'b -> f:(key:key -> data:'a -> 'b -> 'b) -> 'b
val range_to_alist : 'a t -> min:key -> max:key -> (key * 'a) list
val prev_key : 'a t -> key -> key option
val next_key : 'a t -> key -> key option
val rank : 'a t -> key -> int option
end
module Set :
sig
type elt = comparable
type t
module T : sig type 'a elt = elt type 'a t = t end
type sexpable = t
val sexp_of_t : sexpable -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> sexpable
val empty : t
val is_empty : t -> bool
val mem : t -> elt -> bool
val add : t -> elt -> t
val singleton : elt -> t
val remove : t -> elt -> t
val union : t -> t -> t
val union_list : t list -> 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 : t -> f:(elt -> unit) -> unit
val fold : t -> init:'a -> f:(elt -> 'a -> 'a) -> 'a
val fold_until :
t ->
init:'a -> f:(elt -> 'a -> [ `Continue of 'a | `Stop of 'a ]) -> 'a
val for_all : t -> f:(elt -> bool) -> bool
val exists : t -> f:(elt -> bool) -> bool
val filter : t -> f:(elt -> bool) -> t
val partition : t -> f:(elt -> bool) -> t * t
val cardinal : t -> int
val length : t -> int
val elements : t -> elt list
val min_elt : t -> elt option
val min_elt_exn : t -> elt
val max_elt : t -> elt option
val max_elt_exn : t -> elt
val choose : t -> elt option
val choose_exn : t -> elt
val of_list : elt list -> t
val to_list : t -> elt list
val of_array : elt array -> t
val to_array : t -> elt array
val split : elt -> t -> t * bool * t
val group_by : t -> equiv:(elt -> elt -> bool) -> t list
val find : t -> f:(elt -> bool) -> elt option
val find_exn : t -> f:(elt -> bool) -> elt
val find_index : t -> int -> elt option
val remove_index : t -> int -> t
end
type hashable = t
module Hashable : sig type t = hashable end
val hash : hashable -> int
module Table : Hashable.Table_sig(Hashable).S
module Hash_set :
sig
type elem = hashable
type t = elem Hash_set.t
type sexpable = t
val sexp_of_t : sexpable -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> sexpable
val create : ?growth_allowed:bool -> ?size:int -> unit -> t
val of_list : elem list -> t
end
module Hash_queue :
sig
module Key :
sig
type t = hashable
val compare : t -> t -> int
val hash : t -> int
type sexpable = t
val sexp_of_t : sexpable -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> sexpable
end
type 'a t
type 'a container = 'a t
val length : 'a container -> int
val is_empty : 'a container -> bool
val iter : 'a container -> f:('a -> unit) -> unit
val fold : 'a container -> init:'b -> f:('b -> 'a -> 'b) -> 'b
val exists : 'a container -> f:('a -> bool) -> bool
val for_all : 'a container -> f:('a -> bool) -> bool
val find : 'a container -> f:('a -> bool) -> 'a option
val to_list : 'a container -> 'a list
val to_array : 'a container -> 'a array
val container : ('a, 'a container) Container.type_class
val invariant : 'a t -> unit
val create : unit -> 'a t
val clear : 'a t -> unit
val mem : 'a t -> Key.t -> bool
val lookup : 'a t -> Key.t -> 'a option
val lookup_exn : 'a t -> Key.t -> 'a
val enqueue : 'a t -> Key.t -> 'a -> [ `Key_already_present | `Ok ]
val enqueue_exn : 'a t -> Key.t -> 'a -> unit
val keys : 'a t -> Key.t list
val dequeue : 'a t -> 'a option
val dequeue_exn : 'a t -> 'a
val dequeue_with_key : 'a t -> (Key.t * 'a) option
val dequeue_with_key_exn : 'a t -> Key.t * 'a
val dequeue_all : 'a t -> f:('a -> unit) -> unit
val remove : 'a t -> Key.t -> [ `No_such_key | `Ok ]
val remove_exn : 'a t -> Key.t -> unit
val replace : 'a t -> Key.t -> 'a -> [ `No_such_key | `Ok ]
val replace_exn : 'a t -> Key.t -> 'a -> unit
val iteri : 'a t -> f:(key:Key.t -> data:'a -> unit) -> unit
val foldi :
'a t -> init:'b -> f:('b -> key:Key.t -> data:'a -> 'b) -> 'b
end
module Hash_heap :
sig
module Key :
sig
type t = hashable
val compare : t -> t -> int
val hash : t -> int
type sexpable = t
val sexp_of_t : sexpable -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> sexpable
end
type 'a t
val create : ?min_size:int -> ('a -> 'a -> int) -> 'a t
val copy : 'a t -> 'a t
val push :
'a t -> key:Key.t -> data:'a -> [ `Key_already_present | `Ok ]
val push_exn : 'a t -> key:Key.t -> data:'a -> unit
val replace : 'a t -> key:Key.t -> data:'a -> unit
val remove : 'a t -> Key.t -> unit
val mem : 'a t -> Key.t -> bool
val top : 'a t -> 'a option
val top_exn : 'a t -> 'a
val top_with_key : 'a t -> (Key.t * 'a) option
val top_with_key_exn : 'a t -> Key.t * 'a
val pop_with_key : 'a t -> (Key.t * 'a) option
val pop_with_key_exn : 'a t -> Key.t * 'a
val pop : 'a t -> 'a option
val pop_exn : 'a t -> 'a
val cond_pop_with_key :
'a t -> (key:Key.t -> data:'a -> bool) -> (Key.t * 'a) option
val cond_pop : 'a t -> ('a -> bool) -> 'a option
val find : 'a t -> Key.t -> 'a option
val find_pop : 'a t -> Key.t -> 'a option
val find_exn : 'a t -> Key.t -> 'a
val find_pop_exn : 'a t -> Key.t -> 'a
val iter : 'a t -> f:(key:Key.t -> data:'a -> unit) -> unit
val iter_vals : 'a t -> f:('a -> unit) -> unit
end
type sexpable = t
val sexp_of_t : sexpable -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> sexpable
val equal : Signal.t -> Signal.t -> bool
val of_system_int : int -> Signal.t
val to_system_int : Signal.t -> int
val of_caml_int : int -> Signal.t
val to_caml_int : Signal.t -> int
val to_string : Signal.t -> string
type sys_behavior = Continue | Dump_core | Ignore | Stop | Terminate
val sexp_of_sys_behavior : Signal.sys_behavior -> Sexplib.Sexp.t
val sys_behavior_of_sexp : Sexplib.Sexp.t -> Signal.sys_behavior
type behavior = [ `Default | `Handle of Signal.t -> unit | `Ignore ]
val default_sys_behavior : Signal.t -> Signal.sys_behavior
val signal : Signal.t -> Signal.behavior -> Signal.behavior
val set : Signal.t -> Signal.behavior -> unit
val handle : Signal.t -> (Signal.t -> unit) -> unit
val handle_default : Signal.t -> unit
val ignore : Signal.t -> unit
val send : Signal.t -> pid:int -> [ `No_such_process | `Ok ]
val send_i : Signal.t -> pid:int -> unit
val send_exn : Signal.t -> pid:int -> unit
type sigprocmask_command = [ `Block | `Set | `Unblock ]
val sigprocmask :
Signal.sigprocmask_command -> Signal.t list -> Signal.t list
val sigpending : unit -> Signal.t list
val sigsuspend : Signal.t list -> unit
val abrt : Signal.t
val alrm : Signal.t
val chld : Signal.t
val cont : Signal.t
val fpe : Signal.t
val hup : Signal.t
val ill : Signal.t
val int : Signal.t
val kill : Signal.t
val pipe : Signal.t
val prof : Signal.t
val quit : Signal.t
val segv : Signal.t
val stop : Signal.t
val term : Signal.t
val tstp : Signal.t
val ttin : Signal.t
val ttou : Signal.t
val usr1 : Signal.t
val usr2 : Signal.t
val vtalrm : Signal.t
val zero : Signal.t
end