ScottPlot
|
The circular buffer starts with an empty list and grows to a maximum size. When the buffer is full, adding or inserting a new item removes the first item in the buffer. More...
Public Member Functions | |
CircularBuffer (int capacity) | |
int | IndexOf (T item) |
void | Insert (int index, T item) |
void | RemoveAt (int index) |
bool | Remove (T item) |
void | Add (T item) |
void | Clear () |
bool | Contains (T item) |
void | CopyTo (T[] array, int arrayIndex) |
T[] | ToArray () |
IEnumerator< T > | GetEnumerator () |
int | BinarySearch (int index, int count, T item, IComparer< T > comparer) |
Properties | |
int | Capacity [get] |
bool | IsFull [get] |
bool | IsEmpty [get] |
int | Count [get] |
bool | IsReadOnly [get] |
bool | IsFixedSize = true [get] |
object | SyncRoot = new object() [get] |
bool | IsSynchronized [get] |
T | this[int index] [get, set] |
The circular buffer starts with an empty list and grows to a maximum size. When the buffer is full, adding or inserting a new item removes the first item in the buffer.
|
inline |
|
inline |
|
inline |
|
inline |
bool ScottPlot.Collections.CircularBuffer< T >.Contains | ( | T | item | ) |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
get |
|
get |
|
get |
|
get |
|
get |
|
get |
|
get |
|
get |
|
getset |