Debian Codegraph @

Source/Reasoner/Classifier/COptimizedKPSetClassOntologyClassificationItem.cpp

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 #include "COptimizedKPSetClassOntologyClassificationItem.h"
22
23
24 namespace Konclude {
25
26 namespace Reasoner {
27
28 namespace Classifier {
29
30
31 COptimizedKPSetClassOntologyClassificationItem::COptimizedKPSetClassOntologyClassificationItem(CConfigurationBase *configuration, CClassifierStatistics *nextClassificationStatistics)
32 : COntologyClassClassificationItem(configuration,nextClassificationStatistics) {
33
34 mTopSatTestItem = nullptr;
35 mBottomSatTestItem = nullptr;
36
37 mRemainingSatTests = 0;
38 mRunningSatTests = 0;
39
40 mSatisfiableTestingPhaseFinished = false;
41 mPossibleSubsumptionTestingPhaseFinished = false;
42
43 mRemainingPossibleSubsumptionTests = 0;
44 mRunningPossibleSubsumptionTests = 0;
45
46 mCalculatedPossibleSubsumCount = 0;
47 mCalculatedTruePossibleSubsumCount = 0;
48 mCalculatedFalsePossibleSubsumCount = 0;
49
50 mPossibleSubsumCount = 0;
51 mTruePossibleSubsumCount = 0;
52 mFalsePossibleSubsumCount = 0;
53
54 }
55
56 COptimizedKPSetClassOntologyClassificationItem::~COptimizedKPSetClassOntologyClassificationItem() {
57 }
58
59
60
61 QHash<CConcept*,COptimizedKPSetClassTestingItem*>* COptimizedKPSetClassOntologyClassificationItem::getConceptSatisfiableTestItemHash() {
62 return &mConceptSatItemHash;
63 }
64 QList<COptimizedKPSetClassTestingItem*>* COptimizedKPSetClassOntologyClassificationItem::getConceptSatisfiableTestItemContainer() {
65 return &mSatTestItemContainer;
66 }
67
68 COptimizedKPSetClassTestingItem* COptimizedKPSetClassOntologyClassificationItem::getTopConceptSatisfiableTestItem() {
69 return mTopSatTestItem;
70 }
71
72 COptimizedKPSetClassTestingItem* COptimizedKPSetClassOntologyClassificationItem::getBottomConceptSatisfiableTestItem() {
73 return mBottomSatTestItem;
74 }
75
76 QList<COptimizedKPSetClassTestingItem*>* COptimizedKPSetClassOntologyClassificationItem::getNextSatisfiableTestingItemList() {
77 return &mNextItemList;
78 }
79
80 QSet<COptimizedKPSetClassTestingItem*>* COptimizedKPSetClassOntologyClassificationItem::getNextCandidateSatisfiableTestingItemSet() {
81 return &mNextCandItemSet;
82 }
83
84 QSet<COptimizedKPSetClassTestingItem*>* COptimizedKPSetClassOntologyClassificationItem::getRemainingCandidateSatisfiableTestingItemSet() {
85 return &mRemainingCandItemSet;
86 }
87
88 QList<COptimizedKPSetClassTestingItem*>* COptimizedKPSetClassOntologyClassificationItem::getNextPossibleSubsumptionTestingItemList() {
89 return &mNextPossSubsumItemList;
90 }
91
92 QSet<COptimizedKPSetClassTestingItem*>* COptimizedKPSetClassOntologyClassificationItem::getCurrentPossibleSubsumptionTestingItemSet() {
93 return &mCurrentPossSubsumItemSet;
94 }
95
96
97
98 COptimizedKPSetClassOntologyClassificationItem* COptimizedKPSetClassOntologyClassificationItem::initTopBottomSatisfiableTestingItems(COptimizedKPSetClassTestingItem* topItem, COptimizedKPSetClassTestingItem* bottomItem) {
99 mTopSatTestItem = topItem;
100 mBottomSatTestItem = bottomItem;
101 return this;
102 }
103
104 COptimizedKPSetClassTestingItem* COptimizedKPSetClassOntologyClassificationItem::getConceptSatisfiableTestItem(CConcept* satTestConcept, bool create) {
105 COptimizedKPSetClassTestingItem* item = nullptr;
106 if (satTestConcept->getOperatorCode() == CCEQCAND) {
107 satTestConcept = satTestConcept->getOperandList()->getData();
108 }
109 item = mConceptSatItemHash.value(satTestConcept);
110 if (!item && create) {
111 item = new COptimizedKPSetClassTestingItem();
112 item->initSatisfiableTestingItem(satTestConcept,&mConceptRefLinkData);
113 mConceptSatItemHash.insert(satTestConcept,item);
114 mSatTestItemContainer.append(item);
115 }
116 return item;
117 }
118
119
120 bool COptimizedKPSetClassOntologyClassificationItem::hasAllSatisfiableTestsCompleted() {
121 return mRemainingSatTests <= 0 && mRunningSatTests <= 0;
122 }
123
124 bool COptimizedKPSetClassOntologyClassificationItem::hasRemainingSatisfiableTests() {
125 return mRemainingSatTests > 0;
126 }
127
128 cint64 COptimizedKPSetClassOntologyClassificationItem::getRemainingSatisfiableTestsCount() {
129 return mRemainingSatTests;
130 }
131
132 cint64 COptimizedKPSetClassOntologyClassificationItem::getRunningSatisfiableTestsCount() {
133 return mRunningSatTests;
134 }
135
136 COptimizedKPSetClassOntologyClassificationItem* COptimizedKPSetClassOntologyClassificationItem::incRemainingSatisfiableTestsCount(cint64 incCount) {
137 mRemainingSatTests += incCount;
138 return this;
139 }
140
141 COptimizedKPSetClassOntologyClassificationItem* COptimizedKPSetClassOntologyClassificationItem::incRunningSatisfiableTestsCount(cint64 incCount) {
142 mRunningSatTests += incCount;
143 return this;
144 }
145
146
147 COptimizedKPSetClassOntologyClassificationItem* COptimizedKPSetClassOntologyClassificationItem::decRemainingSatisfiableTestsCount(cint64 decCount) {
148 mRemainingSatTests -= decCount;
149 return this;
150 }
151
152 COptimizedKPSetClassOntologyClassificationItem* COptimizedKPSetClassOntologyClassificationItem::decRunningSatisfiableTestsCount(cint64 decCount) {
153 mRunningSatTests -= decCount;
154 return this;
155 }
156
157
158 QList<COptimizedKPSetClassTestingItem*>* COptimizedKPSetClassOntologyClassificationItem::getSatisfiableConceptItemList() {
159 return &mSatisfiableItemList;
160 }
161
162 COptimizedKPSetClassOntologyClassificationItem* COptimizedKPSetClassOntologyClassificationItem::addSatisfiableConceptItem(COptimizedKPSetClassTestingItem* item) {
163 mSatisfiableItemList.append(item);
164 return this;
165 }
166
167
168 QHash<CConcept*,CClassificationSatisfiableCalculationConceptReferenceLinking*>* COptimizedKPSetClassOntologyClassificationItem::getConceptReferenceLinkingDataHash() {
169 return &mConceptRefLinkData;
170 }
171
172 bool COptimizedKPSetClassOntologyClassificationItem::hasSatisfiableTestingPhaseFinished() {
173 return mSatisfiableTestingPhaseFinished;
174 }
175
176 bool COptimizedKPSetClassOntologyClassificationItem::hasPossibleSubsumptionTestingPhaseFinished() {
177 return mPossibleSubsumptionTestingPhaseFinished;
178 }
179
180 COptimizedKPSetClassOntologyClassificationItem* COptimizedKPSetClassOntologyClassificationItem::setSatisfiableTestingPhaseFinished(bool finished) {
181 mSatisfiableTestingPhaseFinished = finished;
182 return this;
183 }
184
185 COptimizedKPSetClassOntologyClassificationItem* COptimizedKPSetClassOntologyClassificationItem::setPossibleSubsumptionTestingPhaseFinished(bool finished) {
186 mPossibleSubsumptionTestingPhaseFinished = finished;
187 return this;
188 }
189
190 cint64 COptimizedKPSetClassOntologyClassificationItem::getRemainingPossibleSubsumptionTestsCount() {
191 return mRemainingPossibleSubsumptionTests;
192 }
193
194
195 cint64 COptimizedKPSetClassOntologyClassificationItem::hasRemainingPossibleSubsumptionTests() {
196 return mRemainingPossibleSubsumptionTests > 0;
197 }
198
199 COptimizedKPSetClassOntologyClassificationItem* COptimizedKPSetClassOntologyClassificationItem::incRemainingPossibleSubsumptionTestsCount(cint64 incCount) {
200 mRemainingPossibleSubsumptionTests += incCount;
201 return this;
202 }
203
204 COptimizedKPSetClassOntologyClassificationItem* COptimizedKPSetClassOntologyClassificationItem::decRemainingPossibleSubsumptionTestsCount(cint64 decCount) {
205 mRemainingPossibleSubsumptionTests -= decCount;
206 return this;
207 }
208
209 COptimizedKPSetClassOntologyClassificationItem* COptimizedKPSetClassOntologyClassificationItem::setRemainingPossibleSubsumptionTestsCount(cint64 testCount) {
210 mRemainingPossibleSubsumptionTests = testCount;
211 return this;
212 }
213
214 QSet<COptimizedKPSetClassTestingItem*>* COptimizedKPSetClassOntologyClassificationItem::getRemainingPossibleSubsumptionClassTestingSet() {
215 return &mRemPossClassTestingSet;
216 }
217
218 cint64 COptimizedKPSetClassOntologyClassificationItem::getRemainingPossibleSubsumptionClassTestingCount() {
219 return mRemPossClassTestingSet.count();
220 }
221
222 COptimizedKPSetClassOntologyClassificationItem* COptimizedKPSetClassOntologyClassificationItem::incRunningPossibleSubsumptionTestsCount(cint64 incCount) {
223 mRunningPossibleSubsumptionTests += incCount;
224 return this;
225 }
226
227 COptimizedKPSetClassOntologyClassificationItem* COptimizedKPSetClassOntologyClassificationItem::decRunningPossibleSubsumptionTestsCount(cint64 decCount) {
228 mRunningPossibleSubsumptionTests -= decCount;
229 return this;
230 }
231
232 QSet<CConcept*>* COptimizedKPSetClassOntologyClassificationItem::getEquivaltentConceptNonCandidateSet() {
233 return &mEquivConNonCandidateSet;
234 }
235
236 CBOXHASH<CConcept*,CConcept*>* COptimizedKPSetClassOntologyClassificationItem::getEquivalentConceptCandidateHash() {
237 return &mEquivConCandidateHash;
238 }
239
240
241 COptimizedKPSetClassOntologyClassificationItem* COptimizedKPSetClassOntologyClassificationItem::addMemoryPools(CMemoryPool* memoryPools) {
242 mMemoryPoolContainer.appendMemoryPool(memoryPools);
243 return this;
244 }
245
246 CMemoryPool* COptimizedKPSetClassOntologyClassificationItem::takeMemoryPools() {
247 return mMemoryPoolContainer.takeMemoryPools();
248 }
249
250
251 cint64 COptimizedKPSetClassOntologyClassificationItem::getCalculatedPossibleSubsumerCount() {
252 return mCalculatedPossibleSubsumCount;
253 }
254
255 cint64 COptimizedKPSetClassOntologyClassificationItem::getCalculatedTruePossibleSubsumerCount() {
256 return mCalculatedTruePossibleSubsumCount;
257 }
258
259 cint64 COptimizedKPSetClassOntologyClassificationItem::getCalculatedFalsePossibleSubsumerCount() {
260 return mCalculatedFalsePossibleSubsumCount;
261 }
262
263 COptimizedKPSetClassOntologyClassificationItem* COptimizedKPSetClassOntologyClassificationItem::setCalculatedPossibleSubsumerCount(cint64 subsumCount) {
264 mCalculatedPossibleSubsumCount = subsumCount;
265 return this;
266 }
267
268 COptimizedKPSetClassOntologyClassificationItem* COptimizedKPSetClassOntologyClassificationItem::setCalculatedTruePossibleSubsumerCount(cint64 subsumCount) {
269 mCalculatedTruePossibleSubsumCount = subsumCount;
270 return this;
271 }
272
273 COptimizedKPSetClassOntologyClassificationItem* COptimizedKPSetClassOntologyClassificationItem::setCalculatedFalsePossibleSubsumerCount(cint64 subsumCount) {
274 mCalculatedFalsePossibleSubsumCount = subsumCount;
275 return this;
276 }
277
278
279 COptimizedKPSetClassOntologyClassificationItem* COptimizedKPSetClassOntologyClassificationItem::incCalculatedPossibleSubsumerCount(cint64 incSubsumCount) {
280 mCalculatedPossibleSubsumCount += incSubsumCount;
281 return this;
282 }
283
284 COptimizedKPSetClassOntologyClassificationItem* COptimizedKPSetClassOntologyClassificationItem::incCalculatedTruePossibleSubsumerCount(cint64 incSubsumCount) {
285 mCalculatedTruePossibleSubsumCount += incSubsumCount;
286 return this;
287 }
288
289 COptimizedKPSetClassOntologyClassificationItem* COptimizedKPSetClassOntologyClassificationItem::incCalculatedFalsePossibleSubsumerCount(cint64 incSubsumCount) {
290 mCalculatedFalsePossibleSubsumCount += incSubsumCount;
291 return this;
292 }
293
294
295
296 cint64 COptimizedKPSetClassOntologyClassificationItem::getPossibleSubsumerCount() {
297 return mPossibleSubsumCount;
298 }
299
300 cint64 COptimizedKPSetClassOntologyClassificationItem::getTruePossibleSubsumerCount() {
301 return mTruePossibleSubsumCount;
302 }
303
304 cint64 COptimizedKPSetClassOntologyClassificationItem::getFalsePossibleSubsumerCount() {
305 return mFalsePossibleSubsumCount;
306 }
307
308 COptimizedKPSetClassOntologyClassificationItem* COptimizedKPSetClassOntologyClassificationItem::setPossibleSubsumerCount(cint64 subsumCount) {
309 mPossibleSubsumCount = subsumCount;
310 return this;
311 }
312
313 COptimizedKPSetClassOntologyClassificationItem* COptimizedKPSetClassOntologyClassificationItem::setTruePossibleSubsumerCount(cint64 subsumCount) {
314 mTruePossibleSubsumCount = subsumCount;
315 return this;
316 }
317
318 COptimizedKPSetClassOntologyClassificationItem* COptimizedKPSetClassOntologyClassificationItem::setFalsePossibleSubsumerCount(cint64 subsumCount) {
319 mFalsePossibleSubsumCount = subsumCount;
320 return this;
321 }
322
323
324 COptimizedKPSetClassOntologyClassificationItem* COptimizedKPSetClassOntologyClassificationItem::incPossibleSubsumerCount(cint64 incSubsumCount) {
325 mPossibleSubsumCount += incSubsumCount;
326 return this;
327 }
328
329 COptimizedKPSetClassOntologyClassificationItem* COptimizedKPSetClassOntologyClassificationItem::incTruePossibleSubsumerCount(cint64 incSubsumCount) {
330 mTruePossibleSubsumCount += incSubsumCount;
331 return this;
332 }
333
334 COptimizedKPSetClassOntologyClassificationItem* COptimizedKPSetClassOntologyClassificationItem::incFalsePossibleSubsumerCount(cint64 incSubsumCount) {
335 mFalsePossibleSubsumCount += incSubsumCount;
336 return this;
337 }
338
339 }; // end namespace Classifier
340
341 }; // end namespace Reasoner
342
343 }; // end namespace Konclude