module Dequeue: sig
.. end
An array that can shrink and expand on both ends - the minimum index needs not be 0.
can easily be used as a double-ended queue
unlike cbuffer, an index refers to the same element after Dequeue.push_front
the "front" is the smallest valid index, while the "back" is the largest
all operations are amortized O(1) with a small constant
type 'a
t
val sexp_of_t : ('a -> Std_internal.Sexp.t) -> 'a t -> Std_internal.Sexp.t
val t_of_sexp : (Std_internal.Sexp.t -> 'a) -> Std_internal.Sexp.t -> 'a t
val create : ?never_shrink:bool -> ?initial_index:int -> dummy:'a -> unit -> 'a t
val length : 'a t -> int
val is_empty : 'a t -> bool
val phys_length : 'a t -> int
val front_index : 'a t -> int
val back_index : 'a t -> int
val get : 'a t -> int -> 'a
val get_front : 'a t -> 'a
val get_back : 'a t -> 'a
val set : 'a t -> int -> 'a -> unit
val iteri : f:(int -> 'a -> unit) -> 'a t -> unit
val iter : f:('a -> unit) -> 'a t -> unit
val foldi : f:('a -> int -> 'b -> 'a) -> init:'a -> 'b t -> 'a
val fold : f:('a -> 'b -> 'a) -> init:'a -> 'b t -> 'a
val push_front : 'a t -> 'a -> unit
val push_back : 'a t -> 'a -> unit
val drop_front : 'a t -> unit
val drop_back : 'a t -> unit
val take_front : 'a t -> 'a
val take_back : 'a t -> 'a
val drop_n_front : 'a t -> int -> unit
val drop_n_back : 'a t -> int -> unit
val drop_indices_less_than : 'a t -> int -> unit
val drop_indices_greater_than : 'a t -> int -> unit