/*
* 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 .
*
*/
#ifndef KONCLUDE_REASONER_KERNEL_TASK_CSATISFIABLETASKREPRESENTATIVEBACKENDUPDATINGADAPTER_H
#define KONCLUDE_REASONER_KERNEL_TASK_CSATISFIABLETASKREPRESENTATIVEBACKENDUPDATINGADAPTER_H
// Libraries includes
// Namespace includes
#include "TaskSettings.h"
// Other includes
#include "Reasoner/Consistiser/CIndividualPrecomputationCoordinationHash.h"
#include "Reasoner/Ontology/CIndividualReference.h"
// Logger includes
#include "Logger/CLogger.h"
namespace Konclude {
namespace Reasoner {
using namespace Ontology;
using namespace Consistiser;
namespace Kernel {
namespace Task {
/*!
*
* \class CSatisfiableTaskRepresentativeBackendUpdatingAdapter
* \author Andreas Steigmiller
* \version 0.1
* \brief TODO
*
*/
class CSatisfiableTaskRepresentativeBackendUpdatingAdapter {
// public methods
public:
//! Constructor
CSatisfiableTaskRepresentativeBackendUpdatingAdapter(CIndividualPrecomputationCoordinationHash* indiComCoordHash = nullptr, bool *unstatFlagPointer = nullptr, bool *expansionLimitReachedFlagPointer = nullptr);
CIndividualPrecomputationCoordinationHash* getIndividualComputationCoordinationHash();
CSatisfiableTaskRepresentativeBackendUpdatingAdapter* setIndividualComputationCoordinationHash(CIndividualPrecomputationCoordinationHash* indiComCoordHash);
cint64 getFirstIndividualRecomputationId();
cint64 getRepresentativeCacheRecomputationId();
cint64 getIndividualComputationCount();
cint64 getAdditionalIndividualComputationSize();
CSatisfiableTaskRepresentativeBackendUpdatingAdapter* setAdditionalIndividualComputationSize(cint64 size);
CSatisfiableTaskRepresentativeBackendUpdatingAdapter* setFirstIndividualRecomputationId(cint64 id);
CSatisfiableTaskRepresentativeBackendUpdatingAdapter* setRepresentativeCacheRecomputationId(cint64 id);
QList* getIndividualComputationList();
CSatisfiableTaskRepresentativeBackendUpdatingAdapter* addIndividualComputations(QList& indiRefList);
CSatisfiableTaskRepresentativeBackendUpdatingAdapter* setAllAssertionIndividualId(cint64 id);
cint64 getAllAssertionIndividualId();
bool hasUnsatisfiableComputed();
bool hasExpansionLimitReached();
CSatisfiableTaskRepresentativeBackendUpdatingAdapter* setExpansionLimitReached();
CSatisfiableTaskRepresentativeBackendUpdatingAdapter* setUnsatisfiableComputed();
bool isExpansionPropagationCutted();
CSatisfiableTaskRepresentativeBackendUpdatingAdapter* setExpansionPropagationCutted(bool cutted);
// protected methods
protected:
// protected variables
protected:
CIndividualPrecomputationCoordinationHash* mIndiCompCoordHash;
cint64 mFirstIndividualID;
cint64 mRepCacheCompID;
cint64 mAllAssertionIndiID = -1;
bool* mUnstatFlagPointer;
bool* mExpansionLimitReachedFlagPointer;
QList mIndiComputationList;
cint64 mAdditionalIndividualComputationCount = 0;
bool mExpansionPropagationCutted;
// private methods
private:
// private variables
private:
};
}; // end namespace Task
}; // end namespace Kernel
}; // end namespace Reasoner
}; // end namespace Konclude
#endif // KONCLUDE_REASONER_KERNEL_TASK_CSATISFIABLETASKREPRESENTATIVEBACKENDUPDATINGADAPTER_H