/* * 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 "CBlockingIndividualNodeLinkedCandidateHash.h" namespace Konclude { namespace Reasoner { namespace Kernel { namespace Process { CBlockingIndividualNodeLinkedCandidateHash::CBlockingIndividualNodeLinkedCandidateHash(CProcessContext* context) : mContext(context) { mMemMan = mContext->getUsedMemoryAllocationManager(); mBlockCandidateHash = nullptr; mUseBlockCandidateHash = nullptr; mPrevBlockCandidateHash = nullptr; } CBlockingIndividualNodeLinkedCandidateHash::~CBlockingIndividualNodeLinkedCandidateHash() { } CBlockingIndividualNodeLinkedCandidateHash* CBlockingIndividualNodeLinkedCandidateHash::initBlockingIndividualNodeCandidateHash(CBlockingIndividualNodeLinkedCandidateHash* prevBlockCandHash) { mBlockCandidateHash = nullptr; if (prevBlockCandHash) { mPrevBlockCandidateHash = prevBlockCandHash->mUseBlockCandidateHash; mUseBlockCandidateHash = mPrevBlockCandidateHash; } else { mPrevBlockCandidateHash = nullptr; mUseBlockCandidateHash = nullptr; } return this; } CBlockingIndividualNodeLinkedCandidateData* CBlockingIndividualNodeLinkedCandidateHash::getBlockingIndividualCandidateData(CConcept* initializationConcept, bool conceptNegation, bool create) { if (!mUseBlockCandidateHash || !mBlockCandidateHash && create) { mBlockCandidateHash = CObjectParameterizingAllocator< CPROCESSHASH< QPair ,CBlockingLinkedCandidateHashData>,CContext* >::allocateAndConstructAndParameterize(mMemMan,mContext); if (mPrevBlockCandidateHash) { *mBlockCandidateHash = *mPrevBlockCandidateHash; } mUseBlockCandidateHash = mBlockCandidateHash; } if (create) { CBlockingLinkedCandidateHashData& data = (*mUseBlockCandidateHash)[QPair(initializationConcept,conceptNegation)]; if (!data.mCandidateIndiData) { data.mCandidateIndiData = CObjectParameterizingAllocator< CBlockingIndividualNodeLinkedCandidateData,CProcessContext* >::allocateAndConstructAndParameterize(mMemMan,mContext); data.mCandidateIndiData->initBlockingCandidateData(data.mPrevCandidateIndiData); data.mPrevCandidateIndiData = data.mCandidateIndiData; } return data.mPrevCandidateIndiData; } else { CBlockingLinkedCandidateHashData* data = nullptr; if (mUseBlockCandidateHash->tryGetValuePointer(QPair(initializationConcept,conceptNegation),data)) { return data->mPrevCandidateIndiData; } } return nullptr; } CBlockingIndividualNodeLinkedCandidateData* CBlockingIndividualNodeLinkedCandidateHash::getBlockingIndividualCandidateData(CConceptDescriptor* initializationConDes, bool create) { return getBlockingIndividualCandidateData(initializationConDes->getConcept(),initializationConDes->getNegation(),create); } }; // end namespace Process }; // end namespace Kernel }; // end namespace Reasoner }; // end namespace Konclude