blob: d3f938ad3c7e865776c2e02756eb96cc49e969b1 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
|
/* $Id: avl_Get.cpp.h $ */
/** @file
* kAVLGet - get routine for AVL trees.
*/
/*
* Copyright (C) 2006-2023 Oracle and/or its affiliates.
*
* This file is part of VirtualBox base platform packages, as
* available from https://www.virtualbox.org.
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation, in version 3 of the
* License.
*
* This program is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, see <https://www.gnu.org/licenses>.
*
* The contents of this file may alternatively be used under the terms
* of the Common Development and Distribution License Version 1.0
* (CDDL), a copy of it is provided in the "COPYING.CDDL" file included
* in the VirtualBox distribution, in which case the provisions of the
* CDDL are applicable instead of those of the GPL.
*
* You may elect to license modified versions of this file under the
* terms and conditions of either the GPL or the CDDL or both.
*
* SPDX-License-Identifier: GPL-3.0-only OR CDDL-1.0
*/
#ifndef _kAVLGet_h_
#define _kAVLGet_h_
/**
* Gets a node from the tree (does not remove it!)
* @returns Pointer to the node holding the given key.
* @param ppTree Pointer to the AVL-tree root node pointer.
* @param Key Key value of the node which is to be found.
* @author knut st. osmundsen
*/
KAVL_DECL(PKAVLNODECORE) KAVL_FN(Get)(PPKAVLNODECORE ppTree, KAVLKEY Key)
{
PKAVLNODECORE pNode = KAVL_GET_POINTER_NULL(ppTree);
if (pNode)
{
while (KAVL_NE(pNode->Key, Key))
{
if (KAVL_G(pNode->Key, Key))
{
if (pNode->pLeft != KAVL_NULL)
pNode = KAVL_GET_POINTER(&pNode->pLeft);
else
return NULL;
}
else
{
if (pNode->pRight != KAVL_NULL)
pNode = KAVL_GET_POINTER(&pNode->pRight);
else
return NULL;
}
}
}
return pNode;
}
#endif
|
