1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
|
/*
* Copyright (C) 2013, 2014, 2015 by the Konclude Developer Team.
*
* This file is part of the reasoning system Konclude.
* For details and support, see <http://konclude.com/>.
*
* Konclude is free software: you can redistribute it and/or modify it under
* the terms of version 2.1 of the GNU Lesser General Public License (LGPL2.1)
* as published by the Free Software Foundation.
*
* You should have received a copy of the GNU Lesser General Public License
* along with Konclude. If not, see <http://www.gnu.org/licenses/>.
*
* 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. For more
* details, see GNU Lesser General Public License.
*
*/
#include "CIndividualDepthProcessingQueue.h"
namespace Konclude {
namespace Reasoner {
namespace Kernel {
namespace Process {
CIndividualDepthProcessingQueue::CIndividualDepthProcessingQueue(CProcessContext* processContext)
: mProcessContext(processContext),mPriorityIndiDesMap(processContext) {
}
CIndividualDepthProcessingQueue* CIndividualDepthProcessingQueue::initProcessingQueue(CIndividualDepthProcessingQueue* processingQueue) {
if (processingQueue) {
mPriorityIndiDesMap = processingQueue->mPriorityIndiDesMap;
mHasMaxIndiPriority = processingQueue->mHasMaxIndiPriority;
mMaxIndiPriority = processingQueue->mMaxIndiPriority;
mLastCheckIndi = processingQueue->mLastCheckIndi;
} else {
mHasMaxIndiPriority = false;
mPriorityIndiDesMap.clear();
mLastCheckIndi = nullptr;
mMaxIndiPriority = CIndividualDepthPriority();
}
return this;
}
CIndividualProcessNode* CIndividualDepthProcessingQueue::takeNextProcessIndividual() {
CIndividualProcessNode* nextNode = nullptr;
if (!mPriorityIndiDesMap.isEmpty()) {
CPROCESSMAP<CIndividualDepthPriority,CIndividualProcessNode*>::iterator it = mPriorityIndiDesMap.begin();
nextNode = it.value();
it = mPriorityIndiDesMap.erase(it);
if (it != mPriorityIndiDesMap.end()) {
mHasMaxIndiPriority = true;
mMaxIndiPriority = it.key();
} else {
mHasMaxIndiPriority = false;
}
}
return nextNode;
}
CIndividualProcessNode* CIndividualDepthProcessingQueue::getNextProcessIndividual() {
CIndividualProcessNode* nextNode = nullptr;
if (!mPriorityIndiDesMap.isEmpty()) {
CPROCESSMAP<CIndividualDepthPriority,CIndividualProcessNode*>::iterator it = mPriorityIndiDesMap.begin();
nextNode = it.value();
}
return nextNode;
}
CIndividualDepthProcessingQueue* CIndividualDepthProcessingQueue::insertProcessIndiviudal(CIndividualProcessNode* individual) {
CIndividualDepthPriority priority(individual->getIndividualNominalLevelOrAncestorDepth(),individual->getIndividualID());
if (mHasMaxIndiPriority) {
if (priority < mMaxIndiPriority) {
mMaxIndiPriority = priority;
}
} else {
mMaxIndiPriority = priority;
mHasMaxIndiPriority = true;
}
mPriorityIndiDesMap.insert(priority,individual);
return this;
}
bool CIndividualDepthProcessingQueue::isEmpty() {
return mPriorityIndiDesMap.count() <= 0;
}
cint64 CIndividualDepthProcessingQueue::getQueuedIndividualCount() {
return mPriorityIndiDesMap.count();
}
bool CIndividualDepthProcessingQueue::hasQueuedIndividuals() {
return mPriorityIndiDesMap.count() > 0;
}
bool CIndividualDepthProcessingQueue::isIndividualQueued(CIndividualProcessNode *individual) {
CIndividualDepthPriority priority(individual->getIndividualNominalLevelOrAncestorDepth(),individual->getIndividualID());
return mPriorityIndiDesMap.contains(priority);
}
bool CIndividualDepthProcessingQueue::hasHigherPriorityIndividual(CIndividualProcessNode *individual) {
if (mHasMaxIndiPriority) {
CIndividualDepthPriority priority(individual->getIndividualNominalLevelOrAncestorDepth(),individual->getIndividualID());
return mMaxIndiPriority < priority;
}
return false;
}
}; // end namespace Process
}; // end namespace Kernel
}; // end namespace Reasoner
}; // end namespace Konclude
|
