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)
2. Compitation of hash for tail (remainder)
3. Finalization.

I will be very happy, if step 1 will be represented as an output range. Then it can be used directly like reduce aggregator for ranges and multidimensional slices.
Done

Not thoroughly tested but updated for range and taking an ulong seed for MurmurHash3_x64_128:
http://dpaste.dzfl.pl/1b94ed0aa96e

Not sure I got what you meant about the optimized version. For the return value ?

I haven't done any benchmarking yet.

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 http://dpaste.dzfl.pl/a24050042758

Ilya

  • MurmurHash3 Guillaume Chatelet via Digitalmars-d-announce
    • Re: MurmurHash3 Brad Anderson via Digitalmars-d-announce
    • Re: MurmurHash3 Ilya via Digitalmars-d-announce
    • Re: MurmurHash3 Ilya via Digitalmars-d-announce
      • Re: MurmurHash3 Guillaume Chatelet via Digitalmars-d-announce
        • Re: MurmurHash3 Ilya via Digitalmars-d-announce
          • Re: MurmurH... Guillaume Chatelet via Digitalmars-d-announce
            • Re: Mu... Marc Schütz via Digitalmars-d-announce
              • Re... Guillaume Chatelet via Digitalmars-d-announce
                • ... Guillaume Chatelet via Digitalmars-d-announce
                • ... Guillaume Chatelet via Digitalmars-d-announce
                • ... Marc Schütz via Digitalmars-d-announce

Reply via email to