1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
|
/*
* Copyright (C) 2013, 2014, 2015 by the Konclude Developer Team.
*
* This file is part of the reasoning system Konclude.
* For details and support, see <http://konclude.com/>.
*
* Konclude is free software: you can redistribute it and/or modify it under
* the terms of version 2.1 of the GNU Lesser General Public License (LGPL2.1)
* as published by the Free Software Foundation.
*
* You should have received a copy of the GNU Lesser General Public License
* along with Konclude. If not, see <http://www.gnu.org/licenses/>.
*
* Konclude is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. For more
* details, see GNU Lesser General Public License.
*
*/
#include "CReferredIndividualTrackingVector.h"
#include "Reasoner/Kernel/Task/CIncrementalConsistenceTaskData.h"
namespace Konclude {
namespace Reasoner {
namespace Kernel {
using namespace Task;
namespace Process {
CReferredIndividualTrackingVector::CReferredIndividualTrackingVector() {
mIndiTrackCount = 0;
mIndiTrackVector = nullptr;
}
CReferredIndividualTrackingVector::~CReferredIndividualTrackingVector() {
delete [] mIndiTrackVector;
}
CReferredIndividualTrackingVector* CReferredIndividualTrackingVector::initReferredIndividualTrackingVector(cint64 indiCount) {
mIndiTrackVector = new CReferredIndividualTrackingData[indiCount];
mIndiTrackCount = indiCount;
return this;
}
CReferredIndividualTrackingVector* CReferredIndividualTrackingVector::initReferredIndividualTrackingVector(CReferredIndividualTrackingVector* indiTrackVec) {
mIndiTrackCount = indiTrackVec->mIndiTrackCount;
mIndiTrackVector = new CReferredIndividualTrackingData[mIndiTrackCount];
for (cint64 i = 0; i < mIndiTrackCount; ++i) {
CReferredIndividualTrackingData* refIndiTrackData = &indiTrackVec->mIndiTrackVector[i];
CReferredIndividualTrackingData* indiTrackData = &mIndiTrackVector[i];
*indiTrackData = *refIndiTrackData;
}
return this;
}
CReferredIndividualTrackingData* CReferredIndividualTrackingVector::getReferredIndividualTrackingData(cint64 indiID) {
if (indiID >= 0 && indiID < mIndiTrackCount) {
return &mIndiTrackVector[indiID];
}
return nullptr;
}
CReferredIndividualTrackingVector* CReferredIndividualTrackingVector::setIndividualReferred(cint64 indiID) {
CReferredIndividualTrackingData* indTrackData = getReferredIndividualTrackingData(indiID);
if (indTrackData && !indTrackData->isReferred()) {
indTrackData->setReferred();
}
return this;
}
CReferredIndividualTrackingVector* CReferredIndividualTrackingVector::setIndividualReferredAndExtended(cint64 indiID) {
CReferredIndividualTrackingData* indTrackData = getReferredIndividualTrackingData(indiID);
if (indTrackData && (!indTrackData->isExtended() || !indTrackData->isReferred())) {
indTrackData->setReferred();
indTrackData->setExtended();
}
return this;
}
bool CReferredIndividualTrackingVector::mergeGatheredTrackedIndividualDependences(CIndividualDependenceTracking* indiDepTracking) {
CReferredIndividualTrackingVector* mergeRefIndiTrackVec = dynamic_cast<CReferredIndividualTrackingVector*>(indiDepTracking);
if (mergeRefIndiTrackVec) {
if (mergeRefIndiTrackVec->mIndiTrackVector) {
for (cint64 i = 0; i = mergeRefIndiTrackVec->mIndiTrackCount; ++i) {
CReferredIndividualTrackingData* mergeIndiTrackData = &mergeRefIndiTrackVec->mIndiTrackVector[i];
CReferredIndividualTrackingData* indiTrackData = &mIndiTrackVector[i];
if (!indiTrackData->isExtended() && mergeIndiTrackData->isExtended()) {
indiTrackData->setExtended();
}
if (!indiTrackData->isReferred() && mergeIndiTrackData->isReferred()) {
indiTrackData->setReferred();
}
}
}
return true;
}
return false;
}
bool CReferredIndividualTrackingVector::areIndividualsAffected(QSet<cint64>* indirectlyChangedIndividualSet, QSet<cint64>* changedCompatibleSet) {
for (QSet<cint64>::const_iterator it = indirectlyChangedIndividualSet->constBegin(), itEnd = indirectlyChangedIndividualSet->constEnd(); it != itEnd; ++it) {
cint64 indiID(*it);
if (indiID < mIndiTrackCount) {
CReferredIndividualTrackingData* indiTrackData = &mIndiTrackVector[indiID];
if (indiTrackData) {
if (indiTrackData->isExtended()) {
return true;
}
if (indiTrackData->isReferred() && !changedCompatibleSet->contains(indiID)) {
return true;
}
}
}
}
return false;
}
bool CReferredIndividualTrackingVector::areIndividualsAffected(CConsistenceData* consData) {
CIncrementalConsistenceTaskData* incConsTaskData = dynamic_cast<CIncrementalConsistenceTaskData*>(consData);
if (incConsTaskData) {
//QSet<cint64>* indirectlyChangedIndividualSet = incConsTaskData->getIndirectlyChangedNodeSet();
//QSet<cint64>* changedCompatibleSet = incConsTaskData->getChangedCompatibleNodeSet();
//for (QSet<cint64>::const_iterator it = indirectlyChangedIndividualSet->constBegin(), itEnd = indirectlyChangedIndividualSet->constEnd(); it != itEnd; ++it) {
// cint64 indiID(*it);
// if (indiID < mIndiTrackCount) {
// CReferredIndividualTrackingData* indiTrackData = &mIndiTrackVector[indiID];
// if (indiTrackData) {
// if (indiTrackData->isExtended()) {
// CIndividualProcessNode* indiNode = incConsTaskData->getCompletionGraphCachedSatisfiableTask()->getProcessingDataBox()->getIndividualProcessNodeVector()->getData(indiID);
// return true;
// }
// if (indiTrackData->isReferred() && !changedCompatibleSet->contains(indiID)) {
// CIndividualProcessNode* indiNode = incConsTaskData->getCompletionGraphCachedSatisfiableTask()->getProcessingDataBox()->getIndividualProcessNodeVector()->getData(indiID);
// return true;
// }
// }
// }
//}
return areIndividualsAffected(incConsTaskData->getIndirectlyChangedNodeSet(),incConsTaskData->getChangedCompatibleNodeSet());
}
return true;
}
CIndividualDependenceTracking* CReferredIndividualTrackingVector::getCopiedIndividualDependencyTracking() {
CReferredIndividualTrackingVector* indTrackVecCopy = new CReferredIndividualTrackingVector();
indTrackVecCopy->initReferredIndividualTrackingVector(this);
return indTrackVecCopy;
}
cint64 CReferredIndividualTrackingVector::getDependenceSize() {
cint64 depCount = 0;
for (cint64 i = 0; i < mIndiTrackCount; ++i) {
CReferredIndividualTrackingData* indiTrackData = &mIndiTrackVector[i];
if (indiTrackData->isReferred()) {
++depCount;
}
}
return depCount;
}
}; // end namespace Process
}; // end namespace Kernel
}; // end namespace Reasoner
}; // end namespace Konclude
|
