Debian Codegraph @

Source/Reasoner/Classifier/COptimizedKPSetClassPossibleSubsumptionMapIterator.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 "COptimizedKPSetClassPossibleSubsumptionMapIterator.h"
22
23
24 namespace Konclude {
25
26 namespace Reasoner {
27
28 namespace Classifier {
29
30
31 COptimizedKPSetClassPossibleSubsumptionMapIterator::COptimizedKPSetClassPossibleSubsumptionMapIterator() {
32 }
33
34
35 COptimizedKPSetClassPossibleSubsumptionMapIterator::COptimizedKPSetClassPossibleSubsumptionMapIterator(QMap<CConceptTagComparer,COptimizedKPSetClassPossibleSubsumptionData*>::iterator itBegin, QMap<CConceptTagComparer,COptimizedKPSetClassPossibleSubsumptionData*>::iterator itEnd) {
36 mItBegin = itBegin;
37 mItEnd = itEnd;
38 }
39
40 bool COptimizedKPSetClassPossibleSubsumptionMapIterator::hasNext() {
41 return mItBegin != mItEnd;
42 }
43
44 bool COptimizedKPSetClassPossibleSubsumptionMapIterator::isSubsumptionConfirmed() {
45 return mItBegin.value()->isSubsumptionConfirmed();
46 }
47
48 bool COptimizedKPSetClassPossibleSubsumptionMapIterator::isSubsumptionInvalided() {
49 return mItBegin.value()->isSubsumptionInvalided();
50 }
51
52 CConcept* COptimizedKPSetClassPossibleSubsumptionMapIterator::getSubsumptionConcept() {
53 return mItBegin.key().getConcept();
54 }
55
56 bool COptimizedKPSetClassPossibleSubsumptionMapIterator::invalidateSubsumption() {
57 bool wasInvalid = isSubsumptionInvalided();
58 mItBegin.value()->setSubsumptionInvalid(true);
59 return wasInvalid;
60 }
61
62 bool COptimizedKPSetClassPossibleSubsumptionMapIterator::confirmSubsumption() {
63 bool wasConfirmed = isSubsumptionConfirmed();
64 mItBegin.value()->setSubsumptionConfirmed(true);
65 return wasConfirmed;
66 }
67
68 bool COptimizedKPSetClassPossibleSubsumptionMapIterator::moveNext() {
69 ++mItBegin;
70 return true;
71 }
72
73
74 }; // end namespace Classifier
75
76 }; // end namespace Reasoner
77
78 }; // end namespace Konclude