package res

  1. Overview
  2. Docs

Parameters

module S : Strat.T

Signature

module Strategy : sig ... end
type strategy = Strategy.t
type !'a t = {
  1. mutable ar : 'a option Impl.t;
  2. mutable vlix : int;
  3. mutable strategy : strategy;
}
val name : string
val invalid_arg : string -> 'a
val failwith : string -> 'a
val length : 'a t -> int
val lix : 'a t -> int
val real_length : 'a t -> int
val real_lix : 'a t -> int
val unsafe_get_ar : 'a option Impl.t -> int -> 'a
val unsafe_get : 'a t -> int -> 'a
val unsafe_set_ar : 'a option Impl.t -> int -> 'a -> unit
val unsafe_set : 'a t -> int -> 'a -> unit
val get : 'a t -> int -> 'a
val set : 'a t -> int -> 'a -> unit
val creator : int -> 'a option Impl.t
val screate_fresh : strategy -> int -> 'a t
val create_fresh : int -> 'a t
val create_from : 'a t -> 'b t
val sempty : strategy -> 'a t
val empty : unit -> 'a t
val screate : strategy -> int -> 'a -> 'a t
val smake : strategy -> int -> 'a -> 'a t
val create : int -> 'a -> 'a t
val make : int -> 'a -> 'a t
val sinit : strategy -> int -> (int -> 'a) -> 'a t
val init : int -> (int -> 'a) -> 'a t
val to_array : 'a t -> 'a array
val sof_array : strategy -> 'a array -> 'a t
val of_array : 'a array -> 'a t
val get_strategy : 'a t -> strategy
val resizer : int -> 'a t -> int -> unit
val enforce_strategy : 'a t -> unit
val set_strategy : 'a t -> strategy -> unit
val put_strategy : 'a t -> strategy -> unit
val make_matrix : int -> int -> 'a -> 'a t t
val copy : 'a t -> 'a t
val unsafe_blit_on_other : 'a t -> int -> 'a t -> int -> int -> unit
val append : 'a t -> 'a t -> 'a t
val concat_aux : 'a t -> int -> 'a t list -> 'a t
val concat : 'a t list -> 'a t
val unsafe_sub : 'a t -> int -> int -> 'a t
val sub : 'a t -> int -> int -> 'a t
val guarantee_ix : 'a t -> int -> unit
val maybe_grow_ix : 'a t -> int -> unit
val add_one : 'a t -> 'a -> unit
val unsafe_remove_one : 'a t -> unit
val remove_one : 'a t -> unit
val unsafe_remove_n : 'a t -> int -> unit
val remove_n : 'a t -> int -> unit
val unsafe_remove_range : 'a t -> int -> int -> unit
val remove_range : 'a t -> int -> int -> unit
val clear : 'a t -> unit
val unsafe_swap : 'a t -> int -> int -> unit
val swap : 'a t -> int -> int -> unit
val unsafe_swap_in_last : 'a t -> int -> unit
val swap_in_last : 'a t -> int -> unit
val unsafe_fill : 'a t -> int -> int -> 'a -> unit
val fill : 'a t -> int -> int -> 'a -> unit
val unsafe_blit : 'a t -> int -> 'a t -> int -> int -> unit
val blit : 'a t -> int -> 'a t -> int -> int -> unit
val to_list_aux : 'a option Impl.t -> int -> 'a list -> 'a list
val to_list : 'a t -> 'a list
val of_list_aux : 'a option Impl.t -> int -> 'a list -> unit
val of_list : 'a list -> 'a t
val sof_list : strategy -> 'a list -> 'a t
val iter : ('a -> unit) -> 'a t -> unit
val map : ('a -> 'b) -> 'a t -> 'b t
val iteri : (int -> 'a -> unit) -> 'a t -> unit
val mapi : (int -> 'a -> 'b) -> 'a t -> 'b t
val fold_left : ('a -> 'b -> 'a) -> 'a -> 'b t -> 'a
val fold_right : ('a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val for_all_aux : int -> ('a -> bool) -> 'a t -> bool
val for_all : ('a -> bool) -> 'a t -> bool
val exists_aux : int -> ('a -> bool) -> 'a t -> bool
val exists : ('a -> bool) -> 'a t -> bool
val mem_aux : int -> 'a -> 'a t -> bool
val mem : 'a -> 'a t -> bool
val memq_aux : int -> 'a -> 'a t -> bool
val memq : 'a -> 'a t -> bool
val pos_aux : int -> 'a -> 'a t -> int option
val pos : 'a -> 'a t -> int option
val posq_aux : int -> 'a -> 'a t -> int option
val posq : 'a -> 'a t -> int option
val find_aux : int -> ('a -> bool) -> 'a t -> 'a
val find : ('a -> bool) -> 'a t -> 'a
val find_index_aux : ('a -> bool) -> 'a t -> int -> int
val find_index : ('a -> bool) -> 'a t -> int -> int
val filter : ('a -> bool) -> 'a t -> 'a t
val find_all : ('a -> bool) -> 'a t -> 'a t
val filter_in_place : ('a -> bool) -> 'a t -> unit
val partition : ('a -> bool) -> 'a t -> 'a t * 'a t
OCaml

Innovation. Community. Security.