Sha256: 5ab6bc77a608773598fc66384ced9a21d07ba7f8f51d5c0e0542258d633f1c1c
Contents?: true
Size: 1.35 KB
Versions: 1
Compression:
Stored size: 1.35 KB
Contents
/* * MurmurHash2 (C) Austin Appleby */ #include "murmurhash2.h" static inline size_t murmur2(uint32_t h, uint32_t k, const uint8_t r) { const uint32_t m = MURMURHASH_MAGIC; k *= m; k ^= k >> r; k *= m; h *= m; h ^= k; return h; } static uint32_t murmur_hash_process2(const char *data, uint32_t length) { const uint32_t m = MURMURHASH_MAGIC; const uint8_t r = 24; uint32_t h, k; h = length * m; while (4 <= length) { k = *(uint32_t*)data; h = murmur2(h, k, r); data += 4; length -= 4; } switch (length) { case 3: h ^= data[2] << 16; case 2: h ^= data[1] << 8; case 1: h ^= data[0]; h *= m; } h ^= h >> 13; h *= m; h ^= h >> 15; return h; } VALUE murmur2_finish(VALUE self) { uint32_t h; uint8_t digest[4]; MURMURHASH(self, ptr); h = murmur_hash_process2(ptr->buffer, ptr->p - ptr->buffer); digest[0] = h >> 24; digest[1] = h >> 16; digest[2] = h >> 8; digest[3] = h; return rb_str_new((const char*) digest, 4); } VALUE murmur2_to_i(VALUE self) { MURMURHASH(self, ptr); return UINT2NUM(murmur_hash_process2(ptr->buffer, ptr->p - ptr->buffer)); } VALUE murmur2_s_rawdigest(int argc, VALUE *argv, VALUE klass) { VALUE str; volatile VALUE obj; if (argc < 1) rb_raise(rb_eArgError, "no data given"); str = *argv++; argc--; StringValue(str); return UINT2NUM(murmur_hash_process2(RSTRING_PTR(str), RSTRING_LEN(str))); }
Version data entries
1 entries across 1 versions & 1 rubygems
Version | Path |
---|---|
digest-murmurhash-0.2.1 | ext/digest/murmurhash/murmurhash2.c |