| 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 "COptimizedComplexVariableJoiningItem.h" |
| 22 |
|
| 23 |
|
| 24 |
namespace Konclude { |
| 25 |
|
| 26 |
namespace Reasoner { |
| 27 |
|
| 28 |
namespace Answerer { |
| 29 |
|
| 30 |
|
| 31 |
COptimizedComplexVariableJoiningItem::COptimizedComplexVariableJoiningItem(COptimizedComplexVariableCompositionItem* itemLeft, COptimizedComplexVariableCompositionItem* itemRight, const COptimizedComplexVariableJoiningBindingPositionMapping& positionMapping) : mPositionMapping(positionMapping), mLeftItemDep(itemLeft), mRightItemDep(itemRight) { |
| 32 |
mItemLeft = itemLeft; |
| 33 |
mItemRight = itemRight; |
| 34 |
mComputationDependentItemList.append(mItemLeft); |
| 35 |
mComputationDependentItemList.append(mItemRight); |
| 36 |
mItemLeft->addComputationSuccessorItem(this); |
| 37 |
mItemRight->addComputationSuccessorItem(this); |
| 38 |
mComputationItemDepth = qMax(mItemLeft->getComputationItemDepth(), mItemRight->getComputationItemDepth()) + 1; |
| 39 |
|
| 40 |
mJoiningHash = nullptr; |
| 41 |
|
| 42 |
mLeftSampleKeyCount = 0; |
| 43 |
mRightSampleKeyCount = 0; |
| 44 |
mLeftSampleInsertionCount = 0; |
| 45 |
mRightSampleInsertionCount = 0; |
| 46 |
|
| 47 |
mSamplingCompleted = false; |
| 48 |
|
| 49 |
mLeftSplitPosition = 0; |
| 50 |
mRightSplitPosition = 0; |
| 51 |
mLeftSplitCount = 0; |
| 52 |
mRightSplitCount = 0; |
| 53 |
|
| 54 |
|
| 55 |
mInsertionSideDecided = false; |
| 56 |
mInsertionSideLeft = false; |
| 57 |
} |
| 58 |
|
| 59 |
|
| 60 |
COptimizedComplexVariableJoiningItem::~COptimizedComplexVariableJoiningItem() { |
| 61 |
} |
| 62 |
|
| 63 |
COptimizedComplexVariableJoiningItem::COMPOSITION_TYPE COptimizedComplexVariableJoiningItem::getCompositionType() { |
| 64 |
return JOINING; |
| 65 |
} |
| 66 |
|
| 67 |
|
| 68 |
COptimizedComplexVariableCompositionItem* COptimizedComplexVariableJoiningItem::getLeftItem() { |
| 69 |
return mItemLeft; |
| 70 |
} |
| 71 |
|
| 72 |
COptimizedComplexVariableCompositionItem* COptimizedComplexVariableJoiningItem::getRightItem() { |
| 73 |
return mItemRight; |
| 74 |
} |
| 75 |
|
| 76 |
COptimizedComplexVariableCompositionItemDependence* COptimizedComplexVariableJoiningItem::getLeftItemDependence() { |
| 77 |
return &mLeftItemDep; |
| 78 |
} |
| 79 |
|
| 80 |
COptimizedComplexVariableCompositionItemDependence* COptimizedComplexVariableJoiningItem::getRightItemDependence() { |
| 81 |
return &mRightItemDep; |
| 82 |
} |
| 83 |
|
| 84 |
COptimizedComplexVariableJoiningBindingPositionMapping* COptimizedComplexVariableJoiningItem::getPositionMapping() { |
| 85 |
return &mPositionMapping; |
| 86 |
} |
| 87 |
|
| 88 |
QVector<COptimizedComplexVariableJoiningHashMemoryManaged*>& COptimizedComplexVariableJoiningItem::getJoiningHashVector() { |
| 89 |
return mJoiningHashVector; |
| 90 |
} |
| 91 |
|
| 92 |
|
| 93 |
COptimizedComplexVariableJoiningHash*& COptimizedComplexVariableJoiningItem::getJoiningHash() { |
| 94 |
return mJoiningHash; |
| 95 |
} |
| 96 |
|
| 97 |
|
| 98 |
COptimizedComplexVariableJoiningItem* COptimizedComplexVariableJoiningItem::resetJoiningHash() { |
| 99 |
if (mJoiningHash) { |
| 100 |
delete mJoiningHash; |
| 101 |
} |
| 102 |
mJoiningHash = nullptr; |
| 103 |
|
| 104 |
for (cint64 i = 0; i < mJoiningHashVector.size(); ++i) { |
| 105 |
COptimizedComplexVariableJoiningHashMemoryManaged*& hash = mJoiningHashVector[i]; |
| 106 |
if (hash) { |
| 107 |
CMemoryPool* memPoolIt = hash->getMemoryPools(); |
| 108 |
while (memPoolIt) { |
| 109 |
CMemoryPool* tmpMemPool = memPoolIt; |
| 110 |
memPoolIt = memPoolIt->getNext(); |
| 111 |
delete[] tmpMemPool->getMemoryBlockData(); |
| 112 |
delete tmpMemPool; |
| 113 |
} |
| 114 |
hash = nullptr; |
| 115 |
} |
| 116 |
} |
| 117 |
|
| 118 |
return this; |
| 119 |
} |
| 120 |
|
| 121 |
|
| 122 |
cint64& COptimizedComplexVariableJoiningItem::getLeftSampleKeyCount() { |
| 123 |
return mLeftSampleKeyCount; |
| 124 |
} |
| 125 |
|
| 126 |
cint64& COptimizedComplexVariableJoiningItem::getRightSampleKeyCount() { |
| 127 |
return mRightSampleKeyCount; |
| 128 |
} |
| 129 |
|
| 130 |
cint64& COptimizedComplexVariableJoiningItem::getLeftSampleInsertionCount() { |
| 131 |
return mLeftSampleInsertionCount; |
| 132 |
} |
| 133 |
|
| 134 |
cint64& COptimizedComplexVariableJoiningItem::getRightSampleInsertionCount() { |
| 135 |
return mRightSampleInsertionCount; |
| 136 |
} |
| 137 |
|
| 138 |
bool COptimizedComplexVariableJoiningItem::isSamplingCompleted() { |
| 139 |
return mSamplingCompleted; |
| 140 |
} |
| 141 |
|
| 142 |
COptimizedComplexVariableJoiningItem* COptimizedComplexVariableJoiningItem::setSamplingCompleted(bool completed) { |
| 143 |
mSamplingCompleted = completed; |
| 144 |
return this; |
| 145 |
} |
| 146 |
|
| 147 |
|
| 148 |
bool COptimizedComplexVariableJoiningItem::isInsertionSideDecided() { |
| 149 |
return mInsertionSideDecided; |
| 150 |
} |
| 151 |
|
| 152 |
bool COptimizedComplexVariableJoiningItem::isInsertionSideLeft() { |
| 153 |
return mInsertionSideLeft; |
| 154 |
} |
| 155 |
|
| 156 |
COptimizedComplexVariableJoiningItem* COptimizedComplexVariableJoiningItem::setInsertionSideDecided(bool decided) { |
| 157 |
mInsertionSideDecided = decided; |
| 158 |
return this; |
| 159 |
} |
| 160 |
|
| 161 |
COptimizedComplexVariableJoiningItem* COptimizedComplexVariableJoiningItem::setInsertionSideLeft(bool left) { |
| 162 |
mInsertionSideLeft = left; |
| 163 |
return this; |
| 164 |
} |
| 165 |
|
| 166 |
COptimizedComplexVariableJoiningItem* COptimizedComplexVariableJoiningItem::resetSampling() { |
| 167 |
mLeftSampleKeyCount = 0; |
| 168 |
mRightSampleKeyCount = 0; |
| 169 |
mLeftSampleInsertionCount = 0; |
| 170 |
mRightSampleInsertionCount = 0; |
| 171 |
return this; |
| 172 |
} |
| 173 |
|
| 174 |
|
| 175 |
COptimizedComplexVariableJoiningItem* COptimizedComplexVariableJoiningItem::createSplitComputationItem() { |
| 176 |
if (!mSplitItem) { |
| 177 |
COptimizedComplexVariableJoiningItem* splitItem = new COptimizedComplexVariableJoiningItem(mItemLeft, mItemRight, mPositionMapping); |
| 178 |
splitItem->mSamplingCompleted = true; |
| 179 |
splitItem->mInsertionSideDecided = true; |
| 180 |
splitItem->mInsertionSideLeft = mInsertionSideLeft; |
| 181 |
mSplitItem = splitItem; |
| 182 |
return splitItem; |
| 183 |
} else { |
| 184 |
return (COptimizedComplexVariableJoiningItem*)mSplitItem; |
| 185 |
} |
| 186 |
} |
| 187 |
|
| 188 |
|
| 189 |
cint64& COptimizedComplexVariableJoiningItem::getLeftSplitPosition() { |
| 190 |
return mLeftSplitPosition; |
| 191 |
} |
| 192 |
|
| 193 |
cint64& COptimizedComplexVariableJoiningItem::getRightSplitPosition() { |
| 194 |
return mRightSplitPosition; |
| 195 |
} |
| 196 |
|
| 197 |
|
| 198 |
cint64& COptimizedComplexVariableJoiningItem::getLeftSplitCount() { |
| 199 |
return mLeftSplitCount; |
| 200 |
} |
| 201 |
|
| 202 |
cint64& COptimizedComplexVariableJoiningItem::getRightSplitCount() { |
| 203 |
return mRightSplitCount; |
| 204 |
} |
| 205 |
|
| 206 |
bool COptimizedComplexVariableJoiningItem::clearComputation() { |
| 207 |
COptimizedComplexVariableCompositionItem::clearComputation(); |
| 208 |
resetJoiningHash(); |
| 209 |
mRightItemDep.reset(); |
| 210 |
mLeftItemDep.reset(); |
| 211 |
return true; |
| 212 |
} |
| 213 |
|
| 214 |
}; // end namespace Answerer |
| 215 |
|
| 216 |
}; // end namespace Reasoner |
| 217 |
|
| 218 |
}; // end namespace Konclude |