Debian Codegraph @

Source/Reasoner/Answerer/COptimizedComplexConceptItem.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 "COptimizedComplexConceptItem.h"
22
23
24 namespace Konclude {
25
26 namespace Reasoner {
27
28 namespace Answerer {
29
30
31 COptimizedComplexConceptItem::COptimizedComplexConceptItem() {
32 mConceptItemId = 0;
33 mConcept = nullptr;
34 mConceptNegation = false;
35 mCandidateConcept = nullptr;
36 mMarkerConcept = nullptr;
37 mPropagationConcept = nullptr;
38 mQueuedProcessStep = nullptr;
39 mKnownEquivalentClassNode = nullptr;
40 mDirectSuperClassNodeSet = nullptr;
41 mKnownSuperClassNodeSet = nullptr;
42 mPossibleSuperClassNodeSet = nullptr;
43
44 mDirectSubClassNodeSet = nullptr;
45 mPossibleSubClassTestingNodeSet = nullptr;
46 mPossibleSuperClassNodeTestingList = nullptr;
47 mSatisfiable = false;
48 mSuperClassComputationInitializing = false;
49
50 mKnownSuperConceptSet = nullptr;
51 mPossibleSuperConceptSet = nullptr;
52
53 mDirectSuperClassNodeSet = nullptr;
54 mKnownSuperClassNodeSet = nullptr;
55 mPossibleSuperClassNodeSet = nullptr;
56 mPossibleSubClassNodeTestingList = nullptr;
57
58 mClassTermExpression = nullptr;
59 mKnownInstanceSet = nullptr;
60 mPossibleInstanceSet = nullptr;
61
62 mPossibleInstanceItemSet = nullptr;
63 mPossibleInstanceCandidatePropagationItemSet = nullptr;
64 mPossibleInstanceItemSetCandidatePropagationIteratorInitialized = false;
65 mPossibleInstanceCandidatePropagationBeginningKnownInstancesCount = 0;
66
67 mMaximumSubClassNodeSet = nullptr;
68
69 mLazyRealizationInitialized = false;
70 mLazyRealizationInitializationRequested = false;
71 mLazyNeighbourRealizationPruningRequired = false;
72 mLazyNeighbourRealizationRequested = false;
73 mLazyRealizationInstancesRetrieved = false;
74 mCompletelyHandledChecked = false;
75 mLazyRealizationProcessingCount = 0;
76
77 mConceptAbsorbed = false;
78 mCandidatePropagationProcessingCount = 0;
79 mCandidatePropagated = false;
80 mCandidateReceived = false;
81
82 mVarConBaseItem = nullptr;
83 mVarConSuperClassesItem = nullptr;
84 mVarConSubClassesItem = nullptr;
85
86 mRealizationRetrievingExpectedInstanceCandidateCount = 0;
87
88 mCompletelyHandledReducedInstanceTestingConceptNegation = false;
89 mCompletelyHandledReducedInstanceTestingConcept = nullptr;
90 mAllAtomicConceptsCompletelyHandled = false;
91
92 mTopObjectPropertyUsed = false;
93
94 mRealizationIterator = nullptr;
95
96 mPossibleTestedNonInstanceCount = 0;
97 mRealizationRetrievedInstanceCandidateCount = 0;
98
99 mLastRetrievingCertainInstanceItemCount = 0;
100
101 mMinimalRetrievingInstanceItemSize = 0.1;
102
103 mKnownInstanceItems = nullptr;
104
105 mRealizationIteratorSamplingExpectedCount = -1;
106
107 mLastConceptInstancesCacheReportedCount = -1;
108 mLastConceptInstancesCacheReportedSize = -1;
109
110
111 }
112
113
114 COptimizedComplexConceptItem::~COptimizedComplexConceptItem() {
115 }
116
117
118
119 COptimizedComplexConceptItem* COptimizedComplexConceptItem::initComplexConcept(CConcept* concept, bool negated) {
120 mConcept = concept;
121 mConceptNegation = negated;
122 return this;
123 }
124
125 bool COptimizedComplexConceptItem::getConceptNegation() {
126 return mConceptNegation;
127 }
128
129 CConcept* COptimizedComplexConceptItem::getConcept() {
130 return mConcept;
131 }
132
133
134 TConceptNegPair COptimizedComplexConceptItem::getConceptNegationPair() {
135 return TConceptNegPair(mConcept, mConceptNegation);
136 }
137
138
139 bool COptimizedComplexConceptItem::representsConceptClass() {
140 return !mConceptNegation && mConcept->hasClassName();
141 }
142
143
144 CConcept* COptimizedComplexConceptItem::getCandidateConcept() {
145 return mCandidateConcept;
146 }
147
148 CConcept* COptimizedComplexConceptItem::getMarkerConcept() {
149 return mMarkerConcept;
150 }
151
152 CConcept* COptimizedComplexConceptItem::getPropagationConcept() {
153 return mPropagationConcept;
154 }
155
156
157 COptimizedComplexConceptItem* COptimizedComplexConceptItem::setCompletelyHandledReducedInstanceTestingConcept(CConcept* concept) {
158 mCompletelyHandledReducedInstanceTestingConcept = concept;
159 return this;
160 }
161
162 CConcept* COptimizedComplexConceptItem::getCompletelyHandledReducedInstanceTestingConcept() {
163 return mCompletelyHandledReducedInstanceTestingConcept;
164 }
165
166 COptimizedComplexConceptItem* COptimizedComplexConceptItem::setCompletelyHandledReducedInstanceTestingConceptNegation(bool negation) {
167 mCompletelyHandledReducedInstanceTestingConceptNegation = negation;
168 return this;
169 }
170
171 bool COptimizedComplexConceptItem::getCompletelyHandledReducedInstanceTestingConceptNegation() {
172 return mCompletelyHandledReducedInstanceTestingConceptNegation;
173 }
174
175
176 COptimizedComplexConceptItem* COptimizedComplexConceptItem::setAllAtomicConceptsCompletelyHandled(bool completelyHandled) {
177 mAllAtomicConceptsCompletelyHandled = completelyHandled;
178 return this;
179 }
180
181 bool COptimizedComplexConceptItem::getAllAtomicConceptsCompletelyHandled() {
182 return mAllAtomicConceptsCompletelyHandled;
183 }
184
185
186 COptimizedComplexConceptItem* COptimizedComplexConceptItem::setCandidateConcept(CConcept* concept) {
187 mCandidateConcept = concept;
188 return this;
189 }
190
191 COptimizedComplexConceptItem* COptimizedComplexConceptItem::setMarkerConcept(CConcept* concept) {
192 mMarkerConcept = concept;
193 return this;
194 }
195
196 COptimizedComplexConceptItem* COptimizedComplexConceptItem::setPropagationConcept(CConcept* concept) {
197 mPropagationConcept = concept;
198 return this;
199 }
200
201 CComplexConceptItemComputationProcess* COptimizedComplexConceptItem::getComputationProcess() {
202 return &mComputationProcess;
203 }
204
205 bool COptimizedComplexConceptItem::isSatisfiable() {
206 return mSatisfiable;
207 }
208
209 COptimizedComplexConceptItem* COptimizedComplexConceptItem::setSatisfiability(bool satisfiable) {
210 mSatisfiable = satisfiable;
211 return this;
212 }
213
214 bool COptimizedComplexConceptItem::isSuperClassComputationInitializing() {
215 return mSuperClassComputationInitializing;
216 }
217
218 COptimizedComplexConceptItem* COptimizedComplexConceptItem::setSuperClassComputationInitializing(bool initialized) {
219 mSuperClassComputationInitializing = initialized;
220 return this;
221 }
222
223
224 COptimizedComplexConceptItem* COptimizedComplexConceptItem::setKnownSuperClassNodeSet(QSet<CHierarchyNode*>* directClassNodeSet) {
225 mKnownSuperClassNodeSet = directClassNodeSet;
226 return this;
227 }
228
229 COptimizedComplexConceptItem* COptimizedComplexConceptItem::setPossibleSuperClassNodeSet(QSet<CHierarchyNode*>* directClassNodeSet) {
230 mPossibleSuperClassNodeSet = directClassNodeSet;
231 return this;
232 }
233
234 COptimizedComplexConceptItem* COptimizedComplexConceptItem::setDirectSuperClassNodeSet(QSet<CHierarchyNode*>* directClassNodeSet) {
235 mDirectSuperClassNodeSet = directClassNodeSet;
236 return this;
237 }
238
239 COptimizedComplexConceptItem* COptimizedComplexConceptItem::setPossibleSuperClassNodeTestingList(QList<CHierarchyNode*>* classNodeList) {
240 mPossibleSuperClassNodeTestingList = classNodeList;
241 return this;
242 }
243
244 QList<CHierarchyNode*>* COptimizedComplexConceptItem::getPossibleSuperClassNodeTestingList() {
245 return mPossibleSuperClassNodeTestingList;
246 }
247
248
249
250 QSet<CHierarchyNode*>* COptimizedComplexConceptItem::getKnownSuperClassNodeSet() {
251 return mKnownSuperClassNodeSet;
252 }
253
254 QSet<CHierarchyNode*>* COptimizedComplexConceptItem::getPossibleSuperClassNodeSet() {
255 return mPossibleSuperClassNodeSet;
256 }
257
258 QSet<CHierarchyNode*>* COptimizedComplexConceptItem::getDirectSuperClassNodeSet() {
259 return mDirectSuperClassNodeSet;
260 }
261
262 CComplexConceptStepComputationProcess* COptimizedComplexConceptItem::setQueuedProcessStep() {
263 return mQueuedProcessStep;
264 }
265
266 bool COptimizedComplexConceptItem::hasQueuedProcessStep() {
267 return mQueuedProcessStep;
268 }
269
270 COptimizedComplexConceptItem* COptimizedComplexConceptItem::setQueuedProcessStep(CComplexConceptStepComputationProcess* queuedProcessStep) {
271 mQueuedProcessStep = queuedProcessStep;
272 return this;
273 }
274
275 QSet<CConcept*>* COptimizedComplexConceptItem::getKnownSuperConceptSet() {
276 return mKnownSuperConceptSet;
277 }
278
279 QSet<CConcept*>* COptimizedComplexConceptItem::getPossibleSuperConceptSet() {
280 return mPossibleSuperConceptSet;
281 }
282
283 COptimizedComplexConceptItem* COptimizedComplexConceptItem::setKnownSuperConceptSet(QSet<CConcept*>* conceptSet) {
284 mKnownSuperConceptSet = conceptSet;
285 return this;
286 }
287
288 COptimizedComplexConceptItem* COptimizedComplexConceptItem::setPossibleSuperConceptSet(QSet<CConcept*>* conceptSet) {
289 mPossibleSuperConceptSet = conceptSet;
290 return this;
291 }
292
293
294
295
296
297
298
299 COptimizedComplexConceptItem* COptimizedComplexConceptItem::setPossibleSubClassTestingNodeSet(QSet<CHierarchyNode*>* directClassNodeSet) {
300 mPossibleSubClassTestingNodeSet = directClassNodeSet;
301 return this;
302 }
303
304 COptimizedComplexConceptItem* COptimizedComplexConceptItem::setDirectSubClassNodeSet(QSet<CHierarchyNode*>* directClassNodeSet) {
305 mDirectSubClassNodeSet = directClassNodeSet;
306 return this;
307 }
308
309 COptimizedComplexConceptItem* COptimizedComplexConceptItem::setPossibleSubClassNodeTestingList(QList<CHierarchyNode*>* classNodeList) {
310 mPossibleSubClassNodeTestingList = classNodeList;
311 return this;
312 }
313
314 QList<CHierarchyNode*>* COptimizedComplexConceptItem::getPossibleSubClassNodeTestingList() {
315 return mPossibleSubClassNodeTestingList;
316 }
317
318
319
320
321 QSet<CHierarchyNode*>* COptimizedComplexConceptItem::getPossibleSubClassTestingNodeSet() {
322 return mPossibleSubClassTestingNodeSet;
323 }
324
325
326 QSet<CHierarchyNode*>* COptimizedComplexConceptItem::getDirectSubClassNodeSet() {
327 return mDirectSubClassNodeSet;
328 }
329
330
331
332 QSet<COptimizedComplexConceptItem*>* COptimizedComplexConceptItem::getSuperComplexConceptItemSet() {
333 return &mSuperComplexConceptItemSet;
334 }
335
336
337 bool COptimizedComplexConceptItem::hasSuperComplexConceptItem(COptimizedComplexConceptItem* item) {
338 return mSuperComplexConceptItemSet.contains(item);
339 }
340
341 bool COptimizedComplexConceptItem::hasSubComplexConceptItem(COptimizedComplexConceptItem* item) {
342 return mSubComplexConceptItemSet.contains(item);
343 }
344
345
346 QSet<COptimizedComplexConceptItem*>* COptimizedComplexConceptItem::getSubComplexConceptItemSet() {
347 return &mSubComplexConceptItemSet;
348 }
349
350
351 QSet<CIndividualReference>* COptimizedComplexConceptItem::getInstancesItemSet() {
352 return mKnownInstanceSet;
353 }
354
355 QSet<TConceptNegPair>* COptimizedComplexConceptItem::getAtomicConcpetSet() {
356 return &mAtomicClassConceptSet;
357 }
358
359 CClassTermExpression* COptimizedComplexConceptItem::getClassTermExpression() {
360 return mClassTermExpression;
361 }
362
363 COptimizedComplexConceptItem* COptimizedComplexConceptItem::setClassTermExpression(CClassTermExpression* classExpression) {
364 mClassTermExpression = classExpression;
365 return this;
366 }
367
368
369
370
371
372
373
374 QSet<CIndividualReference>* COptimizedComplexConceptItem::getPossibleInstanceIndividualSet() {
375 return mPossibleInstanceSet;
376 }
377
378 COptimizedComplexConceptItem* COptimizedComplexConceptItem::setPossibleInstanceIndividualSet(QSet<CIndividualReference>* instanceSet) {
379 mPossibleInstanceSet = instanceSet;
380 return this;
381 }
382
383
384 QSet<CIndividualReference>* COptimizedComplexConceptItem::getKnownInstanceIndividualSet() {
385 return mKnownInstanceSet;
386 }
387
388 COptimizedComplexConceptItem* COptimizedComplexConceptItem::setKnownInstanceIndividualSet(QSet<CIndividualReference>* instanceSet) {
389 mKnownInstanceSet = instanceSet;
390 return this;
391 }
392
393 QSet<CRealizationIndividualInstanceItemReference>* COptimizedComplexConceptItem::getPossibleInstanceItemSet() {
394 return mPossibleInstanceItemSet;
395 }
396
397
398 QSet<CRealizationIndividualInstanceItemReference>::const_iterator COptimizedComplexConceptItem::getPossibleInstanceItemSetCandidatePropagationIterator() {
399 return mPossibleInstanceItemSetCandidatePropagationIterator;
400 }
401
402 COptimizedComplexConceptItem* COptimizedComplexConceptItem::setPossibleInstanceItemSetCandidatePropagationIterator(QSet<CRealizationIndividualInstanceItemReference>::const_iterator it) {
403 mPossibleInstanceItemSetCandidatePropagationIterator = it;
404 return this;
405 }
406
407
408 bool COptimizedComplexConceptItem::hasPossibleInstanceItemSetCandidatePropagationIteratorInitialized() {
409 return mPossibleInstanceItemSetCandidatePropagationIteratorInitialized;
410 }
411
412 COptimizedComplexConceptItem* COptimizedComplexConceptItem::setPossibleInstanceItemSetCandidatePropagationIteratorInitialized(bool initialized) {
413 mPossibleInstanceItemSetCandidatePropagationIteratorInitialized = initialized;
414 return this;
415 }
416
417
418 cint64 COptimizedComplexConceptItem::getPossibleInstanceCandidatePropagationBeginningKnownInstancesCount() {
419 return mPossibleInstanceCandidatePropagationBeginningKnownInstancesCount;
420 }
421
422 COptimizedComplexConceptItem* COptimizedComplexConceptItem::setPossibleInstanceCandidatePropagationBeginningKnownInstancesCount(cint64 count) {
423 mPossibleInstanceCandidatePropagationBeginningKnownInstancesCount = count;
424 return this;
425 }
426
427
428
429 COptimizedComplexConceptInstanziatedIndividualItemHash* COptimizedComplexConceptItem::getKnownInstanceItems() {
430 return mKnownInstanceItems;
431 }
432
433
434 COptimizedComplexConceptItem* COptimizedComplexConceptItem::setKnownInstanceItems(COptimizedComplexConceptInstanziatedIndividualItemHash* instanceItems) {
435 mKnownInstanceItems = instanceItems;
436 return this;
437 }
438
439 COptimizedComplexConceptItem* COptimizedComplexConceptItem::setPossibleInstanceItemSet(QSet<CRealizationIndividualInstanceItemReference>* instanceSet) {
440 mPossibleInstanceItemSet = instanceSet;
441 return this;
442 }
443
444
445 QSet<CRealizationIndividualInstanceItemReference>* COptimizedComplexConceptItem::getPossibleInstanceCandidatePropagationItemSet() {
446 return mPossibleInstanceCandidatePropagationItemSet;
447 }
448
449 COptimizedComplexConceptItem* COptimizedComplexConceptItem::setPossibleInstanceCandidatePropagationItemSet(QSet<CRealizationIndividualInstanceItemReference>* instanceSet) {
450 mPossibleInstanceCandidatePropagationItemSet = instanceSet;
451 return this;
452 }
453
454
455 cint64 COptimizedComplexConceptItem::getPossibleTestedNonInstanceCount() {
456 return mPossibleTestedNonInstanceCount;
457 }
458
459 COptimizedComplexConceptItem* COptimizedComplexConceptItem::incPossibleTestedNonInstanceCount(cint64 incCount) {
460 mPossibleTestedNonInstanceCount += incCount;
461 return this;
462 }
463
464
465 cint64 COptimizedComplexConceptItem::getRealizationRetrievedInstanceCandidateCount() {
466 return mRealizationRetrievedInstanceCandidateCount;
467 }
468
469 COptimizedComplexConceptItem* COptimizedComplexConceptItem::inRealizationRetrievedInstanceCandidateCount(cint64 incCount) {
470 mRealizationRetrievedInstanceCandidateCount += incCount;
471 return this;
472 }
473
474
475 cint64 COptimizedComplexConceptItem::getRealizationRetrievingExpectedInstanceCandidateCount() {
476 return mRealizationRetrievingExpectedInstanceCandidateCount;
477 }
478
479 COptimizedComplexConceptItem* COptimizedComplexConceptItem::setRealizationRetrievingExpectedInstanceCandidateCount(cint64 count) {
480 mRealizationRetrievingExpectedInstanceCandidateCount = count;
481 return this;
482 }
483
484
485
486
487 double COptimizedComplexConceptItem::getRealizationIteratorSamplingExpectedCount() {
488 return mRealizationIteratorSamplingExpectedCount;
489 }
490
491
492 COptimizedComplexConceptItem* COptimizedComplexConceptItem::setRealizationIteratorSamplingExpectedCount(double expectedCount) {
493 mRealizationIteratorSamplingExpectedCount = expectedCount;
494 return this;
495 }
496
497
498
499
500 COptimizedComplexConceptItem* COptimizedComplexConceptItem::setMaximumSubClassNodeSet(QSet<CHierarchyNode*>* maxSubClassNodeSet) {
501 mMaximumSubClassNodeSet = maxSubClassNodeSet;
502 return this;
503 }
504
505
506 QSet<CHierarchyNode*>* COptimizedComplexConceptItem::getMaximumSubClassNodeSet() {
507 return mMaximumSubClassNodeSet;
508 }
509
510
511 bool COptimizedComplexConceptItem::isLazyRealizationInitializationRequested() {
512 return mLazyRealizationInitializationRequested;
513 }
514
515 COptimizedComplexConceptItem* COptimizedComplexConceptItem::setLazyRealizationInitializationRequested(bool requested) {
516 mLazyRealizationInitializationRequested = requested;
517 return this;
518 }
519
520
521 bool COptimizedComplexConceptItem::isLazyRealizationInitialized() {
522 return mLazyRealizationInitialized;
523 }
524
525 COptimizedComplexConceptItem* COptimizedComplexConceptItem::setLazyRealizationInitialized(bool requested) {
526 mLazyRealizationInitialized = requested;
527 return this;
528 }
529
530 bool COptimizedComplexConceptItem::isLazyNeighbourRealizationPruningRequired() {
531 return mLazyNeighbourRealizationPruningRequired;
532 }
533
534 COptimizedComplexConceptItem* COptimizedComplexConceptItem::setLazyNeighbourRealizationPruningRequired(bool requested) {
535 mLazyNeighbourRealizationPruningRequired = requested;
536 return this;
537 }
538
539 bool COptimizedComplexConceptItem::isLazyNeighbourRealizationRequested() {
540 return mLazyNeighbourRealizationRequested;
541 }
542
543 COptimizedComplexConceptItem* COptimizedComplexConceptItem::setLazyNeighbourRealizationRequested(bool requested) {
544 mLazyNeighbourRealizationRequested = requested;
545 return this;
546 }
547
548 bool COptimizedComplexConceptItem::isLazyRealizationInstancesRetrieved() {
549 return mLazyRealizationInstancesRetrieved;
550 }
551
552 COptimizedComplexConceptItem* COptimizedComplexConceptItem::setLazyRealizationInstancesRetrieved(bool retrieved) {
553 mLazyRealizationInstancesRetrieved = retrieved;
554 return this;
555 }
556
557
558
559
560 bool COptimizedComplexConceptItem::isCompletelyHandledChecked() {
561 return mCompletelyHandledChecked;
562 }
563
564 COptimizedComplexConceptItem* COptimizedComplexConceptItem::setCompletelyHandledChecked(bool checked) {
565 mCompletelyHandledChecked = checked;
566 return this;
567 }
568
569
570 bool COptimizedComplexConceptItem::isLazyRealizationProcessing() {
571 return mLazyRealizationProcessingCount != 0;
572 }
573
574 cint64 COptimizedComplexConceptItem::getLazyRealizationProcessingCount() {
575 return mLazyRealizationProcessingCount;
576 }
577
578 COptimizedComplexConceptItem* COptimizedComplexConceptItem::incLazyRealizationProcessingCount(cint64 incCount) {
579 mLazyRealizationProcessingCount += incCount;
580 return this;
581 }
582
583 COptimizedComplexConceptItem* COptimizedComplexConceptItem::decLazyRealizationProcessingCount(cint64 decCount) {
584 mLazyRealizationProcessingCount -= decCount;
585 return this;
586 }
587
588
589 COptimizedComplexVariableConceptBaseItem* COptimizedComplexConceptItem::getVariableConceptBaseItem() {
590 return mVarConBaseItem;
591 }
592
593 COptimizedComplexConceptItem* COptimizedComplexConceptItem::setVariableConceptBaseItem(COptimizedComplexVariableConceptBaseItem* baseItem) {
594 mVarConBaseItem = baseItem;
595 return this;
596 }
597
598
599 COptimizedComplexVariableConceptSubSuperItem* COptimizedComplexConceptItem::getVariableConceptSuperClassesItem() {
600 return mVarConSuperClassesItem;
601 }
602
603 COptimizedComplexConceptItem* COptimizedComplexConceptItem::setVariableConceptSuperClassesItem(COptimizedComplexVariableConceptSubSuperItem* superItem) {
604 mVarConSuperClassesItem = superItem;
605 return this;
606 }
607
608
609
610 COptimizedComplexVariableConceptSubSuperItem* COptimizedComplexConceptItem::getVariableConceptSubClassesItem() {
611 return mVarConSubClassesItem;
612 }
613
614 COptimizedComplexConceptItem* COptimizedComplexConceptItem::setVariableConceptSubClassesItem(COptimizedComplexVariableConceptSubSuperItem* superItem) {
615 mVarConSubClassesItem = superItem;
616 return this;
617 }
618
619
620
621 COptimizedComplexVariableConceptSubSuperItem* COptimizedComplexConceptItem::getVariableConceptSuperSubClassesItem(bool superClasses) {
622 if (superClasses) {
623 return mVarConSuperClassesItem;
624 } else {
625 return mVarConSubClassesItem;
626 }
627 }
628
629 COptimizedComplexConceptItem* COptimizedComplexConceptItem::setVariableConceptSuperSubClassesItem(COptimizedComplexVariableConceptSubSuperItem* item, bool superClasses) {
630 if (superClasses) {
631 mVarConSuperClassesItem = item;
632 } else {
633 mVarConSubClassesItem = item;
634 }
635 return this;
636 }
637
638
639
640
641 bool COptimizedComplexConceptItem::isConceptAbsorbed() {
642 return mConceptAbsorbed;
643 }
644
645 COptimizedComplexConceptItem* COptimizedComplexConceptItem::setConceptAbsorbed(bool absorbed) {
646 mConceptAbsorbed = absorbed;
647 return this;
648 }
649
650
651
652 bool COptimizedComplexConceptItem::isCandidatePropagated() {
653 return mCandidatePropagated;
654 }
655
656 COptimizedComplexConceptItem* COptimizedComplexConceptItem::setCandidatePropagated(bool hasCandidate) {
657 mCandidatePropagated = hasCandidate;
658 return this;
659 }
660
661
662
663 bool COptimizedComplexConceptItem::isCandidateReceived() {
664 return mCandidateReceived;
665 }
666
667 COptimizedComplexConceptItem* COptimizedComplexConceptItem::setCandidateReceived(bool hasCandidate) {
668 mCandidateReceived = hasCandidate;
669 return this;
670 }
671
672
673 bool COptimizedComplexConceptItem::isCandidatePropagationProcessing() {
674 return mCandidatePropagationProcessingCount != 0;
675 }
676
677 cint64 COptimizedComplexConceptItem::getCandidatePropagationProcessingCount() {
678 return mCandidatePropagationProcessingCount;
679 }
680
681 COptimizedComplexConceptItem* COptimizedComplexConceptItem::incCandidatePropagationProcessingCount(cint64 incCount) {
682 mCandidatePropagationProcessingCount += incCount;
683 return this;
684 }
685
686 COptimizedComplexConceptItem* COptimizedComplexConceptItem::decCandidatePropagationProcessingCount(cint64 decCount) {
687 mCandidatePropagationProcessingCount -= decCount;
688 return this;
689 }
690
691
692 bool COptimizedComplexConceptItem::isTopObjectPropertyUsed() {
693 return mTopObjectPropertyUsed;
694 }
695
696 COptimizedComplexConceptItem* COptimizedComplexConceptItem::setTopObjectPropertyUsage(bool topObjectPropertyUsed) {
697 mTopObjectPropertyUsed = topObjectPropertyUsed;
698 return this;
699 }
700
701 CRealizationIndividualInstanceItemReferenceIterator* COptimizedComplexConceptItem::getRealizationIterator() {
702 return mRealizationIterator;
703 }
704
705 COptimizedComplexConceptItem* COptimizedComplexConceptItem::setRealizationIterator(CRealizationIndividualInstanceItemReferenceIterator* realizationIterator) {
706 mRealizationIterator = realizationIterator;
707 return this;
708 }
709
710 CRequirementWaitingDependencyData* COptimizedComplexConceptItem::getInstancesComputationRequirements() {
711 return &mInstancesComputationRequirments;
712 }
713
714 cint64 COptimizedComplexConceptItem::getConceptItemId() {
715 return mConceptItemId;
716 }
717
718 COptimizedComplexConceptItem* COptimizedComplexConceptItem::setConceptItemId(cint64 id) {
719 mConceptItemId = id;
720 return this;
721 }
722
723 cint64 COptimizedComplexConceptItem::getLastRetrievedCertainInstanceItemCount() {
724 return mLastRetrievingCertainInstanceItemCount;
725 }
726
727 COptimizedComplexConceptItem* COptimizedComplexConceptItem::setLastRetrievedCertainInstanceItemCount(cint64 certainCount) {
728 mLastRetrievingCertainInstanceItemCount = certainCount;
729 return this;
730 }
731
732
733 double COptimizedComplexConceptItem::getMinimalRetrievingInstanceItemSize() {
734 return mMinimalRetrievingInstanceItemSize;
735 }
736
737 COptimizedComplexConceptItem* COptimizedComplexConceptItem::setMinimalRetrievingInstanceItemSize(double newSize) {
738 mMinimalRetrievingInstanceItemSize = newSize;
739 return this;
740 }
741
742
743
744 cint64 COptimizedComplexConceptItem::getLastConceptInstancesCacheReportedCount() {
745 return mLastConceptInstancesCacheReportedCount;
746 }
747
748 cint64 COptimizedComplexConceptItem::getLastConceptInstancesCacheReportedSize() {
749 return mLastConceptInstancesCacheReportedSize;
750 }
751
752 COptimizedComplexConceptItem* COptimizedComplexConceptItem::setLastConceptInstancesCacheReportedCount(cint64 count) {
753 mLastConceptInstancesCacheReportedCount = count;
754 return this;
755 }
756
757 COptimizedComplexConceptItem* COptimizedComplexConceptItem::setLastConceptInstancesCacheReportedSize(cint64 size) {
758 mLastConceptInstancesCacheReportedSize = size;
759 return this;
760 }
761
762
763
764
765
766 cint64 COptimizedComplexConceptItem::getMemoryConsumption() {
767 cint64 memoryConsumption = 0;
768 if (mKnownInstanceItems) {
769 memoryConsumption += mKnownInstanceItems->getMemoryConsumption();
770 }
771 if (mPossibleInstanceCandidatePropagationItemSet) {
772 cint64 bucketSize = sizeof(void*) + sizeof(uint);
773 cint64 itemSize = sizeof(CRealizationIndividualInstanceItemReference);
774 memoryConsumption += bucketSize * mPossibleInstanceCandidatePropagationItemSet->capacity();
775 memoryConsumption += itemSize * mPossibleInstanceCandidatePropagationItemSet->size();
776 }
777 if (mPossibleInstanceSet) {
778 cint64 bucketSize = sizeof(void*) + sizeof(uint);
779 cint64 itemSize = sizeof(CIndividualReference);
780 memoryConsumption += bucketSize * mPossibleInstanceSet->capacity();
781 memoryConsumption += itemSize * mPossibleInstanceSet->size();
782 }
783 if (mKnownInstanceSet) {
784 cint64 bucketSize = sizeof(void*) + sizeof(uint);
785 cint64 itemSize = sizeof(CIndividualReference);
786 memoryConsumption += bucketSize * mKnownInstanceSet->capacity();
787 memoryConsumption += itemSize * mKnownInstanceSet->size();
788 }
789 return memoryConsumption;
790 }
791
792
793
794
795 bool COptimizedComplexConceptItem::clearComputation() {
796 CCacheAnswersWeightedUsageCostItem::clearComputation();
797
798
799 CComplexConceptStepInstanceComputationProcess* instanceCompStep = getComputationProcess()->getInstancesComputationProcess(true);
800 instanceCompStep->clearComputedInstancesCount();
801
802
803 if (mKnownInstanceSet) {
804 delete mKnownInstanceSet;
805 mKnownInstanceSet = nullptr;
806 }
807 if (mPossibleInstanceSet) {
808 delete mPossibleInstanceSet;
809 mPossibleInstanceSet = nullptr;
810 }
811 if (mPossibleInstanceItemSet) {
812 delete mPossibleInstanceItemSet;
813 mPossibleInstanceItemSet = nullptr;
814 }
815 if (mPossibleInstanceCandidatePropagationItemSet) {
816 delete mPossibleInstanceCandidatePropagationItemSet;
817 mPossibleInstanceCandidatePropagationItemSet = nullptr;
818 }
819 mPossibleInstanceItemSetCandidatePropagationIteratorInitialized = false;
820 mPossibleInstanceCandidatePropagationBeginningKnownInstancesCount = 0;
821 mPossibleTestedNonInstanceCount = 0;
822 mRealizationRetrievedInstanceCandidateCount = 0;
823 mRealizationRetrievingExpectedInstanceCandidateCount = 0;
824 mRealizationIteratorSamplingExpectedCount = 0;
825
826
827 mLazyRealizationInitialized = false;
828 mLazyRealizationInitializationRequested = false;
829 mLazyNeighbourRealizationPruningRequired = false;
830 mLazyNeighbourRealizationRequested = false;
831 mLazyRealizationInstancesRetrieved = false;
832 mCompletelyHandledChecked = false;
833 mLazyRealizationProcessingCount = 0;
834
835 mCandidatePropagationProcessingCount = 0;
836 mCandidatePropagated = false;
837 mCandidateReceived = false;
838
839 if (mRealizationIterator) {
840 delete mRealizationIterator;
841 mRealizationIterator = nullptr;
842 }
843
844 mLastRetrievingCertainInstanceItemCount = 0;
845 mMinimalRetrievingInstanceItemSize = 0.1;
846
847 if (mKnownInstanceItems) {
848 delete mKnownInstanceItems;
849 mKnownInstanceItems = nullptr;
850 }
851
852
853 return true;
854 }
855
856 }; // end namespace Answerer
857
858 }; // end namespace Reasoner
859
860 }; // end namespace Konclude