Module Kxclib.Array0

include module type of struct include Stdlib.Array end
type !'a t = 'a array
val length : 'a array -> int
val get : 'a array -> int -> 'a
val set : 'a array -> int -> 'a -> unit
val make : int -> 'a -> 'a array
val create_float : int -> float array
val init : int -> (int -> 'a) -> 'a array
val make_matrix : int -> int -> 'a -> 'a array array
val append : 'a array -> 'a array -> 'a array
val concat : 'a array list -> 'a array
val sub : 'a array -> int -> int -> 'a array
val copy : 'a array -> 'a array
val fill : 'a array -> int -> int -> 'a -> unit
val blit : 'a array -> int -> 'a array -> int -> int -> unit
val to_list : 'a array -> 'a list
val of_list : 'a list -> 'a array
val iter : ('a -> unit) -> 'a array -> unit
val iteri : (int -> 'a -> unit) -> 'a array -> unit
val map : ('a -> 'b) -> 'a array -> 'b array
val map_inplace : ('a -> 'a) -> 'a array -> unit
val mapi : (int -> 'a -> 'b) -> 'a array -> 'b array
val mapi_inplace : (int -> 'a -> 'a) -> 'a array -> unit
val fold_left : ('acc -> 'a -> 'acc) -> 'acc -> 'a array -> 'acc
val fold_left_map : ('acc -> 'a -> 'acc * 'b) -> 'acc -> 'a array -> 'acc * 'b array
val fold_right : ('a -> 'acc -> 'acc) -> 'a array -> 'acc -> 'acc
val iter2 : ('a -> 'b -> unit) -> 'a array -> 'b array -> unit
val map2 : ('a -> 'b -> 'c) -> 'a array -> 'b array -> 'c array
val for_all : ('a -> bool) -> 'a array -> bool
val exists : ('a -> bool) -> 'a array -> bool
val for_all2 : ('a -> 'b -> bool) -> 'a array -> 'b array -> bool
val exists2 : ('a -> 'b -> bool) -> 'a array -> 'b array -> bool
val mem : 'a -> 'a array -> bool
val memq : 'a -> 'a array -> bool
val find_opt : ('a -> bool) -> 'a array -> 'a option
val find_index : ('a -> bool) -> 'a array -> int option
val find_map : ('a -> 'b option) -> 'a array -> 'b option
val find_mapi : (int -> 'a -> 'b option) -> 'a array -> 'b option
val split : ('a * 'b) array -> 'a array * 'b array
val combine : 'a array -> 'b array -> ('a * 'b) array
val sort : ('a -> 'a -> int) -> 'a array -> unit
val stable_sort : ('a -> 'a -> int) -> 'a array -> unit
val fast_sort : ('a -> 'a -> int) -> 'a array -> unit
val to_seq : 'a array -> 'a Stdlib.Seq.t
val to_seqi : 'a array -> (int * 'a) Stdlib.Seq.t
val of_seq : 'a Stdlib.Seq.t -> 'a array
val unsafe_get : 'a array -> int -> 'a
val unsafe_set : 'a array -> int -> 'a -> unit
module Floatarray : sig ... end
val filter : ('a -> bool) -> 'b array -> 'c array
val filter_map : ('a -> 'b option) -> 'c array -> 'd array
val concat_map : ('a -> 'b array) -> 'c array -> 'd array
include sig ... end
val (|&>) : 'x array -> ('x0 -> 'y) -> 'y0 array
val (|&>>) : 'x array -> ('x0 -> 'y array) -> 'y0 array
val (|+&>) : 'x array -> ('x0 -> 'y) -> ('x0 * 'y) array
val (|!>) : 'x array -> ('x0 -> unit) -> unit
val (|-!>) : 'x array -> ('x0 -> unit) -> 'x1 array
val (|@>) : 'x array -> ('acc * (('acc * 'x0) -> 'acc)) -> 'acc
val (|?>) : 'x array -> ('x0 -> bool) -> 'x1 array
val (|&?>) : 'x array -> ('x0 -> 'y option) -> 'y0 array
val (|+&?>) : 'x array -> ('x0 -> 'y option) -> ('x0 * 'y) array
val of_list_of_length : int -> 'a list -> 'b array
val mean : ?f:(float -> float) -> float t -> float
val min : ('a -> 'b -> int) -> 'c array -> 'd
val max : ('a -> 'b -> int) -> 'c array -> 'd
val first : 'a array -> 'b
val last : 'a array -> 'b
val sorted : ('a -> 'a -> int) -> 'a array -> 'a array
val update : ('a -> 'a) -> 'a array -> int -> unit
val update_each : (int -> 'a -> 'a) -> 'a array -> unit
val blastsati : ('a -> bool) -> 'a array -> int
val blastsat : ('a -> bool) -> 'a array -> 'a

blastsat find the last element e such that pred e being true using binary search.

more specifically,

  • when pred yields false for every element, Not_found is raised

  • when there exists i >= 0 such that

        forall k <= i. (pred arr.(k)) = true
/\  forall k >  i, (pred arr.(k)) = false

    , the i-th element will be returned

  • otherwise, the behavior is undefined
val swap : 'a array -> int -> int -> unit
val shuffle : ?rng:(int -> int) -> 'x array -> unit
val to_function : 'a array -> int -> 'a