| 1 |
/* |
| 2 |
* Copyright (C) 2013-2015, 2019 by the Konclude Developer Team. |
| 3 |
* |
| 4 |
* This file is part of the reasoning system Konclude. |
| 5 |
* For details and support, see <http://konclude.com/>. |
| 6 |
* |
| 7 |
* Konclude is free software: you can redistribute it and/or modify |
| 8 |
* it under the terms of version 3 of the GNU Lesser General Public |
| 9 |
* License (LGPLv3) as published by the Free Software Foundation. |
| 10 |
* |
| 11 |
* Konclude is distributed in the hope that it will be useful, |
| 12 |
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 13 |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 14 |
* GNU (Lesser) General Public License for more details. |
| 15 |
* |
| 16 |
* You should have received a copy of the GNU (Lesser) General Public |
| 17 |
* License along with Konclude. If not, see <http://www.gnu.org/licenses/>. |
| 18 |
* |
| 19 |
*/ |
| 20 |
|
| 21 |
#ifndef KONCLUDE_UTILITIES_CDBLLINKER_H |
| 22 |
#define KONCLUDE_UTILITIES_CDBLLINKER_H |
| 23 |
|
| 24 |
// Libraries includes |
| 25 |
|
| 26 |
|
| 27 |
// Namespace includes |
| 28 |
#include <QLinkedListIterator> |
| 29 |
|
| 30 |
// Other includes |
| 31 |
|
| 32 |
|
| 33 |
// Logger includes |
| 34 |
#include "Logger/CLogger.h" |
| 35 |
|
| 36 |
|
| 37 |
|
| 38 |
namespace Konclude { |
| 39 |
|
| 40 |
namespace Utilities { |
| 41 |
|
| 42 |
|
| 43 |
|
| 44 |
|
| 45 |
/*! |
| 46 |
* |
| 47 |
* \class CDblLinker |
| 48 |
* \author Andreas Steigmiller |
| 49 |
* \version 0.1 |
| 50 |
* \brief TODO |
| 51 |
* |
| 52 |
*/ |
| 53 |
template<class T> |
| 54 |
class CDblLinker { |
| 55 |
// public methods |
| 56 |
public: |
| 57 |
//! Constructor |
| 58 |
CDblLinker(); |
| 59 |
CDblLinker(T dataElement, CDblLinker<T> *nextLink = 0); |
| 60 |
|
| 61 |
//! Destructor |
| 62 |
virtual ~CDblLinker(); |
| 63 |
|
| 64 |
|
| 65 |
CDblLinker<T> *init(T dataElement, CDblLinker<T> *nextLink = 0); |
| 66 |
|
| 67 |
bool hasNext(); |
| 68 |
bool hasPrev(); |
| 69 |
|
| 70 |
|
| 71 |
CDblLinker<T> *insertNext(CDblLinker<T> *nextLink); |
| 72 |
CDblLinker<T> *getNext(); |
| 73 |
|
| 74 |
CDblLinker<T> *insertPrev(CDblLinker<T> *prevLink); |
| 75 |
CDblLinker<T> *getPrev(); |
| 76 |
|
| 77 |
CDblLinker<T> *setNext(CDblLinker<T> *prevLink); |
| 78 |
CDblLinker<T> *setPrev(CDblLinker<T> *prevLink); |
| 79 |
|
| 80 |
T getData(); |
| 81 |
CDblLinker<T> *setData(T dataElement); |
| 82 |
|
| 83 |
|
| 84 |
CDblLinker<T> *prepend(CDblLinker<T> *prependingList); |
| 85 |
CDblLinker<T> *append(CDblLinker<T> *appendingList); |
| 86 |
|
| 87 |
CDblLinker<T> *removeNext(); |
| 88 |
CDblLinker<T> *removePrev(); |
| 89 |
|
| 90 |
CDblLinker<T> *getLastListLink(); |
| 91 |
CDblLinker<T> *getFirstListLink(); |
| 92 |
|
| 93 |
|
| 94 |
// protected methods |
| 95 |
protected: |
| 96 |
|
| 97 |
// private methods |
| 98 |
private: |
| 99 |
|
| 100 |
// private variables |
| 101 |
private: |
| 102 |
CDblLinker<T> *next; |
| 103 |
CDblLinker<T> *prev; |
| 104 |
T data; |
| 105 |
|
| 106 |
}; |
| 107 |
|
| 108 |
|
| 109 |
template<class T> |
| 110 |
CDblLinker<T>::CDblLinker() { |
| 111 |
next = 0; |
| 112 |
prev = 0; |
| 113 |
} |
| 114 |
|
| 115 |
template<class T> |
| 116 |
CDblLinker<T>::CDblLinker(T dataElement, CDblLinker<T> *nextLink) { |
| 117 |
next = 0; |
| 118 |
prev = 0; |
| 119 |
setNext(nextLink); |
| 120 |
data = dataElement; |
| 121 |
} |
| 122 |
|
| 123 |
template<class T> |
| 124 |
CDblLinker<T> *CDblLinker<T>::init(T dataElement, CDblLinker<T> *nextLink) { |
| 125 |
next = 0; |
| 126 |
prev = 0; |
| 127 |
setNext(nextLink); |
| 128 |
data = dataElement; |
| 129 |
return this; |
| 130 |
} |
| 131 |
|
| 132 |
|
| 133 |
template<class T> |
| 134 |
CDblLinker<T>::~CDblLinker() { |
| 135 |
} |
| 136 |
|
| 137 |
|
| 138 |
template<class T> |
| 139 |
bool CDblLinker<T>::hasNext() { |
| 140 |
return next != 0; |
| 141 |
} |
| 142 |
|
| 143 |
template<class T> |
| 144 |
bool CDblLinker<T>::hasPrev() { |
| 145 |
return prev != 0; |
| 146 |
} |
| 147 |
|
| 148 |
|
| 149 |
template<class T> |
| 150 |
CDblLinker<T> *CDblLinker<T>::insertNext(CDblLinker<T> *nextLink) { |
| 151 |
if (nextLink) { |
| 152 |
CDblLinker<T> *tmpNext = next; |
| 153 |
next = nextLink; |
| 154 |
nextLink->prev = this; |
| 155 |
if (tmpNext) { |
| 156 |
nextLink->append(tmpNext); |
| 157 |
} |
| 158 |
} |
| 159 |
return this; |
| 160 |
} |
| 161 |
|
| 162 |
template<class T> |
| 163 |
CDblLinker<T> *CDblLinker<T>::insertPrev(CDblLinker<T> *prevLink) { |
| 164 |
if (prevLink) { |
| 165 |
CDblLinker<T> *pLlast = prevLink->getLastListLink(); |
| 166 |
CDblLinker<T> *tmpPrev = prev; |
| 167 |
prev = pLlast; |
| 168 |
pLlast->next = this; |
| 169 |
if (tmpPrev) { |
| 170 |
tmpPrev->next = 0; |
| 171 |
prevLink->prepend(tmpPrev); |
| 172 |
} |
| 173 |
return prevLink; |
| 174 |
} else { |
| 175 |
return this; |
| 176 |
} |
| 177 |
} |
| 178 |
|
| 179 |
|
| 180 |
template<class T> |
| 181 |
CDblLinker<T> *CDblLinker<T>::setNext(CDblLinker<T> *nextLink) { |
| 182 |
next = nextLink; |
| 183 |
if (nextLink) { |
| 184 |
nextLink->prev = this; |
| 185 |
} |
| 186 |
return this; |
| 187 |
} |
| 188 |
|
| 189 |
|
| 190 |
template<class T> |
| 191 |
CDblLinker<T> *CDblLinker<T>::setPrev(CDblLinker<T> *prevLink) { |
| 192 |
if (prevLink) { |
| 193 |
CDblLinker<T> *pLlast = prevLink->getLastListLink(); |
| 194 |
pLlast->next = this; |
| 195 |
prev = pLlast; |
| 196 |
return prevLink; |
| 197 |
} else { |
| 198 |
prev = 0; |
| 199 |
return this; |
| 200 |
} |
| 201 |
} |
| 202 |
|
| 203 |
template<class T> |
| 204 |
CDblLinker<T> *CDblLinker<T>::getNext() { |
| 205 |
return next; |
| 206 |
} |
| 207 |
|
| 208 |
template<class T> |
| 209 |
CDblLinker<T> *CDblLinker<T>::getPrev() { |
| 210 |
return prev; |
| 211 |
} |
| 212 |
|
| 213 |
|
| 214 |
template<class T> |
| 215 |
T CDblLinker<T>::getData() { |
| 216 |
return data; |
| 217 |
} |
| 218 |
|
| 219 |
|
| 220 |
|
| 221 |
template<class T> |
| 222 |
CDblLinker<T> *CDblLinker<T>::setData(T dataElement) { |
| 223 |
data = dataElement; |
| 224 |
return this; |
| 225 |
} |
| 226 |
|
| 227 |
|
| 228 |
template<class T> |
| 229 |
CDblLinker<T> *CDblLinker<T>::prepend(CDblLinker<T> *prependingList) { |
| 230 |
CDblLinker<T> *last = prependingList->getLastListLink(); |
| 231 |
last->insertNext(this); |
| 232 |
return prependingList; |
| 233 |
} |
| 234 |
|
| 235 |
template<class T> |
| 236 |
CDblLinker<T> *CDblLinker<T>::append(CDblLinker<T> *appendingList) { |
| 237 |
CDblLinker<T> *last = getLastListLink(); |
| 238 |
last->insertNext(appendingList); |
| 239 |
return this; |
| 240 |
} |
| 241 |
|
| 242 |
template<class T> |
| 243 |
CDblLinker<T> *CDblLinker<T>::removeNext() { |
| 244 |
CDblLinker<T> *next = getNext(); |
| 245 |
if (next) { |
| 246 |
next->next = 0; |
| 247 |
next->prev = 0; |
| 248 |
setNext(next->getNext()); |
| 249 |
} |
| 250 |
return next; |
| 251 |
} |
| 252 |
|
| 253 |
template<class T> |
| 254 |
CDblLinker<T> *CDblLinker<T>::removePrev() { |
| 255 |
CDblLinker<T> *prev = getPrev(); |
| 256 |
if (prev) { |
| 257 |
prev->next = 0; |
| 258 |
prev->prev = 0; |
| 259 |
setPrev(prev->getPrev()); |
| 260 |
} |
| 261 |
return prev; |
| 262 |
} |
| 263 |
|
| 264 |
|
| 265 |
template<class T> |
| 266 |
CDblLinker<T> *CDblLinker<T>::getLastListLink() { |
| 267 |
CDblLinker<T> *lastListLink = this; |
| 268 |
while (lastListLink->hasNext()) { |
| 269 |
lastListLink = lastListLink->getNext(); |
| 270 |
} |
| 271 |
return lastListLink; |
| 272 |
} |
| 273 |
|
| 274 |
template<class T> |
| 275 |
CDblLinker<T> *CDblLinker<T>::getFirstListLink() { |
| 276 |
CDblLinker<T> *firstListLink = this; |
| 277 |
while (firstListLink->hasPrev()) { |
| 278 |
firstListLink = firstListLink->getPrev(); |
| 279 |
} |
| 280 |
return firstListLink; |
| 281 |
} |
| 282 |
|
| 283 |
|
| 284 |
|
| 285 |
}; // end namespace Utilities |
| 286 |
|
| 287 |
}; // end namespace Konclude |
| 288 |
|
| 289 |
#endif // KONCLUDE_UTILITIES_CDBLLINKER_H |