/*
* 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_PROCESS_CBACKENDNEIGHBOUREXPANSIONQUEUEDATALINKER_H
#define KONCLUDE_REASONER_KERNEL_PROCESS_CBACKENDNEIGHBOUREXPANSIONQUEUEDATALINKER_H
// Libraries includes
// Namespace includes
#include "ProcessSettings.h"
#include "CProcessContext.h"
// Other includes
#include "Reasoner/Kernel/Cache/CBackendRepresentativeMemoryLabelCacheItem.h"
#include "Utilities/Container/CLinker.h"
#include "Reasoner/Ontology/CConcept.h"
#include "Reasoner/Ontology/CRole.h"
// Logger includes
#include "Logger/CLogger.h"
namespace Konclude {
using namespace Utilities::Container;
namespace Reasoner {
using namespace Ontology;
namespace Kernel {
using namespace Cache;
namespace Process {
/*!
*
* \class CBackendNeighbourExpansionQueueDataLinker
* \author Andreas Steigmiller
* \version 0.1
* \brief TODO
*
*/
class CBackendNeighbourExpansionQueueDataLinker : public CLinkerBase {
// public methods
public:
//! Constructor
CBackendNeighbourExpansionQueueDataLinker(CProcessContext* processContext);
CBackendNeighbourExpansionQueueDataLinker* initQueueData(CBackendNeighbourExpansionQueueDataLinker* queueData);
CBackendNeighbourExpansionQueueDataLinker* initQueueData(cint64 neighbourArrayId, CRole* role, CConcept* concept, bool conNegation, bool nondeterministic, bool forceExpansion, CIndividualProcessNode* baseIndiNode, CIndividualProcessNode* backendSyncDataIndiNode, cint64 lastExpandedNeighbourId = -1, cint64 neighbourVisitingCoursor = 0, bool propagationCutExpansion = false, bool missingNondeterministicExpansionPropagation = false);
CBackendNeighbourExpansionQueueDataLinker* updateNeighbourExpansionCursor(cint64 lastExpandedNeighbourId, cint64 neighbourVisitingCoursor);
CRole* getRole();
CConcept* getConcept();
bool getConceptNegation();
bool getConceptNondeterministic();
CIndividualProcessNode* getBaseIndividualNode();
CIndividualProcessNode* getBackendSyncDataIndividualNode();
cint64 getLastExpandedNeighbourId();
cint64 getNeighbourVisitingCursor();
CBackendRepresentativeMemoryLabelCacheItem* getExpandingLabel();
CBackendNeighbourExpansionQueueDataLinker* setExpandingLabel(CBackendRepresentativeMemoryLabelCacheItem* label);
cint64 getNeighbourArrayId();
bool isForceExpansion();
bool isPropagationCutExpansion();
bool isMissingNondeterministicExpansionPropagation();
CBackendNeighbourExpansionQueueDataLinker* setMissingNondeterministicExpansionPropagation(bool missingProp);
// protected methods
protected:
// protected variables
protected:
CRole* mRole;
CConcept* mConcept;
bool mConNegation;
CIndividualProcessNode* mBaseIndiNode;
CIndividualProcessNode* mBackendSyncDataIndiNode;
cint64 mLastExpandedNeighbourId;
cint64 mNeighbourVisitingCursor;
cint64 mNeighbourArrayId;
bool mForceExpansion;
bool mPropagationCutExpansion;
bool mConceptNondeterministic;
CBackendRepresentativeMemoryLabelCacheItem* mLabel;
bool mMissingNondeterministicExpansionPropagation;
// private methods
private:
// private variables
private:
};
}; // end namespace Process
}; // end namespace Kernel
}; // end namespace Reasoner
}; // end namespace Konclude
#endif // KONCLUDE_REASONER_KERNEL_PROCESS_CBACKENDNEIGHBOUREXPANSIONQUEUEDATALINKER_H