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
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
|
/*
* 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 "CIndividualNodeIncrementalExpansionData.h"
namespace Konclude {
namespace Reasoner {
namespace Kernel {
namespace Process {
CIndividualNodeIncrementalExpansionData::CIndividualNodeIncrementalExpansionData(CProcessContext* processContext) : mProcessContext(processContext) {
}
CIndividualNodeIncrementalExpansionData* CIndividualNodeIncrementalExpansionData::initIncrementalExpansionData(CIndividualNodeIncrementalExpansionData* prevData) {
if (prevData) {
mDirectlyChanged = prevData->mDirectlyChanged;
mDirectlyChangedNeighbourConnNode = prevData->mDirectlyChangedNeighbourConnNode;
mCompletionGraphCompatible = prevData->mCompletionGraphCompatible;
mLastCompatibleCheckedConDes = prevData->mLastCompatibleCheckedConDes;
mLastCompatibleCheckedLink = prevData->mLastCompatibleCheckedLink;
mPrevCompGraphCorrIndiNode = prevData->mPrevCompGraphCorrIndiNode;
mPrevCompGraphCorrIndiNodeLoaded = prevData->mPrevCompGraphCorrIndiNodeLoaded;
mUseNeighbourPropagatedDirectlyChangedList = prevData->mUseNeighbourPropagatedDirectlyChangedList;
mLocNeighbourPropagatedDirectlyChangedList = nullptr;
mUseIncrementalExpansionList = prevData->mUseIncrementalExpansionList;
mLocIncrementalExpansionList = nullptr;
mIncremetnalExpansionListInitialized = prevData->mIncremetnalExpansionListInitialized;
mExpansionPriority = prevData->mExpansionPriority;
} else {
mDirectlyChanged = false;
mDirectlyChangedNeighbourConnNode = nullptr;
mCompletionGraphCompatible = false;
mPrevCompGraphCorrIndiNodeLoaded = false;
mLastCompatibleCheckedConDes = nullptr;
mLastCompatibleCheckedLink = nullptr;
mPrevCompGraphCorrIndiNode = nullptr;
mLocNeighbourPropagatedDirectlyChangedList = nullptr;
mUseNeighbourPropagatedDirectlyChangedList = nullptr;
mLocIncrementalExpansionList = nullptr;
mUseIncrementalExpansionList = nullptr;
mIncremetnalExpansionListInitialized = false;
mExpansionPriority = 0.;
}
return this;
}
CIndividualProcessNode* CIndividualNodeIncrementalExpansionData::getDirectlyChangedNeighbourConnectionNode() {
return mDirectlyChangedNeighbourConnNode;
}
CIndividualNodeIncrementalExpansionData* CIndividualNodeIncrementalExpansionData::setDirectlyChangedNeighbourConnectionNode(CIndividualProcessNode* node) {
mDirectlyChangedNeighbourConnNode = node;
return this;
}
bool CIndividualNodeIncrementalExpansionData::hasDirectlyChangedNeighbourConnection() {
return mDirectlyChangedNeighbourConnNode != nullptr;
}
bool CIndividualNodeIncrementalExpansionData::isCompatibilityChanged() {
return mDirectlyChanged && hasDirectlyChangedNeighbourConnection();
}
bool CIndividualNodeIncrementalExpansionData::isDirectlyChanged() {
return mDirectlyChanged;
}
CIndividualNodeIncrementalExpansionData* CIndividualNodeIncrementalExpansionData::setDirectlyChanged(bool directlyChanged) {
mDirectlyChanged = directlyChanged;
return this;
}
bool CIndividualNodeIncrementalExpansionData::isPreviousCompletionGraphCompatible() {
return mCompletionGraphCompatible;
}
CIndividualNodeIncrementalExpansionData* CIndividualNodeIncrementalExpansionData::setPreviousCompletionGraphCompatible(bool compatible) {
mCompletionGraphCompatible = compatible;
return this;
}
CConceptDescriptor* CIndividualNodeIncrementalExpansionData::getLastCompatibleCheckedConceptDescriptor() {
return mLastCompatibleCheckedConDes;
}
CLinkEdge* CIndividualNodeIncrementalExpansionData::getLastCompatibleCheckedLink() {
return mLastCompatibleCheckedLink;
}
CIndividualNodeIncrementalExpansionData* CIndividualNodeIncrementalExpansionData::setLastCompatibleCheckedConceptDescriptor(CConceptDescriptor* conDes) {
mLastCompatibleCheckedConDes = conDes;
return this;
}
CIndividualNodeIncrementalExpansionData* CIndividualNodeIncrementalExpansionData::setLastCompatibleCheckedLink(CLinkEdge* link) {
mLastCompatibleCheckedLink = link;
return this;
}
CIndividualProcessNode* CIndividualNodeIncrementalExpansionData::getPreviousCompletionGraphCorrespondenceIndividualNode() {
return mPrevCompGraphCorrIndiNode;
}
CIndividualNodeIncrementalExpansionData* CIndividualNodeIncrementalExpansionData::setPreviousCompletionGraphCorrespondenceIndividualNode(CIndividualProcessNode* node) {
mPrevCompGraphCorrIndiNode = node;
return this;
}
bool CIndividualNodeIncrementalExpansionData::isPreviousCompletionGraphCorrespondenceIndividualNodeLoaded() {
return mPrevCompGraphCorrIndiNodeLoaded;
}
CIndividualNodeIncrementalExpansionData* CIndividualNodeIncrementalExpansionData::setPreviousCompletionGraphCorrespondenceIndividualNodeLoaded(bool loaded) {
mPrevCompGraphCorrIndiNodeLoaded = loaded;
return this;
}
CIndividualNodeIncrementalExpansionData* CIndividualNodeIncrementalExpansionData::addNeighbourPropagatedDirectlyChanged(CIndividualProcessNode* indiNode) {
getNeighbourPropagatedDirectlyChangedList(true)->append(indiNode);
return this;
}
CIndividualNodeIncrementalExpansionData* CIndividualNodeIncrementalExpansionData::clearNeighbourPropagatedDirectlyChangedList() {
if (mUseNeighbourPropagatedDirectlyChangedList && !mUseNeighbourPropagatedDirectlyChangedList->isEmpty()) {
getNeighbourPropagatedDirectlyChangedList(true)->clear();
}
return this;
}
bool CIndividualNodeIncrementalExpansionData::hasNeighbourPropagatedDirectlyChanged() {
if (mUseNeighbourPropagatedDirectlyChangedList && !mUseNeighbourPropagatedDirectlyChangedList->isEmpty()) {
return true;
}
return false;
}
CPROCESSLIST<CIndividualProcessNode*>* CIndividualNodeIncrementalExpansionData::getNeighbourPropagatedDirectlyChangedList(bool create) {
if (!mLocNeighbourPropagatedDirectlyChangedList && create) {
mLocNeighbourPropagatedDirectlyChangedList = CObjectParameterizingAllocator< CPROCESSLIST<CIndividualProcessNode*>,CContext* >::allocateAndConstructAndParameterize(mProcessContext->getUsedMemoryAllocationManager(),mProcessContext);
if (mUseNeighbourPropagatedDirectlyChangedList) {
*mLocNeighbourPropagatedDirectlyChangedList = *mUseNeighbourPropagatedDirectlyChangedList;
}
mUseNeighbourPropagatedDirectlyChangedList = mLocNeighbourPropagatedDirectlyChangedList;
}
return mUseNeighbourPropagatedDirectlyChangedList;
}
CPROCESSLIST<CIndividual*>* CIndividualNodeIncrementalExpansionData::getIncrementalExpansionList(bool create) {
if (!mLocIncrementalExpansionList && create) {
mLocIncrementalExpansionList = CObjectParameterizingAllocator< CPROCESSLIST<CIndividual*>,CContext* >::allocateAndConstructAndParameterize(mProcessContext->getUsedMemoryAllocationManager(),mProcessContext);
if (mUseIncrementalExpansionList) {
*mLocIncrementalExpansionList = *mUseIncrementalExpansionList;
}
mUseIncrementalExpansionList = mLocIncrementalExpansionList;
}
return mUseIncrementalExpansionList;
}
bool CIndividualNodeIncrementalExpansionData::isIncremetnalExpansionListInitialized() {
return mIncremetnalExpansionListInitialized;
}
CIndividualNodeIncrementalExpansionData* CIndividualNodeIncrementalExpansionData::setIncremetnalExpansionListInitialized(bool initialized) {
mIncremetnalExpansionListInitialized = initialized;
return this;
}
bool CIndividualNodeIncrementalExpansionData::requiresFurtherIncrementalExpansion() {
if (mUseIncrementalExpansionList && !mUseIncrementalExpansionList->isEmpty()) {
return true;
}
return false;
}
double CIndividualNodeIncrementalExpansionData::getExpansionPriority() {
return mExpansionPriority;
}
CIndividualNodeIncrementalExpansionData* CIndividualNodeIncrementalExpansionData::setExpansionPriority(double priority) {
mExpansionPriority = priority;
return this;
}
CIndividualNodeIncrementalExpansionData* CIndividualNodeIncrementalExpansionData::setExpansionID(cint64 id) {
mExpansionPriority = (cint64)id;
return this;
}
double CIndividualNodeIncrementalExpansionData::getNextIncrementalExpansionPriority() {
return mExpansionPriority + 1.0;
}
CIndividual* CIndividualNodeIncrementalExpansionData::takeNextIncrementalExpansionIndividual() {
if (mUseIncrementalExpansionList && !mUseIncrementalExpansionList->isEmpty()) {
return mUseIncrementalExpansionList->takeFirst();
}
return nullptr;
}
CIndividual* CIndividualNodeIncrementalExpansionData::getNextIncrementalExpansionIndividual() {
if (mUseIncrementalExpansionList && !mUseIncrementalExpansionList->isEmpty()) {
return mUseIncrementalExpansionList->first();
}
return nullptr;
}
}; // end namespace Process
}; // end namespace Kernel
}; // end namespace Reasoner
}; // end namespace Konclude
|
