Debian Codegraph @

Source/Reasoner/Kernel/Process/CIndividualNodeIncrementalExpansionData.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 "CIndividualNodeIncrementalExpansionData.h"
22
23
24 namespace Konclude {
25
26 namespace Reasoner {
27
28 namespace Kernel {
29
30 namespace Process {
31
32
33 CIndividualNodeIncrementalExpansionData::CIndividualNodeIncrementalExpansionData(CProcessContext* processContext) : mProcessContext(processContext) {
34 }
35
36 CIndividualNodeIncrementalExpansionData* CIndividualNodeIncrementalExpansionData::initIncrementalExpansionData(CIndividualNodeIncrementalExpansionData* prevData) {
37 if (prevData) {
38 mDirectlyChanged = prevData->mDirectlyChanged;
39 mDirectlyChangedNeighbourConnNode = prevData->mDirectlyChangedNeighbourConnNode;
40 mCompletionGraphCompatible = prevData->mCompletionGraphCompatible;
41 mLastCompatibleCheckedConDes = prevData->mLastCompatibleCheckedConDes;
42 mLastCompatibleCheckedLink = prevData->mLastCompatibleCheckedLink;
43 mPrevCompGraphCorrIndiNode = prevData->mPrevCompGraphCorrIndiNode;
44 mPrevCompGraphCorrIndiNodeLoaded = prevData->mPrevCompGraphCorrIndiNodeLoaded;
45 mUseNeighbourPropagatedDirectlyChangedList = prevData->mUseNeighbourPropagatedDirectlyChangedList;
46 mLocNeighbourPropagatedDirectlyChangedList = nullptr;
47 mUseIncrementalExpansionList = prevData->mUseIncrementalExpansionList;
48 mLocIncrementalExpansionList = nullptr;
49 mIncremetnalExpansionListInitialized = prevData->mIncremetnalExpansionListInitialized;
50 mExpansionPriority = prevData->mExpansionPriority;
51 } else {
52 mDirectlyChanged = false;
53 mDirectlyChangedNeighbourConnNode = nullptr;
54 mCompletionGraphCompatible = false;
55 mPrevCompGraphCorrIndiNodeLoaded = false;
56 mLastCompatibleCheckedConDes = nullptr;
57 mLastCompatibleCheckedLink = nullptr;
58 mPrevCompGraphCorrIndiNode = nullptr;
59 mLocNeighbourPropagatedDirectlyChangedList = nullptr;
60 mUseNeighbourPropagatedDirectlyChangedList = nullptr;
61 mLocIncrementalExpansionList = nullptr;
62 mUseIncrementalExpansionList = nullptr;
63 mIncremetnalExpansionListInitialized = false;
64 mExpansionPriority = 0.;
65 }
66 return this;
67 }
68
69 CIndividualProcessNode* CIndividualNodeIncrementalExpansionData::getDirectlyChangedNeighbourConnectionNode() {
70 return mDirectlyChangedNeighbourConnNode;
71 }
72
73 CIndividualNodeIncrementalExpansionData* CIndividualNodeIncrementalExpansionData::setDirectlyChangedNeighbourConnectionNode(CIndividualProcessNode* node) {
74 mDirectlyChangedNeighbourConnNode = node;
75 return this;
76 }
77
78 bool CIndividualNodeIncrementalExpansionData::hasDirectlyChangedNeighbourConnection() {
79 return mDirectlyChangedNeighbourConnNode != nullptr;
80 }
81
82 bool CIndividualNodeIncrementalExpansionData::isCompatibilityChanged() {
83 return mDirectlyChanged && hasDirectlyChangedNeighbourConnection();
84 }
85
86 bool CIndividualNodeIncrementalExpansionData::isDirectlyChanged() {
87 return mDirectlyChanged;
88 }
89
90 CIndividualNodeIncrementalExpansionData* CIndividualNodeIncrementalExpansionData::setDirectlyChanged(bool directlyChanged) {
91 mDirectlyChanged = directlyChanged;
92 return this;
93 }
94
95
96 bool CIndividualNodeIncrementalExpansionData::isPreviousCompletionGraphCompatible() {
97 return mCompletionGraphCompatible;
98 }
99
100 CIndividualNodeIncrementalExpansionData* CIndividualNodeIncrementalExpansionData::setPreviousCompletionGraphCompatible(bool compatible) {
101 mCompletionGraphCompatible = compatible;
102 return this;
103 }
104
105
106 CConceptDescriptor* CIndividualNodeIncrementalExpansionData::getLastCompatibleCheckedConceptDescriptor() {
107 return mLastCompatibleCheckedConDes;
108 }
109
110 CLinkEdge* CIndividualNodeIncrementalExpansionData::getLastCompatibleCheckedLink() {
111 return mLastCompatibleCheckedLink;
112 }
113
114 CIndividualNodeIncrementalExpansionData* CIndividualNodeIncrementalExpansionData::setLastCompatibleCheckedConceptDescriptor(CConceptDescriptor* conDes) {
115 mLastCompatibleCheckedConDes = conDes;
116 return this;
117 }
118
119 CIndividualNodeIncrementalExpansionData* CIndividualNodeIncrementalExpansionData::setLastCompatibleCheckedLink(CLinkEdge* link) {
120 mLastCompatibleCheckedLink = link;
121 return this;
122 }
123
124 CIndividualProcessNode* CIndividualNodeIncrementalExpansionData::getPreviousCompletionGraphCorrespondenceIndividualNode() {
125 return mPrevCompGraphCorrIndiNode;
126 }
127
128 CIndividualNodeIncrementalExpansionData* CIndividualNodeIncrementalExpansionData::setPreviousCompletionGraphCorrespondenceIndividualNode(CIndividualProcessNode* node) {
129 mPrevCompGraphCorrIndiNode = node;
130 return this;
131 }
132
133 bool CIndividualNodeIncrementalExpansionData::isPreviousCompletionGraphCorrespondenceIndividualNodeLoaded() {
134 return mPrevCompGraphCorrIndiNodeLoaded;
135 }
136
137 CIndividualNodeIncrementalExpansionData* CIndividualNodeIncrementalExpansionData::setPreviousCompletionGraphCorrespondenceIndividualNodeLoaded(bool loaded) {
138 mPrevCompGraphCorrIndiNodeLoaded = loaded;
139 return this;
140 }
141
142 CIndividualNodeIncrementalExpansionData* CIndividualNodeIncrementalExpansionData::addNeighbourPropagatedDirectlyChanged(CIndividualProcessNode* indiNode) {
143 getNeighbourPropagatedDirectlyChangedList(true)->append(indiNode);
144 return this;
145 }
146
147 CIndividualNodeIncrementalExpansionData* CIndividualNodeIncrementalExpansionData::clearNeighbourPropagatedDirectlyChangedList() {
148 if (mUseNeighbourPropagatedDirectlyChangedList && !mUseNeighbourPropagatedDirectlyChangedList->isEmpty()) {
149 getNeighbourPropagatedDirectlyChangedList(true)->clear();
150 }
151 return this;
152 }
153
154 bool CIndividualNodeIncrementalExpansionData::hasNeighbourPropagatedDirectlyChanged() {
155 if (mUseNeighbourPropagatedDirectlyChangedList && !mUseNeighbourPropagatedDirectlyChangedList->isEmpty()) {
156 return true;
157 }
158 return false;
159 }
160
161
162 CPROCESSLIST<CIndividualProcessNode*>* CIndividualNodeIncrementalExpansionData::getNeighbourPropagatedDirectlyChangedList(bool create) {
163 if (!mLocNeighbourPropagatedDirectlyChangedList && create) {
164 mLocNeighbourPropagatedDirectlyChangedList = CObjectParameterizingAllocator< CPROCESSLIST<CIndividualProcessNode*>,CContext* >::allocateAndConstructAndParameterize(mProcessContext->getUsedMemoryAllocationManager(),mProcessContext);
165 if (mUseNeighbourPropagatedDirectlyChangedList) {
166 *mLocNeighbourPropagatedDirectlyChangedList = *mUseNeighbourPropagatedDirectlyChangedList;
167 }
168 mUseNeighbourPropagatedDirectlyChangedList = mLocNeighbourPropagatedDirectlyChangedList;
169 }
170 return mUseNeighbourPropagatedDirectlyChangedList;
171 }
172
173
174 CPROCESSLIST<CIndividual*>* CIndividualNodeIncrementalExpansionData::getIncrementalExpansionList(bool create) {
175 if (!mLocIncrementalExpansionList && create) {
176 mLocIncrementalExpansionList = CObjectParameterizingAllocator< CPROCESSLIST<CIndividual*>,CContext* >::allocateAndConstructAndParameterize(mProcessContext->getUsedMemoryAllocationManager(),mProcessContext);
177 if (mUseIncrementalExpansionList) {
178 *mLocIncrementalExpansionList = *mUseIncrementalExpansionList;
179 }
180 mUseIncrementalExpansionList = mLocIncrementalExpansionList;
181 }
182 return mUseIncrementalExpansionList;
183 }
184
185 bool CIndividualNodeIncrementalExpansionData::isIncremetnalExpansionListInitialized() {
186 return mIncremetnalExpansionListInitialized;
187 }
188
189 CIndividualNodeIncrementalExpansionData* CIndividualNodeIncrementalExpansionData::setIncremetnalExpansionListInitialized(bool initialized) {
190 mIncremetnalExpansionListInitialized = initialized;
191 return this;
192 }
193
194 bool CIndividualNodeIncrementalExpansionData::requiresFurtherIncrementalExpansion() {
195 if (mUseIncrementalExpansionList && !mUseIncrementalExpansionList->isEmpty()) {
196 return true;
197 }
198 return false;
199 }
200
201
202 double CIndividualNodeIncrementalExpansionData::getExpansionPriority() {
203 return mExpansionPriority;
204 }
205
206 CIndividualNodeIncrementalExpansionData* CIndividualNodeIncrementalExpansionData::setExpansionPriority(double priority) {
207 mExpansionPriority = priority;
208 return this;
209 }
210
211
212 CIndividualNodeIncrementalExpansionData* CIndividualNodeIncrementalExpansionData::setExpansionID(cint64 id) {
213 mExpansionPriority = (cint64)id;
214 return this;
215 }
216
217 double CIndividualNodeIncrementalExpansionData::getNextIncrementalExpansionPriority() {
218 return mExpansionPriority + 1.0;
219 }
220
221 CIndividual* CIndividualNodeIncrementalExpansionData::takeNextIncrementalExpansionIndividual() {
222 if (mUseIncrementalExpansionList && !mUseIncrementalExpansionList->isEmpty()) {
223 return mUseIncrementalExpansionList->takeFirst();
224 }
225 return nullptr;
226 }
227
228 CIndividual* CIndividualNodeIncrementalExpansionData::getNextIncrementalExpansionIndividual() {
229 if (mUseIncrementalExpansionList && !mUseIncrementalExpansionList->isEmpty()) {
230 return mUseIncrementalExpansionList->first();
231 }
232 return nullptr;
233 }
234
235
236
237 }; // end namespace Process
238
239 }; // end namespace Kernel
240
241 }; // end namespace Reasoner
242
243 }; // end namespace Konclude