dalli 2.7.11 → 3.0.0

data/lib/dalli/protocol.rb

@@ -0,0 +1,9 @@
+# frozen_string_literal: true
+
+module Dalli
+  module Protocol
+    # Implements the NullObject pattern to store an application-defined value for 'Key not found' responses.
+    class NilObject; end
+    NOT_FOUND = NilObject.new
+  end
+end

data/lib/dalli/ring.rb

@@ -1,6 +1,7 @@
 # frozen_string_literal: true
-require 'digest/sha1'
-require 'zlib'
+
+require "digest/sha1"
+require "zlib"
 
 module Dalli
   class Ring
@@ -32,7 +33,13 @@ module Dalli
       if @continuum
         hkey = hash_for(key)
         20.times do |try|
-          entryidx = binary_search(@continuum, hkey)
+          # Find the closest index in the Ring with value <= the given value
+          entryidx = @continuum.bsearch_index { |entry| entry.value > hkey }
+          if entryidx.nil?
+            entryidx = @continuum.size - 1
+          else
+            entryidx -= 1
+          end
           server = @continuum[entryidx].server
           return server if server.alive?
           break unless @failover
@@ -40,7 +47,7 @@ module Dalli
         end
       else
         server = @servers.first
-        return server if server && server.alive?
+        return server if server&.alive?
       end
 
       raise Dalli::RingError, "No server available"
@@ -49,7 +56,7 @@ module Dalli
     def lock
       @servers.each(&:lock!)
       begin
-        return yield
+        yield
       ensure
         @servers.each(&:unlock!)
       end
@@ -71,63 +78,6 @@ module Dalli
       ((total_servers * POINTS_PER_SERVER * server.weight) / Float(total_weight)).floor
     end
 
-    # Native extension to perform the binary search within the continuum
-    # space.  Fallback to a pure Ruby version if the compilation doesn't work.
-    # optional for performance and only necessary if you are using multiple
-    # memcached servers.
-    begin
-      require 'inline'
-      inline do |builder|
-        builder.c <<-EOM
-        int binary_search(VALUE ary, unsigned int r) {
-            long upper = RARRAY_LEN(ary) - 1;
-            long lower = 0;
-            long idx = 0;
-            ID value = rb_intern("value");
-            VALUE continuumValue;
-            unsigned int l;
-
-            while (lower <= upper) {
-                idx = (lower + upper) / 2;
-
-                continuumValue = rb_funcall(RARRAY_PTR(ary)[idx], value, 0);
-                l = NUM2UINT(continuumValue);
-                if (l == r) {
-                    return idx;
-                }
-                else if (l > r) {
-                    upper = idx - 1;
-                }
-                else {
-                    lower = idx + 1;
-                }
-            }
-            return upper;
-        }
-        EOM
-      end
-    rescue LoadError
-      # Find the closest index in the Ring with value <= the given value
-      def binary_search(ary, value)
-        upper = ary.size - 1
-        lower = 0
-
-        while (lower <= upper) do
-          idx = (lower + upper) / 2
-          comp = ary[idx].value <=> value
-
-          if comp == 0
-            return idx
-          elsif comp > 0
-            upper = idx - 1
-          else
-            lower = idx + 1
-          end
-        end
-        upper
-      end
-    end
-
     class Entry
       attr_reader :value
       attr_reader :server
@@ -137,6 +87,5 @@ module Dalli
         @server = srv
       end
     end
-
   end
 end