Sourceval foldi : 'a array -> init:'b -> f:(int -> 'b -> 'a -> 'b t) -> 'b t Sourceval fold : 'a array -> init:'b -> f:('b -> 'a -> 'b t) -> 'b t Sourceval find : 'a array -> f:('a -> bool t) -> 'a option t Sourceval findi : 'a array -> f:(int -> 'a -> bool t) -> (int * 'a) option t Sourceval find_map : 'a array -> f:('a -> 'b option t) -> 'b option t Sourceval find_mapi : 'a array -> f:(int -> 'a -> 'b option t) -> 'b option t Sourceval exists : 'a array -> f:('a -> bool t) -> bool t Sourceval existsi : 'a array -> f:(int -> 'a -> bool t) -> bool t Sourceval for_all : 'a array -> f:('a -> bool t) -> bool t Sourceval for_alli : 'a array -> f:(int -> 'a -> bool t) -> bool t Sourceval all : 'a t array -> 'a array t Sourceval all_unit : unit t array -> unit t Deferred iterators
In the following, the default how is `Sequential