val foldi : 'a iarray -> init:'b -> f:(int -> 'b -> 'a -> 'b t) -> 'b tval fold : 'a iarray -> init:'b -> f:('b -> 'a -> 'b t) -> 'b tval find : 'a iarray -> f:('a -> bool t) -> 'a option tval findi : 'a iarray -> f:(int -> 'a -> bool t) -> (int * 'a) option tval find_map : 'a iarray -> f:('a -> 'b option t) -> 'b option tval find_mapi : 'a iarray -> f:(int -> 'a -> 'b option t) -> 'b option tval exists : 'a iarray -> f:('a -> bool t) -> bool tval existsi : 'a iarray -> f:(int -> 'a -> bool t) -> bool tval for_all : 'a iarray -> f:('a -> bool t) -> bool tval for_alli : 'a iarray -> f:(int -> 'a -> bool t) -> bool tval all : 'a t iarray -> 'a iarray tval all_unit : unit t iarray -> unit tDeferred iterators