/*
* Copyright (C) 2013-2015, 2019 by the Konclude Developer Team.
*
* This file is part of the reasoning system Konclude.
* For details and support, see .
*
* 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 .
*
*/
#include "CNodePredecessorPositionClassificationItem.h"
namespace Konclude {
namespace Reasoner {
namespace Classifier {
CNodePredecessorPositionClassificationItem::CNodePredecessorPositionClassificationItem(CHierarchyNode *node) {
testNode = node;
initPredNodelist<getParentNodeList();
}
CNodePredecessorPositionClassificationItem::~CNodePredecessorPositionClassificationItem() {
}
CHierarchyNode *CNodePredecessorPositionClassificationItem::getTestingNode() {
return testNode;
}
CNodePredecessorPositionClassificationItem *CNodePredecessorPositionClassificationItem::appendPredecessorNode(CHierarchyNode *node) {
predNodelist.append(node);
return this;
}
QList *CNodePredecessorPositionClassificationItem::getPredecessorNodeList() {
return &predNodelist;
}
QList *CNodePredecessorPositionClassificationItem::getInitializationPredecessorNodeList() {
return &initPredNodelist;
}
bool CNodePredecessorPositionClassificationItem::isTestingConcluded() {
return predNodelist.isEmpty() && initPredNodelist.isEmpty();
}
}; // end namespace Classifier
}; // end namespace Reasoner
}; // end namespace Konclude