pip 0.0.1 → 0.0.2

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: a12fad99d775a201f8ce86aab5b2d60f2f6d35fa
-  data.tar.gz: 6d8925567260ce6fe869101263f9c0a413d9a23c
+  metadata.gz: aee81813217ab64ca9b10edf1a808f29548a1d6d
+  data.tar.gz: 1f69baac0ba82cae72e7f5aef74311e5abedb76c
 SHA512:
-  metadata.gz: d54baa5b8e41d1a45da837e806bf5893a90332706a82086aafb5d65c0b6d1c23d2ccfc8799a69bd668a90536c1cd5d21bec57762bd587f863ad845448dedc50c
-  data.tar.gz: 3a9b310748b92d7de92f80ceaa0bce1036cdc2e9adf1caca0c4a5c2bc89f257a1041ee9a0b3bd0e53e938d91b5772bde51193c37904a1c417612d62f5db5de38
+  metadata.gz: 0bb21a389cafe4d35f51f1b2c876999bbccba7570554cf25207a71e99688d9cf335fb0d606a499c2da3238e2ae506abd9aca8e6099bd756f3619a3270bdb10f7
+  data.tar.gz: 955c07469d4754e0466044f88554103096f9f3b00d1f62dc900987a27c6718697bfdbdaa6ccfc4d868309c9a63d19bbf1980e0a5eb81d2b7e666f90b4d344054

data/lib/pip/polygon.rb

@@ -0,0 +1,36 @@
+# I know practically nothing about Geometry, I came up with the 
+# algorithm for this by sketching out a few dots and writing specs.
+
+module Pip
+  class Polygon
+    attr_accessor :points
+    def initialize(points)
+      @points = points
+    end
+  
+    def contains?(x,y)
+      (vertical_boundaries_on(y).map{|k| [k,nil]} << [x,x]).sort_by{|one, two| one}.uniq.find_index([x,x]).odd?
+    end
+  
+    def vertical_boundaries_on(target_y)
+      lines.map do |p1, p2| 
+        x = Polygon.coord_at(target_y, p1, p2)
+        comparable = [p1[1], p2[1]].sort
+        next if comparable.uniq.size == 1
+        x if target_y.between?(comparable[0], comparable[1])
+      end.compact.sort
+    end
+  
+    def lines
+      perms = []
+      points.each_with_index {|n, i| perms << [n, points[i+1] || points[0]] }
+      perms
+    end
+  
+    def self.coord_at(y, p1, p2)
+      x1, y1 = p1.map(&:to_f)
+      x2, y2 = p2.map(&:to_f)
+      (y - y1) / (y2 - y1) * (x2 - x1) + x1
+    end
+  end
+end

data/lib/pip/version.rb

@@ -1,3 +1,3 @@
 module Pip
-  VERSION = "0.0.1"
+  VERSION = "0.0.2"
 end

data/spec/lib/polygon_spec.rb

@@ -0,0 +1,152 @@
+require_relative "../../lib/pip"
+
+
+describe Pip::Polygon do
+  let(:poly) { Pip::Polygon.new(points) }
+  describe "square" do
+    let(:points) { [[0,0], [0,2], [2,2], [2,0]] }
+    it "takes args" do
+      expect(poly.points).to eq points
+    end
+    
+    it "finds the vertical boundaries" do
+      expect(poly.vertical_boundaries_on(1)).to eq [0,2]
+    end
+  
+    it "finds if a point is within it" do
+      expect(poly.contains?(1,1)).to be_true
+      expect(poly.contains?(1,3)).to be_false
+    end
+  end
+  
+  describe "utah shape" do
+    let(:points) { [[0,0], [4,0], [4,1], [2,1], [2,2], [0,2]] }
+    
+    it "has vertical boundaries" do
+      expect(poly.vertical_boundaries_on(0)).to eq [0,4]
+      expect(poly.vertical_boundaries_on(1)).to eq [0, 2, 4]
+      expect(poly.vertical_boundaries_on(2)).to eq [0, 2]
+      expect(poly.vertical_boundaries_on(3)).to eq []
+    end
+    
+    it "finds if a point is within a polygon" do
+      expect(poly.contains?(1,1)).to be_true
+      expect(poly.contains?(1,1)).to be_true
+      expect(poly.contains?(0,1)).to be_true
+      expect(poly.contains?(0,0)).to be_true
+      expect(poly.contains?(4,1)).to be_true
+      expect(poly.contains?(4,2)).to be_false
+      expect(poly.contains?(3,2)).to be_false
+      expect(poly.contains?(999,999)).to be_false
+    end
+    
+  end
+  
+  describe "triangle" do
+    let(:points) { [
+      [0,0],
+      [3,0],
+      [1,3]
+    ] }
+    
+    it "finds the points within the polygon" do
+      expect(poly.contains?(2,2)).to be_false
+      expect(poly.contains?(0,1)).to be_false
+      expect(poly.contains?(1,2)).to be_true
+      expect(poly.contains?(2,1)).to be_true
+      expect(poly.contains?(1,1)).to be_true
+      expect(poly.contains?(1,0)).to be_true
+      expect(poly.contains?(0,0)).to be_true
+    end
+    
+    it "finds point equal to a point" do
+      expect(poly.contains?(1,3)).to be_true
+    end
+  end
+  describe "insane shape" do
+    let(:points) { [
+      [10,10],
+      [15,15],
+      [25,5],
+      [30,20],
+      [30,10],
+      [40,30],
+      [31,15],
+      [31,25],
+      [5,24],
+      [10,10]
+    ] }
+    
+    it "finds if a point is within a polygon" do
+      expect(poly.contains?(10,10)).to be_true
+      expect(poly.contains?(10,11)).to be_true
+      expect(poly.contains?(25,6)).to be_true
+      expect(poly.contains?(1,1)).to be_false
+      expect(poly.contains?(40,30)).to be_true
+      expect(poly.contains?(40,30)).to be_true
+      expect(poly.contains?(40,31)).to be_false
+    end
+  end
+  
+  describe "lat longs" do
+    let(:points) { [
+      [47.606973,-122.341175],
+      [47.610098,-122.333536],
+      [47.60408,-122.328086],
+      [47.601707,-122.336283]
+    ] }
+    
+    it "finds if a point is within the longs" do
+      expect(poly.contains?(47.601765,-122.325339)).to be_false
+      expect(poly.contains?(47.603769,-122.324642)).to be_false
+      expect(poly.contains?(47.606337,-122.334566)).to be_true
+      expect(poly.contains?(47.60489,-122.338943)).to be_true
+    end
+  end
+  
+  describe "complicated lat longs" do
+    let(:points) { [
+      [47.606973,-122.341175],
+      [47.605353,-122.33345],
+      [47.610098,-122.333536],
+      [47.601765,-122.325339],
+      [47.601707,-122.336283]
+    ] }
+    
+    it "finds if a point is withing the area" do
+      expect(poly.contains?(47.606452,-122.331519)).to be_true
+      expect(poly.contains?(47.608651,-122.336068)).to be_false
+      expect(poly.contains?(47.606771,-122.334352)).to be_false
+      expect(poly.contains?(47.605121,-122.333064)).to be_true
+      expect(poly.contains?(47.609736,-122.332549)).to be_false
+    end
+  end
+  
+  describe "a super complicated lat long" do
+    let(:points) { [
+      [47.601736,-122.32079],
+      [47.601794,-122.331991],
+      [47.608333,-122.337999],
+      [47.609693,-122.334652],
+      [47.608796,-122.333665],
+      [47.609606,-122.331562],
+      [47.611255,-122.33109],
+      [47.611342,-122.326927],
+      [47.613541,-122.328944],
+      [47.614062,-122.327399],
+      [47.61409,-122.32079]
+    ] }
+    
+    it "finds if a point is withing the area" do
+      expect(poly.contains?(47.608709,-122.335639)).to be_true
+      expect(poly.contains?(47.611024,-122.329888)).to be_true
+      expect(poly.contains?(47.613483,-122.321649)).to be_true
+      expect(poly.contains?(47.606279,-122.328215)).to be_true
+      expect(poly.contains?(47.610272,-122.332678)).to be_false
+      expect(poly.contains?(47.612007,-122.328429)).to be_false
+      expect(poly.contains?(47.605035,-122.335854)).to be_false
+      expect(poly.contains?(47.609288,-122.320747)).to be_false
+      expect(poly.contains?(47.610619,-122.320876)).to be_true
+    end
+  end
+end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: pip
 version: !ruby/object:Gem::Version
-  version: 0.0.1
+  version: 0.0.2
 platform: ruby
 authors:
 - Bookis Smuin
@@ -51,8 +51,10 @@ files:
 - README.md
 - Rakefile
 - lib/pip.rb
+- lib/pip/polygon.rb
 - lib/pip/version.rb
 - pip.gemspec
+- spec/lib/polygon_spec.rb
 homepage: https://github.com/bookis/pip.git
 licenses:
 - MIT
@@ -78,4 +80,5 @@ signing_key:
 specification_version: 4
 summary: Uses a napkin sketch algorithm to determine if a given point is contained
   with any polygon
-test_files: []
+test_files:
+- spec/lib/polygon_spec.rb