| 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_COPTIMIZEDKPSETCONCEPTINSTANCESITEM_H |
| 22 |
#define KONCLUDE_REASONER_REALIZER_COPTIMIZEDKPSETCONCEPTINSTANCESITEM_H |
| 23 |
|
| 24 |
// Libraries includes |
| 25 |
|
| 26 |
|
| 27 |
// Namespace includes |
| 28 |
#include "RealizerSettings.h" |
| 29 |
#include "COptimizedKPSetIndividualItem.h" |
| 30 |
#include "COntologyRealizingDynamicRequirmentProcessingContainer.h" |
| 31 |
#include "CPossibleInstancesIndividualsMergingData.h" |
| 32 |
|
| 33 |
|
| 34 |
// Other includes |
| 35 |
#include "Reasoner/Taxonomy/CHierarchyNode.h" |
| 36 |
|
| 37 |
#include "Reasoner/Realization/CConceptInstantiatedItem.h" |
| 38 |
|
| 39 |
#include "Reasoner/Kernel/Cache/CBackendRepresentativeMemoryLabelCacheItem.h" |
| 40 |
|
| 41 |
// Logger includes |
| 42 |
#include "Logger/CLogger.h" |
| 43 |
|
| 44 |
|
| 45 |
namespace Konclude { |
| 46 |
|
| 47 |
namespace Reasoner { |
| 48 |
|
| 49 |
using namespace Taxonomy; |
| 50 |
using namespace Realization; |
| 51 |
using namespace Kernel::Cache; |
| 52 |
|
| 53 |
namespace Realizer { |
| 54 |
|
| 55 |
|
| 56 |
/*! |
| 57 |
* |
| 58 |
* \class COptimizedKPSetConceptInstancesItem |
| 59 |
* \author Andreas Steigmiller |
| 60 |
* \version 0.1 |
| 61 |
* \brief TODO |
| 62 |
* |
| 63 |
*/ |
| 64 |
class COptimizedKPSetConceptInstancesItem : public CConceptInstantiatedItem, public COntologyRealizingDynamicRequirmentProcessingContainer { |
| 65 |
// public methods |
| 66 |
public: |
| 67 |
//! Constructor |
| 68 |
COptimizedKPSetConceptInstancesItem(); |
| 69 |
|
| 70 |
COptimizedKPSetConceptInstancesItem* initInstancesItem(CHierarchyNode* hierNode); |
| 71 |
|
| 72 |
|
| 73 |
COptimizedKPSetConceptInstancesItem* prepareConcurrentInitialization(cint64 size); |
| 74 |
cint64 finishConcurrentInitialization(cint64 size); |
| 75 |
COptimizedKPSetConceptInstancesItem* addKnownInstanceConcurrently(COptimizedKPSetIndividualItem* item, cint64 indiVecPos); |
| 76 |
COptimizedKPSetConceptInstancesItem* addPossibleInstanceConcurrently(COptimizedKPSetIndividualItem* item, cint64 indiVecPos); |
| 77 |
|
| 78 |
|
| 79 |
COptimizedKPSetConceptInstancesItem* setInitialUnprocessedSuccessorItemCount(); |
| 80 |
|
| 81 |
CHierarchyNode* getHierarchyNode(); |
| 82 |
COptimizedKPSetConceptInstancesItem* setHierarchyNode(CHierarchyNode* hierNode); |
| 83 |
|
| 84 |
QMap<cint64, COptimizedKPSetIndividualItem*>* getKnownInstancesMap(); |
| 85 |
QMap<cint64, COptimizedKPSetIndividualItem*>* getPossibleInstancesMap(); |
| 86 |
QHash<cint64, CRealizingTestingItem*>* getPossibleInstanceTestingItemHash(); |
| 87 |
|
| 88 |
QList<COptimizedKPSetConceptInstancesItem*>* getParentItemList(); |
| 89 |
QList<COptimizedKPSetConceptInstancesItem*>* getSuccessorItemList(); |
| 90 |
|
| 91 |
bool hasKnownInstance(COptimizedKPSetIndividualItem* item); |
| 92 |
bool hasPossibleInstance(COptimizedKPSetIndividualItem* item); |
| 93 |
|
| 94 |
COptimizedKPSetConceptInstancesItem* addKnownInstance(COptimizedKPSetIndividualItem* item); |
| 95 |
COptimizedKPSetConceptInstancesItem* removeKnownInstance(COptimizedKPSetIndividualItem* item); |
| 96 |
COptimizedKPSetConceptInstancesItem* addPossibleInstance(COptimizedKPSetIndividualItem* item); |
| 97 |
|
| 98 |
COptimizedKPSetConceptInstancesItem* addParentItem(COptimizedKPSetConceptInstancesItem* item); |
| 99 |
COptimizedKPSetConceptInstancesItem* addSuccessorItem(COptimizedKPSetConceptInstancesItem* item); |
| 100 |
|
| 101 |
cint64 getUnprocessedSuccessorItemCount(); |
| 102 |
COptimizedKPSetConceptInstancesItem* setUnprocessedSuccessorItemCount(cint64 unpSuccCount); |
| 103 |
COptimizedKPSetConceptInstancesItem* incUnprocessedSuccessorItemCount(cint64 incCount = 1); |
| 104 |
COptimizedKPSetConceptInstancesItem* decUnprocessedSuccessorItemCount(cint64 decCount = 1); |
| 105 |
|
| 106 |
cint64 getTestingPossibleInstancesCount(); |
| 107 |
bool hasTestingPossibleInstances(); |
| 108 |
COptimizedKPSetConceptInstancesItem* setTestingPossibleInstancesCount(cint64 testPossIntCount); |
| 109 |
COptimizedKPSetConceptInstancesItem* incTestingPossibleInstancesCount(cint64 incCount = 1); |
| 110 |
COptimizedKPSetConceptInstancesItem* decTestingPossibleInstancesCount(cint64 decCount = 1); |
| 111 |
|
| 112 |
bool hasAllSuccessorProcessedFlag(); |
| 113 |
COptimizedKPSetConceptInstancesItem* setAllSuccessorProcessedFlag(bool allSuccProcessed); |
| 114 |
|
| 115 |
bool hasToProcessPossibleInstancesFlag(); |
| 116 |
COptimizedKPSetConceptInstancesItem* setToProcessPossibleInstancesFlag(bool toProcess); |
| 117 |
|
| 118 |
bool hasPossibleInstancesProcessingQueuedFlag(); |
| 119 |
COptimizedKPSetConceptInstancesItem* setPossibleInstancesProcessingQueuedFlag(bool processingQueued); |
| 120 |
|
| 121 |
bool hasSelfSuccessorProcessedFlag(); |
| 122 |
COptimizedKPSetConceptInstancesItem* setSelfSuccessorProcessedFlag(bool selfSuccProcessed); |
| 123 |
|
| 124 |
bool hasPossibleInstances(); |
| 125 |
COptimizedKPSetIndividualItem* takeNextTestingPossibleInstance(); |
| 126 |
COptimizedKPSetConceptInstancesItem* removeTestingPossibleInstance(COptimizedKPSetIndividualItem* possInstance); |
| 127 |
QMap<cint64, COptimizedKPSetIndividualItem*>*& getPrefferedPossibleInstanceTestingSet(); |
| 128 |
|
| 129 |
|
| 130 |
COptimizedKPSetConceptInstancesItem* setConceptInstancesTestingFinished(bool finished); |
| 131 |
bool isConceptInstancesTestingFinished(); |
| 132 |
|
| 133 |
QHash<COptimizedKPSetIndividualItem*, CPossibleInstancesIndividualsMergingLinker*>* getIndividualItemPossibleInstanceMergingLinkerHash(bool create = false); |
| 134 |
QList<CPossibleInstancesIndividualsMergingData*>* getPossibleInstanceMergingDataContainer(bool create = false); |
| 135 |
COptimizedKPSetConceptInstancesItem* clearPossibleInstanceMergingData(); |
| 136 |
|
| 137 |
QMap<cint64, COptimizedKPSetIndividualItem*>* getModelMergingCheckedSet(bool create = false); |
| 138 |
|
| 139 |
|
| 140 |
COptimizedKPSetConceptInstancesItem* addKnownInstancesLabelCacheItem(CBackendRepresentativeMemoryLabelCacheItem* item); |
| 141 |
COptimizedKPSetConceptInstancesItem* addKnownMostSpecificInstancesLabelCacheItem(CBackendRepresentativeMemoryLabelCacheItem* item); |
| 142 |
COptimizedKPSetConceptInstancesItem* addPossibleInstancesLabelCacheItem(CBackendRepresentativeMemoryLabelCacheItem* item); |
| 143 |
COptimizedKPSetConceptInstancesItem* addPossibleMostSpecificInstancesLabelCacheItem(CBackendRepresentativeMemoryLabelCacheItem* item); |
| 144 |
|
| 145 |
|
| 146 |
QList<CBackendRepresentativeMemoryLabelCacheItem*>* getKnownInstancesLabelCacheItemList(); |
| 147 |
QList<CBackendRepresentativeMemoryLabelCacheItem*>* getKnownMostSpecificInstancesLabelCacheItemList(); |
| 148 |
QList<CBackendRepresentativeMemoryLabelCacheItem*>* getPossibleInstancesLabelCacheItemList(); |
| 149 |
QList<CBackendRepresentativeMemoryLabelCacheItem*>* getPossibleMostSpecificInstancesLabelCacheItemList(); |
| 150 |
|
| 151 |
|
| 152 |
// protected methods |
| 153 |
protected: |
| 154 |
|
| 155 |
// protected variables |
| 156 |
protected: |
| 157 |
CHierarchyNode* mHierNode; |
| 158 |
QMap<cint64, COptimizedKPSetIndividualItem*> mKnownInstancesMap; |
| 159 |
QMap<cint64, COptimizedKPSetIndividualItem*> mPossibleInstancesMap; |
| 160 |
|
| 161 |
QList<COptimizedKPSetIndividualItem*>** mConcurrentInitializationKnownInstancesLists; |
| 162 |
QList<COptimizedKPSetIndividualItem*>** mConcurrentInitializationPossibleInstancesLists; |
| 163 |
|
| 164 |
QList<COptimizedKPSetConceptInstancesItem*> mParentItemList; |
| 165 |
QList<COptimizedKPSetConceptInstancesItem*> mSuccessorItemList; |
| 166 |
|
| 167 |
QHash<cint64, CRealizingTestingItem*> mPossibleInstanceTestingItemHash; |
| 168 |
|
| 169 |
|
| 170 |
cint64 mUnprocessedSuccItemCount; |
| 171 |
cint64 mTestingPossInstanceCount; |
| 172 |
bool mAllSuccProcessedFlag; |
| 173 |
bool mToProcessFlag; |
| 174 |
bool mProcessingQueuedFlag; |
| 175 |
bool mSelfSuccsCompletedFlag; |
| 176 |
|
| 177 |
bool mConceptInstancesTestingFinished; |
| 178 |
|
| 179 |
|
| 180 |
|
| 181 |
QHash<COptimizedKPSetIndividualItem*, CPossibleInstancesIndividualsMergingLinker*>* mIndividualItemPossibleInstanceMergingLinkerHash; |
| 182 |
QList<CPossibleInstancesIndividualsMergingData*>* mPossibleInstanceMergingDataContainer; |
| 183 |
QMap<cint64, COptimizedKPSetIndividualItem*>* mPrefferedPossibleInstancesSet; |
| 184 |
|
| 185 |
QMap<cint64, COptimizedKPSetIndividualItem*>* mModelMergingCheckedSet; |
| 186 |
|
| 187 |
|
| 188 |
|
| 189 |
|
| 190 |
QList<CBackendRepresentativeMemoryLabelCacheItem*> mKnownInstancesLabelCacheItemList; |
| 191 |
QList<CBackendRepresentativeMemoryLabelCacheItem*> mKnownMostSpecificInstancesLabelCacheItemList; |
| 192 |
QList<CBackendRepresentativeMemoryLabelCacheItem*> mPossibleInstancesLabelCacheItemList; |
| 193 |
QList<CBackendRepresentativeMemoryLabelCacheItem*> mPossibleMostSpecificInstancesLabelCacheItemList; |
| 194 |
|
| 195 |
|
| 196 |
// private methods |
| 197 |
private: |
| 198 |
|
| 199 |
// private variables |
| 200 |
private: |
| 201 |
|
| 202 |
}; |
| 203 |
|
| 204 |
}; // end namespace Realizer |
| 205 |
|
| 206 |
}; // end namespace Reasoner |
| 207 |
|
| 208 |
}; // end namespace Konclude |
| 209 |
|
| 210 |
#endif // KONCLUDE_REASONER_REALIZER_COPTIMIZEDKPSETCONCEPTINSTANCESITEM_H |