LinkedQueue |
A queue based on a linked list. It’s basically a wrapper class for a linked list to provide FIFO-like access.
LinkedQueue | A queue based on a linked list. |
Functions | |
LinkedQueue | Initializes a new queue. |
peek | Indicates the front item. |
back | Indicates the most recently added item. |
enqueue | Enqueues some data. |
dequeue | Dequeues and returns the front item. |
contains | @inheritDoc |
clear | @inheritDoc |
getIterator | @inheritDoc |
Properties | |
size | @inheritDoc |
Functions | |
isEmpty | @inheritDoc |
toArray | @inheritDoc |
toString | Prints out a string representing the current object. |
dump | Prints out all elements (for debug/demo purposes). |
Initializes a new queue.
public function LinkedQueue( list: SLinkedList = null )
Indicates the front item.
public function peek():*
Indicates the most recently added item.
public function back():*
Enqueues some data.
public function enqueue( obj: * ):void
Dequeues and returns the front item.
public function dequeue():*
@inheritDoc
public function contains( obj: * ):Boolean
@inheritDoc
public function clear():void
@inheritDoc
public function getIterator():Iterator
@inheritDoc
public function get size():int
@inheritDoc
public function isEmpty():Boolean
@inheritDoc
public function toArray():Array
Prints out a string representing the current object.
public function toString():String
Prints out all elements (for debug/demo purposes).
public function dump():String