Deque


Object Hierarchy:

Object hierarchy for Deque

Description:

public class Deque<T> : Object

A double-ended queue (deque) that supports efficient insertion and removal at both ends.

Deque provides O(1) addFirst/addLast and removeFirst/removeLast. Inspired by Java's ArrayDeque.

For element comparison in contains(), pass an equality function to the constructor. For string elements, use GLib.str_equal.

Example:

    var deque = new Deque<string> (GLib.str_equal);
deque.addLast ("a");
deque.addLast ("b");
deque.addFirst ("z");
assert (deque.peekFirst () == "z");
assert (deque.peekLast () == "b");
assert (deque.size () == 3);


Namespace: Vala.Collections
Package: Valacore

Content:

Creation methods:

Methods:

Inherited Members:

All known members inherited from class GLib.Object