Debian Codegraph @

Source/Utilities/CNegLinker.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_CNEGLINKER_H
22 #define KONCLUDE_UTILITIES_CNEGLINKER_H
23
24 // Libraries includes
25
26
27 // Namespace includes
28
29
30 // Other includes
31
32
33 // Logger includes
34 #include "Logger/CLogger.h"
35
36 using namespace Konclude::Logger;
37
38
39 namespace Konclude {
40
41 namespace Utilities {
42
43
44 /*!
45 *
46 * \class CNegLinker
47 * \author Andreas Steigmiller
48 * \version 0.1
49 * \brief TODO
50 *
51 */
52 template<class T>
53 class CNegLinker {
54 // public methods
55 public:
56 //! Constructor
57 CNegLinker();
58 CNegLinker(T dataElement, bool isNegated = false, CNegLinker<T> *nextLink = 0);
59
60 //! Destructor
61 virtual ~CNegLinker();
62
63
64 CNegLinker<T> *init(T dataElement, bool isNegated = false, CNegLinker<T> *nextLink = 0);
65
66 bool hasNext();
67
68 CNegLinker<T> *setNext(CNegLinker<T> *nextLink);
69 CNegLinker<T> *getNext();
70
71 T getData();
72 CNegLinker<T> *setData(T dataElement);
73
74 bool isNegated();
75 CNegLinker<T> *setNegated(bool isNegated);
76
77 CNegLinker<T> *prepend(CNegLinker<T> *prependingList);
78 CNegLinker<T> *append(CNegLinker<T> *appendingList);
79
80 CNegLinker<T> *removeNext();
81
82 CNegLinker<T> *getLastListLink();
83
84
85 // protected methods
86 protected:
87
88 // private methods
89 private:
90
91 // private variables
92 private:
93 CNegLinker<T> *next;
94 T data;
95 bool negated;
96
97 };
98
99
100 template<class T>
101 CNegLinker<T>::CNegLinker() {
102 next = 0;
103 negated = false;
104 }
105
106 template<class T>
107 CNegLinker<T>::CNegLinker(T dataElement, bool isNegated, CNegLinker<T> *nextLink) {
108 next = nextLink;
109 negated = isNegated;
110 data = dataElement;
111 }
112
113 template<class T>
114 CNegLinker<T> *CNegLinker<T>::init(T dataElement, bool isNegated, CNegLinker<T> *nextLink) {
115 next = nextLink;
116 negated = isNegated;
117 data = dataElement;
118 }
119
120
121 template<class T>
122 CNegLinker<T>::~CNegLinker() {
123 }
124
125
126 template<class T>
127 bool CNegLinker<T>::hasNext() {
128 return next != 0;
129 }
130
131
132 template<class T>
133 CNegLinker<T> *CNegLinker<T>::setNext(CNegLinker<T> *nextLink) {
134 next = nextLink;
135 return this;
136 }
137
138 template<class T>
139 CNegLinker<T> *CNegLinker<T>::getNext() {
140 return next;
141 }
142
143
144 template<class T>
145 T CNegLinker<T>::getData() {
146 return data;
147 }
148
149 template<class T>
150 CNegLinker<T> *CNegLinker<T>::setData(T dataElement) {
151 data = dataElement;
152 return this;
153 }
154
155
156 template<class T>
157 bool CNegLinker<T>::isNegated() {
158 return negated;
159 }
160
161 template<class T>
162 CNegLinker<T> *CNegLinker<T>::setNegated(bool isNegated) {
163 negated = isNegated;
164 return this;
165 }
166
167
168 template<class T>
169 CNegLinker<T> *CNegLinker<T>::prepend(CNegLinker<T> *prependingList) {
170 CNegLinker<T> *last = prependingList->getLastListLink();
171 last->setNext(this);
172 return prependingList;
173 }
174
175 template<class T>
176 CNegLinker<T> *CNegLinker<T>::append(CNegLinker<T> *appendingList) {
177 CNegLinker<T> *last = getLastListLink();
178 last->setNext(appendingList);
179 return this;
180 }
181
182 template<class T>
183 CNegLinker<T> *CNegLinker<T>::removeNext() {
184 CNegLinker<T> *tmpNext = next;
185 if (next) {
186 CNegLinker<T> *tmpNextNext = next->next;
187 next->next = 0;
188 setNext(tmpNextNext);
189 }
190 return tmpNext;
191 }
192
193 template<class T>
194 CNegLinker<T> *CNegLinker<T>::getLastListLink() {
195 CNegLinker<T> *lastListLink = this;
196 while (lastListLink->hasNext()) {
197 lastListLink = lastListLink->getNext();
198 }
199 return lastListLink;
200 }
201
202
203
204 }; // end namespace Utilities
205
206 }; // end namespace Konclude
207
208 #endif // KONCLUDE_UTILITIES_CNEGLINKER_H