| 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 |
#ifndef KONCLUDE_REASONER_REALIZER_COPTIMIZEDREPRESENTATIVEKPSETCACHELABELITEMITERATOR_H |
| 22 |
#define KONCLUDE_REASONER_REALIZER_COPTIMIZEDREPRESENTATIVEKPSETCACHELABELITEMITERATOR_H |
| 23 |
|
| 24 |
// Libraries includes |
| 25 |
|
| 26 |
|
| 27 |
// Namespace includes |
| 28 |
#include "RealizerSettings.h" |
| 29 |
#include "COptimizedKPSetConceptInstancesItem.h" |
| 30 |
#include "COptimizedRepresentativeKPSetConceptSetCacheLabelItemInstancesData.h" |
| 31 |
#include "COptimizedKPSetIndividualInstantiatedItemMultiHash.h" |
| 32 |
|
| 33 |
|
| 34 |
// Other includes |
| 35 |
#include "Reasoner/Kernel/Cache/CBackendRepresentativeMemoryLabelCacheItemIndividualAssociationMapIterator.h" |
| 36 |
#include "Reasoner/Kernel/Cache/CBackendRepresentativeMemoryLabelCacheItemIndividualAssociationMapExtensionData.h" |
| 37 |
|
| 38 |
#include "Reasoner/Realization/CRealizationIndividualSorting.h" |
| 39 |
#include "Reasoner/Realization/CRealizationIndividualInstanceItemReference.h" |
| 40 |
#include "Reasoner/Realization/CRealizationIndividualInstanceItemReferenceIterator.h" |
| 41 |
|
| 42 |
// Logger includes |
| 43 |
#include "Logger/CLogger.h" |
| 44 |
|
| 45 |
|
| 46 |
namespace Konclude { |
| 47 |
|
| 48 |
namespace Reasoner { |
| 49 |
|
| 50 |
using namespace Kernel::Cache; |
| 51 |
using namespace Realization; |
| 52 |
|
| 53 |
namespace Realizer { |
| 54 |
|
| 55 |
|
| 56 |
/*! |
| 57 |
* |
| 58 |
* \class COptimizedRepresentativeKPSetCacheLabelItemIterator |
| 59 |
* \author Andreas Steigmiller |
| 60 |
* \version 0.1 |
| 61 |
* \brief TODO |
| 62 |
* |
| 63 |
*/ |
| 64 |
class COptimizedRepresentativeKPSetCacheLabelItemIterator : public CRealizationIndividualInstanceItemReferenceIterator { |
| 65 |
// public methods |
| 66 |
public: |
| 67 |
//! Constructor |
| 68 |
COptimizedRepresentativeKPSetCacheLabelItemIterator(const QList<CBackendRepresentativeMemoryLabelCacheItem*>& labelCacheItemKnownInstancesList, const QList<CBackendRepresentativeMemoryLabelCacheItem*>& labelCacheItemPossibleInstancesList, COptimizedKPSetIndividualInstantiatedItemMultiHash* individualInstantiatedItemHash, CIndividualVector* individualVector, const CRealizationIndividualSorting& sorting, const CRealizationIndividualInstanceItemReference& indiInstItemRefCursor, bool moveOverCursor = true); |
| 69 |
virtual ~COptimizedRepresentativeKPSetCacheLabelItemIterator(); |
| 70 |
|
| 71 |
|
| 72 |
virtual bool requiresInitialization(); |
| 73 |
virtual bool begin(); |
| 74 |
|
| 75 |
|
| 76 |
|
| 77 |
bool atEnd(); |
| 78 |
virtual CRealizationRemainingInstancesEstimation remainingInstancesEstimation(); |
| 79 |
|
| 80 |
bool moveNext(); |
| 81 |
virtual bool moveTo(const CRealizationIndividualInstanceItemReference& indiInstItemRef, bool moveOver = true); |
| 82 |
|
| 83 |
CRealizationIndividualInstanceItemReference currentIndividualInstanceItemReference(); |
| 84 |
virtual bool isCurrentInstancePossible(); |
| 85 |
virtual bool isCurrentInstanceCertain(); |
| 86 |
|
| 87 |
virtual CRealizationIndividualInstanceItemReferenceIterator* getCopy(); |
| 88 |
|
| 89 |
|
| 90 |
virtual CRealizationIndividualSorting getSorting(); |
| 91 |
|
| 92 |
|
| 93 |
QList<CBackendRepresentativeMemoryLabelCacheItem*>* getKnownInstancesLabelCacheItemList(); |
| 94 |
QList<CBackendRepresentativeMemoryLabelCacheItem*>* getPossibleInstancesLabelCacheItemList(); |
| 95 |
|
| 96 |
CRealizationIndividualInstanceItemReference getIndividualInstanceItemReferenceCursor(); |
| 97 |
bool hasMoveOverCursor(); |
| 98 |
|
| 99 |
|
| 100 |
class CAssociationMapIteratorData { |
| 101 |
public: |
| 102 |
CAssociationMapIteratorData(CBackendRepresentativeMemoryLabelCacheItem* labelItem, const CBackendRepresentativeMemoryLabelCacheItemIndividualAssociationMapIterator& iterator, bool possibleInstances) { |
| 103 |
mIterator = iterator; |
| 104 |
mPossibleInstances = possibleInstances; |
| 105 |
mCurrentIndiRealizationItem = nullptr; |
| 106 |
mLabelItem = labelItem; |
| 107 |
mCurrentInstanceOnlyPossible = false; |
| 108 |
mIndividual = nullptr; |
| 109 |
mAdditionalData = nullptr; |
| 110 |
mInitializationRequired = false; |
| 111 |
mLastCheckedInitializationRequiredId = -1; |
| 112 |
} |
| 113 |
|
| 114 |
CBackendRepresentativeMemoryLabelCacheItemIndividualAssociationMapIterator mIterator; |
| 115 |
CBackendRepresentativeMemoryLabelCacheItem* mLabelItem; |
| 116 |
bool mPossibleInstances; |
| 117 |
|
| 118 |
CIndividual* mIndividual; |
| 119 |
COptimizedKPSetIndividualItem* mCurrentIndiRealizationItem; |
| 120 |
bool mCurrentInstanceOnlyPossible; |
| 121 |
void* mAdditionalData; |
| 122 |
|
| 123 |
bool mInitializationRequired; |
| 124 |
cint64 mLastCheckedInitializationRequiredId; |
| 125 |
|
| 126 |
}; |
| 127 |
|
| 128 |
class CAssociationMapIteratorKey { |
| 129 |
public: |
| 130 |
CAssociationMapIteratorKey(CAssociationMapIteratorData* iterationData) { |
| 131 |
mPossibleInstance = iterationData->mPossibleInstances; |
| 132 |
mIndiId = iterationData->mIterator.currentAssociatedIndividualId(); |
| 133 |
} |
| 134 |
CAssociationMapIteratorKey(cint64 indiId, bool possibleInstance) { |
| 135 |
mPossibleInstance = possibleInstance; |
| 136 |
mIndiId = indiId; |
| 137 |
} |
| 138 |
|
| 139 |
cint64 mIndiId; |
| 140 |
cint64 mPossibleInstance; |
| 141 |
}; |
| 142 |
|
| 143 |
// protected methods |
| 144 |
protected: |
| 145 |
|
| 146 |
|
| 147 |
|
| 148 |
virtual CRealizationIndividualInstanceItemReferenceIterator* init(); |
| 149 |
|
| 150 |
|
| 151 |
virtual CRealizationIndividualInstanceItemReferenceIterator* initCopy(CRealizationIndividualInstanceItemReferenceIterator* iterator); |
| 152 |
|
| 153 |
|
| 154 |
virtual void clearInstanceIndividualAssociationsIteratorData(CAssociationMapIteratorData* associationIteratorData); |
| 155 |
virtual bool loadInstanceIndividualAssociationsIteratorData(CAssociationMapIteratorData* associationIteratorData); |
| 156 |
|
| 157 |
|
| 158 |
CAssociationMapIteratorData* createIndividualAssociationsIteratorData(CBackendRepresentativeMemoryLabelCacheItem* labelItem, bool possibleInstances, const CRealizationIndividualInstanceItemReference& indiInstItemRefCursor, bool moveOverCursor); |
| 159 |
CAssociationMapIteratorData* updateIndividualAssociationsIteratorData(CAssociationMapIteratorData* associationIteratorData, const CRealizationIndividualInstanceItemReference& indiInstItemRefCursor, bool moveOverCursor); |
| 160 |
bool moveToValidPosition(CAssociationMapIteratorData* iteratorData); |
| 161 |
CAssociationMapIteratorData* getNextIteratorDataFromMap(); |
| 162 |
|
| 163 |
|
| 164 |
virtual bool isValidIteratorPosition(CAssociationMapIteratorData* iteratorData, cint64 indiId); |
| 165 |
cint64 getDifference(cint64 number1, cint64 number2); |
| 166 |
|
| 167 |
|
| 168 |
|
| 169 |
virtual CAssociationMapIteratorData* createAssociationMapIteratorData(CBackendRepresentativeMemoryLabelCacheItem* labelItem, const CBackendRepresentativeMemoryLabelCacheItemIndividualAssociationMapIterator& iterator, bool possibleInstances); |
| 170 |
|
| 171 |
|
| 172 |
// protected variables |
| 173 |
protected: |
| 174 |
QList<CBackendRepresentativeMemoryLabelCacheItem*> mLabelCacheItemKnwonInstancesList; |
| 175 |
QList<CBackendRepresentativeMemoryLabelCacheItem*> mLabelCacheItemPossibleInstancesList; |
| 176 |
COptimizedKPSetIndividualInstantiatedItemMultiHash* mIndividualInstantiatedItemHash; |
| 177 |
|
| 178 |
QList<CAssociationMapIteratorData*> mUninitializedList; |
| 179 |
|
| 180 |
|
| 181 |
CIndividualVector* mIndividualVector; |
| 182 |
|
| 183 |
bool mPreventSameIndisMultipleOccurences; |
| 184 |
cint64 mLastIndiId; |
| 185 |
|
| 186 |
bool mInitializationRequired; |
| 187 |
|
| 188 |
bool mIterateAscending; |
| 189 |
bool mConsiderSameMergedIndis; |
| 190 |
bool mAllowPossibleInstances; |
| 191 |
CRealizationIndividualSorting mSorting; |
| 192 |
bool mMoveOverCursor; |
| 193 |
CRealizationIndividualInstanceItemReference mIndiInstItemRefCursor; |
| 194 |
|
| 195 |
CAssociationMapIteratorData* mCurrentIteratorData; |
| 196 |
|
| 197 |
QList<CAssociationMapIteratorData*> mIteratorDataContainer; |
| 198 |
QMap<CAssociationMapIteratorKey, CAssociationMapIteratorData*> mCurrentIndiIdIterationDataMap; |
| 199 |
|
| 200 |
cint64 mFirstIteratorIndiId; |
| 201 |
double mAverageIterationIncrementSize; |
| 202 |
cint64 mIterationCount; |
| 203 |
cint64 mAssociatedIndiPossibleCount; |
| 204 |
cint64 mAssociatedIndiTotalCount; |
| 205 |
|
| 206 |
cint64 mAssociatedIndiPossibleVisistedCount; |
| 207 |
cint64 mAssociatedIndiPossibleConfirmedCount; |
| 208 |
|
| 209 |
|
| 210 |
|
| 211 |
cint64 mCheckingInitializationRequiredId = 1; |
| 212 |
|
| 213 |
|
| 214 |
static const cint64 MAX_ITERATION_WITHOUT_MOVE_PER_LABEL = 10; |
| 215 |
|
| 216 |
// private methods |
| 217 |
private: |
| 218 |
|
| 219 |
// private variables |
| 220 |
private: |
| 221 |
|
| 222 |
}; |
| 223 |
|
| 224 |
|
| 225 |
|
| 226 |
|
| 227 |
}; // end namespace Realizer |
| 228 |
|
| 229 |
}; // end namespace Reasoner |
| 230 |
|
| 231 |
}; // end namespace Konclude |
| 232 |
|
| 233 |
#endif // KONCLUDE_REASONER_REALIZER_COPTIMIZEDREPRESENTATIVEKPSETCACHELABELITEMITERATOR_H |