sig
module Strategy : Strat.T
type strategy = Strategy.t
type 'a t
val length : 'a Pres_intf.T.t -> int
val lix : 'a Pres_intf.T.t -> int
val real_length : 'a Pres_intf.T.t -> int
val real_lix : 'a Pres_intf.T.t -> int
val get : 'a Pres_intf.T.t -> int -> 'a
val set : 'a Pres_intf.T.t -> int -> 'a -> unit
val sempty : Pres_intf.T.strategy -> 'a Pres_intf.T.t
val empty : unit -> 'a Pres_intf.T.t
val screate : Pres_intf.T.strategy -> int -> 'a -> 'a Pres_intf.T.t
val create : int -> 'a -> 'a Pres_intf.T.t
val smake : Pres_intf.T.strategy -> int -> 'a -> 'a Pres_intf.T.t
val make : int -> 'a -> 'a Pres_intf.T.t
val sinit : Pres_intf.T.strategy -> int -> (int -> 'a) -> 'a Pres_intf.T.t
val init : int -> (int -> 'a) -> 'a Pres_intf.T.t
val get_strategy : 'a Pres_intf.T.t -> Pres_intf.T.strategy
val set_strategy : 'a Pres_intf.T.t -> Pres_intf.T.strategy -> unit
val put_strategy : 'a Pres_intf.T.t -> Pres_intf.T.strategy -> unit
val enforce_strategy : 'a Pres_intf.T.t -> unit
val make_matrix : int -> int -> 'a -> 'a Pres_intf.T.t Pres_intf.T.t
val copy : 'a Pres_intf.T.t -> 'a Pres_intf.T.t
val sub : 'a Pres_intf.T.t -> int -> int -> 'a Pres_intf.T.t
val fill : 'a Pres_intf.T.t -> int -> int -> 'a -> unit
val blit :
'a Pres_intf.T.t -> int -> 'a Pres_intf.T.t -> int -> int -> unit
val append : 'a Pres_intf.T.t -> 'a Pres_intf.T.t -> 'a Pres_intf.T.t
val concat : 'a Pres_intf.T.t list -> 'a Pres_intf.T.t
val add_one : 'a Pres_intf.T.t -> 'a -> unit
val remove_one : 'a Pres_intf.T.t -> unit
val remove_n : 'a Pres_intf.T.t -> int -> unit
val remove_range : 'a Pres_intf.T.t -> int -> int -> unit
val clear : 'a Pres_intf.T.t -> unit
val swap : 'a Pres_intf.T.t -> int -> int -> unit
val swap_in_last : 'a Pres_intf.T.t -> int -> unit
val to_array : 'a Pres_intf.T.t -> 'a array
val sof_array : Pres_intf.T.strategy -> 'a array -> 'a Pres_intf.T.t
val of_array : 'a array -> 'a Pres_intf.T.t
val to_list : 'a Pres_intf.T.t -> 'a list
val sof_list : Pres_intf.T.strategy -> 'a list -> 'a Pres_intf.T.t
val of_list : 'a list -> 'a Pres_intf.T.t
val iter : ('a -> unit) -> 'a Pres_intf.T.t -> unit
val map : ('a -> 'b) -> 'a Pres_intf.T.t -> 'b Pres_intf.T.t
val iteri : (int -> 'a -> unit) -> 'a Pres_intf.T.t -> unit
val mapi : (int -> 'a -> 'b) -> 'a Pres_intf.T.t -> 'b Pres_intf.T.t
val fold_left : ('b -> 'a -> 'b) -> 'b -> 'a Pres_intf.T.t -> 'b
val fold_right : ('a -> 'b -> 'b) -> 'a Pres_intf.T.t -> 'b -> 'b
val for_all : ('a -> bool) -> 'a Pres_intf.T.t -> bool
val exists : ('a -> bool) -> 'a Pres_intf.T.t -> bool
val mem : 'a -> 'a Pres_intf.T.t -> bool
val memq : 'a -> 'a Pres_intf.T.t -> bool
val pos : 'a -> 'a Pres_intf.T.t -> int option
val posq : 'a -> 'a Pres_intf.T.t -> int option
val find : ('a -> bool) -> 'a Pres_intf.T.t -> 'a
val find_index : ('a -> bool) -> 'a Pres_intf.T.t -> int -> int
val filter : ('a -> bool) -> 'a Pres_intf.T.t -> 'a Pres_intf.T.t
val find_all : ('a -> bool) -> 'a Pres_intf.T.t -> 'a Pres_intf.T.t
val filter_in_place : ('a -> bool) -> 'a Pres_intf.T.t -> unit
val partition :
('a -> bool) -> 'a Pres_intf.T.t -> 'a Pres_intf.T.t * 'a Pres_intf.T.t
val unsafe_get : 'a Pres_intf.T.t -> int -> 'a
val unsafe_set : 'a Pres_intf.T.t -> int -> 'a -> unit
val unsafe_sub : 'a Pres_intf.T.t -> int -> int -> 'a Pres_intf.T.t
val unsafe_fill : 'a Pres_intf.T.t -> int -> int -> 'a -> unit
val unsafe_blit :
'a Pres_intf.T.t -> int -> 'a Pres_intf.T.t -> int -> int -> unit
val unsafe_remove_one : 'a Pres_intf.T.t -> unit
val unsafe_remove_n : 'a Pres_intf.T.t -> int -> unit
val unsafe_swap : 'a Pres_intf.T.t -> int -> int -> unit
val unsafe_swap_in_last : 'a Pres_intf.T.t -> int -> unit
end