ZhiYeJianKang_PeiXun/cyqdata-master/Tool/HashAlgorithms.cs

179 lines
5.1 KiB
C#
Raw Normal View History

2025-02-20 15:41:53 +08:00
using System;
using System.Runtime.ConstrainedExecution;
using System.Security.Cryptography;
using System.Text;
namespace CYQ.Data.Tool
{
///// <summary>
///// Fowler-Noll-Vo hash, variant 1, 32-bit version.
///// http://www.isthe.com/chongo/tech/comp/fnv/
///// </summary>
//internal class FNV1_32 : HashAlgorithm
//{
// private static readonly uint FNV_prime = 16777619;
// private static readonly uint offset_basis = 2166136261;
// protected uint hash;
// public FNV1_32()
// {
// HashSizeValue = 32;
// }
// public override void Initialize()
// {
// hash = offset_basis;
// }
// protected override void HashCore(byte[] array, int ibStart, int cbSize)
// {
// int length = ibStart + cbSize;
// for (int i = ibStart; i < length; i++)
// {
// hash = (hash * FNV_prime) ^ array[i];
// }
// }
// protected override byte[] HashFinal()
// {
// return BitConverter.GetBytes(hash);
// }
//}
///// <summary>
///// Fowler-Noll-Vo hash, variant 1a, 32-bit version.
///// http://www.isthe.com/chongo/tech/comp/fnv/
///// </summary>
//internal class FNV1a_32 : HashAlgorithm
//{
// private static readonly uint FNV_prime = 16777619;
// private static readonly uint offset_basis = 2166136261;
// protected uint hash;
// public FNV1a_32()
// {
// HashSizeValue = 32;
// }
// public override void Initialize()
// {
// hash = offset_basis;
// }
// protected override void HashCore(byte[] array, int ibStart, int cbSize)
// {
// int length = ibStart + cbSize;
// for (int i = ibStart; i < length; i++)
// {
// hash = (hash ^ array[i]) * FNV_prime;
// }
// }
// protected override byte[] HashFinal()
// {
// return BitConverter.GetBytes(hash);
// }
//}
///// <summary>
///// Modified Fowler-Noll-Vo hash, 32-bit version.
///// http://home.comcast.net/~bretm/hash/6.html
//// <20><><EFBFBD><EFBFBD><EFBFBD>ӻ<EFBFBD><D3BB><EFBFBD><EFBFBD><EFBFBD><E3B7A8>ͬһ<CDAC><D2BB>key<65>ڲ<EFBFBD>ͬ<EFBFBD><CDAC><EFBFBD>߳<EFBFBD><DFB3>£<EFBFBD><C2A3><EFBFBD>Ȼż<C8BB><C5BC><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ͬ<EFBFBD><CDAC>hash<73><68>
///// </summary>
//internal class ModifiedFNV1_32 : FNV1_32
//{
// protected override byte[] HashFinal()
// {
// hash += hash << 13;
// hash ^= hash >> 7;
// hash += hash << 3;
// hash ^= hash >> 17;
// hash += hash << 5;
// return BitConverter.GetBytes(hash);
// }
//}
/// <summary>
/// <20><><EFBFBD><EFBFBD>ΨһHash<73><68>
/// </summary>
internal class HashCreator
{
/// <summary>
/// <20><><EFBFBD><EFBFBD>HashKey<65><79><EFBFBD>ظ<EFBFBD><D8B8><EFBFBD><EFBFBD>ʵ<EFBFBD>һЩ<D2BB><D0A9>
/// </summary>
/// <returns></returns>
public static string CreateKey(string key)
{
if (string.IsNullOrEmpty(key))
{
return "K" + CreateCode(key);
}
return "K" + (int)key[0] + CreateCode(key) + key.Length;
}
//private static readonly FNV1a_32 fnv1 = new FNV1a_32();//<2F><><EFBFBD>ܽ<EFBFBD><DCBD><EFBFBD>Ӱ<EFBFBD><EFBFBD><ECA3AC><EFBFBD><EFBFBD>cpuӰ<75><EFBFBD><ECA3AC><EFBFBD>Բ<EFBFBD><D4B2><EFBFBD><EFBFBD>á<EFBFBD>
/// <summary>
/// <20><><EFBFBD><EFBFBD>HashCode<64><65><EFBFBD><EFBFBD>һ<EFBFBD><D2BB><EFBFBD>ظ<EFBFBD><D8B8><EFBFBD><EFBFBD>ʡ<EFBFBD>
/// </summary>
/// <param name="key"></param>
/// <returns></returns>
public static uint CreateCode(string key)
{
if (key == null)
{
return uint.MinValue;
}
else if (key.Trim() == "")
{
return uint.MaxValue;
}
return GetHashCode(key);
//return BitConverter.ToUInt32(fnv1.ComputeHash(Encoding.Unicode.GetBytes(key)), 0);
}
/// <summary>
/// ȡ<><C8A1>java<76><61><EFBFBD>ַ<EFBFBD><D6B7><EFBFBD>hash<73>㷨(<28><>һ<EFBFBD><D2BB><EFBFBD>ظ<EFBFBD><D8B8>ĸ<EFBFBD><C4B8><EFBFBD>)<29><>
/// </summary>
/// <param name="value"></param>
/// <returns></returns>
private static uint GetHashCode(string value)
{
uint h = 0;
foreach (char c in value)
{
h = 31 * h + c;
}
return h;
}
//[System.Security.SecuritySafeCritical] // auto-generated
//[ReliabilityContract(Consistency.WillNotCorruptState, Cer.MayFail)]
//private static uint GetHashCode(string key)
//{
// unsafe
// {
// fixed (char* src = key)
// {
// int hash1 = 5381;
// int hash2 = hash1;
// int c;
// char* s = src;
// while ((c = s[0]) != 0)
// {
// hash1 = ((hash1 << 5) + hash1) ^ c;
// c = s[1];
// if (c == 0)
// break;
// hash2 = ((hash2 << 5) + hash2) ^ c;
// s += 2;
// }
// return (uint)((long)(hash1 + hash2 * 1566083941) + int.MaxValue);
// }
// }
//}
}
}