kedama 0.1.0

data/README

@@ -0,0 +1,42 @@
+= kedama
+
+== Description
+
+kedama is ruby port of the libketama.
+
+libketama is a consistent hashing library.
+
+see http://bit.ly/dVIeGh
+
+== Install
+
+gem install kedama
+
+== Example
+
+  require 'kedama'
+  
+  nodes = Kedama::Nodes.new
+  nodes.add('1.2.3.4:11211',  900)
+  nodes.add('5.6.7.8:11211',  300)
+  nodes.add('9.8.7.6:11211', 1500)
+  
+  hash = nodes.to_hash
+  
+  10.times do |i|
+    i = i.to_s
+    puts i + "\t" + hash[i]
+  end
+  
+  # output
+  # ---
+  # 0       5.6.7.8:11211
+  # 1       5.6.7.8:11211
+  # 2       9.8.7.6:11211
+  # 3       1.2.3.4:11211
+  # 4       1.2.3.4:11211
+  # 5       1.2.3.4:11211
+  # 6       1.2.3.4:11211
+  # 7       9.8.7.6:11211
+  # 8       9.8.7.6:11211
+  # 9       9.8.7.6:11211

data/lib/kedama.rb

@@ -0,0 +1,98 @@
+require 'digest/md5'
+
+module Kedama
+  class ConsitentHash
+    def initialize(nodes)
+      @circle = []
+      @names = {}
+
+      total_weight = nodes.values.inject {|r, i| r + i}
+
+      nodes.each do |name, weight|
+        repls = (40.0 * nodes.length * weight / total_weight).floor
+
+        repls.times do |i|
+          hs = hash_values("#{name}-#{i}")
+
+          hs.each do |h|
+            @circle << h
+            @names[h] = name
+          end
+        end
+      end
+
+      @circle.sort!
+    end
+
+    def to_a
+      @circle.map do |h|
+        [h, @names[h]]
+      end
+    end
+
+    def [](key)
+      point = search(key.to_str)
+      @names[point]
+    end
+
+    private
+    def hash_values(str)
+      digest = Digest::MD5.digest(str)
+      hs = []
+
+      until digest.empty?
+        bs = digest.slice!(0, 4)
+        hs << (bs[3] << 24) + (bs[2] << 16) + (bs[1] << 8) + bs[0]
+      end
+
+      return hs
+    end
+
+    def hashi(str)
+      digest = Digest::MD5.digest(str)
+      (digest[3] << 24) + (digest[2] << 16) + (digest[1] << 8) + digest[0]
+    end
+
+    def search(key)
+      key_hash = hashi(key)
+      lowp = 0
+      highp = @circle.length
+
+      while true
+        midp = (lowp + highp) / 2;
+
+        return @circle.first if midp == @circle.length
+
+        midval = @circle[midp];
+        midval1 = midp.zero? ? 0 : @circle[midp - 1]
+
+        if midval1 < key_hash and key_hash <= midval
+          return midval
+        end
+
+        if midval < key_hash
+          lowp = midp + 1
+        else
+          highp = midp - 1
+        end
+
+        return @circle.first if lowp > highp
+      end
+    end
+  end # ConsitentHash
+
+  class Nodes
+    def initialize
+      @nodes = {}
+    end
+
+    def add(name, weight)
+      @nodes[name.to_str] = weight.to_int
+    end
+
+    def to_hash
+      ConsitentHash.new(@nodes)
+    end
+  end # Nodes
+
+end # Kedama

metadata

@@ -0,0 +1,70 @@
+--- !ruby/object:Gem::Specification 
+name: kedama
+version: !ruby/object:Gem::Version 
+  hash: 27
+  prerelease: 
+  segments: 
+  - 0
+  - 1
+  - 0
+  version: 0.1.0
+platform: ruby
+authors: 
+- winebarrel
+autorequire: 
+bindir: bin
+cert_chain: []
+
+date: 2011-04-17 00:00:00 Z
+dependencies: []
+
+description: |
+  kedama is ruby port of the libketama.
+  libketama is a consistent hashing library.
+  see http://bit.ly/dVIeGh
+
+email: sgwr_dts@yahoo.co.jp
+executables: []
+
+extensions: []
+
+extra_rdoc_files: []
+
+files: 
+- lib/kedama.rb
+- README
+homepage: https://bitbucket.org/winebarrel/kedama
+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: 
+rubygems_version: 1.7.2
+signing_key: 
+specification_version: 3
+summary: kedama is ruby port of the libketama.
+test_files: []
+