From 7f85ca5468e097f1749ab1ed812046cb8eb979b7 Mon Sep 17 00:00:00 2001
From: liurunyu <lry9898@163.com>
Date: 星期日, 27 四月 2025 17:58:48 +0800
Subject: [PATCH] 表阀一体机与测控一体阀协议中的阀门状态不兼容，做兼容处理。
---
pipIrr-platform/pipIrr-common/src/main/java/com/dy/common/util/MurmurHash.java | 302 ++++++++++++++++++++++++++++++++++++++++++++++++++
1 files changed, 302 insertions(+), 0 deletions(-)
diff --git a/pipIrr-platform/pipIrr-common/src/main/java/com/dy/common/util/MurmurHash.java b/pipIrr-platform/pipIrr-common/src/main/java/com/dy/common/util/MurmurHash.java
new file mode 100644
index 0000000..822c87c
--- /dev/null
+++ b/pipIrr-platform/pipIrr-common/src/main/java/com/dy/common/util/MurmurHash.java
@@ -0,0 +1,302 @@
+package com.dy.common.util;
+
+/**
+ * MurmurHash绠楁硶锛氶珮杩愮畻鎬ц兘锛屼綆纰版挒鐜囷紝鐢盇ustin Appleby鍒涘缓浜�2008骞达紝
+ * 鐜板凡搴旂敤鍒癏adoop銆乴ibstdc++銆乶ginx銆乴ibmemcached绛夊紑婧愮郴缁熴��2011骞�
+ * Appleby琚獹oogle闆囦剑锛岄殢鍚嶨oogle鎺ㄥ嚭鍏跺彉绉嶇殑CityHash绠楁硶銆�
+ *
+ * 瀹樻柟缃戠珯锛歨ttps://sites.google.com/site/murmurhash/
+ *
+ * MurmurHash绠楁硶锛岃嚜绉拌秴绾у揩鐨刪ash绠楁硶锛屾槸FNV鐨�4-5鍊嶃�傚畼鏂规暟鎹涓嬶細
+ *
+ * OneAtATime 鈥� 354.163715 mb/sec
+ * FNV 鈥� 443.668038 mb/sec
+ * SuperFastHash 鈥� 985.335173 mb/sec
+ * lookup3 鈥� 988.080652 mb/sec
+ * MurmurHash 1.0 鈥� 1363.293480 mb/sec
+ * MurmurHash 2.0 鈥� 2056.885653 mb/sec
+ *
+ * 浣嗕篃鏈夋枃绔犲０绉帮紝鍙湁褰搆ey鐨勯暱搴﹀ぇ浜�10瀛楄妭鐨勬椂鍊欙紝MurmurHash鐨勮繍绠楅��
+ * 搴︽墠蹇簬DJB銆備粠璁＄畻閫熷害涓婃潵鐪嬶紝MurmurHash鍙�傜敤浜庡凡鐭ラ暱搴︾殑銆侀暱搴︽瘮
+ * 杈冮暱鐨勫瓧绗︺��
+ *
+ * 鍝堝笇鍊煎垎甯冮潪甯稿潎鍖�锛屽嵆浣庣鎾炵巼
+ * 姣擟rc16鏇翠负鍧囧寑
+ */
+public final class MurmurHash {
+
+ private byte[] toBytesWithoutEncoding(String str) {
+ int len = str.length();
+ int pos = 0;
+ byte[] buf = new byte[len << 1];
+ for (int i = 0; i < len; i++) {
+ char c = str.charAt(i);
+ buf[pos++] = (byte) (c & 0xFF);
+ buf[pos++] = (byte) (c >> 8);
+ }
+ return buf;
+ }
+
+ /**
+ * 鍒樻鼎鐜夊鍔犳柟娉曚簬2016-12-02
+ * @param data
+ * @param length
+ * @return
+ */
+ public int hash16_plus(final byte[] data, int length) {
+ int hash = hash32(data, length, 0x9747b28c);
+ hash = hash % 65535 ;
+ if(hash < 0){
+ hash = - hash ;
+ }
+ return hash ;
+ }
+ /**
+ * 鍒樻鼎鐜夊鍔犳柟娉曚簬2016-12-02
+ * @param data
+ * @return
+ */
+ public int hash16_plus(final String data) {
+ byte[] bytes = toBytesWithoutEncoding(data);
+ int hash = hash32(bytes, bytes.length, 0x9747b28c);
+ hash = hash % 65535 ;
+ if(hash < 0){
+ hash = - hash ;
+ }
+ return hash ;
+ }
+
+ /**
+ * Generates 32 bit hash from byte array with default seed value.
+ * @param data byte array to hash
+ * @param length length of the array to hash
+ * @return 32 bit hash of the given array
+ */
+ public int hash32(final byte[] data, int length) {
+ return hash32(data, length, 0x9747b28c);
+ }
+
+ public int hash32(final String data) {
+ byte[] bytes = toBytesWithoutEncoding(data);
+ return hash32(bytes, bytes.length, 0x9747b28c);
+ }
+
+ /**
+ * Generates 64 bit hash from byte array with default seed value.
+ * @param data byte array to hash
+ * @param length length of the array to hash
+ * @return 64 bit hash of the given string
+ */
+ public long hash64(final byte[] data, int length) {
+ return hash64(data, length, 0xe17a1465);
+ }
+
+
+ public long hash64(final String data) {
+ byte[] bytes = toBytesWithoutEncoding(data);
+ return hash64(bytes, bytes.length);
+ }
+ /**
+ * Generates 32 bit hash from byte array of the given length and seed.
+ * @param data byte array to hash
+ * @param length length of the array
+ * @param seed initial seed value
+ * @return 32 bit hash of the given array
+ */
+ public int hash32(final byte[] data, int length, int seed) {
+ // 'm' and 'r' are mixing constants generated offline.
+ // They're not really 'magic', they just happen to work well.
+ final int m = 0x5bd1e995;
+ final int r = 24;
+ // Initialize the hash to a random value
+ int h = seed ^ length;
+ int length4 = length / 4;
+ for (int i = 0; i < length4; i++) {
+ final int i4 = i * 4;
+ int k = (data[i4 + 0] & 0xff) + ((data[i4 + 1] & 0xff) << 8)
+ + ((data[i4 + 2] & 0xff) << 16)
+ + ((data[i4 + 3] & 0xff) << 24);
+ k *= m;
+ k ^= k >>> r;
+ k *= m;
+ h *= m;
+ h ^= k;
+ }
+ // Handle the last few bytes of the input array
+ switch (length % 4) {
+ case 3:
+ h ^= (data[(length & ~3) + 2] & 0xff) << 16;
+ case 2:
+ h ^= (data[(length & ~3) + 1] & 0xff) << 8;
+ case 1:
+ h ^= (data[length & ~3] & 0xff);
+ h *= m;
+ }
+ h ^= h >>> 13;
+ h *= m;
+ h ^= h >>> 15;
+ return h;
+ }
+ /**
+ * Generates 64 bit hash from byte array of the given length and seed.
+ * @param data byte array to hash
+ * @param length length of the array to hash
+ * @param seed initial seed value
+ * @return 64 bit hash of the given array
+ */
+ public long hash64(final byte[] data, int length, int seed) {
+ final long m = 0xc6a4a7935bd1e995L;
+ final int r = 47;
+ long h = (seed & 0xffffffffl) ^ (length * m);
+ int length8 = length / 8;
+ for (int i = 0; i < length8; i++) {
+ final int i8 = i * 8;
+ long k = ((long) data[i8 + 0] & 0xff)
+ + (((long) data[i8 + 1] & 0xff) << 8)
+ + (((long) data[i8 + 2] & 0xff) << 16)
+ + (((long) data[i8 + 3] & 0xff) << 24)
+ + (((long) data[i8 + 4] & 0xff) << 32)
+ + (((long) data[i8 + 5] & 0xff) << 40)
+ + (((long) data[i8 + 6] & 0xff) << 48)
+ + (((long) data[i8 + 7] & 0xff) << 56);
+ k *= m;
+ k ^= k >>> r;
+ k *= m;
+ h ^= k;
+ h *= m;
+ }
+ switch (length % 8) {
+ case 7:
+ h ^= (long) (data[(length & ~7) + 6] & 0xff) << 48;
+ case 6:
+ h ^= (long) (data[(length & ~7) + 5] & 0xff) << 40;
+ case 5:
+ h ^= (long) (data[(length & ~7) + 4] & 0xff) << 32;
+ case 4:
+ h ^= (long) (data[(length & ~7) + 3] & 0xff) << 24;
+ case 3:
+ h ^= (long) (data[(length & ~7) + 2] & 0xff) << 16;
+ case 2:
+ h ^= (long) (data[(length & ~7) + 1] & 0xff) << 8;
+ case 1:
+ h ^= (long) (data[length & ~7] & 0xff);
+ h *= m;
+ }
+ ;
+ h ^= h >>> r;
+ h *= m;
+ h ^= h >>> r;
+ return h;
+ }
+ public static void main(String[] args) {
+ test1() ;
+ test2() ;
+ }
+
+ public static void test1() {
+ String regionNum = "110000" ;
+ String temp = "" ;
+ String rtuAddr = "" ;
+
+ int total0 = 0 ;
+ int total1 = 0 ;
+ int total2 = 0 ;
+ int total3 = 0 ;
+ int total4 = 0 ;
+ int total5 = 0 ;
+ int totalx = 0 ;
+ int totaly = 0 ;
+ MurmurHash mhash = new MurmurHash() ;
+ Long start = System.currentTimeMillis() ;
+ for(int i = 0 ; i < 10000; i++){
+ temp = "" + i ;
+ while(temp.length() < 5){
+ temp = "0" + temp ;
+ }
+ rtuAddr = regionNum + temp ;
+ int hash = mhash.hash16_plus(rtuAddr) ;
+ if(hash < 0){
+ total0++ ;
+ }
+ if(hash >= 0 && hash < 1000){
+ total1++ ;
+ }
+ if(hash >= 1000 && hash < 2000){
+ total2++ ;
+ }
+ if(hash >= 2000 && hash < 3000){
+ total3++ ;
+ }
+ if(hash >= 3000 && hash < 4000){
+ total4++ ;
+ }
+ if(hash >= 4000 && hash < 5000){
+ total5++ ;
+ }
+ if(hash >= 64535 && hash < 65535){
+ totalx++ ;
+ }
+ if(hash > 65535){
+ totaly++ ;
+ }
+ //System.out.println(rtuAddr + "-" + crc);
+ }
+ Long end = System.currentTimeMillis() ;
+ System.out.println("鐢ㄦ椂" + ":" + (end - start));
+ System.out.println("0浠ヤ笅" + ":" + total0);
+ System.out.println("0-1000" + ":" + total1);
+ System.out.println("1000-2000" + ":" + total2);
+ System.out.println("2000-3000" + ":" + total3);
+ System.out.println("3000-4000" + ":" + total4);
+ System.out.println("5000-6000" + ":" + total5);
+ System.out.println("64535-65535" + ":" + totalx);
+ System.out.println("65535浠ヤ笂" + ":" + totaly);
+ System.out.println("=================");
+ }
+ public static void test2() {
+ String regionNum = "110000" ;
+ String temp = "" ;
+ String rtuAddr = "" ;
+
+ int total1 = 0 ;
+ int total2 = 0 ;
+ int total3 = 0 ;
+ int total4 = 0 ;
+ int total5 = 0 ;
+ MurmurHash mhash = new MurmurHash() ;
+ Long start = System.currentTimeMillis() ;
+ for(int i = 0 ; i < 10000; i++){
+ temp = "" ;
+ temp = "" + i ;
+ while(temp.length() < 5){
+ temp = "0" + temp ;
+ }
+ rtuAddr = regionNum + temp ;
+ int hash = mhash.hash32(rtuAddr) ;
+ if(hash > 0 && hash < 10000000){
+ total1++ ;
+ }
+ if(hash >= 10000000 && hash < 20000000){
+ total2++ ;
+ }
+ if(hash >= 20000000 && hash < 30000000){
+ total3++ ;
+ }
+ if(hash >= 30000000 && hash < 40000000){
+ total4++ ;
+ }
+ if(hash >= 40000000 && hash < 50000000){
+ total5++ ;
+ }
+ //System.out.println(rtuAddr + "-" + crc);
+ }
+ Long end = System.currentTimeMillis() ;
+ System.out.println("鐢ㄦ椂" + ":" + (end - start));
+ System.out.println("0-10000000" + ":" + total1);
+ System.out.println("10000000-20000000" + ":" + total2);
+ System.out.println("20000000-30000000" + ":" + total3);
+ System.out.println("30000000-40000000" + ":" + total4);
+ System.out.println("50000000-60000000" + ":" + total5);
+ System.out.println("=================");
+ }
+}
--
Gitblit v1.8.0