|
| Stack () |
|
| ~Stack () |
|
Iterator * | getTop () |
|
void | push (Iterator *it) |
|
void | pop () |
|
| Vector (int initSize, bool ownerOfObjects) |
|
void | put (Iterator *newElement, int newPos=-1) |
|
void | insert (Iterator *newElement, int pos) |
|
int | insertSorted (Iterator *newElement, object::Comparator *comparator=&object::standardComparator) |
|
void | remove (int pos) |
|
Iterator * | get (int pos) const |
|
void | clear () |
|
void | sort (object::Comparator *comparator=&object::standardComparator) |
|
int | bsearch (Iterator *key, bool mustExist, int start, int end, object::Comparator *comparator=&object::standardComparator) |
|
int | bsearch (Iterator *key, bool mustExist, object::Comparator *comparator=&object::standardComparator) |
|
| Collection () |
|
| ~Collection () |
|
bool | equals (Object *other) |
| Returns, whether two objects are equal. More...
|
|
int | hashValue () |
| Return a hash value for the object. More...
|
|
void | intoStringBuffer (misc::StringBuffer *sb) |
| Store a textual representation of the object in a misc::StringBuffer. More...
|
|
Iterator< Iterator > | iterator () |
|
int | size () |
|
virtual | ~Object () |
| The destructor is defined as virtual (but not abstract), so that destruction of Object's works properly. More...
|
|
virtual Object * | clone () |
| Return an exact copy of the object. More...
|
|
const char * | toString () |
| Use object::Object::intoStringBuffer to return a textual representation of the object. More...
|
|
virtual size_t | sizeOf () |
| Return the number of bytes, this object totally uses. More...
|
|
dw::core::DeepIterator::Stack::Stack |
( |
| ) |
|
|
inline |
dw::core::DeepIterator::Stack::~Stack |
( |
| ) |
|
Iterator* dw::core::DeepIterator::Stack::getTop |
( |
| ) |
|
|
inline |
void dw::core::DeepIterator::Stack::pop |
( |
| ) |
|
|
inline |
void dw::core::DeepIterator::Stack::push |
( |
Iterator * |
it | ) |
|
|
inline |
The documentation for this class was generated from the following files: