| 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 "COptimizedComplexVariableIndividualMappingsHash.h" |
| 22 |
|
| 23 |
|
| 24 |
namespace Konclude { |
| 25 |
|
| 26 |
namespace Reasoner { |
| 27 |
|
| 28 |
namespace Answerer { |
| 29 |
|
| 30 |
|
| 31 |
COptimizedComplexVariableIndividualMappingsHash::COptimizedComplexVariableIndividualMappingsHash(cint64 bindingSize) : COptimizedComplexVariableIndividualMappings(bindingSize) { |
| 32 |
mContext = new CMemoryPoolNewAllocationIncreasingContext(500, 500000, 2); |
| 33 |
mMappingCardinalityHash = CObjectParameterizingAllocator< CQtManagedRestrictedModificationHash<COptimizedComplexVariableIndividualBindingsHasher, COptimizedComplexVariableIndividualBindingsCardinalityLinker*>, CContext* >::allocateAndConstructAndParameterize(mContext->getMemoryAllocationManager(), mContext); |
| 34 |
} |
| 35 |
|
| 36 |
|
| 37 |
COptimizedComplexVariableIndividualMappingsHash::~COptimizedComplexVariableIndividualMappingsHash() { |
| 38 |
CMemoryPool* memPools = mContext->getMemoryPools(); |
| 39 |
CMemoryPool* memPoolsIt = memPools; |
| 40 |
while (memPoolsIt) { |
| 41 |
CMemoryPool* tmpMemPool = memPoolsIt; |
| 42 |
memPoolsIt = memPoolsIt->getNext(); |
| 43 |
delete[] tmpMemPool->getMemoryBlockData(); |
| 44 |
delete tmpMemPool; |
| 45 |
} |
| 46 |
delete mContext; |
| 47 |
} |
| 48 |
|
| 49 |
|
| 50 |
|
| 51 |
bool COptimizedComplexVariableIndividualMappingsHash::addInsertingBindingsCardinalityLinker(COptimizedComplexVariableIndividualBindingsCardinalityLinker* linker, bool addCardinalitiesIfAlreadyPresent) { |
| 52 |
COptimizedComplexVariableIndividualBindingsHasher hasher(linker); |
| 53 |
COptimizedComplexVariableIndividualBindingsCardinalityLinker*& hashedLinker = (*mMappingCardinalityHash)[hasher]; |
| 54 |
if (!hashedLinker) { |
| 55 |
hashedLinker = linker; |
| 56 |
if (linker->getCurrentCardinalities()) { |
| 57 |
linker->getCurrentCardinalities()->setCardinalityUpdateId(mCurrentUpdateId); |
| 58 |
mMaximumCardinalitySameIndividualsJointlyConsidered = qMax(mMaximumCardinalitySameIndividualsJointlyConsidered, linker->getCurrentCardinalities()->getSameIndividualsJointlyConsideredCardinality()); |
| 59 |
mMaximumCardinalitySameIndividualsSeparatelyConsidered = qMax(mMaximumCardinalitySameIndividualsSeparatelyConsidered, linker->getCurrentCardinalities()->getSameIndividualsSeparatlyConsideredCardinality()); |
| 60 |
} |
| 61 |
addLastAddedBindingsCardinalityLinker(linker); |
| 62 |
mBindingCount = mMappingCardinalityHash->size(); |
| 63 |
return true; |
| 64 |
} else if (addCardinalitiesIfAlreadyPresent) { |
| 65 |
COptimizedComplexVariableIndividualBindingsCardinality* cardinalities = linker->getCurrentCardinalities(); |
| 66 |
if (cardinalities) { |
| 67 |
if (hashedLinker->getCurrentCardinalities() && hashedLinker->getCurrentCardinalities()->getCardinalityUpdateId() == mCurrentUpdateId) { |
| 68 |
hashedLinker->getCurrentCardinalities()->addCardinalities(cardinalities); |
| 69 |
mMaximumCardinalitySameIndividualsJointlyConsidered = qMax(mMaximumCardinalitySameIndividualsJointlyConsidered, hashedLinker->getCurrentCardinalities()->getSameIndividualsJointlyConsideredCardinality()); |
| 70 |
mMaximumCardinalitySameIndividualsSeparatelyConsidered = qMax(mMaximumCardinalitySameIndividualsSeparatelyConsidered, hashedLinker->getCurrentCardinalities()->getSameIndividualsSeparatlyConsideredCardinality()); |
| 71 |
} else { |
| 72 |
linker->clearCardinalities(); |
| 73 |
COptimizedComplexVariableIndividualBindingsCardinality* prevCardinalities = hashedLinker->getCurrentCardinalities(); |
| 74 |
if (prevCardinalities) { |
| 75 |
cardinalities->addCardinalities(prevCardinalities); |
| 76 |
} |
| 77 |
mMaximumCardinalitySameIndividualsJointlyConsidered = qMax(mMaximumCardinalitySameIndividualsJointlyConsidered, cardinalities->getSameIndividualsJointlyConsideredCardinality()); |
| 78 |
mMaximumCardinalitySameIndividualsSeparatelyConsidered = qMax(mMaximumCardinalitySameIndividualsSeparatelyConsidered, cardinalities->getSameIndividualsSeparatlyConsideredCardinality()); |
| 79 |
hashedLinker->updateCardinality(cardinalities); |
| 80 |
cardinalities->setCardinalityUpdateId(mCurrentUpdateId); |
| 81 |
COptimizedComplexVariableIndividualUpdateCardinalityLinker* updateCardLinker = new COptimizedComplexVariableIndividualUpdateCardinalityLinker(hashedLinker, prevCardinalities); |
| 82 |
addLastUpdatedCardinalityLinker(updateCardLinker); |
| 83 |
} |
| 84 |
} |
| 85 |
} |
| 86 |
return false; |
| 87 |
} |
| 88 |
|
| 89 |
|
| 90 |
bool COptimizedComplexVariableIndividualMappingsHash::addBindingsCardinalities(COptimizedComplexVariableIndividualBindings* bindings, COptimizedComplexVariableIndividualBindingsCardinality* addedCardinalites) { |
| 91 |
COptimizedComplexVariableIndividualBindingsCardinalityLinker tmpLinker(bindings, addedCardinalites); |
| 92 |
COptimizedComplexVariableIndividualBindingsHasher hasher(&tmpLinker); |
| 93 |
COptimizedComplexVariableIndividualBindingsCardinalityLinker* hashedLinker = (*mMappingCardinalityHash).value(hasher); |
| 94 |
if (hashedLinker) { |
| 95 |
if (hashedLinker->getCurrentCardinalities() && hashedLinker->getCurrentCardinalities()->getCardinalityUpdateId() == mCurrentUpdateId) { |
| 96 |
hashedLinker->getCurrentCardinalities()->addCardinalities(addedCardinalites); |
| 97 |
mMaximumCardinalitySameIndividualsJointlyConsidered = qMax(mMaximumCardinalitySameIndividualsJointlyConsidered, hashedLinker->getCurrentCardinalities()->getSameIndividualsJointlyConsideredCardinality()); |
| 98 |
mMaximumCardinalitySameIndividualsSeparatelyConsidered = qMax(mMaximumCardinalitySameIndividualsSeparatelyConsidered, hashedLinker->getCurrentCardinalities()->getSameIndividualsSeparatlyConsideredCardinality()); |
| 99 |
} else { |
| 100 |
COptimizedComplexVariableIndividualBindingsCardinality* prevCardinalities = hashedLinker->getCurrentCardinalities(); |
| 101 |
if (prevCardinalities) { |
| 102 |
addedCardinalites->addCardinalities(prevCardinalities); |
| 103 |
} |
| 104 |
mMaximumCardinalitySameIndividualsJointlyConsidered = qMax(mMaximumCardinalitySameIndividualsJointlyConsidered, addedCardinalites->getSameIndividualsJointlyConsideredCardinality()); |
| 105 |
mMaximumCardinalitySameIndividualsSeparatelyConsidered = qMax(mMaximumCardinalitySameIndividualsSeparatelyConsidered, addedCardinalites->getSameIndividualsSeparatlyConsideredCardinality()); |
| 106 |
hashedLinker->updateCardinality(addedCardinalites); |
| 107 |
addedCardinalites->setCardinalityUpdateId(mCurrentUpdateId); |
| 108 |
COptimizedComplexVariableIndividualUpdateCardinalityLinker* updateCardLinker = new COptimizedComplexVariableIndividualUpdateCardinalityLinker(hashedLinker, prevCardinalities); |
| 109 |
addLastUpdatedCardinalityLinker(updateCardLinker); |
| 110 |
return true; |
| 111 |
} |
| 112 |
} |
| 113 |
return false; |
| 114 |
} |
| 115 |
|
| 116 |
|
| 117 |
|
| 118 |
COptimizedComplexVariableIndividualBindingsCardinalityLinker* COptimizedComplexVariableIndividualMappingsHash::takeBindingsCardinalityLinker() { |
| 119 |
COptimizedComplexVariableIndividualBindingsCardinalityLinker* linker = mLastAddedBindingsCardinalityLinker; |
| 120 |
if (mLastAddedBindingsCardinalityLinker) { |
| 121 |
mLastAddedBindingsCardinalityLinker = mLastAddedBindingsCardinalityLinker->getNext(); |
| 122 |
} |
| 123 |
if (linker) { |
| 124 |
mMappingCardinalityHash->remove(linker); |
| 125 |
mBindingCount = mMappingCardinalityHash->size(); |
| 126 |
linker->clearNext(); |
| 127 |
} |
| 128 |
return linker; |
| 129 |
} |
| 130 |
|
| 131 |
|
| 132 |
|
| 133 |
COptimizedComplexVariableIndividualMappings* COptimizedComplexVariableIndividualMappingsHash::clearComputedMappings() { |
| 134 |
|
| 135 |
|
| 136 |
CMemoryPool* memPools = mContext->getMemoryPools(); |
| 137 |
CMemoryPool* memPoolsIt = memPools; |
| 138 |
while (memPoolsIt) { |
| 139 |
CMemoryPool* tmpMemPool = memPoolsIt; |
| 140 |
memPoolsIt = memPoolsIt->getNext(); |
| 141 |
delete[] tmpMemPool->getMemoryBlockData(); |
| 142 |
delete tmpMemPool; |
| 143 |
} |
| 144 |
delete mContext; |
| 145 |
mContext = new CMemoryPoolNewAllocationIncreasingContext(500, 500000, 2); |
| 146 |
mMappingCardinalityHash = CObjectParameterizingAllocator< CQtManagedRestrictedModificationHash<COptimizedComplexVariableIndividualBindingsHasher, COptimizedComplexVariableIndividualBindingsCardinalityLinker*>, CContext* >::allocateAndConstructAndParameterize(mContext->getMemoryAllocationManager(), mContext); |
| 147 |
|
| 148 |
//COptimizedComplexVariableIndividualUpdateCardinalityLinker* updateCardinalityLinkerIt = mLastUpdateCardinalityLinker; |
| 149 |
//while (updateCardinalityLinkerIt) { |
| 150 |
// COptimizedComplexVariableIndividualUpdateCardinalityLinker* tmpUpdateCardinalityLinkerIt = updateCardinalityLinkerIt; |
| 151 |
// updateCardinalityLinkerIt = updateCardinalityLinkerIt->getNext(); |
| 152 |
// delete tmpUpdateCardinalityLinkerIt->getNewCardinality(); |
| 153 |
// delete tmpUpdateCardinalityLinkerIt; |
| 154 |
//} |
| 155 |
|
| 156 |
//COptimizedComplexVariableIndividualBindingsCardinalityLinker* addedBindingsCardinalityLinkerIt = mLastAddedBindingsCardinalityLinker; |
| 157 |
//while (addedBindingsCardinalityLinkerIt) { |
| 158 |
// COptimizedComplexVariableIndividualBindingsCardinalityLinker* tmpAaddedBindingsCardinalityLinker = addedBindingsCardinalityLinkerIt; |
| 159 |
// addedBindingsCardinalityLinkerIt = addedBindingsCardinalityLinkerIt->getNext(); |
| 160 |
// delete tmpAaddedBindingsCardinalityLinker->getBindings(); |
| 161 |
// COptimizedComplexVariableIndividualBindingsCardinality* initCard = tmpAaddedBindingsCardinalityLinker->getInitialCardinalities(); |
| 162 |
// if (initCard) { |
| 163 |
// delete initCard; |
| 164 |
// } |
| 165 |
// delete tmpAaddedBindingsCardinalityLinker; |
| 166 |
//} |
| 167 |
//mMappingCardinalityHash->clear(); |
| 168 |
return COptimizedComplexVariableIndividualMappings::clearComputedMappings(); |
| 169 |
} |
| 170 |
|
| 171 |
|
| 172 |
|
| 173 |
CMemoryAllocationManager* COptimizedComplexVariableIndividualMappingsHash::getBindingsMemoryAllocationManager() { |
| 174 |
return mContext->getMemoryAllocationManager(); |
| 175 |
} |
| 176 |
|
| 177 |
|
| 178 |
COptimizedComplexVariableIndividualMappings* COptimizedComplexVariableIndividualMappingsHash::updateBindingsMemoryConsumption() { |
| 179 |
mBindingsMemoryUsage = mContext->getMemorySize(); |
| 180 |
return this; |
| 181 |
} |
| 182 |
|
| 183 |
|
| 184 |
|
| 185 |
}; // end namespace Answerer |
| 186 |
|
| 187 |
}; // end namespace Reasoner |
| 188 |
|
| 189 |
}; // end namespace Konclude |