| 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_COPTIMIZEDKPSETROLEINSTANCESITEM_H |
| 22 |
#define KONCLUDE_REASONER_REALIZER_COPTIMIZEDKPSETROLEINSTANCESITEM_H |
| 23 |
|
| 24 |
// Libraries includes |
| 25 |
|
| 26 |
|
| 27 |
// Namespace includes |
| 28 |
#include "RealizerSettings.h" |
| 29 |
#include "COptimizedKPSetIndividualItem.h" |
| 30 |
#include "COptimizedKPSetIndividualItemPair.h" |
| 31 |
#include "COptimizedKPSetIndividualItemReferencePair.h" |
| 32 |
#include "COptimizedKPSetRoleInstancesRedirectionItem.h" |
| 33 |
#include "COntologyRealizingDynamicRequirmentProcessingContainer.h" |
| 34 |
#include "COptimizedKPSetRoleInstancesCombinedNeighbourRoleSetCacheLabelData.h" |
| 35 |
#include "COptimizedKPSetRoleInstancesCombinedNeighbourRoleSetCacheLabelHash.h" |
| 36 |
#include "COptimizedKPSetIndividualComplexRoleData.h" |
| 37 |
#include "COptimizedRepresentativeKPSetCacheMultipleTypeLabelSetItemIterator.h" |
| 38 |
#include "COptimizedKPSetIndividualComplexRoleExplicitIndirectLinksData.h" |
| 39 |
|
| 40 |
|
| 41 |
// Other includes |
| 42 |
#include "Reasoner/Ontology/CRole.h" |
| 43 |
|
| 44 |
#include "Reasoner/Taxonomy/CRolePropertiesHierarchyNode.h" |
| 45 |
|
| 46 |
// Logger includes |
| 47 |
#include "Logger/CLogger.h" |
| 48 |
|
| 49 |
|
| 50 |
namespace Konclude { |
| 51 |
|
| 52 |
namespace Reasoner { |
| 53 |
|
| 54 |
using namespace Ontology; |
| 55 |
using namespace Realization; |
| 56 |
using namespace Taxonomy; |
| 57 |
|
| 58 |
namespace Realizer { |
| 59 |
|
| 60 |
|
| 61 |
/*! |
| 62 |
* |
| 63 |
* \class COptimizedKPSetRoleInstancesItem |
| 64 |
* \author Andreas Steigmiller |
| 65 |
* \version 0.1 |
| 66 |
* \brief TODO |
| 67 |
* |
| 68 |
*/ |
| 69 |
class COptimizedKPSetRoleInstancesItem : public COptimizedKPSetRoleInstancesRedirectionItem, public COntologyRealizingDynamicRequirmentProcessingContainer { |
| 70 |
// public methods |
| 71 |
public: |
| 72 |
//! Constructor |
| 73 |
COptimizedKPSetRoleInstancesItem(); |
| 74 |
|
| 75 |
COptimizedKPSetRoleInstancesItem* initInstancesItem(CRole* role); |
| 76 |
|
| 77 |
COptimizedKPSetRoleInstancesItem* setInitialUnprocessedSuccessorItemCount(); |
| 78 |
COptimizedKPSetRoleInstancesItem* setInitialUninitializedSuccessorItemCount(); |
| 79 |
|
| 80 |
CRole* getRole(); |
| 81 |
COptimizedKPSetRoleInstancesItem* setRole(CRole* role); |
| 82 |
|
| 83 |
|
| 84 |
CRolePropertiesHierarchyNode* getRoleHierarchyNode(); |
| 85 |
COptimizedKPSetRoleInstancesItem* setRoleHierarchyNode(CRolePropertiesHierarchyNode* roleHierNode); |
| 86 |
|
| 87 |
|
| 88 |
CRolePropertiesHierarchyNode* getInverseRoleHierarchyNode(); |
| 89 |
COptimizedKPSetRoleInstancesItem* setInverseRoleHierarchyNode(CRolePropertiesHierarchyNode* roleHierNode); |
| 90 |
|
| 91 |
|
| 92 |
COptimizedKPSetRoleInstancesRedirectionItem* getInverseRoleRedirectedItem(); |
| 93 |
COptimizedKPSetRoleInstancesItem* setInverseRoleRedirectedItem(COptimizedKPSetRoleInstancesRedirectionItem* redirectedItem); |
| 94 |
|
| 95 |
|
| 96 |
QSet<COptimizedKPSetIndividualItemPair>* getKnownInstancesSet(); |
| 97 |
QSet<COptimizedKPSetIndividualItemPair>* getPossibleInstancesSet(); |
| 98 |
|
| 99 |
QList<TRoleItemInversionPair>* getParentItemList(); |
| 100 |
QList<TRoleItemInversionPair>* getSuccessorItemList(); |
| 101 |
|
| 102 |
bool hasKnownInstance(const COptimizedKPSetIndividualItemPair& itemPair); |
| 103 |
bool hasPossibleInstance(const COptimizedKPSetIndividualItemPair& itemPair); |
| 104 |
|
| 105 |
COptimizedKPSetRoleInstancesItem* addKnownInstance(const COptimizedKPSetIndividualItemPair& itemPair); |
| 106 |
COptimizedKPSetRoleInstancesItem* removeKnownInstance(const COptimizedKPSetIndividualItemPair& itemPair); |
| 107 |
COptimizedKPSetRoleInstancesItem* addPossibleInstance(const COptimizedKPSetIndividualItemPair& itemPair); |
| 108 |
COptimizedKPSetRoleInstancesItem* removePossibleInstance(const COptimizedKPSetIndividualItemPair& itemPair); |
| 109 |
|
| 110 |
|
| 111 |
bool hasKnownInverseInstance(const COptimizedKPSetIndividualItemPair& itemPair); |
| 112 |
bool hasPossibleInverseInstance(const COptimizedKPSetIndividualItemPair& itemPair); |
| 113 |
|
| 114 |
COptimizedKPSetRoleInstancesItem* addKnownInverseInstance(const COptimizedKPSetIndividualItemPair& itemPair); |
| 115 |
COptimizedKPSetRoleInstancesItem* removeKnownInverseInstance(const COptimizedKPSetIndividualItemPair& itemPair); |
| 116 |
COptimizedKPSetRoleInstancesItem* addPossibleInverseInstance(const COptimizedKPSetIndividualItemPair& itemPair); |
| 117 |
COptimizedKPSetRoleInstancesItem* removePossibleInverseInstance(const COptimizedKPSetIndividualItemPair& itemPair); |
| 118 |
|
| 119 |
|
| 120 |
bool hasKnownInstance(const COptimizedKPSetIndividualItemPair& itemPair, bool inverse); |
| 121 |
bool hasPossibleInstance(const COptimizedKPSetIndividualItemPair& itemPair, bool inverse); |
| 122 |
|
| 123 |
COptimizedKPSetRoleInstancesItem* addKnownInstance(const COptimizedKPSetIndividualItemPair& itemPair, bool inverse); |
| 124 |
COptimizedKPSetRoleInstancesItem* removeKnownInstance(const COptimizedKPSetIndividualItemPair& itemPair, bool inverse); |
| 125 |
COptimizedKPSetRoleInstancesItem* addPossibleInstance(const COptimizedKPSetIndividualItemPair& itemPair, bool inverse); |
| 126 |
COptimizedKPSetRoleInstancesItem* removePossibleInstance(const COptimizedKPSetIndividualItemPair& itemPair, bool inverse); |
| 127 |
|
| 128 |
|
| 129 |
|
| 130 |
COptimizedKPSetRoleInstancesItem* addParentItem(COptimizedKPSetRoleInstancesItem* item, bool inversed); |
| 131 |
COptimizedKPSetRoleInstancesItem* addSuccessorItem(COptimizedKPSetRoleInstancesItem* item, bool inversed); |
| 132 |
|
| 133 |
cint64 getUnprocessedSuccessorItemCount(); |
| 134 |
COptimizedKPSetRoleInstancesItem* setUnprocessedSuccessorItemCount(cint64 unpSuccCount); |
| 135 |
COptimizedKPSetRoleInstancesItem* incUnprocessedSuccessorItemCount(cint64 incCount = 1); |
| 136 |
COptimizedKPSetRoleInstancesItem* decUnprocessedSuccessorItemCount(cint64 decCount = 1); |
| 137 |
|
| 138 |
cint64 getTestingPossibleInstancesCount(); |
| 139 |
bool hasTestingPossibleInstances(); |
| 140 |
COptimizedKPSetRoleInstancesItem* setTestingPossibleInstancesCount(cint64 testPossIntCount); |
| 141 |
COptimizedKPSetRoleInstancesItem* incTestingPossibleInstancesCount(cint64 incCount = 1); |
| 142 |
COptimizedKPSetRoleInstancesItem* decTestingPossibleInstancesCount(cint64 decCount = 1); |
| 143 |
|
| 144 |
|
| 145 |
|
| 146 |
|
| 147 |
cint64 getTestingComplexCandidateInstancesCount(); |
| 148 |
bool hasTestingComplexCandidateInstancesCount(); |
| 149 |
COptimizedKPSetRoleInstancesItem* setTestingComplexCandidateInstancesCount(cint64 testPossIntCount); |
| 150 |
COptimizedKPSetRoleInstancesItem* incTestingComplexCandidateInstancesCount(cint64 incCount = 1); |
| 151 |
COptimizedKPSetRoleInstancesItem* decTestingComplexCandidateInstancesCount(cint64 decCount = 1); |
| 152 |
|
| 153 |
|
| 154 |
|
| 155 |
cint64 getTestingInitializationPropagationCount(); |
| 156 |
bool hasTestingInitializationPropagationCount(); |
| 157 |
COptimizedKPSetRoleInstancesItem* setTestingInitializationPropagationCount(cint64 testPossIntCount); |
| 158 |
COptimizedKPSetRoleInstancesItem* incTestingInitializationPropagationCount(cint64 incCount = 1); |
| 159 |
COptimizedKPSetRoleInstancesItem* decTestingInitializationPropagationCount(cint64 decCount = 1); |
| 160 |
|
| 161 |
|
| 162 |
|
| 163 |
bool hasAllSuccessorProcessedFlag(); |
| 164 |
COptimizedKPSetRoleInstancesItem* setAllSuccessorProcessedFlag(bool allSuccProcessed); |
| 165 |
|
| 166 |
bool hasToProcessPossibleInstancesFlag(); |
| 167 |
COptimizedKPSetRoleInstancesItem* setToProcessPossibleInstancesFlag(bool toProcess); |
| 168 |
|
| 169 |
bool hasPossibleInstancesProcessingQueuedFlag(); |
| 170 |
COptimizedKPSetRoleInstancesItem* setPossibleInstancesProcessingQueuedFlag(bool processingQueued); |
| 171 |
|
| 172 |
|
| 173 |
bool hasComplexCandidateInstancesProcessingQueuedFlag(); |
| 174 |
COptimizedKPSetRoleInstancesItem* setComplexCandidateProcessingQueuedFlag(bool processingQueued); |
| 175 |
|
| 176 |
|
| 177 |
bool hasSelfSuccessorProcessedFlag(); |
| 178 |
COptimizedKPSetRoleInstancesItem* setSelfSuccessorProcessedFlag(bool selfSuccProcessed); |
| 179 |
|
| 180 |
bool hasPossibleInstances(); |
| 181 |
COptimizedKPSetIndividualItemPair takeNextTestingPossibleInstance(); |
| 182 |
|
| 183 |
bool requiresCandidateInitialization(); |
| 184 |
COptimizedKPSetRoleInstancesItem* setRequiresCandidateInitialization(bool requiresInit); |
| 185 |
|
| 186 |
bool hasRemainingCandidateInitializationSuccessors(); |
| 187 |
QList<COptimizedKPSetIndividualItem*>* getRemainingCandidateInitializationSuccessorList(); |
| 188 |
COptimizedKPSetIndividualItem* takeNextRemainingCandidateInitializationSuccessor(); |
| 189 |
COptimizedKPSetRoleInstancesItem* addRemainingCandidateInitializationSuccessor(COptimizedKPSetIndividualItem* item); |
| 190 |
COptimizedKPSetRoleInstancesItem* addRemainingCandidateInitializationSuccessors(QList<COptimizedKPSetIndividualItem*>* itemList); |
| 191 |
bool isCandidateSuccessorInitializationCompleted(); |
| 192 |
bool isCandidateSuccessorInitializationStarted(); |
| 193 |
COptimizedKPSetRoleInstancesItem* setCandidateSuccessorInitializationStarted(bool initStarted); |
| 194 |
COptimizedKPSetRoleInstancesItem* setCandidateSuccessorInitializationCompleted(bool initCompleted); |
| 195 |
|
| 196 |
|
| 197 |
cint64 getUninitializedSuccessorItemCount(); |
| 198 |
COptimizedKPSetRoleInstancesItem* setUninitializedSuccessorItemCount(cint64 unintSuccCount); |
| 199 |
COptimizedKPSetRoleInstancesItem* incUninitializedSuccessorItemCount(cint64 incCount = 1); |
| 200 |
COptimizedKPSetRoleInstancesItem* decUninitializedSuccessorItemCount(cint64 decCount = 1); |
| 201 |
|
| 202 |
bool hasAllSuccessorInitializedFlag(); |
| 203 |
COptimizedKPSetRoleInstancesItem* setAllSuccessorInitializedFlag(bool allSuccInitialized); |
| 204 |
|
| 205 |
bool hasInitializingQueuedFlag(); |
| 206 |
COptimizedKPSetRoleInstancesItem* setInitializingQueuedFlag(bool initializingQueued); |
| 207 |
|
| 208 |
bool hasToInitializeCandidatesFlag(); |
| 209 |
COptimizedKPSetRoleInstancesItem* setToInitializeCandidatesFlag(bool toInitialize); |
| 210 |
|
| 211 |
|
| 212 |
CConcept* getTemporaryPropagationConcept(); |
| 213 |
CConcept* getTemporaryMarkerConcept(); |
| 214 |
COptimizedKPSetRoleInstancesItem* setTemporaryPropagationConcept(CConcept* propagationConcept); |
| 215 |
COptimizedKPSetRoleInstancesItem* setTemporaryMarkerConcept(CConcept* markerConcept); |
| 216 |
|
| 217 |
|
| 218 |
|
| 219 |
CConcept* getTemporaryInversePropagationConcept(); |
| 220 |
CConcept* getTemporaryInverseMarkerConcept(); |
| 221 |
COptimizedKPSetRoleInstancesItem* setTemporaryInversePropagationConcept(CConcept* propagationConcept); |
| 222 |
COptimizedKPSetRoleInstancesItem* setTemporaryInverseMarkerConcept(CConcept* markerConcept); |
| 223 |
|
| 224 |
bool hasInverseRole(); |
| 225 |
CRole* getInverseRole(); |
| 226 |
COptimizedKPSetRoleInstancesItem* setInverseRole(CRole* role); |
| 227 |
|
| 228 |
|
| 229 |
QSet<CRole*>* getComplexRoleStarterCandidateSet(); |
| 230 |
COptimizedKPSetRoleInstancesItem* addComplexRoleStarterCandidate(CRole* role); |
| 231 |
bool hasComplexRoleStarterCandidate(CRole* role); |
| 232 |
|
| 233 |
QSet<CRole*>* getComplexInverseRoleStarterCandidateSet(); |
| 234 |
COptimizedKPSetRoleInstancesItem* addComplexInverseRoleStarterCandidate(CRole* role); |
| 235 |
bool hasComplexInverseRoleStarterCandidate(CRole* role); |
| 236 |
|
| 237 |
|
| 238 |
bool hasOnlyTransitiveComplexRoleCandidates(); |
| 239 |
COptimizedKPSetRoleInstancesItem* setOnlyTransitiveComplexRoleCandidates(bool onlyTransitiveCandidates); |
| 240 |
|
| 241 |
QSet<TRoleItemInversionPair>* getOnlyTransitiveComplexSubRoleItems(); |
| 242 |
COptimizedKPSetRoleInstancesItem* addOnlyTransitiveComplexSubRoleItem(const TRoleItemInversionPair& item); |
| 243 |
|
| 244 |
|
| 245 |
bool hasOnlyDeterministicComplexRoleStarterCandidatesUsage(); |
| 246 |
COptimizedKPSetRoleInstancesItem* setOnlyDeterministicComplexRoleStarterCandidatesUsage(bool onlyDeterministicComplexRoleStarterCandidatesUsage); |
| 247 |
|
| 248 |
|
| 249 |
|
| 250 |
COptimizedKPSetRoleInstancesCombinedNeighbourRoleSetCacheLabelHash* getCombinedNeighbourCacheLabelItemDataHash(bool inversed); |
| 251 |
bool hasCombinedNeighbourCacheLabelItemInversed(CBackendRepresentativeMemoryLabelCacheItem* cacheLabelItem); |
| 252 |
|
| 253 |
|
| 254 |
|
| 255 |
bool hasComplexRoleData(); |
| 256 |
QHash<cint64, COptimizedKPSetIndividualComplexRoleData*>* getIndividualIdComplexRoleDataHash(); |
| 257 |
COptimizedKPSetIndividualComplexRoleData* getIndividualIdComplexRoleData(cint64 individualId, bool createIfNotExists = true); |
| 258 |
|
| 259 |
|
| 260 |
|
| 261 |
COptimizedKPSetRoleInstancesItem* addComplexStarterCandidateCombinedNeighbourRoleLabelCacheItem(bool inversed, CBackendRepresentativeMemoryLabelCacheItem* labelCacheItem); |
| 262 |
QSet<CBackendRepresentativeMemoryLabelCacheItem*>* getComplexStarterCandidateCombinedNeighbourRoleLabelCacheItemSet(bool inversed); |
| 263 |
|
| 264 |
|
| 265 |
COptimizedKPSetRoleInstancesItem* addComplexStarterCandidateCombinedExistentialRoleLabelCacheItem(bool inversed, CBackendRepresentativeMemoryLabelCacheItem* labelCacheItem); |
| 266 |
QSet<CBackendRepresentativeMemoryLabelCacheItem*>* getComplexStarterCandidateCombinedExistentialRoleLabelCacheItemSet(bool inversed); |
| 267 |
|
| 268 |
|
| 269 |
COptimizedRepresentativeKPSetCacheMultipleTypeLabelSetItemIterator* getIndividualComplexCandidateIterator(); |
| 270 |
COptimizedKPSetRoleInstancesItem* setIndividualComplexCandidateIterator(COptimizedRepresentativeKPSetCacheMultipleTypeLabelSetItemIterator* iterator); |
| 271 |
|
| 272 |
|
| 273 |
|
| 274 |
|
| 275 |
COptimizedKPSetRoleInstancesItem* addComplexCandidateInstance(const COptimizedKPSetIndividualItemReferencePair& itemRefPair, bool inverse); |
| 276 |
COptimizedKPSetRoleInstancesItem* removeComplexCandidateInstance(const COptimizedKPSetIndividualItemReferencePair& itemRefPair, bool inverse); |
| 277 |
|
| 278 |
bool hasComplexInstanceCandidates(); |
| 279 |
COptimizedKPSetIndividualItemReferencePair takeNextTestingComplexInstanceCandidate(); |
| 280 |
|
| 281 |
|
| 282 |
|
| 283 |
|
| 284 |
COptimizedKPSetRoleInstancesItem* addExistentialRoleLabelCacheItem(bool inversed, CBackendRepresentativeMemoryLabelCacheItem* labelCacheItem); |
| 285 |
QSet<CBackendRepresentativeMemoryLabelCacheItem*>* getExistentialRoleLabelCacheItemSet(bool inversed); |
| 286 |
|
| 287 |
|
| 288 |
enum RolePreferredPropagationDirection { |
| 289 |
STRAIGHT, |
| 290 |
INVERSE, |
| 291 |
NONE |
| 292 |
}; |
| 293 |
|
| 294 |
bool hasPropagationDirectionDetermined(); |
| 295 |
COptimizedKPSetRoleInstancesItem* setPropagationDirectionDetermined(bool determined); |
| 296 |
|
| 297 |
RolePreferredPropagationDirection getPreferredPropagationDirection(); |
| 298 |
COptimizedKPSetRoleInstancesItem* setPreferredPropagationDirection(RolePreferredPropagationDirection direction); |
| 299 |
|
| 300 |
// protected methods |
| 301 |
protected: |
| 302 |
|
| 303 |
// protected variables |
| 304 |
protected: |
| 305 |
CRole* mInvRole; |
| 306 |
|
| 307 |
CRolePropertiesHierarchyNode* mRoleHierNode; |
| 308 |
CRolePropertiesHierarchyNode* mInvRoleHierNode; |
| 309 |
|
| 310 |
COptimizedKPSetRoleInstancesRedirectionItem* mInvRedirectedItem; |
| 311 |
|
| 312 |
|
| 313 |
CConcept* mTmpPropagationConcept; |
| 314 |
CConcept* mTmpMarkerConcept; |
| 315 |
|
| 316 |
QSet<COptimizedKPSetIndividualItemPair> mKnownInstancesSet; |
| 317 |
QSet<COptimizedKPSetIndividualItemPair> mPossibleInstancesSet; |
| 318 |
|
| 319 |
|
| 320 |
QSet<COptimizedKPSetIndividualItemReferencePair> mComplexRoleCandidateInstancesSet; |
| 321 |
|
| 322 |
|
| 323 |
CConcept* mTmpInversePropagationConcept; |
| 324 |
CConcept* mTmpInverseMarkerConcept; |
| 325 |
|
| 326 |
QList<TRoleItemInversionPair> mParentItemList; |
| 327 |
QList<TRoleItemInversionPair> mSuccessorItemList; |
| 328 |
|
| 329 |
cint64 mUnprocessedSuccItemCount; |
| 330 |
cint64 mTestingPossInstanceCount; |
| 331 |
bool mAllSuccProcessedFlag; |
| 332 |
bool mToProcessFlag; |
| 333 |
bool mPossibleProcessingQueuedFlag; |
| 334 |
bool mComplexCandidateProcessingQueuedFlag; |
| 335 |
bool mSelfSuccsCompletedFlag; |
| 336 |
|
| 337 |
|
| 338 |
cint64 mTestingInitializationPropagationCount; |
| 339 |
cint64 mTestingPossibleInstancesCount; |
| 340 |
|
| 341 |
|
| 342 |
|
| 343 |
bool mRequiresCandidateInitializationFlag; |
| 344 |
|
| 345 |
QList<COptimizedKPSetIndividualItem*> mRemainingCandidateInitializationSuccessorList; |
| 346 |
bool mInitializationStartedFlag; |
| 347 |
bool mInitializationCompletedFlag; |
| 348 |
cint64 mUninitializedSuccItemCount; |
| 349 |
bool mAllSuccInitializedFlag; |
| 350 |
bool mInitializingQueuedFlag; |
| 351 |
bool mToInitializeFlag; |
| 352 |
|
| 353 |
|
| 354 |
QSet<CRole*> mComplexRoleStarterCandidateSet; |
| 355 |
QSet<CRole*> mComplexInverseRoleStarterCandidateSet; |
| 356 |
|
| 357 |
bool mOnlyTransitiveComplexRoleCandidates; |
| 358 |
bool mOnlyDeterministicComplexRoleStarterCandidatesUsage; |
| 359 |
QSet<TRoleItemInversionPair> mOnlyTransitiveComplexSubRoleItems; |
| 360 |
|
| 361 |
|
| 362 |
COptimizedKPSetRoleInstancesCombinedNeighbourRoleSetCacheLabelHash mCombinedNeighbourLabelDataHash; |
| 363 |
COptimizedKPSetRoleInstancesCombinedNeighbourRoleSetCacheLabelHash mInverseCombinedNeighbourLabelDataHash; |
| 364 |
|
| 365 |
|
| 366 |
QHash<cint64, COptimizedKPSetIndividualComplexRoleData*> mIndividualIdComplexRoleDataHash; |
| 367 |
|
| 368 |
|
| 369 |
QSet<CBackendRepresentativeMemoryLabelCacheItem*> mComplexStarterCandidateCombinedNeighbourRoleLabelCacheItemSet; |
| 370 |
QSet<CBackendRepresentativeMemoryLabelCacheItem*> mComplexInverseStarterCandidateCombinedNeighbourRoleLabelCacheItemSet; |
| 371 |
|
| 372 |
QSet<CBackendRepresentativeMemoryLabelCacheItem*> mComplexStarterCandidateCombinedExistentialRoleLabelCacheItemSet; |
| 373 |
QSet<CBackendRepresentativeMemoryLabelCacheItem*> mComplexInverseStarterCandidateCombinedExistentialRoleLabelCacheItemSet; |
| 374 |
|
| 375 |
|
| 376 |
QSet<CBackendRepresentativeMemoryLabelCacheItem*> mExistentialRoleLabelCacheItemSet; |
| 377 |
QSet<CBackendRepresentativeMemoryLabelCacheItem*> mExistentialInverseRoleLabelCacheItemSet; |
| 378 |
|
| 379 |
|
| 380 |
COptimizedRepresentativeKPSetCacheMultipleTypeLabelSetItemIterator* mComplexIndiCandidateIterator; |
| 381 |
|
| 382 |
|
| 383 |
bool mPropagationDirectionDetermined; |
| 384 |
RolePreferredPropagationDirection mPreferredPropagationDirection; |
| 385 |
|
| 386 |
// private methods |
| 387 |
private: |
| 388 |
|
| 389 |
// private variables |
| 390 |
private: |
| 391 |
|
| 392 |
}; |
| 393 |
|
| 394 |
}; // end namespace Realizer |
| 395 |
|
| 396 |
}; // end namespace Reasoner |
| 397 |
|
| 398 |
}; // end namespace Konclude |
| 399 |
|
| 400 |
#endif // KONCLUDE_REASONER_REALIZER_COPTIMIZEDKPSETROLEINSTANCESITEM_H |