Debian Codegraph @

Source/Reasoner/Classifier/CNodeTraversalOrderClassificationItem.cpp

raw
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 "CNodeTraversalOrderClassificationItem.h"
22
23
24 namespace Konclude {
25
26 namespace Reasoner {
27
28 namespace Classifier {
29
30
31 CNodeTraversalOrderClassificationItem::CNodeTraversalOrderClassificationItem(CHierarchyNode *node, CHierarchyNode *parentNode) {
32 parentTestNode = parentNode;
33 traversalNode = node;
34 parentAgainstTestNode = 0;
35 againstTested = false;
36 }
37
38
39 CNodeTraversalOrderClassificationItem::~CNodeTraversalOrderClassificationItem() {
40 }
41
42 CHierarchyNode *CNodeTraversalOrderClassificationItem::getTraversalNode() {
43 return traversalNode;
44 }
45
46 CHierarchyNode *CNodeTraversalOrderClassificationItem::getParentTestingNode() {
47 return parentTestNode;
48 }
49
50 CHierarchyNode *CNodeTraversalOrderClassificationItem::getParentAgainstTestingNode() {
51 return parentAgainstTestNode;
52 }
53
54 CNodeTraversalOrderClassificationItem *CNodeTraversalOrderClassificationItem::setParentTestingNode(CHierarchyNode *node) {
55 parentTestNode = node;
56 return this;
57 }
58
59 QList<CHierarchyNode *> *CNodeTraversalOrderClassificationItem::getOrderTraversalList() {
60 return &orderTraversalList;
61 }
62
63 CNodeTraversalOrderClassificationItem *CNodeTraversalOrderClassificationItem::appendOrderTraversalList(QList<CHierarchyNode *> &nodeList) {
64 orderTraversalList << nodeList;
65 return this;
66 }
67
68 CNodeTraversalOrderClassificationItem *CNodeTraversalOrderClassificationItem::setParentAgainstTestingNode(CHierarchyNode *node) {
69 parentAgainstTestNode = node;
70 againstTested = true;
71 return this;
72 }
73
74 bool CNodeTraversalOrderClassificationItem::isParentAgainstTesting() {
75 return againstTested;
76 }
77
78 QList<CHierarchyNode *> *CNodeTraversalOrderClassificationItem::getAgainstOrderTraversalList() {
79 return &againstOrderTraversalList;
80 }
81
82 CNodeTraversalOrderClassificationItem *CNodeTraversalOrderClassificationItem::appendAgainstOrderTraversalList(QList<CHierarchyNode *> &nodeList) {
83 againstOrderTraversalList << nodeList;
84 return this;
85 }
86
87 }; // end namespace Classifier
88
89 }; // end namespace Reasoner
90
91 }; // end namespace Konclude