1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186
|
/*
* Copyright (C) 2013-2015, 2019 by the Konclude Developer Team.
*
* This file is part of the reasoning system Konclude.
* For details and support, see <http://konclude.com/>.
*
* Konclude is free software: you can redistribute it and/or modify
* it under the terms of version 3 of the GNU Lesser General Public
* License (LGPLv3) as published by the Free Software Foundation.
*
* Konclude is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU (Lesser) General Public License for more details.
*
* You should have received a copy of the GNU (Lesser) General Public
* License along with Konclude. If not, see <http://www.gnu.org/licenses/>.
*
*/
#include "CNodeTopDownTraversalClassificationItem.h"
namespace Konclude {
namespace Reasoner {
namespace Classifier {
CNodeTopDownTraversalClassificationItem::CNodeTopDownTraversalClassificationItem(CHierarchyNode *node, CHierarchyNode *topNode, QList<CNodeTopDownTraversalClassificationItem *> *lockedReleaseProcessingList) {
traversalNode = node;
newBranchNodeList << topNode;
lockedReleaseProcList = lockedReleaseProcessingList;
testNode = 0;
parLockNode = 0;
eqTestNode = 0;
subSumTestingResult = false;
alredyTraversedDirectBlockedSuccessorNode = false;
}
CNodeTopDownTraversalClassificationItem::~CNodeTopDownTraversalClassificationItem() {
}
CNodeBlockedClassificationItem *CNodeTopDownTraversalClassificationItem::releaseBlockedResumeProcessing() {
lockedReleaseProcList->append(this);
return this;
}
CNodeBlockedClassificationItem *CNodeTopDownTraversalClassificationItem::releaseTestingBlockedResumeProcessing(CConcept *subsumerConcept, CConcept *subsumedConcept, bool testingResult) {
subSumTestingResult = testingResult;
lockedReleaseProcList->append(this);
return this;
}
CHierarchyNode *CNodeTopDownTraversalClassificationItem::getTraversalNode() {
return traversalNode;
}
QList<CHierarchyNode *> *CNodeTopDownTraversalClassificationItem::getTestingNodeList() {
return &testingNodeList;
}
CNodeTopDownTraversalClassificationItem *CNodeTopDownTraversalClassificationItem::appendTestingNodeList(QList<CHierarchyNode *> &nodeList) {
testingNodeList << nodeList;
return this;
}
CNodeTopDownTraversalClassificationItem *CNodeTopDownTraversalClassificationItem::appendTestingNode(CHierarchyNode *node) {
testingNodeList.append(node);
return this;
}
QList<CHierarchyNode *> *CNodeTopDownTraversalClassificationItem::getParentNodeList() {
return &parentNodeList;
}
CNodeTopDownTraversalClassificationItem *CNodeTopDownTraversalClassificationItem::appendParentNodeList(QList<CHierarchyNode *> &nodeList) {
parentNodeList << nodeList;
return this;
}
CNodeTopDownTraversalClassificationItem *CNodeTopDownTraversalClassificationItem::appendParentNode(CHierarchyNode *node) {
parentNodeList.append(node);
return this;
}
bool CNodeTopDownTraversalClassificationItem::hasNextTestingNode() {
return !testingNodeList.isEmpty();
}
CHierarchyNode *CNodeTopDownTraversalClassificationItem::takeNextTestingNode() {
testNode = testingNodeList.takeFirst();
return testNode;
}
CHierarchyNode *CNodeTopDownTraversalClassificationItem::getTestingNode() {
return testNode;
}
CNodeTopDownTraversalClassificationItem *CNodeTopDownTraversalClassificationItem::clearTestingNode() {
testNode = 0;
return this;
}
bool CNodeTopDownTraversalClassificationItem::getTestingResult() {
return subSumTestingResult;
}
QList<CHierarchyNode *> *CNodeTopDownTraversalClassificationItem::getBranchLockedNodeList() {
return &branchLockedNodeList;
}
CNodeTopDownTraversalClassificationItem *CNodeTopDownTraversalClassificationItem::appendBranchLockedNodeList(QList<CHierarchyNode *> &nodeList) {
foreach (CHierarchyNode *node, nodeList) {
appendBranchLockedNode(node);
}
return this;
}
CNodeTopDownTraversalClassificationItem *CNodeTopDownTraversalClassificationItem::appendBranchLockedNode(CHierarchyNode *branchNode) {
if (!branchLockedNodeSet.contains(branchNode)) {
branchLockedNodeSet.insert(branchNode);
branchLockedNodeList.append(branchNode);
}
return this;
}
bool CNodeTopDownTraversalClassificationItem::hasDirectBranchLockedNode() {
return parLockNode != 0;
}
CHierarchyNode *CNodeTopDownTraversalClassificationItem::getDirectBranchLockedNode() {
return parLockNode;
}
CNodeTopDownTraversalClassificationItem *CNodeTopDownTraversalClassificationItem::setDirectBranchLockedNode(CHierarchyNode *parentLockedNode) {
parLockNode = parentLockedNode;
return this;
}
QList<CHierarchyNode *> *CNodeTopDownTraversalClassificationItem::getNewBranchNodeList() {
return &newBranchNodeList;
}
CNodeTopDownTraversalClassificationItem *CNodeTopDownTraversalClassificationItem::appendNewBranchNodeList(QList<CHierarchyNode *> &nodeList) {
newBranchNodeList << nodeList;
return this;
}
CNodeTopDownTraversalClassificationItem *CNodeTopDownTraversalClassificationItem::appendNewBranchNode(CHierarchyNode *branchNode) {
newBranchNodeList.append(branchNode);
return this;
}
CHierarchyNode *CNodeTopDownTraversalClassificationItem::getEquivalentTestingNode() {
return eqTestNode;
}
CNodeTopDownTraversalClassificationItem *CNodeTopDownTraversalClassificationItem::setEquivalentTestingNode(CHierarchyNode *equivalentTestingNode) {
eqTestNode = equivalentTestingNode;
return this;
}
CNodeTopDownTraversalClassificationItem* CNodeTopDownTraversalClassificationItem::setAlreadyTraversedDirectBlockedSuccessorNode(bool alredyTraversed) {
alredyTraversedDirectBlockedSuccessorNode = alredyTraversed;
return this;
}
bool CNodeTopDownTraversalClassificationItem::hasAlreadyTraversedDirectBlockedSuccessorNode() {
return alredyTraversedDirectBlockedSuccessorNode;
}
}; // end namespace Classifier
}; // end namespace Reasoner
}; // end namespace Konclude
|