Module `Prime_enumlist`

Pure random access list (prime.unstable). A balanced binary tree with a list-like interface, yielding logarithmic amortized complexity for arbitrary element access, insert, and removal.

type 'a t

val is_empty : 'a t -> bool
val length : 'a t -> int
val empty : 'a t
val singleton : 'a -> 'a t
val sample : (int -> 'a) -> int -> 'a t
val get : 'a t -> int -> 'a
val set : int -> 'a -> 'a t -> 'a t
val update : int -> ('a -> 'a) -> 'a t -> 'a t
val first_exn : 'a t -> 'a
val last_exn : 'a t -> 'a
val pop_first_exn : 'a t -> 'a * 'a t
val pop_last_exn : 'a t -> 'a * 'a t
val push_first : 'a -> 'a t -> 'a t
val push_last : 'a -> 'a t -> 'a t
val insert : int -> 'a -> 'a t -> 'a t
val delete : int -> 'a t -> 'a t
val glue : 'a -> 'a t -> 'a t -> 'a t
val cat : 'a t -> 'a t -> 'a t
val cut : int -> 'a t -> 'a t * 'a t
val of_list : 'a list -> 'a t
val to_list : 'a t -> 'a list
val search : ('a -> 'b option) -> 'a t -> 'b option
val iter : ('a -> unit) -> 'a t -> unit
val iteri : (int -> 'a -> unit) -> 'a t -> unit
val fold : ('a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val foldi : (int -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val for_all : ('a -> bool) -> 'a t -> bool
val exists : ('a -> bool) -> 'a t -> bool
val filter : ('a -> bool) -> 'a t -> 'a t
val map : ('a -> 'b) -> 'a t -> 'b t
val mapi : (int -> 'a -> 'b) -> 'a t -> 'b t
val filter_map : ('a -> 'b option) -> 'a t -> 'b t
val filter_mapi : (int -> 'a -> 'b option) -> 'a t -> 'b t
val fmap : ('a -> 'b option) -> 'a t -> 'b t
val fmapi : (int -> 'a -> 'b option) -> 'a t -> 'b t
val compare : ('a -> 'b -> int) -> 'a t -> 'b t -> int
val equal : ('a -> 'b -> bool) -> 'a t -> 'b t -> bool