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
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
|
/*
* 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 "CIndividualProcessingQueue.h"
namespace Konclude {
namespace Reasoner {
namespace Kernel {
namespace Process {
CIndividualProcessingQueue::CIndividualProcessingQueue(CProcessContext* processContext)
: mProcessContext(processContext),mPriorityIndiDesMap(processContext),mIndiDesPriorityHash(processContext) {
mIndiProDesCount = 0;
mHasMaxIndiPriority = false;
mLastCheckIndi = nullptr;
}
CIndividualProcessingQueue::~CIndividualProcessingQueue() {
}
CIndividualProcessingQueue* CIndividualProcessingQueue::initProcessingQueue(CIndividualProcessingQueue* processingQueue) {
if (processingQueue) {
mPriorityIndiDesMap = processingQueue->mPriorityIndiDesMap;
mIndiDesPriorityHash = processingQueue->mIndiDesPriorityHash;
mIndiProDesCount = processingQueue->mIndiProDesCount;
} else {
mPriorityIndiDesMap.clear();
mIndiDesPriorityHash.clear();
mIndiProDesCount = 0;
}
return this;
}
CIndividualProcessingQueue *CIndividualProcessingQueue::insertIndiviudalProcessDescriptor(CIndividualProcessNodeDescriptor *indiProDes) {
CIndividualProcessNode *individual = indiProDes->getIndividual();
CIndividualProcessNodePriority indiPriority = indiProDes->getProcessPriority();
if (individual == mLastCheckIndi) {
mLastCheckIndiPriority = qMax(indiPriority,mLastCheckIndiPriority);
}
cint64 indiID = individual->getIndividualID();
if (mHasMaxIndiPriority) {
mMaxIndiPriority = qMax(indiPriority,mMaxIndiPriority);
}
//cint64 prevCount = mPriorityIndiDesMap.count();
mIndiDesPriorityHash.insert(indiID,indiPriority);
mPriorityIndiDesMap.insertMulti(indiPriority,indiProDes);
++mIndiProDesCount;
//if (mPriorityIndiDesMap.count() != mIndiProDesCount) {
// mPriorityIndiDesMap.insertMulti(indiPriority,indiProDes);
// bool bug = true;
//}
return this;
}
bool CIndividualProcessingQueue::isIndividualQueued(CIndividualProcessNode *individual) {
cint64 indiID = individual->getIndividualID();
mLastCheckIndiPriority = mIndiDesPriorityHash.value(indiID,CIndividualProcessNodePriority());
return !mLastCheckIndiPriority.isNullPriority();
}
bool CIndividualProcessingQueue::needsIndiviudalInsertion(CIndividualProcessNode *individual, CIndividualProcessNodePriority priority) {
if (mLastCheckIndi == individual) {
if (!mLastCheckIndiPriority.isNullPriority() && priority >= mLastCheckIndiPriority) {
return false;
} else {
return true;
}
} else {
cint64 indiID = individual->getIndividualID();
mLastCheckIndi = individual;
mLastCheckIndiPriority = mIndiDesPriorityHash.value(indiID,CIndividualProcessNodePriority());
if (!mLastCheckIndiPriority.isNullPriority() && priority >= mLastCheckIndiPriority) {
return false;
}
return true;
}
}
bool CIndividualProcessingQueue::hasHigherPriorityIndividual(CIndividualProcessNodePriority priority) {
if (!mHasMaxIndiPriority) {
CIndividualProcessNodeDescriptor* nextIndiDes = getNextProcessIndividualDescriptor();
if (nextIndiDes) {
mMaxIndiPriority = nextIndiDes->getProcessPriority();
mHasMaxIndiPriority = true;
}
}
if (mHasMaxIndiPriority) {
return mMaxIndiPriority < priority;
}
return false;
}
CIndividualProcessNodeDescriptor* CIndividualProcessingQueue::takeNextProcessIndividualDescriptor() {
CIndividualProcessNodeDescriptor* indiProDes = nullptr;
if (mIndiProDesCount > 0) {
--mIndiProDesCount;
CPROCESSMAP<CIndividualProcessNodePriority,CIndividualProcessNodeDescriptor*>::iterator it = mPriorityIndiDesMap.begin();
indiProDes = it.value();
mPriorityIndiDesMap.erase(it);
cint64 indiID = indiProDes->getIndividual()->getIndividualID();
mIndiDesPriorityHash.insert(indiID,0.);
mLastCheckIndi = nullptr;
//if (mPriorityIndiDesMap.count() != mIndiProDesCount) {
// bool bug = true;
//}
}
mHasMaxIndiPriority = false;
return indiProDes;
}
CIndividualProcessNodeDescriptor* CIndividualProcessingQueue::getNextProcessIndividualDescriptor() {
CIndividualProcessNodeDescriptor* indiProDes = nullptr;
if (mIndiProDesCount > 0) {
CPROCESSMAP<CIndividualProcessNodePriority,CIndividualProcessNodeDescriptor*>::iterator it = mPriorityIndiDesMap.begin();
indiProDes = it.value();
}
return indiProDes;
}
bool CIndividualProcessingQueue::isEmpty() {
return mIndiProDesCount <= 0;
}
bool CIndividualProcessingQueue::hasIndividualProcessDescriptor() {
return mIndiProDesCount > 0;
}
}; // end namespace Process
}; // end namespace Kernel
}; // end namespace Reasoner
}; // end namespace Konclude
|
