Debian Codegraph @

Source/Reasoner/Kernel/Cache/CBackendRepresentativeMemoryLabelCacheItemIndividualAssociationMapExtensionData.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 "CBackendRepresentativeMemoryLabelCacheItemIndividualAssociationMapExtensionData.h"
22
23
24 namespace Konclude {
25
26 namespace Reasoner {
27
28 namespace Kernel {
29
30 namespace Cache {
31
32
33 CBackendRepresentativeMemoryLabelCacheItemIndividualAssociationMapExtensionData::CBackendRepresentativeMemoryLabelCacheItemIndividualAssociationMapExtensionData(CContext* context) : CBackendRepresentativeMemoryLabelCacheItemExtensionData(context) {
34 mCacheItemExtensionType = INDIVIDUAL_ASSOCIATION_MAP;
35 }
36
37
38
39 CBackendRepresentativeMemoryLabelCacheItemIndividualAssociationMapExtensionData* CBackendRepresentativeMemoryLabelCacheItemIndividualAssociationMapExtensionData::addIndividualIdAssociation(CBackendRepresentativeMemoryCacheIndividualAssociationData* indiAssocData) {
40 return addIndividualIdAssociation(indiAssocData->getAssociatedIndividualId(), indiAssocData->hasRepresentativeSameIndividualMerging());
41 }
42
43 CBackendRepresentativeMemoryLabelCacheItemIndividualAssociationMapExtensionData* CBackendRepresentativeMemoryLabelCacheItemIndividualAssociationMapExtensionData::removeIndividualIdAssociation(CBackendRepresentativeMemoryCacheIndividualAssociationData* indiAssocData) {
44 return removeIndividualIdAssociation(indiAssocData->getAssociatedIndividualId(), indiAssocData->hasRepresentativeSameIndividualMerging());
45 }
46
47
48 CBackendRepresentativeMemoryLabelCacheItemIndividualAssociationMapExtensionData* CBackendRepresentativeMemoryLabelCacheItemIndividualAssociationMapExtensionData::addIndividualIdAssociation(cint64 indiId, bool sameIndividualMerged) {
49 if (!sameIndividualMerged) {
50 mBaseIndiAssoMap.insert(indiId, DummyValue());
51 } else {
52 mSameIndiMergedAssoMap.insert(indiId, DummyValue());
53 }
54 return this;
55 }
56
57 CBackendRepresentativeMemoryLabelCacheItemIndividualAssociationMapExtensionData* CBackendRepresentativeMemoryLabelCacheItemIndividualAssociationMapExtensionData::removeIndividualIdAssociation(cint64 indiId, bool sameIndividualMerged) {
58 if (!sameIndividualMerged) {
59 mBaseIndiAssoMap.remove(indiId);
60 } else {
61 mSameIndiMergedAssoMap.remove(indiId);
62 }
63 return this;
64 }
65
66
67 cint64 CBackendRepresentativeMemoryLabelCacheItemIndividualAssociationMapExtensionData::getIndividualIdAssociationCount() {
68 return mBaseIndiAssoMap.size() + mSameIndiMergedAssoMap.size();
69 }
70
71
72 bool CBackendRepresentativeMemoryLabelCacheItemIndividualAssociationMapExtensionData::visitIndividualIdAssociationsAscending(function<bool(cint64 indiId, bool sameIndividualMerged)> visitFunc, bool visitBaseIndividuals, bool visitSameMergedIndividuals) {
73 bool visited = false;
74 bool continueVisiting = true;
75
76 QMap<cint64, DummyValue>::const_iterator itBase = mBaseIndiAssoMap.constBegin(), itBaseEnd = mBaseIndiAssoMap.constEnd();
77 QMap<cint64, DummyValue>::const_iterator itMerged = mSameIndiMergedAssoMap.constBegin(), itMergedEnd = mSameIndiMergedAssoMap.constEnd();
78
79 if (!visitBaseIndividuals) {
80 itBase = itBaseEnd;
81 }
82 if (visitSameMergedIndividuals) {
83 itMerged = itMergedEnd;
84 }
85
86
87 while (itBase != itBaseEnd || itMerged != itMergedEnd) {
88 cint64 nextIndiId = -1;
89 bool mergedIndi = false;
90 if (itBase == itBaseEnd) {
91 nextIndiId = itMerged.key();
92 ++itMerged;
93 mergedIndi = true;
94 } else if (itMerged == itMergedEnd) {
95 nextIndiId = itBase.key();
96 ++itBase;
97 } else {
98 if (itBase.key() < itMerged.key()) {
99 nextIndiId = itBase.key();
100 ++itBase;
101 } else {
102 nextIndiId = itMerged.key();
103 ++itMerged;
104 mergedIndi = true;
105 }
106 }
107 continueVisiting = visitFunc(nextIndiId, mergedIndi);
108 visited = true;
109 }
110
111 return visited;
112 }
113
114
115 bool CBackendRepresentativeMemoryLabelCacheItemIndividualAssociationMapExtensionData::visitIndividualIdAssociationsDescending(function<bool(cint64 indiId, bool sameIndividualMerged)> visitFunc, bool visitBaseIndividuals, bool visitSameMergedIndividuals) {
116 bool visited = false;
117 bool continueVisiting = true;
118
119 QMapIterator<cint64, DummyValue> baseReverseIt(mBaseIndiAssoMap);
120 QMapIterator<cint64, DummyValue> sameReverseIt(mSameIndiMergedAssoMap);
121
122 baseReverseIt.toBack();
123 sameReverseIt.toBack();
124
125 if (visitBaseIndividuals) {
126 baseReverseIt.toBack();
127 }
128 if (visitSameMergedIndividuals) {
129 sameReverseIt.toBack();
130 }
131
132 while (baseReverseIt.hasPrevious() || sameReverseIt.hasPrevious()) {
133 cint64 nextIndiId = -1;
134 bool mergedIndi = false;
135 if (!baseReverseIt.hasPrevious()) {
136 nextIndiId = sameReverseIt.previous().key();
137 mergedIndi = true;
138 } else if (!sameReverseIt.hasPrevious()) {
139 nextIndiId = baseReverseIt.previous().key();
140 } else {
141 if (baseReverseIt.peekPrevious().key() < sameReverseIt.peekPrevious().key()) {
142 nextIndiId = sameReverseIt.previous().key();
143 mergedIndi = true;
144 } else {
145 nextIndiId = baseReverseIt.previous().key();
146 }
147 }
148 continueVisiting = visitFunc(nextIndiId, mergedIndi);
149 visited = true;
150 }
151
152 return visited;
153 }
154
155
156 bool CBackendRepresentativeMemoryLabelCacheItemIndividualAssociationMapExtensionData::visitIndividualIdAssociations(function<bool(cint64 indiId, bool sameIndividualMerged)> visitFunc, bool ascending, bool visitBaseIndividuals, bool visitSameMergedIndividuals) {
157 if (ascending) {
158 return visitIndividualIdAssociationsAscending(visitFunc, visitBaseIndividuals, visitSameMergedIndividuals);
159 } else {
160 return visitIndividualIdAssociationsDescending(visitFunc, visitBaseIndividuals, visitSameMergedIndividuals);
161 }
162 }
163
164
165 CBackendRepresentativeMemoryLabelCacheItemIndividualAssociationMapIterator CBackendRepresentativeMemoryLabelCacheItemIndividualAssociationMapExtensionData::getIterator(bool ascending, bool visitBaseIndividuals, bool visitSameMergedIndividuals) {
166
167 QMap<cint64, DummyValue>::const_iterator baseIndiAssoMapItBegin = mBaseIndiAssoMap.constEnd();
168 QMap<cint64, DummyValue>::const_iterator baseIndiAssoMapItEnd = mBaseIndiAssoMap.constEnd();
169 if (visitBaseIndividuals && !mBaseIndiAssoMap.isEmpty()) {
170 baseIndiAssoMapItBegin = mBaseIndiAssoMap.constBegin();
171 }
172
173 QMap<cint64, DummyValue>::const_iterator sameIndiMergedAssoMapItBegin = mSameIndiMergedAssoMap.constEnd();
174 QMap<cint64, DummyValue>::const_iterator sameIndiMergedAssoMapItEnd = mSameIndiMergedAssoMap.constEnd();
175 if (visitSameMergedIndividuals && !mSameIndiMergedAssoMap.isEmpty()) {
176 sameIndiMergedAssoMapItBegin = mSameIndiMergedAssoMap.constBegin();
177 }
178
179 return CBackendRepresentativeMemoryLabelCacheItemIndividualAssociationMapIterator(baseIndiAssoMapItBegin, baseIndiAssoMapItEnd, sameIndiMergedAssoMapItBegin, sameIndiMergedAssoMapItEnd, ascending);
180 }
181
182
183 CBackendRepresentativeMemoryLabelCacheItemIndividualAssociationMapIterator CBackendRepresentativeMemoryLabelCacheItemIndividualAssociationMapExtensionData::getIterator(cint64 cursorId, bool moveOverCursor, bool ascending, bool visitBaseIndividuals, bool visitSameMergedIndividuals) {
184
185 QMap<cint64, DummyValue>::const_iterator baseIndiAssoMapItBegin = mBaseIndiAssoMap.constEnd();
186 QMap<cint64, DummyValue>::const_iterator baseIndiAssoMapItEnd = mBaseIndiAssoMap.constEnd();
187 if (visitBaseIndividuals && !mBaseIndiAssoMap.isEmpty()) {
188 if (ascending) {
189 if (moveOverCursor) {
190 baseIndiAssoMapItBegin = mBaseIndiAssoMap.upperBound(cursorId);
191 } else {
192 baseIndiAssoMapItBegin = mBaseIndiAssoMap.lowerBound(cursorId);
193 }
194 } else {
195 if (moveOverCursor) {
196 baseIndiAssoMapItEnd = mBaseIndiAssoMap.lowerBound(cursorId);
197 } else {
198 baseIndiAssoMapItEnd = mBaseIndiAssoMap.upperBound(cursorId);
199 }
200 }
201 }
202
203 QMap<cint64, DummyValue>::const_iterator sameIndiMergedAssoMapItBegin = mSameIndiMergedAssoMap.constEnd();
204 QMap<cint64, DummyValue>::const_iterator sameIndiMergedAssoMapItEnd = mSameIndiMergedAssoMap.constEnd();
205 if (visitSameMergedIndividuals && !mSameIndiMergedAssoMap.isEmpty()) {
206 if (ascending) {
207 if (moveOverCursor) {
208 sameIndiMergedAssoMapItBegin = mSameIndiMergedAssoMap.upperBound(cursorId);
209 } else {
210 sameIndiMergedAssoMapItBegin = mSameIndiMergedAssoMap.lowerBound(cursorId);
211 }
212 } else {
213 if (moveOverCursor) {
214 sameIndiMergedAssoMapItEnd = mSameIndiMergedAssoMap.lowerBound(cursorId);
215 } else {
216 sameIndiMergedAssoMapItEnd = mSameIndiMergedAssoMap.upperBound(cursorId);
217 }
218 }
219 }
220
221 return CBackendRepresentativeMemoryLabelCacheItemIndividualAssociationMapIterator(baseIndiAssoMapItBegin, baseIndiAssoMapItEnd, sameIndiMergedAssoMapItBegin, sameIndiMergedAssoMapItEnd, ascending);
222 }
223
224 }; // end namespace Cache
225
226 }; // end namespace Kernel
227
228 }; // end namespace Reasoner
229
230 }; // end namespace Konclude