/*
* 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 "CPropagationBindingReapplyConceptHash.h"
#include "CIndividualProcessNode.h"
namespace Konclude {
namespace Reasoner {
namespace Kernel {
namespace Process {
CPropagationBindingReapplyConceptHash::CPropagationBindingReapplyConceptHash(CProcessContext* processContext) : mProcessContext(processContext) {
}
CPropagationBindingReapplyConceptHash* CPropagationBindingReapplyConceptHash::initPropagationBindingReapplyConceptHash(CPropagationBindingReapplyConceptHash* prevHash) {
if (prevHash) {
CPROCESSHASH::operator=(*prevHash);
} else {
CPROCESSHASH::clear();
}
return this;
}
CPropagationBindingReapplyConceptHash* CPropagationBindingReapplyConceptHash::addPropagationBindingReapplyConceptDescriptor(CIndividualProcessNode* indi, CConcept* concept, CPropagationBindingReapplyConceptDescriptor* reapplyConDes) {
return addPropagationBindingReapplyConceptDescriptor(TIndividualConceptPair(indi->getIndividualNodeID(),concept),reapplyConDes);
}
CPropagationBindingReapplyConceptHash* CPropagationBindingReapplyConceptHash::addPropagationBindingReapplyConceptDescriptor(const TIndividualConceptPair& indiConPair, CPropagationBindingReapplyConceptDescriptor* reapplyConDes) {
CPropagationBindingReapplyConceptHashData& data = CPROCESSHASH::operator[](indiConPair);
reapplyConDes->append(data.getPropagationBindingReapplyConceptDescriptor());
data.setPropagationBindingReapplyConceptDescriptor(reapplyConDes);
return this;
}
CPropagationBindingReapplyConceptDescriptor* CPropagationBindingReapplyConceptHash::takePropagationBindingReapplyConceptDescriptor(const TIndividualConceptPair& indiConPair) {
CPropagationBindingReapplyConceptHashData data = CPROCESSHASH::value(indiConPair);
CPropagationBindingReapplyConceptDescriptor* reapplyConDes = data.getPropagationBindingReapplyConceptDescriptor();
data.clearPropagationBindingReapplyConceptDescriptor();
return reapplyConDes;
}
bool CPropagationBindingReapplyConceptHash::hasPropagationBindingReapplyConceptDescriptor(const TIndividualConceptPair& indiConPair) {
CPropagationBindingReapplyConceptHashData data = CPROCESSHASH::value(indiConPair);
return data.getPropagationBindingReapplyConceptDescriptor() != nullptr;
}
CPropagationBindingReapplyConceptIterator CPropagationBindingReapplyConceptHash::getPropagationBindingReapplyConceptDescriptorIterator() {
return CPropagationBindingReapplyConceptIterator(CPROCESSHASH::begin(),CPROCESSHASH::end());
}
}; // end namespace Process
}; // end namespace Kernel
}; // end namespace Reasoner
}; // end namespace Konclude