ArrayQueue


Object Hierarchy:

Object hierarchy for ArrayQueue

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


Namespace: Gee
Package: gee-0.8

Content:

Properties:

Creation methods:

Methods:

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