Class PriorityQueueIterator
Defined in: DataStructures.js.
| Constructor Attributes | Constructor Name and Description |
|---|---|
|
PriorityQueueIterator(aggregate)
Class that implements the iterator for a priority queue.
|
| Field Attributes | Field Name and Description |
|---|---|
|
The aggregate relates to this iterator.
|
|
|
The pointer to the position of the node.
|
|
|
The pointer to the position in the node.
|
| Method Attributes | Method Name and Description |
|---|---|
|
first()
Moves the iterator to the first position of the aggregate.
|
|
|
getItem()
Returns the item stored at the position pointed by the iterator.
|
|
|
isDone()
Checks if the iterator is out of the bounds of the aggregate.
|
|
|
last()
Moves the iterator to the last position of the aggregate.
|
|
|
next()
Moves the iterator to the next item.
|
|
|
previous()
Moves the iterator to the previous item.
|
Class Detail
PriorityQueueIterator(aggregate)
Class that implements the iterator for a priority queue.
- Parameters:
- aggregate
- {PriorityQueue} The aggregate to scan.
Field Detail
aggregate
The aggregate relates to this iterator.
pointerNode
The pointer to the position of the node.
pointerPosition
The pointer to the position in the node.
Method Detail
{void}
first()
Moves the iterator to the first position of the aggregate.
- Returns:
- {void}
{*}
getItem()
Returns the item stored at the position pointed by the iterator.
- Returns:
- {*} The item stored or undefined if it's out of the bounds.
{boolean}
isDone()
Checks if the iterator is out of the bounds of the aggregate.
- Returns:
- {boolean} It return true if the iterator is out of the bounds of the aggregate, otherwise false.
{void}
last()
Moves the iterator to the last position of the aggregate.
- Returns:
- {void}
{void}
next()
Moves the iterator to the next item.
- Returns:
- {void}
{void}
previous()
Moves the iterator to the previous item.
- Returns:
- {void}