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
|
/*
* 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 "CRepresentativeVariableBindingPathJoiningKeyData.h"
namespace Konclude {
namespace Reasoner {
namespace Kernel {
namespace Process {
CRepresentativeVariableBindingPathJoiningKeyData::CRepresentativeVariableBindingPathJoiningKeyData() {
}
CRepresentativeVariableBindingPathJoiningKeyData* CRepresentativeVariableBindingPathJoiningKeyData::initVariableBindingPathJoiningData(CRepresentativeVariableBindingPathJoiningKeyData* prevJoinData) {
if (prevJoinData) {
mKeyVarBindDesLinker = prevJoinData->mKeyVarBindDesLinker;
mHashValueCalculated = prevJoinData->mHashValueCalculated;
mCalculatedHashValue = prevJoinData->mCalculatedHashValue;
mJoiningKey = prevJoinData->mJoiningKey;
} else {
mKeyVarBindDesLinker = nullptr;
mHashValueCalculated = false;
mCalculatedHashValue = 0;
mJoiningKey = 0;
}
return this;
}
CRepresentativeVariableBindingPathJoiningKeyData* CRepresentativeVariableBindingPathJoiningKeyData::initVariableBindingPathJoiningData(CVariableBindingDescriptor* keyVarBindDesLinker, cint64 joiningKey) {
mJoiningKey = joiningKey;
mKeyVarBindDesLinker = keyVarBindDesLinker;
mHashValueCalculated = false;
mCalculatedHashValue = getCalculatedHashValue();
return this;
}
CVariableBindingDescriptor* CRepresentativeVariableBindingPathJoiningKeyData::getKeyVariableBindingDescriptorLinker() const {
return mKeyVarBindDesLinker;
}
cint64 CRepresentativeVariableBindingPathJoiningKeyData::getJoiningKey() const {
return mJoiningKey;
}
cint64 CRepresentativeVariableBindingPathJoiningKeyData::getCalculatedHashValue() const {
if (!mHashValueCalculated) {
mHashValueCalculated = true;
mCalculatedHashValue = 0;
cint64 multiplier = 13;
for (CVariableBindingDescriptor* linkerIt = mKeyVarBindDesLinker; linkerIt; linkerIt = linkerIt->getNext()) {
CVariableBinding* variableBinding = linkerIt->getVariableBinding();
mCalculatedHashValue += multiplier*(cint64)variableBinding;
multiplier = multiplier*2+1;
}
}
return mCalculatedHashValue;
}
bool CRepresentativeVariableBindingPathJoiningKeyData::isKeyEquivalentTo(const CRepresentativeVariableBindingPathJoiningKeyData& data) const {
if (mJoiningKey != data.mJoiningKey) {
return false;
}
return true;
}
bool CRepresentativeVariableBindingPathJoiningKeyData::isKeyEquivalentTo(CVariableBindingPath* varBindPath) const {
CVariableBindingDescriptor* linkerIt1 = mKeyVarBindDesLinker;
CVariableBindingDescriptor* linkerIt2 = varBindPath->getVariableBindingDescriptorLinker();
while (linkerIt2 && linkerIt1) {
if (linkerIt2->getVariableBinding()->getBindedVariable() < linkerIt1->getVariableBinding()->getBindedVariable()) {
linkerIt2 = linkerIt2->getNext();
} else {
if (linkerIt1->getVariableBinding() != linkerIt2->getVariableBinding()) {
return false;
}
linkerIt1 = linkerIt1->getNext();
linkerIt2 = linkerIt2->getNext();
}
}
if (linkerIt1) {
return false;
}
return true;
}
}; // end namespace Process
}; // end namespace Kernel
}; // end namespace Reasoner
}; // end namespace Konclude
|
