4 #ifndef RUDIMENTS_AVLTREE_H
5 #define RUDIMENTS_AVLTREE_H
7 #include <rudiments/private/avltreeincludes.h>
10 template <
class valuetype>
67 #include <rudiments/private/avltreenode.h>
76 template <
class valuetype >
237 #include <rudiments/private/avltree.h>
240 #include <rudiments/private/avltreeinlines.h>
avltreenode< valuetype > * getTop()
void insert(avltreenode< valuetype > *node)
avltreenode< valuetype > * getLast()
bool removeAndArrayDelete(valuetype value)
bool removeAndDelete(valuetype value)
void clearAndArrayDelete()
bool remove(valuetype value)
bool removeAndArrayDelete(avltreenode< valuetype > *node)
avltreenode< valuetype > * getPrevious(avltreenode< valuetype > *node)
void insert(valuetype value)
bool removeAndDelete(avltreenode< valuetype > *node)
avltreenode< valuetype > * detach(avltreenode< valuetype > *node)
bool removeAllAndArrayDelete(valuetype value)
bool removeAll(valuetype value)
bool remove(avltreenode< valuetype > *node)
avltreenode< valuetype > * getNext(avltreenode< valuetype > *node)
avltreenode< valuetype > * find(valuetype value)
avltreenode< valuetype > * getFirst()
uint64_t getLength() const
bool removeAllAndDelete(valuetype value)
avltreenode< valuetype > * find(avltreenode< valuetype > *startnode, valuetype value)
int32_t compare(avltreenode< valuetype > *peer) const
avltreenode< valuetype > * getParent()
valuetype getValue() const
avltreenode(valuetype value)
avltreenode< valuetype > * getPrevious()
avltreenode< valuetype > * getNext()
avltreenode< valuetype > * getRightChild()
avltreenode< valuetype > * getLeftChild()
int32_t compare(valuetype value) const