MbPList(const MbPList &pl) Constructor for copying ~MbPList() void append(void * ptr) int find(const void *ptr) void insert(void *ptr, int addBefore) Inserts given pointer in list before pointer with given index void remove(int which) int getLength() void truncate(int start) void*& operator [](int i) void copy(const MbPList &pl) Copy a PList MbPList& operator =(const MbPList &pl) int operator ==(const MbPList &pl) equality tests int operator !=(const MbPList &pl) PFSTRUCT_DECLARE int compare(const MbPList &pl) NOTE: this must be called only if the number of elements in the two lists is the same, otherwise badness could result void** ptrs int nPtrs int ptrsSize void grow(int max) There are three(!) methods to expand the list. grow() is used when space is dynamically created, and needs to be initialized to NULL: void setSize(int size) void expand(int size)
~MbPList() void append(void * ptr) int find(const void *ptr) void insert(void *ptr, int addBefore) Inserts given pointer in list before pointer with given index void remove(int which) int getLength() void truncate(int start) void*& operator [](int i) void copy(const MbPList &pl) Copy a PList MbPList& operator =(const MbPList &pl) int operator ==(const MbPList &pl) equality tests int operator !=(const MbPList &pl) PFSTRUCT_DECLARE int compare(const MbPList &pl) NOTE: this must be called only if the number of elements in the two lists is the same, otherwise badness could result void** ptrs int nPtrs int ptrsSize void grow(int max) There are three(!) methods to expand the list. grow() is used when space is dynamically created, and needs to be initialized to NULL: void setSize(int size) void expand(int size)
void append(void * ptr) int find(const void *ptr) void insert(void *ptr, int addBefore) Inserts given pointer in list before pointer with given index void remove(int which) int getLength() void truncate(int start) void*& operator [](int i) void copy(const MbPList &pl) Copy a PList MbPList& operator =(const MbPList &pl) int operator ==(const MbPList &pl) equality tests int operator !=(const MbPList &pl) PFSTRUCT_DECLARE int compare(const MbPList &pl) NOTE: this must be called only if the number of elements in the two lists is the same, otherwise badness could result void** ptrs int nPtrs int ptrsSize void grow(int max) There are three(!) methods to expand the list. grow() is used when space is dynamically created, and needs to be initialized to NULL: void setSize(int size) void expand(int size)
int find(const void *ptr) void insert(void *ptr, int addBefore) Inserts given pointer in list before pointer with given index void remove(int which) int getLength() void truncate(int start) void*& operator [](int i) void copy(const MbPList &pl) Copy a PList MbPList& operator =(const MbPList &pl) int operator ==(const MbPList &pl) equality tests int operator !=(const MbPList &pl) PFSTRUCT_DECLARE int compare(const MbPList &pl) NOTE: this must be called only if the number of elements in the two lists is the same, otherwise badness could result void** ptrs int nPtrs int ptrsSize void grow(int max) There are three(!) methods to expand the list. grow() is used when space is dynamically created, and needs to be initialized to NULL: void setSize(int size) void expand(int size)
void insert(void *ptr, int addBefore) Inserts given pointer in list before pointer with given index void remove(int which) int getLength() void truncate(int start) void*& operator [](int i) void copy(const MbPList &pl) Copy a PList MbPList& operator =(const MbPList &pl) int operator ==(const MbPList &pl) equality tests int operator !=(const MbPList &pl) PFSTRUCT_DECLARE int compare(const MbPList &pl) NOTE: this must be called only if the number of elements in the two lists is the same, otherwise badness could result void** ptrs int nPtrs int ptrsSize void grow(int max) There are three(!) methods to expand the list. grow() is used when space is dynamically created, and needs to be initialized to NULL: void setSize(int size) void expand(int size)
void remove(int which) int getLength() void truncate(int start) void*& operator [](int i) void copy(const MbPList &pl) Copy a PList MbPList& operator =(const MbPList &pl) int operator ==(const MbPList &pl) equality tests int operator !=(const MbPList &pl) PFSTRUCT_DECLARE int compare(const MbPList &pl) NOTE: this must be called only if the number of elements in the two lists is the same, otherwise badness could result void** ptrs int nPtrs int ptrsSize void grow(int max) There are three(!) methods to expand the list. grow() is used when space is dynamically created, and needs to be initialized to NULL: void setSize(int size) void expand(int size)
int getLength() void truncate(int start) void*& operator [](int i) void copy(const MbPList &pl) Copy a PList MbPList& operator =(const MbPList &pl) int operator ==(const MbPList &pl) equality tests int operator !=(const MbPList &pl) PFSTRUCT_DECLARE int compare(const MbPList &pl) NOTE: this must be called only if the number of elements in the two lists is the same, otherwise badness could result void** ptrs int nPtrs int ptrsSize void grow(int max) There are three(!) methods to expand the list. grow() is used when space is dynamically created, and needs to be initialized to NULL: void setSize(int size) void expand(int size)
void truncate(int start) void*& operator [](int i) void copy(const MbPList &pl) Copy a PList MbPList& operator =(const MbPList &pl) int operator ==(const MbPList &pl) equality tests int operator !=(const MbPList &pl) PFSTRUCT_DECLARE int compare(const MbPList &pl) NOTE: this must be called only if the number of elements in the two lists is the same, otherwise badness could result void** ptrs int nPtrs int ptrsSize void grow(int max) There are three(!) methods to expand the list. grow() is used when space is dynamically created, and needs to be initialized to NULL: void setSize(int size) void expand(int size)
void*& operator [](int i) void copy(const MbPList &pl) Copy a PList MbPList& operator =(const MbPList &pl) int operator ==(const MbPList &pl) equality tests int operator !=(const MbPList &pl) PFSTRUCT_DECLARE int compare(const MbPList &pl) NOTE: this must be called only if the number of elements in the two lists is the same, otherwise badness could result void** ptrs int nPtrs int ptrsSize void grow(int max) There are three(!) methods to expand the list. grow() is used when space is dynamically created, and needs to be initialized to NULL: void setSize(int size) void expand(int size)
void copy(const MbPList &pl) Copy a PList MbPList& operator =(const MbPList &pl) int operator ==(const MbPList &pl) equality tests int operator !=(const MbPList &pl) PFSTRUCT_DECLARE int compare(const MbPList &pl) NOTE: this must be called only if the number of elements in the two lists is the same, otherwise badness could result void** ptrs int nPtrs int ptrsSize void grow(int max) There are three(!) methods to expand the list. grow() is used when space is dynamically created, and needs to be initialized to NULL: void setSize(int size) void expand(int size)
MbPList& operator =(const MbPList &pl) int operator ==(const MbPList &pl) equality tests int operator !=(const MbPList &pl) PFSTRUCT_DECLARE int compare(const MbPList &pl) NOTE: this must be called only if the number of elements in the two lists is the same, otherwise badness could result void** ptrs int nPtrs int ptrsSize void grow(int max) There are three(!) methods to expand the list. grow() is used when space is dynamically created, and needs to be initialized to NULL: void setSize(int size) void expand(int size)
int operator ==(const MbPList &pl) equality tests int operator !=(const MbPList &pl) PFSTRUCT_DECLARE int compare(const MbPList &pl) NOTE: this must be called only if the number of elements in the two lists is the same, otherwise badness could result void** ptrs int nPtrs int ptrsSize void grow(int max) There are three(!) methods to expand the list. grow() is used when space is dynamically created, and needs to be initialized to NULL: void setSize(int size) void expand(int size)
int operator !=(const MbPList &pl) PFSTRUCT_DECLARE int compare(const MbPList &pl) NOTE: this must be called only if the number of elements in the two lists is the same, otherwise badness could result void** ptrs int nPtrs int ptrsSize void grow(int max) There are three(!) methods to expand the list. grow() is used when space is dynamically created, and needs to be initialized to NULL: void setSize(int size) void expand(int size)
PFSTRUCT_DECLARE int compare(const MbPList &pl) NOTE: this must be called only if the number of elements in the two lists is the same, otherwise badness could result void** ptrs int nPtrs int ptrsSize void grow(int max) There are three(!) methods to expand the list. grow() is used when space is dynamically created, and needs to be initialized to NULL: void setSize(int size) void expand(int size)
int compare(const MbPList &pl) NOTE: this must be called only if the number of elements in the two lists is the same, otherwise badness could result void** ptrs int nPtrs int ptrsSize void grow(int max) There are three(!) methods to expand the list. grow() is used when space is dynamically created, and needs to be initialized to NULL: void setSize(int size) void expand(int size)
void** ptrs int nPtrs int ptrsSize void grow(int max) There are three(!) methods to expand the list. grow() is used when space is dynamically created, and needs to be initialized to NULL: void setSize(int size) void expand(int size)
int nPtrs int ptrsSize void grow(int max) There are three(!) methods to expand the list. grow() is used when space is dynamically created, and needs to be initialized to NULL: void setSize(int size) void expand(int size)
int ptrsSize void grow(int max) There are three(!) methods to expand the list. grow() is used when space is dynamically created, and needs to be initialized to NULL: void setSize(int size) void expand(int size)
void grow(int max) There are three(!) methods to expand the list. grow() is used when space is dynamically created, and needs to be initialized to NULL: void setSize(int size) void expand(int size)
void setSize(int size) void expand(int size)
void expand(int size)
alphabetic index hierarchy of classes
this page has been generated automatically by doc++
(c)opyright by Malte Zöckler, Roland Wunderling contact: doc++@zib.de