Batteries user guide : Batteries.Vect

`sig
type 'a t = 'a BatVect.t
exception Out_of_bounds
val max_length : int
val empty : 'a t
val singleton : 'a -> 'a t
val of_array : 'a array -> 'a t
val to_array : 'a t -> 'a array
val to_list : 'a t -> 'a list
val of_list : 'a list -> 'a t
val make : int -> 'a -> 'a t
val init : int -> (int -> 'a) -> 'a t
val is_empty : 'a t -> bool
val height : 'a t -> int
val length : 'a t -> int
val balance : 'a t -> 'a t
val concat : 'a t -> 'a t -> 'a t
val append : 'a -> 'a t -> 'a t
val prepend : 'a -> 'a t -> 'a t
val get : 'a t -> int -> 'a
val at : 'a t -> int -> 'a
val set : 'a t -> int -> 'a -> 'a t
val modify : 'a t -> int -> ('a -> 'a) -> 'a t
val destructive_set : 'a t -> int -> 'a -> unit
val sub : 'a t -> int -> int -> 'a t
val insert : int -> 'a t -> 'a t -> 'a t
val remove : int -> int -> 'a t -> 'a t
val enum : 'a t -> 'a BatEnum.t
val of_enum : 'a BatEnum.t -> 'a t
val backwards : 'a t -> 'a BatEnum.t
val of_backwards : 'a BatEnum.t -> 'a t
val iter : ('a -> unit) -> 'a t -> unit
val iteri : (int -> 'a -> unit) -> 'a t -> unit
val rangeiter : ('a -> unit) -> int -> int -> 'a t -> unit
val fold_left : ('b -> 'a -> 'b) -> 'b -> 'a t -> 'b
val fold : ('b -> 'a -> 'b) -> 'b -> 'a t -> 'b
val reduce : ('a -> 'a -> 'a) -> 'a t -> 'a
val fold_right : ('a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val foldi : (int -> 'b -> 'a -> 'b) -> 'b -> 'a t -> 'b
val map : ('a -> 'b) -> 'a t -> 'b t
val mapi : (int -> 'a -> 'b) -> 'a t -> 'b t
val for_all : ('a -> bool) -> 'a t -> bool
val exists : ('a -> bool) -> 'a t -> bool
val find : ('a -> bool) -> 'a t -> 'a
val mem : 'a -> 'a t -> bool
val memq : 'a -> 'a t -> bool
val findi : ('a -> bool) -> 'a t -> int
val filter : ('a -> bool) -> 'a t -> 'a t
val filter_map : ('a -> 'b option) -> 'a t -> 'b t
val find_all : ('a -> bool) -> 'a t -> 'a t
val partition : ('a -> bool) -> 'a t -> 'a t * 'a t
val first : 'a t -> 'a
val last : 'a t -> 'a
val shift : 'a t -> 'a * 'a t
val pop : 'a t -> 'a * 'a t
val print :
?first:string ->
?last:string ->
?sep:string ->
('a BatInnerIO.output -> 'b -> unit) ->
'a BatInnerIO.output -> 'b t -> unit
val compare : 'a BatOrd.comp -> 'a t BatOrd.comp
val equal : 'a BatOrd.eq -> 'a t BatOrd.eq
val ord : 'a BatOrd.ord -> 'a t BatOrd.ord
val invariants : 'a t -> unit
module type RANDOMACCESS =
sig
type 'a t
val empty : 'a t
val get : 'a t -> int -> 'a
val unsafe_get : 'a t -> int -> 'a
val set : 'a t -> int -> 'a -> unit
val unsafe_set : 'a t -> int -> 'a -> unit
val append : 'a t -> 'a t -> 'a t
val concat : 'a t list -> 'a t
val length : 'a t -> int
val copy : 'a t -> 'a t
val sub : 'a t -> int -> int -> 'a t
val make : int -> 'a -> 'a t
val iter : ('a -> unit) -> 'a t -> unit
val map : ('a -> 'b) -> 'a t -> 'b t
val fold_right : ('a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val enum : 'a t -> 'a BatEnum.t
val backwards : 'a t -> 'a BatEnum.t
val of_enum : 'a BatEnum.t -> 'a t
val of_backwards : 'a BatEnum.t -> 'a t
end
module Make :
functor (R : RANDOMACCESS) ->
functor (PARAM : sig val max_height : int val leaf_size : int end) ->
sig
type 'a t = 'a BatVect.Make(R)(PARAM).t
exception Out_of_bounds
val max_length : int
val empty : 'a t
val singleton : 'a -> 'a t
val of_container : 'a R.t -> 'a t
val to_container : 'a t -> 'a R.t
val of_array : 'a array -> 'a t
val to_array : 'a t -> 'a array
val to_list : 'a t -> 'a list
val of_list : 'a list -> 'a t
val make : int -> 'a -> 'a t
val init : int -> (int -> 'a) -> 'a t
val is_empty : 'a t -> bool
val height : 'a t -> int
val length : 'a t -> int
val balance : 'a t -> 'a t
val concat : 'a t -> 'a t -> 'a t
val append : 'a -> 'a t -> 'a t
val prepend : 'a -> 'a t -> 'a t
val get : 'a t -> int -> 'a
val at : 'a t -> int -> 'a
val set : 'a t -> int -> 'a -> 'a t
val modify : 'a t -> int -> ('a -> 'a) -> 'a t
val destructive_set : 'a t -> int -> 'a -> unit
val sub : 'a t -> int -> int -> 'a t
val insert : int -> 'a t -> 'a t -> 'a t
val remove : int -> int -> 'a t -> 'a t
val enum : 'a t -> 'a BatEnum.t
val of_enum : 'a BatEnum.t -> 'a t
val backwards : 'a t -> 'a BatEnum.t
val of_backwards : 'a BatEnum.t -> 'a t
val iter : ('a -> unit) -> 'a t -> unit
val iteri : (int -> 'a -> unit) -> 'a t -> unit
val rangeiter : ('a -> unit) -> int -> int -> 'a t -> unit
val fold_left : ('b -> 'a -> 'b) -> 'b -> 'a t -> 'b
val fold : ('b -> 'a -> 'b) -> 'b -> 'a t -> 'b
val reduce : ('a -> 'a -> 'a) -> 'a t -> 'a
val fold_right : ('a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val foldi : (int -> 'b -> 'a -> 'b) -> 'b -> 'a t -> 'b
val map : ('a -> 'b) -> 'a t -> 'b t
val mapi : (int -> 'a -> 'b) -> 'a t -> 'b t
val for_all : ('a -> bool) -> 'a t -> bool
val exists : ('a -> bool) -> 'a t -> bool
val find : ('a -> bool) -> 'a t -> 'a
val mem : 'a -> 'a t -> bool
val memq : 'a -> 'a t -> bool
val findi : ('a -> bool) -> 'a t -> int
val filter : ('a -> bool) -> 'a t -> 'a t
val filter_map : ('a -> 'b option) -> 'a t -> 'b t
val find_all : ('a -> bool) -> 'a t -> 'a t
val partition : ('a -> bool) -> 'a t -> 'a t * 'a t
val first : 'a t -> 'a
val last : 'a t -> 'a
val shift : 'a t -> 'a * 'a t
val pop : 'a t -> 'a * 'a t
val print :
?first:string ->
?last:string ->
?sep:string ->
('a BatInnerIO.output -> 'b -> unit) ->
'a BatInnerIO.output -> 'b t -> unit
val invariants : 'a t -> unit
end
end`