PUBLIC

BaseListPtrC::BaseListPtrC(void) BaseListPtrC::BaseListPtrC(BaseListC &) BaseListPtrC::BaseListPtrC(const BaseListPtrC &) 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
double-linked circular list handling
include	"amma/BaseLisP.hh"
User Level:	Default
Library:	Mold
Example:	exBiHash.cc
Section:	Obsolete
In Scope:	std

Derived Classes:

ListPtrC

BaseListPtrC()

BaseListPtrC(BaseListC & list)

BaseListPtrC(const BaseListPtrC & ptr)

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