Debian Codegraph @

Source/Reasoner/Preprocess/CConceptUnambiguousHasher.h

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 #ifndef KONCLUDE_REASONER_PREPROCESS_CCONCEPTUNAMBIGUOUSHASHER_H
22 #define KONCLUDE_REASONER_PREPROCESS_CCONCEPTUNAMBIGUOUSHASHER_H
23
24
25 // Libraries includes
26 #include <QHash>
27
28 // Namespace includes
29
30
31 // Other includes
32 #include "Reasoner/Ontology/CConcept.h"
33
34 // Logger includes
35 #include "Logger/CLogger.h"
36
37
38
39
40
41 namespace Konclude {
42
43 namespace Reasoner {
44
45 using namespace Ontology;
46
47 namespace Preprocess {
48
49
50 /*!
51 *
52 * \class CConceptUnambiguousHasher
53 * \author Andreas Steigmiller
54 * \version 0.1
55 * \brief TODO
56 *
57 */
58 class CConceptUnambiguousHasher {
59 // public methods
60 public:
61 //! Constructor
62 CConceptUnambiguousHasher(CConcept* concept, bool tagRequired);
63
64 cint64 getConceptHashValue() const;
65
66 bool operator==(const CConceptUnambiguousHasher& expressionHasher) const;
67
68 // protected methods
69 protected:
70 cint64 calculateHashValue();
71
72 // protected variables
73 protected:
74 CConcept* mConcept;
75 cint64 mHashValue;
76 bool mTagRequired;
77
78 // private methods
79 private:
80
81 // private variables
82 private:
83
84 };
85
86 inline uint qHash(const CConceptUnambiguousHasher& expressionHasher) {
87 qint64 key = (qint64)expressionHasher.getConceptHashValue();
88 if (sizeof(quint64) > sizeof(uint)) {
89 return uint((key >> (8 * sizeof(uint) - 1)) ^ key);
90 } else {
91 return uint(key);
92 }
93 }
94
95
96 }; // end namespace Preprocess
97
98 }; // end namespace Reasoner
99
100 }; // end namespace Konclude
101
102 #endif // end KONCLUDE_REASONER_PREPROCESS_CCONCEPTUNAMBIGUOUSHASHER_H