Debian Codegraph @

Source/Reasoner/Realizer/COptimizedKPSetRoleNeighbourInstancesHash.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 "COptimizedKPSetRoleNeighbourInstancesHash.h"
22
23
24 namespace Konclude {
25
26 namespace Reasoner {
27
28 namespace Realizer {
29
30
31 COptimizedKPSetRoleNeighbourInstancesHash::COptimizedKPSetRoleNeighbourInstancesHash() {
32 }
33
34 COptimizedKPSetRoleInstancesData* COptimizedKPSetRoleNeighbourInstancesHash::getRoleSuccessorInstanceItemData(COptimizedKPSetRoleInstancesItem* item, COptimizedKPSetIndividualItem* successorItem, bool create) {
35 if (create) {
36 COptimizedKPSetRoleNeighbourInstancesHashData& hashData = QHash<COptimizedKPSetRoleInstancesItem*, COptimizedKPSetRoleNeighbourInstancesHashData>::operator[](item);
37 return hashData.getRoleSuccessorInstanceItemData(successorItem);
38 } else {
39 COptimizedKPSetRoleNeighbourInstancesHashData hashData = QHash<COptimizedKPSetRoleInstancesItem*, COptimizedKPSetRoleNeighbourInstancesHashData>::value(item);
40 return hashData.getRoleSuccessorInstanceItemData(successorItem);
41 }
42 }
43
44 COptimizedKPSetRoleInstancesData* COptimizedKPSetRoleNeighbourInstancesHash::getRolePredecessorInstanceItemData(COptimizedKPSetRoleInstancesItem* item, COptimizedKPSetIndividualItem* predecessorItem, bool create) {
45 if (create) {
46 COptimizedKPSetRoleNeighbourInstancesHashData& hashData = QHash<COptimizedKPSetRoleInstancesItem*, COptimizedKPSetRoleNeighbourInstancesHashData>::operator[](item);
47 return hashData.getRolePredecessorInstanceItemData(predecessorItem);
48 } else {
49 COptimizedKPSetRoleNeighbourInstancesHashData hashData = QHash<COptimizedKPSetRoleInstancesItem*, COptimizedKPSetRoleNeighbourInstancesHashData>::value(item);
50 return hashData.getRolePredecessorInstanceItemData(predecessorItem);
51 }
52 }
53
54 }; // end namespace Realizer
55
56 }; // end namespace Reasoner
57
58 }; // end namespace Konclude