Askowl.Fifo< T > Class Template Reference

Intentionally simple stack implementation More...

Inheritance diagram for Askowl.Fifo< T >:

Public Member Functions
	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...
virtual void	Dispose ()
	Send back to recycling More...
void	Clear ()
	//#TBD#// More...
T []	ToArray ()
	//#TBD#// More...
override string	ToString ()
	//#TBD#// More...

Public Attributes
T	this[int i] => stack[i]
	Array-like indexing into the stack More...
bool	Empty => Count == 0
	//#TBD#// More...

Static Public Attributes
static Fifo< T >	Instance => Cache<Fifo<T>>.Instance
	Fetch Fifo Stack from recycling More...

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

Detailed Description

Intentionally simple stack implementation

Definition at line 8 of file Fifo.cs.

Constructor & Destructor Documentation

Fifo()

Askowl.Fifo< T >.Fifo

(

)

Raw creation for subclasses that do their own caching

Definition at line 17 of file Fifo.cs.

Member Function Documentation

Clear()

void Askowl.Fifo< T >.Clear

(

)

//#TBD#//

Definition at line 74 of file Fifo.cs.

Dispose()

virtual void Askowl.Fifo< T >.Dispose ( )

virtual

Send back to recycling

Reimplemented in Askowl.CounterFifo.

Definition at line 68 of file Fifo.cs.

Pop()

virtual T Askowl.Fifo< T >.Pop ( )

virtual

Pop an entry from the top of the stack

Push()

virtual T Askowl.Fifo< T >.Push ( T  entry )

virtual

Push a new entry onto the top of the stack

Definition at line 33 of file Fifo.cs.

Swap()

Fifo<T> Askowl.Fifo< T >.Swap

(

)

Swap the top and second entries on the stack

Definition at line 48 of file Fifo.cs.

ToArray()

T [] Askowl.Fifo< T >.ToArray

(

)

//#TBD#//

Definition at line 80 of file Fifo.cs.

ToString()

override string Askowl.Fifo< T >.ToString

(

)

//#TBD#//

Member Data Documentation

Empty

bool Askowl.Fifo< T >.Empty => Count == 0

//#TBD#//

Definition at line 29 of file Fifo.cs.

Instance

Fifo<T> Askowl.Fifo< T >.Instance => Cache<Fifo<T>>.Instance

static

Fetch Fifo Stack from recycling

Definition at line 20 of file Fifo.cs.

this[int i]

T Askowl.Fifo< T >.this[int i] => stack[i]

Array-like indexing into the stack

Definition at line 23 of file Fifo.cs.

Property Documentation

Bottom

T Askowl.Fifo< T >.Bottom

getset

Get/set the value at the bottom of the stack.

Definition at line 65 of file Fifo.cs.

Count

int Askowl.Fifo< T >.Count

getset

Number of items on the stack

Definition at line 26 of file Fifo.cs.

Next

T Askowl.Fifo< T >.Next

getset

Get/set the value at second to top of the stack.

Definition at line 62 of file Fifo.cs.

Top

T Askowl.Fifo< T >.Top

getset

Get/set the value at the top of the stack.

Definition at line 59 of file Fifo.cs.

---

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

• Fifo.cs