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
|
/*
* 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 "CCondensedReapplyQueueIterator.h"
namespace Konclude {
namespace Reasoner {
namespace Kernel {
namespace Process {
CCondensedReapplyQueueIterator::CCondensedReapplyQueueIterator() {
mDynamicPosNegReapplyDesLinker = nullptr;
mPosDes = true;
mNegDes = true;
}
CCondensedReapplyQueueIterator::CCondensedReapplyQueueIterator(CCondensedReapplyConceptDescriptor* dynamicReapplyDesLinker, bool positiveDescriptors, bool negativeDescriptors)
: mDynamicPosNegReapplyDesLinker(dynamicReapplyDesLinker),mPosDes(positiveDescriptors),mNegDes(negativeDescriptors) {
while (mDynamicPosNegReapplyDesLinker && (mDynamicPosNegReapplyDesLinker->isPositiveDescriptor() && mPosDes || !mDynamicPosNegReapplyDesLinker->isPositiveDescriptor() && mNegDes)) {
mDynamicPosNegReapplyDesLinker = mDynamicPosNegReapplyDesLinker->getNext();
}
}
CCondensedReapplyQueueIterator::CCondensedReapplyQueueIterator(CCondensedReapplyConceptDescriptor* dynamicReapplyDesLinker, bool onlyPositiveDescriptors)
: mDynamicPosNegReapplyDesLinker(dynamicReapplyDesLinker),mPosDes(onlyPositiveDescriptors == true),mNegDes(onlyPositiveDescriptors == false) {
while (mDynamicPosNegReapplyDesLinker && (mDynamicPosNegReapplyDesLinker->isPositiveDescriptor() && mPosDes || !mDynamicPosNegReapplyDesLinker->isPositiveDescriptor() && mNegDes)) {
mDynamicPosNegReapplyDesLinker = mDynamicPosNegReapplyDesLinker->getNext();
}
}
CCondensedReapplyConceptDescriptor* CCondensedReapplyQueueIterator::next(bool moveNext) {
CCondensedReapplyConceptDescriptor* nextDes = nullptr;
if (mDynamicPosNegReapplyDesLinker) {
nextDes = mDynamicPosNegReapplyDesLinker;
if (moveNext) {
mDynamicPosNegReapplyDesLinker = mDynamicPosNegReapplyDesLinker->getNext();
while (mDynamicPosNegReapplyDesLinker && (mDynamicPosNegReapplyDesLinker->isPositiveDescriptor() && mPosDes || !mDynamicPosNegReapplyDesLinker->isPositiveDescriptor() && mNegDes)) {
mDynamicPosNegReapplyDesLinker = mDynamicPosNegReapplyDesLinker->getNext();
}
}
}
return nextDes;
}
bool CCondensedReapplyQueueIterator::hasNext() {
return mDynamicPosNegReapplyDesLinker;
}
}; // end namespace Process
}; // end namespace Kernel
}; // end namespace Reasoner
}; // end namespace Konclude
|
