-
-
Notifications
You must be signed in to change notification settings - Fork 0
easyextensionscollectionsconcurrent LimitedConcurrentQueueT
BigMakCode edited this page Aug 5, 2024
·
1 revision
Provides a thread-safe first in-first out (FIFO) collection with a limit.
flowchart LR
classDef interfaceStyle stroke-dasharray: 5 5;
classDef abstractStyle stroke-width:4px
subgraph EasyExtensions.Collections.Concurrent
EasyExtensions.Collections.Concurrent.LimitedConcurrentQueue_1[[LimitedConcurrentQueue< T >]]
end
subgraph System.Collections.Concurrent
System.Collections.Concurrent.ConcurrentQueue_1[[ConcurrentQueue]]
end
System.Collections.Concurrent.ConcurrentQueue_1 --> EasyExtensions.Collections.Concurrent.LimitedConcurrentQueue_1
| Returns | Name |
|---|---|
void |
Enqueue(T item) |
Provides a thread-safe first in-first out (FIFO) collection with a limit.
| Type | Description | Constraints |
|---|---|---|
T |
The type of the elements contained in the queue. |
-
ConcurrentQueue<T>
public LimitedConcurrentQueue(int limit)| Type | Name | Description |
|---|---|---|
int |
limit | Queue limit. |
Creates a new instance of the LimitedConcurrentQueue<T> class with the specified limit.
public LimitedConcurrentQueue(int limit, IEnumerable<T> collection)| Type | Name | Description |
|---|---|---|
int |
limit | |
IEnumerable<T> |
collection |
public void Enqueue(T item)| Type | Name | Description |
|---|---|---|
T |
item |
Generated with ModularDoc