Debian Codegraph @

Source/Reasoner/Classifier/COntologyClassificationItem.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 "COntologyClassificationItem.h"
22
23
24 namespace Konclude {
25
26 namespace Reasoner {
27
28 namespace Classifier {
29
30
31 COntologyClassificationItem::COntologyClassificationItem(CConfigurationBase *configuration, CClassifierStatistics *nextClassificationStatistics) {
32 statistics = new CClassifierStatistics(nextClassificationStatistics);
33 config = new CCalculationConfigurationExtension(configuration,0);
34
35 mClassificationStatCollStrings = new CClassificationStatisticsCollectionStrings();
36
37 mConfCollectProcessStatistics = CConfigDataReader::readConfigBoolean(config,"Konclude.Calculation.Classification.CollectProcessStatistics",true);;
38
39 mClassifyProcessingStepData = nullptr;
40
41 mIndiDepTrackingCollector = nullptr;
42
43 mInitTime.start();
44 }
45
46
47 COntologyClassificationItem::~COntologyClassificationItem() {
48 delete statistics;
49 delete config;
50 delete mIndiDepTrackingCollector;
51 }
52
53
54
55
56 CConcreteOntology *COntologyClassificationItem::getOntology() {
57 return onto;
58 }
59
60
61 CCalculationConfigurationExtension *COntologyClassificationItem::getCalculationConfiguration() {
62 return config;
63 }
64
65
66
67 COntologyClassificationItem *COntologyClassificationItem::incCurrentCalculatingCount(qint64 incCount) {
68 currentCalculatingCount += incCount;
69 return this;
70 }
71
72 COntologyClassificationItem *COntologyClassificationItem::decCurrentCalculatingCount(qint64 decCount) {
73 currentCalculatingCount -= decCount;
74 return this;
75 }
76
77 COntologyClassificationItem *COntologyClassificationItem::setHasRemainingTests(bool moreTests) {
78 remainingTests = moreTests;
79 return this;
80 }
81
82 bool COntologyClassificationItem::hasRemainingTests() {
83 return remainingTests || currentCalculatingCount > 0;
84 }
85
86 qint64 COntologyClassificationItem::getCurrentCalculatingCount() {
87 return currentCalculatingCount;
88 }
89
90
91 COntologyClassificationItem *COntologyClassificationItem::doClassifiedCallback() {
92 classifiedCallbackList.doCallback();
93 return this;
94 }
95
96 COntologyClassificationItem *COntologyClassificationItem::addClassifiedCallback(CCallbackData *callback) {
97 callback->setCallbackDataContext(new CClassifiedCallbackDataContext(onto));
98 classifiedCallbackList.addCallbackData(callback);
99 if (!hasRemainingTests()) {
100 doClassifiedCallback();
101 }
102 return this;
103 }
104
105 qint64 COntologyClassificationItem::getCalcedSatisfiableCount() {
106 return statistics->getTestedSatisfiableCount();
107 }
108
109 qint64 COntologyClassificationItem::getCalcedSubsumptionCount() {
110 return statistics->getTestedSubsumptionCount();
111 }
112
113 CClassifierStatistics *COntologyClassificationItem::getClassifierStatistics() {
114 return statistics;
115 }
116
117
118 CClassificationStatisticsCollectionStrings* COntologyClassificationItem::getClassificationStatisticsCollectionStrings() {
119 return mClassificationStatCollStrings;
120 }
121
122
123 CClassificationCalculationStatisticsCollection* COntologyClassificationItem::getCalculationStatisticsCollection() {
124 CClassificationCalculationStatisticsCollection* statColl = nullptr;
125 if (!mReuseStatCollList.isEmpty()) {
126 statColl = mReuseStatCollList.takeFirst();
127 }
128 if (!statColl && mClassificationStatCollStrings) {
129 statColl = mClassificationStatCollStrings->createCalculationStatisticsCollection();
130 }
131 return statColl;
132 }
133
134 COntologyClassificationItem* COntologyClassificationItem::reuseCalculationStatisticsCollection(CClassificationCalculationStatisticsCollection* statColl) {
135 mReuseStatCollList.append(statColl);
136 return this;
137 }
138
139
140
141 bool COntologyClassificationItem::isCollectProcessStatisticsActivated() {
142 return mConfCollectProcessStatistics;
143 }
144
145 QList<COntologyProcessingRequirement*> COntologyClassificationItem::getOntologyProcessingRequirementList() {
146 return mRequirementList;
147 }
148
149 COntologyClassificationItem* COntologyClassificationItem::addOntologyProcessingRequirements(const QList<COntologyProcessingRequirement*>& reqList) {
150 mRequirementList.append(reqList);
151 return this;
152 }
153
154
155
156 CIndividualDependenceTrackingCollector* COntologyClassificationItem::getIndividualDependenceTrackingCollector() {
157 return mIndiDepTrackingCollector;
158 }
159
160
161 COntologyClassificationItem* COntologyClassificationItem::setIndividualDependenceTrackingCollector(CIndividualDependenceTrackingCollector* indiDepTrackColl) {
162 mIndiDepTrackingCollector = indiDepTrackColl;
163 return this;
164 }
165
166 COntologyProcessingStepData* COntologyClassificationItem::getClassificationProcessingStep() {
167 return mClassifyProcessingStepData;
168 }
169
170
171 QTime* COntologyClassificationItem::getInitializationTime() {
172 return &mInitTime;
173 }
174
175 }; // end namespace Classifier
176
177 }; // end namespace Reasoner
178
179 }; // end namespace Konclude