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
|
/*
* 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 "CConceptUnambiguousHasher.h"
namespace Konclude {
namespace Reasoner {
namespace Preprocess {
CConceptUnambiguousHasher::CConceptUnambiguousHasher(CConcept* concept, bool tagRequired) : mConcept(concept),mTagRequired(tagRequired) {
mHashValue = calculateHashValue();
}
cint64 CConceptUnambiguousHasher::calculateHashValue() {
cint64 hashValue = mConcept->getOperatorCode() << 50;
if (mTagRequired) {
hashValue += mConcept->getConceptTag();
} else {
cint64 hashValueExt = ((cint64)mConcept->getRole() << 3)*7;
hashValueExt += ((cint64)mConcept->getNominalIndividual())*13;
hashValueExt += mConcept->getParameter()*23;
hashValue += hashValueExt;
cint64 hashValueOps1 = 0;
cint64 hashValueOps2 = 1;
CSortedNegLinker<CConcept*>* opLinkerIt = mConcept->getOperandList();
while (opLinkerIt) {
hashValueOps1 += ((cint64)opLinkerIt->getData()) << (opLinkerIt->isNegated()+3);
hashValueOps2 *= ((cint64)opLinkerIt->getData()) << (opLinkerIt->isNegated()+3);
opLinkerIt = opLinkerIt->getNext();
}
hashValue += hashValueOps1+hashValueOps2;
}
return hashValue;
}
cint64 CConceptUnambiguousHasher::getConceptHashValue() const {
return mHashValue;
}
bool CConceptUnambiguousHasher::operator==(const CConceptUnambiguousHasher& expressionHasher) const {
if (mHashValue != expressionHasher.getConceptHashValue()) {
return false;
} else {
if (mTagRequired != expressionHasher.mTagRequired) {
return false;
}
if (mConcept->getOperatorCode() != expressionHasher.mConcept->getOperatorCode()) {
return false;
}
if (mTagRequired) {
if (mConcept->getConceptTag() != expressionHasher.mConcept->getConceptTag()) {
return false;
}
} else {
if (mConcept->getRole() != expressionHasher.mConcept->getRole()) {
return false;
}
if (mConcept->getNominalIndividual() != expressionHasher.mConcept->getNominalIndividual()) {
return false;
}
if (mConcept->getParameter() != expressionHasher.mConcept->getParameter()) {
return false;
}
CSortedNegLinker<CConcept*>* opLinker1It = mConcept->getOperandList();
CSortedNegLinker<CConcept*>* opLinker2 = expressionHasher.mConcept->getOperandList();
while (opLinker1It) {
bool foundConcept = false;
CSortedNegLinker<CConcept*>* opLinker2It = opLinker2;
while (opLinker2It && !foundConcept) {
if (opLinker1It->getData() == opLinker2It->getData() && opLinker1It->isNegated() == opLinker2It->isNegated()) {
foundConcept = true;
} else {
opLinker2It = opLinker2It->getNext();
}
}
if (foundConcept) {
if (opLinker2 == opLinker2It) {
opLinker2 = opLinker2->getNext();
}
} else {
return false;
}
opLinker1It = opLinker1It->getNext();
}
}
}
return true;
}
}; // end namespace Preprocess
}; // end namespace Reasoner
}; // end namespace Konclude
|
