Java之——Hash算法大全

https://blog.csdn.net/l1028386804/article/details/54573106

转载请注明出处：http://blog.csdn.net/l1028386804/article/details/54573106

实际工作过程中，要用到各种各样的Hash算法，今天就给大家带来一篇基于java实现的各类Hash算法，其他语言本质上是一样的，大家可以拿来做个参考，好了，不多说了，我们直接上代码

1. package com.lyz.hash;
3. /**
4.  * Hash算法大全<br>
5.  * 推荐使用FNV1算法
6.  * @author liuyazhuang
7.  */
8. public class HashAlgorithms {
9. /**
10.         * 加法hash
11.         *
12.         * @param key
13.         *            字符串
14.         * @param prime
15.         *            一个质数
16.         * @return hash结果
17.         */
18.        public static int additiveHash(String key, int prime) {
19.               int hash, i;
20.               for (hash = key.length(), i = 0; i < key.length(); i++)
21.                      hash += key.charAt(i);
22.               return (hash % prime);
23.        }
25.        /**
26.         * 旋转hash
27.         *
28.         * @param key
29.         *            输入字符串
30.         * @param prime
31.         *            质数
32.         * @return hash值
33.         */
34.        public static int rotatingHash(String key, int prime) {
35.               int hash, i;
36.               for (hash = key.length(), i = 0; i < key.length(); ++i)
37.                      hash = (hash << 4) ^ (hash >> 28) ^ key.charAt(i);
38.               return (hash % prime);
39.               // return (hash ^ (hash>>10) ^ (hash>>20));
40.        }
41.        // 替代：
42.        // 使用：hash = (hash ^ (hash>>10) ^ (hash>>20)) & mask;
43.        // 替代：hash %= prime;
45.        /**
46.         * MASK值，随便找一个值，最好是质数
47.         */
48.        static int M_MASK = 0x8765fed1;
50.        /**
51.         * 一次一个hash
52.         *
53.         * @param key
54.         *            输入字符串
55.         * @return 输出hash值
56.         */
57.        public static int oneByOneHash(String key) {
58.               int hash, i;
59.               for (hash = 0, i = 0; i < key.length(); ++i) {
60.                      hash += key.charAt(i);
61.                      hash += (hash << 10);
62.                      hash ^= (hash >> 6);
63.               }
64.               hash += (hash << 3);
65.               hash ^= (hash >> 11);
66.               hash += (hash << 15);
67.               // return (hash & M_MASK);
68.               return hash;
69.        }
71.        /**
72.         * Bernstein's hash
73.         *
74.         * @param key
75.         *            输入字节数组
76.         * @param level
77.         *            初始hash常量
78.         * @return 结果hash
79.         */
80.        public static int bernstein(String key) {
81.               int hash = 0;
82.               int i;
83.               for (i = 0; i < key.length(); ++i)
84.                      hash = 33 * hash + key.charAt(i);
85.               return hash;
86.        }
88.        /**
89.         * Universal Hashing
90.         */
91.        public static int universal(char[] key, int mask, int[] tab) {
92.               int hash = key.length, i, len = key.length;
93.               for (i = 0; i < (len << 3); i += 8) {
94.                      char k = key[i >> 3];
95.                      if ((k & 0x01) == 0)
96.                             hash ^= tab[i + 0];
97.                      if ((k & 0x02) == 0)
98.                             hash ^= tab[i + 1];
99.                      if ((k & 0x04) == 0)
100.                             hash ^= tab[i + 2];
101.                      if ((k & 0x08) == 0)
102.                             hash ^= tab[i + 3];
103.                      if ((k & 0x10) == 0)
104.                             hash ^= tab[i + 4];
105.                      if ((k & 0x20) == 0)
106.                             hash ^= tab[i + 5];
107.                      if ((k & 0x40) == 0)
108.                             hash ^= tab[i + 6];
109.                      if ((k & 0x80) == 0)
110.                             hash ^= tab[i + 7];
111.               }
112.               return (hash & mask);
113.        }
115.        /**
116.         * Zobrist Hashing
117.         */
118.        public static int zobrist(char[] key, int mask, int[][] tab) {
119.               int hash, i;
120.               for (hash = key.length, i = 0; i < key.length; ++i)
121.                      hash ^= tab[i][key[i]];
122.               return (hash & mask);
123.        }
125.        // LOOKUP3
126.        // 见Bob Jenkins(3).c文件
128.        // 32位FNV算法
129.        static int M_SHIFT = 0;
131.        /**
132.         * 32位的FNV算法
133.         *
134.         * @param data
135.         *            数组
136.         * @return int值
137.         */
138.        public static int FNVHash(byte[] data) {
139.               int hash = (int) 2166136261L;
140.               for (byte b : data)
141.                      hash = (hash * 16777619) ^ b;
142.               if (M_SHIFT == 0)
143.                      return hash;
144.               return (hash ^ (hash >> M_SHIFT)) & M_MASK;
145.        }
147.        /**
148.         * 改进的32位FNV算法1
149.         *
150.         * @param data
151.         *            数组
152.         * @return int值
153.         */
154.        public static int FNVHash1(byte[] data) {
155.               final int p = 16777619;
156.               int hash = (int) 2166136261L;
157.               for (byte b : data)
158.                      hash = (hash ^ b) * p;
159.               hash += hash << 13;
160.               hash ^= hash >> 7;
161.               hash += hash << 3;
162.               hash ^= hash >> 17;
163.               hash += hash << 5;
164.               return hash;
165.        }
167.        /**
168.         * 改进的32位FNV算法1
169.         *
170.         * @param data
171.         *            字符串
172.         * @return int值
173.         */
174.        public static int FNVHash1(String data) {
175.               final int p = 16777619;
176.               int hash = (int) 2166136261L;
177.               for (int i = 0; i < data.length(); i++)
178.                      hash = (hash ^ data.charAt(i)) * p;
179.               hash += hash << 13;
180.               hash ^= hash >> 7;
181.               hash += hash << 3;
182.               hash ^= hash >> 17;
183.               hash += hash << 5;
184.               return hash;
185.        }
187.        /**
188.         * Thomas Wang的算法，整数hash
189.         */
190.        public static int intHash(int key) {
191.               key += ~(key << 15);
192.               key ^= (key >>> 10);
193.               key += (key << 3);
194.               key ^= (key >>> 6);
195.               key += ~(key << 11);
196.               key ^= (key >>> 16);
197.               return key;
198.        }
200.        /**
201.         * RS算法hash
202.         *
203.         * @param str
204.         *            字符串
205.         */
206.        public static int RSHash(String str) {
207.               int b = 378551;
208.               int a = 63689;
209.               int hash = 0;
210.               for (int i = 0; i < str.length(); i++) {
211.                      hash = hash * a + str.charAt(i);
212.                      a = a * b;
213.               }
214.               return (hash & 0x7FFFFFFF);
215.        }
216.        /* End Of RS Hash Function */
218.        /**
219.         * JS算法
220.         */
221.        public static int JSHash(String str) {
222.               int hash = 1315423911;
223.               for (int i = 0; i < str.length(); i++) {
224.                      hash ^= ((hash << 5) + str.charAt(i) + (hash >> 2));
225.               }
226.               return (hash & 0x7FFFFFFF);
227.        }
228.        /* End Of JS Hash Function */
230.        /**
231.         * PJW算法
232.         */
233.        public static int PJWHash(String str) {
234.               int BitsInUnsignedInt = 32;
235.               int ThreeQuarters = (BitsInUnsignedInt * 3) / 4;
236.               int OneEighth = BitsInUnsignedInt / 8;
237.               int HighBits = 0xFFFFFFFF << (BitsInUnsignedInt - OneEighth);
238.               int hash = 0;
239.               int test = 0;
240.               for (int i = 0; i < str.length(); i++) {
241.                      hash = (hash << OneEighth) + str.charAt(i);
243.                      if ((test = hash & HighBits) != 0) {
244.                             hash = ((hash ^ (test >> ThreeQuarters)) & (~HighBits));
245.                      }
246.               }
247.               return (hash & 0x7FFFFFFF);
248.        }
249.        /* End Of P. J. Weinberger Hash Function */
251.        /**
252.         * ELF算法
253.         */
254.        public static int ELFHash(String str) {
255.               int hash = 0;
256.               int x = 0;
257.               for (int i = 0; i < str.length(); i++) {
258.                      hash = (hash << 4) + str.charAt(i);
259.                      if ((x = (int) (hash & 0xF0000000L)) != 0) {
260.                             hash ^= (x >> 24);
261.                             hash &= ~x;
262.                      }
263.               }
264.               return (hash & 0x7FFFFFFF);
265.        }
266.        /* End Of ELF Hash Function */
268.        /**
269.         * BKDR算法
270.         */
271.        public static int BKDRHash(String str) {
272.               int seed = 131; // 31 131 1313 13131 131313 etc..
273.               int hash = 0;
274.               for (int i = 0; i < str.length(); i++) {
275.                      hash = (hash * seed) + str.charAt(i);
276.               }
277.               return (hash & 0x7FFFFFFF);
278.        }
279.        /* End Of BKDR Hash Function */
281.        /**
282.         * SDBM算法
283.         */
284.        public static int SDBMHash(String str) {
285.               int hash = 0;
286.               for (int i = 0; i < str.length(); i++) {
287.                      hash = str.charAt(i) + (hash << 6) + (hash << 16) - hash;
288.               }
289.               return (hash & 0x7FFFFFFF);
290.        }
291.        /* End Of SDBM Hash Function */
293.        /**
294.         * DJB算法
295.         */
296.        public static int DJBHash(String str) {
297.               int hash = 5381;
298.               for (int i = 0; i < str.length(); i++) {
299.                      hash = ((hash << 5) + hash) + str.charAt(i);
300.               }
301.               return (hash & 0x7FFFFFFF);
302.        }
303.        /* End Of DJB Hash Function */
305.        /**
306.         * DEK算法
307.         */
308.        public static int DEKHash(String str) {
309.               int hash = str.length();
310.               for (int i = 0; i < str.length(); i++) {
311.                      hash = ((hash << 5) ^ (hash >> 27)) ^ str.charAt(i);
312.               }
313.               return (hash & 0x7FFFFFFF);
314.        }
315.        /* End Of DEK Hash Function */
317.        /**
318.         * AP算法
319.         */
320.        public static int APHash(String str) {
321.               int hash = 0;
322.               for (int i = 0; i < str.length(); i++) {
323.                      hash ^= ((i & 1) == 0) ? ((hash << 7) ^ str.charAt(i) ^ (hash >> 3))
324.                                    : (~((hash << 11) ^ str.charAt(i) ^ (hash >> 5)));
325.               }
326.               // return (hash & 0x7FFFFFFF);
327.               return hash;
328.        }
329.        /* End Of AP Hash Function */
331.        /**
332.         * JAVA自己带的算法
333.         */
334.        public static int java(String str) {
335.               int h = 0;
336.               int off = 0;
337.               int len = str.length();
338.               for (int i = 0; i < len; i++) {
339.                      h = 31 * h + str.charAt(off++);
340.               }
341.               return h;
342.        }
344.        /**
345.         * 混合hash算法，输出64位的值
346.         */
347.        public static long mixHash(String str) {
348.               long hash = str.hashCode();
349.               hash <<= 32;
350.               hash |= FNVHash1(str);
351.               return hash;
352.        }
353. }