Debian Codegraph @

Source/Reasoner/Classifier/COptimizedClassExtractedSaturationOntologyClassificationItem.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 "COptimizedClassExtractedSaturationOntologyClassificationItem.h"
22
23
24 namespace Konclude {
25
26 namespace Reasoner {
27
28 namespace Classifier {
29
30
31 COptimizedClassExtractedSaturationOntologyClassificationItem::COptimizedClassExtractedSaturationOntologyClassificationItem(CConfigurationBase *configuration, CClassifierStatistics *nextClassificationStatistics)
32 : COntologyClassClassificationItem(configuration,nextClassificationStatistics) {
33
34 mTopSatTestItem = nullptr;
35 mBottomSatTestItem = nullptr;
36 }
37
38 QHash<CConcept*,COptimizedClassExtractedSaturationSatisfiableTestingItem*>* COptimizedClassExtractedSaturationOntologyClassificationItem::getClassSatisfiableTestItemHash() {
39 return &mClassSatItemHash;
40 }
41 QList<COptimizedClassExtractedSaturationSatisfiableTestingItem*>* COptimizedClassExtractedSaturationOntologyClassificationItem::getClassSatisfiableTestItemList() {
42 return &mClassSatTestItemContainer;
43 }
44
45
46 COptimizedClassExtractedSaturationSatisfiableTestingItem* COptimizedClassExtractedSaturationOntologyClassificationItem::getTopConceptSatisfiableTestItem() {
47 return mTopSatTestItem;
48 }
49
50 COptimizedClassExtractedSaturationSatisfiableTestingItem* COptimizedClassExtractedSaturationOntologyClassificationItem::getBottomConceptSatisfiableTestItem() {
51 return mBottomSatTestItem;
52 }
53
54
55 COptimizedClassExtractedSaturationOntologyClassificationItem* COptimizedClassExtractedSaturationOntologyClassificationItem::initTopBottomSatisfiableTestingItems(COptimizedClassExtractedSaturationSatisfiableTestingItem* topItem, COptimizedClassExtractedSaturationSatisfiableTestingItem* bottomItem) {
56 mTopSatTestItem = topItem;
57 mBottomSatTestItem = bottomItem;
58 return this;
59 }
60
61 COptimizedClassExtractedSaturationSatisfiableTestingItem* COptimizedClassExtractedSaturationOntologyClassificationItem::getClassSatisfiableTestItem(CConcept* satTestConcept, bool create) {
62 COptimizedClassExtractedSaturationSatisfiableTestingItem* item = nullptr;
63 item = mClassSatItemHash.value(satTestConcept);
64 if (!item && create) {
65 item = new COptimizedClassExtractedSaturationSatisfiableTestingItem();
66 item->initSatisfiableTestingItem(satTestConcept);
67 mClassSatItemHash.insert(satTestConcept,item);
68 mClassSatTestItemContainer.append(item);
69 }
70 return item;
71 }
72
73
74 }; // end namespace Classifier
75
76 }; // end namespace Reasoner
77
78 }; // end namespace Konclude