| 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 "COptimizedComplexVariableCompositionItem.h" |
| 22 |
|
| 23 |
|
| 24 |
namespace Konclude { |
| 25 |
|
| 26 |
namespace Reasoner { |
| 27 |
|
| 28 |
namespace Answerer { |
| 29 |
|
| 30 |
|
| 31 |
COptimizedComplexVariableCompositionItem::COptimizedComplexVariableCompositionItem() { |
| 32 |
mVariableMappingsComputed = false; |
| 33 |
mVariableMappingsInitialized = false; |
| 34 |
mComputationQueued = false; |
| 35 |
mVariableMapping = nullptr; |
| 36 |
mVariableMappingsComputationRequirement = 1; |
| 37 |
mVariableMappingsExpectedCount = 0; |
| 38 |
mDependencyUpdatingCount = 0; |
| 39 |
mRepeatedRequirementInsufficientDependencyComputationIncreaseFactor = 1.; |
| 40 |
mComputationStepId = 0; |
| 41 |
mComputationAttempt = 1; |
| 42 |
mSplitComputationMode = false; |
| 43 |
mSplitComputations = false; |
| 44 |
mHadSplitComputations = false; |
| 45 |
mRequiresSplitComputationActivation = false; |
| 46 |
mLastComputation = false; |
| 47 |
mNextSplitComputationPos = 0; |
| 48 |
mCurrentSplitComputationPos = 0; |
| 49 |
mTotalSplitComputationCount = 0; |
| 50 |
mCompletedSplitComputationCount = 0; |
| 51 |
mSplitItem = nullptr; |
| 52 |
#ifdef OPTIMIZED_ANSWERER_DEBUG_STRINGS |
| 53 |
debugVarItemIndexMapping = nullptr; |
| 54 |
#endif |
| 55 |
mLastVariableMappingCacheReportedCount = -1; |
| 56 |
mLastVariableMappingCacheReportedSize = -1; |
| 57 |
mComputationItemDepth = 0; |
| 58 |
mCacheDescendantsIncompleteComputationCostSum = 0; |
| 59 |
mComputedVariableMappingsCount = -1; |
| 60 |
mVariableMappingsComputationStarted = false; |
| 61 |
} |
| 62 |
|
| 63 |
|
| 64 |
COptimizedComplexVariableCompositionItem::~COptimizedComplexVariableCompositionItem() { |
| 65 |
} |
| 66 |
|
| 67 |
|
| 68 |
bool COptimizedComplexVariableCompositionItem::isVariableMappingsComputed() { |
| 69 |
return mVariableMappingsComputed; |
| 70 |
} |
| 71 |
|
| 72 |
COptimizedComplexVariableCompositionItem* COptimizedComplexVariableCompositionItem::setVariableMappingsComputed(bool computed) { |
| 73 |
mVariableMappingsComputed = computed; |
| 74 |
mComputedVariableMappingsCount = mVariableMapping->getBindingCount(); |
| 75 |
return this; |
| 76 |
} |
| 77 |
|
| 78 |
bool COptimizedComplexVariableCompositionItem::isVariableMappingsInitialized() { |
| 79 |
return mVariableMappingsInitialized; |
| 80 |
} |
| 81 |
|
| 82 |
COptimizedComplexVariableCompositionItem* COptimizedComplexVariableCompositionItem::setVariableMappingsInitialized(bool initialized) { |
| 83 |
mVariableMappingsInitialized = initialized; |
| 84 |
return this; |
| 85 |
} |
| 86 |
|
| 87 |
bool COptimizedComplexVariableCompositionItem::isComputationQueued() { |
| 88 |
return mComputationQueued; |
| 89 |
} |
| 90 |
|
| 91 |
COptimizedComplexVariableCompositionItem* COptimizedComplexVariableCompositionItem::setComputationQueued(bool queued) { |
| 92 |
mComputationQueued = queued; |
| 93 |
return this; |
| 94 |
} |
| 95 |
|
| 96 |
|
| 97 |
QHash<CVariantTrible<CRole*, bool, cint64>, COptimizedComplexVariableRolePropagationItem*>* COptimizedComplexVariableCompositionItem::getRoleInverseItemHash() { |
| 98 |
return &mRoleInverseItemHash; |
| 99 |
} |
| 100 |
|
| 101 |
QHash<COptimizedComplexVariableJoiningBindingPositionMapping, COptimizedComplexVariableJoiningItem*>* COptimizedComplexVariableCompositionItem::getJoiningItemHash() { |
| 102 |
return &mJoiningItemHash; |
| 103 |
} |
| 104 |
|
| 105 |
|
| 106 |
COptimizedComplexVariableRolePropagationItem*& COptimizedComplexVariableCompositionItem::getRoleInversePropagationItem(CRole* role, bool inversed, cint64 varIdx) { |
| 107 |
return mRoleInverseItemHash[CVariantTrible<CRole*, bool, cint64>(role, inversed, varIdx)]; |
| 108 |
} |
| 109 |
|
| 110 |
|
| 111 |
|
| 112 |
|
| 113 |
COptimizedComplexVariableRolePropagationJoiningItem*& COptimizedComplexVariableCompositionItem::getRoleInversePropagationJoiningItem(CRole* role, bool inversed, cint64 varIdx, cint64 joinVarIdx) { |
| 114 |
return mRoleInverseJoinItemHash[CVariantQuad<CRole*, bool, cint64, cint64>(role, inversed, varIdx, joinVarIdx)]; |
| 115 |
} |
| 116 |
|
| 117 |
|
| 118 |
|
| 119 |
COptimizedComplexVariableRolePropagationReplacementItem*& COptimizedComplexVariableCompositionItem::getRoleInversePropagationReplacementItem(CRole* role, bool inversed, cint64 varIdx, cint64 replaceVarIdx) { |
| 120 |
return mRoleInverseReplaceItemHash[CVariantQuad<CRole*, bool, cint64, cint64>(role, inversed, varIdx, replaceVarIdx)]; |
| 121 |
} |
| 122 |
|
| 123 |
|
| 124 |
bool COptimizedComplexVariableCompositionItem::hasRoleInversePropagationItem(CRole* role, bool inversed, cint64 varIdx) { |
| 125 |
return mRoleInverseItemHash.contains(CVariantTrible<CRole*, bool, cint64>(role, inversed, varIdx)); |
| 126 |
} |
| 127 |
|
| 128 |
COptimizedComplexVariableJoiningItem*& COptimizedComplexVariableCompositionItem::getJoiningItem(const COptimizedComplexVariableJoiningBindingPositionMapping& bindingPosMapping) { |
| 129 |
return mJoiningItemHash[bindingPosMapping]; |
| 130 |
} |
| 131 |
|
| 132 |
bool COptimizedComplexVariableCompositionItem::hasJoiningItem(const COptimizedComplexVariableJoiningBindingPositionMapping& bindingPosMapping) { |
| 133 |
return mJoiningItemHash.contains(bindingPosMapping); |
| 134 |
} |
| 135 |
|
| 136 |
COptimizedComplexVariableIndividualMappings* COptimizedComplexVariableCompositionItem::getVariableMapping() { |
| 137 |
return mVariableMapping; |
| 138 |
} |
| 139 |
|
| 140 |
|
| 141 |
COptimizedComplexVariableCompositionItem* COptimizedComplexVariableCompositionItem::setVariableMapping(COptimizedComplexVariableIndividualMappings* variableMapping) { |
| 142 |
mVariableMapping = variableMapping; |
| 143 |
return this; |
| 144 |
} |
| 145 |
|
| 146 |
|
| 147 |
COptimizedComplexVariableDataLiteralExtensionItem*& COptimizedComplexVariableCompositionItem::getDataLiteralExtensionItem(CRole* dataRole, cint64 varIdx) { |
| 148 |
return mDataLiteralExtensionItemHash[QPair<CRole*, cint64>(dataRole, varIdx)]; |
| 149 |
} |
| 150 |
|
| 151 |
|
| 152 |
COptimizedComplexVariableSubSuperClassesPropagationItem*& COptimizedComplexVariableCompositionItem::getSubSuperClassesPropagationItem(bool superClassesProp, cint64 varIdx) { |
| 153 |
return mSubSuperClassesPropagationItem[QPair<bool, cint64>(superClassesProp, varIdx)]; |
| 154 |
} |
| 155 |
|
| 156 |
|
| 157 |
COptimizedComplexVariableSubSuperPropertiesPropagationItem*& COptimizedComplexVariableCompositionItem::getSubSuperPropertiesPropagationItem(bool superPropertiesProp, cint64 varIdx) { |
| 158 |
return mSubSuperPropertiesPropagationItem[QPair<bool, cint64>(superPropertiesProp, varIdx)]; |
| 159 |
} |
| 160 |
|
| 161 |
|
| 162 |
|
| 163 |
COptimizedComplexVariableIndividualTypeExtensionItem*& COptimizedComplexVariableCompositionItem::getIndividualTypeExtensionItem(cint64 indiVarIdx, COptimizedComplexVariableCompositionItem* classVarCompItem, cint64 classVarIdx) { |
| 164 |
return mIndividualTypeExtensionItemHash[CVariantTrible<cint64, COptimizedComplexVariableCompositionItem*, cint64>(indiVarIdx, classVarCompItem, classVarIdx)]; |
| 165 |
} |
| 166 |
|
| 167 |
|
| 168 |
|
| 169 |
COptimizedComplexVariableIndividualNeighboringPropertyExtensionItem*& COptimizedComplexVariableCompositionItem::getIndividualNeighboringPropertyExtensionItem(cint64 indiVarIdx, COptimizedComplexVariableCompositionItem* propVarCompItem, cint64 classVarIdx) { |
| 170 |
return mIndividualPropertyExtensionItemHash[CVariantTrible<cint64, COptimizedComplexVariableCompositionItem*, cint64>(indiVarIdx, propVarCompItem, classVarIdx)]; |
| 171 |
} |
| 172 |
|
| 173 |
|
| 174 |
COptimizedComplexVariableReductionItem*& COptimizedComplexVariableCompositionItem::getReductionItem(cint64 varIdx) { |
| 175 |
return mReductionItemHash[varIdx]; |
| 176 |
} |
| 177 |
|
| 178 |
COptimizedComplexVariableExtractionItem*& COptimizedComplexVariableCompositionItem::getExtractionItem(cint64 varIdx) { |
| 179 |
return mExtractionItemHash[varIdx]; |
| 180 |
} |
| 181 |
|
| 182 |
QList<COptimizedComplexVariableCompositionItem*>* COptimizedComplexVariableCompositionItem::getComputationDependentItemList() { |
| 183 |
return &mComputationDependentItemList; |
| 184 |
} |
| 185 |
|
| 186 |
COptimizedComplexVariableCompositionItem* COptimizedComplexVariableCompositionItem::addComputationDependentItem(COptimizedComplexVariableCompositionItem* depCompItem) { |
| 187 |
mComputationDependentItemList.append(depCompItem); |
| 188 |
return this; |
| 189 |
} |
| 190 |
|
| 191 |
|
| 192 |
COptimizedComplexVariableCompositionItem* COptimizedComplexVariableCompositionItem::setComputationDependentItemList(const QList<COptimizedComplexVariableCompositionItem*>& computationDependentItemList) { |
| 193 |
mComputationDependentItemList = computationDependentItemList; |
| 194 |
return this; |
| 195 |
} |
| 196 |
|
| 197 |
cint64 COptimizedComplexVariableCompositionItem::getVariableMappingsComputationRequirement() { |
| 198 |
return mVariableMappingsComputationRequirement; |
| 199 |
} |
| 200 |
|
| 201 |
|
| 202 |
bool COptimizedComplexVariableCompositionItem::requiresMoreVariableMappingsComputation() { |
| 203 |
return getVariableMappingsComputationRequirement() < 0 || getVariableMappingsCurrentCount() < getVariableMappingsComputationRequirement(); |
| 204 |
} |
| 205 |
|
| 206 |
|
| 207 |
COptimizedComplexVariableCompositionItem* COptimizedComplexVariableCompositionItem::setVariableMappingsComputationRequirement(cint64 limit) { |
| 208 |
mVariableMappingsComputationRequirement = limit; |
| 209 |
return this; |
| 210 |
} |
| 211 |
|
| 212 |
cint64 COptimizedComplexVariableCompositionItem::getVariableMappingsCurrentCount() { |
| 213 |
if (mVariableMapping) { |
| 214 |
return mVariableMapping->getBindingCount(); |
| 215 |
} else { |
| 216 |
return 0; |
| 217 |
} |
| 218 |
} |
| 219 |
|
| 220 |
double COptimizedComplexVariableCompositionItem::getVariableMappingsRemainingCount() { |
| 221 |
return getVariableMappingsExpectedCount() - (double)getVariableMappingsCurrentCount(); |
| 222 |
} |
| 223 |
|
| 224 |
double COptimizedComplexVariableCompositionItem::getVariableMappingsExpectedCount() { |
| 225 |
if (mComputedVariableMappingsCount >= 0) { |
| 226 |
return mComputedVariableMappingsCount; |
| 227 |
} else { |
| 228 |
return mVariableMappingsExpectedCount; |
| 229 |
} |
| 230 |
} |
| 231 |
|
| 232 |
COptimizedComplexVariableCompositionItem* COptimizedComplexVariableCompositionItem::setVariableMappingsExpectedCount(double count) { |
| 233 |
mVariableMappingsExpectedCount = count; |
| 234 |
return this; |
| 235 |
} |
| 236 |
|
| 237 |
|
| 238 |
|
| 239 |
|
| 240 |
|
| 241 |
QList<COptimizedComplexVariableCompositionItemUpdateData>* COptimizedComplexVariableCompositionItem::getComputationUpdateItemList() { |
| 242 |
return &mComputationUpdateItemList; |
| 243 |
} |
| 244 |
|
| 245 |
COptimizedComplexVariableCompositionItem* COptimizedComplexVariableCompositionItem::addComputationUpdateItem(COptimizedComplexVariableCompositionItem* updateCompItem) { |
| 246 |
mComputationUpdateItemList.append(COptimizedComplexVariableCompositionItemUpdateData(updateCompItem, nullptr)); |
| 247 |
return this; |
| 248 |
} |
| 249 |
|
| 250 |
|
| 251 |
COptimizedComplexVariableCompositionItem* COptimizedComplexVariableCompositionItem::addComputationUpdateItem(COptimizedComplexVariableCompositionItem* updateCompItem, COptimizedComplexBuildingVariableCompositionsItem* buildingItem) { |
| 252 |
mComputationUpdateItemList.append(COptimizedComplexVariableCompositionItemUpdateData(updateCompItem, buildingItem)); |
| 253 |
return this; |
| 254 |
} |
| 255 |
|
| 256 |
COptimizedComplexVariableCompositionItem* COptimizedComplexVariableCompositionItem::setComputationUpdateItemList(const QList<COptimizedComplexVariableCompositionItemUpdateData>& computationDependentItemList) { |
| 257 |
mComputationUpdateItemList = computationDependentItemList; |
| 258 |
return this; |
| 259 |
} |
| 260 |
|
| 261 |
|
| 262 |
COptimizedComplexVariableCompositionItem* COptimizedComplexVariableCompositionItem::decDependencyUpdatingCount(cint64 count) { |
| 263 |
mDependencyUpdatingCount -= count; |
| 264 |
return this; |
| 265 |
} |
| 266 |
|
| 267 |
COptimizedComplexVariableCompositionItem* COptimizedComplexVariableCompositionItem::incDependencyUpdatingCount(cint64 count) { |
| 268 |
mDependencyUpdatingCount += count; |
| 269 |
return this; |
| 270 |
} |
| 271 |
|
| 272 |
cint64 COptimizedComplexVariableCompositionItem::getDependencyUpdatingCount() { |
| 273 |
return mDependencyUpdatingCount; |
| 274 |
} |
| 275 |
|
| 276 |
|
| 277 |
|
| 278 |
double COptimizedComplexVariableCompositionItem::repeatedRequirementInsufficientDependencyComputationIncreaseFactor() { |
| 279 |
return mRepeatedRequirementInsufficientDependencyComputationIncreaseFactor; |
| 280 |
} |
| 281 |
|
| 282 |
COptimizedComplexVariableCompositionItem* COptimizedComplexVariableCompositionItem::setRepeatedRequirementInsufficientDependencyComputationIncreaseFactor(double factor) { |
| 283 |
mRepeatedRequirementInsufficientDependencyComputationIncreaseFactor = factor; |
| 284 |
return this; |
| 285 |
} |
| 286 |
|
| 287 |
COptimizedComplexVariableCompositionItem* COptimizedComplexVariableCompositionItem::increaseRepeatedRequirementInsufficientDependencyComputationIncreaseFactor(double increaseFactor) { |
| 288 |
mRepeatedRequirementInsufficientDependencyComputationIncreaseFactor *= increaseFactor; |
| 289 |
return this; |
| 290 |
} |
| 291 |
|
| 292 |
|
| 293 |
cint64 COptimizedComplexVariableCompositionItem::getComputationStepId() { |
| 294 |
return mComputationStepId; |
| 295 |
} |
| 296 |
|
| 297 |
COptimizedComplexVariableCompositionItem* COptimizedComplexVariableCompositionItem::setComputationStepId(cint64 step) { |
| 298 |
mComputationStepId = step; |
| 299 |
return this; |
| 300 |
} |
| 301 |
|
| 302 |
cint64 COptimizedComplexVariableCompositionItem::getComputationAttempt(bool increase) { |
| 303 |
cint64 attempt = mComputationAttempt; |
| 304 |
if (increase) { |
| 305 |
++mComputationAttempt; |
| 306 |
} |
| 307 |
return attempt; |
| 308 |
} |
| 309 |
|
| 310 |
COptimizedComplexVariableCompositionItem* COptimizedComplexVariableCompositionItem::setComputationAttempt(cint64 attempt) { |
| 311 |
mComputationAttempt = attempt; |
| 312 |
return this; |
| 313 |
} |
| 314 |
|
| 315 |
COptimizedComplexVariableCompositionItemRoleSamplingData& COptimizedComplexVariableCompositionItem::getRoleSamplingData(CRole* role) { |
| 316 |
return mRoleSamplingDataHash[role]; |
| 317 |
} |
| 318 |
|
| 319 |
|
| 320 |
bool COptimizedComplexVariableCompositionItem::isLastComputation() { |
| 321 |
return mLastComputation; |
| 322 |
} |
| 323 |
|
| 324 |
COptimizedComplexVariableCompositionItem* COptimizedComplexVariableCompositionItem::setLastComputation(bool last) { |
| 325 |
mLastComputation = last; |
| 326 |
return this; |
| 327 |
} |
| 328 |
|
| 329 |
bool COptimizedComplexVariableCompositionItem::isSplitComputationMode() { |
| 330 |
return mSplitComputationMode; |
| 331 |
} |
| 332 |
|
| 333 |
COptimizedComplexVariableCompositionItem* COptimizedComplexVariableCompositionItem::setSplitComputationMode(bool splitMode) { |
| 334 |
mSplitComputationMode = splitMode; |
| 335 |
return this; |
| 336 |
} |
| 337 |
|
| 338 |
|
| 339 |
bool COptimizedComplexVariableCompositionItem::hasSplitComputations() { |
| 340 |
return mSplitComputations; |
| 341 |
} |
| 342 |
|
| 343 |
COptimizedComplexVariableCompositionItem* COptimizedComplexVariableCompositionItem::setSplitComputations(bool splitComputations) { |
| 344 |
mSplitComputations = splitComputations; |
| 345 |
mHadSplitComputations = true; |
| 346 |
return this; |
| 347 |
} |
| 348 |
|
| 349 |
bool COptimizedComplexVariableCompositionItem::requiresSplitComputationActivation() { |
| 350 |
return mRequiresSplitComputationActivation; |
| 351 |
} |
| 352 |
|
| 353 |
COptimizedComplexVariableCompositionItem* COptimizedComplexVariableCompositionItem::setRequiresSplitComputationActivation(bool splitActivation) { |
| 354 |
mRequiresSplitComputationActivation = splitActivation; |
| 355 |
return this; |
| 356 |
} |
| 357 |
|
| 358 |
|
| 359 |
|
| 360 |
cint64 COptimizedComplexVariableCompositionItem::getNextSplitComputationPosition() { |
| 361 |
return mNextSplitComputationPos; |
| 362 |
} |
| 363 |
|
| 364 |
COptimizedComplexVariableCompositionItem* COptimizedComplexVariableCompositionItem::setNextSplitComputationPosition(cint64 pos) { |
| 365 |
mNextSplitComputationPos = pos; |
| 366 |
return this; |
| 367 |
} |
| 368 |
|
| 369 |
|
| 370 |
cint64 COptimizedComplexVariableCompositionItem::getCurrentSplitComputationPosition() { |
| 371 |
return mCurrentSplitComputationPos; |
| 372 |
} |
| 373 |
|
| 374 |
COptimizedComplexVariableCompositionItem* COptimizedComplexVariableCompositionItem::setCurrentSplitComputationPosition(cint64 pos) { |
| 375 |
mCurrentSplitComputationPos = pos; |
| 376 |
return this; |
| 377 |
} |
| 378 |
|
| 379 |
|
| 380 |
cint64 COptimizedComplexVariableCompositionItem::getTotalSplitComputationCount() { |
| 381 |
return mTotalSplitComputationCount; |
| 382 |
} |
| 383 |
|
| 384 |
COptimizedComplexVariableCompositionItem* COptimizedComplexVariableCompositionItem::setTotalSplitComputationCount(cint64 count) { |
| 385 |
mTotalSplitComputationCount = count; |
| 386 |
return this; |
| 387 |
} |
| 388 |
|
| 389 |
COptimizedComplexVariableCompositionItem* COptimizedComplexVariableCompositionItem::getCurrentSplitComputationItem() { |
| 390 |
return mSplitItem; |
| 391 |
} |
| 392 |
|
| 393 |
COptimizedComplexVariableCompositionItem* COptimizedComplexVariableCompositionItem::setCurrentSplitComputationItem(COptimizedComplexVariableCompositionItem* splitItem) { |
| 394 |
mSplitItem = splitItem; |
| 395 |
return this; |
| 396 |
} |
| 397 |
|
| 398 |
|
| 399 |
cint64 COptimizedComplexVariableCompositionItem::getCompletedSplitComputationCount() { |
| 400 |
return mCompletedSplitComputationCount; |
| 401 |
} |
| 402 |
|
| 403 |
cint64 COptimizedComplexVariableCompositionItem::getRemainingSplitComputationCount() { |
| 404 |
return mTotalSplitComputationCount - mCompletedSplitComputationCount; |
| 405 |
} |
| 406 |
|
| 407 |
COptimizedComplexVariableCompositionItem* COptimizedComplexVariableCompositionItem::setCompletedSplitComputationCount(cint64 count) { |
| 408 |
mCompletedSplitComputationCount = count; |
| 409 |
return this; |
| 410 |
} |
| 411 |
|
| 412 |
COptimizedComplexVariableCompositionItem* COptimizedComplexVariableCompositionItem::incCompletedSplitComputationCount(cint64 count) { |
| 413 |
mCompletedSplitComputationCount += count; |
| 414 |
return this; |
| 415 |
} |
| 416 |
|
| 417 |
cint64 COptimizedComplexVariableCompositionItem::getLastVariableMappingCacheReportedCount() { |
| 418 |
return mLastVariableMappingCacheReportedCount; |
| 419 |
} |
| 420 |
|
| 421 |
cint64 COptimizedComplexVariableCompositionItem::getLastVariableMappingCacheReportedSize() { |
| 422 |
return mLastVariableMappingCacheReportedSize; |
| 423 |
} |
| 424 |
|
| 425 |
COptimizedComplexVariableCompositionItem* COptimizedComplexVariableCompositionItem::setLastVariableMappingCacheReportedCount(cint64 count) { |
| 426 |
mLastVariableMappingCacheReportedCount = count; |
| 427 |
return this; |
| 428 |
} |
| 429 |
|
| 430 |
COptimizedComplexVariableCompositionItem* COptimizedComplexVariableCompositionItem::setLastVariableMappingCacheReportedSize(cint64 size) { |
| 431 |
mLastVariableMappingCacheReportedSize = size; |
| 432 |
return this; |
| 433 |
} |
| 434 |
|
| 435 |
|
| 436 |
|
| 437 |
QSet<COptimizedComplexVariableCompositionItem*>* COptimizedComplexVariableCompositionItem::getComputationSuccessorItemSet() { |
| 438 |
return &mComputationSuccessorItemSet; |
| 439 |
} |
| 440 |
|
| 441 |
COptimizedComplexVariableCompositionItem* COptimizedComplexVariableCompositionItem::addComputationSuccessorItem(COptimizedComplexVariableCompositionItem* succItem) { |
| 442 |
mComputationSuccessorItemSet.insert(succItem); |
| 443 |
return this; |
| 444 |
} |
| 445 |
|
| 446 |
|
| 447 |
cint64 COptimizedComplexVariableCompositionItem::getComputationItemDepth() { |
| 448 |
return mComputationItemDepth; |
| 449 |
} |
| 450 |
|
| 451 |
COptimizedComplexVariableCompositionItem* COptimizedComplexVariableCompositionItem::setComputationItemDepth(cint64 depth) { |
| 452 |
mComputationItemDepth = depth; |
| 453 |
return this; |
| 454 |
} |
| 455 |
|
| 456 |
|
| 457 |
|
| 458 |
bool COptimizedComplexVariableCompositionItem::isVariableMappingsComputationStarted() { |
| 459 |
return mVariableMappingsComputationStarted; |
| 460 |
} |
| 461 |
|
| 462 |
COptimizedComplexVariableCompositionItem* COptimizedComplexVariableCompositionItem::setVariableMappingsComputationStarted(bool started) { |
| 463 |
mVariableMappingsComputationStarted = started; |
| 464 |
return this; |
| 465 |
} |
| 466 |
|
| 467 |
|
| 468 |
|
| 469 |
bool COptimizedComplexVariableCompositionItem::clearComputation() { |
| 470 |
mVariableMapping->clearComputedMappings(); |
| 471 |
mVariableMappingsComputationRequirement = 1; |
| 472 |
mVariableMappingsComputed = false; |
| 473 |
mVariableMappingsComputationStarted = false; |
| 474 |
mVariableMappingsInitialized = false; |
| 475 |
mSplitComputationMode = false; |
| 476 |
mSplitComputations = false; |
| 477 |
if (mSplitItem) { |
| 478 |
mSplitItem->clearComputation(); |
| 479 |
delete mSplitItem; |
| 480 |
} |
| 481 |
mRequiresSplitComputationActivation = false; |
| 482 |
mCurrentSplitComputationPos = 0; |
| 483 |
mTotalSplitComputationCount = 0; |
| 484 |
mCompletedSplitComputationCount = 0; |
| 485 |
mNextSplitComputationPos = 0; |
| 486 |
mSplitItem = nullptr; |
| 487 |
return true; |
| 488 |
} |
| 489 |
|
| 490 |
double COptimizedComplexVariableCompositionItem::getCacheDescendantsIncompleteComputationCostSum() { |
| 491 |
return mCacheDescendantsIncompleteComputationCostSum; |
| 492 |
} |
| 493 |
|
| 494 |
COptimizedComplexVariableCompositionItem* COptimizedComplexVariableCompositionItem::setCacheDescendantsIncompleteComputationCostSum(double cost) { |
| 495 |
mCacheDescendantsIncompleteComputationCostSum = cost; |
| 496 |
return this; |
| 497 |
} |
| 498 |
|
| 499 |
}; // end namespace Answerer |
| 500 |
|
| 501 |
}; // end namespace Reasoner |
| 502 |
|
| 503 |
}; // end namespace Konclude |