/* * Copyright (C) 2013-2015, 2019 by the Konclude Developer Team. * * This file is part of the reasoning system Konclude. * For details and support, see . * * Konclude is free software: you can redistribute it and/or modify * it under the terms of version 3 of the GNU Lesser General Public * License (LGPLv3) as published by the Free Software Foundation. * * Konclude is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU (Lesser) General Public License for more details. * * You should have received a copy of the GNU (Lesser) General Public * License along with Konclude. If not, see . * */ #include "CBackendRepresentativeMemoryCacheIndividualAssociationData.h" namespace Konclude { namespace Reasoner { namespace Kernel { namespace Cache { CBackendRepresentativeMemoryCacheIndividualAssociationData::CBackendRepresentativeMemoryCacheIndividualAssociationData() { mMemContext = nullptr; } CBackendRepresentativeMemoryCacheIndividualAssociationData* CBackendRepresentativeMemoryCacheIndividualAssociationData::initAssociationData(CBackendRepresentativeMemoryCacheIndividualAssociationData* assData, bool increaseUpdateId) { initCachingStatusFlags(assData->getStatusFlags()); mIndiID = assData->mIndiID; mRepresentativeSameIndiId = assData->mRepresentativeSameIndiId; mDeterministicSameIndiId = assData->mDeterministicSameIndiId; mIncompletelyMarked = assData->mIncompletelyMarked; mIndirectlyConnectedNominalIndividual = assData->mIndirectlyConnectedNominalIndividual; mIndirectlyConnectedIndividualIntegration = assData->mIndirectlyConnectedIndividualIntegration; mCardinalityCacheEntry = assData->mCardinalityCacheEntry; for (cint64 i = 0; i < CBackendRepresentativeMemoryLabelCacheItem::LABEL_CACHE_ITEM_ASSOCIATABLE_TYPE_COUNT; ++i) { mLabelCacheEntries[i] = assData->mLabelCacheEntries[i]; } mNeighbourRoleSetHash = nullptr; mRoleSetNeighbourArray = nullptr; mAssociationDataUpdateId = assData->mAssociationDataUpdateId; if (increaseUpdateId) { mAssociationDataUpdateId++; } mProblematicLevel = assData->mProblematicLevel; mCacheUpdateId = 0; mCacheTouchId = 0; mLastIntegratedIndirectlyConnectedIndividualsChangeId = assData->mLastIntegratedIndirectlyConnectedIndividualsChangeId; mPrevData = assData; mProblematicLeveledNeighbour = assData->mProblematicLeveledNeighbour; mDetMergedSameConsideredLabelCacheEntry = assData->mDetMergedSameConsideredLabelCacheEntry; #ifndef KONCLUDE_FORCE_ALL_DEBUG_DEACTIVATED mDebugIndi = assData->mDebugIndi; #endif mLastPropagationCuttingUpdateId = assData->mLastPropagationCuttingUpdateId; mPropCutRemovedNeighbourIndiLinker = assData->mPropCutRemovedNeighbourIndiLinker; return this; } CBackendRepresentativeMemoryCacheIndividualAssociationData* CBackendRepresentativeMemoryCacheIndividualAssociationData::initAssociationData(cint64 indiId) { initCachingStatusFlags(); mAssociationDataUpdateId = 1; mIndiID = indiId; mRepresentativeSameIndiId = indiId; mDeterministicSameIndiId = indiId; mIncompletelyMarked = false; mIndirectlyConnectedNominalIndividual = false; mIndirectlyConnectedIndividualIntegration = false; mCardinalityCacheEntry = nullptr; for (cint64 i = 0; i < CBackendRepresentativeMemoryLabelCacheItem::LABEL_CACHE_ITEM_ASSOCIATABLE_TYPE_COUNT; ++i) { mLabelCacheEntries[i] = nullptr; } mNeighbourRoleSetHash = nullptr; mRoleSetNeighbourArray = nullptr; mProblematicLevel = 0; mCacheUpdateId = 0; mCacheTouchId = 0; mLastIntegratedIndirectlyConnectedIndividualsChangeId = 0; mProblematicLeveledNeighbour = false; mDetMergedSameConsideredLabelCacheEntry = nullptr; mPropCutRemovedNeighbourIndiLinker = nullptr; #ifndef KONCLUDE_FORCE_ALL_DEBUG_DEACTIVATED mDebugIndi = nullptr; #endif mLastPropagationCuttingUpdateId = -1; return this; } CBackendRepresentativeMemoryCacheIndividualAssociationData* CBackendRepresentativeMemoryCacheIndividualAssociationData::setIndividualId(cint64 indiId) { mIndiID = indiId; return this; } CBackendRepresentativeMemoryLabelCacheItem* CBackendRepresentativeMemoryCacheIndividualAssociationData::getDeterministicConceptSetLabelCacheEntry() { return getLabelCacheEntry(CBackendRepresentativeMemoryLabelCacheItem::DETERMINISTIC_CONCEPT_SET_LABEL); } CBackendRepresentativeMemoryCacheIndividualAssociationData* CBackendRepresentativeMemoryCacheIndividualAssociationData::setDeterministicConceptSetLabelCacheEntry(CBackendRepresentativeMemoryLabelCacheItem* cacheEntry) { setLabelCacheEntry(CBackendRepresentativeMemoryLabelCacheItem::DETERMINISTIC_CONCEPT_SET_LABEL, cacheEntry); return this; } CBackendRepresentativeMemoryLabelCacheItem* CBackendRepresentativeMemoryCacheIndividualAssociationData::getDeterministicMergedSameConsideredLabelCacheEntry() { return mDetMergedSameConsideredLabelCacheEntry; } CBackendRepresentativeMemoryCacheIndividualAssociationData* CBackendRepresentativeMemoryCacheIndividualAssociationData::setDeterministicMergedSameConsideredLabelCacheEntry(CBackendRepresentativeMemoryLabelCacheItem* cacheEntry) { mDetMergedSameConsideredLabelCacheEntry = cacheEntry; return this; } CBackendRepresentativeMemoryLabelCacheItem* CBackendRepresentativeMemoryCacheIndividualAssociationData::getLabelCacheEntry(cint64 labelType) { return mLabelCacheEntries[labelType]; } CBackendRepresentativeMemoryCacheIndividualAssociationData* CBackendRepresentativeMemoryCacheIndividualAssociationData::setLabelCacheEntry(cint64 labelType, CBackendRepresentativeMemoryLabelCacheItem* cacheEntry) { mLabelCacheEntries[labelType] = cacheEntry; return this; } CBackendRepresentativeMemoryCardinalityCacheItem* CBackendRepresentativeMemoryCacheIndividualAssociationData::getBackendCardinalityCacheEntry() { return mCardinalityCacheEntry; } CBackendRepresentativeMemoryCacheIndividualAssociationData* CBackendRepresentativeMemoryCacheIndividualAssociationData::setBackendCardinalityCacheEntry(CBackendRepresentativeMemoryCardinalityCacheItem* cacheEntry) { mCardinalityCacheEntry = cacheEntry; return this; } bool CBackendRepresentativeMemoryCacheIndividualAssociationData::isIncompletelyMarked() { return mIncompletelyMarked; } CBackendRepresentativeMemoryCacheIndividualAssociationData* CBackendRepresentativeMemoryCacheIndividualAssociationData::setIncompletelyMarked(bool marked) { mIncompletelyMarked = marked; return this; } CBackendRepresentativeMemoryCacheIndividualNeighbourRoleSetHash* CBackendRepresentativeMemoryCacheIndividualAssociationData::getNeighbourRoleSetHash() { return mNeighbourRoleSetHash; } CBackendRepresentativeMemoryCacheIndividualAssociationData* CBackendRepresentativeMemoryCacheIndividualAssociationData::setNeighbourRoleSetHash(CBackendRepresentativeMemoryCacheIndividualNeighbourRoleSetHash* neighbourRoleSetHash) { mNeighbourRoleSetHash = neighbourRoleSetHash; return this; } CBackendRepresentativeMemoryCacheIndividualRoleSetNeighbourArray* CBackendRepresentativeMemoryCacheIndividualAssociationData::getRoleSetNeighbourArray() { return mRoleSetNeighbourArray; } CBackendRepresentativeMemoryCacheIndividualAssociationData* CBackendRepresentativeMemoryCacheIndividualAssociationData::setRoleSetNeighbourArray(CBackendRepresentativeMemoryCacheIndividualRoleSetNeighbourArray* roleSetNeighbourArray) { mRoleSetNeighbourArray = roleSetNeighbourArray; return this; } cint64 CBackendRepresentativeMemoryCacheIndividualAssociationData::getAssociationDataUpdateId() { return mAssociationDataUpdateId; } cint64 CBackendRepresentativeMemoryCacheIndividualAssociationData::getCacheUpdateId() { return mCacheUpdateId; } cint64 CBackendRepresentativeMemoryCacheIndividualAssociationData::getCacheTouchId() { return mCacheTouchId; } CBackendRepresentativeMemoryCacheIndividualAssociationData* CBackendRepresentativeMemoryCacheIndividualAssociationData::setCacheUpdateId(cint64 updateId) { mCacheUpdateId = updateId; mCacheTouchId = updateId; return this; } CBackendRepresentativeMemoryCacheIndividualAssociationData* CBackendRepresentativeMemoryCacheIndividualAssociationData::setCacheTouchId(cint64 updateId) { mCacheTouchId = updateId; return this; } cint64 CBackendRepresentativeMemoryCacheIndividualAssociationData::getLastIntegratedIndirectlyConnectedIndividualsChangeId() { return mLastIntegratedIndirectlyConnectedIndividualsChangeId; } CBackendRepresentativeMemoryCacheIndividualAssociationData* CBackendRepresentativeMemoryCacheIndividualAssociationData::setLastIntegratedIndirectlyConnectedIndividualsChangeId(cint64 lastIntegratedChangeId) { mLastIntegratedIndirectlyConnectedIndividualsChangeId = lastIntegratedChangeId; return this; } bool CBackendRepresentativeMemoryCacheIndividualAssociationData::isIndirectlyConnectedNominalIndividual() { return mIndirectlyConnectedNominalIndividual; } CBackendRepresentativeMemoryCacheIndividualAssociationData* CBackendRepresentativeMemoryCacheIndividualAssociationData::setIndirectlyConnectedNominalIndividual(bool indirectlyConnected) { mIndirectlyConnectedNominalIndividual = indirectlyConnected; return this; } bool CBackendRepresentativeMemoryCacheIndividualAssociationData::hasIndirectlyConnectedIndividualIntegration() { return mIndirectlyConnectedIndividualIntegration; } CBackendRepresentativeMemoryCacheIndividualAssociationData* CBackendRepresentativeMemoryCacheIndividualAssociationData::setIndirectlyConnectedIndividualIntegration(bool indirectlyConnectedIndividualIntegration) { mIndirectlyConnectedIndividualIntegration = indirectlyConnectedIndividualIntegration; return this; } cint64 CBackendRepresentativeMemoryCacheIndividualAssociationData::getRepresentativeSameIndividualId() { return mRepresentativeSameIndiId; } CBackendRepresentativeMemoryCacheIndividualAssociationData* CBackendRepresentativeMemoryCacheIndividualAssociationData::setRepresentativeSameIndividualId(cint64 indiId) { mRepresentativeSameIndiId = indiId; return this; } cint64 CBackendRepresentativeMemoryCacheIndividualAssociationData::hasRepresentativeSameIndividualMerging() { return mIndiID != mRepresentativeSameIndiId; } cint64 CBackendRepresentativeMemoryCacheIndividualAssociationData::getDeterministicSameIndividualId() { return mDeterministicSameIndiId; } CBackendRepresentativeMemoryCacheIndividualAssociationData* CBackendRepresentativeMemoryCacheIndividualAssociationData::setDeterministicSameIndividualId(cint64 indiId) { mDeterministicSameIndiId = indiId; return this; } cint64 CBackendRepresentativeMemoryCacheIndividualAssociationData::hasDeterministicSameIndividualMerging() { return mIndiID != mDeterministicSameIndiId; } cint64 CBackendRepresentativeMemoryCacheIndividualAssociationData::getAssociatedIndividualId() { return mIndiID; } cint64 CBackendRepresentativeMemoryCacheIndividualAssociationData::hasProblematicLevel() { return mProblematicLevel > 0; } cint64 CBackendRepresentativeMemoryCacheIndividualAssociationData::getProblematicLevel() { return mProblematicLevel; } CBackendRepresentativeMemoryCacheIndividualAssociationData* CBackendRepresentativeMemoryCacheIndividualAssociationData::setProblematicLevel(cint64 level) { mProblematicLevel = level; return this; } CBackendRepresentativeMemoryCacheIndividualAssociationData* CBackendRepresentativeMemoryCacheIndividualAssociationData::incProblematicLevel(cint64 count) { mProblematicLevel += count; return this; } cint64 CBackendRepresentativeMemoryCacheIndividualAssociationData::hasProblematicLeveledNeigbour() { return mProblematicLeveledNeighbour; } CBackendRepresentativeMemoryCacheIndividualAssociationData* CBackendRepresentativeMemoryCacheIndividualAssociationData::setProblematicLeveledNeigbour(bool neighbourPropLeveled) { mProblematicLeveledNeighbour = neighbourPropLeveled; return this; } CBackendRepresentativeMemoryCacheIndividualAssociationContext* CBackendRepresentativeMemoryCacheIndividualAssociationData::getIndividualAssociationMemoryContext() { return mMemContext; } CBackendRepresentativeMemoryCacheIndividualAssociationData* CBackendRepresentativeMemoryCacheIndividualAssociationData::setIndividualAssociationMemoryContext(CBackendRepresentativeMemoryCacheIndividualAssociationContext* memCon) { mMemContext = memCon; return this; } CBackendRepresentativeMemoryCacheIndividualAssociationData* CBackendRepresentativeMemoryCacheIndividualAssociationData::setLastPropagationCuttingUpdateId(cint64 id) { mLastPropagationCuttingUpdateId = id; return this; } cint64 CBackendRepresentativeMemoryCacheIndividualAssociationData::getLastPropagationCuttingUpdateId() { return mLastPropagationCuttingUpdateId; } bool CBackendRepresentativeMemoryCacheIndividualAssociationData::hasLastPropagationCuttingUpdateId() { return mLastPropagationCuttingUpdateId != -1; } CBackendRepresentativeMemoryCacheIndividualAssociationData* CBackendRepresentativeMemoryCacheIndividualAssociationData::getPreviousData() { return mPrevData; } CBackendRepresentativeMemoryCacheIndividualRoleSetNeighbourIndividualIdLinker* CBackendRepresentativeMemoryCacheIndividualAssociationData::getPropagationCutRemovedNeighbourIndividualLinker() { return mPropCutRemovedNeighbourIndiLinker; } CBackendRepresentativeMemoryCacheIndividualAssociationData* CBackendRepresentativeMemoryCacheIndividualAssociationData::setPropagationCutRemovedNeighbourIndividualLinker(CBackendRepresentativeMemoryCacheIndividualRoleSetNeighbourIndividualIdLinker* linker) { mPropCutRemovedNeighbourIndiLinker = linker; return this; } }; // end namespace Cache }; // end namespace Kernel }; // end namespace Reasoner }; // end namespace Konclude