| 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 "CSaturationNodeCacheUpdater.h" |
| 22 |
|
| 23 |
|
| 24 |
namespace Konclude { |
| 25 |
|
| 26 |
namespace Reasoner { |
| 27 |
|
| 28 |
namespace Kernel { |
| 29 |
|
| 30 |
namespace Cache { |
| 31 |
|
| 32 |
|
| 33 |
CSaturationNodeCacheUpdater::CSaturationNodeCacheUpdater(CSaturationNodeAssociatedExpansionCacheContext* context) { |
| 34 |
mIndirectUpdatedStatusIndiNodeCount = 0; |
| 35 |
mDirectUpdatedStatusIndiNodeCount = 0; |
| 36 |
mContext = context; |
| 37 |
} |
| 38 |
|
| 39 |
|
| 40 |
CSaturationNodeCacheUpdater* CSaturationNodeCacheUpdater::propagateUnsatisfibility(CIndividualSaturationProcessNode* node, CSaturationNodeAssociatedExpansionCacheContext* context) { |
| 41 |
CIndividualSaturationProcessNodeStatusFlags flags; |
| 42 |
flags.setClashedFlag(true); |
| 43 |
updateDirectAddingIndividualStatusFlags(node,&flags,context); |
| 44 |
return this; |
| 45 |
} |
| 46 |
|
| 47 |
|
| 48 |
CIndividualSaturationProcessNodeStatusUpdateLinker* CSaturationNodeCacheUpdater::createIndividualSaturationUpdateLinker(CSaturationNodeAssociatedExpansionCacheContext* context) { |
| 49 |
CIndividualSaturationProcessNodeStatusUpdateLinker* conSatUpdateLinker = context->getIndividualSaturationUpdateLinker(); |
| 50 |
return conSatUpdateLinker; |
| 51 |
} |
| 52 |
|
| 53 |
void CSaturationNodeCacheUpdater::releaseIndividualSaturationUpdateLinker(CIndividualSaturationProcessNodeStatusUpdateLinker* conSatUpdateLinker, CSaturationNodeAssociatedExpansionCacheContext* context) { |
| 54 |
context->addIndividualSaturationUpdateLinker(conSatUpdateLinker); |
| 55 |
} |
| 56 |
|
| 57 |
bool CSaturationNodeCacheUpdater::requiresDirectAddingIndividualStatusFlagsUpdate(CIndividualSaturationProcessNode* indiNode, CIndividualSaturationProcessNodeStatusFlags* addingFlags, CSaturationNodeAssociatedExpansionCacheContext* context) { |
| 58 |
CIndividualSaturationProcessNodeStatusFlags* indiDirectFlags = indiNode->getDirectStatusFlags(); |
| 59 |
return !indiDirectFlags->hasFlags(addingFlags,true); |
| 60 |
} |
| 61 |
|
| 62 |
bool CSaturationNodeCacheUpdater::requiresIndirectAddingIndividualStatusFlagsUpdate(CIndividualSaturationProcessNode* indiNode, CIndividualSaturationProcessNodeStatusFlags* addingFlags, CSaturationNodeAssociatedExpansionCacheContext* context) { |
| 63 |
CIndividualSaturationProcessNodeStatusFlags* indiIndirectFlags = indiNode->getIndirectStatusFlags(); |
| 64 |
return !indiIndirectFlags->hasFlags(addingFlags,true); |
| 65 |
} |
| 66 |
|
| 67 |
|
| 68 |
void CSaturationNodeCacheUpdater::updateDirectAddingIndividualStatusFlags(CIndividualSaturationProcessNode* indiNode, CIndividualSaturationProcessNodeStatusFlags* addingFlags, CSaturationNodeAssociatedExpansionCacheContext* context) { |
| 69 |
if (requiresDirectAddingIndividualStatusFlagsUpdate(indiNode,addingFlags,context)) { |
| 70 |
CIndividualSaturationProcessNodeStatusUpdateLinker* directUpdateLinker = createIndividualSaturationUpdateLinker(context); |
| 71 |
directUpdateLinker->initUpdateNodeLinker(indiNode); |
| 72 |
CIndividualSaturationProcessNodeStatusFlags* directIndiFlags = indiNode->getDirectStatusFlags(); |
| 73 |
directIndiFlags->addFlags(addingFlags); |
| 74 |
++mDirectUpdatedStatusIndiNodeCount; |
| 75 |
|
| 76 |
while (directUpdateLinker) { |
| 77 |
CIndividualSaturationProcessNodeStatusUpdateLinker* nextUpdateLinker = directUpdateLinker; |
| 78 |
directUpdateLinker = directUpdateLinker->getNext(); |
| 79 |
CIndividualSaturationProcessNode* updateIndiNode = nextUpdateLinker->getData(); |
| 80 |
nextUpdateLinker->clearNext(); |
| 81 |
releaseIndividualSaturationUpdateLinker(nextUpdateLinker,context); |
| 82 |
|
| 83 |
for (CXNegLinker<CIndividualSaturationProcessNode*>* depdendingIndiLinkerIt = updateIndiNode->getCopyDependingIndividualNodeLinker(); depdendingIndiLinkerIt; depdendingIndiLinkerIt = depdendingIndiLinkerIt->getNext()) { |
| 84 |
CIndividualSaturationProcessNode* dependingIndi = depdendingIndiLinkerIt->getData(); |
| 85 |
if (requiresDirectAddingIndividualStatusFlagsUpdate(dependingIndi,addingFlags,context)) { |
| 86 |
CIndividualSaturationProcessNodeStatusFlags* directIndiFlags = dependingIndi->getDirectStatusFlags(); |
| 87 |
directIndiFlags->addFlags(addingFlags); |
| 88 |
++mDirectUpdatedStatusIndiNodeCount; |
| 89 |
directUpdateLinker = createIndividualSaturationUpdateLinker(context)->initUpdateNodeLinker(dependingIndi)->append(directUpdateLinker); |
| 90 |
} |
| 91 |
} |
| 92 |
|
| 93 |
updateIndirectAddingIndividualStatusFlags(updateIndiNode,addingFlags,context); |
| 94 |
} |
| 95 |
} |
| 96 |
} |
| 97 |
|
| 98 |
|
| 99 |
|
| 100 |
void CSaturationNodeCacheUpdater::updateIndirectAddingIndividualStatusFlags(CIndividualSaturationProcessNode* indiNode, CIndividualSaturationProcessNodeStatusFlags* addingFlags, CSaturationNodeAssociatedExpansionCacheContext* context) { |
| 101 |
if (requiresIndirectAddingIndividualStatusFlagsUpdate(indiNode,addingFlags,context)) { |
| 102 |
CIndividualSaturationProcessNodeStatusUpdateLinker* directUpdateLinker = createIndividualSaturationUpdateLinker(context); |
| 103 |
directUpdateLinker->initUpdateNodeLinker(indiNode); |
| 104 |
CIndividualSaturationProcessNodeStatusFlags* indirectIndiFlags = indiNode->getIndirectStatusFlags(); |
| 105 |
indirectIndiFlags->addFlags(addingFlags); |
| 106 |
++mIndirectUpdatedStatusIndiNodeCount; |
| 107 |
|
| 108 |
while (directUpdateLinker) { |
| 109 |
CIndividualSaturationProcessNodeStatusUpdateLinker* nextUpdateLinker = directUpdateLinker; |
| 110 |
directUpdateLinker = directUpdateLinker->getNext(); |
| 111 |
CIndividualSaturationProcessNode* updateIndiNode = nextUpdateLinker->getData(); |
| 112 |
nextUpdateLinker->clearNext(); |
| 113 |
releaseIndividualSaturationUpdateLinker(nextUpdateLinker,context); |
| 114 |
|
| 115 |
|
| 116 |
for (CXNegLinker<CIndividualSaturationProcessNode*>* depdendingIndiLinkerIt = updateIndiNode->getCopyDependingIndividualNodeLinker(); depdendingIndiLinkerIt; depdendingIndiLinkerIt = depdendingIndiLinkerIt->getNext()) { |
| 117 |
CIndividualSaturationProcessNode* dependingIndi = depdendingIndiLinkerIt->getData(); |
| 118 |
if (requiresIndirectAddingIndividualStatusFlagsUpdate(dependingIndi,addingFlags,context)) { |
| 119 |
CIndividualSaturationProcessNodeStatusFlags* indirectIndiFlags = dependingIndi->getIndirectStatusFlags(); |
| 120 |
indirectIndiFlags->addFlags(addingFlags); |
| 121 |
++mIndirectUpdatedStatusIndiNodeCount; |
| 122 |
directUpdateLinker = createIndividualSaturationUpdateLinker(context)->initUpdateNodeLinker(dependingIndi)->append(directUpdateLinker); |
| 123 |
} |
| 124 |
} |
| 125 |
|
| 126 |
|
| 127 |
CRoleBackwardSaturationPropagationHash* backwardPropHash = updateIndiNode->getRoleBackwardPropagationHash(false); |
| 128 |
if (backwardPropHash) { |
| 129 |
CPROCESSHASH<CRole*,CRoleBackwardSaturationPropagationHashData>* backPropHash = backwardPropHash->getRoleBackwardPropagationDataHash(); |
| 130 |
for (CPROCESSHASH<CRole*,CRoleBackwardSaturationPropagationHashData>::const_iterator it = backPropHash->constBegin(), itEnd = backPropHash->constEnd(); it != itEnd; ++it) { |
| 131 |
CRole* backwardPropRole = it.key(); |
| 132 |
const CRoleBackwardSaturationPropagationHashData& backwardPropData = it.value(); |
| 133 |
for (CBackwardSaturationPropagationLink* linkIt = backwardPropData.mLinkLinker; linkIt; linkIt = linkIt->getNext()) { |
| 134 |
CIndividualSaturationProcessNode* sourceIndividual = linkIt->getSourceIndividual(); |
| 135 |
if (requiresIndirectAddingIndividualStatusFlagsUpdate(sourceIndividual,addingFlags,context)) { |
| 136 |
CIndividualSaturationProcessNodeStatusFlags* indirectIndiFlags = sourceIndividual->getIndirectStatusFlags(); |
| 137 |
indirectIndiFlags->addFlags(addingFlags); |
| 138 |
++mIndirectUpdatedStatusIndiNodeCount; |
| 139 |
directUpdateLinker = createIndividualSaturationUpdateLinker(context)->initUpdateNodeLinker(sourceIndividual)->append(directUpdateLinker); |
| 140 |
} |
| 141 |
} |
| 142 |
} |
| 143 |
} |
| 144 |
|
| 145 |
|
| 146 |
for (CXLinker<CIndividualSaturationProcessNode*>* nonInvConnIndiLinkerIt = updateIndiNode->getNonInverseConnectedIndividualNodeLinker(); nonInvConnIndiLinkerIt; nonInvConnIndiLinkerIt = nonInvConnIndiLinkerIt->getNext()) { |
| 147 |
CIndividualSaturationProcessNode* sourceIndividual = nonInvConnIndiLinkerIt->getData(); |
| 148 |
if (requiresIndirectAddingIndividualStatusFlagsUpdate(sourceIndividual,addingFlags,context)) { |
| 149 |
CIndividualSaturationProcessNodeStatusFlags* indirectIndiFlags = sourceIndividual->getIndirectStatusFlags(); |
| 150 |
indirectIndiFlags->addFlags(addingFlags); |
| 151 |
++mIndirectUpdatedStatusIndiNodeCount; |
| 152 |
directUpdateLinker = createIndividualSaturationUpdateLinker(context)->initUpdateNodeLinker(sourceIndividual)->append(directUpdateLinker); |
| 153 |
} |
| 154 |
} |
| 155 |
|
| 156 |
|
| 157 |
} |
| 158 |
} |
| 159 |
} |
| 160 |
|
| 161 |
|
| 162 |
|
| 163 |
|
| 164 |
|
| 165 |
}; // end namespace Cache |
| 166 |
|
| 167 |
}; // end namespace Kernel |
| 168 |
|
| 169 |
}; // end namespace Reasoner |
| 170 |
|
| 171 |
}; // end namespace Konclude |