Debian Codegraph @

Source/Reasoner/Taxonomy/CHierarchyNodeIterator.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 #ifndef KONCLUDE_REASONER_TAXONOMY_CHIERARCHYNODEITERATOR_CPP
21 #define KONCLUDE_REASONER_TAXONOMY_CHIERARCHYNODEITERATOR_CPP
22
23 #include "CHierarchyNodeIterator.h"
24
25
26 namespace Konclude {
27
28 namespace Reasoner {
29
30 namespace Taxonomy {
31
32
33 template<class N>
34 CHierarchyNodeIterator<N>::CHierarchyNodeIterator(QList<N*>* nodeList, bool backwardIterating) : mListIterator(*nodeList) {
35 mNodeList = nodeList;
36 mBackwardIterating = backwardIterating;
37 if (mBackwardIterating) {
38 mListIterator.toBack();
39 }
40 }
41
42 template<class N>
43 bool CHierarchyNodeIterator<N>::hasNextHierarchyNode() {
44 if (mNodeList && (!mBackwardIterating && mListIterator.hasNext()) || (mBackwardIterating && mListIterator.hasPrevious())) {
45 return true;
46 }
47 return false;
48 }
49
50 template<class N>
51 N* CHierarchyNodeIterator<N>::nextHierarchyNode(bool moveNext) {
52 N* node = nullptr;
53 if (!mBackwardIterating) {
54 if (mNodeList && mListIterator.hasNext()) {
55 node = mListIterator.peekNext();
56 if (moveNext) {
57 mListIterator.next();
58 }
59 }
60 } else {
61 if (mNodeList && mListIterator.hasPrevious()) {
62 node = mListIterator.peekPrevious();
63 if (moveNext) {
64 mListIterator.previous();
65 }
66 }
67 }
68 return node;
69 }
70
71
72 }; // end namespace Taxonomy
73
74 }; // end namespace Reasoner
75
76 }; // end namespace Konclude
77
78 #endif // KONCLUDE_REASONER_TAXONOMY_CHIERARCHYNODEITERATOR_CPP