Class CircularQueue<T>
Cicular queue aka Ring Buffer using fixed size array.
Inheritance
CircularQueue<T>
Assembly: Advanced.Algorithms.dll
Syntax
public class CircularQueue<T> : object
Type Parameters
Constructors
CircularQueue(Int32)
Declaration
public CircularQueue(int size)
Parameters
Type |
Name |
Description |
Int32 |
size |
|
Properties
Count
Declaration
public int Count { get; }
Property Value
Methods
Dequeue()
Declaration
Returns
Dequeue(Int32)
Declaration
public IEnumerable<T> Dequeue(int bulkNumber)
Parameters
Type |
Name |
Description |
Int32 |
bulkNumber |
|
Returns
Type |
Description |
IEnumerable<T> |
|
Enqueue(T)
Note: When buffer overflows oldest data will be erased.
Time complexity: O(1)
Declaration
Parameters
Type |
Name |
Description |
T |
data |
|
Returns
Enqueue(T[])
Declaration
public IEnumerable<T> Enqueue(T[] bulk)
Parameters
Type |
Name |
Description |
T[] |
bulk |
|
Returns
Type |
Description |
IEnumerable<T> |
Deleted items.
|