PUBLIC

BStackC::BStackC(void) BStackC::BStackC(const BStackC &) BStackC::Push(const T &) BStackC::Pop(void) BStackC::DelFirst(void) BStackC::DelTop(void) BStackC::Top(void) const BStackC::First(void) const BStackC::GetFirst(void) BStackC::IsEmpty(void) const BListC::Copy(void) const BListC::IsEmpty(void) const BListC::InsFirst(const T &) BListC::DelFirst(void) BListC::RemoveAfter(BListIterC &) BListC::operator=(const BListC &) BListC::First(void) BListC::First(void) const BListC::Empty(void) BListC::Size(void) const

BStackC<class T>
Branching stack.
include	"amma/BStack.hh"
User Level:	Default
Library:	Branch
Example:	exBiHash.cc
Section:	Containers.Stacks
In Scope:	std

Comments:
!!! SMALL OBJECT !!!

public BListC<class T>

BStackC()

Default constructor.

BStackC(const BStackC & Oth)

Copy constructor.

void Push(const T & Data)

Push item onto stack.

T Pop(void)

Pop item from top of stack.

void DelFirst(void)

Delete the item from the top of the stack.

void DelTop(void)

Delete the item from the top of the stack.

const T & Top(void) const

Look at top of stack.

const T & First() const

First on stack, just alias for Top.

T GetFirst(void)

Get item at top of stack.

BooleanT IsEmpty() const

Is stack empty ?

BListC<T> Copy() const

Make copy, dummy function not needed.

BooleanT IsEmpty() const

Is list empty ?

void InsFirst(const T & Data)

Insert element first in list.

BooleanT DelFirst()

Delete element first in list.
Returns FALSE if list is empty.

BooleanT RemoveAfter(BListIterC<T> & At)

Remove element after At.
Returns FALSE if no such element.

const BListC<T> & operator=(const BListC<T> & Oth)

Assign to another list, old list is destroyed.

T & First()

Get first item in list. List MUST NOT be empty.

const T & First() const

Get first item in list. List MUST NOT be empty.

void Empty()

Empty the list of all its contents.

UIntT Size() const

Get size of list.