| 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 "COptimizedRepresentativeKPSetCacheLabelRoleNeighbouringItemIterator.h" |
| 22 |
|
| 23 |
|
| 24 |
namespace Konclude { |
| 25 |
|
| 26 |
namespace Reasoner { |
| 27 |
|
| 28 |
namespace Realizer { |
| 29 |
|
| 30 |
|
| 31 |
COptimizedRepresentativeKPSetCacheLabelRoleNeighbouringItemIterator::COptimizedRepresentativeKPSetCacheLabelRoleNeighbouringItemIterator(const QList<CBackendRepresentativeMemoryLabelCacheItem*>& labelCacheItemKnownInstancesList, const QList<CBackendRepresentativeMemoryLabelCacheItem*>& labelCacheItemPossibleInstancesList, |
| 32 |
COptimizedKPSetIndividualInstantiatedItemMultiHash* individualInstantiatedItemHash, CIndividualVector* individualVector, COptimizedKPSetRoleInstancesItem* roleInstancesItem, bool inversed, const CRealizationIndividualSorting& sorting, const CRealizationIndividualInstanceItemReference& indiInstItemRefCursor, bool moveOverCursor) |
| 33 |
|
| 34 |
: COptimizedRepresentativeKPSetCacheLabelItemIterator(labelCacheItemKnownInstancesList, labelCacheItemPossibleInstancesList, individualInstantiatedItemHash, individualVector, sorting, indiInstItemRefCursor, moveOverCursor) { |
| 35 |
|
| 36 |
|
| 37 |
TRoleInstancesItemInversedFlagPair roleInstItemInvFlagPair(roleInstancesItem, inversed); |
| 38 |
QSet<TRoleInstancesItemInversedFlagPair> roleInstItemInvFlagPairSet; |
| 39 |
roleInstItemInvFlagPairSet.insert(roleInstItemInvFlagPair); |
| 40 |
for (CBackendRepresentativeMemoryLabelCacheItem* labelItem : labelCacheItemPossibleInstancesList) { |
| 41 |
mPossibleLabelRoleInstancesItemInversionPairSetHash.insert(labelItem, roleInstItemInvFlagPairSet); |
| 42 |
} |
| 43 |
mRoleInstancesItemInversionPairSet.insert(roleInstItemInvFlagPair); |
| 44 |
|
| 45 |
init(); |
| 46 |
|
| 47 |
mPreventSameIndisMultipleOccurences = true; |
| 48 |
} |
| 49 |
|
| 50 |
COptimizedRepresentativeKPSetCacheLabelRoleNeighbouringItemIterator::COptimizedRepresentativeKPSetCacheLabelRoleNeighbouringItemIterator(const QList<CBackendRepresentativeMemoryLabelCacheItem*>& labelCacheItemKnownInstancesList, const QList<CBackendRepresentativeMemoryLabelCacheItem*>& labelCacheItemPossibleInstancesList, |
| 51 |
COptimizedKPSetIndividualInstantiatedItemMultiHash* individualInstantiatedItemHash, CIndividualVector* individualVector, const QHash<CBackendRepresentativeMemoryLabelCacheItem*, QSet<TRoleInstancesItemInversedFlagPair>>& pssibleLabelRoleInstancesItemInversionPairSetHash, const QSet<TRoleInstancesItemInversedFlagPair>& roleInstancesItemInversionPairSet, const CRealizationIndividualSorting& sorting, const CRealizationIndividualInstanceItemReference& indiInstItemRefCursor, bool moveOverCursor) |
| 52 |
|
| 53 |
: mPossibleLabelRoleInstancesItemInversionPairSetHash(pssibleLabelRoleInstancesItemInversionPairSetHash), mRoleInstancesItemInversionPairSet(roleInstancesItemInversionPairSet), COptimizedRepresentativeKPSetCacheLabelItemIterator(labelCacheItemKnownInstancesList, labelCacheItemPossibleInstancesList, individualInstantiatedItemHash, individualVector, sorting, indiInstItemRefCursor, moveOverCursor) { |
| 54 |
|
| 55 |
init(); |
| 56 |
|
| 57 |
|
| 58 |
mPreventSameIndisMultipleOccurences = true; |
| 59 |
} |
| 60 |
|
| 61 |
|
| 62 |
|
| 63 |
COptimizedRepresentativeKPSetCacheLabelItemIterator::CAssociationMapIteratorData* COptimizedRepresentativeKPSetCacheLabelRoleNeighbouringItemIterator::createAssociationMapIteratorData(CBackendRepresentativeMemoryLabelCacheItem* labelItem, const CBackendRepresentativeMemoryLabelCacheItemIndividualAssociationMapIterator& iterator, bool possibleInstances) { |
| 64 |
CAssociationMapIteratorDataWithRoleInstancesItems* iteratorData = new CAssociationMapIteratorDataWithRoleInstancesItems(labelItem, iterator, possibleInstances); |
| 65 |
if (possibleInstances) { |
| 66 |
iteratorData->mRoleInstancesItemInversionPairSet = mPossibleLabelRoleInstancesItemInversionPairSetHash.value(labelItem); |
| 67 |
} |
| 68 |
return iteratorData; |
| 69 |
} |
| 70 |
|
| 71 |
|
| 72 |
QHash<CBackendRepresentativeMemoryLabelCacheItem*, QSet<TRoleInstancesItemInversedFlagPair>>* COptimizedRepresentativeKPSetCacheLabelRoleNeighbouringItemIterator::getPossibleLabelRoleInstancesItemInversionPairSetHash() { |
| 73 |
return &mPossibleLabelRoleInstancesItemInversionPairSetHash; |
| 74 |
} |
| 75 |
|
| 76 |
|
| 77 |
QSet<TRoleInstancesItemInversedFlagPair>* COptimizedRepresentativeKPSetCacheLabelRoleNeighbouringItemIterator::getRoleInstancesItemInversionPairSet() { |
| 78 |
return &mRoleInstancesItemInversionPairSet; |
| 79 |
} |
| 80 |
|
| 81 |
|
| 82 |
|
| 83 |
QSet<TRoleInstancesItemInversedFlagPair>* COptimizedRepresentativeKPSetCacheLabelRoleNeighbouringItemIterator::currentRoleInstancesItemInversionPairSet() { |
| 84 |
if (mCurrentIteratorData) { |
| 85 |
CAssociationMapIteratorDataWithRoleInstancesItems* roleInstanceItemsIteratorData = (CAssociationMapIteratorDataWithRoleInstancesItems*)mCurrentIteratorData; |
| 86 |
return &roleInstanceItemsIteratorData->mRoleInstancesItemInversionPairSet; |
| 87 |
} else { |
| 88 |
return nullptr; |
| 89 |
} |
| 90 |
} |
| 91 |
|
| 92 |
|
| 93 |
bool COptimizedRepresentativeKPSetCacheLabelRoleNeighbouringItemIterator::isValidIteratorPosition(CAssociationMapIteratorData* iteratorData, cint64 indiId) { |
| 94 |
++mAssociatedIndiPossibleVisistedCount; |
| 95 |
|
| 96 |
bool isValidInstanceFlag = true; |
| 97 |
bool isValidKnownInstanceFlag = true; |
| 98 |
bool isValidPossibleInstanceFlag = true; |
| 99 |
|
| 100 |
CAssociationMapIteratorDataWithRoleInstancesItems* roleInstanceItemsIteratorData = (CAssociationMapIteratorDataWithRoleInstancesItems*)iteratorData; |
| 101 |
for (TRoleInstancesItemInversedFlagPair roleInstancesItemInversedFlagPair : roleInstanceItemsIteratorData->mRoleInstancesItemInversionPairSet) { |
| 102 |
COptimizedKPSetRoleInstancesItem* roleInstancesItem = roleInstancesItemInversedFlagPair.first; |
| 103 |
bool inversed = roleInstancesItemInversedFlagPair.second; |
| 104 |
|
| 105 |
checkValidIteratorPosition(iteratorData, indiId, roleInstancesItem, inversed, isValidInstanceFlag, isValidKnownInstanceFlag, isValidPossibleInstanceFlag); |
| 106 |
if (!isValidInstanceFlag) { |
| 107 |
return false; |
| 108 |
} |
| 109 |
} |
| 110 |
|
| 111 |
if (isValidInstanceFlag) { |
| 112 |
if (!isValidKnownInstanceFlag && isValidPossibleInstanceFlag) { |
| 113 |
iteratorData->mCurrentInstanceOnlyPossible = true; |
| 114 |
} |
| 115 |
++mAssociatedIndiPossibleConfirmedCount; |
| 116 |
return true; |
| 117 |
} |
| 118 |
return false; |
| 119 |
|
| 120 |
} |
| 121 |
|
| 122 |
|
| 123 |
|
| 124 |
|
| 125 |
|
| 126 |
|
| 127 |
void COptimizedRepresentativeKPSetCacheLabelRoleNeighbouringItemIterator::checkValidIteratorPosition(CAssociationMapIteratorData* iteratorData, cint64 indiId, COptimizedKPSetRoleInstancesItem* roleInstancesItem, bool inversed, bool& isValidInstanceFlag, bool& isValidKnownInstanceFlag, bool& isValidPossibleInstanceFlag) { |
| 128 |
if (iteratorData->mCurrentIndiRealizationItem) { |
| 129 |
if (mConsiderSameMergedIndis || (!iteratorData->mCurrentIndiRealizationItem->isItemSameIndividualMerged() && indiId == iteratorData->mCurrentIndiRealizationItem->getIndividualId())) { |
| 130 |
|
| 131 |
|
| 132 |
COptimizedKPSetRoleNeighbourInstancesHash* roleNeighbourHash = iteratorData->mCurrentIndiRealizationItem->getKnownPossibleRoleNeighboursInstancesHash(); |
| 133 |
const COptimizedKPSetRoleNeighbourInstancesHashData& roleNeighbourHashData = roleNeighbourHash->value(roleInstancesItem); |
| 134 |
COptimizedKPSetRoleInstancesHash* neighbourHash = nullptr; |
| 135 |
if (inversed) { |
| 136 |
neighbourHash = roleNeighbourHashData.mRolePredecessorInstancesHash; |
| 137 |
} else { |
| 138 |
neighbourHash = roleNeighbourHashData.mRoleSuccessorInstancesHash; |
| 139 |
} |
| 140 |
if (neighbourHash) { |
| 141 |
|
| 142 |
cint64 maxRemainingNeighbourInvestigationCount = 50; |
| 143 |
cint64 remainingNeighbourInvestigationCount = -1; |
| 144 |
bool somePossibleInstanceFlag = false; |
| 145 |
bool someInitializationRequired = false; |
| 146 |
|
| 147 |
for (COptimizedKPSetRoleInstancesHash::const_iterator it = neighbourHash->constBegin(), itEnd = neighbourHash->constEnd(); it != itEnd && remainingNeighbourInvestigationCount != 0; ++it) { |
| 148 |
// TODO: optimize by using pointer/counter/flag to/for next possible instance data that is a known instance |
| 149 |
if (remainingNeighbourInvestigationCount > 0) { |
| 150 |
remainingNeighbourInvestigationCount--; |
| 151 |
} |
| 152 |
const COptimizedKPSetRoleInstancesHashData& neighbourData = it.value(); |
| 153 |
COptimizedKPSetRoleInstancesData* roleInstData = neighbourData.mInstanceItemData; |
| 154 |
if (roleInstData && roleInstData->mKnownInstance) { |
| 155 |
return; |
| 156 |
} else if (mAllowPossibleInstances) { |
| 157 |
somePossibleInstanceFlag = true; |
| 158 |
if (remainingNeighbourInvestigationCount == -1) { |
| 159 |
remainingNeighbourInvestigationCount = maxRemainingNeighbourInvestigationCount; |
| 160 |
} |
| 161 |
} else if (roleInstData->mPossibleInstance && !roleInstData->mTestedInstance && !roleInstData->mDerived) { |
| 162 |
someInitializationRequired = true; |
| 163 |
if (remainingNeighbourInvestigationCount == -1) { |
| 164 |
remainingNeighbourInvestigationCount = maxRemainingNeighbourInvestigationCount; |
| 165 |
} |
| 166 |
} |
| 167 |
} |
| 168 |
|
| 169 |
if (somePossibleInstanceFlag) { |
| 170 |
isValidKnownInstanceFlag = false; |
| 171 |
return; |
| 172 |
} |
| 173 |
if (someInitializationRequired) { |
| 174 |
iteratorData->mInitializationRequired = true; |
| 175 |
isValidInstanceFlag = false; |
| 176 |
return; |
| 177 |
} |
| 178 |
|
| 179 |
} |
| 180 |
} |
| 181 |
} |
| 182 |
if (roleInstancesItem->hasComplexRoleData()) { |
| 183 |
|
| 184 |
|
| 185 |
QHash<cint64, COptimizedKPSetIndividualComplexRoleData*>* complexRoleDataHash = roleInstancesItem->getIndividualIdComplexRoleDataHash(); |
| 186 |
if (!complexRoleDataHash->contains(indiId)) { |
| 187 |
isValidInstanceFlag = false; |
| 188 |
return; |
| 189 |
} else { |
| 190 |
COptimizedKPSetIndividualComplexRoleData* complexRoleData = complexRoleDataHash->value(indiId); |
| 191 |
if (!complexRoleData || !complexRoleData->isInitialized(inversed)) { |
| 192 |
iteratorData->mInitializationRequired = true; |
| 193 |
isValidInstanceFlag = false; |
| 194 |
return; |
| 195 |
} else { |
| 196 |
|
| 197 |
COptimizedKPSetIndividualComplexRoleExplicitIndirectLinksData* indiExplicitIndirectLinkComplexRepresentationData = (COptimizedKPSetIndividualComplexRoleExplicitIndirectLinksData*)complexRoleData; |
| 198 |
COptimizedKPSetRoleInstancesHash* possNeighbourInstanceHash = indiExplicitIndirectLinkComplexRepresentationData->getRoleNeighbourInstancesHash(inversed, false); |
| 199 |
if (possNeighbourInstanceHash) { |
| 200 |
|
| 201 |
cint64 maxRemainingNeighbourInvestigationCount = 50; |
| 202 |
cint64 remainingNeighbourInvestigationCount = -1; |
| 203 |
bool somePossibleInstanceFlag = false; |
| 204 |
bool someInitializationRequired = false; |
| 205 |
|
| 206 |
for (COptimizedKPSetRoleInstancesHash::const_iterator itNeighInst = possNeighbourInstanceHash->constBegin(), itNeighInstEnd = possNeighbourInstanceHash->constEnd(); itNeighInst != itNeighInstEnd && remainingNeighbourInvestigationCount != 0; ++itNeighInst) { |
| 207 |
// TODO: optimize by using pointer/counter/flag to/for next possible instance data that is a known instance |
| 208 |
if (remainingNeighbourInvestigationCount > 0) { |
| 209 |
remainingNeighbourInvestigationCount--; |
| 210 |
} |
| 211 |
const COptimizedKPSetRoleInstancesHashData& destIndiInstanceDat = itNeighInst.value(); |
| 212 |
cint64 destIndiId = itNeighInst.key(); |
| 213 |
COptimizedKPSetRoleInstancesData* instanceData = destIndiInstanceDat.mInstanceItemData; |
| 214 |
if (instanceData && instanceData->mKnownInstance) { |
| 215 |
return; |
| 216 |
} else if (mAllowPossibleInstances) { |
| 217 |
somePossibleInstanceFlag = true; |
| 218 |
if (remainingNeighbourInvestigationCount == -1) { |
| 219 |
remainingNeighbourInvestigationCount = maxRemainingNeighbourInvestigationCount; |
| 220 |
} |
| 221 |
} else if (instanceData->mPossibleInstance && !instanceData->mTestedInstance && !instanceData->mDerived) { |
| 222 |
someInitializationRequired = true; |
| 223 |
if (remainingNeighbourInvestigationCount == -1) { |
| 224 |
remainingNeighbourInvestigationCount = maxRemainingNeighbourInvestigationCount; |
| 225 |
} |
| 226 |
} |
| 227 |
} |
| 228 |
|
| 229 |
|
| 230 |
if (somePossibleInstanceFlag) { |
| 231 |
isValidKnownInstanceFlag = false; |
| 232 |
return; |
| 233 |
} |
| 234 |
if (someInitializationRequired) { |
| 235 |
iteratorData->mInitializationRequired = true; |
| 236 |
isValidInstanceFlag = false; |
| 237 |
return; |
| 238 |
} |
| 239 |
|
| 240 |
} |
| 241 |
} |
| 242 |
} |
| 243 |
|
| 244 |
} |
| 245 |
|
| 246 |
isValidInstanceFlag = false; |
| 247 |
} |
| 248 |
|
| 249 |
|
| 250 |
|
| 251 |
|
| 252 |
CRealizationIndividualInstanceItemReferenceIterator* COptimizedRepresentativeKPSetCacheLabelRoleNeighbouringItemIterator::getCopy() { |
| 253 |
COptimizedRepresentativeKPSetCacheLabelRoleNeighbouringItemIterator* iteratorCopy = new COptimizedRepresentativeKPSetCacheLabelRoleNeighbouringItemIterator(QList<CBackendRepresentativeMemoryLabelCacheItem*>(), QList<CBackendRepresentativeMemoryLabelCacheItem*>(), mIndividualInstantiatedItemHash, mIndividualVector, mPossibleLabelRoleInstancesItemInversionPairSetHash, mRoleInstancesItemInversionPairSet, mSorting, mIndiInstItemRefCursor, mMoveOverCursor); |
| 254 |
this->initCopy(iteratorCopy); |
| 255 |
return iteratorCopy; |
| 256 |
} |
| 257 |
|
| 258 |
CRealizationIndividualInstanceItemReferenceIterator* COptimizedRepresentativeKPSetCacheLabelRoleNeighbouringItemIterator::initCopy(CRealizationIndividualInstanceItemReferenceIterator* iterator) { |
| 259 |
COptimizedRepresentativeKPSetCacheLabelRoleNeighbouringItemIterator* cacheLabelItemIterator = (COptimizedRepresentativeKPSetCacheLabelRoleNeighbouringItemIterator*)iterator; |
| 260 |
COptimizedRepresentativeKPSetCacheLabelItemIterator::initCopy(cacheLabelItemIterator); |
| 261 |
return cacheLabelItemIterator; |
| 262 |
} |
| 263 |
|
| 264 |
|
| 265 |
}; // end namespace Realizer |
| 266 |
|
| 267 |
}; // end namespace Reasoner |
| 268 |
|
| 269 |
}; // end namespace Konclude |