Debian Codegraph @

Source/Reasoner/Classifier/CNodeTraversalOrderClassificationItem.h

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 #ifndef KONCLUDE_REASONER_CLASSIFIER_CNODETRAVERSALORDERCLASSIFICATIONITEM_H
22 #define KONCLUDE_REASONER_CLASSIFIER_CNODETRAVERSALORDERCLASSIFICATIONITEM_H
23
24 // Libraries includes
25
26
27 // Namespace includes
28 #include "ClassifierSettings.h"
29 #include "CClassifierStatistics.h"
30
31 // Other includes
32 #include "Reasoner/Ontology/CConcreteOntology.h"
33
34 #include "Reasoner/Taxonomy/CTaxonomy.h"
35
36
37 // Logger includes
38 #include "Logger/CLogger.h"
39
40
41 namespace Konclude {
42
43 namespace Reasoner {
44
45 using namespace Ontology;
46 using namespace Taxonomy;
47
48 namespace Classifier {
49
50
51 /*!
52 *
53 * \class CNodeTraversalOrderClassificationItem
54 * \author Andreas Steigmiller
55 * \version 0.1
56 * \brief TODO
57 *
58 */
59 class CNodeTraversalOrderClassificationItem {
60 // public methods
61 public:
62 //! Constructor
63 CNodeTraversalOrderClassificationItem(CHierarchyNode *node, CHierarchyNode *parentNode);
64
65 //! Destructor
66 virtual ~CNodeTraversalOrderClassificationItem();
67
68 virtual CHierarchyNode *getTraversalNode();
69 virtual CHierarchyNode *getParentTestingNode();
70 virtual CHierarchyNode *getParentAgainstTestingNode();
71 virtual CNodeTraversalOrderClassificationItem *setParentTestingNode(CHierarchyNode *node);
72 virtual CNodeTraversalOrderClassificationItem *setParentAgainstTestingNode(CHierarchyNode *node);
73 virtual bool isParentAgainstTesting();
74
75 virtual QList<CHierarchyNode *> *getOrderTraversalList();
76 virtual CNodeTraversalOrderClassificationItem *appendOrderTraversalList(QList<CHierarchyNode *> &nodeList);
77
78 virtual QList<CHierarchyNode *> *getAgainstOrderTraversalList();
79 virtual CNodeTraversalOrderClassificationItem *appendAgainstOrderTraversalList(QList<CHierarchyNode *> &nodeList);
80
81 // protected methods
82 protected:
83
84 // protected variables
85 protected:
86 CHierarchyNode *traversalNode;
87 CHierarchyNode *parentTestNode;
88 CHierarchyNode *parentAgainstTestNode;
89 bool againstTested;
90
91 QList<CHierarchyNode *> orderTraversalList;
92 QList<CHierarchyNode *> againstOrderTraversalList;
93
94 // private methods
95 private:
96
97 // private variables
98 private:
99
100 };
101
102 }; // end namespace Classifier
103
104 }; // end namespace Reasoner
105
106 }; // end namespace Konclude
107
108 #endif // KONCLUDE_REASONER_CLASSIFIER_CNODETRAVERSALORDERCLASSIFICATIONITEM_H