PUBLIC

BListC::BListC(void) BListC::BListC(const BListC &) 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 BListC::BListC(BRCPtrC>)

BListC<class T>
Branching list.
include	"amma/BList.hh"
User Level:	Default
Library:	Branch
Example:	exBiHash.cc
Section:	Containers.Lists
In Scope:	std

Comments:
!!! SMALL OBJECT !!!

This list behaves more like really behaves more like a stack. You can add/remove items from the top of the list, but not from the middle. A second handle to the list acts as if it was a handle to a seperate list. The items in the list itself are not copied, the data in each item is shared. This means you should avoid modifing data in the list, unless your very sure of what you are doing.

BStackC

BRCPtrC> List;

BListC()

Default constructor.

BListC(const BListC<T> & Another)

Copy constructor.

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.

BListC(BRCPtrC<BListElemC<T>> sList)

Construct from ptr.