/*
* 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 "CSatisfiableTaskRepresentativeBackendUpdatingAdapter.h"
namespace Konclude {
namespace Reasoner {
namespace Kernel {
namespace Task {
CSatisfiableTaskRepresentativeBackendUpdatingAdapter::CSatisfiableTaskRepresentativeBackendUpdatingAdapter(CIndividualPrecomputationCoordinationHash* indiComCoordHash, bool *unstatFlagPointer, bool *expansionLimitReachedFlagPointer) {
mIndiCompCoordHash = indiComCoordHash;
mUnstatFlagPointer = unstatFlagPointer;
mExpansionLimitReachedFlagPointer = expansionLimitReachedFlagPointer;
mExpansionPropagationCutted = false;
}
CIndividualPrecomputationCoordinationHash* CSatisfiableTaskRepresentativeBackendUpdatingAdapter::getIndividualComputationCoordinationHash() {
return mIndiCompCoordHash;
}
CSatisfiableTaskRepresentativeBackendUpdatingAdapter* CSatisfiableTaskRepresentativeBackendUpdatingAdapter::setIndividualComputationCoordinationHash(CIndividualPrecomputationCoordinationHash* indiComCoordHash) {
mIndiCompCoordHash = indiComCoordHash;
return this;
}
cint64 CSatisfiableTaskRepresentativeBackendUpdatingAdapter::getFirstIndividualRecomputationId() {
return mFirstIndividualID;
}
cint64 CSatisfiableTaskRepresentativeBackendUpdatingAdapter::getRepresentativeCacheRecomputationId() {
return mRepCacheCompID;
}
cint64 CSatisfiableTaskRepresentativeBackendUpdatingAdapter::getIndividualComputationCount() {
return mIndiComputationList.count();
}
cint64 CSatisfiableTaskRepresentativeBackendUpdatingAdapter::getAdditionalIndividualComputationSize() {
return mAdditionalIndividualComputationCount;
}
CSatisfiableTaskRepresentativeBackendUpdatingAdapter* CSatisfiableTaskRepresentativeBackendUpdatingAdapter::setAdditionalIndividualComputationSize(cint64 size) {
mAdditionalIndividualComputationCount = size;
return this;
}
CSatisfiableTaskRepresentativeBackendUpdatingAdapter* CSatisfiableTaskRepresentativeBackendUpdatingAdapter::setFirstIndividualRecomputationId(cint64 id) {
mFirstIndividualID = id;
return this;
}
CSatisfiableTaskRepresentativeBackendUpdatingAdapter* CSatisfiableTaskRepresentativeBackendUpdatingAdapter::setRepresentativeCacheRecomputationId(cint64 id) {
mRepCacheCompID = id;
return this;
}
QList* CSatisfiableTaskRepresentativeBackendUpdatingAdapter::getIndividualComputationList() {
return &mIndiComputationList;
}
CSatisfiableTaskRepresentativeBackendUpdatingAdapter* CSatisfiableTaskRepresentativeBackendUpdatingAdapter::addIndividualComputations(QList& indiRefList) {
if (mIndiComputationList.isEmpty()) {
mIndiComputationList = indiRefList;
} else {
mIndiComputationList.append(indiRefList);
}
return this;
}
CSatisfiableTaskRepresentativeBackendUpdatingAdapter* CSatisfiableTaskRepresentativeBackendUpdatingAdapter::setAllAssertionIndividualId(cint64 id) {
mAllAssertionIndiID = id;
return this;
}
cint64 CSatisfiableTaskRepresentativeBackendUpdatingAdapter::getAllAssertionIndividualId() {
return mAllAssertionIndiID;
}
bool CSatisfiableTaskRepresentativeBackendUpdatingAdapter::hasUnsatisfiableComputed() {
if (mUnstatFlagPointer) {
return *mUnstatFlagPointer;
}
return false;
}
bool CSatisfiableTaskRepresentativeBackendUpdatingAdapter::hasExpansionLimitReached() {
if (mExpansionLimitReachedFlagPointer) {
return *mExpansionLimitReachedFlagPointer;
}
return false;
}
CSatisfiableTaskRepresentativeBackendUpdatingAdapter* CSatisfiableTaskRepresentativeBackendUpdatingAdapter::setExpansionLimitReached() {
if (mExpansionLimitReachedFlagPointer && !hasExpansionLimitReached()) {
*mExpansionLimitReachedFlagPointer = true;
}
return this;
}
CSatisfiableTaskRepresentativeBackendUpdatingAdapter* CSatisfiableTaskRepresentativeBackendUpdatingAdapter::setUnsatisfiableComputed() {
if (mUnstatFlagPointer && !hasUnsatisfiableComputed()) {
*mUnstatFlagPointer = true;
}
return this;
}
bool CSatisfiableTaskRepresentativeBackendUpdatingAdapter::isExpansionPropagationCutted() {
return mExpansionPropagationCutted;
}
CSatisfiableTaskRepresentativeBackendUpdatingAdapter* CSatisfiableTaskRepresentativeBackendUpdatingAdapter::setExpansionPropagationCutted(bool cutted) {
mExpansionPropagationCutted = cutted;
return this;
}
}; // end namespace Task
}; // end namespace Kernel
}; // end namespace Reasoner
}; // end namespace Konclude