Concurrent |
public class ConcurrentPriorityQueue<TKey, TValue> where TKey : Object, IComparable<TKey>
The ConcurrentPriorityQueueTKey, TValue type exposes the following members.
| Name | Description | |
|---|---|---|
| ConcurrentPriorityQueueTKey, TValue | Initializes a new instance of the ConcurrentPriorityQueueTKey, TValue class. | |
| ConcurrentPriorityQueueTKey, TValue(Int32) | Initializes a new instance of the ConcurrentPriorityQueueTKey, TValue class with a specified initial capacity. |
| Name | Description | |
|---|---|---|
| Count | Gets the number of elements in the queue. | |
| IsEmpty | Gets a value indicating whether the queue is empty. |
| Name | Description | |
|---|---|---|
| Enqueue | Adds the specified key and value to the queue. | |
| 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) | |
| 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) | |
| ToString | Returns a string that represents the current object. (Inherited from Object) | |
| TryDequeue | Dequeues the minimum key value. Returns true if the queue is not empty; otherwise, false. | |
| TryDequeueIf(FuncTKey, Boolean, TKey, TValue) | Dequeues the minimum key value if the predicate returns true for the minimum key. Returns true if the item was dequeued; otherwise, false. | |
| TryDequeueIf(FuncTKey, TValue, Boolean, TKey, TValue) | Dequeues the minimum key value if the predicate returns true for the minimum key and value. Returns true if the item was dequeued; otherwise, false. | |
| TryPeek | Peeks the element with the minimum key value. Returns true if the queue is not empty; otherwise, false. |