/*
* Copyright (C) 2013-2015, 2019 by the Konclude Developer Team.
*
* This file is part of the reasoning system Konclude.
* For details and support, see .
*
* Konclude is free software: you can redistribute it and/or modify
* it under the terms of version 3 of the GNU Lesser General Public
* License (LGPLv3) as published by the Free Software Foundation.
*
* 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. See the
* GNU (Lesser) General Public License for more details.
*
* You should have received a copy of the GNU (Lesser) General Public
* License along with Konclude. If not, see .
*
*/
#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