Debian Codegraph @

Source/Reasoner/Kernel/Process/CCondensedReapplyQueueIterator.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 "CCondensedReapplyQueueIterator.h"
22
23
24 namespace Konclude {
25
26 namespace Reasoner {
27
28 namespace Kernel {
29
30 namespace Process {
31
32 CCondensedReapplyQueueIterator::CCondensedReapplyQueueIterator() {
33 mDynamicPosNegReapplyDesLinker = nullptr;
34 mPosDes = true;
35 mNegDes = true;
36 }
37
38 CCondensedReapplyQueueIterator::CCondensedReapplyQueueIterator(CCondensedReapplyConceptDescriptor* dynamicReapplyDesLinker, bool positiveDescriptors, bool negativeDescriptors)
39 : mDynamicPosNegReapplyDesLinker(dynamicReapplyDesLinker),mPosDes(positiveDescriptors),mNegDes(negativeDescriptors) {
40
41 while (mDynamicPosNegReapplyDesLinker && (mDynamicPosNegReapplyDesLinker->isPositiveDescriptor() && mPosDes || !mDynamicPosNegReapplyDesLinker->isPositiveDescriptor() && mNegDes)) {
42 mDynamicPosNegReapplyDesLinker = mDynamicPosNegReapplyDesLinker->getNext();
43 }
44 }
45
46 CCondensedReapplyQueueIterator::CCondensedReapplyQueueIterator(CCondensedReapplyConceptDescriptor* dynamicReapplyDesLinker, bool onlyPositiveDescriptors)
47 : mDynamicPosNegReapplyDesLinker(dynamicReapplyDesLinker),mPosDes(onlyPositiveDescriptors == true),mNegDes(onlyPositiveDescriptors == false) {
48
49 while (mDynamicPosNegReapplyDesLinker && (mDynamicPosNegReapplyDesLinker->isPositiveDescriptor() && mPosDes || !mDynamicPosNegReapplyDesLinker->isPositiveDescriptor() && mNegDes)) {
50 mDynamicPosNegReapplyDesLinker = mDynamicPosNegReapplyDesLinker->getNext();
51 }
52 }
53
54 CCondensedReapplyConceptDescriptor* CCondensedReapplyQueueIterator::next(bool moveNext) {
55 CCondensedReapplyConceptDescriptor* nextDes = nullptr;
56 if (mDynamicPosNegReapplyDesLinker) {
57 nextDes = mDynamicPosNegReapplyDesLinker;
58 if (moveNext) {
59 mDynamicPosNegReapplyDesLinker = mDynamicPosNegReapplyDesLinker->getNext();
60 while (mDynamicPosNegReapplyDesLinker && (mDynamicPosNegReapplyDesLinker->isPositiveDescriptor() && mPosDes || !mDynamicPosNegReapplyDesLinker->isPositiveDescriptor() && mNegDes)) {
61 mDynamicPosNegReapplyDesLinker = mDynamicPosNegReapplyDesLinker->getNext();
62 }
63 }
64 }
65 return nextDes;
66 }
67
68 bool CCondensedReapplyQueueIterator::hasNext() {
69 return mDynamicPosNegReapplyDesLinker;
70 }
71
72
73 }; // end namespace Process
74
75 }; // end namespace Kernel
76
77 }; // end namespace Reasoner
78
79 }; // end namespace Konclude