/* * 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 "CSaturationSuccessorConceptExtensionMap.h" namespace Konclude { namespace Reasoner { namespace Kernel { namespace Process { CSaturationSuccessorConceptExtensionMap::CSaturationSuccessorConceptExtensionMap(CProcessContext* processContext) : mConceptExtensionMap(processContext) { } CSaturationSuccessorConceptExtensionMap* CSaturationSuccessorConceptExtensionMap::initSuccessorConceptExtensionMap() { mConceptExtensionMap.clear(); return this; } CPROCESSHASH* CSaturationSuccessorConceptExtensionMap::getSuccessorConceptExtensionMap() { return &mConceptExtensionMap; } bool CSaturationSuccessorConceptExtensionMap::addExtensionConcept(CConcept* concept, bool negation) { CSaturationSuccessorConceptExtensionMapData& conExtMapData = mConceptExtensionMap[concept->getConceptTag()]; conExtMapData.mConcept = concept; bool modified = false; if (negation) { if (!conExtMapData.mNegative) { modified = true; } conExtMapData.mNegative = true; } else { if (!conExtMapData.mPositive) { modified = true; } conExtMapData.mPositive = true; } return modified; } }; // end namespace Process }; // end namespace Kernel }; // end namespace Reasoner }; // end namespace Konclude