/* * 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 "CIndividualReactivationProcessingQueue.h" namespace Konclude { namespace Reasoner { namespace Kernel { namespace Process { CIndividualReactivationProcessingQueue::CIndividualReactivationProcessingQueue(CProcessContext* processContext) : mProcessContext(processContext),mPriorityIndiReactivationMap(processContext) { } CIndividualReactivationProcessingQueue* CIndividualReactivationProcessingQueue::initProcessingQueue(CIndividualReactivationProcessingQueue* processingQueue) { if (processingQueue) { mPriorityIndiReactivationMap = processingQueue->mPriorityIndiReactivationMap; } else { mPriorityIndiReactivationMap.clear(); } return this; } bool CIndividualReactivationProcessingQueue::takeNextReactivationIndividual(CIndividualProcessNode*& indiNode, bool& forceReactivation) { CIndividualProcessNode* nextNode = nullptr; if (!mPriorityIndiReactivationMap.isEmpty()) { CPROCESSMAP::iterator it = mPriorityIndiReactivationMap.begin(); CIndividualForceReactivationData& data = it.value(); forceReactivation = data.mForceReactivation; indiNode = data.mIndiNode; it = mPriorityIndiReactivationMap.erase(it); return true; } return false; } bool CIndividualReactivationProcessingQueue::getNextReactivationIndividual(CIndividualProcessNode*& indiNode, bool& forceReactivation) { CIndividualProcessNode* nextNode = nullptr; if (!mPriorityIndiReactivationMap.isEmpty()) { CPROCESSMAP::iterator it = mPriorityIndiReactivationMap.begin(); CIndividualForceReactivationData& data = it.value(); forceReactivation = data.mForceReactivation; indiNode = data.mIndiNode; return true; } return false; } bool CIndividualReactivationProcessingQueue::hasQueuedIndividual(CIndividualProcessNode* individual) { CIndividualProcessNode* nextNode = nullptr; if (!mPriorityIndiReactivationMap.isEmpty()) { CIndividualDepthPriority priority(individual->getIndividualNominalLevelOrAncestorDepth(),individual->getIndividualNodeID()); return mPriorityIndiReactivationMap.contains(priority); } return false; } bool CIndividualReactivationProcessingQueue::insertReactivationIndiviudal(CIndividualProcessNode* individual, bool forceReactivation) { CIndividualDepthPriority priority(individual->getIndividualNominalLevelOrAncestorDepth(),individual->getIndividualNodeID()); CIndividualForceReactivationData& inFoReDa = mPriorityIndiReactivationMap[priority]; bool newEntry = inFoReDa.mIndiNode == nullptr || !inFoReDa.mForceReactivation && forceReactivation; inFoReDa.mForceReactivation = forceReactivation; inFoReDa.mIndiNode = individual; return newEntry; } bool CIndividualReactivationProcessingQueue::isEmpty() { return mPriorityIndiReactivationMap.count() <= 0; } cint64 CIndividualReactivationProcessingQueue::getQueuedIndividualCount() { return mPriorityIndiReactivationMap.count(); } bool CIndividualReactivationProcessingQueue::hasQueuedIndividuals() { return mPriorityIndiReactivationMap.count() > 0; } }; // end namespace Process }; // end namespace Kernel }; // end namespace Reasoner }; // end namespace Konclude