#
621f5370 |
|
24-May-2020 |
Michael Lotz <mmlr@mlotz.ch> |
AVLTree: Add convenience LeftMost/RightMost with no arguments. They return the left and right most nodes of the entire tree, i.e. starting from the root node. Change-Id: I651a9db6d12308aef4c2ed71484958428e58c9bc Reviewed-on: https://review.haiku-os.org/c/haiku/+/2838 Reviewed-by: waddlesplash <waddlesplash@gmail.com>
|
#
c5e9dd9b |
|
10-Jan-2020 |
Adrien Destugues <pulkomandy@pulkomandy.tk> |
Fix btrfs_shell build The hacks to still use actual system headers for zlib didn't quite work. - Define Z_SOLO, which makes zlib build without any system include - Remove use of std::max and #include <algorithm> from AVLTree - Do not include DebugSupport.h because it uses system headers - Do not include uuid.h and define just what we need Now it's possible to compile the btrfs_shell on Linux. Change-Id: I74a14b5f6804db45ab5a9f582ab493d696376fd3 Reviewed-on: https://review.haiku-os.org/c/haiku/+/2098 Reviewed-by: Adrien Destugues <pulkomandy@gmail.com>
|
#
9f9ba0bd |
|
30-Jun-2017 |
hyche <cvghy116@gmail.com> |
btrfs_shell: Support AVLTree
|
#
a54549a8 |
|
06-Dec-2009 |
Ingo Weinhold <ingo_weinhold@gmx.de> |
* AVLTree: - 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
|
#
a54549a8cdd4a567bf24bd8b4217f9040baf3112 |
|
06-Dec-2009 |
Ingo Weinhold <ingo_weinhold@gmx.de> |
* AVLTree: - 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
|