module Array:sig..end
val fold_lefti : (int -> 'a -> 'b -> 'a) -> 'a -> 'b array -> 'aval fold_righti : (int -> 'a -> 'b -> 'b) -> 'a array -> 'b -> 'bval fold_left2 : ('a -> 'b -> 'c -> 'a) -> 'a -> 'b array -> 'c array -> 'aval iter2 : ('a -> 'b -> 'c) -> 'a array -> 'b array -> unitval map2 : ('a -> 'b -> 'c) -> 'a array -> 'b array -> 'c arrayval init_matrix : int -> int -> (int -> int -> 'a) -> 'a array arrayval matrix_of_list_list : 'a list list -> 'a array arrayval nb_distinct : 'a array -> intval binary : int -> int -> bool arraybinary len n is base 2 representation of n, truncated to length len.
n = $\sum (binary n).(i) 2i$
val extremum : ('a -> 'a -> bool) -> 'a array -> 'aextremum (>) list gives the max of the list.val swap : 'a array -> int -> int -> unitswap a i j modify the array a in place, swapping elements at indexes i and j.val shuffle : ?prng:Random.State.t -> 'a array -> unitval down_init : int -> (int -> 'a) -> 'a arrayArray.init, but begins the initialisation at the end of the array.val cart : 'a array -> 'b array -> ('a * 'b) array arrayval (*$) : 'a array -> 'b array -> ('a * 'b) array arraycart.val interval : int -> int -> int arrayval (-|) : int -> int -> int arrayinterval.