blob: b25ca1344bcf24d12765f9dcebd89af1cd70d662 (
plain)
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
|
// **********************************************************************
//
// Copyright (c) 2003-2016 ZeroC, Inc. All rights reserved.
//
// This copy of Ice is licensed to you under the terms described in the
// ICE_LICENSE file included in this distribution.
//
// **********************************************************************
#ifndef ICE_HASH_UTIL_H
#define ICE_HASH_UTIL_H
namespace IceInternal
{
inline void
hashAdd(Ice::Int& hashCode, Ice::Int value)
{
hashCode = ((hashCode << 5) + hashCode) ^ (2654435761u * value);
}
inline void
hashAdd(Ice::Int& hashCode, bool value)
{
hashCode = ((hashCode << 5) + hashCode) ^ (value ? 1 : 0);
}
inline void
hashAdd(Ice::Int& hashCode, const std::string& value)
{
for(std::string::const_iterator p = value.begin(); p != value.end(); ++p)
{
hashCode = ((hashCode << 5) + hashCode) ^ *p;
}
}
template<typename T> void
hashAdd(Ice::Int& hashCode, const std::vector<T>& seq)
{
for(typename std::vector<T>::const_iterator p = seq.begin(); p != seq.end(); ++p)
{
hashAdd(hashCode, *p);
}
}
template<typename K, typename V> void
hashAdd(Ice::Int& hashCode, const std::map<K, V>& map)
{
for(typename std::map<K, V>::const_iterator p = map.begin(); p != map.end(); ++p)
{
hashAdd(hashCode, p->first);
hashAdd(hashCode, p->second);
}
}
}
#endif
|