Debian Codegraph @

Source/Reasoner/Classifier/COptimizedClassExtractedSaturationSatisfiableTestingItem.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 "COptimizedClassExtractedSaturationSatisfiableTestingItem.h"
22
23
24 namespace Konclude {
25
26 namespace Reasoner {
27
28 namespace Classifier {
29
30
31 COptimizedClassExtractedSaturationSatisfiableTestingItem::COptimizedClassExtractedSaturationSatisfiableTestingItem() {
32 }
33
34
35 COptimizedClassExtractedSaturationSatisfiableTestingItem* COptimizedClassExtractedSaturationSatisfiableTestingItem::initSatisfiableTestingItem(CConcept* satTestConcept) {
36 mTestConcept = satTestConcept;
37 mExtractedSubsumerCount = 0;
38 mConSatHierNode = nullptr;
39 mDirectSubsumerItem = nullptr;
40 mPredecessorItem = false;
41 mEquiItem = false;
42 return this;
43 }
44
45
46 CConcept* COptimizedClassExtractedSaturationSatisfiableTestingItem::getTestingConcept() {
47 return mTestConcept;
48 }
49
50
51 CHierarchyNode* COptimizedClassExtractedSaturationSatisfiableTestingItem::getSatisfiableConceptHierarchyNode() {
52 return mConSatHierNode;
53 }
54
55 COptimizedClassExtractedSaturationSatisfiableTestingItem* COptimizedClassExtractedSaturationSatisfiableTestingItem::setSatisfiableConceptHierarchyNode(CHierarchyNode* hierNode) {
56 mConSatHierNode = hierNode;
57 return this;
58 }
59
60
61 QList<COptimizedClassExtractedSaturationSatisfiableTestingItem*>* COptimizedClassExtractedSaturationSatisfiableTestingItem::getSubsumingConceptItemList() {
62 return &mSubsumingConceptItemList;
63 }
64
65 COptimizedClassExtractedSaturationSatisfiableTestingItem* COptimizedClassExtractedSaturationSatisfiableTestingItem::setDirectSubsumer(COptimizedClassExtractedSaturationSatisfiableTestingItem* subsumingItem) {
66 mDirectSubsumerItem = subsumingItem;
67 return this;
68 }
69
70 COptimizedClassExtractedSaturationSatisfiableTestingItem* COptimizedClassExtractedSaturationSatisfiableTestingItem::getDirectSubsumer() {
71 return mDirectSubsumerItem;
72 }
73
74
75 bool COptimizedClassExtractedSaturationSatisfiableTestingItem::hasDirectSubsumer() {
76 return mDirectSubsumerItem != nullptr;
77 }
78
79
80 COptimizedClassExtractedSaturationSatisfiableTestingItem* COptimizedClassExtractedSaturationSatisfiableTestingItem::setExtractionSubsumerCount(cint64 subsumerCount) {
81 mExtractedSubsumerCount = subsumerCount;
82 return this;
83 }
84
85 cint64 COptimizedClassExtractedSaturationSatisfiableTestingItem::getExtractionSubsumerCount() const {
86 return mExtractedSubsumerCount;
87 }
88
89
90
91 COptimizedClassExtractedSaturationSatisfiableTestingItem* COptimizedClassExtractedSaturationSatisfiableTestingItem::addSubsumingConceptItem(COptimizedClassExtractedSaturationSatisfiableTestingItem* subsumingItem) {
92 mSubsumingConceptItemList.append(subsumingItem);
93
94 //QString iriClassNameString = CIRIName::getRecentIRIName(subsumingItem->getSatisfiableConcept()->getClassNameLinker());
95 //mSubsumingConceptString += QString("%1\r\n").arg(iriClassNameString);
96
97 return this;
98 }
99
100
101 CConceptSubsumerObserver* COptimizedClassExtractedSaturationSatisfiableTestingItem::tellConceptSupsumption(CConcept* subsumedConcept, CConcept* subsumerConcept) {
102 CConceptProcessData* conProData = (CConceptProcessData*)subsumerConcept->getConceptData();
103 CConceptSatisfiableReferenceLinkingData* conSatRefLinking = (CConceptSatisfiableReferenceLinkingData*)conProData->getConceptReferenceLinking();
104 if (conSatRefLinking) {
105 COptimizedClassExtractedSaturationSatisfiableTestingItem* subsumerClassSaturationItem = (COptimizedClassExtractedSaturationSatisfiableTestingItem*)conSatRefLinking->getClassifierReferenceLinkingData();
106 addSubsumingConceptItem(subsumerClassSaturationItem);
107 }
108 return this;
109 }
110
111
112
113 bool itemSortGreaterThan(const COptimizedClassExtractedSaturationSatisfiableTestingItem* item1, const COptimizedClassExtractedSaturationSatisfiableTestingItem* item2) {
114 return item1->getExtractionSubsumerCount() > item2->getExtractionSubsumerCount();
115 }
116
117 QList<COptimizedClassExtractedSaturationSatisfiableTestingItem*>* COptimizedClassExtractedSaturationSatisfiableTestingItem::sortSubsumingConceptItemList() {
118 qSort(mSubsumingConceptItemList.begin(),mSubsumingConceptItemList.end(),itemSortGreaterThan);
119 return &mSubsumingConceptItemList;
120 }
121
122 bool COptimizedClassExtractedSaturationSatisfiableTestingItem::isEquivalentItem() {
123 return mEquiItem;
124 }
125
126 COptimizedClassExtractedSaturationSatisfiableTestingItem* COptimizedClassExtractedSaturationSatisfiableTestingItem::setEquivalentItem(bool equivalent) {
127 mEquiItem = equivalent;
128 return this;
129 }
130
131
132 bool COptimizedClassExtractedSaturationSatisfiableTestingItem::isPredecessorItem() {
133 return mPredecessorItem;
134 }
135
136 COptimizedClassExtractedSaturationSatisfiableTestingItem* COptimizedClassExtractedSaturationSatisfiableTestingItem::setPredecessorItem(bool predecessorItem) {
137 mPredecessorItem = predecessorItem;
138 return this;
139 }
140
141 }; // end namespace Classifier
142
143 }; // end namespace Reasoner
144
145 }; // end namespace Konclude