 | PriorityQueueE Class |
An unbounded priority queue based on a priority heap.
Inheritance HierarchyNamespace: OBCOM.NetSwitchLib.Utils
Assembly: OBCOM.NetSwitchLib (in OBCOM.NetSwitchLib.dll) Version: 1.48.7760.35650 (1.48.7760.35650)
SyntaxType Parameters
- E
- The type of the elements of the priority queue.
The PriorityQueueE type exposes the following members.
Constructors| Name | Description | |
|---|---|---|
 | PriorityQueueE |
Constructs a new PriorityQueue instance.
|
| PriorityQueueE(Int32) |
Constructs a new PriorityQueue instance.
|
| PriorityQueueE(Int32, IComparerE) |
Constructs a new PriorityQueue instance.
|
Properties
Methods| Name | Description | |
|---|---|---|
| Add |
Inserts the specified element into this queue.
|
| Clear |
Removes all of the elements from this queue.
|
| Contains |
Returns true if this queue contains an element.
|
| Equals | Determines whether the specified object is equal to the current object. (Inherited from Object.) |
| GetHashCode | Serves as the default hash function. (Inherited from Object.) |
| GetType | Gets the Type of the current instance. (Inherited from Object.) |
| Peek |
Retrieves, but does not remove, the head of this queue.
|
| Poll |
Retrieves and removes the head of this queue.
|
| Remove |
Removes a single instance of an element from this queue.
|
| ToString | Returns a string that represents the current object. (Inherited from Object.) |
Remarks
Priority queue represented as a balanced binary heap: the two children
of queue[n] are queue[2*n+1] and queue[2*(n+1)]. The priority queue is
ordered by comparator, or by the elements' natural ordering, if
comparator is null: For each node n in the heap and each descendant d of
n, n <= d. The element with the lowest value is in queue[0], assuming
the queue is nonempty.
See Also