SortedPriorityQueueTElement Class |
Simple priority queue which uses a list for storing the elements which is always kept sorted.
Inserts can be slow, as worst case inserts (insert at the front) requires a move of all elements, so the order is somewhere around the order of
insertion sort, O((n^2)/4). Lookups and removals are very fast: O(1).
Inheritance HierarchySystemObject
SD.Tools.Algorithmia.PriorityQueuesPriorityQueueBaseTElement
SD.Tools.Algorithmia.PriorityQueuesSortedPriorityQueueTElement
SD.Tools.Algorithmia.PriorityQueuesPriorityQueueBaseTElement
SD.Tools.Algorithmia.PriorityQueuesSortedPriorityQueueTElement
Namespace: SD.Tools.Algorithmia.PriorityQueues
Assembly: SD.Tools.Algorithmia (in SD.Tools.Algorithmia.dll) Version: 1.3.3.0 (1.3.18.0209)
SyntaxType Parameters
- TElement
- The type of the elements in this queue
The SortedPriorityQueueTElement type exposes the following members.
Constructors| Name | Description | |
|---|---|---|
 | SortedPriorityQueueTElement |
Initializes a new instance of the SortedPriorityQueueTElement class.
|
Properties| Name | Description | |
|---|---|---|
 | Count |
Gets the number of elements in the queue
(Overrides PriorityQueueBaseTElementCount.) |
 | PriorityComparison |
Gets the priority comparison.
(Inherited from PriorityQueueBaseTElement.) |
Methods| Name | Description | |
|---|---|---|
| Add |
Adds the specified element to the queue
(Overrides PriorityQueueBaseTElementAdd(TElement).) |
| Clear |
Clears the queue.
(Overrides PriorityQueueBaseTElementClear.) |
| Contains |
Determines whether the queue contains the element specified
(Overrides PriorityQueueBaseTElementContains(TElement).) |
| Equals | Determines whether the specified object is equal to the current object. (Inherited from Object.) |
 | Finalize | Allows an object to try to free resources and perform other cleanup operations before it is reclaimed by garbage collection. (Inherited from Object.) |
| GetEnumerator |
Gets the enumerator for this queue
(Overrides PriorityQueueBaseTElementGetEnumerator.) |
| GetHashCode | Serves as the default hash function. (Inherited from Object.) |
| GetType | Gets the Type of the current instance. (Inherited from Object.) |
| MemberwiseClone | Creates a shallow copy of the current Object. (Inherited from Object.) |
| Peek |
Peeks at the first element of the queue (the one with the highest priority, according to the priority comparison) and returns that element
without removing it
(Overrides PriorityQueueBaseTElementPeek.) |
| Remove |
Removes the first element from the queue, if the queue isn't empty.
(Overrides PriorityQueueBaseTElementRemove.) |
| ToString | Returns a string that represents the current object. (Inherited from Object.) |
Explicit Interface Implementations| Name | Description | |
|---|---|---|
  | IEnumerableTElementGetEnumerator |
Returns an enumerator that iterates through the collection.
(Inherited from PriorityQueueBaseTElement.) |
| IEnumerableGetEnumerator |
Returns an enumerator that iterates through a collection.
(Inherited from PriorityQueueBaseTElement.) |
RemarksIf you store value types in this queue, be aware that Peek() and Remove() on an empty queue will return the default value for
the value type used, e.g. 0 for a priority queue with Int32 values. Therefore, consult Count to check whether there are any values in the queue.
See Also