Debian Codegraph @

Source/Reasoner/Realizer/COptimizedKPSetIndividualItem.cpp

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 #include "COptimizedKPSetIndividualItem.h"
22
23
24 namespace Konclude {
25
26 namespace Reasoner {
27
28 namespace Realizer {
29
30
31 COptimizedKPSetIndividualItem::COptimizedKPSetIndividualItem() {
32 }
33
34
35
36 cint64 COptimizedKPSetIndividualItem::getIndividualId() {
37 return mIndividualId;
38 }
39
40
41 CIndividual* COptimizedKPSetIndividualItem::getIndividual() {
42 return mIndividual;
43 }
44
45 CIndividualReference COptimizedKPSetIndividualItem::getIndividualReference() {
46 return CIndividualReference(mIndividual, mIndividualId);
47 }
48
49
50 COptimizedKPSetConceptInstancesHash* COptimizedKPSetIndividualItem::getKnownPossibleInstancesHash() {
51 return &mKnownPossibleInstancesHash;
52 }
53
54 COptimizedKPSetRoleNeighbourInstancesHash* COptimizedKPSetIndividualItem::getKnownPossibleRoleNeighboursInstancesHash() {
55 return &mKnownPossibleRoleNeigbourInstancesHash;
56 }
57
58 COptimizedKPSetIndividualItem* COptimizedKPSetIndividualItem::addKnownSameIndividual(const CIndividualReference& individualRef) {
59 mKnownSameIndividualSet.insert(individualRef);
60 return this;
61 }
62
63 bool COptimizedKPSetIndividualItem::hasKnownSameIndividual(const CIndividualReference& individualRef) {
64 return mKnownSameIndividualSet.contains(individualRef);
65 }
66
67 COptimizedKPSetIndividualItem* COptimizedKPSetIndividualItem::addPossibleSameIndividualItem(COptimizedKPSetIndividualItem* individualItem) {
68 mPossibleSameInstantiatedItemSet.insert(individualItem);
69 return this;
70 }
71
72
73 COptimizedKPSetIndividualItem* COptimizedKPSetIndividualItem::removePossibleSameIndividualItem(COptimizedKPSetIndividualItem* individualItem) {
74 mPossibleSameInstantiatedItemSet.remove(individualItem);
75 return this;
76 }
77
78
79 bool COptimizedKPSetIndividualItem::hasPossibleSameIndividualItem(COptimizedKPSetIndividualItem* individualItem) {
80 return mPossibleSameInstantiatedItemSet.contains(individualItem);
81 }
82
83
84 QSet<CIndividualReference>* COptimizedKPSetIndividualItem::getKnownSameIndividualSet() {
85 return &mKnownSameIndividualSet;
86 }
87
88 QSet<COptimizedKPSetIndividualItem*>* COptimizedKPSetIndividualItem::getPossibleSameInstantiatedItemSet() {
89 return &mPossibleSameInstantiatedItemSet;
90 }
91
92
93 QHash<cint64, CRealizingTestingItem*>* COptimizedKPSetIndividualItem::getPossibleSameIndividualTestingItemHash() {
94 return &mPossibleSameIndividualTestingItemHash;
95 }
96
97
98 cint64 COptimizedKPSetIndividualItem::getPossibleSameInstantiatedItemCount() {
99 return mPossibleSameInstantiatedItemSet.count();
100 }
101
102 cint64 COptimizedKPSetIndividualItem::getTestingPossibleInstantiatedCount() {
103 return mTestingPossibleInstantiatedCount;
104 }
105
106 COptimizedKPSetIndividualItem* COptimizedKPSetIndividualItem::setTestingPossibleInstantiatedCount(cint64 testCount) {
107 mTestingPossibleInstantiatedCount = testCount;
108 return this;
109 }
110
111 COptimizedKPSetIndividualItem* COptimizedKPSetIndividualItem::incTestingPossibleInstantiatedCount(cint64 incCount) {
112 mTestingPossibleInstantiatedCount += incCount;
113 return this;
114 }
115
116 COptimizedKPSetIndividualItem* COptimizedKPSetIndividualItem::decTestingPossibleInstantiatedCount(cint64 decCount) {
117 mTestingPossibleInstantiatedCount -= decCount;
118 return this;
119 }
120
121 cint64 COptimizedKPSetIndividualItem::getTestingPossibleRoleInstantiatedCount() {
122 return mTestingPossibleRoleInstantiatedCount;
123 }
124
125 COptimizedKPSetIndividualItem* COptimizedKPSetIndividualItem::setTestingPossibleRoleInstantiatedCount(cint64 testCount) {
126 mTestingPossibleRoleInstantiatedCount = testCount;
127 return this;
128 }
129
130 COptimizedKPSetIndividualItem* COptimizedKPSetIndividualItem::incTestingPossibleRoleInstantiatedCount(cint64 incCount) {
131 mTestingPossibleRoleInstantiatedCount += incCount;
132 return this;
133 }
134
135 COptimizedKPSetIndividualItem* COptimizedKPSetIndividualItem::decTestingPossibleRoleInstantiatedCount(cint64 decCount) {
136 mTestingPossibleRoleInstantiatedCount -= decCount;
137 return this;
138 }
139
140 COptimizedKPSetIndividualItem* COptimizedKPSetIndividualItem::initInstantiatedItem(cint64 indiId, CIndividual* individual) {
141 mIndividual = individual;
142 mIndividualId = indiId;
143 mKnownSameIndividualSet.insert(CIndividualReference(mIndividual, indiId));
144 mTestingPossibleInstantiatedCount = 0;
145 mTestingPossibleRoleInstantiatedCount = 0;
146 mPossibleInstantiatedCount = 0;
147 mPossibleRoleInstantiatedCount = 0;
148 mPossibleSameIndividualCount = 0;
149 mToProcessPossibleSameIndividualsFlag = false;
150 mPossibleSameIndividualsProcessingQueuedFlag = false;
151 mItemSameIndividualMerged = nullptr;
152 mInitializingRoleCandidateCount = 0;
153 mInitializingRoleCandidatesQueuedFlag = false;
154 mAllRoleCandidatesInitializedFlag = false;
155 mTmpNominalConcept = nullptr;
156 mIndiDepTrackingCollector = nullptr;
157 return this;
158 }
159
160 COptimizedKPSetIndividualItem* COptimizedKPSetIndividualItem::setTestingPossibleInstantiated(COptimizedKPSetConceptInstancesItem* item) {
161 COptimizedKPSetConceptInstancesHashData& hashData = mKnownPossibleInstancesHash[item];
162 hashData.mInstanceItemData->mTestingInstance = true;
163 return this;
164 }
165
166
167 COptimizedKPSetIndividualItem* COptimizedKPSetIndividualItem::setTestingPossibleInstantiated(COptimizedKPSetRoleInstancesItem* roleItem, COptimizedKPSetIndividualItem* successorItem) {
168 COptimizedKPSetRoleInstancesData* instanceItem = mKnownPossibleRoleNeigbourInstancesHash.getRoleSuccessorInstanceItemData(roleItem,successorItem);
169 if (instanceItem) {
170 instanceItem->mTestingInstance = true;
171 }
172 return this;
173 }
174
175 bool COptimizedKPSetIndividualItem::hasPossibleInstantiatedTesting() {
176 return mTestingPossibleInstantiatedCount > 0;
177 }
178
179 bool COptimizedKPSetIndividualItem::hasPossibleRoleInstantiatedTesting() {
180 return mTestingPossibleRoleInstantiatedCount > 0;
181 }
182
183 cint64 COptimizedKPSetIndividualItem::getPossibleInstantiatedCount() {
184 return mPossibleInstantiatedCount;
185 }
186
187 COptimizedKPSetIndividualItem* COptimizedKPSetIndividualItem::setPossibleInstantiatedCount(cint64 testCount) {
188 mPossibleInstantiatedCount = testCount;
189 return this;
190 }
191
192 COptimizedKPSetIndividualItem* COptimizedKPSetIndividualItem::incPossibleInstantiatedCount(cint64 incCount) {
193 mPossibleInstantiatedCount += incCount;
194 return this;
195 }
196
197 COptimizedKPSetIndividualItem* COptimizedKPSetIndividualItem::decPossibleInstantiatedCount(cint64 decCount) {
198 mPossibleInstantiatedCount -= decCount;
199 return this;
200 }
201
202
203 bool COptimizedKPSetIndividualItem::hasPossibleInstantiated() {
204 return mPossibleInstantiatedCount > 0;
205 }
206
207
208
209 cint64 COptimizedKPSetIndividualItem::getPossibleRoleInstantiatedCount() {
210 return mPossibleRoleInstantiatedCount;
211 }
212
213 COptimizedKPSetIndividualItem* COptimizedKPSetIndividualItem::setPossibleRoleInstantiatedCount(cint64 testCount) {
214 mPossibleRoleInstantiatedCount = testCount;
215 return this;
216 }
217
218 COptimizedKPSetIndividualItem* COptimizedKPSetIndividualItem::incPossibleRoleInstantiatedCount(cint64 incCount) {
219 mPossibleRoleInstantiatedCount += incCount;
220 return this;
221 }
222
223 COptimizedKPSetIndividualItem* COptimizedKPSetIndividualItem::decPossibleRoleInstantiatedCount(cint64 decCount) {
224 mPossibleRoleInstantiatedCount -= decCount;
225 return this;
226 }
227
228
229 bool COptimizedKPSetIndividualItem::hasPossibleRoleInstantiated() {
230 return mPossibleRoleInstantiatedCount > 0;
231 }
232
233
234 cint64 COptimizedKPSetIndividualItem::getTestingPossibleSameIndividualCount() {
235 return mPossibleSameIndividualCount;
236 }
237
238 COptimizedKPSetIndividualItem* COptimizedKPSetIndividualItem::setTestingPossibleSameIndividualCount(cint64 testCount) {
239 mPossibleSameIndividualCount = testCount;
240 return this;
241 }
242
243 COptimizedKPSetIndividualItem* COptimizedKPSetIndividualItem::incTestingPossibleSameIndividualCount(cint64 incCount) {
244 mPossibleSameIndividualCount += incCount;
245 return this;
246 }
247
248 COptimizedKPSetIndividualItem* COptimizedKPSetIndividualItem::decTestingPossibleSameIndividualCount(cint64 decCount) {
249 mPossibleSameIndividualCount -= decCount;
250 return this;
251 }
252
253 bool COptimizedKPSetIndividualItem::hasPossibleSameIndividuals() {
254 return !mPossibleSameInstantiatedItemSet.isEmpty();
255 }
256
257 bool COptimizedKPSetIndividualItem::hasPossibleSameIndividualsTesting() {
258 return mPossibleSameIndividualCount > 0;
259 }
260
261 COptimizedKPSetIndividualItem* COptimizedKPSetIndividualItem::takeTestingPossibleSameIndividualItem() {
262 COptimizedKPSetIndividualItem* possibleSameIndividualTestingItem = nullptr;
263 if (!mPossibleSameInstantiatedItemSet.isEmpty()) {
264 QSet<COptimizedKPSetIndividualItem*>::iterator it = mPossibleSameInstantiatedItemSet.begin();
265 possibleSameIndividualTestingItem = *it;
266 mPossibleSameInstantiatedItemSet.erase(it);
267 }
268 return possibleSameIndividualTestingItem;
269 }
270
271 bool COptimizedKPSetIndividualItem::hasToProcessPossibleSameIndividualsFlag() {
272 return mToProcessPossibleSameIndividualsFlag;
273 }
274
275 COptimizedKPSetIndividualItem* COptimizedKPSetIndividualItem::setToProcessPossibleSameIndividualsFlag(bool toProcess) {
276 mToProcessPossibleSameIndividualsFlag = toProcess;
277 return this;
278 }
279
280 bool COptimizedKPSetIndividualItem::hasPossibleSameIndividualsProcessingQueuedFlag() {
281 return mPossibleSameIndividualsProcessingQueuedFlag;
282 }
283
284 COptimizedKPSetIndividualItem* COptimizedKPSetIndividualItem::setPossibleSameIndividualsProcessingQueuedFlag(bool processingQueued) {
285 mPossibleSameIndividualsProcessingQueuedFlag = processingQueued;
286 return this;
287 }
288
289 bool COptimizedKPSetIndividualItem::isItemSameIndividualMerged() {
290 return mItemSameIndividualMerged != nullptr;
291 }
292
293 COptimizedKPSetIndividualItem* COptimizedKPSetIndividualItem::setItemSameIndividualMerged(COptimizedKPSetIndividualItem* mergedIndi) {
294 mItemSameIndividualMerged = mergedIndi;
295 return this;
296 }
297
298 COptimizedKPSetIndividualItem* COptimizedKPSetIndividualItem::getItemSameIndividualMerged() {
299 return mItemSameIndividualMerged;
300 }
301
302 cint64 COptimizedKPSetIndividualItem::getInitializingRoleCandidateCount() {
303 return mInitializingRoleCandidateCount;
304 }
305
306 COptimizedKPSetIndividualItem* COptimizedKPSetIndividualItem::setInitializingRoleCandidateCount(cint64 testCount) {
307 mInitializingRoleCandidateCount = testCount;
308 return this;
309 }
310
311 COptimizedKPSetIndividualItem* COptimizedKPSetIndividualItem::incInitializingRoleCandidateCount(cint64 incCount) {
312 mInitializingRoleCandidateCount += incCount;
313 return this;
314 }
315
316 COptimizedKPSetIndividualItem* COptimizedKPSetIndividualItem::decInitializingRoleCandidateCount(cint64 decCount) {
317 mInitializingRoleCandidateCount -= decCount;
318 return this;
319 }
320
321 bool COptimizedKPSetIndividualItem::hasInitializingRoleCandidatesQueuedFlag() {
322 return mInitializingRoleCandidatesQueuedFlag;
323 }
324
325 COptimizedKPSetIndividualItem* COptimizedKPSetIndividualItem::setInitializingRoleCandidatesQueuedFlag(bool initializingQueued) {
326 mInitializingRoleCandidatesQueuedFlag = initializingQueued;
327 return this;
328 }
329
330
331 bool COptimizedKPSetIndividualItem::hasAllRoleCandidatesInitializedFlag() {
332 return mAllRoleCandidatesInitializedFlag;
333 }
334
335 COptimizedKPSetIndividualItem* COptimizedKPSetIndividualItem::setAllRoleCandidatesInitializedFlag(bool allInitalized) {
336 mAllRoleCandidatesInitializedFlag = allInitalized;
337 return this;
338 }
339
340
341
342 CConcept* COptimizedKPSetIndividualItem::getTemporaryIndividualNominalConcept() {
343 return mTmpNominalConcept;
344 }
345
346 COptimizedKPSetIndividualItem* COptimizedKPSetIndividualItem::setTemporaryIndividualNominalConcept(CConcept* concept) {
347 mTmpNominalConcept = concept;
348 return this;
349 }
350
351
352
353 CIndividualDependenceTrackingCollector* COptimizedKPSetIndividualItem::getIndividualDependenceTrackingCollector() {
354 return mIndiDepTrackingCollector;
355 }
356
357
358 COptimizedKPSetIndividualItem* COptimizedKPSetIndividualItem::setIndividualDependenceTrackingCollector(CIndividualDependenceTrackingCollector* indiDepTrackColl) {
359 mIndiDepTrackingCollector = indiDepTrackColl;
360 return this;
361 }
362
363
364
365 }; // end namespace Realizer
366
367 }; // end namespace Reasoner
368
369 }; // end namespace Konclude