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 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166
|
/*---------------------------------------------------------------------------*\
Copyright (C) 2000 AVM GmbH. All rights reserved.
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; either version 2
of the License, or (at your option) any later version.
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, and WITHOUT
ANY LIABILITY FOR ANY DAMAGES arising out of or in connection
with the use or performance of this software. See the
GNU General Public License for further details.
\*---------------------------------------------------------------------------*/
#include "SortList.h"
#include "dbgSTD.h"
/*---------------------------------------------------------------------------*\
\*---------------------------------------------------------------------------*/
static tResult Find2HigherCmpFunc (CSortPListElement *pElement, void *RefData) {
dhead ("Find2HigherCmpFunc", DCON_CPointerList);
dassert (pElement != 0);
switch (pElement->Compare (RefData)) {
case vHigher:
return vNo;
case vEqual:
return vYes;
default:
dassert (0);
// no break!
case vLower:
break;
}
return vCancel;
}
static tResult Find2LowerCmpFunc (CSortPListElement *pElement, void *RefData) {
dhead ("Find2LowerCmpFunc", DCON_CPointerList);
dassert (pElement != 0);
switch (pElement->Compare (RefData)) {
case vLower:
return vNo;
case vEqual:
return vYes;
default:
dassert (0);
// no break!
case vHigher:
break;
}
return vCancel;
}
/*===========================================================================*\
\*===========================================================================*/
CSortPListElement *CSortPListElement::Add (CSortPListElement *pElement) {
dhead ("CSortPListElement::Add", DCON_CPointerList);
dassert (pElement != 0);
void (CPointerListElement:: *addOne) (CPointerListElement *) = 0;
CSortPListElement *(CSortPListElement:: *nextOne) (void) = 0;
tCompare comp;
tCompare direction = vEqual;
CSortPListElement *pLauf;
CSortPListElement *pLast = this;
void *CompData = pElement->GetRefCompData();
switch (Compare (CompData)) {
case vLower:
direction = vLower;
nextOne = &CSortPListElement::GetLower;
addOne = &CSortPListElement::AddBefore;
break;
case vHigher:
direction = vHigher;
nextOne = &CSortPListElement::GetHigher;
addOne = &CSortPListElement::AddAfter;
break;
case vEqual:
// it isn't allowed to add two identical Elements to the List
// add the new one and return the identical item, so the user can handle this
Exchange (pElement);
return this;
}
dassert (nextOne != 0);
dassert (addOne != 0);
dassert (direction != vEqual);
pLauf = (this->*nextOne)();
// find the place where to add the new element
while (pLauf != 0) {
comp = pLauf->Compare (CompData);
if (comp != direction) {
if (comp == vEqual) {
// it isn't allowed to add two identical Elements to the List
// add the new one and return the identical item, so the user can handle this
pLauf->Exchange (pElement);
return pLauf;
}
break;
}
pLast = pLauf;
pLauf = (pLauf->*nextOne)();
}
(pLast->*addOne) (pElement);
return 0;
}
/*===========================================================================*\
\*===========================================================================*/
CSortPListElement *CSortPListElement::Find (void *FindData) {
dhead ("CSortPListElement::Find", DCON_CPointerList);
CPointerListElement *pFound = this;
switch (Compare (FindData)) {
case vLower:
if (FindRev ((ctFindFunc)Find2LowerCmpFunc, FindData, &pFound) != vYes) {
pFound = 0;
} else {
dassert (pFound != 0);
}
break;
case vHigher:
if (FindFwd ((ctFindFunc)Find2HigherCmpFunc, FindData, &pFound) != vYes) {
pFound = 0;
} else {
dassert (pFound != 0);
}
break;
case vEqual:
// nothing to do
break;
}
RETURN ('x', (CSortPListElement *)pFound);
}
/*===========================================================================*\
\*===========================================================================*/
CSortPListElement *CSortPointerList::FindHigher (void *CompData) {
dhead ("CSortPointerList::FindHigher", DCON_CPointerList);
CPointerListElement *pFound;
if (FindFwd ((ctFindFunc)Find2HigherCmpFunc, CompData, &pFound) != vYes) {
pFound = 0;
}
return (CSortPListElement *)pFound;
}
/*===========================================================================*\
\*===========================================================================*/
CSortPListElement *CSortPointerList::FindLower (void *CompData) {
dhead ("CSortPointerList::FindLower", DCON_CPointerList);
CPointerListElement *pFound;
if (FindRev ((ctFindFunc)Find2LowerCmpFunc, CompData, &pFound) != vYes) {
pFound = 0;
}
return (CSortPListElement *)pFound;
}
/*===========================================================================*\
\*===========================================================================*/
|