Debian Codegraph @

Source/Utilities/CDblNegLinker.hpp

raw
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_CDBLNEGLINKER_H
22 #define KONCLUDE_UTILITIES_CDBLNEGLINKER_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 CDblNegLinker
48 * \author Andreas Steigmiller
49 * \version 0.1
50 * \brief TODO
51 *
52 */
53 template<class T>
54 class CDblNegLinker {
55 // public methods
56 public:
57 //! Constructor
58 CDblNegLinker();
59 CDblNegLinker(T dataElement, bool isNegated = false, CDblNegLinker<T> *nextLink = 0);
60
61 //! Destructor
62 virtual ~CDblNegLinker();
63
64
65 CDblNegLinker<T> *init(T dataElement, bool isNegated = false, CDblNegLinker<T> *nextLink = 0);
66
67 bool hasNext();
68 bool hasPrev();
69
70
71 CDblNegLinker<T> *insertNext(CDblNegLinker<T> *nextLink);
72 CDblNegLinker<T> *getNext();
73
74 CDblNegLinker<T> *insertPrev(CDblNegLinker<T> *prevLink);
75 CDblNegLinker<T> *getPrev();
76
77 CDblNegLinker<T> *setNext(CDblNegLinker<T> *prevLink);
78 CDblNegLinker<T> *setPrev(CDblNegLinker<T> *prevLink);
79
80 T getData();
81 CDblNegLinker<T> *setData(T dataElement);
82
83 bool isNegated();
84 CDblNegLinker<T> *setNegated(bool isNegated);
85
86
87 CDblNegLinker<T> *prepend(CDblNegLinker<T> *prependingList);
88 CDblNegLinker<T> *append(CDblNegLinker<T> *appendingList);
89
90 CDblNegLinker<T> *removeNext();
91 CDblNegLinker<T> *removePrev();
92
93 CDblNegLinker<T> *getLastListLink();
94 CDblNegLinker<T> *getFirstListLink();
95
96
97 // protected methods
98 protected:
99
100 // private methods
101 private:
102
103 // private variables
104 private:
105 CDblNegLinker<T> *next;
106 CDblNegLinker<T> *prev;
107 T data;
108 bool negated;
109
110 };
111
112
113 template<class T>
114 CDblNegLinker<T>::CDblNegLinker() {
115 next = 0;
116 prev = 0;
117 negated = false;
118 }
119
120 template<class T>
121 CDblNegLinker<T>::CDblNegLinker(T dataElement, bool isNegated, CDblNegLinker<T> *nextLink) {
122 next = 0;
123 prev = 0;
124 setNext(nextLink);
125 data = dataElement;
126 negated = isNegated;
127 }
128
129 template<class T>
130 CDblNegLinker<T> *CDblNegLinker<T>::init(T dataElement, bool isNegated, CDblNegLinker<T> *nextLink) {
131 next = 0;
132 prev = 0;
133 setNext(nextLink);
134 data = dataElement;
135 negated = isNegated;
136 return this;
137 }
138
139
140 template<class T>
141 CDblNegLinker<T>::~CDblNegLinker() {
142 }
143
144
145 template<class T>
146 bool CDblNegLinker<T>::hasNext() {
147 return next != 0;
148 }
149
150 template<class T>
151 bool CDblNegLinker<T>::hasPrev() {
152 return prev != 0;
153 }
154
155
156 template<class T>
157 CDblNegLinker<T> *CDblNegLinker<T>::insertNext(CDblNegLinker<T> *nextLink) {
158 if (nextLink) {
159 CDblNegLinker<T> *tmpNext = next;
160 next = nextLink;
161 nextLink->prev = this;
162 if (tmpNext) {
163 nextLink->append(tmpNext);
164 }
165 }
166 return this;
167 }
168
169 template<class T>
170 CDblNegLinker<T> *CDblNegLinker<T>::insertPrev(CDblNegLinker<T> *prevLink) {
171 if (prevLink) {
172 CDblNegLinker<T> *pLlast = prevLink->getLastListLink();
173 CDblNegLinker<T> *tmpPrev = prev;
174 prev = pLlast;
175 pLlast->next = this;
176 if (tmpPrev) {
177 tmpPrev->next = 0;
178 prevLink->prepend(tmpPrev);
179 }
180 return prevLink;
181 } else {
182 return this;
183 }
184 }
185
186
187 template<class T>
188 CDblNegLinker<T> *CDblNegLinker<T>::setNext(CDblNegLinker<T> *nextLink) {
189 next = nextLink;
190 if (nextLink) {
191 nextLink->prev = this;
192 }
193 return this;
194 }
195
196
197 template<class T>
198 CDblNegLinker<T> *CDblNegLinker<T>::setPrev(CDblNegLinker<T> *prevLink) {
199 if (prevLink) {
200 CDblNegLinker<T> *pLlast = prevLink->getLastListLink();
201 pLlast->next = this;
202 prev = pLlast;
203 return prevLink;
204 } else {
205 prev = 0;
206 return this;
207 }
208 }
209
210 template<class T>
211 CDblNegLinker<T> *CDblNegLinker<T>::getNext() {
212 return next;
213 }
214
215 template<class T>
216 CDblNegLinker<T> *CDblNegLinker<T>::getPrev() {
217 return prev;
218 }
219
220
221 template<class T>
222 T CDblNegLinker<T>::getData() {
223 return data;
224 }
225
226
227
228 template<class T>
229 CDblNegLinker<T> *CDblNegLinker<T>::setData(T dataElement) {
230 data = dataElment;
231 return this;
232 }
233
234 template<class T>
235 bool CDblNegLinker<T>::isNegated() {
236 return negated;
237 }
238
239 template<class T>
240 CDblNegLinker<T> *CDblNegLinker<T>::setNegated(bool isNegated) {
241 negated = isNegated;
242 return this;
243 }
244
245
246 template<class T>
247 CDblNegLinker<T> *CDblNegLinker<T>::prepend(CDblNegLinker<T> *prependingList) {
248 CDblNegLinker<T> *last = prependingList->getLastListLink();
249 last->insertNext(this);
250 return prependingList;
251 }
252
253 template<class T>
254 CDblNegLinker<T> *CDblNegLinker<T>::append(CDblNegLinker<T> *appendingList) {
255 CDblNegLinker<T> *last = getLastListLink();
256 last->insertNext(appendingList);
257 return this;
258 }
259
260 template<class T>
261 CDblNegLinker<T> *CDblNegLinker<T>::removeNext() {
262 CDblNegLinker<T> *next = getNext();
263 if (next) {
264 next->next = 0;
265 next->prev = 0;
266 setNext(next->getNext());
267 }
268 return next;
269 }
270
271 template<class T>
272 CDblNegLinker<T> *CDblNegLinker<T>::removePrev() {
273 CDblNegLinker<T> *prev = getPrev();
274 if (prev) {
275 prev->next = 0;
276 prev->prev = 0;
277 setPrev(prev->getPrev());
278 }
279 return prev;
280 }
281
282
283 template<class T>
284 CDblNegLinker<T> *CDblNegLinker<T>::getLastListLink() {
285 CDblNegLinker<T> *lastListLink = this;
286 while (lastListLink->hasNext()) {
287 lastListLink = lastListLink->getNext();
288 }
289 return lastListLink;
290 }
291
292 template<class T>
293 CDblNegLinker<T> *CDblNegLinker<T>::getFirstListLink() {
294 CDblNegLinker<T> *firstListLink = this;
295 while (firstListLink->hasPrev()) {
296 firstListLink = firstListLink->getPrev();
297 }
298 return firstListLink;
299 }
300
301
302
303 }; // end namespace Utilities
304
305 }; // end namespace Konclude
306
307 #endif // KONCLUDE_UTILITIES_CDBLNEGLINKER_H