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
|
/*
* 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 "CSaturationSuccessorExtensionIndividualNodeProcessingQueue.h"
#include "CIndividualSaturationProcessNode.h"
namespace Konclude {
namespace Reasoner {
namespace Kernel {
namespace Process {
CSaturationSuccessorExtensionIndividualNodeProcessingQueue::CSaturationSuccessorExtensionIndividualNodeProcessingQueue(CProcessContext* processContext)
: mProcessContext(processContext),mPriorityIndiDesMap(processContext) {
mCurrentIndividual = nullptr;
}
CSaturationSuccessorExtensionIndividualNodeProcessingQueue* CSaturationSuccessorExtensionIndividualNodeProcessingQueue::initProcessingQueue(CSaturationSuccessorExtensionIndividualNodeProcessingQueue* processingQueue) {
if (processingQueue) {
mPriorityIndiDesMap = processingQueue->mPriorityIndiDesMap;
mCurrentIndividual = processingQueue->mCurrentIndividual;
} else {
mPriorityIndiDesMap.clear();
mCurrentIndividual = nullptr;
}
return this;
}
CIndividualSaturationProcessNode* CSaturationSuccessorExtensionIndividualNodeProcessingQueue::takeNextToCurrentProcessIndividual() {
if (!mCurrentIndividual) {
CIndividualSaturationProcessNode* nextNode = nullptr;
if (!mPriorityIndiDesMap.isEmpty()) {
CPROCESSMAP<cint64,CIndividualSaturationProcessNode*>::iterator it = mPriorityIndiDesMap.begin();
nextNode = it.value();
it = mPriorityIndiDesMap.erase(it);
}
mCurrentIndividual = nextNode;
}
return mCurrentIndividual;
}
CSaturationSuccessorExtensionIndividualNodeProcessingQueue* CSaturationSuccessorExtensionIndividualNodeProcessingQueue::insertProcessIndiviudal(CIndividualSaturationProcessNode* individual) {
if (mCurrentIndividual) {
if (mCurrentIndividual->getIndividualID() == individual->getIndividualID()) {
return this;
}
}
mPriorityIndiDesMap.insert(-individual->getIndividualID(),individual);
return this;
}
bool CSaturationSuccessorExtensionIndividualNodeProcessingQueue::isEmpty() {
return !mCurrentIndividual && mPriorityIndiDesMap.count() <= 0;
}
cint64 CSaturationSuccessorExtensionIndividualNodeProcessingQueue::getQueuedIndividualCount() {
cint64 processingCount = mPriorityIndiDesMap.count();
if (mCurrentIndividual) {
processingCount += 1;
}
return processingCount;
}
bool CSaturationSuccessorExtensionIndividualNodeProcessingQueue::hasQueuedIndividuals() {
return mCurrentIndividual || mPriorityIndiDesMap.count() > 0;
}
bool CSaturationSuccessorExtensionIndividualNodeProcessingQueue::isIndividualQueued(CIndividualSaturationProcessNode *individual) {
if (mCurrentIndividual) {
if (mCurrentIndividual->getIndividualID() == individual->getIndividualID()) {
return true;
}
}
return mPriorityIndiDesMap.contains(-individual->getIndividualID());
}
CIndividualSaturationProcessNode* CSaturationSuccessorExtensionIndividualNodeProcessingQueue::getCurrentProcessIndividual() {
return mCurrentIndividual;
}
CSaturationSuccessorExtensionIndividualNodeProcessingQueue* CSaturationSuccessorExtensionIndividualNodeProcessingQueue::clearCurrentProcessIndividual() {
mCurrentIndividual = nullptr;
return this;
}
}; // end namespace Process
}; // end namespace Kernel
}; // end namespace Reasoner
}; // end namespace Konclude
|
