The last version of the code is available here and is feature
complete AFAICT
https://github.com/gchatelet/murmurhash3_d/blob/master/murmurhash3.d
Last concern, I declared blockSize in bytes where
std.digest.digest says it should be in bits. Why does it need to
be bits ? It looks like HMAC
On Saturday, 12 December 2015 at 20:12:49 UTC, Guillaume Chatelet
wrote:
On Saturday, 12 December 2015 at 02:59:21 UTC, Ilya wrote:
Current version is suitable for arrays but not ranges or types.
Few examples:
1. Compute hash of ulong.
2. Compute hash of all elements in matrix column (element
On Sunday, 13 December 2015 at 12:44:06 UTC, Marc Schütz wrote:
AFAICS this doesn't conform to the digest interface. For
example, there should be a `finish` method that returns the
hash as a static array (see the ExampleDigest [1]).
The structs themselves do not but the alias at the beginning
On Sunday, 13 December 2015 at 16:24:35 UTC, Guillaume Chatelet
wrote:
On Sunday, 13 December 2015 at 12:44:06 UTC, Marc Schütz wrote:
[...]
The structs themselves do not but the alias at the beginning of
the file make sure they do.
alias MurmurHash3_x86_32 = Digester!SMurmurHash3_x86_32;
On Saturday, 12 December 2015 at 02:59:21 UTC, Ilya wrote:
Current version is suitable for arrays but not ranges or types.
Few examples:
1. Compute hash of ulong.
2. Compute hash of all elements in matrix column (element are
in different arrays).
I have created output range API draft
On Friday, 11 December 2015 at 01:51:09 UTC, Ilya wrote:
http://dpaste.dzfl.pl/1b94ed0aa96e#line-222 - seed is uint, can
it be ulong?
Done
Mutmur hash has three stages:
1. Computation of hash for blocks (32bit or 128bit)
2. Compitation of hash for tail (remainder)
3. Finalization.
I will be
On Friday, 11 December 2015 at 22:43:00 UTC, Guillaume Chatelet
wrote:
On Friday, 11 December 2015 at 01:51:09 UTC, Ilya wrote:
http://dpaste.dzfl.pl/1b94ed0aa96e#line-222 - seed is uint,
can it be ulong?
Done
Mutmur hash has three stages:
1. Computation of hash for blocks (32bit or 128bit)
Here is an implementation of MurmurHash [1] for D.
http://dpaste.dzfl.pl/1b94ed0aa96e
I'll do a proper pull request later on for addition to std.digest
if the community feels like it's a valuable addition.
Guillaume
--
1 - https://en.wikipedia.org/wiki/MurmurHash
On Thursday, 10 December 2015 at 22:25:21 UTC, Guillaume Chatelet
wrote:
Here is an implementation of MurmurHash [1] for D.
http://dpaste.dzfl.pl/1b94ed0aa96e
I'll do a proper pull request later on for addition to
std.digest if the community feels like it's a valuable addition.
Guillaume
--
On Thursday, 10 December 2015 at 22:25:21 UTC, Guillaume Chatelet
wrote:
Here is an implementation of MurmurHash [1] for D.
http://dpaste.dzfl.pl/1b94ed0aa96e
I'll do a proper pull request later on for addition to
std.digest if the community feels like it's a valuable addition.
Guillaume
--
On Thursday, 10 December 2015 at 22:25:21 UTC, Guillaume Chatelet
wrote:
Here is an implementation of MurmurHash [1] for D.
http://dpaste.dzfl.pl/1b94ed0aa96e
I'll do a proper pull request later on for addition to
std.digest if the community feels like it's a valuable addition.
Guillaume
--
11 matches
Mail list logo
