Debian Codegraph @

Source/Reasoner/Taxonomy/CHierarchyDepthTraversalIterator.h

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 #ifndef KONCLUDE_REASONER_TAXONOMY_CHIERARCHYDEPTHTRAVERSALITERATOR_H
22 #define KONCLUDE_REASONER_TAXONOMY_CHIERARCHYDEPTHTRAVERSALITERATOR_H
23
24 // Libraries includes
25
26
27 // Namespace includes
28 #include "TaxonomySettings.h"
29 #include "CHierarchyNodeIterator.h"
30
31 // Other includes
32
33
34 // Logger includes
35 #include "Logger/CLogger.h"
36
37
38 namespace Konclude {
39
40 namespace Reasoner {
41
42 namespace Taxonomy {
43
44
45 /*!
46 *
47 * \class CHierarchyDepthTraversalIterator
48 * \author Andreas Steigmiller
49 * \version 0.1
50 * \brief TODO
51 *
52 */
53 template<class N>
54 class CHierarchyDepthTraversalIterator {
55 // public methods
56 public:
57 //! Constructor
58 CHierarchyDepthTraversalIterator();
59 CHierarchyDepthTraversalIterator(N* topNode, N* bottomNode, bool forceUniqueVisit = true);
60
61 bool hasNextHierarchyNode();
62 N* nextHierarchyNode(bool moveNext = true);
63
64 CHierarchyNodeIterator<N> getTraversedParentNodeIterator();
65 CHierarchyNodeIterator<N> getClosedTraversedNodeIterator();
66
67 // protected methods
68 protected:
69
70 // protected variables
71 protected:
72 bool mUnigueVisit;
73 N* mCurrentNode;
74 QSetIterator<N*> mCurrentIterator;
75
76 N* mTopNode;
77 N* mBottomNode;
78
79 QSet<N*> mUniqueNodeSet;
80 QList<N*> mParentNodeList;
81 QList< QSetIterator<N*> > mParentNodeIteratorList;
82
83
84 QList<N*> mClosedNodeBranchesList;
85
86
87 // private methods
88 private:
89
90 // private variables
91 private:
92
93 };
94
95 }; // end namespace Taxonomy
96
97 }; // end namespace Reasoner
98
99 }; // end namespace Konclude
100
101 #include "CHierarchyDepthTraversalIterator.cpp"
102
103 #endif // KONCLUDE_REASONER_TAXONOMY_CHIERARCHYDEPTHTRAVERSALITERATOR_H