Debian Codegraph @

Source/Reasoner/Realizer/COptimizedRepresentativeKPSetCacheLabelItemIterator.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 "COptimizedRepresentativeKPSetCacheLabelItemIterator.h"
22
23
24 namespace Konclude {
25
26 namespace Reasoner {
27
28 namespace Realizer {
29
30
31 bool operator<(const COptimizedRepresentativeKPSetCacheLabelItemIterator::CAssociationMapIteratorKey& key1, const COptimizedRepresentativeKPSetCacheLabelItemIterator::CAssociationMapIteratorKey& key2) {
32 if (key1.mIndiId != key2.mIndiId) {
33 return key1.mIndiId < key2.mIndiId;
34 }
35 if (key1.mPossibleInstance != key2.mPossibleInstance) {
36 return !key1.mPossibleInstance;
37 }
38 return false;
39 }
40
41 COptimizedRepresentativeKPSetCacheLabelItemIterator::COptimizedRepresentativeKPSetCacheLabelItemIterator(const QList<CBackendRepresentativeMemoryLabelCacheItem*>& labelCacheItemKnownInstancesList, const QList<CBackendRepresentativeMemoryLabelCacheItem*>& labelCacheItemPossibleInstancesList,
42 COptimizedKPSetIndividualInstantiatedItemMultiHash* individualInstantiatedItemHash, CIndividualVector* individualVector, const CRealizationIndividualSorting& sorting, const CRealizationIndividualInstanceItemReference& indiInstItemRefCursor, bool moveOverCursor) {
43
44 mLabelCacheItemKnwonInstancesList = labelCacheItemKnownInstancesList;
45 mLabelCacheItemPossibleInstancesList = labelCacheItemPossibleInstancesList;
46 mIndividualInstantiatedItemHash = individualInstantiatedItemHash;
47
48 mIndiInstItemRefCursor = indiInstItemRefCursor;
49 mPreventSameIndisMultipleOccurences = false;
50 mMoveOverCursor = moveOverCursor;
51
52 mAverageIterationIncrementSize = 1;
53 mIterationCount = 0;
54 mLastIndiId = -1;
55
56 mAssociatedIndiPossibleCount = 0;
57 mAssociatedIndiTotalCount = 0;
58 mAssociatedIndiPossibleVisistedCount = 0;
59 mAssociatedIndiPossibleConfirmedCount = 0;
60
61 mSorting = sorting;
62 mIterateAscending = mSorting.getOrder() != CRealizationIndividualSorting::SORT_ORDER_DESCENDING;
63 mConsiderSameMergedIndis = mSorting.getGrouping() != CRealizationIndividualSorting::SORT_GROUP_SAME_UNIQUE || mSorting.getType() != CRealizationIndividualSorting::SORT_TYPE_INDIVIDUAL_ID;
64
65 mCurrentIteratorData = nullptr;
66 mIndividualVector = individualVector;
67
68 mAllowPossibleInstances = false;
69 }
70
71
72 CRealizationIndividualInstanceItemReferenceIterator* COptimizedRepresentativeKPSetCacheLabelItemIterator::init() {
73 mInitializationRequired = false;
74 mCurrentIteratorData = nullptr;
75 mFirstIteratorIndiId = -1;
76
77 for (CBackendRepresentativeMemoryLabelCacheItem* cacheLabelItem : mLabelCacheItemKnwonInstancesList) {
78 createIndividualAssociationsIteratorData(cacheLabelItem, false, mIndiInstItemRefCursor, mMoveOverCursor);
79 }
80 for (CBackendRepresentativeMemoryLabelCacheItem* cacheLabelItem : mLabelCacheItemPossibleInstancesList) {
81 createIndividualAssociationsIteratorData(cacheLabelItem, true, mIndiInstItemRefCursor, mMoveOverCursor);
82 }
83
84 moveNext();
85 return this;
86 }
87
88 COptimizedRepresentativeKPSetCacheLabelItemIterator::~COptimizedRepresentativeKPSetCacheLabelItemIterator() {
89 qDeleteAll(mIteratorDataContainer);
90 }
91
92
93
94 COptimizedRepresentativeKPSetCacheLabelItemIterator::CAssociationMapIteratorData* COptimizedRepresentativeKPSetCacheLabelItemIterator::createAssociationMapIteratorData(CBackendRepresentativeMemoryLabelCacheItem* labelItem, const CBackendRepresentativeMemoryLabelCacheItemIndividualAssociationMapIterator& iterator, bool possibleInstances) {
95 return new CAssociationMapIteratorData(labelItem, iterator, possibleInstances);
96 }
97
98
99 CRealizationIndividualInstanceItemReference COptimizedRepresentativeKPSetCacheLabelItemIterator::getIndividualInstanceItemReferenceCursor() {
100 return mIndiInstItemRefCursor;
101 }
102
103 bool COptimizedRepresentativeKPSetCacheLabelItemIterator::hasMoveOverCursor() {
104 return mMoveOverCursor;
105 }
106
107
108
109 QList<CBackendRepresentativeMemoryLabelCacheItem*>* COptimizedRepresentativeKPSetCacheLabelItemIterator::getKnownInstancesLabelCacheItemList() {
110 return &mLabelCacheItemKnwonInstancesList;
111 }
112
113 QList<CBackendRepresentativeMemoryLabelCacheItem*>* COptimizedRepresentativeKPSetCacheLabelItemIterator::getPossibleInstancesLabelCacheItemList() {
114 return &mLabelCacheItemPossibleInstancesList;
115 }
116
117
118
119 bool COptimizedRepresentativeKPSetCacheLabelItemIterator::requiresInitialization() {
120 return mInitializationRequired;
121 }
122
123 bool COptimizedRepresentativeKPSetCacheLabelItemIterator::begin() {
124 if (mInitializationRequired) {
125 mInitializationRequired = false;
126
127 ++mCheckingInitializationRequiredId;
128
129 QList<CAssociationMapIteratorData*> tmpUninitializedList(mUninitializedList);
130 mUninitializedList.clear();
131 while (!tmpUninitializedList.isEmpty()) {
132 CAssociationMapIteratorData* iteratorData = tmpUninitializedList.takeFirst();
133 moveToValidPosition(iteratorData);
134 iteratorData->mLastCheckedInitializationRequiredId = mCheckingInitializationRequiredId;
135 cint64 itIndiId = iteratorData->mIterator.currentAssociatedIndividualId();
136 if (itIndiId != -1) {
137 mCurrentIndiIdIterationDataMap.insertMulti((itIndiId, iteratorData), iteratorData);
138 } else if (iteratorData->mInitializationRequired && !iteratorData->mIterator.atEnd()) {
139 mUninitializedList.append(iteratorData);
140 mInitializationRequired = true;
141 }
142 }
143
144
145 if (mCurrentIteratorData) {
146 moveToValidPosition(mCurrentIteratorData);
147 mCurrentIteratorData->mLastCheckedInitializationRequiredId = mCheckingInitializationRequiredId;
148 cint64 itIndiId = mCurrentIteratorData->mIterator.currentAssociatedIndividualId();
149 if (itIndiId != -1) {
150 mCurrentIndiIdIterationDataMap.insertMulti(CAssociationMapIteratorKey(itIndiId, mCurrentIteratorData->mPossibleInstances), mCurrentIteratorData);
151 } else if (mCurrentIteratorData->mInitializationRequired && !mCurrentIteratorData->mIterator.atEnd()) {
152 mUninitializedList.append(mCurrentIteratorData);
153 mInitializationRequired = true;
154 }
155 mCurrentIteratorData = nullptr;
156 }
157
158 if (!mInitializationRequired) {
159 moveNext();
160 }
161 }
162 return !mInitializationRequired;
163 }
164
165
166
167 COptimizedRepresentativeKPSetCacheLabelItemIterator::CAssociationMapIteratorData* COptimizedRepresentativeKPSetCacheLabelItemIterator::createIndividualAssociationsIteratorData(CBackendRepresentativeMemoryLabelCacheItem* labelItem, bool possibleInstances, const CRealizationIndividualInstanceItemReference& indiInstItemRefCursor, bool moveOverCursor) {
168 CBackendRepresentativeMemoryLabelCacheItemIndividualAssociationMapExtensionData* extensionData = (CBackendRepresentativeMemoryLabelCacheItemIndividualAssociationMapExtensionData*)labelItem->getExtensionData(CBackendRepresentativeMemoryLabelCacheItemIndividualAssociationMapExtensionData::INDIVIDUAL_ASSOCIATION_MAP);
169 if (extensionData) {
170 mAssociatedIndiTotalCount += extensionData->getIndividualIdAssociationCount();
171 if (possibleInstances) {
172 mAssociatedIndiPossibleCount += extensionData->getIndividualIdAssociationCount();
173 }
174 CAssociationMapIteratorData* iteratorData = nullptr;
175 if (indiInstItemRefCursor.isNonEmpty()) {
176 iteratorData = createAssociationMapIteratorData(labelItem, extensionData->getIterator(indiInstItemRefCursor.getIndividualID(), moveOverCursor, mIterateAscending, true, mConsiderSameMergedIndis), possibleInstances);
177 } else {
178 iteratorData = createAssociationMapIteratorData(labelItem, extensionData->getIterator(mIterateAscending, true, mConsiderSameMergedIndis), possibleInstances);
179 }
180 mIteratorDataContainer.append(iteratorData);
181 if (!iteratorData->mIterator.atEnd()) {
182 cint64 itIndiId = iteratorData->mIterator.currentAssociatedIndividualId();
183 if (itIndiId == -1 || mCurrentIndiIdIterationDataMap.isEmpty() || !possibleInstances) {
184 iteratorData->mLastCheckedInitializationRequiredId = mCheckingInitializationRequiredId;
185 moveToValidPosition(iteratorData);
186 itIndiId = iteratorData->mIterator.currentAssociatedIndividualId();
187 if (itIndiId != -1) {
188 mCurrentIndiIdIterationDataMap.insertMulti((itIndiId, iteratorData), iteratorData);
189 } else if (iteratorData->mInitializationRequired && !iteratorData->mIterator.atEnd()) {
190 mUninitializedList.append(iteratorData);
191 mInitializationRequired = true;
192 }
193 } else {
194 mCurrentIndiIdIterationDataMap.insertMulti((itIndiId, iteratorData), iteratorData);
195 iteratorData->mInitializationRequired = true;
196 }
197 }
198 return iteratorData;
199 }
200 return nullptr;
201 }
202
203
204
205 COptimizedRepresentativeKPSetCacheLabelItemIterator::CAssociationMapIteratorData* COptimizedRepresentativeKPSetCacheLabelItemIterator::updateIndividualAssociationsIteratorData(CAssociationMapIteratorData* associationIteratorData, const CRealizationIndividualInstanceItemReference& indiInstItemRefCursor, bool moveOverCursor) {
206 CBackendRepresentativeMemoryLabelCacheItemIndividualAssociationMapExtensionData* extensionData = (CBackendRepresentativeMemoryLabelCacheItemIndividualAssociationMapExtensionData*)associationIteratorData->mLabelItem->getExtensionData(CBackendRepresentativeMemoryLabelCacheItemIndividualAssociationMapExtensionData::INDIVIDUAL_ASSOCIATION_MAP);
207 if (extensionData) {
208 associationIteratorData->mIterator = extensionData->getIterator(indiInstItemRefCursor.getIndividualID(), moveOverCursor, mIterateAscending, true, mConsiderSameMergedIndis);
209 clearInstanceIndividualAssociationsIteratorData(associationIteratorData);
210 if (!associationIteratorData->mIterator.atEnd()) {
211 moveToValidPosition(associationIteratorData);
212 cint64 itIndiId = associationIteratorData->mIterator.currentAssociatedIndividualId();
213 if (itIndiId != -1) {
214 mCurrentIndiIdIterationDataMap.insertMulti(CAssociationMapIteratorKey(itIndiId, associationIteratorData->mPossibleInstances), associationIteratorData);
215 } else if (associationIteratorData->mInitializationRequired && !associationIteratorData->mIterator.atEnd()) {
216 mUninitializedList.append(associationIteratorData);
217 mInitializationRequired = true;
218 }
219 }
220 }
221 return associationIteratorData;
222 }
223
224
225
226 bool COptimizedRepresentativeKPSetCacheLabelItemIterator::isValidIteratorPosition(CAssociationMapIteratorData* iteratorData, cint64 indiId) {
227 ++mAssociatedIndiPossibleVisistedCount;
228 ++mAssociatedIndiPossibleConfirmedCount;
229 return true;
230 }
231
232
233 void COptimizedRepresentativeKPSetCacheLabelItemIterator::clearInstanceIndividualAssociationsIteratorData(CAssociationMapIteratorData* associationIteratorData) {
234 associationIteratorData->mCurrentIndiRealizationItem = nullptr;
235 associationIteratorData->mCurrentInstanceOnlyPossible = false;
236 associationIteratorData->mIndividual = nullptr;
237 associationIteratorData->mAdditionalData = nullptr;
238 }
239
240 bool COptimizedRepresentativeKPSetCacheLabelItemIterator::loadInstanceIndividualAssociationsIteratorData(CAssociationMapIteratorData* associationIteratorData) {
241 cint64 indiId = associationIteratorData->mIterator.currentAssociatedIndividualId();
242 if (!associationIteratorData->mCurrentIndiRealizationItem) {
243 associationIteratorData->mCurrentIndiRealizationItem = mIndividualInstantiatedItemHash->getIndividualInstantiatedItem(indiId);
244 }
245 if (mIndividualVector && !associationIteratorData->mIndividual) {
246 associationIteratorData->mIndividual = mIndividualVector->getData(indiId);
247 }
248
249 return false;
250 }
251
252
253
254 bool COptimizedRepresentativeKPSetCacheLabelItemIterator::moveToValidPosition(CAssociationMapIteratorData* iteratorData) {
255 if (iteratorData->mIterator.atEnd()) {
256 return false;
257 }
258 clearInstanceIndividualAssociationsIteratorData(iteratorData);
259 if (iteratorData->mPossibleInstances || !mConsiderSameMergedIndis) {
260 bool foundNext = false;
261 while (!iteratorData->mIterator.atEnd() && !foundNext) {
262
263 iteratorData->mInitializationRequired = loadInstanceIndividualAssociationsIteratorData(iteratorData);
264 if (iteratorData->mInitializationRequired) {
265 return false;
266 }
267
268 cint64 indiId = iteratorData->mIterator.currentAssociatedIndividualId();
269 iteratorData->mCurrentInstanceOnlyPossible = false;
270 foundNext = isValidIteratorPosition(iteratorData, indiId);
271
272 if (!foundNext && iteratorData->mInitializationRequired) {
273 return false;
274 }
275
276 if (!foundNext) {
277 iteratorData->mIterator.moveNext();
278 clearInstanceIndividualAssociationsIteratorData(iteratorData);
279 }
280 }
281 if (foundNext) {
282 return true;
283 }
284
285 } else {
286 // TODO: avoid individual item hash lookup with separate possible item individual associations
287 loadInstanceIndividualAssociationsIteratorData(iteratorData);
288 return true;
289 }
290 return false;
291 }
292
293
294
295 COptimizedRepresentativeKPSetCacheLabelItemIterator::CAssociationMapIteratorData* COptimizedRepresentativeKPSetCacheLabelItemIterator::getNextIteratorDataFromMap() {
296 CAssociationMapIteratorData* iterationData = nullptr;
297 while (!iterationData && !mCurrentIndiIdIterationDataMap.isEmpty()) {
298 if (mIterateAscending) {
299 QMap<CAssociationMapIteratorKey, CAssociationMapIteratorData*>::iterator it = mCurrentIndiIdIterationDataMap.begin();
300 iterationData = *it;
301 mCurrentIndiIdIterationDataMap.erase(it);
302 } else {
303 QMap<CAssociationMapIteratorKey, CAssociationMapIteratorData*>::iterator it = mCurrentIndiIdIterationDataMap.end();
304 --it;
305 iterationData = *it;
306 mCurrentIndiIdIterationDataMap.erase(it);
307 }
308
309
310 if (iterationData && iterationData->mInitializationRequired) {
311
312 cint64 prevIndiId = iterationData->mIterator.currentAssociatedIndividualId();
313 if (iterationData->mLastCheckedInitializationRequiredId <= mCheckingInitializationRequiredId) {
314 moveToValidPosition(iterationData);
315 iterationData->mLastCheckedInitializationRequiredId = mCheckingInitializationRequiredId;
316 }
317
318 if (iterationData->mIterator.atEnd()) {
319 iterationData = nullptr;
320 } else {
321 cint64 newIndiId = iterationData->mIterator.currentAssociatedIndividualId();
322 if (prevIndiId != newIndiId) {
323 if (mIterateAscending) {
324 QMap<CAssociationMapIteratorKey, CAssociationMapIteratorData*>::const_iterator it = mCurrentIndiIdIterationDataMap.constBegin();
325 if (it.key().mIndiId < newIndiId) {
326 mCurrentIndiIdIterationDataMap.insertMulti(CAssociationMapIteratorKey(newIndiId, iterationData->mPossibleInstances), iterationData);
327 iterationData = nullptr;
328 }
329 } else {
330 QMap<CAssociationMapIteratorKey, CAssociationMapIteratorData*>::const_iterator it = mCurrentIndiIdIterationDataMap.constEnd();
331 --it;
332 if (it.key().mIndiId > newIndiId) {
333 mCurrentIndiIdIterationDataMap.insertMulti(CAssociationMapIteratorKey(newIndiId, iterationData->mPossibleInstances), iterationData);
334 iterationData = nullptr;
335 }
336 }
337 }
338 }
339
340 }
341 }
342 return iterationData;
343 }
344
345
346 bool COptimizedRepresentativeKPSetCacheLabelItemIterator::moveNext() {
347 do {
348 if (mCurrentIteratorData) {
349 mInitializationRequired = false;
350 bool sucessfullyMovedToValidPosition = true;
351 do {
352 mCurrentIteratorData->mIterator.moveNext();
353 sucessfullyMovedToValidPosition = moveToValidPosition(mCurrentIteratorData);
354 } while (mPreventSameIndisMultipleOccurences && !mCurrentIteratorData->mIterator.atEnd() && mCurrentIteratorData->mIterator.currentAssociatedIndividualId() == mLastIndiId);
355
356 if (mCurrentIteratorData->mIterator.atEnd()) {
357 mCurrentIteratorData = nullptr;
358 }
359
360
361 if (mCurrentIteratorData && mSorting.getType() == CRealizationIndividualSorting::SORT_TYPE_INDIVIDUAL_ID && !mCurrentIndiIdIterationDataMap.isEmpty()) {
362 cint64 currentIndiId = mCurrentIteratorData->mIterator.currentAssociatedIndividualId();
363 if (mIterateAscending) {
364 QMap<CAssociationMapIteratorKey, CAssociationMapIteratorData*>::const_iterator it = mCurrentIndiIdIterationDataMap.constBegin();
365 if (it.key().mIndiId < currentIndiId) {
366 mCurrentIndiIdIterationDataMap.insertMulti(CAssociationMapIteratorKey(currentIndiId, mCurrentIteratorData->mPossibleInstances), mCurrentIteratorData);
367 mCurrentIteratorData = nullptr;
368 }
369 } else {
370 QMap<CAssociationMapIteratorKey, CAssociationMapIteratorData*>::const_iterator it = mCurrentIndiIdIterationDataMap.constEnd();
371 --it;
372 if (it.key().mIndiId > currentIndiId) {
373 mCurrentIndiIdIterationDataMap.insertMulti(CAssociationMapIteratorKey(currentIndiId, mCurrentIteratorData->mPossibleInstances), mCurrentIteratorData);
374 mCurrentIteratorData = nullptr;
375 }
376 }
377 }
378
379 if (mCurrentIteratorData && !sucessfullyMovedToValidPosition) {
380 if (mCurrentIteratorData->mInitializationRequired) {
381 mInitializationRequired = true;
382 return false;
383 } else {
384 mCurrentIteratorData = nullptr;
385 }
386 }
387 }
388 if (!mCurrentIteratorData) {
389 if (!mUninitializedList.isEmpty()) {
390 mInitializationRequired = true;
391 } else {
392 mCurrentIteratorData = getNextIteratorDataFromMap();
393 }
394 }
395 } while (mCurrentIteratorData && mPreventSameIndisMultipleOccurences && mLastIndiId == currentIndividualInstanceItemReference().getIndividualID());
396
397 if (mCurrentIteratorData && mCurrentIteratorData->mInitializationRequired) {
398 mInitializationRequired = true;
399 }
400
401 if (!mInitializationRequired) {
402 if (mCurrentIteratorData) {
403 if (mFirstIteratorIndiId == -1) {
404 mFirstIteratorIndiId = currentIndividualInstanceItemReference().getIndividualID();
405 }
406
407 if (mLastIndiId >= 0) {
408 mAverageIterationIncrementSize = (mAverageIterationIncrementSize * mIterationCount + getDifference(currentIndividualInstanceItemReference().getIndividualID(), mLastIndiId)) / (mIterationCount + 1);
409 mIterationCount++;
410 }
411
412 mLastIndiId = currentIndividualInstanceItemReference().getIndividualID();
413 } else {
414 mLastIndiId = -1;
415 }
416 }
417
418 return mCurrentIteratorData != nullptr && !mInitializationRequired;
419 }
420
421
422 cint64 COptimizedRepresentativeKPSetCacheLabelItemIterator::getDifference(cint64 number1, cint64 number2) {
423 if (number1 > number2) {
424 return qAbs(number2 - number1);
425 } else {
426 return qAbs(number1 - number2);
427 }
428 }
429
430
431 bool COptimizedRepresentativeKPSetCacheLabelItemIterator::moveTo(const CRealizationIndividualInstanceItemReference& indiInstItemRef, bool moveOver) {
432
433 function<bool(CAssociationMapIteratorData* iteratorData)> reachedCursorCheckFunc = [&](CAssociationMapIteratorData* iteratorData)->bool {
434 if (moveOver) {
435 return (mIterateAscending && iteratorData->mIterator.currentAssociatedIndividualId() > indiInstItemRef.getIndividualID()) || (!mIterateAscending && iteratorData->mIterator.currentAssociatedIndividualId() < indiInstItemRef.getIndividualID());
436 } else {
437 return (mIterateAscending && iteratorData->mIterator.currentAssociatedIndividualId() >= indiInstItemRef.getIndividualID()) || (!mIterateAscending && iteratorData->mIterator.currentAssociatedIndividualId() <= indiInstItemRef.getIndividualID());
438 }
439 };
440
441 if (atEnd() || reachedCursorCheckFunc(mCurrentIteratorData)) {
442 return !atEnd();
443 } else {
444
445 cint64 diff = getDifference(currentIndividualInstanceItemReference().getIndividualID(), indiInstItemRef.getIndividualID());
446 double estimatedRequiredIterations = diff / (double)mAverageIterationIncrementSize;
447
448 cint64 maxIterationWithoutMove = MAX_ITERATION_WITHOUT_MOVE_PER_LABEL* (mCurrentIndiIdIterationDataMap.size() + 1);
449 while (!mInitializationRequired && estimatedRequiredIterations <= maxIterationWithoutMove && mCurrentIteratorData && !reachedCursorCheckFunc(mCurrentIteratorData)) {
450 moveNext();
451
452 if (mCurrentIteratorData && !mInitializationRequired) {
453 diff = getDifference(currentIndividualInstanceItemReference().getIndividualID(), indiInstItemRef.getIndividualID());
454 estimatedRequiredIterations = diff / (double)mAverageIterationIncrementSize;
455 }
456 }
457
458 if (!atEnd() || mInitializationRequired) {
459 cint64 prevLastIndiId = mLastIndiId;
460 mLastIndiId = -1;
461 if (mInitializationRequired || !reachedCursorCheckFunc(mCurrentIteratorData)) {
462 mInitializationRequired = false;
463
464 QList<CAssociationMapIteratorData*> tmpUninitializedList(mUninitializedList);
465 mUninitializedList.clear();
466 while (!tmpUninitializedList.isEmpty()) {
467 CAssociationMapIteratorData* iteratorData = tmpUninitializedList.takeFirst();
468 if (!reachedCursorCheckFunc(iteratorData)) {
469 updateIndividualAssociationsIteratorData(iteratorData, indiInstItemRef, moveOver);
470 }
471 }
472
473
474 while (mCurrentIteratorData && !reachedCursorCheckFunc(mCurrentIteratorData)) {
475 // create new iteration data for those that are not at the cursor
476 if (!reachedCursorCheckFunc(mCurrentIteratorData)) {
477 updateIndividualAssociationsIteratorData(mCurrentIteratorData, indiInstItemRef, moveOver);
478 }
479 mCurrentIteratorData = nullptr;
480
481 mCurrentIteratorData = getNextIteratorDataFromMap();
482 }
483
484 if (mCurrentIteratorData && mCurrentIteratorData->mInitializationRequired) {
485 mInitializationRequired = true;
486 }
487 }
488 if (mCurrentIteratorData) {
489 if (!mInitializationRequired) {
490 mLastIndiId = currentIndividualInstanceItemReference().getIndividualID();
491 } else {
492 mLastIndiId = prevLastIndiId;
493 }
494 }
495 }
496
497
498 }
499 return !mInitializationRequired && !atEnd();
500 }
501
502
503
504 bool COptimizedRepresentativeKPSetCacheLabelItemIterator::atEnd() {
505 return mCurrentIteratorData == nullptr && mUninitializedList.isEmpty();
506 }
507
508
509
510 CRealizationIndividualInstanceItemReference COptimizedRepresentativeKPSetCacheLabelItemIterator::currentIndividualInstanceItemReference() {
511 if (mCurrentIteratorData) {
512 cint64 currentIndiId = mCurrentIteratorData->mIterator.currentAssociatedIndividualId();
513 return CRealizationIndividualInstanceItemReference(CIndividualReference(mCurrentIteratorData->mIndividual, currentIndiId), mCurrentIteratorData->mCurrentIndiRealizationItem);
514 }
515 return CRealizationIndividualInstanceItemReference();
516 }
517
518
519
520 bool COptimizedRepresentativeKPSetCacheLabelItemIterator::isCurrentInstancePossible() {
521 if (mCurrentIteratorData) {
522 return mCurrentIteratorData->mCurrentInstanceOnlyPossible;
523 } else {
524 return false;
525 }
526 }
527
528 bool COptimizedRepresentativeKPSetCacheLabelItemIterator::isCurrentInstanceCertain() {
529 if (mCurrentIteratorData) {
530 return !mCurrentIteratorData->mCurrentInstanceOnlyPossible;
531 } else {
532 return false;
533 }
534 }
535
536
537
538 CRealizationIndividualInstanceItemReferenceIterator* COptimizedRepresentativeKPSetCacheLabelItemIterator::getCopy() {
539 COptimizedRepresentativeKPSetCacheLabelItemIterator* iteratorCopy = new COptimizedRepresentativeKPSetCacheLabelItemIterator(QList<CBackendRepresentativeMemoryLabelCacheItem*>(), QList<CBackendRepresentativeMemoryLabelCacheItem*>(), mIndividualInstantiatedItemHash, mIndividualVector, mSorting, mIndiInstItemRefCursor, mMoveOverCursor);
540 iteratorCopy->init();
541 this->initCopy(iteratorCopy);
542 return iteratorCopy;
543 }
544
545 CRealizationIndividualInstanceItemReferenceIterator* COptimizedRepresentativeKPSetCacheLabelItemIterator::initCopy(CRealizationIndividualInstanceItemReferenceIterator* iterator) {
546 COptimizedRepresentativeKPSetCacheLabelItemIterator* cacheLabelItemIterator = (COptimizedRepresentativeKPSetCacheLabelItemIterator*)iterator;
547 for (CAssociationMapIteratorData* iteratorData : mIteratorDataContainer) {
548 CAssociationMapIteratorData* copiedIteratorData = createAssociationMapIteratorData(iteratorData->mLabelItem, iteratorData->mIterator, iteratorData->mPossibleInstances);
549 copiedIteratorData->mLastCheckedInitializationRequiredId = iteratorData->mLastCheckedInitializationRequiredId;
550 copiedIteratorData->mCurrentIndiRealizationItem = iteratorData->mCurrentIndiRealizationItem;
551 copiedIteratorData->mIndividual = iteratorData->mIndividual;
552 copiedIteratorData->mAdditionalData = iteratorData->mAdditionalData;
553 copiedIteratorData->mInitializationRequired = iteratorData->mInitializationRequired;
554 copiedIteratorData->mCurrentInstanceOnlyPossible = iteratorData->mCurrentInstanceOnlyPossible;
555 cacheLabelItemIterator->mIteratorDataContainer.append(copiedIteratorData);
556 if (mCurrentIteratorData == iteratorData) {
557 cacheLabelItemIterator->mCurrentIteratorData = copiedIteratorData;
558 } else if (!copiedIteratorData->mIterator.atEnd()) {
559 if (copiedIteratorData->mInitializationRequired && copiedIteratorData->mIterator.currentAssociatedIndividualId() == -1) {
560 cacheLabelItemIterator->mUninitializedList.append(copiedIteratorData);
561 } else {
562 cacheLabelItemIterator->mCurrentIndiIdIterationDataMap.insertMulti(CAssociationMapIteratorKey(copiedIteratorData), copiedIteratorData);
563 }
564 }
565 }
566 cacheLabelItemIterator->mInitializationRequired = mInitializationRequired;
567 cacheLabelItemIterator->mFirstIteratorIndiId = mFirstIteratorIndiId;
568 cacheLabelItemIterator->mAllowPossibleInstances = mAllowPossibleInstances;
569 cacheLabelItemIterator->mPreventSameIndisMultipleOccurences = mPreventSameIndisMultipleOccurences;
570 cacheLabelItemIterator->mAverageIterationIncrementSize = mAverageIterationIncrementSize;
571 cacheLabelItemIterator->mIterationCount = mIterationCount;
572 cacheLabelItemIterator->mLastIndiId = mLastIndiId;
573 cacheLabelItemIterator->mLabelCacheItemKnwonInstancesList = mLabelCacheItemKnwonInstancesList;
574 cacheLabelItemIterator->mLabelCacheItemPossibleInstancesList = mLabelCacheItemPossibleInstancesList;
575
576 cacheLabelItemIterator->mAssociatedIndiPossibleVisistedCount = mAssociatedIndiPossibleVisistedCount;
577 cacheLabelItemIterator->mAssociatedIndiPossibleConfirmedCount = mAssociatedIndiPossibleConfirmedCount;
578 cacheLabelItemIterator->mAssociatedIndiTotalCount = mAssociatedIndiTotalCount;
579 cacheLabelItemIterator->mAssociatedIndiPossibleCount = mAssociatedIndiPossibleCount;
580 cacheLabelItemIterator->mCheckingInitializationRequiredId = mCheckingInitializationRequiredId;
581 return this;
582 }
583
584 CRealizationRemainingInstancesEstimation COptimizedRepresentativeKPSetCacheLabelItemIterator::remainingInstancesEstimation() {
585 CRealizationRemainingInstancesEstimation estimation;
586 estimation.setMaximalCount(mAssociatedIndiTotalCount);
587 estimation.setMinimalCount(mAssociatedIndiTotalCount - mAssociatedIndiPossibleCount);
588 cint64 remainingEstimation = 0;
589 if (!atEnd()) {
590 if (mIterateAscending) {
591 cint64 difference = getDifference(currentIndividualInstanceItemReference().getIndividualID(), mFirstIteratorIndiId);
592 remainingEstimation = mAssociatedIndiTotalCount - (difference / mAverageIterationIncrementSize);
593 } else {
594 cint64 difference = getDifference(currentIndividualInstanceItemReference().getIndividualID(), 0);
595 remainingEstimation = mAssociatedIndiTotalCount / mAverageIterationIncrementSize;
596 }
597 remainingEstimation = qMin(mAssociatedIndiTotalCount, remainingEstimation);
598 remainingEstimation = qMax((cint64)0, remainingEstimation);
599 }
600 estimation.setEstimatedCount(remainingEstimation);
601 return estimation;
602 }
603
604
605
606 CRealizationIndividualSorting COptimizedRepresentativeKPSetCacheLabelItemIterator::getSorting() {
607 return mSorting;
608 }
609
610 }; // end namespace Realizer
611
612 }; // end namespace Reasoner
613
614 }; // end namespace Konclude