/*
* 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 "COptimizedRepresentativeKPSetConceptSetCacheLabelItemData.h"
namespace Konclude {
namespace Reasoner {
namespace Realizer {
COptimizedRepresentativeKPSetConceptSetCacheLabelItemData::COptimizedRepresentativeKPSetConceptSetCacheLabelItemData(CBackendRepresentativeMemoryLabelCacheItem* labelCacheItem) {
mLabelCacheItem = labelCacheItem;
mPossibleInstances = false;
}
CBackendRepresentativeMemoryLabelCacheItem* COptimizedRepresentativeKPSetConceptSetCacheLabelItemData::getLabelCacheItem() {
return mLabelCacheItem;
}
bool COptimizedRepresentativeKPSetConceptSetCacheLabelItemData::hasPossibleInstances() {
return mPossibleInstances;
}
COptimizedRepresentativeKPSetConceptSetCacheLabelItemData* COptimizedRepresentativeKPSetConceptSetCacheLabelItemData::setPossibleInstances(bool possibleInstances) {
mPossibleInstances = possibleInstances;
return this;
}
QHash* COptimizedRepresentativeKPSetConceptSetCacheLabelItemData::getInstancesItemDataHash() {
return &mInstancesItemDataHash;
}
COptimizedRepresentativeKPSetConceptSetCacheLabelItemInstancesData* COptimizedRepresentativeKPSetConceptSetCacheLabelItemData::getInstancesItemData(COptimizedKPSetConceptInstancesItem* instanceItem, bool createIfNotExists) {
COptimizedRepresentativeKPSetConceptSetCacheLabelItemInstancesData*& instancesData = mInstancesItemDataHash[instanceItem];
if (!instancesData && createIfNotExists) {
instancesData = new COptimizedRepresentativeKPSetConceptSetCacheLabelItemInstancesData();
}
return instancesData;
}
QList* COptimizedRepresentativeKPSetConceptSetCacheLabelItemData::getKnownInstancesItemList() {
return &mKnownInstancesItemList;
}
QList* COptimizedRepresentativeKPSetConceptSetCacheLabelItemData::getPossibleInstancesItemList() {
return &mPossibleInstancesItemList;
}
}; // end namespace Realizer
}; // end namespace Reasoner
}; // end namespace Konclude