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
|
/*
* 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/>.
*
*/
#ifndef KONCLUDE_REASONER_CLASSIFIER_CNODETRAVERSALORDERCLASSIFICATIONITEM_H
#define KONCLUDE_REASONER_CLASSIFIER_CNODETRAVERSALORDERCLASSIFICATIONITEM_H
// Libraries includes
// Namespace includes
#include "ClassifierSettings.h"
#include "CClassifierStatistics.h"
// Other includes
#include "Reasoner/Ontology/CConcreteOntology.h"
#include "Reasoner/Taxonomy/CTaxonomy.h"
// Logger includes
#include "Logger/CLogger.h"
namespace Konclude {
namespace Reasoner {
using namespace Ontology;
using namespace Taxonomy;
namespace Classifier {
/*!
*
* \class CNodeTraversalOrderClassificationItem
* \author Andreas Steigmiller
* \version 0.1
* \brief TODO
*
*/
class CNodeTraversalOrderClassificationItem {
// public methods
public:
//! Constructor
CNodeTraversalOrderClassificationItem(CHierarchyNode *node, CHierarchyNode *parentNode);
//! Destructor
virtual ~CNodeTraversalOrderClassificationItem();
virtual CHierarchyNode *getTraversalNode();
virtual CHierarchyNode *getParentTestingNode();
virtual CHierarchyNode *getParentAgainstTestingNode();
virtual CNodeTraversalOrderClassificationItem *setParentTestingNode(CHierarchyNode *node);
virtual CNodeTraversalOrderClassificationItem *setParentAgainstTestingNode(CHierarchyNode *node);
virtual bool isParentAgainstTesting();
virtual QList<CHierarchyNode *> *getOrderTraversalList();
virtual CNodeTraversalOrderClassificationItem *appendOrderTraversalList(QList<CHierarchyNode *> &nodeList);
virtual QList<CHierarchyNode *> *getAgainstOrderTraversalList();
virtual CNodeTraversalOrderClassificationItem *appendAgainstOrderTraversalList(QList<CHierarchyNode *> &nodeList);
// protected methods
protected:
// protected variables
protected:
CHierarchyNode *traversalNode;
CHierarchyNode *parentTestNode;
CHierarchyNode *parentAgainstTestNode;
bool againstTested;
QList<CHierarchyNode *> orderTraversalList;
QList<CHierarchyNode *> againstOrderTraversalList;
// private methods
private:
// private variables
private:
};
}; // end namespace Classifier
}; // end namespace Reasoner
}; // end namespace Konclude
#endif // KONCLUDE_REASONER_CLASSIFIER_CNODETRAVERSALORDERCLASSIFICATIONITEM_H
|
