1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
|
/*
* Copyright (C) 2013, 2014, 2015 by the Konclude Developer Team.
*
* This file is part of the reasoning system Konclude.
* For details and support, see <http://konclude.com/>.
*
* Konclude is free software: you can redistribute it and/or modify it under
* the terms of version 2.1 of the GNU Lesser General Public License (LGPL2.1)
* as published by the Free Software Foundation.
*
* You should have received a copy of the GNU Lesser General Public License
* along with Konclude. If not, see <http://www.gnu.org/licenses/>.
*
* Konclude is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. For more
* details, see GNU Lesser General Public License.
*
*/
#include "COptimizedKPSetClassPossibleSubsumptionMap.h"
namespace Konclude {
namespace Reasoner {
namespace Classifier {
COptimizedKPSetClassPossibleSubsumptionMap::COptimizedKPSetClassPossibleSubsumptionMap() : QMap<CConceptTagComparer,COptimizedKPSetClassPossibleSubsumptionData*>() {
mRequirePossibleSubsumptionUpdate = false;
mRemainingPossibleSubsumptionCount = 0;
}
bool COptimizedKPSetClassPossibleSubsumptionMap::isPossibleSubsumptionUpdateRequired() {
return mRequirePossibleSubsumptionUpdate;
}
cint64 COptimizedKPSetClassPossibleSubsumptionMap::getRemainingPossibleSubsumptionCount() {
return mRemainingPossibleSubsumptionCount;
}
COptimizedKPSetClassPossibleSubsumptionMap* COptimizedKPSetClassPossibleSubsumptionMap::setRemainingPossibleSubsumptionCount(cint64 possSubsumCount) {
mRemainingPossibleSubsumptionCount = possSubsumCount;
return this;
}
COptimizedKPSetClassPossibleSubsumptionMap* COptimizedKPSetClassPossibleSubsumptionMap::decRemainingPossibleSubsumptionCount(cint64 decCount) {
mRemainingPossibleSubsumptionCount -= decCount;
return this;
}
COptimizedKPSetClassPossibleSubsumptionMap* COptimizedKPSetClassPossibleSubsumptionMap::incRemainingPossibleSubsumptionCount(cint64 incCount) {
mRemainingPossibleSubsumptionCount += incCount;
return this;
}
COptimizedKPSetClassPossibleSubsumptionMap* COptimizedKPSetClassPossibleSubsumptionMap::setPossibleSubsumptionUpdateRequired(bool requiredUpdate) {
mRequirePossibleSubsumptionUpdate = requiredUpdate;
return this;
}
bool COptimizedKPSetClassPossibleSubsumptionMap::hasRemainingPossibleSubsumptions() {
return mRemainingPossibleSubsumptionCount > 0;
}
CClassPossibleSubsumptionMapIterator* COptimizedKPSetClassPossibleSubsumptionMap::getIterator(CClassPossibleSubsumptionMapIterator* reuseIterator, CContext* context) {
if (reuseIterator) {
COptimizedKPSetClassPossibleSubsumptionMapIterator* optKPSetClassPossSubMapIterator = (COptimizedKPSetClassPossibleSubsumptionMapIterator*)reuseIterator;
*optKPSetClassPossSubMapIterator = COptimizedKPSetClassPossibleSubsumptionMapIterator(QMap<CConceptTagComparer,COptimizedKPSetClassPossibleSubsumptionData*>::begin(),QMap<CConceptTagComparer,COptimizedKPSetClassPossibleSubsumptionData*>::end());
return optKPSetClassPossSubMapIterator;
} else {
CMemoryAllocationManager* memMan = context->getMemoryAllocationManager();
COptimizedKPSetClassPossibleSubsumptionMapIterator* optKPSetClassPossSubMapIterator = CObjectAllocator<COptimizedKPSetClassPossibleSubsumptionMapIterator>::allocateAndConstruct(memMan);
*optKPSetClassPossSubMapIterator = COptimizedKPSetClassPossibleSubsumptionMapIterator(QMap<CConceptTagComparer,COptimizedKPSetClassPossibleSubsumptionData*>::begin(),QMap<CConceptTagComparer,COptimizedKPSetClassPossibleSubsumptionData*>::end());
return optKPSetClassPossSubMapIterator;
}
}
}; // end namespace Classifier
}; // end namespace Reasoner
}; // end namespace Konclude
|
