db_binary_search 1.0.0 → 1.1.1

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 9b18dd20f169cd30905d627d4b12541f7337e318
-  data.tar.gz: 054ddf798975a297cd62fe6c48d260bea69ca30a
+  metadata.gz: 7344d69362e835f84a56f046bdc3711c9fb578a6
+  data.tar.gz: 367024ece1a37954ffc6c51c09981fa55c0e37b2
 SHA512:
-  metadata.gz: ee9e6b53bef4f1395f0e69be994d080317e80f1b55d2e0cd25c7f2a67960e6ccaca119865a83c4c6db416723ab77957a24aa97f5ab3a1531051490e1088ef322
-  data.tar.gz: 09e6222d049611b7d9d0818ce80c9903efe574d34a571a8b03ce3b6d59fef7009f3d1de04095be191563d63b46837f253c47ec233041770557bfd198bd8b5c89
+  metadata.gz: 9c887e3c72bc884f7240e38e0ed21db59f8c41677d083d33bad081ee66e76fbc2810959684f806d3d53b2af4c5970279c7739397c08363336ecae63c048a28f7
+  data.tar.gz: 9c65aeff3195a6d30cf1d44d16e9a4e4519e2d38582be7d77ca1b1099b94f5a80e3841f3dfa057359b84abc014feb031909245dbde8a66a9a3010c83af67d87e

data/README.md

@@ -2,12 +2,12 @@
 
 ![License](https://img.shields.io/badge/license-MIT-blue.svg?style=flat)
 [![CI Status](http://img.shields.io/travis/acrookston/db_binary_search.svg?style=flat)](https://travis-ci.org/acrookston/db_binary_search)
-[![codebeat badge](https://codebeat.co/badges/24f76413-0c57-410c-9e90-45b5309e6442)](https://codebeat.co/projects/github-com-acrookston-db_binary_search)
+[![Code Climate](https://codeclimate.com/github/acrookston/db_binary_search/badges/gpa.svg)](https://codeclimate.com/github/acrookston/db_binary_search)
 [![codecov](https://codecov.io/gh/acrookston/db_binary_search/branch/master/graph/badge.svg)](https://codecov.io/gh/acrookston/db_binary_search)
 
 
 An Active Support concern extending Active Record with the ability to binary
-search a table for use with non-indexed, chronologically sorted tables.
+search a table for use with non-indexed, sorted tables.
 
 The gem allows you to avoid slow database scans if you have an
 auto-incrementing primary key running in parallel with a column which
@@ -59,8 +59,8 @@ binary_search(column, value, lower_id=nil, upper_id=nil)
 
 - `column` a symbol, is the table column to search for.
 - `value` a comparable value of same type as `column`, the value you are searching for.
-- `lower_id` optional primary key value to start searching lower bound at.
-- `upper_id` optional primary key value to start searching upper bound at.
+- `lower_id` optional primary key value to start searching lower bound at. Defaults to `model.first.id`.
+- `upper_id` optional primary key value to start searching upper bound at. Defaults to `model.last.id`.
 
 Full example:
 
@@ -81,7 +81,7 @@ To install this gem onto your local machine, run `bundle exec rake install`. To
 
 ## Contributing
 
-Bug reports and pull requests are welcome on GitHub at https://github.com/arookston/db_binary_search.
+Bug reports and pull requests are welcome on GitHub at https://github.com/acrookston/db_binary_search.
 
 If you're making a big change, please open an Issue first, so we can discuss. Otherwise:
 

data/db_binary_search.gemspec

@@ -9,8 +9,11 @@ Gem::Specification.new do |spec|
   spec.authors       = ["Andrew Crookston"]
   spec.email         = ["andrew@caoos.com"]
 
-  spec.summary       = %q{An Active Support concern extending Active Record with the ability to binary search a table for use with non-indexed, chronologically sorted tables.}
+  spec.summary       = %q{An Active Support concern extending Active Record with the ability to binary search a table for use with non-indexed, sorted tables.}
   spec.description   = %q{
+    An Active Support concern extending Active Record with the ability to binary
+    search a table for use with non-indexed, sorted tables.
+
     The gem allows you to avoid slow database scans if you have an
     auto-incrementing primary key running in parallel with a column which
     you want to search.

data/lib/db_binary_search.rb

@@ -4,8 +4,8 @@ require 'active_record'
 module DBBinarySearch
   extend ActiveSupport::Concern
 
-  class_methods do
-    def binary_search(column, value, lower_id=nil, upper_id=nil)
+  included do
+    def self.binary_search(column, value, lower_id=nil, upper_id=nil)
       lower_id = self.first.id unless lower_id
       upper_id = self.last.id unless upper_id
 

data/lib/db_binary_search/version.rb

@@ -1,3 +1,3 @@
 module DBBinarySearch
-  VERSION = "1.0.0"
+  VERSION = "1.1.1"
 end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: db_binary_search
 version: !ruby/object:Gem::Version
-  version: 1.0.0
+  version: 1.1.1
 platform: ruby
 authors:
 - Andrew Crookston
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2017-01-29 00:00:00.000000000 Z
+date: 2017-02-01 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: activerecord
@@ -122,9 +122,10 @@ dependencies:
     - - ">="
       - !ruby/object:Gem::Version
         version: '0'
-description: "\n    The gem allows you to avoid slow database scans if you have an\n
-  \   auto-incrementing primary key running in parallel with a column which\n    you
-  want to search.\n  "
+description: "\n    An Active Support concern extending Active Record with the ability
+  to binary\n    search a table for use with non-indexed, sorted tables.\n\n    The
+  gem allows you to avoid slow database scans if you have an\n    auto-incrementing
+  primary key running in parallel with a column which\n    you want to search.\n  "
 email:
 - andrew@caoos.com
 executables: []
@@ -168,5 +169,6 @@ rubygems_version: 2.4.3
 signing_key: 
 specification_version: 4
 summary: An Active Support concern extending Active Record with the ability to binary
-  search a table for use with non-indexed, chronologically sorted tables.
+  search a table for use with non-indexed, sorted tables.
 test_files: []
+has_rdoc: