Class: Queue

Queue()

new Queue()

Source:

Members

length

Source:

myQueue :Array.<T>

Type:
  • Array.<T>
Source:

Methods

clear()

Source:

copy()

Source:

deleteAtPos()

Deletes the item at the given position then resets the items after
Source:

dequeue()

Source:

enqueue()

Source:

find()

Source:

forEach()

Source:

isEmpty() → {boolean}

Source:
Returns:
Type
boolean

join()

Joins the provided queue to the end of the queue in this instance
Source:

peek()

Source:

position()

Source:

sortDelete()

Using algo below to avoid touching this.myQueue directly and have heads and tails update correctly Less buggy
Source:

tail()

Get the value at the tail of the queue
Source: