| 1 | /* $Id: avl_DoWithAll.cpp.h 8155 2008-04-18 15:16:47Z vboxsync $ */
|
|---|
| 2 | /** @file
|
|---|
| 3 | * kAVLDoWithAll - Do with all nodes routine for AVL trees.
|
|---|
| 4 | */
|
|---|
| 5 |
|
|---|
| 6 | /*
|
|---|
| 7 | * Copyright (C) 1999-2007 knut st. osmundsen (bird-src-spam@anduin.net)
|
|---|
| 8 | *
|
|---|
| 9 | * This file is part of VirtualBox Open Source Edition (OSE), as
|
|---|
| 10 | * available from http://www.virtualbox.org. This file is free software;
|
|---|
| 11 | * you can redistribute it and/or modify it under the terms of the GNU
|
|---|
| 12 | * General Public License (GPL) as published by the Free Software
|
|---|
| 13 | * Foundation, in version 2 as it comes in the "COPYING" file of the
|
|---|
| 14 | * VirtualBox OSE distribution. VirtualBox OSE is distributed in the
|
|---|
| 15 | * hope that it will be useful, but WITHOUT ANY WARRANTY of any kind.
|
|---|
| 16 | *
|
|---|
| 17 | * The contents of this file may alternatively be used under the terms
|
|---|
| 18 | * of the Common Development and Distribution License Version 1.0
|
|---|
| 19 | * (CDDL) only, as it comes in the "COPYING.CDDL" file of the
|
|---|
| 20 | * VirtualBox OSE distribution, in which case the provisions of the
|
|---|
| 21 | * CDDL are applicable instead of those of the GPL.
|
|---|
| 22 | *
|
|---|
| 23 | * You may elect to license modified versions of this file under the
|
|---|
| 24 | * terms and conditions of either the GPL or the CDDL or both.
|
|---|
| 25 | *
|
|---|
| 26 | * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa
|
|---|
| 27 | * Clara, CA 95054 USA or visit http://www.sun.com if you need
|
|---|
| 28 | * additional information or have any questions.
|
|---|
| 29 | */
|
|---|
| 30 |
|
|---|
| 31 | #ifndef _kAVLDoWithAll_h_
|
|---|
| 32 | #define _kAVLDoWithAll_h_
|
|---|
| 33 |
|
|---|
| 34 |
|
|---|
| 35 | /**
|
|---|
| 36 | * Iterates thru all nodes in the given tree.
|
|---|
| 37 | * @returns 0 on success. Return from callback on failure.
|
|---|
| 38 | * @param ppTree Pointer to the AVL-tree root node pointer.
|
|---|
| 39 | * @param fFromLeft TRUE: Left to right.
|
|---|
| 40 | * FALSE: Right to left.
|
|---|
| 41 | * @param pfnCallBack Pointer to callback function.
|
|---|
| 42 | * @param pvParam Userparameter passed on to the callback function.
|
|---|
| 43 | */
|
|---|
| 44 | RTDECL(int) KAVL_FN(DoWithAll)(PPKAVLNODECORE ppTree, int fFromLeft, PKAVLCALLBACK pfnCallBack, void * pvParam)
|
|---|
| 45 | {
|
|---|
| 46 | KAVLSTACK2 AVLStack;
|
|---|
| 47 | PKAVLNODECORE pNode;
|
|---|
| 48 | #ifdef KAVL_EQUAL_ALLOWED
|
|---|
| 49 | PKAVLNODECORE pEqual;
|
|---|
| 50 | #endif
|
|---|
| 51 | int rc;
|
|---|
| 52 |
|
|---|
| 53 | if (*ppTree == KAVL_NULL)
|
|---|
| 54 | return 0;
|
|---|
| 55 |
|
|---|
| 56 | AVLStack.cEntries = 1;
|
|---|
| 57 | AVLStack.achFlags[0] = 0;
|
|---|
| 58 | AVLStack.aEntries[0] = KAVL_GET_POINTER(ppTree);
|
|---|
| 59 |
|
|---|
| 60 | if (fFromLeft)
|
|---|
| 61 | { /* from left */
|
|---|
| 62 | while (AVLStack.cEntries > 0)
|
|---|
| 63 | {
|
|---|
| 64 | pNode = AVLStack.aEntries[AVLStack.cEntries - 1];
|
|---|
| 65 |
|
|---|
| 66 | /* left */
|
|---|
| 67 | if (!AVLStack.achFlags[AVLStack.cEntries - 1]++)
|
|---|
| 68 | {
|
|---|
| 69 | if (pNode->pLeft != KAVL_NULL)
|
|---|
| 70 | {
|
|---|
| 71 | AVLStack.achFlags[AVLStack.cEntries] = 0; /* 0 first, 1 last */
|
|---|
| 72 | AVLStack.aEntries[AVLStack.cEntries++] = KAVL_GET_POINTER(&pNode->pLeft);
|
|---|
| 73 | continue;
|
|---|
| 74 | }
|
|---|
| 75 | }
|
|---|
| 76 |
|
|---|
| 77 | /* center */
|
|---|
| 78 | rc = pfnCallBack(pNode, pvParam);
|
|---|
| 79 | if (rc)
|
|---|
| 80 | return rc;
|
|---|
| 81 | #ifdef KAVL_EQUAL_ALLOWED
|
|---|
| 82 | if (pNode->pList != KAVL_NULL)
|
|---|
| 83 | for (pEqual = KAVL_GET_POINTER(&pNode->pList); pEqual; pEqual = KAVL_GET_POINTER_NULL(&pEqual->pList))
|
|---|
| 84 | {
|
|---|
| 85 | rc = pfnCallBack(pEqual, pvParam);
|
|---|
| 86 | if (rc)
|
|---|
| 87 | return rc;
|
|---|
| 88 | }
|
|---|
| 89 | #endif
|
|---|
| 90 |
|
|---|
| 91 | /* right */
|
|---|
| 92 | AVLStack.cEntries--;
|
|---|
| 93 | if (pNode->pRight != KAVL_NULL)
|
|---|
| 94 | {
|
|---|
| 95 | AVLStack.achFlags[AVLStack.cEntries] = 0;
|
|---|
| 96 | AVLStack.aEntries[AVLStack.cEntries++] = KAVL_GET_POINTER(&pNode->pRight);
|
|---|
| 97 | }
|
|---|
| 98 | } /* while */
|
|---|
| 99 | }
|
|---|
| 100 | else
|
|---|
| 101 | { /* from right */
|
|---|
| 102 | while (AVLStack.cEntries > 0)
|
|---|
| 103 | {
|
|---|
| 104 | pNode = AVLStack.aEntries[AVLStack.cEntries - 1];
|
|---|
| 105 |
|
|---|
| 106 | /* right */
|
|---|
| 107 | if (!AVLStack.achFlags[AVLStack.cEntries - 1]++)
|
|---|
| 108 | {
|
|---|
| 109 | if (pNode->pRight != KAVL_NULL)
|
|---|
| 110 | {
|
|---|
| 111 | AVLStack.achFlags[AVLStack.cEntries] = 0; /* 0 first, 1 last */
|
|---|
| 112 | AVLStack.aEntries[AVLStack.cEntries++] = KAVL_GET_POINTER(&pNode->pRight);
|
|---|
| 113 | continue;
|
|---|
| 114 | }
|
|---|
| 115 | }
|
|---|
| 116 |
|
|---|
| 117 | /* center */
|
|---|
| 118 | rc = pfnCallBack(pNode, pvParam);
|
|---|
| 119 | if (rc)
|
|---|
| 120 | return rc;
|
|---|
| 121 | #ifdef KAVL_EQUAL_ALLOWED
|
|---|
| 122 | if (pNode->pList != KAVL_NULL)
|
|---|
| 123 | for (pEqual = KAVL_GET_POINTER(&pNode->pList); pEqual; pEqual = KAVL_GET_POINTER_NULL(&pEqual->pList))
|
|---|
| 124 | {
|
|---|
| 125 | rc = pfnCallBack(pEqual, pvParam);
|
|---|
| 126 | if (rc)
|
|---|
| 127 | return rc;
|
|---|
| 128 | }
|
|---|
| 129 | #endif
|
|---|
| 130 |
|
|---|
| 131 | /* left */
|
|---|
| 132 | AVLStack.cEntries--;
|
|---|
| 133 | if (pNode->pLeft != KAVL_NULL)
|
|---|
| 134 | {
|
|---|
| 135 | AVLStack.achFlags[AVLStack.cEntries] = 0;
|
|---|
| 136 | AVLStack.aEntries[AVLStack.cEntries++] = KAVL_GET_POINTER(&pNode->pLeft);
|
|---|
| 137 | }
|
|---|
| 138 | } /* while */
|
|---|
| 139 | }
|
|---|
| 140 |
|
|---|
| 141 | return 0;
|
|---|
| 142 | }
|
|---|
| 143 |
|
|---|
| 144 |
|
|---|
| 145 | #endif
|
|---|
| 146 |
|
|---|
