/* * 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 . * */ #ifndef KONCLUDE_REASONER_TAXONOMY_CHIERARCHYNODEITERATOR_CPP #define KONCLUDE_REASONER_TAXONOMY_CHIERARCHYNODEITERATOR_CPP #include "CHierarchyNodeIterator.h" namespace Konclude { namespace Reasoner { namespace Taxonomy { template CHierarchyNodeIterator::CHierarchyNodeIterator(QList* nodeList, bool backwardIterating) : mListIterator(*nodeList) { mNodeList = nodeList; mBackwardIterating = backwardIterating; if (mBackwardIterating) { mListIterator.toBack(); } } template bool CHierarchyNodeIterator::hasNextHierarchyNode() { if (mNodeList && (!mBackwardIterating && mListIterator.hasNext()) || (mBackwardIterating && mListIterator.hasPrevious())) { return true; } return false; } template N* CHierarchyNodeIterator::nextHierarchyNode(bool moveNext) { N* node = nullptr; if (!mBackwardIterating) { if (mNodeList && mListIterator.hasNext()) { node = mListIterator.peekNext(); if (moveNext) { mListIterator.next(); } } } else { if (mNodeList && mListIterator.hasPrevious()) { node = mListIterator.peekPrevious(); if (moveNext) { mListIterator.previous(); } } } return node; } }; // end namespace Taxonomy }; // end namespace Reasoner }; // end namespace Konclude #endif // KONCLUDE_REASONER_TAXONOMY_CHIERARCHYNODEITERATOR_CPP