Debian Codegraph @

Source/Reasoner/Kernel/Process/CIndividualNodeRepresentativeMemoryBackendCacheSynchronisationLabelNeighbourExpansionData.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 "CIndividualNodeRepresentativeMemoryBackendCacheSynchronisationLabelNeighbourExpansionData.h"
22
23
24 namespace Konclude {
25
26 namespace Reasoner {
27
28 namespace Kernel {
29
30 namespace Process {
31
32
33 CIndividualNodeRepresentativeMemoryBackendCacheSynchronisationLabelNeighbourExpansionData::CIndividualNodeRepresentativeMemoryBackendCacheSynchronisationLabelNeighbourExpansionData() {
34 mDelayedRepresentativeExpansion = false;
35 mConceptSetLabel = nullptr;
36 mNeighbourExpansionArrayId = -1;
37 mRepresentativeExpandedIndi = -1;
38 mNextLabelNeighbourExpansionIteratorCursor = -1;
39 mAllLabelNeighbourExpanded = false;
40 mAllLabelNeighbourExpansionScheduled = false;
41 mIndiNode = nullptr;
42 mExpDataLinker = nullptr;
43 }
44
45
46 bool CIndividualNodeRepresentativeMemoryBackendCacheSynchronisationLabelNeighbourExpansionData::isNeighbourLabelDelayedRepresentativeExpansion() {
47 return mDelayedRepresentativeExpansion;
48 }
49
50 CIndividualNodeRepresentativeMemoryBackendCacheSynchronisationLabelNeighbourExpansionData* CIndividualNodeRepresentativeMemoryBackendCacheSynchronisationLabelNeighbourExpansionData::setNeighbourLabelDelayedRepresentativeExpansion(bool delayedRepresentativeExpansion) {
51 mDelayedRepresentativeExpansion = delayedRepresentativeExpansion;
52 return this;
53 }
54
55
56 CBackendRepresentativeMemoryLabelCacheItem* CIndividualNodeRepresentativeMemoryBackendCacheSynchronisationLabelNeighbourExpansionData::getConceptSetLabel() {
57 return mConceptSetLabel;
58 }
59
60 CIndividualNodeRepresentativeMemoryBackendCacheSynchronisationLabelNeighbourExpansionData* CIndividualNodeRepresentativeMemoryBackendCacheSynchronisationLabelNeighbourExpansionData::setConceptSetLabel(CBackendRepresentativeMemoryLabelCacheItem* roleSetLabel) {
61 mConceptSetLabel = roleSetLabel;
62 return this;
63 }
64
65
66 cint64 CIndividualNodeRepresentativeMemoryBackendCacheSynchronisationLabelNeighbourExpansionData::getRepresentativeExpandedIndividual() {
67 return mRepresentativeExpandedIndi;
68 }
69
70 cint64 CIndividualNodeRepresentativeMemoryBackendCacheSynchronisationLabelNeighbourExpansionData::getNeighbourExpansionArrayId() {
71 return mNeighbourExpansionArrayId;
72 }
73
74 cint64 CIndividualNodeRepresentativeMemoryBackendCacheSynchronisationLabelNeighbourExpansionData::getNextLabelNeighbourExpansionIteratorCursor() {
75 return mNextLabelNeighbourExpansionIteratorCursor;
76 }
77
78 bool CIndividualNodeRepresentativeMemoryBackendCacheSynchronisationLabelNeighbourExpansionData::hasAllLabelNeighbourExpanded() {
79 return mAllLabelNeighbourExpanded;
80 }
81 bool CIndividualNodeRepresentativeMemoryBackendCacheSynchronisationLabelNeighbourExpansionData::hasAllLabelNeighbourExpansionScheduled() {
82 return mAllLabelNeighbourExpansionScheduled;
83 }
84
85 CIndividualNodeRepresentativeMemoryBackendCacheSynchronisationLabelNeighbourExpansionData* CIndividualNodeRepresentativeMemoryBackendCacheSynchronisationLabelNeighbourExpansionData::setRepresentativeExpandedIndividual(cint64 expandedIndi) {
86 mRepresentativeExpandedIndi = expandedIndi;
87 return this;
88 }
89
90 CIndividualNodeRepresentativeMemoryBackendCacheSynchronisationLabelNeighbourExpansionData* CIndividualNodeRepresentativeMemoryBackendCacheSynchronisationLabelNeighbourExpansionData::setNextLabelNeighbourExpansionIteratorCursor(cint64 cursor) {
91 mNextLabelNeighbourExpansionIteratorCursor = cursor;
92 return this;
93 }
94
95 CIndividualNodeRepresentativeMemoryBackendCacheSynchronisationLabelNeighbourExpansionData* CIndividualNodeRepresentativeMemoryBackendCacheSynchronisationLabelNeighbourExpansionData::setNeighbourExpansionArrayId(cint64 arrayId) {
96 mNeighbourExpansionArrayId = arrayId;
97 return this;
98 }
99
100 CIndividualNodeRepresentativeMemoryBackendCacheSynchronisationLabelNeighbourExpansionData* CIndividualNodeRepresentativeMemoryBackendCacheSynchronisationLabelNeighbourExpansionData::setAllLabelNeighbourExpanded(bool allExpanded) {
101 mAllLabelNeighbourExpanded = allExpanded;
102 return this;
103 }
104
105 CIndividualNodeRepresentativeMemoryBackendCacheSynchronisationLabelNeighbourExpansionData* CIndividualNodeRepresentativeMemoryBackendCacheSynchronisationLabelNeighbourExpansionData::setAllLabelNeighbourExpansionScheduled(bool allExpansionScheduled) {
106 mAllLabelNeighbourExpansionScheduled = allExpansionScheduled;
107 return this;
108 }
109
110
111 CIndividualProcessNode* CIndividualNodeRepresentativeMemoryBackendCacheSynchronisationLabelNeighbourExpansionData::getExpandingIndividiaulNode() {
112 return mIndiNode;
113 }
114
115 CIndividualNodeRepresentativeMemoryBackendCacheSynchronisationLabelNeighbourExpansionData* CIndividualNodeRepresentativeMemoryBackendCacheSynchronisationLabelNeighbourExpansionData::setExpandingIndividiaulNode(CIndividualProcessNode* expIndiNode) {
116 mIndiNode = expIndiNode;
117 return this;
118 }
119
120 CBackendNeighbourExpansionQueueDataLinker* CIndividualNodeRepresentativeMemoryBackendCacheSynchronisationLabelNeighbourExpansionData::getExpandingQueueData() {
121 return mExpDataLinker;
122 }
123
124 CIndividualNodeRepresentativeMemoryBackendCacheSynchronisationLabelNeighbourExpansionData* CIndividualNodeRepresentativeMemoryBackendCacheSynchronisationLabelNeighbourExpansionData::setExpandingQueueData(CBackendNeighbourExpansionQueueDataLinker* expQueueData) {
125 mExpDataLinker = expQueueData;
126 return this;
127 }
128
129
130 }; // end namespace Process
131
132 }; // end namespace Kernel
133
134 }; // end namespace Reasoner
135
136 }; // end namespace Konclude