| 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 "COptimizedKPSetConceptInstancesItem.h" |
| 22 |
|
| 23 |
|
| 24 |
namespace Konclude { |
| 25 |
|
| 26 |
namespace Reasoner { |
| 27 |
|
| 28 |
namespace Realizer { |
| 29 |
|
| 30 |
|
| 31 |
COptimizedKPSetConceptInstancesItem::COptimizedKPSetConceptInstancesItem() { |
| 32 |
} |
| 33 |
|
| 34 |
COptimizedKPSetConceptInstancesItem* COptimizedKPSetConceptInstancesItem::initInstancesItem(CHierarchyNode* hierNode) { |
| 35 |
mUnprocessedSuccItemCount = 0; |
| 36 |
mTestingPossInstanceCount = 0; |
| 37 |
mAllSuccProcessedFlag = false; |
| 38 |
mToProcessFlag = false; |
| 39 |
mProcessingQueuedFlag = false; |
| 40 |
mSelfSuccsCompletedFlag = false; |
| 41 |
mHierNode = hierNode; |
| 42 |
mConceptInstancesTestingFinished = false; |
| 43 |
mPossibleInstanceMergingDataContainer = nullptr; |
| 44 |
mIndividualItemPossibleInstanceMergingLinkerHash = nullptr; |
| 45 |
mPrefferedPossibleInstancesSet = nullptr; |
| 46 |
mModelMergingCheckedSet = nullptr; |
| 47 |
mConcurrentInitializationKnownInstancesLists = nullptr; |
| 48 |
mConcurrentInitializationPossibleInstancesLists = nullptr; |
| 49 |
return this; |
| 50 |
} |
| 51 |
|
| 52 |
|
| 53 |
COptimizedKPSetConceptInstancesItem* COptimizedKPSetConceptInstancesItem::prepareConcurrentInitialization(cint64 size) { |
| 54 |
mConcurrentInitializationKnownInstancesLists = new QList<COptimizedKPSetIndividualItem *>*[size]; |
| 55 |
mConcurrentInitializationPossibleInstancesLists = new QList<COptimizedKPSetIndividualItem *>*[size]; |
| 56 |
for (cint64 i = 0; i < size; ++i) { |
| 57 |
mConcurrentInitializationKnownInstancesLists[i] = nullptr; |
| 58 |
mConcurrentInitializationPossibleInstancesLists[i] = nullptr; |
| 59 |
} |
| 60 |
|
| 61 |
return this; |
| 62 |
} |
| 63 |
|
| 64 |
cint64 COptimizedKPSetConceptInstancesItem::finishConcurrentInitialization(cint64 size) { |
| 65 |
cint64 possInitCount = 0; |
| 66 |
|
| 67 |
for (cint64 i = 0; i < size; ++i) { |
| 68 |
QList<COptimizedKPSetIndividualItem *>* knownInstancesLists = mConcurrentInitializationKnownInstancesLists[i]; |
| 69 |
QList<COptimizedKPSetIndividualItem *>* possInstancesLists = mConcurrentInitializationPossibleInstancesLists[i]; |
| 70 |
|
| 71 |
if (knownInstancesLists) { |
| 72 |
for (COptimizedKPSetIndividualItem* knownInstance : *knownInstancesLists) { |
| 73 |
mKnownInstancesMap.insert(knownInstance->getIndividualId(), knownInstance); |
| 74 |
} |
| 75 |
delete knownInstancesLists; |
| 76 |
} |
| 77 |
if (possInstancesLists) { |
| 78 |
for (COptimizedKPSetIndividualItem* possInstance : *possInstancesLists) { |
| 79 |
mPossibleInstancesMap.insert(possInstance->getIndividualId(), possInstance); |
| 80 |
++possInitCount; |
| 81 |
} |
| 82 |
delete possInstancesLists; |
| 83 |
} |
| 84 |
} |
| 85 |
|
| 86 |
delete[] mConcurrentInitializationKnownInstancesLists; |
| 87 |
delete[] mConcurrentInitializationPossibleInstancesLists; |
| 88 |
mConcurrentInitializationKnownInstancesLists = nullptr; |
| 89 |
mConcurrentInitializationPossibleInstancesLists = nullptr; |
| 90 |
|
| 91 |
return possInitCount; |
| 92 |
} |
| 93 |
|
| 94 |
|
| 95 |
COptimizedKPSetConceptInstancesItem* COptimizedKPSetConceptInstancesItem::addKnownInstanceConcurrently(COptimizedKPSetIndividualItem* item, cint64 indiVecPos) { |
| 96 |
QList<COptimizedKPSetIndividualItem *>*& knownInstancesLists = mConcurrentInitializationKnownInstancesLists[indiVecPos]; |
| 97 |
if (!knownInstancesLists) { |
| 98 |
knownInstancesLists = new QList<COptimizedKPSetIndividualItem *>(); |
| 99 |
} |
| 100 |
knownInstancesLists->append(item); |
| 101 |
return this; |
| 102 |
} |
| 103 |
|
| 104 |
COptimizedKPSetConceptInstancesItem* COptimizedKPSetConceptInstancesItem::addPossibleInstanceConcurrently(COptimizedKPSetIndividualItem* item, cint64 indiVecPos) { |
| 105 |
QList<COptimizedKPSetIndividualItem *>*& possInstancesLists = mConcurrentInitializationPossibleInstancesLists[indiVecPos]; |
| 106 |
if (!possInstancesLists) { |
| 107 |
possInstancesLists = new QList<COptimizedKPSetIndividualItem *>(); |
| 108 |
} |
| 109 |
possInstancesLists->append(item); |
| 110 |
return this; |
| 111 |
} |
| 112 |
|
| 113 |
|
| 114 |
|
| 115 |
COptimizedKPSetConceptInstancesItem* COptimizedKPSetConceptInstancesItem::setInitialUnprocessedSuccessorItemCount() { |
| 116 |
mUnprocessedSuccItemCount = mSuccessorItemList.count(); |
| 117 |
return this; |
| 118 |
} |
| 119 |
|
| 120 |
CHierarchyNode* COptimizedKPSetConceptInstancesItem::getHierarchyNode() { |
| 121 |
return mHierNode; |
| 122 |
} |
| 123 |
|
| 124 |
COptimizedKPSetConceptInstancesItem* COptimizedKPSetConceptInstancesItem::setHierarchyNode(CHierarchyNode* hierNode) { |
| 125 |
mHierNode = hierNode; |
| 126 |
return this; |
| 127 |
} |
| 128 |
|
| 129 |
QMap<cint64, COptimizedKPSetIndividualItem*>* COptimizedKPSetConceptInstancesItem::getKnownInstancesMap() { |
| 130 |
return &mKnownInstancesMap; |
| 131 |
} |
| 132 |
|
| 133 |
QMap<cint64, COptimizedKPSetIndividualItem*>* COptimizedKPSetConceptInstancesItem::getPossibleInstancesMap() { |
| 134 |
return &mPossibleInstancesMap; |
| 135 |
} |
| 136 |
|
| 137 |
|
| 138 |
QHash<cint64, CRealizingTestingItem*>* COptimizedKPSetConceptInstancesItem::getPossibleInstanceTestingItemHash() { |
| 139 |
return &mPossibleInstanceTestingItemHash; |
| 140 |
} |
| 141 |
|
| 142 |
|
| 143 |
QList<COptimizedKPSetConceptInstancesItem*>* COptimizedKPSetConceptInstancesItem::getParentItemList() { |
| 144 |
return &mParentItemList; |
| 145 |
} |
| 146 |
|
| 147 |
QList<COptimizedKPSetConceptInstancesItem*>* COptimizedKPSetConceptInstancesItem::getSuccessorItemList() { |
| 148 |
return &mSuccessorItemList; |
| 149 |
} |
| 150 |
|
| 151 |
COptimizedKPSetConceptInstancesItem* COptimizedKPSetConceptInstancesItem::addKnownInstance(COptimizedKPSetIndividualItem* item) { |
| 152 |
mKnownInstancesMap.insert(item->getIndividualId(), item); |
| 153 |
return this; |
| 154 |
} |
| 155 |
|
| 156 |
COptimizedKPSetConceptInstancesItem* COptimizedKPSetConceptInstancesItem::removeKnownInstance(COptimizedKPSetIndividualItem* item) { |
| 157 |
mKnownInstancesMap.remove(item->getIndividualId()); |
| 158 |
return this; |
| 159 |
} |
| 160 |
|
| 161 |
bool COptimizedKPSetConceptInstancesItem::hasKnownInstance(COptimizedKPSetIndividualItem* item) { |
| 162 |
return mKnownInstancesMap.contains(item->getIndividualId()); |
| 163 |
} |
| 164 |
|
| 165 |
|
| 166 |
bool COptimizedKPSetConceptInstancesItem::hasPossibleInstance(COptimizedKPSetIndividualItem* item) { |
| 167 |
return mPossibleInstancesMap.contains(item->getIndividualId()); |
| 168 |
} |
| 169 |
|
| 170 |
COptimizedKPSetConceptInstancesItem* COptimizedKPSetConceptInstancesItem::addPossibleInstance(COptimizedKPSetIndividualItem* item) { |
| 171 |
mPossibleInstancesMap.insert(item->getIndividualId(), item); |
| 172 |
return this; |
| 173 |
} |
| 174 |
|
| 175 |
COptimizedKPSetConceptInstancesItem* COptimizedKPSetConceptInstancesItem::addParentItem(COptimizedKPSetConceptInstancesItem* item) { |
| 176 |
mParentItemList.append(item); |
| 177 |
return this; |
| 178 |
} |
| 179 |
|
| 180 |
COptimizedKPSetConceptInstancesItem* COptimizedKPSetConceptInstancesItem::addSuccessorItem(COptimizedKPSetConceptInstancesItem* item) { |
| 181 |
mSuccessorItemList.append(item); |
| 182 |
return this; |
| 183 |
} |
| 184 |
|
| 185 |
cint64 COptimizedKPSetConceptInstancesItem::getUnprocessedSuccessorItemCount() { |
| 186 |
return mUnprocessedSuccItemCount; |
| 187 |
} |
| 188 |
|
| 189 |
COptimizedKPSetConceptInstancesItem* COptimizedKPSetConceptInstancesItem::setUnprocessedSuccessorItemCount(cint64 unpSuccCount) { |
| 190 |
mUnprocessedSuccItemCount = unpSuccCount; |
| 191 |
return this; |
| 192 |
} |
| 193 |
|
| 194 |
COptimizedKPSetConceptInstancesItem* COptimizedKPSetConceptInstancesItem::incUnprocessedSuccessorItemCount(cint64 incCount) { |
| 195 |
mUnprocessedSuccItemCount += incCount; |
| 196 |
return this; |
| 197 |
} |
| 198 |
|
| 199 |
COptimizedKPSetConceptInstancesItem* COptimizedKPSetConceptInstancesItem::decUnprocessedSuccessorItemCount(cint64 decCount) { |
| 200 |
mUnprocessedSuccItemCount -= decCount; |
| 201 |
return this; |
| 202 |
} |
| 203 |
|
| 204 |
cint64 COptimizedKPSetConceptInstancesItem::getTestingPossibleInstancesCount() { |
| 205 |
return mTestingPossInstanceCount; |
| 206 |
} |
| 207 |
|
| 208 |
bool COptimizedKPSetConceptInstancesItem::hasTestingPossibleInstances() { |
| 209 |
return mTestingPossInstanceCount > 0; |
| 210 |
} |
| 211 |
|
| 212 |
COptimizedKPSetConceptInstancesItem* COptimizedKPSetConceptInstancesItem::setTestingPossibleInstancesCount(cint64 testPossIntCount) { |
| 213 |
mTestingPossInstanceCount = testPossIntCount; |
| 214 |
return this; |
| 215 |
} |
| 216 |
|
| 217 |
COptimizedKPSetConceptInstancesItem* COptimizedKPSetConceptInstancesItem::incTestingPossibleInstancesCount(cint64 incCount) { |
| 218 |
mTestingPossInstanceCount += incCount; |
| 219 |
return this; |
| 220 |
} |
| 221 |
|
| 222 |
COptimizedKPSetConceptInstancesItem* COptimizedKPSetConceptInstancesItem::decTestingPossibleInstancesCount(cint64 decCount) { |
| 223 |
mTestingPossInstanceCount -= decCount; |
| 224 |
return this; |
| 225 |
} |
| 226 |
|
| 227 |
bool COptimizedKPSetConceptInstancesItem::hasAllSuccessorProcessedFlag() { |
| 228 |
return mAllSuccProcessedFlag; |
| 229 |
} |
| 230 |
|
| 231 |
COptimizedKPSetConceptInstancesItem* COptimizedKPSetConceptInstancesItem::setAllSuccessorProcessedFlag(bool allSuccProcessed) { |
| 232 |
mAllSuccProcessedFlag = allSuccProcessed; |
| 233 |
return this; |
| 234 |
} |
| 235 |
|
| 236 |
bool COptimizedKPSetConceptInstancesItem::hasToProcessPossibleInstancesFlag() { |
| 237 |
return mToProcessFlag; |
| 238 |
} |
| 239 |
|
| 240 |
COptimizedKPSetConceptInstancesItem* COptimizedKPSetConceptInstancesItem::setToProcessPossibleInstancesFlag(bool toProcess) { |
| 241 |
mToProcessFlag = toProcess; |
| 242 |
return this; |
| 243 |
} |
| 244 |
|
| 245 |
bool COptimizedKPSetConceptInstancesItem::hasPossibleInstancesProcessingQueuedFlag() { |
| 246 |
return mProcessingQueuedFlag; |
| 247 |
} |
| 248 |
|
| 249 |
COptimizedKPSetConceptInstancesItem* COptimizedKPSetConceptInstancesItem::setPossibleInstancesProcessingQueuedFlag(bool processingQueued) { |
| 250 |
mProcessingQueuedFlag = processingQueued; |
| 251 |
return this; |
| 252 |
} |
| 253 |
|
| 254 |
bool COptimizedKPSetConceptInstancesItem::hasSelfSuccessorProcessedFlag() { |
| 255 |
return mSelfSuccsCompletedFlag; |
| 256 |
} |
| 257 |
|
| 258 |
COptimizedKPSetConceptInstancesItem* COptimizedKPSetConceptInstancesItem::setSelfSuccessorProcessedFlag(bool selfSuccProcessed) { |
| 259 |
mSelfSuccsCompletedFlag = selfSuccProcessed; |
| 260 |
return this; |
| 261 |
} |
| 262 |
|
| 263 |
bool COptimizedKPSetConceptInstancesItem::hasPossibleInstances() { |
| 264 |
return !mPossibleInstancesMap.isEmpty(); |
| 265 |
} |
| 266 |
|
| 267 |
COptimizedKPSetConceptInstancesItem* COptimizedKPSetConceptInstancesItem::removeTestingPossibleInstance(COptimizedKPSetIndividualItem* possInstance) { |
| 268 |
mPossibleInstancesMap.remove(possInstance->getIndividualId()); |
| 269 |
if (mPrefferedPossibleInstancesSet) { |
| 270 |
mPrefferedPossibleInstancesSet->remove(possInstance->getIndividualId()); |
| 271 |
} |
| 272 |
return this; |
| 273 |
} |
| 274 |
|
| 275 |
QMap<cint64, COptimizedKPSetIndividualItem*>*& COptimizedKPSetConceptInstancesItem::getPrefferedPossibleInstanceTestingSet() { |
| 276 |
return mPrefferedPossibleInstancesSet; |
| 277 |
} |
| 278 |
|
| 279 |
|
| 280 |
COptimizedKPSetIndividualItem* COptimizedKPSetConceptInstancesItem::takeNextTestingPossibleInstance() { |
| 281 |
COptimizedKPSetIndividualItem* nextItem = nullptr; |
| 282 |
if (hasPossibleInstances()) { |
| 283 |
if (mIndividualItemPossibleInstanceMergingLinkerHash) { |
| 284 |
if (!mPrefferedPossibleInstancesSet) { |
| 285 |
mPrefferedPossibleInstancesSet = new QMap<cint64, COptimizedKPSetIndividualItem *>(mPossibleInstancesMap); |
| 286 |
} |
| 287 |
} |
| 288 |
|
| 289 |
if (mPrefferedPossibleInstancesSet && !mPrefferedPossibleInstancesSet->isEmpty()) { |
| 290 |
QMap<cint64, COptimizedKPSetIndividualItem*>::iterator it = mPrefferedPossibleInstancesSet->begin(); |
| 291 |
while (it != mPrefferedPossibleInstancesSet->end()) { |
| 292 |
nextItem = *it; |
| 293 |
it = mPrefferedPossibleInstancesSet->erase(it); |
| 294 |
CPossibleInstancesIndividualsMergingLinker* linker = mIndividualItemPossibleInstanceMergingLinkerHash->value(nextItem); |
| 295 |
if (!linker || linker->isSatisfiableMerged()) { |
| 296 |
break; |
| 297 |
} |
| 298 |
} |
| 299 |
mPossibleInstancesMap.remove(nextItem->getIndividualId()); |
| 300 |
|
| 301 |
} else { |
| 302 |
|
| 303 |
QMap<cint64, COptimizedKPSetIndividualItem*>::iterator it = mPossibleInstancesMap.begin(); |
| 304 |
nextItem = *it; |
| 305 |
mPossibleInstancesMap.erase(it); |
| 306 |
} |
| 307 |
} |
| 308 |
return nextItem; |
| 309 |
} |
| 310 |
|
| 311 |
COptimizedKPSetConceptInstancesItem* COptimizedKPSetConceptInstancesItem::setConceptInstancesTestingFinished(bool finished) { |
| 312 |
mConceptInstancesTestingFinished = finished; |
| 313 |
return this; |
| 314 |
} |
| 315 |
|
| 316 |
bool COptimizedKPSetConceptInstancesItem::isConceptInstancesTestingFinished() { |
| 317 |
return mConceptInstancesTestingFinished; |
| 318 |
} |
| 319 |
|
| 320 |
|
| 321 |
QHash<COptimizedKPSetIndividualItem*, CPossibleInstancesIndividualsMergingLinker*>* COptimizedKPSetConceptInstancesItem::getIndividualItemPossibleInstanceMergingLinkerHash(bool create) { |
| 322 |
if (create && !mIndividualItemPossibleInstanceMergingLinkerHash) { |
| 323 |
mIndividualItemPossibleInstanceMergingLinkerHash = new QHash<COptimizedKPSetIndividualItem *, CPossibleInstancesIndividualsMergingLinker *>(); |
| 324 |
} |
| 325 |
return mIndividualItemPossibleInstanceMergingLinkerHash; |
| 326 |
} |
| 327 |
|
| 328 |
QList<CPossibleInstancesIndividualsMergingData*>* COptimizedKPSetConceptInstancesItem::getPossibleInstanceMergingDataContainer(bool create) { |
| 329 |
if (create && !mPossibleInstanceMergingDataContainer) { |
| 330 |
mPossibleInstanceMergingDataContainer = new QList<CPossibleInstancesIndividualsMergingData *>(); |
| 331 |
} |
| 332 |
return mPossibleInstanceMergingDataContainer; |
| 333 |
} |
| 334 |
|
| 335 |
|
| 336 |
COptimizedKPSetConceptInstancesItem* COptimizedKPSetConceptInstancesItem::clearPossibleInstanceMergingData() { |
| 337 |
if (mPossibleInstanceMergingDataContainer) { |
| 338 |
qDeleteAll(*mPossibleInstanceMergingDataContainer); |
| 339 |
delete mPossibleInstanceMergingDataContainer; |
| 340 |
mPossibleInstanceMergingDataContainer = nullptr; |
| 341 |
} |
| 342 |
if (mIndividualItemPossibleInstanceMergingLinkerHash) { |
| 343 |
delete mIndividualItemPossibleInstanceMergingLinkerHash; |
| 344 |
mIndividualItemPossibleInstanceMergingLinkerHash = nullptr; |
| 345 |
} |
| 346 |
if (mPrefferedPossibleInstancesSet) { |
| 347 |
delete mPrefferedPossibleInstancesSet; |
| 348 |
mPrefferedPossibleInstancesSet = nullptr; |
| 349 |
} |
| 350 |
if (mModelMergingCheckedSet) { |
| 351 |
delete mModelMergingCheckedSet; |
| 352 |
mModelMergingCheckedSet = nullptr; |
| 353 |
} |
| 354 |
return this; |
| 355 |
} |
| 356 |
|
| 357 |
|
| 358 |
QMap<cint64, COptimizedKPSetIndividualItem*>* COptimizedKPSetConceptInstancesItem::getModelMergingCheckedSet(bool create) { |
| 359 |
if (!mModelMergingCheckedSet && create) { |
| 360 |
mModelMergingCheckedSet = new QMap<cint64, COptimizedKPSetIndividualItem*>(); |
| 361 |
} |
| 362 |
return mModelMergingCheckedSet; |
| 363 |
} |
| 364 |
|
| 365 |
|
| 366 |
COptimizedKPSetConceptInstancesItem* COptimizedKPSetConceptInstancesItem::addKnownInstancesLabelCacheItem(CBackendRepresentativeMemoryLabelCacheItem* item) { |
| 367 |
mKnownInstancesLabelCacheItemList.append(item); |
| 368 |
return this; |
| 369 |
} |
| 370 |
|
| 371 |
COptimizedKPSetConceptInstancesItem* COptimizedKPSetConceptInstancesItem::addKnownMostSpecificInstancesLabelCacheItem(CBackendRepresentativeMemoryLabelCacheItem* item) { |
| 372 |
mKnownMostSpecificInstancesLabelCacheItemList.append(item); |
| 373 |
return this; |
| 374 |
} |
| 375 |
|
| 376 |
COptimizedKPSetConceptInstancesItem* COptimizedKPSetConceptInstancesItem::addPossibleInstancesLabelCacheItem(CBackendRepresentativeMemoryLabelCacheItem* item) { |
| 377 |
mPossibleInstancesLabelCacheItemList.append(item); |
| 378 |
return this; |
| 379 |
} |
| 380 |
|
| 381 |
|
| 382 |
COptimizedKPSetConceptInstancesItem* COptimizedKPSetConceptInstancesItem::addPossibleMostSpecificInstancesLabelCacheItem(CBackendRepresentativeMemoryLabelCacheItem* item) { |
| 383 |
mPossibleMostSpecificInstancesLabelCacheItemList.append(item); |
| 384 |
return this; |
| 385 |
} |
| 386 |
|
| 387 |
QList<CBackendRepresentativeMemoryLabelCacheItem*>* COptimizedKPSetConceptInstancesItem::getKnownInstancesLabelCacheItemList() { |
| 388 |
return &mKnownInstancesLabelCacheItemList; |
| 389 |
} |
| 390 |
|
| 391 |
QList<CBackendRepresentativeMemoryLabelCacheItem*>* COptimizedKPSetConceptInstancesItem::getKnownMostSpecificInstancesLabelCacheItemList() { |
| 392 |
return &mKnownMostSpecificInstancesLabelCacheItemList; |
| 393 |
} |
| 394 |
|
| 395 |
QList<CBackendRepresentativeMemoryLabelCacheItem*>* COptimizedKPSetConceptInstancesItem::getPossibleInstancesLabelCacheItemList() { |
| 396 |
return &mPossibleInstancesLabelCacheItemList; |
| 397 |
} |
| 398 |
|
| 399 |
QList<CBackendRepresentativeMemoryLabelCacheItem*>* COptimizedKPSetConceptInstancesItem::getPossibleMostSpecificInstancesLabelCacheItemList() { |
| 400 |
return &mPossibleMostSpecificInstancesLabelCacheItemList; |
| 401 |
} |
| 402 |
|
| 403 |
|
| 404 |
|
| 405 |
}; // end namespace Realizer |
| 406 |
|
| 407 |
}; // end namespace Reasoner |
| 408 |
|
| 409 |
}; // end namespace Konclude |