| 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 "CSaturationSuccessorALLConceptExtensionData.h" |
| 22 |
|
| 23 |
|
| 24 |
namespace Konclude { |
| 25 |
|
| 26 |
namespace Reasoner { |
| 27 |
|
| 28 |
namespace Kernel { |
| 29 |
|
| 30 |
namespace Process { |
| 31 |
|
| 32 |
|
| 33 |
CSaturationSuccessorALLConceptExtensionData::CSaturationSuccessorALLConceptExtensionData(CProcessContext* processContext) : CLinkerBase<bool,CSaturationSuccessorALLConceptExtensionData>(false),mConceptExtensionMap(processContext) { |
| 34 |
mProcessContext = processContext; |
| 35 |
} |
| 36 |
|
| 37 |
CSaturationSuccessorALLConceptExtensionData* CSaturationSuccessorALLConceptExtensionData::initSuccessorConceptExtensionData(CRole* role, CIndividualSaturationProcessNode* indiProcSatNode) { |
| 38 |
setData(false); |
| 39 |
setNext(nullptr); |
| 40 |
mRole = role; |
| 41 |
mIndiProcSatNode = indiProcSatNode; |
| 42 |
mLastResolvedIndiProcSatNode = nullptr; |
| 43 |
mRequiredSuccCount = 0; |
| 44 |
mLastConnectedSuccCount = 0; |
| 45 |
mSuccessorCardinalityUpdatedFlag = false; |
| 46 |
mConceptsUpdatedFlag = false; |
| 47 |
return this; |
| 48 |
} |
| 49 |
|
| 50 |
bool CSaturationSuccessorALLConceptExtensionData::isExtensionProcessingQueued() { |
| 51 |
return getData(); |
| 52 |
} |
| 53 |
|
| 54 |
CSaturationSuccessorALLConceptExtensionData* CSaturationSuccessorALLConceptExtensionData::setExtensionProcessingQueued(bool queued) { |
| 55 |
setData(queued); |
| 56 |
return this; |
| 57 |
} |
| 58 |
|
| 59 |
|
| 60 |
CSaturationSuccessorConceptExtensionMap* CSaturationSuccessorALLConceptExtensionData::getSuccessorConceptExtensionMap() { |
| 61 |
return &mConceptExtensionMap; |
| 62 |
} |
| 63 |
|
| 64 |
bool CSaturationSuccessorALLConceptExtensionData::addExtensionConcept(CConcept* concept, bool negation) { |
| 65 |
mConceptsUpdatedFlag |= mConceptExtensionMap.addExtensionConcept(concept,negation); |
| 66 |
return mConceptsUpdatedFlag; |
| 67 |
} |
| 68 |
|
| 69 |
CRole* CSaturationSuccessorALLConceptExtensionData::getRole() { |
| 70 |
return mRole; |
| 71 |
} |
| 72 |
|
| 73 |
CIndividualSaturationProcessNode* CSaturationSuccessorALLConceptExtensionData::getIndividualNode() { |
| 74 |
return mIndiProcSatNode; |
| 75 |
} |
| 76 |
|
| 77 |
CIndividualSaturationProcessNode* CSaturationSuccessorALLConceptExtensionData::getLastResolvedIndividualNode() { |
| 78 |
return mLastResolvedIndiProcSatNode; |
| 79 |
} |
| 80 |
|
| 81 |
CSaturationSuccessorALLConceptExtensionData* CSaturationSuccessorALLConceptExtensionData::setLastResolvedIndividualNode(CIndividualSaturationProcessNode* indiNode) { |
| 82 |
mLastResolvedIndiProcSatNode = indiNode; |
| 83 |
return this; |
| 84 |
} |
| 85 |
|
| 86 |
cint64 CSaturationSuccessorALLConceptExtensionData::getRequiredSuccessorCardinality() { |
| 87 |
return mRequiredSuccCount; |
| 88 |
} |
| 89 |
|
| 90 |
CSaturationSuccessorALLConceptExtensionData* CSaturationSuccessorALLConceptExtensionData::setRequiredSuccessorCardinality(cint64 succCard) { |
| 91 |
mRequiredSuccCount = succCard; |
| 92 |
return this; |
| 93 |
} |
| 94 |
|
| 95 |
|
| 96 |
cint64 CSaturationSuccessorALLConceptExtensionData::getLastConnectedSuccessorCardinality() { |
| 97 |
return mLastConnectedSuccCount; |
| 98 |
} |
| 99 |
|
| 100 |
CSaturationSuccessorALLConceptExtensionData* CSaturationSuccessorALLConceptExtensionData::setLastConnectedSuccessorCardinality(cint64 succCard) { |
| 101 |
mLastConnectedSuccCount = succCard; |
| 102 |
return this; |
| 103 |
} |
| 104 |
|
| 105 |
bool CSaturationSuccessorALLConceptExtensionData::addRequiredSuccessorCardinality(cint64 succCard) { |
| 106 |
if (mRequiredSuccCount < succCard) { |
| 107 |
mRequiredSuccCount = succCard; |
| 108 |
mSuccessorCardinalityUpdatedFlag = true; |
| 109 |
} |
| 110 |
return mSuccessorCardinalityUpdatedFlag; |
| 111 |
} |
| 112 |
|
| 113 |
|
| 114 |
bool CSaturationSuccessorALLConceptExtensionData::hasSuccessorCardinalityUpdatedFlag() { |
| 115 |
return mConceptsUpdatedFlag; |
| 116 |
} |
| 117 |
|
| 118 |
bool CSaturationSuccessorALLConceptExtensionData::hasConceptsUpdatedFlag() { |
| 119 |
return mSuccessorCardinalityUpdatedFlag; |
| 120 |
} |
| 121 |
|
| 122 |
CSaturationSuccessorALLConceptExtensionData* CSaturationSuccessorALLConceptExtensionData::clearUpdatedFlags() { |
| 123 |
mConceptsUpdatedFlag = false; |
| 124 |
mSuccessorCardinalityUpdatedFlag = false; |
| 125 |
return this; |
| 126 |
} |
| 127 |
|
| 128 |
}; // end namespace Process |
| 129 |
|
| 130 |
}; // end namespace Kernel |
| 131 |
|
| 132 |
}; // end namespace Reasoner |
| 133 |
|
| 134 |
}; // end namespace Konclude |