Debian Codegraph @

Source/Reasoner/Kernel/Process/CReferredIndividualTrackingVector.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 "CReferredIndividualTrackingVector.h"
22
23 #include "Reasoner/Kernel/Task/CIncrementalConsistenceTaskData.h"
24
25
26 namespace Konclude {
27
28 namespace Reasoner {
29
30 namespace Kernel {
31
32 using namespace Task;
33
34 namespace Process {
35
36
37 CReferredIndividualTrackingVector::CReferredIndividualTrackingVector() {
38 mIndiTrackCount = 0;
39 mIndiTrackOffset = 0;
40 mIndiTrackVector = nullptr;
41 }
42 CReferredIndividualTrackingVector::~CReferredIndividualTrackingVector() {
43 delete [] mIndiTrackVector;
44 }
45
46 CReferredIndividualTrackingVector* CReferredIndividualTrackingVector::initReferredIndividualTrackingVector(cint64 indiCount, cint64 indiOffset) {
47 mIndiTrackVector = new CReferredIndividualTrackingData[indiCount];
48 mIndiTrackCount = indiCount;
49 mIndiTrackOffset = indiOffset;
50 return this;
51 }
52
53 CReferredIndividualTrackingVector* CReferredIndividualTrackingVector::initReferredIndividualTrackingVector(CReferredIndividualTrackingVector* indiTrackVec) {
54 mIndiTrackCount = indiTrackVec->mIndiTrackCount;
55 mIndiTrackVector = new CReferredIndividualTrackingData[mIndiTrackCount];
56 for (cint64 i = 0; i < mIndiTrackCount; ++i) {
57 CReferredIndividualTrackingData* refIndiTrackData = &indiTrackVec->mIndiTrackVector[i];
58 CReferredIndividualTrackingData* indiTrackData = &mIndiTrackVector[i];
59 *indiTrackData = *refIndiTrackData;
60 }
61 return this;
62 }
63
64
65 CReferredIndividualTrackingData* CReferredIndividualTrackingVector::getReferredIndividualTrackingData(cint64 indiID) {
66 cint64 correctedIndiID = indiID+mIndiTrackOffset;
67 if (correctedIndiID >= 0 && correctedIndiID < mIndiTrackCount) {
68 return &mIndiTrackVector[correctedIndiID];
69 }
70 return nullptr;
71 }
72
73 CReferredIndividualTrackingVector* CReferredIndividualTrackingVector::setIndividualReferred(cint64 indiID) {
74 CReferredIndividualTrackingData* indTrackData = getReferredIndividualTrackingData(indiID+mIndiTrackOffset);
75 if (indTrackData && !indTrackData->isReferred()) {
76 indTrackData->setReferred();
77 }
78 return this;
79 }
80
81 CReferredIndividualTrackingVector* CReferredIndividualTrackingVector::setIndividualReferredAndExtended(cint64 indiID) {
82 CReferredIndividualTrackingData* indTrackData = getReferredIndividualTrackingData(indiID+mIndiTrackOffset);
83 if (indTrackData && (!indTrackData->isExtended() || !indTrackData->isReferred())) {
84 indTrackData->setReferred();
85 indTrackData->setExtended();
86 }
87 return this;
88 }
89
90
91 bool CReferredIndividualTrackingVector::mergeGatheredTrackedIndividualDependences(CIndividualDependenceTracking* indiDepTracking) {
92 CReferredIndividualTrackingVector* mergeRefIndiTrackVec = dynamic_cast<CReferredIndividualTrackingVector*>(indiDepTracking);
93 if (mergeRefIndiTrackVec) {
94 if (mergeRefIndiTrackVec->mIndiTrackVector) {
95 for (cint64 i = 0; i = mergeRefIndiTrackVec->mIndiTrackCount; ++i) {
96 CReferredIndividualTrackingData* mergeIndiTrackData = &mergeRefIndiTrackVec->mIndiTrackVector[i];
97 CReferredIndividualTrackingData* indiTrackData = &mIndiTrackVector[i];
98 if (!indiTrackData->isExtended() && mergeIndiTrackData->isExtended()) {
99 indiTrackData->setExtended();
100 }
101 if (!indiTrackData->isReferred() && mergeIndiTrackData->isReferred()) {
102 indiTrackData->setReferred();
103 }
104 }
105 }
106 return true;
107 }
108 return false;
109 }
110
111 bool CReferredIndividualTrackingVector::areIndividualsAffected(QSet<cint64>* indirectlyChangedIndividualSet, QSet<cint64>* changedCompatibleSet) {
112 for (QSet<cint64>::const_iterator it = indirectlyChangedIndividualSet->constBegin(), itEnd = indirectlyChangedIndividualSet->constEnd(); it != itEnd; ++it) {
113 cint64 indiID(*it);
114 if (indiID+mIndiTrackOffset < mIndiTrackCount) {
115 CReferredIndividualTrackingData* indiTrackData = &mIndiTrackVector[indiID+mIndiTrackOffset];
116 if (indiTrackData) {
117 if (indiTrackData->isExtended()) {
118 return true;
119 }
120 if (indiTrackData->isReferred() && !changedCompatibleSet->contains(indiID+mIndiTrackOffset)) {
121 return true;
122 }
123 }
124 }
125 }
126 return false;
127 }
128
129
130
131 bool CReferredIndividualTrackingVector::areIndividualsAffected(CConsistenceData* consData) {
132 CIncrementalConsistenceTaskData* incConsTaskData = dynamic_cast<CIncrementalConsistenceTaskData*>(consData);
133 if (incConsTaskData) {
134 //QSet<cint64>* indirectlyChangedIndividualSet = incConsTaskData->getIndirectlyChangedNodeSet();
135 //QSet<cint64>* changedCompatibleSet = incConsTaskData->getChangedCompatibleNodeSet();
136 //for (QSet<cint64>::const_iterator it = indirectlyChangedIndividualSet->constBegin(), itEnd = indirectlyChangedIndividualSet->constEnd(); it != itEnd; ++it) {
137 // cint64 indiID(*it);
138 // if (indiID+mIndiTrackOffset < mIndiTrackCount) {
139 // CReferredIndividualTrackingData* indiTrackData = &mIndiTrackVector[indiID+mIndiTrackOffset];
140 // if (indiTrackData) {
141 // if (indiTrackData->isExtended()) {
142 // CIndividualProcessNode* indiNode = incConsTaskData->getCompletionGraphCachedSatisfiableTask()->getProcessingDataBox()->getIndividualProcessNodeVector()->getData(indiID+mIndiTrackOffset);
143 // return true;
144 // }
145 // if (indiTrackData->isReferred() && !changedCompatibleSet->contains(indiID+mIndiTrackOffset)) {
146 // CIndividualProcessNode* indiNode = incConsTaskData->getCompletionGraphCachedSatisfiableTask()->getProcessingDataBox()->getIndividualProcessNodeVector()->getData(indiID+mIndiTrackOffset);
147 // return true;
148 // }
149 // }
150 // }
151 //}
152 return areIndividualsAffected(incConsTaskData->getIndirectlyChangedNodeSet(),incConsTaskData->getChangedCompatibleNodeSet());
153 }
154 return true;
155 }
156
157
158 CIndividualDependenceTracking* CReferredIndividualTrackingVector::getCopiedIndividualDependencyTracking() {
159 CReferredIndividualTrackingVector* indTrackVecCopy = new CReferredIndividualTrackingVector();
160 indTrackVecCopy->initReferredIndividualTrackingVector(this);
161 return indTrackVecCopy;
162 }
163
164 cint64 CReferredIndividualTrackingVector::getDependenceSize() {
165 cint64 depCount = 0;
166 for (cint64 i = 0; i < mIndiTrackCount; ++i) {
167 CReferredIndividualTrackingData* indiTrackData = &mIndiTrackVector[i];
168 if (indiTrackData->isReferred()) {
169 ++depCount;
170 }
171 }
172 return depCount;
173 }
174
175 }; // end namespace Process
176
177 }; // end namespace Kernel
178
179 }; // end namespace Reasoner
180
181 }; // end namespace Konclude