| 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 "CBackendRepresentativeMemoryLabelCacheItemIndividualAssociationMapIterator.h" |
| 22 |
|
| 23 |
|
| 24 |
namespace Konclude { |
| 25 |
|
| 26 |
namespace Reasoner { |
| 27 |
|
| 28 |
namespace Kernel { |
| 29 |
|
| 30 |
namespace Cache { |
| 31 |
|
| 32 |
CBackendRepresentativeMemoryLabelCacheItemIndividualAssociationMapIterator::CBackendRepresentativeMemoryLabelCacheItemIndividualAssociationMapIterator() { |
| 33 |
mHasCurrentIndiId = false; |
| 34 |
} |
| 35 |
|
| 36 |
CBackendRepresentativeMemoryLabelCacheItemIndividualAssociationMapIterator::CBackendRepresentativeMemoryLabelCacheItemIndividualAssociationMapIterator(QMap<cint64, DummyValue>::const_iterator baseIndiAssoMapItBegin, QMap<cint64, DummyValue>::const_iterator baseIndiAssoMapItEnd, |
| 37 |
QMap<cint64, DummyValue>::const_iterator sameIndiMergedAssoMapItBegin, QMap<cint64, DummyValue>::const_iterator sameIndiMergedAssoMapItEnd, bool iterateAscending) { |
| 38 |
|
| 39 |
mBaseIndiAssoMapItBegin = baseIndiAssoMapItBegin; |
| 40 |
mBaseIndiAssoMapItEnd = baseIndiAssoMapItEnd; |
| 41 |
|
| 42 |
mSameIndiMergedAssoMapItBegin = sameIndiMergedAssoMapItBegin; |
| 43 |
mSameIndiMergedAssoMapItEnd = sameIndiMergedAssoMapItEnd; |
| 44 |
|
| 45 |
mIterateAscending = iterateAscending; |
| 46 |
|
| 47 |
if (mIterateAscending) { |
| 48 |
mBaseIndiAssoMapIt = baseIndiAssoMapItBegin; |
| 49 |
mSameIndiMergedAssoMapIt = mSameIndiMergedAssoMapItBegin; |
| 50 |
} else { |
| 51 |
mBaseIndiAssoMapIt = mBaseIndiAssoMapItEnd; |
| 52 |
if (mBaseIndiAssoMapItBegin != mBaseIndiAssoMapItEnd) { |
| 53 |
--mBaseIndiAssoMapIt; |
| 54 |
} |
| 55 |
mSameIndiMergedAssoMapIt = mSameIndiMergedAssoMapItEnd; |
| 56 |
if (mSameIndiMergedAssoMapItBegin != mBaseIndiAssoMapItEnd) { |
| 57 |
--mSameIndiMergedAssoMapIt; |
| 58 |
} |
| 59 |
} |
| 60 |
|
| 61 |
|
| 62 |
mHasCurrentIndiId = false; |
| 63 |
mCurrentIndiSameMerged = false; |
| 64 |
moveNext(); |
| 65 |
} |
| 66 |
|
| 67 |
cint64 CBackendRepresentativeMemoryLabelCacheItemIndividualAssociationMapIterator::currentAssociatedIndividualId() { |
| 68 |
return mCurrentIndiId; |
| 69 |
} |
| 70 |
|
| 71 |
bool CBackendRepresentativeMemoryLabelCacheItemIndividualAssociationMapIterator::currentAssociatedIndividualSameMerged() { |
| 72 |
return mCurrentIndiSameMerged; |
| 73 |
} |
| 74 |
|
| 75 |
|
| 76 |
CBackendRepresentativeMemoryLabelCacheItemIndividualAssociationMapIterator* CBackendRepresentativeMemoryLabelCacheItemIndividualAssociationMapIterator::moveNext() { |
| 77 |
mCurrentIndiId = -1; |
| 78 |
mHasCurrentIndiId = false; |
| 79 |
mCurrentIndiSameMerged = false; |
| 80 |
|
| 81 |
if (mIterateAscending) { |
| 82 |
if (mBaseIndiAssoMapIt != mBaseIndiAssoMapItEnd && mSameIndiMergedAssoMapIt != mSameIndiMergedAssoMapItEnd) { |
| 83 |
if (mBaseIndiAssoMapIt.key() < mSameIndiMergedAssoMapIt.key()) { |
| 84 |
mCurrentIndiId = mBaseIndiAssoMapIt.key(); |
| 85 |
++mBaseIndiAssoMapIt; |
| 86 |
mHasCurrentIndiId = true; |
| 87 |
} else { |
| 88 |
mCurrentIndiId = mSameIndiMergedAssoMapIt.key(); |
| 89 |
++mSameIndiMergedAssoMapIt; |
| 90 |
mHasCurrentIndiId = true; |
| 91 |
mCurrentIndiSameMerged = true; |
| 92 |
} |
| 93 |
|
| 94 |
} else if (mBaseIndiAssoMapIt != mBaseIndiAssoMapItEnd) { |
| 95 |
mCurrentIndiId = mBaseIndiAssoMapIt.key(); |
| 96 |
++mBaseIndiAssoMapIt; |
| 97 |
mHasCurrentIndiId = true; |
| 98 |
} else if (mSameIndiMergedAssoMapIt != mSameIndiMergedAssoMapItEnd) { |
| 99 |
mCurrentIndiId = mSameIndiMergedAssoMapIt.key(); |
| 100 |
++mSameIndiMergedAssoMapIt; |
| 101 |
mHasCurrentIndiId = true; |
| 102 |
mCurrentIndiSameMerged = true; |
| 103 |
} |
| 104 |
} else { |
| 105 |
if (mBaseIndiAssoMapIt != mBaseIndiAssoMapItEnd && mSameIndiMergedAssoMapIt != mSameIndiMergedAssoMapItEnd) { |
| 106 |
if (mBaseIndiAssoMapIt.key() > mSameIndiMergedAssoMapIt.key()) { |
| 107 |
mCurrentIndiId = mBaseIndiAssoMapIt.key(); |
| 108 |
if (mBaseIndiAssoMapIt == mBaseIndiAssoMapItBegin) { |
| 109 |
mBaseIndiAssoMapIt = mBaseIndiAssoMapItEnd; |
| 110 |
} else { |
| 111 |
--mBaseIndiAssoMapIt; |
| 112 |
} |
| 113 |
mHasCurrentIndiId = true; |
| 114 |
} else { |
| 115 |
mCurrentIndiId = mSameIndiMergedAssoMapIt.key(); |
| 116 |
if (mSameIndiMergedAssoMapIt == mSameIndiMergedAssoMapItBegin) { |
| 117 |
mSameIndiMergedAssoMapIt = mSameIndiMergedAssoMapItEnd; |
| 118 |
} else { |
| 119 |
--mSameIndiMergedAssoMapIt; |
| 120 |
} |
| 121 |
mHasCurrentIndiId = true; |
| 122 |
mCurrentIndiSameMerged = true; |
| 123 |
} |
| 124 |
} else if (mBaseIndiAssoMapIt != mBaseIndiAssoMapItEnd) { |
| 125 |
mCurrentIndiId = mBaseIndiAssoMapIt.key(); |
| 126 |
if (mBaseIndiAssoMapIt == mBaseIndiAssoMapItBegin) { |
| 127 |
mBaseIndiAssoMapIt = mBaseIndiAssoMapItEnd; |
| 128 |
} else { |
| 129 |
--mBaseIndiAssoMapIt; |
| 130 |
} |
| 131 |
mHasCurrentIndiId = true; |
| 132 |
} else if (mSameIndiMergedAssoMapIt != mSameIndiMergedAssoMapItEnd) { |
| 133 |
mCurrentIndiId = mSameIndiMergedAssoMapIt.key(); |
| 134 |
if (mSameIndiMergedAssoMapIt == mSameIndiMergedAssoMapItBegin) { |
| 135 |
mSameIndiMergedAssoMapIt = mSameIndiMergedAssoMapItEnd; |
| 136 |
} else { |
| 137 |
--mSameIndiMergedAssoMapIt; |
| 138 |
} |
| 139 |
mHasCurrentIndiId = true; |
| 140 |
mCurrentIndiSameMerged = true; |
| 141 |
} |
| 142 |
} |
| 143 |
return this; |
| 144 |
} |
| 145 |
|
| 146 |
bool CBackendRepresentativeMemoryLabelCacheItemIndividualAssociationMapIterator::atEnd() { |
| 147 |
return !mHasCurrentIndiId; |
| 148 |
} |
| 149 |
|
| 150 |
|
| 151 |
|
| 152 |
|
| 153 |
}; // end namespace Cache |
| 154 |
|
| 155 |
}; // end namespace Kernel |
| 156 |
|
| 157 |
}; // end namespace Reasoner |
| 158 |
|
| 159 |
}; // end namespace Konclude |