This structure provides fast access to its front and back elements, with O(1) operations
val create : unit -> 'a tNew deque
val clear : _ t -> unitRemove all elements
val is_empty : 'a t -> boolIs the deque empty?
equal a b checks whether a and b contain the same sequence of elements.
comparison function for elements
compare a b compares lexicographically a and b
comparison function for elements
val length : 'a t -> intNumber of elements used to be linear time, now constant time
val push_front : 'a t -> 'a -> unitPush value at the front
val push_back : 'a t -> 'a -> unitPush value at the back
append_front ~into q adds all elements of q at the front of into O(length q) in time
append_back ~into q adds all elements of q at the back of into. O(length q) in time
val iter : ('a -> unit) -> 'a t -> unitIterate on elements
val fold : ('b -> 'a -> 'b) -> 'b -> 'a t -> 'bFold on elements
Create a deque from the sequence.
add_seq_back instead
add_seq_front q seq adds elements of seq into the front of q, in reverse order. O(n) in time, where n is the number of elements to add.
add_seq_back q seq adds elements of seq into the back of q, in order. O(n) in time, where n is the number of elements to add.
val of_list : 'a list -> 'a tConversion from list, in order
val to_list : 'a t -> 'a listList of elements, in order. Less efficient than to_rev_list.
val to_rev_list : 'a t -> 'a listEfficient conversion to list, in reverse order
type 'a printer = Format.formatter -> 'a -> unit