JRuby, MRI 1.8.7, Rubinius compatability

Author: take-five

.rspec

@@ -1,2 +1,2 @@
 --color
---format documentation
+--format progress

README.md

@@ -67,7 +67,6 @@ ip_tree.find_first(client_ip).value # => {:city=>"YEKT"}
 ## TODO
 1. Fix README typos and grammatical errors (english speaking contributors are welcomed)
 2. Implement C binding for MRI.
-3. Test on different versions of Ruby.
 
 ## LICENSE
 Copyright (c) 2012 Alexei Mikhailov

benchmark/benchmark.rb

@@ -1,4 +1,5 @@
 #!/usr/bin/env ruby
+require "rubygems"
 require "bundler/setup"
 require "benchmark"
 require "segment_tree"
@@ -42,6 +43,6 @@ def list(n)
   tests.each do |n|
     data = lists[n]
 
-    x.report(n.to_s) { data.find { |range, _| range.cover?(rand(n)) } }
+    x.report(n.to_s) { data.find { |range, _| range.include?(rand(n)) } }
   end
 end

lib/segment_tree.rb

@@ -1,11 +1,10 @@
 require "forwardable"
-require "segment_tree/version"
 
 class SegmentTree
   # An abstract tree node
   class Node #:nodoc:all:
     extend Forwardable
-    def_delegators :@range, :cover?, :begin, :end
+    def_delegators :@range, :include?, :begin, :end
   end
 
   # An elementary intervals or nodes container
@@ -24,14 +23,14 @@ def initialize(left, right)
     # Find all intervals containing point +x+ within node's children. Returns array
     def find(x)
       [@left, @right].compact.
-                      select { |node| node.cover?(x) }.
+                      select { |node| node.include?(x) }.
                       map    { |node| node.find(x) }.
                       flatten
     end
 
     # Find first interval containing point +x+ within node's children
     def find_first(x)
-      subset = [@left, @right].compact.find { |node| node.cover?(x) }
+      subset = [@left, @right].compact.find { |node| node.include?(x) }
       subset && subset.find_first(x)
     end
 
@@ -56,7 +55,7 @@ def find(x)
     end
 
     def find_first(x)
-      cover?(x) ? self : nil
+      include?(x) ? self : nil
     end
   end
 

lib/segment_tree/version.rb

@@ -1,3 +1,3 @@
 class SegmentTree
-  VERSION = "0.0.1"
-end
+  VERSION = "0.0.2"
+end

segment_tree.gemspec

@@ -8,8 +8,8 @@ Gem::Specification.new do |gem|
   gem.summary       = %q{Tree data structure for storing segments. It allows querying which of the stored segments contain a given point.}
   gem.homepage      = "https://github.com/take-five/segment_tree"
 
-  gem.files         = `git ls-files`.split($\)
-  gem.test_files    = gem.files.grep(%r{^(test|spec|features)/})
+  gem.files         = `git ls-files`.split($\).grep(/lib|spec/)
+  gem.test_files    = gem.files.grep(/spec/)
   gem.name          = "segment_tree"
   gem.require_paths = %W(lib)
   gem.version       = SegmentTree::VERSION

spec/spec_helper.rb

@@ -1,5 +1,4 @@
 require "bundler/setup"
-require "simplecov"
 
 RSpec.configure do |config|
   # Run specs in random order to surface order dependencies. If you find an
@@ -9,4 +8,9 @@
   config.order = 'random'
 end
 
-SimpleCov.start
+if defined?(RUBY_ENGINE) &&
+    RUBY_ENGINE == "ruby" &&
+    RUBY_VERSION > "1.9"
+  require "simplecov"
+  SimpleCov.start
+end