ScottPlot
Loading...
Searching...
No Matches
Public Member Functions | Properties | List of all members
ScottPlot.Collections.CircularBuffer< T > Class Template Referencesealed

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...

Inheritance diagram for ScottPlot.Collections.CircularBuffer< T >:
IList ICollection IEnumerable IEnumerable

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]
 
this[int index] [get, set]
 

Detailed Description

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.

Constructor & Destructor Documentation

◆ CircularBuffer()

Member Function Documentation

◆ Add()

void ScottPlot.Collections.CircularBuffer< T >.Add ( item)
inline

◆ BinarySearch()

int ScottPlot.Collections.CircularBuffer< T >.BinarySearch ( int  index,
int  count,
item,
IComparer< T >  comparer 
)
inline

◆ Clear()

void ScottPlot.Collections.CircularBuffer< T >.Clear ( )
inline

◆ Contains()

bool ScottPlot.Collections.CircularBuffer< T >.Contains ( item)

◆ CopyTo()

void ScottPlot.Collections.CircularBuffer< T >.CopyTo ( T[]  array,
int  arrayIndex 
)
inline

◆ GetEnumerator()

IEnumerator< T > ScottPlot.Collections.CircularBuffer< T >.GetEnumerator ( )
inline

◆ IndexOf()

int ScottPlot.Collections.CircularBuffer< T >.IndexOf ( item)
inline

◆ Insert()

void ScottPlot.Collections.CircularBuffer< T >.Insert ( int  index,
item 
)
inline

◆ Remove()

bool ScottPlot.Collections.CircularBuffer< T >.Remove ( item)
inline

◆ RemoveAt()

void ScottPlot.Collections.CircularBuffer< T >.RemoveAt ( int  index)
inline

◆ ToArray()

T[] ScottPlot.Collections.CircularBuffer< T >.ToArray ( )
inline

Property Documentation

◆ Capacity

int ScottPlot.Collections.CircularBuffer< T >.Capacity
get

◆ Count

◆ IsEmpty

bool ScottPlot.Collections.CircularBuffer< T >.IsEmpty
get

◆ IsFixedSize

bool ScottPlot.Collections.CircularBuffer< T >.IsFixedSize = true
get

◆ IsFull

◆ IsReadOnly

bool ScottPlot.Collections.CircularBuffer< T >.IsReadOnly
get

◆ IsSynchronized

bool ScottPlot.Collections.CircularBuffer< T >.IsSynchronized
get

◆ SyncRoot

object ScottPlot.Collections.CircularBuffer< T >.SyncRoot = new object()
get

◆ this[int index]

T ScottPlot.Collections.CircularBuffer< T >.this[int index]
getset

The documentation for this class was generated from the following file: