sig
type 'a t = 'a array
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
external get : 'a array -> int -> 'a = "%array_safe_get"
external set : 'a array -> int -> 'a -> unit = "%array_safe_set"
external create : int -> 'a -> 'a array = "caml_make_vect"
val init : int -> f:(int -> 'a) -> 'a array
val make_matrix : dimx:int -> dimy:int -> 'a -> 'a array Core_array.t
val append : 'a array -> 'a array -> 'a array
val concat : 'a array list -> 'a array
val sub : 'a array -> pos:int -> len:int -> 'a array
val copy : 'a array -> 'a array
val fill : 'a array -> pos:int -> len:int -> 'a -> unit
val blit :
src:'a array ->
src_pos:int -> dst:'a array -> dst_pos:int -> len:int -> unit
val of_list : 'a list -> 'a array
val map : f:('a -> 'b) -> 'a array -> 'b Core_array.t
val iteri : f:(int -> 'a -> unit) -> 'a array -> unit
val mapi : f:(int -> 'a -> 'b) -> 'a array -> 'b Core_array.t
val fold_left : f:('a -> 'b -> 'a) -> init:'a -> 'b Core_array.t -> 'a
val fold_right : f:('a -> 'b -> 'b) -> 'a Core_array.t -> init:'b -> 'b
val sort : cmp:('a -> 'a -> int) -> 'a array -> unit
val stable_sort : cmp:('a -> 'a -> int) -> 'a array -> unit
val fast_sort : cmp:('a -> 'a -> int) -> 'a array -> unit
val cartesian_product : 'a array -> 'b array -> ('a * 'b) array
val normalize : 'a array -> int -> int
val slice : 'a array -> int -> int -> 'a array
val nget : 'a array -> int -> 'a
val nset : 'a array -> int -> 'a -> unit
val filter_opt : 'a option array -> 'a array
val filter_map : f:('a -> 'b option) -> 'a array -> 'b array
val filter_mapi : f:(int -> 'a -> 'b option) -> 'a array -> 'b array
val map2 : f:('a -> 'b -> 'c) -> 'a array -> 'b array -> 'c Core_array.t
val filter : f:('a -> bool) -> 'a array -> 'a array
val filteri : f:(int -> 'a -> bool) -> 'a array -> 'a array
val swap : 'a array -> int -> int -> unit
val mem : 'a -> 'a array -> bool
val rev : 'a array -> unit
val replace : 'a Core_array.t -> int -> f:('a -> 'a) -> unit
val replace_all : 'a Core_array.t -> f:('a -> 'a) -> unit
val find_exn : 'a array -> f:('a -> bool) -> 'a
val findi : 'a array -> f:('a -> bool) -> int option
val findi_exn : 'a array -> f:('a -> bool) -> int
val reduce : f:('a -> 'a -> 'a) -> 'a array -> 'a
val best : f:('a -> 'a -> 'a) -> 'a array -> 'a
val permute : ?random_state:Random.State.t -> 'a array -> unit
val combine : 'a array -> 'b array -> ('a * 'b) array
val sorted_copy : 'a array -> cmp:('a -> 'a -> int) -> 'a array
val last : 'a array -> 'a
module Infix : sig val ( <|> ) : 'a array -> int * int -> 'a array end
end