a54549a8cd
- Renamed to AVLTreeBase and moved it into its own header/source file. - Renamed FindClose() to FindClosest(). - Added CheckTree() method for debugging purposes. It checks the validity of the tree. * Added a templatized class AVLTree which doesn't offer a map-like interface like AVLTreeMap, but rather one similar to BOpenHashMap and SplayTree. It is more convenient to use, if one wants to store objects that already contain the key. git-svn-id: file:///srv/svn/repos/haiku/haiku/trunk@34526 a95241bf-73f2-0310-859d-f6bbb57e9c96 |
||
---|---|---|
.. | ||
atomic.h | ||
AutoLock.h | ||
AVLTree.h | ||
AVLTreeBase.h | ||
AVLTreeMap.h | ||
Constructor.h | ||
DoublyLinkedList.h | ||
DoublyLinkedQueue.h | ||
kernel_c.h | ||
kernel_cpp.h | ||
KernelUtilsOrder.h | ||
khash.h | ||
KMessage.h | ||
kqueue.h | ||
list.h | ||
MallocFreeAllocator.h | ||
MultiHashTable.h | ||
OpenHashTable.h | ||
queue.h | ||
RadixBitmap.h | ||
ring_buffer.h | ||
SinglyLinkedList.h | ||
SplayTree.h | ||
Stack.h | ||
syscall_args.h | ||
Vector.h | ||
VectorMap.h | ||
VectorSet.h |