/*
* 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 "CRepresentativeContainingMapData.h"
namespace Konclude {
namespace Reasoner {
namespace Kernel {
namespace Process {
CRepresentativeContainingMapData::CRepresentativeContainingMapData(CRepresentativeVariableBindingPathSetData* containedRep, bool explContained) {
mExplicitelyContained = explContained;
mContainedRep = containedRep;
}
CRepresentativeVariableBindingPathSetData* CRepresentativeContainingMapData::getRepresentativeVariableBindingPathSetData() const {
return mContainedRep;
}
bool CRepresentativeContainingMapData::hasRepresentativeVariableBindingPathSetData() const {
return mContainedRep != nullptr;
}
CRepresentativeContainingMapData* CRepresentativeContainingMapData::setRepresentativeVariableBindingPathSetData(CRepresentativeVariableBindingPathSetData* containedRep) {
mContainedRep = containedRep;
return this;
}
bool CRepresentativeContainingMapData::isExplicitelyContained() const {
return mExplicitelyContained;
}
CRepresentativeContainingMapData* CRepresentativeContainingMapData::setExplicitelyContained(bool explContained) {
mExplicitelyContained = explContained;
return this;
}
}; // end namespace Process
}; // end namespace Kernel
}; // end namespace Reasoner
}; // end namespace Konclude