Debian Codegraph @

Source/Reasoner/Realizer/COptimizedKPSetRoleInstancesCombinedNeighbourRoleSetCacheLabelData.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 "COptimizedKPSetRoleInstancesCombinedNeighbourRoleSetCacheLabelData.h"
22
23
24 namespace Konclude {
25
26 namespace Reasoner {
27
28 namespace Realizer {
29
30
31 COptimizedKPSetRoleInstancesCombinedNeighbourRoleSetCacheLabelData::COptimizedKPSetRoleInstancesCombinedNeighbourRoleSetCacheLabelData() {
32 }
33
34
35 QHash<CBackendRepresentativeMemoryLabelCacheItem*, COptimizedKPSetRoleInstancesSingleNeighbourRoleSetCacheLabelData*>* COptimizedKPSetRoleInstancesCombinedNeighbourRoleSetCacheLabelData::getKnownInstancesLabelItemDataHash() {
36 return &mKnownInstancesLabelItemsData;
37 }
38
39 QHash<CBackendRepresentativeMemoryLabelCacheItem*, COptimizedKPSetRoleInstancesSingleNeighbourRoleSetCacheLabelData*>* COptimizedKPSetRoleInstancesCombinedNeighbourRoleSetCacheLabelData::getPossibleInstancesLabelItemDataHash() {
40 return &mPossibleInstancesLabelItemsData;
41 }
42
43
44 COptimizedKPSetRoleInstancesCombinedNeighbourRoleSetCacheLabelData* COptimizedKPSetRoleInstancesCombinedNeighbourRoleSetCacheLabelData::addKnownInstancesLabelItemData(COptimizedKPSetRoleInstancesSingleNeighbourRoleSetCacheLabelData* labelItemData) {
45 mKnownInstancesLabelItemsData.insert(labelItemData->getSingleNeighbourRoleSetCacheLabelItem(), labelItemData);
46 return this;
47 }
48
49 COptimizedKPSetRoleInstancesCombinedNeighbourRoleSetCacheLabelData* COptimizedKPSetRoleInstancesCombinedNeighbourRoleSetCacheLabelData::addPossibleInstancesLabelItemData(COptimizedKPSetRoleInstancesSingleNeighbourRoleSetCacheLabelData* labelItemData) {
50 mPossibleInstancesLabelItemsData.insert(labelItemData->getSingleNeighbourRoleSetCacheLabelItem(), labelItemData);
51 return this;
52 }
53
54 bool COptimizedKPSetRoleInstancesCombinedNeighbourRoleSetCacheLabelData::hasKnownInstancesLabelItems() {
55 return !mKnownInstancesLabelItemsData.isEmpty();
56 }
57
58 bool COptimizedKPSetRoleInstancesCombinedNeighbourRoleSetCacheLabelData::hasPossibleInstancesLabelItems() {
59 return !mPossibleInstancesLabelItemsData.isEmpty();
60 }
61
62 bool COptimizedKPSetRoleInstancesCombinedNeighbourRoleSetCacheLabelData::hasKnownInstancesLabelItem(CBackendRepresentativeMemoryLabelCacheItem* cacheLabelItem) {
63 return mKnownInstancesLabelItemsData.contains(cacheLabelItem);
64 }
65
66 bool COptimizedKPSetRoleInstancesCombinedNeighbourRoleSetCacheLabelData::hasPossibleInstancesLabelItem(CBackendRepresentativeMemoryLabelCacheItem* cacheLabelItem) {
67 return mPossibleInstancesLabelItemsData.contains(cacheLabelItem);
68 }
69
70
71 }; // end namespace Realizer
72
73 }; // end namespace Reasoner
74
75 }; // end namespace Konclude