Debian Codegraph @

Source/Reasoner/Realizer/COptimizedKPSetRoleInstancesItem.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 "COptimizedKPSetRoleInstancesItem.h"
22
23
24 namespace Konclude {
25
26 namespace Reasoner {
27
28 namespace Realizer {
29
30
31 COptimizedKPSetRoleInstancesItem::COptimizedKPSetRoleInstancesItem() : COptimizedKPSetRoleInstancesRedirectionItem(this,nullptr,false) {
32 }
33
34 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::initInstancesItem(CRole* role) {
35 mRole = role;
36 mUnprocessedSuccItemCount = 0;
37 mTestingPossInstanceCount = 0;
38 mTestingPossibleInstancesCount = 0;
39 mTestingInitializationPropagationCount = 0;
40 mAllSuccProcessedFlag = false;
41 mToProcessFlag = false;
42 mPossibleProcessingQueuedFlag = false;
43 mSelfSuccsCompletedFlag = false;
44 mRequiresCandidateInitializationFlag = true;
45 mUninitializedSuccItemCount = 0;
46 mAllSuccInitializedFlag = false;
47 mInitializingQueuedFlag = false;
48 mInitializationStartedFlag = false;
49 mInitializationCompletedFlag = false;
50 mToInitializeFlag = false;
51 mTmpPropagationConcept = nullptr;
52 mTmpMarkerConcept = nullptr;
53 mTmpInversePropagationConcept = nullptr;
54 mTmpInverseMarkerConcept = nullptr;
55 mInvRole = nullptr;
56 mRoleHierNode = nullptr;
57 mInvRoleHierNode = nullptr;
58 mInvRedirectedItem = nullptr;
59 mComplexIndiCandidateIterator = nullptr;
60 mOnlyTransitiveComplexRoleCandidates = true;
61 mOnlyDeterministicComplexRoleStarterCandidatesUsage = true;
62
63 mPropagationDirectionDetermined = false;
64 mPreferredPropagationDirection = NONE;
65 return this;
66 }
67
68 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::setInitialUnprocessedSuccessorItemCount() {
69 mUnprocessedSuccItemCount = mSuccessorItemList.count();
70 return this;
71 }
72
73 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::setInitialUninitializedSuccessorItemCount() {
74 mUninitializedSuccItemCount = mSuccessorItemList.count();
75 return this;
76 }
77
78 CRole* COptimizedKPSetRoleInstancesItem::getRole() {
79 return mRole;
80 }
81
82 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::setRole(CRole* role) {
83 mRole = role;
84 return this;
85 }
86
87 CRolePropertiesHierarchyNode* COptimizedKPSetRoleInstancesItem::getRoleHierarchyNode() {
88 return mRoleHierNode;
89 }
90
91 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::setRoleHierarchyNode(CRolePropertiesHierarchyNode* roleHierNode) {
92 mRoleHierNode = roleHierNode;
93 return this;
94 }
95
96
97 CRolePropertiesHierarchyNode* COptimizedKPSetRoleInstancesItem::getInverseRoleHierarchyNode() {
98 return mInvRoleHierNode;
99 }
100
101 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::setInverseRoleHierarchyNode(CRolePropertiesHierarchyNode* roleHierNode) {
102 mInvRoleHierNode = roleHierNode;
103 return this;
104 }
105
106
107 COptimizedKPSetRoleInstancesRedirectionItem* COptimizedKPSetRoleInstancesItem::getInverseRoleRedirectedItem() {
108 return mInvRedirectedItem;
109 }
110
111 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::setInverseRoleRedirectedItem(COptimizedKPSetRoleInstancesRedirectionItem* redirectedItem) {
112 mInvRedirectedItem = redirectedItem;
113 return this;
114 }
115
116
117
118 QSet<COptimizedKPSetIndividualItemPair>* COptimizedKPSetRoleInstancesItem::getKnownInstancesSet() {
119 return &mKnownInstancesSet;
120 }
121
122 QSet<COptimizedKPSetIndividualItemPair>* COptimizedKPSetRoleInstancesItem::getPossibleInstancesSet() {
123 return &mPossibleInstancesSet;
124 }
125
126 QList<TRoleItemInversionPair>* COptimizedKPSetRoleInstancesItem::getParentItemList() {
127 return &mParentItemList;
128 }
129
130 QList<TRoleItemInversionPair>* COptimizedKPSetRoleInstancesItem::getSuccessorItemList() {
131 return &mSuccessorItemList;
132 }
133
134 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::addKnownInstance(const COptimizedKPSetIndividualItemPair& itemPair) {
135 mKnownInstancesSet.insert(itemPair);
136 return this;
137 }
138
139 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::removeKnownInstance(const COptimizedKPSetIndividualItemPair& itemPair) {
140 mKnownInstancesSet.remove(itemPair);
141 return this;
142 }
143
144 bool COptimizedKPSetRoleInstancesItem::hasKnownInstance(const COptimizedKPSetIndividualItemPair& itemPair) {
145 return mKnownInstancesSet.contains(itemPair);
146 }
147
148
149 bool COptimizedKPSetRoleInstancesItem::hasPossibleInstance(const COptimizedKPSetIndividualItemPair& itemPair) {
150 return mPossibleInstancesSet.contains(itemPair);
151 }
152
153 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::addPossibleInstance(const COptimizedKPSetIndividualItemPair& itemPair) {
154 mPossibleInstancesSet.insert(itemPair);
155 return this;
156 }
157
158 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::removePossibleInstance(const COptimizedKPSetIndividualItemPair& itemPair) {
159 mPossibleInstancesSet.remove(itemPair);
160 return this;
161 }
162
163 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::addParentItem(COptimizedKPSetRoleInstancesItem* item, bool inversed) {
164 mParentItemList.append(TRoleItemInversionPair(item,inversed));
165 return this;
166 }
167
168 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::addSuccessorItem(COptimizedKPSetRoleInstancesItem* item, bool inversed) {
169 mSuccessorItemList.append(TRoleItemInversionPair(item,inversed));
170 return this;
171 }
172
173 cint64 COptimizedKPSetRoleInstancesItem::getUnprocessedSuccessorItemCount() {
174 return mUnprocessedSuccItemCount;
175 }
176
177 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::setUnprocessedSuccessorItemCount(cint64 unpSuccCount) {
178 mUnprocessedSuccItemCount = unpSuccCount;
179 return this;
180 }
181
182 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::incUnprocessedSuccessorItemCount(cint64 incCount) {
183 mUnprocessedSuccItemCount += incCount;
184 return this;
185 }
186
187 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::decUnprocessedSuccessorItemCount(cint64 decCount) {
188 mUnprocessedSuccItemCount -= decCount;
189 return this;
190 }
191
192
193
194 cint64 COptimizedKPSetRoleInstancesItem::getTestingPossibleInstancesCount() {
195 return mTestingPossInstanceCount;
196 }
197
198 bool COptimizedKPSetRoleInstancesItem::hasTestingPossibleInstances() {
199 return mTestingPossInstanceCount > 0;
200 }
201
202 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::setTestingPossibleInstancesCount(cint64 testPossIntCount) {
203 mTestingPossInstanceCount = testPossIntCount;
204 return this;
205 }
206
207 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::incTestingPossibleInstancesCount(cint64 incCount) {
208 mTestingPossInstanceCount += incCount;
209 return this;
210 }
211
212 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::decTestingPossibleInstancesCount(cint64 decCount) {
213 mTestingPossInstanceCount -= decCount;
214 return this;
215 }
216
217
218
219
220
221
222 cint64 COptimizedKPSetRoleInstancesItem::getTestingComplexCandidateInstancesCount() {
223 return mTestingPossibleInstancesCount;
224 }
225
226 bool COptimizedKPSetRoleInstancesItem::hasTestingComplexCandidateInstancesCount() {
227 return mTestingPossibleInstancesCount > 0;
228 }
229
230 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::setTestingComplexCandidateInstancesCount(cint64 testPossIntCount) {
231 mTestingPossibleInstancesCount = testPossIntCount;
232 return this;
233 }
234
235 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::incTestingComplexCandidateInstancesCount(cint64 incCount) {
236 mTestingPossibleInstancesCount += incCount;
237 return this;
238 }
239
240 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::decTestingComplexCandidateInstancesCount(cint64 decCount) {
241 mTestingPossibleInstancesCount -= decCount;
242 return this;
243 }
244
245
246
247
248
249
250
251 cint64 COptimizedKPSetRoleInstancesItem::getTestingInitializationPropagationCount() {
252 return mTestingInitializationPropagationCount;
253 }
254
255 bool COptimizedKPSetRoleInstancesItem::hasTestingInitializationPropagationCount() {
256 return mTestingInitializationPropagationCount > 0;
257 }
258
259 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::setTestingInitializationPropagationCount(cint64 testPossIntCount) {
260 mTestingInitializationPropagationCount = testPossIntCount;
261 return this;
262 }
263
264 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::incTestingInitializationPropagationCount(cint64 incCount) {
265 mTestingInitializationPropagationCount += incCount;
266 return this;
267 }
268
269 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::decTestingInitializationPropagationCount(cint64 decCount) {
270 mTestingInitializationPropagationCount -= decCount;
271 return this;
272 }
273
274
275
276
277
278
279 bool COptimizedKPSetRoleInstancesItem::hasAllSuccessorProcessedFlag() {
280 return mAllSuccProcessedFlag;
281 }
282
283 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::setAllSuccessorProcessedFlag(bool allSuccProcessed) {
284 mAllSuccProcessedFlag = allSuccProcessed;
285 return this;
286 }
287
288 bool COptimizedKPSetRoleInstancesItem::hasToProcessPossibleInstancesFlag() {
289 return mToProcessFlag;
290 }
291
292 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::setToProcessPossibleInstancesFlag(bool toProcess) {
293 mToProcessFlag = toProcess;
294 return this;
295 }
296
297 bool COptimizedKPSetRoleInstancesItem::hasPossibleInstancesProcessingQueuedFlag() {
298 return mPossibleProcessingQueuedFlag;
299 }
300
301 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::setPossibleInstancesProcessingQueuedFlag(bool processingQueued) {
302 mPossibleProcessingQueuedFlag = processingQueued;
303 return this;
304 }
305
306
307 bool COptimizedKPSetRoleInstancesItem::hasComplexCandidateInstancesProcessingQueuedFlag() {
308 return mComplexCandidateProcessingQueuedFlag;
309 }
310
311 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::setComplexCandidateProcessingQueuedFlag(bool processingQueued) {
312 mComplexCandidateProcessingQueuedFlag = processingQueued;
313 return this;
314 }
315
316
317 bool COptimizedKPSetRoleInstancesItem::hasSelfSuccessorProcessedFlag() {
318 return mSelfSuccsCompletedFlag;
319 }
320
321 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::setSelfSuccessorProcessedFlag(bool selfSuccProcessed) {
322 mSelfSuccsCompletedFlag = selfSuccProcessed;
323 return this;
324 }
325
326 bool COptimizedKPSetRoleInstancesItem::hasPossibleInstances() {
327 return !mPossibleInstancesSet.isEmpty();
328 }
329
330 COptimizedKPSetIndividualItemPair COptimizedKPSetRoleInstancesItem::takeNextTestingPossibleInstance() {
331 COptimizedKPSetIndividualItemPair nextItem(nullptr,nullptr);
332 if (hasPossibleInstances()) {
333 QSet<COptimizedKPSetIndividualItemPair>::iterator it = mPossibleInstancesSet.begin();
334 nextItem = *it;
335 mPossibleInstancesSet.erase(it);
336 }
337 return nextItem;
338 }
339
340
341 bool COptimizedKPSetRoleInstancesItem::requiresCandidateInitialization() {
342 return mRequiresCandidateInitializationFlag;
343 }
344
345 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::setRequiresCandidateInitialization(bool requiresInit) {
346 mRequiresCandidateInitializationFlag = requiresInit;
347 return this;
348 }
349
350
351 bool COptimizedKPSetRoleInstancesItem::hasRemainingCandidateInitializationSuccessors() {
352 return !mRemainingCandidateInitializationSuccessorList.isEmpty();
353 }
354
355 QList<COptimizedKPSetIndividualItem*>* COptimizedKPSetRoleInstancesItem::getRemainingCandidateInitializationSuccessorList() {
356 return &mRemainingCandidateInitializationSuccessorList;
357 }
358
359 COptimizedKPSetIndividualItem* COptimizedKPSetRoleInstancesItem::takeNextRemainingCandidateInitializationSuccessor() {
360 if (!mRemainingCandidateInitializationSuccessorList.isEmpty()) {
361 return mRemainingCandidateInitializationSuccessorList.takeFirst();
362 }
363 return nullptr;
364 }
365
366 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::addRemainingCandidateInitializationSuccessor(COptimizedKPSetIndividualItem* item) {
367 mRemainingCandidateInitializationSuccessorList.append(item);
368 return this;
369 }
370
371 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::addRemainingCandidateInitializationSuccessors(QList<COptimizedKPSetIndividualItem*>* itemList) {
372 mRemainingCandidateInitializationSuccessorList.append(*itemList);
373 return this;
374 }
375
376 bool COptimizedKPSetRoleInstancesItem::isCandidateSuccessorInitializationCompleted() {
377 return mInitializationStartedFlag && mInitializationCompletedFlag;
378 }
379
380 bool COptimizedKPSetRoleInstancesItem::isCandidateSuccessorInitializationStarted() {
381 return mInitializationStartedFlag;
382 }
383
384 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::setCandidateSuccessorInitializationStarted(bool initStarted) {
385 mInitializationStartedFlag = initStarted;
386 return this;
387 }
388
389
390 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::setCandidateSuccessorInitializationCompleted(bool initCompleted) {
391 mInitializationCompletedFlag = initCompleted;
392 return this;
393 }
394
395 cint64 COptimizedKPSetRoleInstancesItem::getUninitializedSuccessorItemCount() {
396 return mUninitializedSuccItemCount;
397 }
398
399 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::setUninitializedSuccessorItemCount(cint64 unintSuccCount) {
400 mUninitializedSuccItemCount = unintSuccCount;
401 return this;
402 }
403
404 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::incUninitializedSuccessorItemCount(cint64 incCount) {
405 mUninitializedSuccItemCount += incCount;
406 return this;
407 }
408
409 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::decUninitializedSuccessorItemCount(cint64 decCount) {
410 mUninitializedSuccItemCount -= decCount;
411 return this;
412 }
413
414
415 bool COptimizedKPSetRoleInstancesItem::hasAllSuccessorInitializedFlag() {
416 return mAllSuccInitializedFlag;
417 }
418
419 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::setAllSuccessorInitializedFlag(bool allSuccInitialized) {
420 mAllSuccInitializedFlag = allSuccInitialized;
421 return this;
422 }
423
424
425 bool COptimizedKPSetRoleInstancesItem::hasInitializingQueuedFlag() {
426 return mInitializingQueuedFlag;
427 }
428
429 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::setInitializingQueuedFlag(bool initializingQueued) {
430 mInitializingQueuedFlag = initializingQueued;
431 return this;
432 }
433
434
435 bool COptimizedKPSetRoleInstancesItem::hasToInitializeCandidatesFlag() {
436 return mToInitializeFlag;
437 }
438
439 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::setToInitializeCandidatesFlag(bool toInitialize) {
440 mToInitializeFlag = toInitialize;
441 return this;
442 }
443
444 CConcept* COptimizedKPSetRoleInstancesItem::getTemporaryPropagationConcept() {
445 return mTmpPropagationConcept;
446 }
447
448 CConcept* COptimizedKPSetRoleInstancesItem::getTemporaryMarkerConcept() {
449 return mTmpMarkerConcept;
450 }
451
452 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::setTemporaryPropagationConcept(CConcept* propagationConcept) {
453 mTmpPropagationConcept = propagationConcept;
454 return this;
455 }
456
457 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::setTemporaryMarkerConcept(CConcept* markerConcept) {
458 mTmpMarkerConcept = markerConcept;
459 return this;
460 }
461
462
463
464
465
466 CConcept* COptimizedKPSetRoleInstancesItem::getTemporaryInversePropagationConcept() {
467 return mTmpInversePropagationConcept;
468 }
469
470 CConcept* COptimizedKPSetRoleInstancesItem::getTemporaryInverseMarkerConcept() {
471 return mTmpInverseMarkerConcept;
472 }
473
474 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::setTemporaryInversePropagationConcept(CConcept* propagationConcept) {
475 mTmpInversePropagationConcept = propagationConcept;
476 return this;
477 }
478
479 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::setTemporaryInverseMarkerConcept(CConcept* markerConcept) {
480 mTmpInverseMarkerConcept = markerConcept;
481 return this;
482 }
483
484
485
486 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::addKnownInverseInstance(const COptimizedKPSetIndividualItemPair& itemPair) {
487 mKnownInstancesSet.insert(COptimizedKPSetIndividualItemPair(itemPair.second, itemPair.first));
488 return this;
489 }
490
491 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::removeKnownInverseInstance(const COptimizedKPSetIndividualItemPair& itemPair) {
492 mKnownInstancesSet.remove(COptimizedKPSetIndividualItemPair(itemPair.second, itemPair.first));
493 return this;
494 }
495
496 bool COptimizedKPSetRoleInstancesItem::hasKnownInverseInstance(const COptimizedKPSetIndividualItemPair& itemPair) {
497 return mKnownInstancesSet.contains(COptimizedKPSetIndividualItemPair(itemPair.second, itemPair.first));
498 }
499
500
501 bool COptimizedKPSetRoleInstancesItem::hasPossibleInverseInstance(const COptimizedKPSetIndividualItemPair& itemPair) {
502 return mPossibleInstancesSet.contains(COptimizedKPSetIndividualItemPair(itemPair.second, itemPair.first));
503 }
504
505 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::addPossibleInverseInstance(const COptimizedKPSetIndividualItemPair& itemPair) {
506 mPossibleInstancesSet.insert(COptimizedKPSetIndividualItemPair(itemPair.second, itemPair.first));
507 return this;
508 }
509
510 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::removePossibleInverseInstance(const COptimizedKPSetIndividualItemPair& itemPair) {
511 mPossibleInstancesSet.remove(COptimizedKPSetIndividualItemPair(itemPair.second, itemPair.first));
512 return this;
513 }
514
515
516
517
518 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::addKnownInstance(const COptimizedKPSetIndividualItemPair& itemPair, bool inverse) {
519 if (inverse) {
520 addKnownInstance(COptimizedKPSetIndividualItemPair(itemPair.second,itemPair.first));
521 } else {
522 addKnownInstance(itemPair);
523 }
524 return this;
525 }
526
527 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::removeKnownInstance(const COptimizedKPSetIndividualItemPair& itemPair, bool inverse) {
528 if (inverse) {
529 removeKnownInstance(COptimizedKPSetIndividualItemPair(itemPair.second, itemPair.first));
530 } else {
531 removeKnownInstance(itemPair);
532 }
533 return this;
534 }
535
536 bool COptimizedKPSetRoleInstancesItem::hasKnownInstance(const COptimizedKPSetIndividualItemPair& itemPair, bool inverse) {
537 if (inverse) {
538 return hasKnownInstance(COptimizedKPSetIndividualItemPair(itemPair.second, itemPair.first));
539 } else {
540 return hasKnownInstance(itemPair);
541 }
542 }
543
544
545 bool COptimizedKPSetRoleInstancesItem::hasPossibleInstance(const COptimizedKPSetIndividualItemPair& itemPair, bool inverse) {
546 if (inverse) {
547 return hasPossibleInstance(COptimizedKPSetIndividualItemPair(itemPair.second, itemPair.first));
548 } else {
549 return hasPossibleInstance(itemPair);
550 }
551 }
552
553 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::addPossibleInstance(const COptimizedKPSetIndividualItemPair& itemPair, bool inverse) {
554 if (inverse) {
555 addPossibleInstance(COptimizedKPSetIndividualItemPair(itemPair.second, itemPair.first));
556 } else {
557 addPossibleInstance(itemPair);
558 }
559 return this;
560 }
561
562 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::removePossibleInstance(const COptimizedKPSetIndividualItemPair& itemPair, bool inverse) {
563 if (inverse) {
564 removePossibleInstance(COptimizedKPSetIndividualItemPair(itemPair.second, itemPair.first));
565 } else {
566 removePossibleInstance(itemPair);
567 }
568 return this;
569 }
570
571 bool COptimizedKPSetRoleInstancesItem::hasInverseRole() {
572 return mInvRole;
573 }
574
575 CRole* COptimizedKPSetRoleInstancesItem::getInverseRole() {
576 return mInvRole;
577 }
578
579 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::setInverseRole(CRole* role) {
580 mInvRole = role;
581 return this;
582 }
583
584 QSet<CRole*>* COptimizedKPSetRoleInstancesItem::getComplexRoleStarterCandidateSet() {
585 return &mComplexRoleStarterCandidateSet;
586 }
587
588 QSet<CRole*>* COptimizedKPSetRoleInstancesItem::getComplexInverseRoleStarterCandidateSet() {
589 return &mComplexInverseRoleStarterCandidateSet;
590 }
591
592 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::addComplexRoleStarterCandidate(CRole* role) {
593 mComplexRoleStarterCandidateSet.insert(role);
594 return this;
595 }
596
597 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::addComplexInverseRoleStarterCandidate(CRole* role) {
598 mComplexInverseRoleStarterCandidateSet.insert(role);
599 return this;
600 }
601
602 bool COptimizedKPSetRoleInstancesItem::hasComplexRoleStarterCandidate(CRole* role) {
603 return mComplexRoleStarterCandidateSet.contains(role);
604 }
605
606 bool COptimizedKPSetRoleInstancesItem::hasComplexInverseRoleStarterCandidate(CRole* role) {
607 return mComplexInverseRoleStarterCandidateSet.contains(role);
608 }
609
610
611
612
613 bool COptimizedKPSetRoleInstancesItem::hasOnlyTransitiveComplexRoleCandidates() {
614 return mOnlyTransitiveComplexRoleCandidates;
615 }
616
617 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::setOnlyTransitiveComplexRoleCandidates(bool onlyTransitiveCandidates) {
618 mOnlyTransitiveComplexRoleCandidates = onlyTransitiveCandidates;
619 return this;
620 }
621
622
623
624
625 QSet<TRoleItemInversionPair>* COptimizedKPSetRoleInstancesItem::getOnlyTransitiveComplexSubRoleItems() {
626 return &mOnlyTransitiveComplexSubRoleItems;
627 }
628
629 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::addOnlyTransitiveComplexSubRoleItem(const TRoleItemInversionPair& item) {
630 mOnlyTransitiveComplexSubRoleItems.insert(item);
631 return this;
632 }
633
634
635
636
637 bool COptimizedKPSetRoleInstancesItem::hasOnlyDeterministicComplexRoleStarterCandidatesUsage() {
638 return mOnlyDeterministicComplexRoleStarterCandidatesUsage;
639 }
640
641 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::setOnlyDeterministicComplexRoleStarterCandidatesUsage(bool onlyDeterministicComplexRoleStarterCandidatesUsage) {
642 mOnlyDeterministicComplexRoleStarterCandidatesUsage = onlyDeterministicComplexRoleStarterCandidatesUsage;
643 return this;
644 }
645
646
647
648
649 COptimizedKPSetRoleInstancesCombinedNeighbourRoleSetCacheLabelHash* COptimizedKPSetRoleInstancesItem::getCombinedNeighbourCacheLabelItemDataHash(bool inversed) {
650 if (!inversed) {
651 return &mCombinedNeighbourLabelDataHash;
652 } else {
653 return &mInverseCombinedNeighbourLabelDataHash;
654 }
655 }
656
657
658 bool COptimizedKPSetRoleInstancesItem::hasCombinedNeighbourCacheLabelItemInversed(CBackendRepresentativeMemoryLabelCacheItem* cacheLabelItem) {
659 return mInverseCombinedNeighbourLabelDataHash.contains(cacheLabelItem);
660 }
661
662
663 QHash<cint64, COptimizedKPSetIndividualComplexRoleData*>* COptimizedKPSetRoleInstancesItem::getIndividualIdComplexRoleDataHash() {
664 return &mIndividualIdComplexRoleDataHash;
665 }
666
667 bool COptimizedKPSetRoleInstancesItem::hasComplexRoleData() {
668 return mIndividualIdComplexRoleDataHash.size() > 0;
669 }
670
671
672 COptimizedKPSetIndividualComplexRoleData* COptimizedKPSetRoleInstancesItem::getIndividualIdComplexRoleData(cint64 individualId, bool createIfNotExists) {
673 if (createIfNotExists) {
674 COptimizedKPSetIndividualComplexRoleData*& complexRoleData = mIndividualIdComplexRoleDataHash[individualId];
675 if (!complexRoleData) {
676 complexRoleData = new COptimizedKPSetIndividualComplexRoleExplicitIndirectLinksData();
677 }
678 return complexRoleData;
679 } else {
680 return mIndividualIdComplexRoleDataHash.value(individualId);
681 }
682 }
683
684
685
686 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::addComplexStarterCandidateCombinedNeighbourRoleLabelCacheItem(bool inversed, CBackendRepresentativeMemoryLabelCacheItem* labelCacheItem) {
687 if (!inversed) {
688 mComplexStarterCandidateCombinedNeighbourRoleLabelCacheItemSet.insert(labelCacheItem);
689 } else {
690 mComplexInverseStarterCandidateCombinedNeighbourRoleLabelCacheItemSet.insert(labelCacheItem);
691 }
692 return this;
693 }
694
695
696
697 QSet<CBackendRepresentativeMemoryLabelCacheItem*>* COptimizedKPSetRoleInstancesItem::getComplexStarterCandidateCombinedNeighbourRoleLabelCacheItemSet(bool inversed) {
698 if (inversed) {
699 return &mComplexInverseStarterCandidateCombinedNeighbourRoleLabelCacheItemSet;
700 } else {
701 return &mComplexStarterCandidateCombinedNeighbourRoleLabelCacheItemSet;
702 }
703 }
704
705
706
707
708
709 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::addComplexStarterCandidateCombinedExistentialRoleLabelCacheItem(bool inversed, CBackendRepresentativeMemoryLabelCacheItem* labelCacheItem) {
710 if (!inversed) {
711 mComplexStarterCandidateCombinedExistentialRoleLabelCacheItemSet.insert(labelCacheItem);
712 } else {
713 mComplexInverseStarterCandidateCombinedExistentialRoleLabelCacheItemSet.insert(labelCacheItem);
714 }
715 return this;
716 }
717
718
719
720 QSet<CBackendRepresentativeMemoryLabelCacheItem*>* COptimizedKPSetRoleInstancesItem::getComplexStarterCandidateCombinedExistentialRoleLabelCacheItemSet(bool inversed) {
721 if (inversed) {
722 return &mComplexInverseStarterCandidateCombinedExistentialRoleLabelCacheItemSet;
723 } else {
724 return &mComplexStarterCandidateCombinedExistentialRoleLabelCacheItemSet;
725 }
726 }
727
728
729
730
731 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::addExistentialRoleLabelCacheItem(bool inversed, CBackendRepresentativeMemoryLabelCacheItem* labelCacheItem) {
732 if (!inversed) {
733 mExistentialRoleLabelCacheItemSet.insert(labelCacheItem);
734 } else {
735 mExistentialInverseRoleLabelCacheItemSet.insert(labelCacheItem);
736 }
737 return this;
738 }
739
740 QSet<CBackendRepresentativeMemoryLabelCacheItem*>* COptimizedKPSetRoleInstancesItem::getExistentialRoleLabelCacheItemSet(bool inversed) {
741 if (!inversed) {
742 return &mExistentialRoleLabelCacheItemSet;
743 } else {
744 return &mExistentialInverseRoleLabelCacheItemSet;
745 }
746 }
747
748
749 COptimizedRepresentativeKPSetCacheMultipleTypeLabelSetItemIterator* COptimizedKPSetRoleInstancesItem::getIndividualComplexCandidateIterator() {
750 return mComplexIndiCandidateIterator;
751 }
752
753 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::setIndividualComplexCandidateIterator(COptimizedRepresentativeKPSetCacheMultipleTypeLabelSetItemIterator* iterator) {
754 mComplexIndiCandidateIterator = iterator;
755 return this;
756 }
757
758
759
760 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::addComplexCandidateInstance(const COptimizedKPSetIndividualItemReferencePair& itemRefPair, bool inverse) {
761 COptimizedKPSetIndividualItemReferencePair corrItemRefPair = itemRefPair;
762 if (inverse) {
763 corrItemRefPair = COptimizedKPSetIndividualItemReferencePair(corrItemRefPair.second, corrItemRefPair.first);
764 }
765 mComplexRoleCandidateInstancesSet.insert(corrItemRefPair);
766 return this;
767 }
768
769 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::removeComplexCandidateInstance(const COptimizedKPSetIndividualItemReferencePair& itemRefPair, bool inverse) {
770 COptimizedKPSetIndividualItemReferencePair corrItemRefPair = itemRefPair;
771 if (inverse) {
772 corrItemRefPair = COptimizedKPSetIndividualItemReferencePair(corrItemRefPair.second, corrItemRefPair.first);
773 }
774 mComplexRoleCandidateInstancesSet.remove(corrItemRefPair);
775 return this;
776 }
777
778 bool COptimizedKPSetRoleInstancesItem::hasComplexInstanceCandidates() {
779 return !mComplexRoleCandidateInstancesSet.isEmpty();
780 }
781
782 COptimizedKPSetIndividualItemReferencePair COptimizedKPSetRoleInstancesItem::takeNextTestingComplexInstanceCandidate() {
783 COptimizedKPSetIndividualItemReferencePair nextItem = COptimizedKPSetIndividualItemReferencePair(CRealizationIndividualInstanceItemReference(), CRealizationIndividualInstanceItemReference());
784 if (hasPossibleInstances()) {
785 QSet<COptimizedKPSetIndividualItemReferencePair>::iterator it = mComplexRoleCandidateInstancesSet.begin();
786 nextItem = *it;
787 mComplexRoleCandidateInstancesSet.erase(it);
788 }
789 return nextItem;
790 }
791
792
793 bool COptimizedKPSetRoleInstancesItem::hasPropagationDirectionDetermined() {
794 return mPropagationDirectionDetermined;
795 }
796
797 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::setPropagationDirectionDetermined(bool determined) {
798 mPropagationDirectionDetermined = determined;
799 return this;
800 }
801
802 COptimizedKPSetRoleInstancesItem::RolePreferredPropagationDirection COptimizedKPSetRoleInstancesItem::getPreferredPropagationDirection() {
803 return mPreferredPropagationDirection;
804 }
805
806 COptimizedKPSetRoleInstancesItem* COptimizedKPSetRoleInstancesItem::setPreferredPropagationDirection(RolePreferredPropagationDirection direction) {
807 mPreferredPropagationDirection = direction;
808 return this;
809 }
810
811
812
813
814 }; // end namespace Realizer
815
816 }; // end namespace Reasoner
817
818 }; // end namespace Konclude