digest_perfect 0.0.1

data/.gitignore

@@ -0,0 +1,4 @@
+*.gem
+.bundle
+Gemfile.lock
+pkg/*

data/Gemfile

@@ -0,0 +1,4 @@
+source "http://rubygems.org"
+
+# Specify your gem's dependencies in digest_perfect.gemspec
+gemspec

data/README.md

@@ -0,0 +1,9 @@
+Usage
+=====
+
+  Digest::Perfect.hexdigest("String to digest")
+
+Credits
+=======
+
+Most of the code in this gem was taken from the excellend PageRankr gem ( https://github.com/blatyo/page_rankr ) by Allen Madsen. I just made a few tweaks to make the code more general-purpose.

data/Rakefile

@@ -0,0 +1,2 @@
+require 'bundler'
+Bundler::GemHelper.install_tasks

data/digest_perfect.gemspec

@@ -0,0 +1,21 @@
+# -*- encoding: utf-8 -*-
+$:.push File.expand_path("../lib", __FILE__)
+require "digest_perfect/version"
+
+Gem::Specification.new do |s|
+  s.name        = "digest_perfect"
+  s.version     = DigestPerfect::VERSION
+  s.platform    = Gem::Platform::RUBY
+  s.authors     = ["Starr Horne"]
+  s.email       = ["starr@chromahq.com"]
+  s.homepage    = "https://github.com/starrhorne/digest_perfect"
+  s.summary     = %q{Implementation of Bob Jenkins' perfect hash algorithm in ruby}
+  s.description = %q{Among other things, this is the hash used to create requests to google's pagerank tool. Most of the code comes from the excellent PageRankr gem.}
+
+  s.rubyforge_project = "digest_perfect"
+
+  s.files         = `git ls-files`.split("\n")
+  s.test_files    = `git ls-files -- {test,spec,features}/*`.split("\n")
+  s.executables   = `git ls-files -- bin/*`.split("\n").map{ |f| File.basename(f) }
+  s.require_paths = ["lib"]
+end

data/lib/digest_perfect.rb

@@ -0,0 +1,78 @@
+require "digest"
+
+module Digest
+
+  class Perfect
+
+    class << self
+
+      def hexdigest(string_to_hash)
+        bytes  = byte_array(string_to_hash)
+        length = bytes.length
+        a = b = 0x9E3779B9
+        c = 0xE6359A60
+        k, len = 0, length
+        while(len >= 12)
+          a = m(a + bytes[k + 0] + (bytes[k + 1] << 8) + (bytes[k +  2] << 16) + (bytes[k +  3] << 24))
+          b = m(b + bytes[k + 4] + (bytes[k + 5] << 8) + (bytes[k +  6] << 16) + (bytes[k +  7] << 24))
+          c = m(c + bytes[k + 8] + (bytes[k + 9] << 8) + (bytes[k + 10] << 16) + (bytes[k + 11] << 24))
+
+          a, b, c = mix(a, b, c)
+          k += 12
+          len -= 12
+        end
+
+        c = c + length
+
+        c = mix(*toss(a, b, c, bytes, len, k))[2]
+        "6" + c.to_s
+      end
+
+      private
+
+      def byte_array(string_to_hash)
+        bytes = []
+        string_to_hash.each_byte {|b| bytes << b}
+        bytes
+      end
+
+      # Need to keep numbers in the unsigned int 32 range
+      def m(v)
+        v % 0x100000000
+      end
+
+      def mix(a, b, c)
+        a, b, c = m(a), m(b), m(c)
+
+        a = m(a-b-c) ^ m(c >> 13)
+        b = m(b-c-a) ^ m(a << 8)
+        c = m(c-a-b) ^ m(b >> 13)
+
+        a = m(a-b-c) ^ m(c >> 12)
+        b = m(b-c-a) ^ m(a << 16)
+        c = m(c-a-b) ^ m(b >> 5)
+
+        a = m(a-b-c) ^ m(c >> 3)
+        b = m(b-c-a) ^ m(a << 10)
+        c = m(c-a-b) ^ m(b >> 15)
+
+        [a, b, c]
+      end
+
+      def toss(a, b, c, bytes, len, k)
+        case len
+          when 9..11
+            c = c + (bytes[k+len-1] << ((len % 8) * 8))
+          when 5..8
+            b = b + (bytes[k+len-1] << ((len % 5) * 8))
+          when 1..4
+            a = a + (bytes[k+len-1] << ((len - 1) * 8))
+          else
+            return [a, b, c]
+        end
+        toss(a, b, c, bytes, len-1, k)
+      end
+    end
+  end
+end
+

data/lib/digest_perfect/version.rb

@@ -0,0 +1,3 @@
+module DigestPerfect
+  VERSION = "0.0.1"
+end

metadata

@@ -0,0 +1,74 @@
+--- !ruby/object:Gem::Specification 
+name: digest_perfect
+version: !ruby/object:Gem::Version 
+  hash: 29
+  prerelease: 
+  segments: 
+  - 0
+  - 0
+  - 1
+  version: 0.0.1
+platform: ruby
+authors: 
+- Starr Horne
+autorequire: 
+bindir: bin
+cert_chain: []
+
+date: 2011-05-22 00:00:00 -05:00
+default_executable: 
+dependencies: []
+
+description: Among other things, this is the hash used to create requests to google's pagerank tool. Most of the code comes from the excellent PageRankr gem.
+email: 
+- starr@chromahq.com
+executables: []
+
+extensions: []
+
+extra_rdoc_files: []
+
+files: 
+- .gitignore
+- Gemfile
+- README.md
+- Rakefile
+- digest_perfect.gemspec
+- lib/digest_perfect.rb
+- lib/digest_perfect/version.rb
+has_rdoc: true
+homepage: https://github.com/starrhorne/digest_perfect
+licenses: []
+
+post_install_message: 
+rdoc_options: []
+
+require_paths: 
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement 
+  none: false
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      hash: 3
+      segments: 
+      - 0
+      version: "0"
+required_rubygems_version: !ruby/object:Gem::Requirement 
+  none: false
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      hash: 3
+      segments: 
+      - 0
+      version: "0"
+requirements: []
+
+rubyforge_project: digest_perfect
+rubygems_version: 1.6.2
+signing_key: 
+specification_version: 3
+summary: Implementation of Bob Jenkins' perfect hash algorithm in ruby
+test_files: []
+