blob: 731da8b6a721c9d4a1a0217a17fe298bcd4cf285 (
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
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
|
/*
* Copyright (C) 2014 The Android Open Source Project
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package android.hardware.camera2.utils;
/**
* Provide hashing functions using the Modified Bernstein hash
*/
public final class HashCodeHelpers {
/**
* Hash every element uniformly using the Modified Bernstein hash.
*
* <p>Useful to implement a {@link Object#hashCode} for uniformly distributed data.</p>
*
* @param array a non-{@code null} array of integers
*
* @return the numeric hash code
*/
public static int hashCode(int... array) {
if (array == null) {
return 0;
}
/*
* Note that we use 31 here instead of 33 since it's preferred in Effective Java
* and used elsewhere in the runtime (e.g. Arrays#hashCode)
*
* That being said 33 and 31 are nearly identical in terms of their usefulness
* according to http://svn.apache.org/repos/asf/apr/apr/trunk/tables/apr_hash.c
*/
int h = 1;
for (int x : array) {
// Strength reduction; in case the compiler has illusions about divisions being faster
h = ((h << 5) - h) ^ x; // (h * 31) XOR x
}
return h;
}
/**
* Hash every element uniformly using the Modified Bernstein hash.
*
* <p>Useful to implement a {@link Object#hashCode} for uniformly distributed data.</p>
*
* @param array a non-{@code null} array of floats
*
* @return the numeric hash code
*/
public static int hashCode(float... array) {
if (array == null) {
return 0;
}
int h = 1;
for (float f : array) {
int x = Float.floatToIntBits(f);
h = ((h << 5) - h) ^ x; // (h * 31) XOR x
}
return h;
}
/**
* Hash every element uniformly using the Modified Bernstein hash.
*
* <p>Useful to implement a {@link Object#hashCode} for uniformly distributed data.</p>
*
* @param array a non-{@code null} array of objects
*
* @return the numeric hash code
*/
public static <T> int hashCodeGeneric(T... array) {
if (array == null) {
return 0;
}
int h = 1;
for (T o : array) {
int x = (o == null) ? 0 : o.hashCode();
h = ((h << 5) - h) ^ x; // (h * 31) XOR x
}
return h;
}
}
|
