/* * 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 "CSignatureBlockingCandidateHash.h" namespace Konclude { namespace Reasoner { namespace Kernel { namespace Process { CSignatureBlockingCandidateHash::CSignatureBlockingCandidateHash(CProcessContext* context) : mContext(context),mSigBlockCandidateHash(context) { mMemMan = mContext->getUsedMemoryAllocationManager(); } CSignatureBlockingCandidateHash* CSignatureBlockingCandidateHash::initSignatureBlockingCandidateHash(CSignatureBlockingCandidateHash* prevSigBlockCandHash) { if (prevSigBlockCandHash) { mSigBlockCandidateHash = prevSigBlockCandHash->mSigBlockCandidateHash; } else { mSigBlockCandidateHash.clear(); } return this; } CSignatureBlockingCandidateHash* CSignatureBlockingCandidateHash::insertSignatureBlockingCandidate(cint64 signature, CIndividualProcessNode* individualCandidate) { CSignatureBlockingCandidateData& data = mSigBlockCandidateHash[signature]; CXLinker* candLinker = CObjectAllocator< CXLinker >::allocateAndConstruct(mMemMan); cint64 indiCandID = individualCandidate->getIndividualNodeID(); candLinker->initLinker(indiCandID,data.mCandidateIndiLinker); data.mCandidateIndiLinker = candLinker; data.mCandidateCount++; return this; } CSignatureBlockingCandidateHash* CSignatureBlockingCandidateHash::insertSignatureBlockingCandidates(cint64 signature, CXLinker* candidateLinker) { CSignatureBlockingCandidateData& data = mSigBlockCandidateHash[signature]; data.mCandidateCount += candidateLinker->getCount(); if (data.mCandidateIndiLinker) { candidateLinker->append(data.mCandidateIndiLinker); } data.mCandidateIndiLinker = candidateLinker; return this; } CSignatureBlockingCandidateIterator CSignatureBlockingCandidateHash::getBlockingCandidatesIterator(cint64 signature) { CSignatureBlockingCandidateData* data = mSigBlockCandidateHash.valuePointer(signature); if (data) { return CSignatureBlockingCandidateIterator(signature,data->mCandidateIndiLinker); } else { return CSignatureBlockingCandidateIterator(signature,nullptr); } } cint64 CSignatureBlockingCandidateHash::getBlockingCandidatesCount(cint64 signature) { CSignatureBlockingCandidateData* data = mSigBlockCandidateHash.valuePointer(signature); if (data) { return data->mCandidateCount; } return 0; } cint64 CSignatureBlockingCandidateHash::getBlockingCandidatesCount(CConceptSetSignature* signature) { return getBlockingCandidatesCount(signature->getSignatureValue()); } CSignatureBlockingCandidateHash* CSignatureBlockingCandidateHash::insertSignatureBlockingCandidate(CConceptSetSignature* signature, CIndividualProcessNode* individualCandidate) { return insertSignatureBlockingCandidate(signature->getSignatureValue(),individualCandidate); } CSignatureBlockingCandidateIterator CSignatureBlockingCandidateHash::getBlockingCandidatesIterator(CConceptSetSignature* signature) { return getBlockingCandidatesIterator(signature->getSignatureValue()); } CSignatureIterator CSignatureBlockingCandidateHash::getSignatureIterator() { return CSignatureIterator(&mSigBlockCandidateHash); } }; // end namespace Process }; // end namespace Kernel }; // end namespace Reasoner }; // end namespace Konclude