sig
type 'a t
type 'a enumerable = 'a t
type 'a mappable = 'a t
exception Invalid_arg of int * string * string
val create : unit -> 'a BatDynArray.t
val make : int -> 'a BatDynArray.t
val init : int -> (int -> 'a) -> 'a BatDynArray.t
val singleton : 'a -> 'a BatDynArray.t
val get : 'a BatDynArray.t -> int -> 'a
val set : 'a BatDynArray.t -> int -> 'a -> unit
val upd : 'a BatDynArray.t -> int -> ('a -> 'a) -> unit
val length : 'a BatDynArray.t -> int
val empty : 'a BatDynArray.t -> bool
val first : 'a BatDynArray.t -> 'a
val last : 'a BatDynArray.t -> 'a
val left : 'a BatDynArray.t -> int -> 'a BatDynArray.t
val right : 'a BatDynArray.t -> int -> 'a BatDynArray.t
val head : 'a BatDynArray.t -> int -> 'a BatDynArray.t
val tail : 'a BatDynArray.t -> int -> 'a BatDynArray.t
val insert : 'a BatDynArray.t -> int -> 'a -> unit
val add : 'a BatDynArray.t -> 'a -> unit
val append : 'a BatDynArray.t -> 'a BatDynArray.t -> unit
val delete : 'a BatDynArray.t -> int -> unit
val delete_last : 'a BatDynArray.t -> unit
val delete_range : 'a BatDynArray.t -> int -> int -> unit
val remove_at : int -> 'a BatDynArray.t -> unit
val clear : 'a BatDynArray.t -> unit
val blit :
'a BatDynArray.t -> int -> 'a BatDynArray.t -> int -> int -> unit
val compact : 'a BatDynArray.t -> unit
val enum : 'a BatDynArray.t -> 'a BatEnum.t
val of_enum : 'a BatEnum.t -> 'a BatDynArray.t
val range : 'a BatDynArray.t -> int BatEnum.t
val to_list : 'a BatDynArray.t -> 'a list
val of_list : 'a list -> 'a BatDynArray.t
val to_array : 'a BatDynArray.t -> 'a array
val of_array : 'a array -> 'a BatDynArray.t
val copy : 'a BatDynArray.t -> 'a BatDynArray.t
val sub : 'a BatDynArray.t -> int -> int -> 'a BatDynArray.t
val fill : 'a BatDynArray.t -> int -> int -> 'a -> unit
val split : ('a * 'b) BatDynArray.t -> 'a BatDynArray.t * 'b BatDynArray.t
val combine :
'a BatDynArray.t -> 'b BatDynArray.t -> ('a * 'b) BatDynArray.t
val iter : ('a -> unit) -> 'a BatDynArray.t -> unit
val iteri : (int -> 'a -> unit) -> 'a BatDynArray.t -> unit
val map : ('a -> 'b) -> 'a BatDynArray.t -> 'b BatDynArray.t
val mapi : (int -> 'a -> 'b) -> 'a BatDynArray.t -> 'b BatDynArray.t
val modify : ('a -> 'a) -> 'a BatDynArray.t -> unit
val modifyi : (int -> 'a -> 'a) -> 'a BatDynArray.t -> unit
val fold_left : ('a -> 'b -> 'a) -> 'a -> 'b BatDynArray.t -> 'a
val fold_right : ('a -> 'b -> 'b) -> 'a BatDynArray.t -> 'b -> 'b
val fold_lefti : ('a -> int -> 'b -> 'a) -> 'a -> 'b BatDynArray.t -> 'a
val fold_righti : (int -> 'b -> 'a -> 'a) -> 'b BatDynArray.t -> 'a -> 'a
val reduce : ('a -> 'a -> 'a) -> 'a BatDynArray.t -> 'a
val keep : ('a -> bool) -> 'a BatDynArray.t -> unit
val filter : ('a -> bool) -> 'a BatDynArray.t -> 'a BatDynArray.t
val find_all : ('a -> bool) -> 'a BatDynArray.t -> 'a BatDynArray.t
val filteri : (int -> 'a -> bool) -> 'a BatDynArray.t -> 'a BatDynArray.t
val filter_map : ('a -> 'b option) -> 'a BatDynArray.t -> 'b BatDynArray.t
val partition :
('a -> bool) -> 'a BatDynArray.t -> 'a BatDynArray.t * 'a BatDynArray.t
val for_all : ('a -> bool) -> 'a BatDynArray.t -> bool
val exists : ('a -> bool) -> 'a BatDynArray.t -> bool
val find : ('a -> bool) -> 'a BatDynArray.t -> 'a
val findi : ('a -> bool) -> 'a BatDynArray.t -> int
val index_of : ('a -> bool) -> 'a BatDynArray.t -> int
val mem : 'a -> 'a BatDynArray.t -> bool
val memq : 'a -> 'a BatDynArray.t -> bool
val rev : 'a BatDynArray.t -> 'a BatDynArray.t
val rev_in_place : 'a BatDynArray.t -> unit
val max : 'a BatDynArray.t -> 'a
val min : 'a BatDynArray.t -> 'a
val min_max : 'a BatDynArray.t -> 'a * 'a
val sum : int BatDynArray.t -> int
val fsum : float BatDynArray.t -> float
val kahan_sum : float BatDynArray.t -> float
val avg : int BatDynArray.t -> float
val favg : float BatDynArray.t -> float
val iter2 :
('a -> 'b -> unit) -> 'a BatDynArray.t -> 'b BatDynArray.t -> unit
val iter2i :
(int -> 'a -> 'b -> unit) -> 'a BatDynArray.t -> 'b BatDynArray.t -> unit
val map2 :
('a -> 'b -> 'c) ->
'a BatDynArray.t -> 'b BatDynArray.t -> 'c BatDynArray.t
val map2i :
(int -> 'a -> 'b -> 'c) ->
'a BatDynArray.t -> 'b BatDynArray.t -> 'c BatDynArray.t
val for_all2 :
('a -> 'b -> bool) -> 'a BatDynArray.t -> 'b BatDynArray.t -> bool
val exists2 :
('a -> 'b -> bool) -> 'a BatDynArray.t -> 'b BatDynArray.t -> bool
val cartesian_product :
'a BatDynArray.t -> 'b BatDynArray.t -> ('a * 'b) BatDynArray.t
type resizer_t = currslots:int -> oldlength:int -> newlength:int -> int
val set_resizer : 'a BatDynArray.t -> BatDynArray.resizer_t -> unit
val get_resizer : 'a BatDynArray.t -> BatDynArray.resizer_t
val default_resizer : BatDynArray.resizer_t
val exponential_resizer : BatDynArray.resizer_t
val step_resizer : int -> BatDynArray.resizer_t
val conservative_exponential_resizer : BatDynArray.resizer_t
val create_with : BatDynArray.resizer_t -> 'a BatDynArray.t
val unsafe_get : 'a BatDynArray.t -> int -> 'a
val unsafe_set : 'a BatDynArray.t -> int -> 'a -> unit
val unsafe_upd : 'a BatDynArray.t -> int -> ('a -> 'a) -> unit
val print :
?first:string ->
?last:string ->
?sep:string ->
('a BatInnerIO.output -> 'b -> unit) ->
'a BatInnerIO.output -> 'b BatDynArray.t -> unit
module Exceptionless :
sig
val find : ('a -> bool) -> 'a BatDynArray.t -> 'a option
val findi : ('a -> bool) -> 'a BatDynArray.t -> int option
end
val invariants : 'a BatDynArray.t -> unit
val bool_invariants : 'a BatDynArray.t -> bool
end