/*
* 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 "CConceptReapplyHash.h"
namespace Konclude {
namespace Reasoner {
namespace Kernel {
namespace Process {
CConceptReapplyHash::CConceptReapplyHash(CProcessContext* processContext) : CPROCESSHASH,CReapplyQueue>(processContext) {
}
CConceptReapplyHash::~CConceptReapplyHash() {
}
CConceptReapplyHash* CConceptReapplyHash::initConceptReapplyHash(CConceptReapplyHash* prevConceptReapplyHash) {
if (prevConceptReapplyHash) {
*this = *prevConceptReapplyHash;
} else {
CPROCESSHASH,CReapplyQueue>::clear();
}
return this;
}
CReapplyQueue* CConceptReapplyHash::getConceptReapplyQueue(CConcept *&concept, bool &conceptNegation, bool create) {
QPair conNegPair(concept,conceptNegation);
if (create) {
return &this->operator[](conNegPair);
} else {
if (contains(conNegPair)) {
return &this->operator[](conNegPair);
} else {
return nullptr;
}
}
}
bool CConceptReapplyHash::containsConceptReapplyQueue(CConcept *&concept, bool &conceptNegation) {
return contains(QPair(concept,conceptNegation));
}
CReapplyQueueIterator CConceptReapplyHash::getConceptReapplyIterator(CConcept *&concept, bool &conceptNegation, bool clearDynamicReapplyQueue) {
QPair conNegPair(concept,conceptNegation);
CReapplyQueue* reapplyQueue = nullptr;
if (tryGetValuePointer(conNegPair,reapplyQueue)) {
return reapplyQueue->getIterator(clearDynamicReapplyQueue);
}
return CReapplyQueueIterator(nullptr,nullptr);
}
}; // end namespace Process
}; // end namespace Kernel
}; // end namespace Reasoner
}; // end namespace Konclude