Concurrent |
Implements a heap based priority queue that hold only keys. The key with the minimum value can then retrieved from the queue. This class is not thread safe.
Inheritance HierarchyNamespace: Altaxo.Collections
Assembly: AltaxoCore (in AltaxoCore.dll) Version: 4.8.3179.0 (4.8.3179.0)
SyntaxC#
public class ConcurrentPriorityQueue<TKey, TValue> where TKey : Object, IComparable<TKey>
Type Parameters
- TKey
- The type of the key.
- TValue
- The type of the value.
The ConcurrentPriorityQueueTKey, TValue type exposes the following members.
Constructors| 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. |
Properties| Name | Description | |
|---|---|---|
 | Count | Gets the number of elements in the queue. |
| IsEmpty | Gets a value indicating whether the queue is empty. |
Methods| Name | Description | |
|---|---|---|
| Enqueue | Adds the specified key 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. An exception is thrown if the queue is empty. |
| TryDequeueIf(FuncTKey, Boolean, TKey, TValue) | Dequeues the minimum key value. Two conditions are neccessary in order to dequeue an item: i) at least one item needs to be in the queue, and ii) the predicate given in the argument, applied to the minimum key value item, must return true. |
| TryDequeueIf(FuncTKey, TValue, Boolean, TKey, TValue) | Dequeues the minimum key value. Two conditions are neccessary in order to dequeue an item: i) at least one item needs to be in the queue, and ii) the predicate given in the argument, applied to the minimum key value item, must return true. |
| TryPeek | Peeks the element with the minimum key value. An exception is thrown if the queue is empty. |
See Also