/* * 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 "CReuseCompletionGraphCacheEntry.h" namespace Konclude { namespace Reasoner { namespace Kernel { namespace Cache { CReuseCompletionGraphCacheEntry::CReuseCompletionGraphCacheEntry(CReuseCompletionGraphCacheContext* context) : mContext(context),mIncompatibleValues(context),mEntailedValues(context) { mJobInstance = nullptr; mEntryID = 0; } CCACHINGSET* CReuseCompletionGraphCacheEntry::getIncompatibleValues() { return &mIncompatibleValues; } CCACHINGSET* CReuseCompletionGraphCacheEntry::getEntailedValues() { return &mEntailedValues; } CCACHINGSET* CReuseCompletionGraphCacheEntry::getMinimalValues() { return &mMinimalValues; } CSatisfiableCalculationJobInstantiation* CReuseCompletionGraphCacheEntry::getJobInstantiation() { return mJobInstance; } CReuseCompletionGraphCacheEntry* CReuseCompletionGraphCacheEntry::setJobInstantiation(CSatisfiableCalculationJobInstantiation* jobInstantiation) { mJobInstance = jobInstantiation; return this; } CReuseCompletionGraphCacheEntry* CReuseCompletionGraphCacheEntry::setEntailedValues(CCACHINGSET* valueSet) { if (valueSet) { mEntailedValues += *valueSet; } return this; } CReuseCompletionGraphCacheEntry* CReuseCompletionGraphCacheEntry::addEntailedValue(const CCacheValue& cacheValue) { mEntailedValues.insert(cacheValue); return this; } CReuseCompletionGraphCacheEntry* CReuseCompletionGraphCacheEntry::setIncompatibleValues(CCACHINGSET* valueSet) { if (valueSet) { mIncompatibleValues += *valueSet; } return this; } CReuseCompletionGraphCacheEntry* CReuseCompletionGraphCacheEntry::addIncompatibleValue(const CCacheValue& cacheValue) { mIncompatibleValues.insert(cacheValue); return this; } CReuseCompletionGraphCacheEntry* CReuseCompletionGraphCacheEntry::setMinimalValues(CCACHINGSET* valueSet) { if (valueSet) { mMinimalValues += *valueSet; } return this; } CReuseCompletionGraphCacheEntry* CReuseCompletionGraphCacheEntry::addMinimalValue(const CCacheValue& cacheValue) { mMinimalValues.insert(cacheValue); return this; } bool CReuseCompletionGraphCacheEntry::hasMinimalValue(const CCacheValue& cacheValue) { return mMinimalValues.contains(cacheValue); } CReuseCompletionGraphCacheEntry* CReuseCompletionGraphCacheEntry::setEntryID(cint64 id) { mEntryID = id; return this; } cint64 CReuseCompletionGraphCacheEntry::getEntryID() { return mEntryID; } }; // end namespace Cache }; // end namespace Kernel }; // end namespace Reasoner }; // end namespace Konclude