Debian Codegraph @

Source/Reasoner/Kernel/Task/CSatisfiableTaskRepresentativeBackendUpdatingAdapter.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_KERNEL_TASK_CSATISFIABLETASKREPRESENTATIVEBACKENDUPDATINGADAPTER_H
22 #define KONCLUDE_REASONER_KERNEL_TASK_CSATISFIABLETASKREPRESENTATIVEBACKENDUPDATINGADAPTER_H
23
24 // Libraries includes
25
26
27 // Namespace includes
28 #include "TaskSettings.h"
29
30
31 // Other includes
32 #include "Reasoner/Consistiser/CIndividualPrecomputationCoordinationHash.h"
33
34 #include "Reasoner/Ontology/CIndividualReference.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 using namespace Consistiser;
46
47 namespace Kernel {
48
49 namespace Task {
50
51
52 /*!
53 *
54 * \class CSatisfiableTaskRepresentativeBackendUpdatingAdapter
55 * \author Andreas Steigmiller
56 * \version 0.1
57 * \brief TODO
58 *
59 */
60 class CSatisfiableTaskRepresentativeBackendUpdatingAdapter {
61 // public methods
62 public:
63 //! Constructor
64 CSatisfiableTaskRepresentativeBackendUpdatingAdapter(CIndividualPrecomputationCoordinationHash* indiComCoordHash = nullptr, bool *unstatFlagPointer = nullptr, bool *expansionLimitReachedFlagPointer = nullptr);
65
66
67 CIndividualPrecomputationCoordinationHash* getIndividualComputationCoordinationHash();
68 CSatisfiableTaskRepresentativeBackendUpdatingAdapter* setIndividualComputationCoordinationHash(CIndividualPrecomputationCoordinationHash* indiComCoordHash);
69
70 cint64 getFirstIndividualRecomputationId();
71 cint64 getRepresentativeCacheRecomputationId();
72
73
74 cint64 getIndividualComputationCount();
75 cint64 getAdditionalIndividualComputationSize();
76 CSatisfiableTaskRepresentativeBackendUpdatingAdapter* setAdditionalIndividualComputationSize(cint64 size);
77
78 CSatisfiableTaskRepresentativeBackendUpdatingAdapter* setFirstIndividualRecomputationId(cint64 id);
79 CSatisfiableTaskRepresentativeBackendUpdatingAdapter* setRepresentativeCacheRecomputationId(cint64 id);
80
81
82 QList<CIndividualReference>* getIndividualComputationList();
83 CSatisfiableTaskRepresentativeBackendUpdatingAdapter* addIndividualComputations(QList<CIndividualReference>& indiRefList);
84
85
86 CSatisfiableTaskRepresentativeBackendUpdatingAdapter* setAllAssertionIndividualId(cint64 id);
87 cint64 getAllAssertionIndividualId();
88
89 bool hasUnsatisfiableComputed();
90 bool hasExpansionLimitReached();
91
92
93 CSatisfiableTaskRepresentativeBackendUpdatingAdapter* setExpansionLimitReached();
94 CSatisfiableTaskRepresentativeBackendUpdatingAdapter* setUnsatisfiableComputed();
95
96
97 bool isExpansionPropagationCutted();
98 CSatisfiableTaskRepresentativeBackendUpdatingAdapter* setExpansionPropagationCutted(bool cutted);
99
100
101 // protected methods
102 protected:
103
104 // protected variables
105 protected:
106 CIndividualPrecomputationCoordinationHash* mIndiCompCoordHash;
107 cint64 mFirstIndividualID;
108 cint64 mRepCacheCompID;
109 cint64 mAllAssertionIndiID = -1;
110
111 bool* mUnstatFlagPointer;
112 bool* mExpansionLimitReachedFlagPointer;
113 QList<CIndividualReference> mIndiComputationList;
114 cint64 mAdditionalIndividualComputationCount = 0;
115
116 bool mExpansionPropagationCutted;
117
118
119 // private methods
120 private:
121
122 // private variables
123 private:
124
125 };
126
127 }; // end namespace Task
128
129 }; // end namespace Kernel
130
131 }; // end namespace Reasoner
132
133 }; // end namespace Konclude
134
135 #endif // KONCLUDE_REASONER_KERNEL_TASK_CSATISFIABLETASKREPRESENTATIVEBACKENDUPDATINGADAPTER_H