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
|
/* $Id: kAvlRemoveBestFit.h 29 2009-07-01 20:30:29Z bird $ */
/** @file
* kAvlTmpl - Templated AVL Trees, Remove Best Fitting Node.
*/
/*
* Copyright (c) 1999-2009 Knut St. Osmundsen <bird-kStuff-spamix@anduin.net>
*
* Permission is hereby granted, free of charge, to any person
* obtaining a copy of this software and associated documentation
* files (the "Software"), to deal in the Software without
* restriction, including without limitation the rights to use,
* copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the
* Software is furnished to do so, subject to the following
* conditions:
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
* OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
* HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
* WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
* OTHER DEALINGS IN THE SOFTWARE.
*/
/**
* Finds the best fitting node in the tree for the given Key value and removes the node.
*
* @returns Pointer to the removed node.
* @param pRoot Pointer to the AVL-tree root structure.
* @param Key The Key of which is to be found a best fitting match for..
* @param fAbove K_TRUE: Returned node is have the closest key to Key from above.
* K_FALSE: Returned node is have the closest key to Key from below.
*
* @remark This implementation uses GetBestFit and then Remove and might therefore
* not be the most optimal kind of implementation, but it reduces the complexity
* code size, and the likelyhood for bugs.
*/
KAVL_DECL(KAVLNODE *) KAVL_FN(RemoveBestFit)(KAVLROOT *pRoot, KAVLKEY Key, KBOOL fAbove)
{
/*
* If we find anything we'll have to remove the node and return it.
* Now, if duplicate keys are allowed we'll remove a duplicate before
* removing the in-tree node as this is way cheaper.
*/
KAVLNODE *pNode = KAVL_FN(GetBestFit)(pRoot, Key, fAbove);
if (pNode != NULL)
{
#ifdef KAVL_EQUAL_ALLOWED
KAVL_WRITE_LOCK(pRoot); /** @todo the locking isn't quite sane here. :-/ */
if (pNode->mpList != KAVL_NULL)
{
KAVLNODE *pRet = KAVL_GET_POINTER(&pNode->mpList);
KAVL_SET_POINTER_NULL(&pNode->mpList, &pRet->mpList);
KAVL_LOOKTHRU_INVALIDATE_NODE(pRoot, pNode, pNode->mKey);
KAVL_WRITE_UNLOCK(pRoot);
return pRet;
}
KAVL_WRITE_UNLOCK(pRoot);
#endif
pNode = KAVL_FN(Remove)(pRoot, pNode->mKey);
}
return pNode;
}
|
