Debian Codegraph @

Source/Reasoner/Kernel/Process/CConceptProcessingQueueIterator.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 "CConceptProcessingQueueIterator.h"
22
23
24 namespace Konclude {
25
26 namespace Reasoner {
27
28 namespace Kernel {
29
30 namespace Process {
31
32 CConceptProcessingQueueIterator::CConceptProcessingQueueIterator() {
33 mDataVec = nullptr;
34 mDesCount = 0;
35 mDefaultPriorityDescriptorLinker = nullptr;
36 mSortedPriorityDescriptorLinker = nullptr;
37
38 mDesIndex = 0;
39
40 }
41
42
43 CConceptProcessingQueueIterator::CConceptProcessingQueueIterator(CConceptProcessingPriorityQueueData* dataVec, cint64 desCount) {
44 mDataVec = dataVec;
45 mDesCount = desCount;
46 mDefaultPriorityDescriptorLinker = nullptr;
47 mSortedPriorityDescriptorLinker = nullptr;
48
49 mDesIndex = 0;
50
51 loadNextDescriptors();
52 }
53
54
55 CConceptProcessingQueueIterator::~CConceptProcessingQueueIterator() {
56 }
57
58 void CConceptProcessingQueueIterator::loadNextDescriptors() {
59 if (mDesCount > 0) {
60 while (!mDefaultPriorityDescriptorLinker && !mSortedPriorityDescriptorLinker && mDesIndex < mMaxIndex) {
61 CConceptProcessingPriorityQueueData& mData = mDataVec[mDesIndex];
62 mDefaultPriorityDescriptorLinker = mData.mDefaultPriorityDescriptorLinker;
63 mSortedPriorityDescriptorLinker = mData.mSortedPriorityDescriptorLinker;
64 ++mDesIndex;
65 }
66 }
67 }
68
69 CConceptProcessDescriptor* CConceptProcessingQueueIterator::next(bool moveNext) {
70 if (!mDefaultPriorityDescriptorLinker && !mSortedPriorityDescriptorLinker) {
71 loadNextDescriptors();
72 }
73 CConceptProcessDescriptor* des = nullptr;
74 if (mDefaultPriorityDescriptorLinker) {
75 des = mDefaultPriorityDescriptorLinker;
76 if (moveNext) {
77 mDefaultPriorityDescriptorLinker = mDefaultPriorityDescriptorLinker->getNext();
78 }
79 } else if (mSortedPriorityDescriptorLinker) {
80 des = mSortedPriorityDescriptorLinker;
81 if (moveNext) {
82 mSortedPriorityDescriptorLinker = mSortedPriorityDescriptorLinker->getNext();
83 }
84 }
85 if (des && moveNext) {
86 --mDesCount;
87 }
88 return des;
89 }
90
91 bool CConceptProcessingQueueIterator::hasNext() {
92 return mDesCount > 0;
93 }
94
95
96 }; // end namespace Process
97
98 }; // end namespace Kernel
99
100 }; // end namespace Reasoner
101
102 }; // end namespace Konclude