cacheable_kdtree 1.0.0 → 1.1.0

checksums.yaml

@@ -1,7 +1,15 @@
 ---
-SHA1:
-  metadata.gz: 0df08204eb2b5ccf4cb9495a44a329573ca4af04
-  data.tar.gz: 90c8dd11173baa5aa4ec78808d42b461da2bd04d
+!binary "U0hBMQ==":
+  metadata.gz: !binary |-
+    ZjBjMDhmMThmNWNhODE5MWYxOTVjM2FmYThkZDE0MzU4M2NmMTAyNw==
+  data.tar.gz: !binary |-
+    ZDU2YjQwOTU5NTRhOTI4MDYzZTRmMjAwMTY2YTM4N2VjNjYzZTk4NA==
 SHA512:
-  metadata.gz: 34040472bdfe529124bb27e14ac6da865c3ee79335787d02b973fcd79c546fe4d34ed66035ec1da40f73ee168c38a9a8e2bc821ea8faae345407e700fb53d685
-  data.tar.gz: 80a110414a30f66a8ad4ad7ea162d832c99fdc1896346a482222629068627fcb4801ce607a24da151f86cd4082d2d904d0820ff6d6162554f292020fd5630b8b
+  metadata.gz: !binary |-
+    ZGNkNTA5MzFmMWFhZWQwZjEyYmZjMmVmOTk4MWMwOGZlMmRmMjE1MWRiNzI2
+    NjZjM2UyNDgxMDdhMjE4ZjU1MzcwYTI1MTlmMDhjZmFhYjAxYjlhZDIyODZm
+    OWUzMGFjYjIwZDNmZWIwOTZkZjJmZWFkNDA0NjM3NjQ2MDhhZGY=
+  data.tar.gz: !binary |-
+    ZTk2OGRkYTdmZTJmZTdiNjcwZDU4YTRhNTA4NjVlYjgzYTc1YjkxNWY5YmY2
+    MDU4MmI2YWU2MWZhOWUwYjE1ZjYxNzcxMWNmZTEwOTM1NDhmZTM5NzBkMGI1
+    YzAwZDI1MmMxNmJjMTllNWY4YWRhNzBkMzQ3YjgwYmVmYzFmNTk=

data/.travis.yml

@@ -9,7 +9,7 @@ deploy:
   provider: rubygems
   api_key:
     secure: TfNKvb7Qzqch5zzbaXv3Qv0m4amPSMQI8rlucf5nW2YxdNBIxGAx9sFeD495V592bzgcnYoeew5OFPOSxVd5YeT+VVu43cJv5gvI+Eouro7r4AKTuJjLcMRvmZvhy5RZrPhph1QwbDHbEcGTpqKcbXka8aURKgsnZzdsf66/iezp30/+q3gkWvUz94b4bBkcHMELsnwvlUX5XukVPP8Zh73YYzUy1Dh6UZiV/Reio2fQb+giSd1FafyptI5LXgmnNhnuLGwOajFgbEYr4ZFg8SfvlQ1SKZzHvH3tsFNUrCcsklowcbks/G/Hb/lOjZpqQH9M4BFrVwYNDEGN8pkmB6mBO56nK6JW4qJwh38MpAhhrLScy8IJw+D9tajkGMyjezb2svqWvMWQ6bdyBeeEsVF51oBqIXD/tadIAVY41ngCvcFw+zzi9568W27CL/9idFHi7rSB1Q/RLNIF2/uT0lt4eOk8Gr8Zyh/YImb3ktXSu4JwWQEfj4m+xugFXL1F/XkkOi/cSNq1tBf2J2LUCe+DxCogGWz5LbiY/aU1sfM4TJmp6awPP6JBv+qujJvVCJblKX/HIhIkfW0o1q1e639JYMTq/6DlIJQk+D9hXzY4X/lrsLlH7zYRie+HCxgxSg1tKTiZkfmohY3GOLLy8W/LfaR/ma622MLWjIIyUVM=
-  gem: kdtree
+  gem: cacheable_kdtree
   on:
     tags: true
-    repo: aaronFranssell/kdtree
+    repo: aaronFranssell/cacheable_kdtree

data/README.md

@@ -1,6 +1,6 @@
-[![Build Status](https://travis-ci.org/aaronFranssell/kdtree.svg?branch=master)](https://travis-ci.org/aaronFranssell/kdtree)
-[![Code Climate](https://codeclimate.com/github/aaronFranssell/kdtree/badges/gpa.svg)](https://codeclimate.com/github/aaronFranssell/kdtree)
-[![Test Coverage](https://codeclimate.com/github/aaronFranssell/kdtree/badges/coverage.svg)](https://codeclimate.com/github/aaronFranssell/kdtree/coverage)
+[![Build Status](https://travis-ci.org/aaronFranssell/cacheable_kdtree.svg?branch=master)](https://travis-ci.org/aaronFranssell/cacheable_kdtree)
+[![Code Climate](https://codeclimate.com/github/aaronFranssell/cacheable_kdtree/badges/gpa.svg)](https://codeclimate.com/github/aaronFranssell/cacheable_kdtree)
+[![Test Coverage](https://codeclimate.com/github/aaronFranssell/cacheable_kdtree/badges/coverage.svg)](https://codeclimate.com/github/aaronFranssell/cacheable_kdtree/coverage)
 
 # Kd-tree
 
@@ -19,13 +19,13 @@ gem 'cacheable_kdtree'
 A Kd-tree is made up of multiple nodes. A single node contains the data associated with the latitude/longitude:
 
 ```ruby
-Kdtree::LatitudeLongitudeNode.new(your_data_here, latitude_of_your_data, longitude_of_your_data)
+CacheableKdtree::LatitudeLongitudeNode.new(your_data_here, latitude_of_your_data, longitude_of_your_data)
 ```
 
 Once you have an array of nodes, you can create a Kd-tree:
 ```ruby
-nodes = [Kdtree::LatitudeLongitudeNode.new(...), Kdtree::LatitudeLongitudeNode.new(...)]
-my_tree = Kdtree::LatitudeLongitudeTree.new(nodes)
+nodes = [CacheableKdtree::LatitudeLongitudeNode.new(...), CacheableKdtree::LatitudeLongitudeNode.new(...)]
+my_tree = CacheableKdtree::LatitudeLongitudeTree.new(nodes)
 ```
 
 You can query your tree and return the closest nodes:
@@ -36,7 +36,7 @@ all_my_nodes = my_tree.closest(my_lat, my_long, distance, :kilometers)
 
 ## Contributing
 
-Bug reports and pull requests are welcome on GitHub at https://github.com/aaronFranssell/kdtree.
+Bug reports and pull requests are welcome on GitHub at https://github.com/aaronFranssell/cacheable_kdtree.
 
 Please make sure all tests pass and that [Rubocop](https://github.com/bbatsov/rubocop) is happy:
 ```ruby

data/{kdtree.gemspec → cacheable_kdtree.gemspec}

@@ -1,16 +1,16 @@
 # coding: utf-8
 lib = File.expand_path('../lib', __FILE__)
 $LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
-require 'kdtree/version'
+require 'cacheable_kdtree/version'
 
 Gem::Specification.new do |spec|
   spec.name          = 'cacheable_kdtree'
-  spec.version       = Kdtree::VERSION
+  spec.version       = CacheableKdtree::VERSION
   spec.authors       = ['Aaron Franssell']
   spec.email         = ['aaron.franssell@gmail.com']
 
   spec.summary       = 'My implementation of a 2d k-d tree'
-  spec.homepage      = 'https://github.com/aaronFranssell/kdtree'
+  spec.homepage      = 'https://github.com/aaronFranssell/cacheable_kdtree'
 
   spec.files         = `git ls-files -z`.split("\x0").reject { |f| f.match(/^(test|spec|features)/) }
   spec.bindir        = 'exe'

data/lib/{kdtree → cacheable_kdtree}/latitude_longitude_node.rb

@@ -1,4 +1,4 @@
-class Kdtree::LatitudeLongitudeNode
+class CacheableKdtree::LatitudeLongitudeNode
   attr_accessor :left, :right, :data, :latitude, :longitude, :region
 
   def initialize(node_data, node_lat, node_long)
@@ -12,7 +12,7 @@ class Kdtree::LatitudeLongitudeNode
   end
 
   def self.create_or_merge_regions(n1, n2)
-    return Kdtree::LatitudeLongitudeRegion.new(n1.latitude, n1.longitude, n2.latitude, n2.longitude) if n1.region.nil? && n2.region.nil?
+    return CacheableKdtree::LatitudeLongitudeRegion.new(n1.latitude, n1.longitude, n2.latitude, n2.longitude) if n1.region.nil? && n2.region.nil?
     return n1.region.merge_point(n2.latitude, n2.longitude) if n1.region && n2.region.nil?
     return n2.region.merge_point(n1.latitude, n1.longitude) if n2.region && n1.region.nil?
     n1.region.merge_region(n2.region)

data/lib/{kdtree → cacheable_kdtree}/latitude_longitude_region.rb

@@ -1,4 +1,4 @@
-class Kdtree::LatitudeLongitudeRegion
+class CacheableKdtree::LatitudeLongitudeRegion
   attr_accessor :max_latitude, :max_longitude, :min_latitude, :min_longitude
   def initialize(lat1, long1, lat2, long2)
     @min_latitude, @max_latitude = [lat1, lat2].minmax

data/lib/{kdtree → cacheable_kdtree}/latitude_longitude_tree.rb

@@ -1,4 +1,4 @@
-class Kdtree::LatitudeLongitudeTree
+class CacheableKdtree::LatitudeLongitudeTree
   attr_accessor :root
 
   def initialize(node_list)
@@ -9,7 +9,11 @@ class Kdtree::LatitudeLongitudeTree
   def closest(lat, long, distance, units = :miles)
     fail 'Input must be numeric.' unless lat.is_a?(Numeric) && long.is_a?(Numeric) && distance.is_a?(Numeric)
     fail 'Units must be either :kilometers or :miles.' unless %i(miles kilometers).include?(units)
-    bounding_box = units == :miles ? Kdtree::Util.bounding_box_miles(lat, long, distance) : Kdtree::Util.bounding_box_kilometers(lat, long, distance)
+    bounding_box = if units == :miles
+                     CacheableKdtree::Util.bounding_box_miles(lat, long, distance)
+                   else
+                     CacheableKdtree::Util.bounding_box_kilometers(lat, long, distance)
+                   end
     nearest_nodes(bounding_box)
   end
 
@@ -26,15 +30,15 @@ class Kdtree::LatitudeLongitudeTree
   def search_child?(child, bounding_box)
     child &&
       (bounding_box.point_in_region?(child.latitude, child.longitude) ||
-      (child.region && Kdtree::LatitudeLongitudeRegion.regions_intersect?(child.region, bounding_box)))
+      (child.region && CacheableKdtree::LatitudeLongitudeRegion.regions_intersect?(child.region, bounding_box)))
   end
 
   def find_regions(node)
     return unless node
     left_region = find_regions(node.left)
-    left_region = Kdtree::LatitudeLongitudeNode.create_or_merge_regions(node, node.left) if node.left
+    left_region = CacheableKdtree::LatitudeLongitudeNode.create_or_merge_regions(node, node.left) if node.left
     right_region = find_regions(node.right)
-    right_region = Kdtree::LatitudeLongitudeNode.create_or_merge_regions(node, node.right) if node.right
+    right_region = CacheableKdtree::LatitudeLongitudeNode.create_or_merge_regions(node, node.right) if node.right
     node.region = merge_regions(left_region, right_region)
     node.region
   end
@@ -48,8 +52,8 @@ class Kdtree::LatitudeLongitudeTree
   def create_tree(node_list, depth = 0)
     return if node_list.empty?
     return node_list.first if node_list.length == 1
-    sorted_list = Kdtree::LatitudeLongitudeNode.sort_node_list(node_list, depth)
-    lower_half, midpoint, greater_half = Kdtree::LatitudeLongitudeNode.partition_node_list(sorted_list)
+    sorted_list = CacheableKdtree::LatitudeLongitudeNode.sort_node_list(node_list, depth)
+    lower_half, midpoint, greater_half = CacheableKdtree::LatitudeLongitudeNode.partition_node_list(sorted_list)
     midpoint.left = create_tree(lower_half, depth + 1)
     midpoint.right = create_tree(greater_half, depth + 1)
     midpoint

data/lib/{kdtree → cacheable_kdtree}/util.rb

@@ -1,4 +1,4 @@
-class Kdtree::Util
+class CacheableKdtree::Util
   EARTH_MILES = 3959.0
   EARTH_KILOMETERS = 6371.0
 
@@ -20,7 +20,7 @@ class Kdtree::Util
     long_amount = radians_to_degrees(radius_distance / sphere_radius / Math.cos(degrees_to_radians(lat)))
     long1 = long - long_amount
     long2 = long + long_amount
-    Kdtree::LatitudeLongitudeRegion.new(lat1, long1, lat2, long2)
+    CacheableKdtree::LatitudeLongitudeRegion.new(lat1, long1, lat2, long2)
   end
 
   def self.degrees_to_radians(degrees)

data/lib/cacheable_kdtree/version.rb

@@ -0,0 +1,3 @@
+module CacheableKdtree
+  VERSION = '1.1.0'.freeze
+end

data/lib/{kdtree.rb → cacheable_kdtree.rb}

@@ -4,4 +4,4 @@
   latitude_longitude_region
   latitude_longitude_tree
   util
-).each { |name| require "kdtree/#{name}" }
+).each { |name| require "cacheable_kdtree/#{name}" }

metadata

@@ -1,55 +1,55 @@
 --- !ruby/object:Gem::Specification
 name: cacheable_kdtree
 version: !ruby/object:Gem::Version
-  version: 1.0.0
+  version: 1.1.0
 platform: ruby
 authors:
 - Aaron Franssell
 autorequire: 
 bindir: exe
 cert_chain: []
-date: 2016-03-20 00:00:00.000000000 Z
+date: 2016-04-02 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: bundler
   requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - "~>"
+    - - ~>
       - !ruby/object:Gem::Version
         version: '1.10'
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
-    - - "~>"
+    - - ~>
       - !ruby/object:Gem::Version
         version: '1.10'
 - !ruby/object:Gem::Dependency
   name: rake
   requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - "~>"
+    - - ~>
       - !ruby/object:Gem::Version
         version: '10.0'
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
-    - - "~>"
+    - - ~>
       - !ruby/object:Gem::Version
         version: '10.0'
 - !ruby/object:Gem::Dependency
   name: minitest
   requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - ">="
+    - - ! '>='
       - !ruby/object:Gem::Version
         version: '0'
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
-    - - ">="
+    - - ! '>='
       - !ruby/object:Gem::Version
         version: '0'
 - !ruby/object:Gem::Dependency
@@ -70,42 +70,42 @@ dependencies:
   name: simplecov
   requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - "~>"
+    - - ~>
       - !ruby/object:Gem::Version
         version: 0.10.0
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
-    - - "~>"
+    - - ~>
       - !ruby/object:Gem::Version
         version: 0.10.0
 - !ruby/object:Gem::Dependency
   name: simplecov-rcov
   requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - "~>"
+    - - ~>
       - !ruby/object:Gem::Version
         version: 0.2.3
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
-    - - "~>"
+    - - ~>
       - !ruby/object:Gem::Version
         version: 0.2.3
 - !ruby/object:Gem::Dependency
   name: mocha
   requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - "~>"
+    - - ~>
       - !ruby/object:Gem::Version
         version: 1.1.0
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
-    - - "~>"
+    - - ~>
       - !ruby/object:Gem::Version
         version: 1.1.0
 description: 
@@ -115,22 +115,22 @@ executables: []
 extensions: []
 extra_rdoc_files: []
 files:
-- ".gitignore"
-- ".rubocop.yml"
-- ".travis.yml"
+- .gitignore
+- .rubocop.yml
+- .travis.yml
 - Gemfile
 - README.md
 - Rakefile
 - bin/console
 - bin/setup
-- kdtree.gemspec
-- lib/kdtree.rb
-- lib/kdtree/latitude_longitude_node.rb
-- lib/kdtree/latitude_longitude_region.rb
-- lib/kdtree/latitude_longitude_tree.rb
-- lib/kdtree/util.rb
-- lib/kdtree/version.rb
-homepage: https://github.com/aaronFranssell/kdtree
+- cacheable_kdtree.gemspec
+- lib/cacheable_kdtree.rb
+- lib/cacheable_kdtree/latitude_longitude_node.rb
+- lib/cacheable_kdtree/latitude_longitude_region.rb
+- lib/cacheable_kdtree/latitude_longitude_tree.rb
+- lib/cacheable_kdtree/util.rb
+- lib/cacheable_kdtree/version.rb
+homepage: https://github.com/aaronFranssell/cacheable_kdtree
 licenses: []
 metadata: {}
 post_install_message: 
@@ -139,17 +139,17 @@ require_paths:
 - lib
 required_ruby_version: !ruby/object:Gem::Requirement
   requirements:
-  - - ">="
+  - - ! '>='
     - !ruby/object:Gem::Version
       version: '0'
 required_rubygems_version: !ruby/object:Gem::Requirement
   requirements:
-  - - ">="
+  - - ! '>='
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
 rubyforge_project: 
-rubygems_version: 2.4.7
+rubygems_version: 2.4.5
 signing_key: 
 specification_version: 4
 summary: My implementation of a 2d k-d tree

data/lib/kdtree/version.rb

@@ -1,3 +0,0 @@
-module Kdtree
-  VERSION = '1.0.0'.freeze
-end