An API over arrays that doesn't expose any mutating function. This type 'a IArray.t benefits from good cache locality and fast access to items, but still is functional. However, most operations that create new arrays are linear in time (they copy/traverse the whole input).
val of_list : 'a list -> 'a tval to_list : 'a t -> 'a listval to_array_copy : 'a t -> 'a arraymake a copy into a mutable array
val to_array_unsafe : 'a t -> 'a arrayShow the underlying array. DO NOT MODIFY
val of_array_unsafe : 'a array -> 'a tTake ownership of the given array. Careful, the array must NOT be modified afterwards!
val empty : 'a tval length : _ t -> intval singleton : 'a -> 'a tval doubleton : 'a -> 'a -> 'a tval make : int -> 'a -> 'a tval init : int -> (int -> 'a) -> 'a tval get : 'a t -> int -> 'aval map_arr : ('a -> 'b) -> 'a t -> 'b arrayval mapi_arr : (int -> 'a -> 'b) -> 'a t -> 'b arrayval iter : ('a -> unit) -> 'a t -> unitval iteri : (int -> 'a -> unit) -> 'a t -> unitval foldi : ('a -> int -> 'b -> 'a) -> 'a -> 'b t -> 'aval fold : ('a -> 'b -> 'a) -> 'a -> 'b t -> 'aval for_all : ('a -> bool) -> 'a t -> boolval exists : ('a -> bool) -> 'a t -> boolval to_seq : 'a t -> 'a Iter.tval to_seqi : 'a t -> (int * 'a) Iter.tval of_seq : 'a Iter.t -> 'a t