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
|
/*
* Copyright (C) 2013-2015, 2019 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 3 of the GNU Lesser General Public
* License (LGPLv3) as published by the Free Software Foundation.
*
* 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. See the
* GNU (Lesser) General Public License for more details.
*
* You should have received a copy of the GNU (Lesser) General Public
* License along with Konclude. If not, see <http://www.gnu.org/licenses/>.
*
*/
#ifdef KONCLUDE_REDLAND_INTEGRATION
#ifndef KONCLUDE_REASONER_TRIPLES_CREDLANDNODEHASHER_H
#define KONCLUDE_REASONER_TRIPLES_CREDLANDNODEHASHER_H
// Libraries includes
#include <QHash>
#include <librdf.h>
// Namespace includes
#include "TriplesSettings.h"
// Other includes
#include "Utilities/UtilitiesSettings.h"
// Logger includes
#include "Logger/CLogger.h"
namespace Konclude {
using namespace Utilities;
namespace Reasoner {
namespace Triples {
/*!
*
* \class CRedlandNodeHasher
* \author Andreas Steigmiller
* \version 0.1
* \brief TODO
*
*/
class CRedlandNodeHasher {
// public methods
public:
//! Constructor
CRedlandNodeHasher(librdf_node* node);
CRedlandNodeHasher(const CRedlandNodeHasher& hasher);
~CRedlandNodeHasher();
CRedlandNodeHasher& operator=(const CRedlandNodeHasher& hasher);
librdf_node* getRedlandNode() const;
cint64 getNodeHashValue() const {
return mHashValue;
}
bool operator==(const CRedlandNodeHasher& nodeHasher) const {
if (mHashValue != nodeHasher.getNodeHashValue()) {
return false;
}
if (!librdf_node_equals(mNode, nodeHasher.mNode)) {
return false;
}
return true;
}
cint64 hash_c_string(const char* p) {
cint64 result = 0;
const cint64 prime = 31;
for (cint64 i = 0; p[i] != 0; ++i) {
result = p[i] + (result * prime);
}
return result;
}
// protected methods
protected:
// protected variables
protected:
librdf_node* mNode;
cint64 mHashValue;
// private methods
private:
// private variables
private:
};
inline uint qHash(const CRedlandNodeHasher& nodeHasher) {
qint64 key = (qint64)nodeHasher.getNodeHashValue();
if (sizeof(quint64) > sizeof(uint)) {
return uint((key >> (8 * sizeof(uint) - 1)) ^ key);
} else {
return uint(key);
}
}
}; // end namespace Triples
}; // end namespace Reasoner
}; // end namespace Konclude
#endif // KONCLUDE_REASONER_TRIPLES_CREDLANDNODEHASHER_H
#endif // !KONCLUDE_REDLAND_INTEGRATION
|
