PUBLIC

ListPtrC::ListPtrC(void) ListPtrC::ListPtrC(const ListPtrC &) ListPtrC::Data(void) ListPtrC::Data(void) const ListPtrC::Get(void) ListPtrC::Set(DataC &) ListPtrC::Free(void) ListPtrC::Next(void) ListPtrC::Prev(void) ListPtrC::Nth(IndexT) ListPtrC::NextC(void) ListPtrC::PrevC(void) ListPtrC::NthC(IndexT) ListPtrC::NextPtr(void) ListPtrC::PrevPtr(void) ListPtrC::InsBefD(const DataC &) ListPtrC::InsAftD(const DataC &) ListPtrC::ListPtrC(const BaseListPtrC &) ListPtrC::Copy(void) ListPtrC::UnLink(void) ListPtrC::InsBef(const ListPtrC &) ListPtrC::InsAft(const ListPtrC &) ListPtrC::ListPtrC(ListElmC *) ListPtrC::ListPtrC(ListLinkC &) BaseListPtrC::operator=(const BaseListPtrC &) BaseListPtrC::operator!=(const BaseListPtrC &) const BaseListPtrC::operator==(const BaseListPtrC &) const BaseListPtrC::IsFirst(void) const BaseListPtrC::IsLast(void) const BaseListPtrC::IsHead(void) const BaseListPtrC::IsNull(void) const BaseListPtrC::Next(void) BaseListPtrC::Prev(void) BaseListPtrC::Nth(long int) BaseListPtrC::Offset(const BaseListPtrC &) const BaseListPtrC::NextC(void) BaseListPtrC::PrevC(void) BaseListPtrC::NthC(long int) BaseListPtrC::OffsetC(const BaseListPtrC &) const BaseListPtrC::NextPtr(void) const BaseListPtrC::PrevPtr(void) const BaseListPtrC::InsBef(const BaseListPtrC &) BaseListPtrC::InsAft(const BaseListPtrC &) BaseListPtrC::UnLink(void) BaseListPtrC::Free(void) BaseListPtrC::operator<<(ostream &,const BaseListPtrC &)

ListPtrC<class DataC>
double-linked circular list handling
include	"amma/ListPtr.hh"
User Level:	Default
Library:	Mold
Example:	exBiHash.cc
Section:	Obsolete
In Scope:	std

Parent Classes:

public BaseListPtrC

ListPtrC()

Empty pointer. ListPtrC(const ListC & list);

ListPtrC(const ListPtrC<DataC> & ptr)

Copy constructor.

DataC & Data()

const DataC & Data() const

DataC Get()

Return the content of the item and remove the item from the list. The pointer is shifted to the next item.

ListPtrC<DataC> & Set(DataC & data)

void Free()

return the next item

ListPtrC<DataC> & Next()

ListPtrC<DataC> & Prev()

ListPtrC<DataC> & Nth(IndexT i)

Move the pointer relatively to the n-th item.

ListPtrC<DataC> & NextC()

Move the pointer to the next item. If the item is the head of the list, move the pointer to the first item.

ListPtrC<DataC> & PrevC()

Move the pointer to the previous item. If the item is the head of the list, move the pointer to the last item.

ListPtrC<DataC> & NthC(IndexT i)

Move the pointer relatively to the n-th item. If the item is the head of the list, move the pointer to the /first/last item acording to direction of moving.

ListPtrC<DataC> NextPtr()

ListPtrC<DataC> PrevPtr()

ListPtrC<DataC> InsBefD(const DataC & data)

Insert a new item which contains 'data' before the item which is pointed by the pointer. Return the pointer to the new item.

ListPtrC<DataC> InsAftD(const DataC & data)

Insert a new item which contains 'data' after the item which is pointed by the pointer. Return the pointer to the new item.

ListPtrC(const BaseListPtrC & ptr)

this constructor should be private

ListPtrC<DataC> Copy()

Create a new item outside of the list. !!!!!!????? A very bad function.

ListPtrC<DataC> UnLink()

Unlink the element from the list, the element pointer is shifted to the next element, return the unlinked element

const ListPtrC<DataC> & InsBef(const ListPtrC<DataC> & ptr)

const ListPtrC<DataC> & InsAft(const ListPtrC<DataC> & ptr)

ListPtrC(ListElmC<DataC> * elm)

ListPtrC(ListLinkC & link)

const BaseListPtrC & operator=(const BaseListPtrC & in)

BooleanT operator!=(const BaseListPtrC & elm) const

BooleanT operator==(const BaseListPtrC & elm) const

BooleanT IsFirst() const

is an element the first one in a list?

BooleanT IsLast() const

is an element the last one in a list?

BooleanT IsHead() const

is the element a head of a list

BooleanT IsNull() const

is the element NULL

BaseListPtrC & Next()

step to the successor of the element, return the object

BaseListPtrC & Prev()

step to the predecessor of the element, return the object

BaseListPtrC & Nth(long int n)

shift to the n-th element after/before current element, n can be negative; n == 0 means no offset;

long int Offset(const BaseListPtrC & elm) const

return offset of an element from the start, return 0 if elm == start, -1 if element is not a member of the list. does not check counter overflow. */

BaseListPtrC & NextC()

step to the successor of the element in the circular list, return the object

BaseListPtrC & PrevC()

step to the predecessor of the element in the circular list, return the predescessor

BaseListPtrC & NthC(long int n)

shift to the n-th element after/before current element in the circular list, n can be negative; n == 0 means no offset;

long int OffsetC(const BaseListPtrC & elm) const

return offset of an element from the current element in the circular list, return 0 if elm == current element, return -1 if element is not a member of the list. does not check counter overflow. */

BaseListPtrC NextPtr() const

Returns the pointer to the next items.

BaseListPtrC PrevPtr() const

Returns the pointer to the previous items.

const BaseListPtrC & InsBef(const BaseListPtrC & elm)

insert the element elm before, return elm

const BaseListPtrC & InsAft(const BaseListPtrC & elm)

insert the element elm after, return elm

BaseListPtrC UnLink()

return the unlinked element from a list, the element pointer is shifted to the next element

BaseListPtrC & Free()

ostream & operator<<(ostream & s,const BaseListPtrC & elm)