Debian Codegraph @

Source/Reasoner/Realizer/COptimizedRepresentativeKPSetCombinedExistentialRoleSetCacheLabelItemData.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 "COptimizedRepresentativeKPSetCombinedExistentialRoleSetCacheLabelItemData.h"
22
23
24 namespace Konclude {
25
26 namespace Reasoner {
27
28 namespace Realizer {
29
30
31 COptimizedRepresentativeKPSetCombinedExistentialRoleSetCacheLabelItemData::COptimizedRepresentativeKPSetCombinedExistentialRoleSetCacheLabelItemData(CBackendRepresentativeMemoryLabelCacheItem* combinedExistentialRoleLabelCacheItem) {
32 mCombinedExistentialRoleLabelCacheItem = combinedExistentialRoleLabelCacheItem;
33 mNondeterministic = false;
34 }
35
36
37 bool COptimizedRepresentativeKPSetCombinedExistentialRoleSetCacheLabelItemData::isNondeterministic() {
38 return mNondeterministic;
39 }
40
41
42 CBackendRepresentativeMemoryLabelCacheItem* COptimizedRepresentativeKPSetCombinedExistentialRoleSetCacheLabelItemData::getCombinedNeighbourRoleLabelCacheItem() {
43 return mCombinedExistentialRoleLabelCacheItem;
44 }
45
46
47 COptimizedRepresentativeKPSetCombinedExistentialRoleSetCacheLabelItemData* COptimizedRepresentativeKPSetCombinedExistentialRoleSetCacheLabelItemData::setNondeterministic(bool possibleInstances) {
48 mNondeterministic = possibleInstances;
49 return this;
50 }
51
52
53
54 QSet<COptimizedKPSetRoleInstancesItem*>* COptimizedRepresentativeKPSetCombinedExistentialRoleSetCacheLabelItemData::getComplexCandiateInstancesItemSet(bool inverse) {
55 if (inverse) {
56 return &mInverseComplexCandiateInstancesItemSet;
57 } else {
58 return &mComplexCandiateInstancesItemSet;
59 }
60 }
61
62 COptimizedRepresentativeKPSetCombinedExistentialRoleSetCacheLabelItemData* COptimizedRepresentativeKPSetCombinedExistentialRoleSetCacheLabelItemData::addComplexCandiateInstancesItem(COptimizedKPSetRoleInstancesItem* roleItem, bool inverse) {
63 if (inverse) {
64 mInverseComplexCandiateInstancesItemSet.insert(roleItem);
65 } else {
66 mComplexCandiateInstancesItemSet.insert(roleItem);
67 }
68 return this;
69 }
70
71
72
73 bool COptimizedRepresentativeKPSetCombinedExistentialRoleSetCacheLabelItemData::hasComplexCandiateInstancesItems() {
74 return !mComplexCandiateInstancesItemSet.isEmpty() || !mInverseComplexCandiateInstancesItemSet.isEmpty();
75 }
76
77
78 }; // end namespace Realizer
79
80 }; // end namespace Reasoner
81
82 }; // end namespace Konclude