Debian Codegraph @

Source/Reasoner/Taxonomy/CAbstractHierarchyBuilder.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_CABSTRACTHIERARCHYBUILDER_H
22 #define KONCLUDE_REASONER_TAXONOMY_CABSTRACTHIERARCHYBUILDER_H
23
24 // Libraries includes
25
26
27 // Namespace includes
28 #include "TaxonomySettings.h"
29
30 // Other includes
31
32
33 // Logger includes
34 #include "Logger/CLogger.h"
35
36
37 namespace Konclude {
38
39 namespace Reasoner {
40
41 namespace Taxonomy {
42
43
44 /*!
45 *
46 * \class CAbstractHierarchyBuilder
47 * \author Andreas Steigmiller
48 * \version 0.1
49 * \brief TODO
50 *
51 */
52 template<class T, class N, class E>
53 class CAbstractHierarchyBuilder {
54 // public methods
55 public:
56 //! Constructor
57 CAbstractHierarchyBuilder();
58
59
60 virtual N* getTopHierarchyNode() = 0;
61 virtual N* getBottomHierarchyNode() = 0;
62
63 virtual N* getHierarchyNode(const E& element, bool create) = 0;
64
65 virtual bool hasHierarchyNode(const E& element) = 0;
66
67 T* setElementSatisfiable(const E& element, bool satisfiable);
68 T* setElementSatisfiable(const E& element);
69 T* setElementUnsatisfiable(const E& element);
70 T* setElementSubsumption(const E& subsumerElement, const E& subsumedElement);
71 T* setElementEquivalence(const E& element1, const E& element2);
72
73
74 T* setNodeSatisfiable(N* node, bool satisfiable);
75 virtual T* setNodeSatisfiable(N* node) = 0;
76 virtual T* setNodeUnsatisfiable(N* node) = 0;
77 virtual T* setNodeSubsumption(N* subsumerNode, N* subsumedNode) = 0;
78 virtual T* setNodeEquivalence(N* eqNode1, N* eqNode2) = 0;
79
80
81 // protected methods
82 protected:
83
84 // protected variables
85 protected:
86
87 // private methods
88 private:
89
90 // private variables
91 private:
92
93 };
94
95 }; // end namespace Taxonomy
96
97 }; // end namespace Reasoner
98
99 }; // end namespace Konclude
100
101 #include "CAbstractHierarchyBuilder.cpp"
102
103 #endif // KONCLUDE_REASONER_TAXONOMY_CABSTRACTHIERARCHYBUILDER_H