Simon Sapin
2015-04-06 20:43:00 +02:00
commit be2d712471
5 changed files with 54 additions and 0 deletions
+2
View File
@@ -0,0 +1,2 @@
target
Cargo.lock
+12
View File
@@ -0,0 +1,12 @@
[package]
name = "fnv"
version = "1.0.0"
authors = ["Alex Crichton <alex@alexcrichton.com>"]
description = "FowlerNollVo hash function"
license = "Apache-2 / MIT"
readme = "README.md"
[lib]
name = "fnv"
path = "lib.rs"
doctest = false
+4
View File
@@ -0,0 +1,4 @@
rust-fnv
========
FowlerNollVo hash function
+33
View File
@@ -0,0 +1,33 @@
//! This file stolen wholesale from https://github.com/rust-lang/rust/blob/master/src/librustc/util/nodemap.rs
use std::default::Default;
use std::hash::Hasher;
/// A speedy hash algorithm for node ids and def ids. The hashmap in
/// libcollections by default uses SipHash which isn't quite as speedy as we
/// want. In the compiler we're not really worried about DOS attempts, so we
/// just default to a non-cryptographic hash.
///
/// This uses FNV hashing, as described here:
/// http://en.wikipedia.org/wiki/Fowler%E2%80%93Noll%E2%80%93Vo_hash_function
#[allow(missing_copy_implementations)]
pub struct FnvHasher(u64);
impl Default for FnvHasher {
#[inline]
fn default() -> FnvHasher { FnvHasher(0xcbf29ce484222325) }
}
impl Hasher for FnvHasher {
#[inline]
fn finish(&self) -> u64 { self.0 }
#[inline]
fn write(&mut self, bytes: &[u8]) {
let FnvHasher(mut hash) = *self;
for byte in bytes.iter() {
hash = hash ^ (*byte as u64);
hash = hash.wrapping_mul(0x100000001b3);
}
*self = FnvHasher(hash);
}
}
+3
View File
@@ -0,0 +1,3 @@
#[test]
fn it_works() {
}