| #
a2efc7ec |
|
24-Jul-2023 |
Augustin Cavalier <waddlesplash@gmail.com> |
AVLTree: Unify removal implementations.
Extracted from hamishm's eventqueue patches.
|
| #
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>
|
| #
e7156146 |
|
05-Aug-2017 |
hyche <cvghy116@gmail.com> |
AVLTree: forward LeftMost and RightMost method from AVLTreeBase
Signed-off-by: Augustin Cavalier <waddlesplash@gmail.com>
|
| #
e7346707 |
|
06-Jul-2011 |
Ingo Weinhold <ingo_weinhold@gmx.de> |
AVLTree: Add Previous()/Next()
|
| #
20b22dfc |
|
06-Jul-2011 |
Ingo Weinhold <ingo_weinhold@gmx.de> |
AVLTree: Add Previous()/Next()
|
| #
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
|
| #
e7346707c984475369be2b28706ca251d95ed2c0 |
|
06-Jul-2011 |
Ingo Weinhold <ingo_weinhold@gmx.de> |
AVLTree: Add Previous()/Next()
|
| #
20b22dfc3d24ba812ceeaff56c701bdc26d49ba3 |
|
06-Jul-2011 |
Ingo Weinhold <ingo_weinhold@gmx.de> |
AVLTree: Add Previous()/Next()
|
| #
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
|