Debian Codegraph @

Source/Reasoner/Taxonomy/CPCPrSuIpIsDiHierarchyNode.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_TAXONOMY_CPCPRSUIPISDIHIERARCHYNODE_H
22 #define KONCLUDE_REASONER_TAXONOMY_CPCPRSUIPISDIHIERARCHYNODE_H
23
24 // Qt includes
25 #include <QStringList>
26
27 // Namespace includes
28 #include "TaxonomySettings.h"
29
30 // Other includes
31 #include "Reasoner/Ontology/CConcept.h"
32 #include "Reasoner/Ontology/CAbbreviatedIRIName.h"
33
34 #include "KoncludeSettings.h"
35
36 // Logger includes
37 #include "Logger/CLogger.h"
38
39
40 namespace Konclude {
41
42 namespace Reasoner {
43
44 using namespace Ontology;
45
46 namespace Taxonomy {
47
48 #ifndef KONCLUDE_FORCE_ALL_DEBUG_DEACTIVATED
49
50 #define DEBUGCPCPRSUIPISDIHIERARCHYNODECONCEPTSTRINGS
51
52 #endif
53
54 /*!
55 *
56 * \class CPCPrSuIpIsDiHierarchyNode
57 * \author Andreas Steigmiller
58 * \version 0.1
59 * \brief TODO
60 *
61 */
62 class CPCPrSuIpIsDiHierarchyNode {
63 // public methods
64 public:
65 //! Constructor
66 CPCPrSuIpIsDiHierarchyNode(CConcept *representiveConcept);
67
68 //! Deconstructor
69 virtual ~CPCPrSuIpIsDiHierarchyNode();
70
71 virtual CPCPrSuIpIsDiHierarchyNode *addParentNode(CPCPrSuIpIsDiHierarchyNode *parentNode);
72 virtual CPCPrSuIpIsDiHierarchyNode *addChildNode(CPCPrSuIpIsDiHierarchyNode *childNode);
73
74 virtual CPCPrSuIpIsDiHierarchyNode *makeParent(CPCPrSuIpIsDiHierarchyNode *parentNode);
75 virtual CPCPrSuIpIsDiHierarchyNode *makeChild(CPCPrSuIpIsDiHierarchyNode *childNode);
76
77 virtual CPCPrSuIpIsDiHierarchyNode *addEquivalentConcept(CConcept *concept);
78
79 virtual bool hasChildNode(CPCPrSuIpIsDiHierarchyNode *node);
80 virtual bool hasParentNode(CPCPrSuIpIsDiHierarchyNode *node);
81
82 virtual CPCPrSuIpIsDiHierarchyNode *addPredecessorNode(CPCPrSuIpIsDiHierarchyNode *preNode);
83 virtual CPCPrSuIpIsDiHierarchyNode *addSuccessorNode(CPCPrSuIpIsDiHierarchyNode *succNode);
84
85 virtual CPCPrSuIpIsDiHierarchyNode *makePredecessor(CPCPrSuIpIsDiHierarchyNode *parentNode);
86 virtual CPCPrSuIpIsDiHierarchyNode *makeSuccessor(CPCPrSuIpIsDiHierarchyNode *childNode);
87
88 virtual bool hasSuccessorNode(CPCPrSuIpIsDiHierarchyNode *node);
89 virtual bool hasPredecessorNode(CPCPrSuIpIsDiHierarchyNode *node);
90
91
92 virtual CPCPrSuIpIsDiHierarchyNode *removeParent(CPCPrSuIpIsDiHierarchyNode *parentNode);
93 virtual CPCPrSuIpIsDiHierarchyNode *removeChild(CPCPrSuIpIsDiHierarchyNode *childNode);
94 virtual CPCPrSuIpIsDiHierarchyNode *removePredecessor(CPCPrSuIpIsDiHierarchyNode *predNode);
95 virtual CPCPrSuIpIsDiHierarchyNode *removeSuccessor(CPCPrSuIpIsDiHierarchyNode *succNode);
96
97
98
99 virtual QSet<CPCPrSuIpIsDiHierarchyNode *> *getParentNodeSet();
100 virtual QSet<CPCPrSuIpIsDiHierarchyNode *> *getChildNodeSet();
101 virtual QSet<CPCPrSuIpIsDiHierarchyNode *> *getPredecessorNodeSet();
102 virtual QSet<CPCPrSuIpIsDiHierarchyNode *> *getSuccessorNodeSet();
103 virtual QList<CConcept *> *getEquivalentConceptList();
104
105 virtual QList<CPCPrSuIpIsDiHierarchyNode *> getParentNodeList();
106 virtual QList<CPCPrSuIpIsDiHierarchyNode *> getChildNodeList();
107 virtual QList<CPCPrSuIpIsDiHierarchyNode *> getPredecessorNodeList();
108 virtual QList<CPCPrSuIpIsDiHierarchyNode *> getSuccessorNodeList();
109
110
111 virtual CPCPrSuIpIsDiHierarchyNode *addIncompatiblePredecessorNode(CPCPrSuIpIsDiHierarchyNode *incompNode);
112 virtual CPCPrSuIpIsDiHierarchyNode *makeIncompatiblePredecessor(CPCPrSuIpIsDiHierarchyNode *incompNode);
113 virtual bool hasIncompatiblePredecessorNode(CPCPrSuIpIsDiHierarchyNode *node);
114 virtual CPCPrSuIpIsDiHierarchyNode *removeIncompatiblePredecessorNode(CPCPrSuIpIsDiHierarchyNode *incompNode);
115
116
117 virtual CPCPrSuIpIsDiHierarchyNode *addDisjointNode(CPCPrSuIpIsDiHierarchyNode *disjNode);
118 virtual CPCPrSuIpIsDiHierarchyNode *makeDisjoint(CPCPrSuIpIsDiHierarchyNode *disjNode);
119 virtual bool hasDisjointNode(CPCPrSuIpIsDiHierarchyNode *node);
120 virtual CPCPrSuIpIsDiHierarchyNode *removeDisjointNode(CPCPrSuIpIsDiHierarchyNode *disjNode);
121
122
123 virtual CPCPrSuIpIsDiHierarchyNode *addIncompatibleSuccessorNode(CPCPrSuIpIsDiHierarchyNode *incompNode);
124 virtual CPCPrSuIpIsDiHierarchyNode *makeIncompatibleSuccessor(CPCPrSuIpIsDiHierarchyNode *incompNode);
125 virtual bool hasIncompatibleSuccessorNode(CPCPrSuIpIsDiHierarchyNode *node);
126 virtual CPCPrSuIpIsDiHierarchyNode *removeIncompatibleSuccessorNode(CPCPrSuIpIsDiHierarchyNode *incompNode);
127
128
129 virtual QSet<CPCPrSuIpIsDiHierarchyNode *> *getIncompatibleSuccessorNodeSet();
130 virtual QSet<CPCPrSuIpIsDiHierarchyNode *> *getIncompatiblePredecessorNodeSet();
131 virtual QList<CPCPrSuIpIsDiHierarchyNode *> getIncompatibleSuccessorNodeList();
132 virtual QList<CPCPrSuIpIsDiHierarchyNode *> getIncompatiblePredecessorNodeList();
133
134 virtual QSet<CPCPrSuIpIsDiHierarchyNode *> *getDisjointNodeSet();
135 virtual QList<CPCPrSuIpIsDiHierarchyNode *> getDisjointNodeList();
136
137 virtual CConcept *getOneEquivalentConcept();
138 virtual QString getEquivalentConceptsNodeString();
139 virtual QString getHierarchyConceptsNodeString(qint64 depth);
140
141 virtual QStringList getEquivalentConceptStringList(bool preferAbbreviatedNames);
142 virtual qint64 getEquivalentConceptCount();
143
144 virtual bool isActive();
145 virtual CPCPrSuIpIsDiHierarchyNode *setActive(bool activeNode = true);
146 virtual CPCPrSuIpIsDiHierarchyNode *setInactive(bool inactiveNode = true);
147
148 virtual bool isNeedExplicitMentioned();
149 virtual CPCPrSuIpIsDiHierarchyNode *setNeedExplicitMentioned(bool needsExplicitMentioned = true);
150
151 // protected methods
152 protected:
153 #ifdef DEBUGCPCPRSUIPISDIHIERARCHYNODECONCEPTSTRINGS
154 virtual CPCPrSuIpIsDiHierarchyNode *generateNodeStrings();
155 #endif
156
157 // protected variables
158 protected:
159 #ifdef DEBUGCPCPRSUIPISDIHIERARCHYNODECONCEPTSTRINGS
160 QStringList nodeStrings;
161 QStringList parentNodeStrings;
162 QStringList childNodeStrings;
163 QStringList precNodeStrings;
164 QStringList succNodeStrings;
165 QStringList incPrecNodeStrings;
166 QStringList incSuccNodeStrings;
167 QStringList disjointNodeStrings;
168 #endif
169
170 QList<CConcept *> eqConList;
171 qint64 eqConCount;
172
173 bool active;
174 bool mention;
175
176 QSet<CPCPrSuIpIsDiHierarchyNode *> parentNodeSet;
177 QSet<CPCPrSuIpIsDiHierarchyNode *> childNodeSet;
178
179 QSet<CPCPrSuIpIsDiHierarchyNode *> predNodeSet;
180 QSet<CPCPrSuIpIsDiHierarchyNode *> succNodeSet;
181
182 QSet<CPCPrSuIpIsDiHierarchyNode *> incompPredNodeSet;
183 QSet<CPCPrSuIpIsDiHierarchyNode *> incompSuccNodeSet;
184
185 QSet<CPCPrSuIpIsDiHierarchyNode *> disjointNodeSet;
186
187
188 // private methods
189 private:
190
191 // private variables
192 private:
193
194 };
195
196 }; // end namespace Taxonomy
197
198 }; // end namespace Reasoner
199
200 }; // end namespace Konclude
201
202 #endif // KONCLUDE_REASONER_TAXONOMY_CPCPRSUIPISDIHIERARCHYNODE_H