Debian Codegraph @

Source/Reasoner/Realizer/COptimizedRepresentativeKPSetConceptSetCacheLabelItemData.cpp

raw
1 /*
2 * Copyright (C) 2013-2015, 2019 by the Konclude Developer Team.
3 *
4 * This file is part of the reasoning system Konclude.
5 * For details and support, see <http://konclude.com/>.
6 *
7 * Konclude is free software: you can redistribute it and/or modify
8 * it under the terms of version 3 of the GNU Lesser General Public
9 * License (LGPLv3) as published by the Free Software Foundation.
10 *
11 * Konclude is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU (Lesser) General Public License for more details.
15 *
16 * You should have received a copy of the GNU (Lesser) General Public
17 * License along with Konclude. If not, see <http://www.gnu.org/licenses/>.
18 *
19 */
20
21 #include "COptimizedRepresentativeKPSetConceptSetCacheLabelItemData.h"
22
23
24 namespace Konclude {
25
26 namespace Reasoner {
27
28 namespace Realizer {
29
30
31 COptimizedRepresentativeKPSetConceptSetCacheLabelItemData::COptimizedRepresentativeKPSetConceptSetCacheLabelItemData(CBackendRepresentativeMemoryLabelCacheItem* labelCacheItem) {
32 mLabelCacheItem = labelCacheItem;
33 mPossibleInstances = false;
34 }
35
36 CBackendRepresentativeMemoryLabelCacheItem* COptimizedRepresentativeKPSetConceptSetCacheLabelItemData::getLabelCacheItem() {
37 return mLabelCacheItem;
38 }
39
40 bool COptimizedRepresentativeKPSetConceptSetCacheLabelItemData::hasPossibleInstances() {
41 return mPossibleInstances;
42 }
43
44 COptimizedRepresentativeKPSetConceptSetCacheLabelItemData* COptimizedRepresentativeKPSetConceptSetCacheLabelItemData::setPossibleInstances(bool possibleInstances) {
45 mPossibleInstances = possibleInstances;
46 return this;
47 }
48
49 QHash<COptimizedKPSetConceptInstancesItem*, COptimizedRepresentativeKPSetConceptSetCacheLabelItemInstancesData*>* COptimizedRepresentativeKPSetConceptSetCacheLabelItemData::getInstancesItemDataHash() {
50 return &mInstancesItemDataHash;
51 }
52
53 COptimizedRepresentativeKPSetConceptSetCacheLabelItemInstancesData* COptimizedRepresentativeKPSetConceptSetCacheLabelItemData::getInstancesItemData(COptimizedKPSetConceptInstancesItem* instanceItem, bool createIfNotExists) {
54 COptimizedRepresentativeKPSetConceptSetCacheLabelItemInstancesData*& instancesData = mInstancesItemDataHash[instanceItem];
55 if (!instancesData && createIfNotExists) {
56 instancesData = new COptimizedRepresentativeKPSetConceptSetCacheLabelItemInstancesData();
57 }
58 return instancesData;
59 }
60
61 QList<COptimizedKPSetConceptInstancesItem*>* COptimizedRepresentativeKPSetConceptSetCacheLabelItemData::getKnownInstancesItemList() {
62 return &mKnownInstancesItemList;
63 }
64
65 QList<COptimizedKPSetConceptInstancesItem*>* COptimizedRepresentativeKPSetConceptSetCacheLabelItemData::getPossibleInstancesItemList() {
66 return &mPossibleInstancesItemList;
67 }
68
69
70 }; // end namespace Realizer
71
72 }; // end namespace Reasoner
73
74 }; // end namespace Konclude