Debian Codegraph @

Source/Reasoner/Classifier/CIncrementalKPSetClassOntologyClassificationItem.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 "CIncrementalKPSetClassOntologyClassificationItem.h"
22
23
24 namespace Konclude {
25
26 namespace Reasoner {
27
28 namespace Classifier {
29
30
31 CIncrementalKPSetClassOntologyClassificationItem::CIncrementalKPSetClassOntologyClassificationItem(CConfigurationBase *configuration, CClassifierStatistics *nextClassificationStatistics)
32 : COptimizedKPSetClassOntologyClassificationItem(configuration,nextClassificationStatistics) {
33
34 mPreviousHierarchyReused = false;
35 mReusedClassConClassification = nullptr;
36
37 mPreviousReusedClassCalculationCount = 0;
38 mNewInitializedClassCalculationCount = 0;
39 }
40
41 CIncrementalKPSetClassOntologyClassificationItem::~CIncrementalKPSetClassOntologyClassificationItem() {
42 }
43
44
45 CIncrementalKPSetClassOntologyClassificationItem* CIncrementalKPSetClassOntologyClassificationItem::setPreviousHierarchyReused(bool reused) {
46 mPreviousHierarchyReused = reused;
47 return this;
48 }
49
50 bool CIncrementalKPSetClassOntologyClassificationItem::isPreviousHierarchyReused() {
51 return mPreviousHierarchyReused;
52 }
53
54
55 CClassConceptClassification* CIncrementalKPSetClassOntologyClassificationItem::getPreviousReusedClassClassification() {
56 return mReusedClassConClassification;
57 }
58
59 CClassConceptClassification* CIncrementalKPSetClassOntologyClassificationItem::setPreviousReusedClassClassification(CClassConceptClassification* reusedClassClassification) {
60 return mReusedClassConClassification;
61 }
62
63
64 cint64 CIncrementalKPSetClassOntologyClassificationItem::getPreviousReusedClassCalculationCount() {
65 return mPreviousReusedClassCalculationCount;
66 }
67
68 cint64 CIncrementalKPSetClassOntologyClassificationItem::getNewInitializedClassCalculationCount() {
69 return mNewInitializedClassCalculationCount;
70 }
71
72 CIncrementalKPSetClassOntologyClassificationItem* CIncrementalKPSetClassOntologyClassificationItem::setPreviousReusedClassCalculationCount(cint64 count) {
73 mPreviousReusedClassCalculationCount = count;
74 return this;
75 }
76
77 CIncrementalKPSetClassOntologyClassificationItem* CIncrementalKPSetClassOntologyClassificationItem::incPreviousReusedClassCalculationCount(cint64 incCount) {
78 mPreviousReusedClassCalculationCount += incCount;
79 return this;
80 }
81
82 CIncrementalKPSetClassOntologyClassificationItem* CIncrementalKPSetClassOntologyClassificationItem::setNewInitializedClassCalculationCount(cint64 count) {
83 mNewInitializedClassCalculationCount = count;
84 return this;
85 }
86
87 CIncrementalKPSetClassOntologyClassificationItem* CIncrementalKPSetClassOntologyClassificationItem::incNewInitializedClassCalculationCount(cint64 incCount) {
88 mNewInitializedClassCalculationCount += incCount;
89 return this;
90 }
91
92
93
94 }; // end namespace Classifier
95
96 }; // end namespace Reasoner
97
98 }; // end namespace Konclude