val empty : 'a tval get : 'a t -> int -> 'aval get_safe : 'a t -> int -> 'a optionget_safe a i returns Some a.(i) if i is a valid index
val set : 'a t -> int -> 'a -> unitval length : _ t -> intval fold : ('a -> 'b -> 'a) -> 'a -> 'b t -> 'aval foldi : ('a -> int -> 'b -> 'a) -> 'a -> 'b t -> 'aFold left on array, with index
val fold_while : ('a -> 'b -> 'a * [ `Stop | `Continue ]) -> 'a -> 'b t -> 'aFold left on array until a stop condition via ('a, `Stop) is indicated by the accumulator
val iter : ('a -> unit) -> 'a t -> unitval iteri : (int -> 'a -> unit) -> 'a t -> unitblit from i into j len copies len elements from the first array to the second. See Array.blit.
val reverse_in_place : 'a t -> unitReverse the array in place
val sorted : ('a -> 'a -> int) -> 'a t -> 'a arraysorted cmp a makes a copy of a and sorts it with cmp.
val sort_indices : ('a -> 'a -> int) -> 'a t -> int arraysort_indices cmp a returns a new array b, with the same length as a, such that b.(i) is the index of the i-th element of a in sort cmp a. In other words, map (fun i -> a.(i)) (sort_indices a) = sorted cmp a. a is not modified.
val sort_ranking : ('a -> 'a -> int) -> 'a t -> int arraysort_ranking cmp a returns a new array b, with the same length as a, such that b.(i) is the position in sorted cmp a of the i-th element of a. a is not modified.
In other words, map (fun i -> (sorted cmp a).(i)) (sort_ranking cmp a) = a.
Without duplicates, we also have lookup_exn a.(i) (sorted a) = (sorted_ranking a).(i)
val find : ('a -> 'b option) -> 'a t -> 'b optionfind f a returns Some y if there is an element x such that f x = Some y, else it returns None
val findi : (int -> 'a -> 'b option) -> 'a t -> 'b optionLike find, but also pass the index to the predicate function.
val find_idx : ('a -> bool) -> 'a t -> (int * 'a) optionfind_idx p x returns Some (i,x) where x is the i-th element of l, and p x holds. Otherwise returns None
Lookup the index of some value in a sorted array.
None if the key is not present, or Some i (i the index of the key) otherwise
Same as lookup_exn, but
Not_found if the key is not present
val bsearch :
?cmp:('a -> 'a -> int) ->
'a ->
'a t ->
[ `All_lower | `All_bigger | `Just_after of int | `Empty | `At of int ]bsearch ?cmp x arr finds the index of the object x in the array arr, provided arr is sorted using cmp. If the array is not sorted, the result is not specified (may raise Invalid_argument).
Complexity: O(log n) where n is the length of the array (dichotomic search).
`At i if cmp arr.(i) x = 0 (for some i)`All_lower if all elements of arr are lower than x`All_bigger if all elements of arr are bigger than x`Just_after i if arr.(i) < x < arr.(i+1)`Empty if the array is emptyInvalid_argument if the array is found to be unsorted w.r.t cmp
val for_all : ('a -> bool) -> 'a t -> boolForall on pairs of arrays.
Invalid_argument if they have distinct lengths allow different types
@since 0.20
val exists : ('a -> bool) -> 'a t -> boolExists on pairs of arrays.
Invalid_argument if they have distinct lengths allow different types
@since 0.20
Fold on two arrays stepwise.
Invalid_argument if they have distinct lengths
Iterate on two arrays stepwise.
Invalid_argument if they have distinct lengths
val shuffle : 'a t -> unitShuffle randomly the array, in place
val shuffle_with : Random.State.t -> 'a t -> unitLike shuffle but using a specialized random state
val random_choose : 'a t -> 'a random_genChoose an element randomly.
Not_found if the array/slice is empty
Print an array of items with printing function
Print an array, giving the printing function both index and item
val print :
?sep:string ->
(Format.formatter -> 'a -> unit) ->
Format.formatter ->
'a t ->
unitPrint an array of items with printing function