Last active
January 6, 2021 13:13
-
-
Save KirillOsenkov/f5d0de3b2d9e31e7efacf4023cb38baa to your computer and use it in GitHub Desktop.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/// <summary> | |
/// A hash combiner that is implemented with the Fowler/Noll/Vo algorithm (FNV-1a). This is a mutable struct for performance reasons. | |
/// Taken from https://gist.github.com/StephenCleary/4f6568e5ab5bee7845943fdaef8426d2 | |
/// </summary> | |
public struct FnvHash | |
{ | |
/// <summary> | |
/// The starting point of the FNV hash. | |
/// </summary> | |
public const ulong Offset = 14695981039346656037; | |
/// <summary> | |
/// The prime number used to compute the FNV hash. | |
/// </summary> | |
private const ulong Prime = 1099511628211; | |
/// <summary> | |
/// Gets the current result of the hash function. | |
/// </summary> | |
public ulong HashCode { get; private set; } | |
public FnvHash(ulong hash) | |
{ | |
HashCode = hash; | |
} | |
/// <summary> | |
/// Creates a new FNV hash initialized to <see cref="Offset"/>. | |
/// </summary> | |
public static FnvHash Create() | |
{ | |
var result = new FnvHash(); | |
result.HashCode = Offset; | |
return result; | |
} | |
public static ulong GetHashCode(string text) | |
{ | |
var hash = Create(); | |
for (int i = 0; i < text.Length; i++) | |
{ | |
hash.Combine(text[i]); | |
} | |
return hash.HashCode; | |
} | |
public static ulong Combine(ulong left, ulong right) | |
{ | |
var fnv = new FnvHash(left); | |
fnv.Combine(right); | |
return fnv.HashCode; | |
} | |
/// <summary> | |
/// Adds the specified byte to the hash. | |
/// </summary> | |
/// <param name="data">The byte to hash.</param> | |
public void Combine(byte data) | |
{ | |
unchecked | |
{ | |
HashCode ^= data; | |
HashCode *= Prime; | |
} | |
} | |
public void Combine(char data) | |
{ | |
unchecked | |
{ | |
var sh = (ushort)data; | |
Combine(unchecked((byte)sh)); | |
Combine(unchecked((byte)(sh >> 8))); | |
} | |
} | |
/// <summary> | |
/// Adds the specified integer to this hash, in little-endian order. | |
/// </summary> | |
/// <param name="data">The integer to hash.</param> | |
public void Combine(int data) | |
{ | |
Combine(unchecked((byte)data)); | |
Combine(unchecked((byte)(data >> 8))); | |
Combine(unchecked((byte)(data >> 16))); | |
Combine(unchecked((byte)(data >> 24))); | |
} | |
public void Combine(ulong data) | |
{ | |
Combine(unchecked((byte)data)); | |
Combine(unchecked((byte)(data >> 8))); | |
Combine(unchecked((byte)(data >> 16))); | |
Combine(unchecked((byte)(data >> 24))); | |
Combine(unchecked((byte)(data >> 32))); | |
Combine(unchecked((byte)(data >> 40))); | |
Combine(unchecked((byte)(data >> 48))); | |
Combine(unchecked((byte)(data >> 56))); | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment