Inheritance diagram for Askowl.CounterFifo:

Public Member Functions
int	Start (int startingValue=0)
	Add a new counter and set it to the starting value More...

new int	Next ()
	Increment he top counter More...

bool	Reached (int bounds)
	See if the top counter has reached the target value More...

override void	Dispose ()
	Send back to recycling More...

Public Member Functions inherited from Askowl.Fifo< int >
	Fifo ()
	Raw creation for subclasses that do their own caching More...

virtual T	Push (T entry)
	Push a new entry onto the top of the stack More...

virtual T	Pop ()
	Pop an entry from the top of the stack More...

Fifo< T >	Swap ()
	Swap the top and second entries on the stack More...

void	Clear ()
	//#TBD#// More...

T []	ToArray ()
	//#TBD#// More...

override string	ToString ()
	//#TBD#// More...

Static Public Attributes
static new CounterFifo	Instance => Cache<CounterFifo>.Instance
	Retrieve a new (cached) instance More...

Static Public Attributes inherited from Askowl.Fifo< int >
static Fifo< T >	Instance
	Fetch Fifo Stack from recycling More...

Additional Inherited Members
Public Attributes inherited from Askowl.Fifo< int >
T	this[int i]
	Array-like indexing into the stack More...

bool	Empty
	//#TBD#// More...

Properties inherited from Askowl.Fifo< int >
int	Count `[get, set]`
	Number of items on the stack More...

T	Top `[get, set]`
	Get/set the value at the top of the stack. More...

T	Next `[get, set]`
	Get/set the value at second to top of the stack. More...

T	Bottom `[get, set]`
	Get/set the value at the bottom of the stack. More...