| 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 "COptimizedRepresentativeKPSetCacheLabelConceptSetItemIterator.h" |
| 22 |
|
| 23 |
|
| 24 |
namespace Konclude { |
| 25 |
|
| 26 |
namespace Reasoner { |
| 27 |
|
| 28 |
namespace Realizer { |
| 29 |
|
| 30 |
|
| 31 |
COptimizedRepresentativeKPSetCacheLabelConceptSetItemIterator::COptimizedRepresentativeKPSetCacheLabelConceptSetItemIterator(const QList<CBackendRepresentativeMemoryLabelCacheItem*>& labelCacheItemKnownInstancesList, const QList<CBackendRepresentativeMemoryLabelCacheItem*>& labelCacheItemPossibleInstancesList, |
| 32 |
COptimizedKPSetIndividualInstantiatedItemMultiHash* individualInstantiatedItemHash, CIndividualVector* individualVector, COptimizedKPSetConceptInstancesItem* conceptInstancesItem, bool onlyMostSpecificInstances, const CRealizationIndividualSorting& sorting, const CRealizationIndividualInstanceItemReference& indiInstItemRefCursor, bool moveOverCursor, CBackendRepresentativeMemoryCacheReader* backendAssocCacheReader) |
| 33 |
|
| 34 |
: COptimizedRepresentativeKPSetCacheLabelItemIterator(labelCacheItemKnownInstancesList, labelCacheItemPossibleInstancesList, individualInstantiatedItemHash, individualVector, sorting, indiInstItemRefCursor, moveOverCursor) { |
| 35 |
|
| 36 |
TConceptInstancesItemMostSpecificFlagPair conItemMostSpecFlagPair(conceptInstancesItem, onlyMostSpecificInstances); |
| 37 |
QSet<TConceptInstancesItemMostSpecificFlagPair> conItemMostSpecFlagPairSet; |
| 38 |
conItemMostSpecFlagPairSet.insert(conItemMostSpecFlagPair); |
| 39 |
for (CBackendRepresentativeMemoryLabelCacheItem* labelItem : labelCacheItemPossibleInstancesList) { |
| 40 |
mPossibleLabelConceptInstancesItemOnlyMostSpecificFlagPairSetHash.insert(labelItem, conItemMostSpecFlagPairSet); |
| 41 |
} |
| 42 |
mConceptInstancesItemOnlyMostSpecificFlagPairSet.insert(conItemMostSpecFlagPair); |
| 43 |
mBackendAssocCacheReader = backendAssocCacheReader; |
| 44 |
|
| 45 |
init(); |
| 46 |
} |
| 47 |
|
| 48 |
|
| 49 |
|
| 50 |
COptimizedRepresentativeKPSetCacheLabelConceptSetItemIterator::COptimizedRepresentativeKPSetCacheLabelConceptSetItemIterator(const QList<CBackendRepresentativeMemoryLabelCacheItem*>& labelCacheItemKnownInstancesList, const QList<CBackendRepresentativeMemoryLabelCacheItem*>& labelCacheItemPossibleInstancesList, |
| 51 |
COptimizedKPSetIndividualInstantiatedItemMultiHash* individualInstantiatedItemHash, CIndividualVector* individualVector, const QHash<CBackendRepresentativeMemoryLabelCacheItem*, QSet<TConceptInstancesItemMostSpecificFlagPair>>& possibleLabelConceptInstancesItemOnlyMostSpecificFlagPairSetHash, const QSet<TConceptInstancesItemMostSpecificFlagPair>& onceptInstancesItemOnlyMostSpecificFlagPairSet, const CRealizationIndividualSorting& sorting, const CRealizationIndividualInstanceItemReference& indiInstItemRefCursor, bool moveOverCursor, CBackendRepresentativeMemoryCacheReader* backendAssocCacheReader) |
| 52 |
|
| 53 |
: mPossibleLabelConceptInstancesItemOnlyMostSpecificFlagPairSetHash(possibleLabelConceptInstancesItemOnlyMostSpecificFlagPairSetHash), mConceptInstancesItemOnlyMostSpecificFlagPairSet(onceptInstancesItemOnlyMostSpecificFlagPairSet), COptimizedRepresentativeKPSetCacheLabelItemIterator(labelCacheItemKnownInstancesList, labelCacheItemPossibleInstancesList, individualInstantiatedItemHash, individualVector, sorting, indiInstItemRefCursor, moveOverCursor) { |
| 54 |
|
| 55 |
mBackendAssocCacheReader = backendAssocCacheReader; |
| 56 |
init(); |
| 57 |
} |
| 58 |
|
| 59 |
|
| 60 |
QHash<CBackendRepresentativeMemoryLabelCacheItem*, QSet<TConceptInstancesItemMostSpecificFlagPair>>* COptimizedRepresentativeKPSetCacheLabelConceptSetItemIterator::getPossibleLabelConceptInstancesItemOnlyMostSpecificFlagPairSetHash() { |
| 61 |
return &mPossibleLabelConceptInstancesItemOnlyMostSpecificFlagPairSetHash; |
| 62 |
} |
| 63 |
|
| 64 |
QSet<TConceptInstancesItemMostSpecificFlagPair>* COptimizedRepresentativeKPSetCacheLabelConceptSetItemIterator::getConceptInstancesItemOnlyMostSpecificFlagPairSet() { |
| 65 |
return &mConceptInstancesItemOnlyMostSpecificFlagPairSet; |
| 66 |
} |
| 67 |
|
| 68 |
QSet<TConceptInstancesItemMostSpecificFlagPair>* COptimizedRepresentativeKPSetCacheLabelConceptSetItemIterator::currentConceptInstancesItemOnlyMostSpecificFlagPairSet() { |
| 69 |
if (mCurrentIteratorData) { |
| 70 |
CAssociationMapIteratorDataWithConceptInstancesItems* conceptInstanceItemsIteratorData = (CAssociationMapIteratorDataWithConceptInstancesItems*)mCurrentIteratorData; |
| 71 |
return &conceptInstanceItemsIteratorData->mConceptInstancesItemOnlyMostSpecificFlagPairSet; |
| 72 |
} else { |
| 73 |
return nullptr; |
| 74 |
} |
| 75 |
} |
| 76 |
|
| 77 |
|
| 78 |
|
| 79 |
COptimizedRepresentativeKPSetCacheLabelItemIterator::CAssociationMapIteratorData* COptimizedRepresentativeKPSetCacheLabelConceptSetItemIterator::createAssociationMapIteratorData(CBackendRepresentativeMemoryLabelCacheItem* labelItem, const CBackendRepresentativeMemoryLabelCacheItemIndividualAssociationMapIterator& iterator, bool possibleInstances) { |
| 80 |
CAssociationMapIteratorDataWithConceptInstancesItems* iteratorData = new CAssociationMapIteratorDataWithConceptInstancesItems(labelItem, iterator, possibleInstances); |
| 81 |
if (possibleInstances) { |
| 82 |
iteratorData->mConceptInstancesItemOnlyMostSpecificFlagPairSet = mPossibleLabelConceptInstancesItemOnlyMostSpecificFlagPairSetHash.value(labelItem); |
| 83 |
} |
| 84 |
return iteratorData; |
| 85 |
} |
| 86 |
|
| 87 |
|
| 88 |
bool COptimizedRepresentativeKPSetCacheLabelConceptSetItemIterator::isValidIteratorPosition(CAssociationMapIteratorData* iteratorData, cint64 indiId) { |
| 89 |
CAssociationMapIteratorDataWithConceptInstancesItems* conceptInstanceItemsIteratorData = (CAssociationMapIteratorDataWithConceptInstancesItems*)iteratorData; |
| 90 |
++mAssociatedIndiPossibleVisistedCount; |
| 91 |
|
| 92 |
if (!iteratorData->mCurrentIndiRealizationItem) { |
| 93 |
if (conceptInstanceItemsIteratorData->mConceptInstancesItemOnlyMostSpecificFlagPairSet.isEmpty()) { |
| 94 |
--mAssociatedIndiPossibleVisistedCount; |
| 95 |
} else { |
| 96 |
++mAssociatedIndiPossibleConfirmedCount; |
| 97 |
} |
| 98 |
return true; |
| 99 |
} |
| 100 |
if (mConsiderSameMergedIndis || (!iteratorData->mCurrentIndiRealizationItem->isItemSameIndividualMerged() && indiId == iteratorData->mCurrentIndiRealizationItem->getIndividualId())) { |
| 101 |
|
| 102 |
|
| 103 |
|
| 104 |
if (conceptInstanceItemsIteratorData->mConceptInstancesItemOnlyMostSpecificFlagPairSet.isEmpty()) { |
| 105 |
--mAssociatedIndiPossibleVisistedCount; |
| 106 |
return true; |
| 107 |
} else { |
| 108 |
bool validAsPossibleInstanceOnly = false; |
| 109 |
bool validAsKnownInstance = false; |
| 110 |
bool validInstance = true; |
| 111 |
for (TConceptInstancesItemMostSpecificFlagPair conceptInstancesItemMostSpecificPair : conceptInstanceItemsIteratorData->mConceptInstancesItemOnlyMostSpecificFlagPairSet) { |
| 112 |
COptimizedKPSetConceptInstancesItem* conceptInstancesItem = conceptInstancesItemMostSpecificPair.first; |
| 113 |
bool onlyMostSpecificInstances = conceptInstancesItemMostSpecificPair.second; |
| 114 |
|
| 115 |
COptimizedKPSetConceptInstancesData* conceptInstanceData = iteratorData->mCurrentIndiRealizationItem->getKnownPossibleInstancesHash()->getInstanceItemData(conceptInstancesItem); |
| 116 |
if (conceptInstanceData->mKnownInstance && (!onlyMostSpecificInstances || conceptInstanceData->mMostSpecific)) { |
| 117 |
validAsKnownInstance = true; |
| 118 |
} else if (mAllowPossibleInstances) { |
| 119 |
validAsPossibleInstanceOnly = true; |
| 120 |
} else if (conceptInstanceData->mPossibleInstance && !conceptInstanceData->mTestedInstance && !conceptInstanceData->mDerived) { |
| 121 |
--mAssociatedIndiPossibleVisistedCount; |
| 122 |
iteratorData->mInitializationRequired = true; |
| 123 |
validInstance = false; |
| 124 |
return false; |
| 125 |
} else { |
| 126 |
validInstance = false; |
| 127 |
} |
| 128 |
|
| 129 |
} |
| 130 |
|
| 131 |
|
| 132 |
if (validInstance) { |
| 133 |
if (validAsPossibleInstanceOnly) { |
| 134 |
++mAssociatedIndiPossibleConfirmedCount; |
| 135 |
iteratorData->mCurrentInstanceOnlyPossible = true; |
| 136 |
return true; |
| 137 |
} else if (validAsKnownInstance) { |
| 138 |
++mAssociatedIndiPossibleConfirmedCount; |
| 139 |
return true; |
| 140 |
} |
| 141 |
} |
| 142 |
} |
| 143 |
|
| 144 |
|
| 145 |
} |
| 146 |
return false; |
| 147 |
} |
| 148 |
|
| 149 |
|
| 150 |
CRealizationIndividualInstanceItemReferenceIterator* COptimizedRepresentativeKPSetCacheLabelConceptSetItemIterator::getCopy() { |
| 151 |
COptimizedRepresentativeKPSetCacheLabelConceptSetItemIterator* iteratorCopy = new COptimizedRepresentativeKPSetCacheLabelConceptSetItemIterator(QList<CBackendRepresentativeMemoryLabelCacheItem*>(), QList<CBackendRepresentativeMemoryLabelCacheItem*>(), mIndividualInstantiatedItemHash, mIndividualVector, mPossibleLabelConceptInstancesItemOnlyMostSpecificFlagPairSetHash, mConceptInstancesItemOnlyMostSpecificFlagPairSet, mSorting, mIndiInstItemRefCursor, mMoveOverCursor, mBackendAssocCacheReader); |
| 152 |
this->initCopy(iteratorCopy); |
| 153 |
return iteratorCopy; |
| 154 |
} |
| 155 |
|
| 156 |
CRealizationIndividualInstanceItemReferenceIterator* COptimizedRepresentativeKPSetCacheLabelConceptSetItemIterator::initCopy(CRealizationIndividualInstanceItemReferenceIterator* iterator) { |
| 157 |
COptimizedRepresentativeKPSetCacheLabelConceptSetItemIterator* cacheLabelItemIterator = (COptimizedRepresentativeKPSetCacheLabelConceptSetItemIterator*)iterator; |
| 158 |
COptimizedRepresentativeKPSetCacheLabelItemIterator::initCopy(cacheLabelItemIterator); |
| 159 |
return cacheLabelItemIterator; |
| 160 |
} |
| 161 |
|
| 162 |
|
| 163 |
}; // end namespace Realizer |
| 164 |
|
| 165 |
}; // end namespace Reasoner |
| 166 |
|
| 167 |
}; // end namespace Konclude |