-
Notifications
You must be signed in to change notification settings - Fork 0
easyextensionscollections LimitedQueueT
BigMakCode edited this page Aug 5, 2024
·
1 revision
Provides a 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
EasyExtensions.Collections.LimitedQueue_1[[LimitedQueue< T >]]
end
subgraph System.Collections.Generic
System.Collections.Generic.Queue_1[[Queue]]
end
System.Collections.Generic.Queue_1 --> EasyExtensions.Collections.LimitedQueue_1
Returns | Name |
---|---|
void |
Enqueue (T item) |
Provides a first in-first out (FIFO) collection with a limit.
Type | Description | Constraints |
---|---|---|
T |
The type of the elements contained in the queue. |
-
Queue
<T
>
public LimitedQueue(int limit)
Type | Name | Description |
---|---|---|
int |
limit | Queue limit. |
Creates a new instance of the LimitedQueue<T> class with the specified limit.
public LimitedQueue(int limit, IEnumerable<T> collection)
Type | Name | Description |
---|---|---|
int |
limit | |
IEnumerable <T > |
collection |
public LimitedQueue(int limit, int capacity)
Type | Name | Description |
---|---|---|
int |
limit | Queue limit. |
int |
capacity | The initial number of elements that the LimitedQueue<T> can contain. |
Creates a new instance of the LimitedQueue<T> class with the specified limit and capacity.
public void Enqueue(T item)
Type | Name | Description |
---|---|---|
T |
item |
Generated with ModularDoc