#include <DpListBinH_Type.h>
Public Methods | |
| DpListBinH(Type) (;) DpListBinH(Type(const) DpListBinH(Type) &list_) | |
| ~DpListBinH(Type) (;) const DpListBinH(Type) &operator=(const DpListBinH(Type) &list_) | |
| void | add (const Type *item) |
| Type* | remove (const int id) |
| Type* | remove (const Type *item) |
| int | size () const |
| Type* | getItem (const int id) const |
| Type* | getItemBefore (const int id) const |
| Type* | operator[] (const int i) const |
| void | unbindLastReturn () |
NAME: DpListBinH(Type) - binary sorted list of class objects managed by handles
DESCRIPTION:
This class implements a macro template for a binary sorted list of class objects that can be managed by handles. The classes that should be sorted must implement a member
int getId() const;
|
|
|
|
|
|
|
|
add a new item to the list. |
|
|
return pointer to item with the given id, or NULL if not found. |
|
|
return pointer to the item in the list with largest id less or equal to the given id, or NULL if not found. |
|
|
|
|
|
See documentation of one of the overloaded functions. |
|
|
One version removes the item with supplied id, the other version of this function removes a specified object from the list. A pointer to the removed item is returned from the function. |
|
|
returns the number of items in the list. |
|
|
|