Debian Codegraph @

Source/Reasoner/Classifier/COptimizedKPSetRolePossibleSubsumptionMap.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 "COptimizedKPSetRolePossibleSubsumptionMap.h"
22
23
24 namespace Konclude {
25
26 namespace Reasoner {
27
28 namespace Classifier {
29
30
31 COptimizedKPSetRolePossibleSubsumptionMap::COptimizedKPSetRolePossibleSubsumptionMap() : QMap<CRoleTagComparer,COptimizedKPSetRolePossibleSubsumptionData*>() {
32 mRequirePossibleSubsumptionUpdate = false;
33 mRemainingPossibleSubsumptionCount = 0;
34 }
35
36 bool COptimizedKPSetRolePossibleSubsumptionMap::isPossibleSubsumptionUpdateRequired() {
37 return mRequirePossibleSubsumptionUpdate;
38 }
39
40 cint64 COptimizedKPSetRolePossibleSubsumptionMap::getRemainingPossibleSubsumptionCount() {
41 return mRemainingPossibleSubsumptionCount;
42 }
43
44
45
46 COptimizedKPSetRolePossibleSubsumptionMap* COptimizedKPSetRolePossibleSubsumptionMap::setRemainingPossibleSubsumptionCount(cint64 possSubsumCount) {
47 mRemainingPossibleSubsumptionCount = possSubsumCount;
48 return this;
49 }
50
51 COptimizedKPSetRolePossibleSubsumptionMap* COptimizedKPSetRolePossibleSubsumptionMap::decRemainingPossibleSubsumptionCount(cint64 decCount) {
52 mRemainingPossibleSubsumptionCount -= decCount;
53 return this;
54 }
55
56 COptimizedKPSetRolePossibleSubsumptionMap* COptimizedKPSetRolePossibleSubsumptionMap::incRemainingPossibleSubsumptionCount(cint64 incCount) {
57 mRemainingPossibleSubsumptionCount += incCount;
58 return this;
59 }
60
61 COptimizedKPSetRolePossibleSubsumptionMap* COptimizedKPSetRolePossibleSubsumptionMap::setPossibleSubsumptionUpdateRequired(bool requiredUpdate) {
62 mRequirePossibleSubsumptionUpdate = requiredUpdate;
63 return this;
64 }
65
66 bool COptimizedKPSetRolePossibleSubsumptionMap::hasRemainingPossibleSubsumptions() {
67 return mRemainingPossibleSubsumptionCount > 0;
68 }
69
70 CPropertyPossibleSubsumptionMapIterator* COptimizedKPSetRolePossibleSubsumptionMap::getIterator(CPropertyPossibleSubsumptionMapIterator* reuseIterator, CContext* context) {
71 if (reuseIterator) {
72 COptimizedKPSetRolePossibleSubsumptionMapIterator* optKPSetClassPossSubMapIterator = (COptimizedKPSetRolePossibleSubsumptionMapIterator*)reuseIterator;
73 *optKPSetClassPossSubMapIterator = COptimizedKPSetRolePossibleSubsumptionMapIterator(QMap<CRoleTagComparer,COptimizedKPSetRolePossibleSubsumptionData*>::begin(),QMap<CRoleTagComparer,COptimizedKPSetRolePossibleSubsumptionData*>::end());
74 return optKPSetClassPossSubMapIterator;
75 } else {
76 CMemoryAllocationManager* memMan = context->getMemoryAllocationManager();
77 COptimizedKPSetRolePossibleSubsumptionMapIterator* optKPSetClassPossSubMapIterator = CObjectAllocator<COptimizedKPSetRolePossibleSubsumptionMapIterator>::allocateAndConstruct(memMan);
78 *optKPSetClassPossSubMapIterator = COptimizedKPSetRolePossibleSubsumptionMapIterator(QMap<CRoleTagComparer,COptimizedKPSetRolePossibleSubsumptionData*>::begin(),QMap<CRoleTagComparer,COptimizedKPSetRolePossibleSubsumptionData*>::end());
79 return optKPSetClassPossSubMapIterator;
80 }
81 }
82
83
84 }; // end namespace Classifier
85
86 }; // end namespace Reasoner
87
88 }; // end namespace Konclude