sig
type 'a t = 'a list
type 'a binable = 'a t
val bin_size_t : ('a, 'a binable) Bin_prot.Size.sizer1
val bin_write_t : ('a, 'a binable) Bin_prot.Map_to_safe.writer1
val bin_write_t_ : ('a, 'a binable) Bin_prot.Unsafe_write_c.writer1
val bin_read_t : ('a, 'a binable) Bin_prot.Map_to_safe.reader1
val bin_read_t_ : ('a, 'a binable) Bin_prot.Unsafe_read_c.reader1
val bin_read_t__ : ('a, int -> 'a binable) Bin_prot.Unsafe_read_c.reader1
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
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
type 'a monad = 'a list
val ( >>= ) : 'a monad -> ('a -> 'b monad) -> 'b monad
val ( >>| ) : 'a monad -> ('a -> 'b) -> 'b monad
module Monad_infix :
sig
type 'a monad = 'a monad
val ( >>= ) : 'a monad -> ('a -> 'b monad) -> 'b monad
val ( >>| ) : 'a monad -> ('a -> 'b) -> 'b monad
end
val bind : 'a monad -> ('a -> 'b monad) -> 'b monad
val return : 'a -> 'a monad
val map : 'a monad -> f:('a -> 'b) -> 'b monad
val join : 'a monad monad -> 'a monad
val ignore : 'a monad -> unit monad
val unit : unit monad
val nth : 'a list -> int -> 'a option
val nth_exn : 'a list -> int -> 'a
val rev : 'a list -> 'a list
val rev_append : 'a list -> 'a list -> 'a list
val rev_map : f:('a -> 'b) -> 'a list -> 'b Core_list.t
val fold_left : f:('a -> 'b -> 'a) -> init:'a -> 'b Core_list.t -> 'a
val iter2 : f:('a -> 'b -> unit) -> 'a list -> 'b Core_list.t -> unit
val rev_map2 :
f:('a -> 'b -> 'c) -> 'a list -> 'b Core_list.t -> 'c Core_list.t
val fold_left2 :
f:('a -> 'b -> 'c -> 'a) ->
init:'a -> 'b Core_list.t -> 'c Core_list.t -> 'a
val for_all2 : f:('a -> 'b -> bool) -> 'a list -> 'b Core_list.t -> bool
val exists2 : f:('a -> 'b -> bool) -> 'a list -> 'b Core_list.t -> bool
val mem : 'a -> set:'a list -> bool
val memq : 'a -> set:'a list -> bool
val filter : f:('a -> bool) -> 'a list -> 'a list
val find_all : f:('a -> bool) -> 'a list -> 'a list
val partition : f:('a -> bool) -> 'a list -> 'a list * 'a list
val assoc : 'a -> ('a * 'b) Core_list.t -> 'b
val mem_assoc : 'a -> map:('a * 'b) Core_list.t -> bool
val remove_assoc : 'a -> ('a * 'b) Core_list.t -> ('a * 'b) Core_list.t
val assoc' : ('a * 'b) Core_list.t -> ('a -> bool) -> 'b option
val assoc_exn' : ('a * 'b) Core_list.t -> ('a -> bool) -> 'b
val mem_assoc' : ('a * 'b) Core_list.t -> ('a -> bool) -> bool
val remove_assoc' :
('a * 'b) Core_list.t -> ('a -> bool) -> ('a * 'b) Core_list.t
val sort : cmp:('a -> 'a -> int) -> 'a list -> 'a list
val stable_sort : cmp:('a -> 'a -> int) -> 'a list -> 'a list
val fast_sort : cmp:('a -> 'a -> int) -> 'a list -> 'a list
val merge : cmp:('a -> 'a -> int) -> 'a list -> 'a list -> 'a list
val hd : 'a list -> 'a option
val tl : 'a list -> 'a list option
val hd_exn : 'a list -> 'a
val tl_exn : 'a list -> 'a list
val find_exn : 'a list -> f:('a -> bool) -> 'a
val append : 'a list -> 'a list -> 'a list
val map : 'a list -> f:('a -> 'b) -> 'b list
val map2 : 'a list -> 'b list -> f:('a -> 'b -> 'c) -> 'c list
val rev_map3 :
'a list -> 'b list -> 'c list -> f:('a -> 'b -> 'c -> 'd) -> 'd list
val map3 :
'a list -> 'b list -> 'c list -> f:('a -> 'b -> 'c -> 'd) -> 'd list
val rev_map_append : 'a list -> f:('a -> 'b) -> 'b list -> 'b list
val fold_right : 'a list -> f:('a -> 'b -> 'b) -> init:'b -> 'b
val fold_right2 :
'a list -> 'b list -> f:('a -> 'b -> 'c -> 'c) -> init:'c -> 'c
val split : ('a * 'b) list -> 'a list * 'b list
val combine : 'a list -> 'b list -> ('a * 'b) list
val mapi : 'a list -> f:(int -> 'a -> 'b) -> 'b list
val iteri : 'a list -> f:(int -> 'a -> unit) -> unit
val fold_lefti : 'a list -> f:(int -> 'b -> 'a -> 'b) -> init:'b -> 'b
val fold_left_term : 'a list -> f:('b -> 'a -> bool * 'b) -> init:'b -> 'b
val reduce : 'a list -> f:('a -> 'a -> 'a) -> 'a
val best : 'a list -> f:('a -> 'a -> 'a) -> 'a
val min_combine : 'a list -> 'b list -> ('a * 'b) list
val last : 'a list -> 'a
val dedup : 'a list -> 'a list
val stable_dedup : 'a list -> 'a list
val contains_dup : 'a list -> bool
val find_a_dup : 'a list -> 'a option
val count : 'a list -> f:('a -> bool) -> int
val range : ?stride:int -> int -> int -> int Core_list.t
val frange : ?stride:float -> float -> float -> float Core_list.t
val init : int -> f:(int -> 'a) -> 'a list
val rev_filter_map : 'a list -> f:('a -> 'b option) -> 'b list
val filter_map : 'a list -> f:('a -> 'b option) -> 'b list
val filter_opt : 'a option list -> 'a list
val partition_map :
'a list -> f:('a -> [< `Fail of 'b | `Pass of 'c ]) -> 'c list * 'b list
val reverse_pairs : ('a * 'b) list -> ('b * 'a) list
val split_n : 'a list -> int -> 'a list * 'a list
val sub : 'a list -> pos:int -> len:int -> 'a list
val slice : 'a list -> int -> int -> 'a list
val first_n : 'a list -> int -> 'a list
val concat : 'a list list -> 'a list
val concat_map : 'a list -> f:('a -> 'b list) -> 'b list
val flatten : 'a list list -> 'a list
val assoc_opt : 'a -> ('a * 'b) list -> 'b option
val cons : 'a -> 'a list -> 'a list
val cartesian_product : 'a list -> 'b list -> ('a * 'b) list
val to_string : ('a -> string) -> 'a Core_list.t -> string
val shuffle : 'a Core_list.t -> 'a Core_list.t
module Infix : sig val ( @ ) : 'a list -> 'a list -> 'a list end
end