ArrayQueue
Object Hierarchy:
Description:
public class ArrayQueue<
G> :
AbstractQueue<
G>,
Deque<
G>
Resizable array implementation of the Deque interface.
The storage array grows automatically when needed.
This implementation is pretty good for lookups at the end or random. Because they are stored in an array this structure does not fit for
deleting arbitrary elements. For an alternative implementation see LinkedList.
See also:
LinkedList
Content:
Properties:
Creation methods:
Methods:
- public override bool @foreach (ForallFunc<G> f)
- public override bool add (G element)
Adds an item to this collection. Must not be called on read-only
collections.
- public override void clear ()
Removes all items from this collection. Must not be called on read-
only collections.
- public override bool contains (G item)
Determines whether this collection contains the specified item.
- public override Iterator<G> iterator ()
Returns a Iterator
that can be used for simple iteration over a collection.
- public override G peek ()
- public override G poll ()
- public override bool remove (G item)
Removes the first occurrence of an item from this collection. Must not
be called on read-only collections.
Inherited Members:
All known members inherited from class Gee.AbstractQueue
All known members inherited from class Gee.AbstractCollection
All known members inherited from class GLib.Object
All known members inherited from interface Gee.Deque
All known members inherited from interface Gee.Queue
All known members inherited from interface Gee.Traversable
All known members inherited from interface Gee.Iterable
All known members inherited from interface Gee.Collection