ruby-geometry 0.0.4 → 0.0.5

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: ceb19ba1fb790c21207f0d8b7543b64676e8c4d0
+  data.tar.gz: c69308a99ef8aee203bdad69478e0b2108f7fea1
+SHA512:
+  metadata.gz: e4c5e0981ef218e99c704aefbf9410e2fe2c62dd1a650a790fd2fd6b4194869c46f77154242a444ff335960853cbc1a86f0225964bdaf884a23922f87966a9e7
+  data.tar.gz: 326038ae5819fa77e6986a78eb5b04b6eee0a4ff66e89d0b483fd426bb42965a5d700f201552299bcb6a0b96677168f06a0cac36487bcfb11d3ca31aca2c9a8e

data/.gitignore

@@ -0,0 +1,5 @@
+nbproject
+bin/*
+pkg
+.idea
+Gemfile.lock

data/.ruby-version

@@ -0,0 +1 @@
+2.0.0

data/Gemfile

@@ -0,0 +1,3 @@
+source "http://rubygems.org"
+
+gemspec

data/MIT-LICENSE

@@ -0,0 +1,20 @@
+Copyright (c) 2008 Daniel Vartanov
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+"Software"), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
+LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

data/README.md

@@ -0,0 +1,92 @@
+Geometry in Ruby
+================
+
+Implementation of basic 2D geometry algorithms in Ruby.
+
+
+Installation
+============
+```ruby
+gem 'ruby-geometry', require: 'geometry'
+```
+
+
+Defined geometry objects
+========================
+
+  * Point
+
+  * Segment
+
+  * Vector
+
+  * Polygon
+
+  * Line
+
+
+Already implemented algorithms
+==============================
+
+  * Do segments overlap? { Segments#overlaps? }
+
+  * Do segments lie on one line? { Segment#lies_on_one_line_with? }
+
+  * Do segments intersect? { Segment#intersects_with? }
+
+  * Segments intersection point { Segment#intersection_point_with }
+
+  * Does segment contain given point?  { Segment#contains_point? }
+
+  * Are segments parallel? { Segment#parallel_to? }
+
+  * Are vectors collinear? { Vector#collinear_with? }
+
+  * Vectors cross product (outer product, vector product) { Vector#cross_product }
+
+  * Vectors scalar product (inner product, dot product) { Vector#scalar_product }
+
+  * Segment length { Segment#length }
+
+  * Vector modulus { Vector#modulus }
+
+  * Trivial vector arithmetics: summation, subtraction, vector-number multiplication { Vector#+(vector); Vector#-(vector); Vector#*(numeric) }
+
+  * Euclid distance { Geometry#distance }
+
+  * Line slope { Line#slope }
+
+  * Y-intercept of a line { Line#y_intercept }
+
+  * X-intercept of a line { Line#x_intercept }
+
+  * Are lines parallel? { Line#parallel_to? }
+
+  * What x-value do lines intersect at? { Line#intersect_x }
+
+  * What is the angle between two lines? { Line#angle_to }
+
+  * Rectangular bounds of polygon { Polygon#bounding_box }   
+  
+  * Does polygon contain a given point? { Polygon#contains? }
+
+
+Coming up
+=========
+
+  * Is polygon self-intersecting?
+
+  * Area of polygon
+
+  * Is polygon convex?  
+
+  * Do polygons intersect?
+
+  * Does circle contain given point?
+
+  * Do circles intersect?
+
+  * Area of circle
+  
+
+Copyright (c) 2008 Daniel Vartanov, released under the MIT license

data/Rakefile

@@ -0,0 +1,13 @@
+require 'rake/dsl_definition'
+require 'rake'
+require 'rake/testtask'
+require 'bundler/gem_tasks'
+
+task default: :test
+
+Rake::TestTask.new do |t|
+  t.libs << "lib"
+  t.libs << "test"
+  t.test_files = FileList['test/**/*_test.rb']
+  t.verbose = true
+end

data/TODO

@@ -0,0 +1,35 @@
+== Auxiliary features
+* Methods requests tagging
+
+If algorithm requires some state or property of object, it should be tagged.
+Requirements should be checked before each method call (of course, info should
+be cached due to computational complexity of algorithms).
+Example:
+
+class Polygon
+
+  def convex?
+    ...
+  end
+
+  def self_intersecting?
+    ...
+  end
+
+  must_be :convex
+  must_not_be :self_intersecting
+  def contains_point?(point)
+    ... # code, which assumes, that polygon is convex and not self_intersecting
+  end
+
+== Algorithms
+
+* Polygon convexity
+* Polygons intersection
+* Polygon contains given point?
+* Rectangular bounds of polygon
+* Area of polygon
+* Does circle contain given point?
+* Do circles intersect?
+* Area of circle
+* Making a ruby gem

data/lib/line.rb

@@ -77,5 +77,17 @@ module Geometry
       oa = Math::atan(other.slope)
       (sa-oa).abs
     end
+
+    def distance_to(point)
+      x0 = point.x
+      y0 = point.y
+
+      x1 = point1.x
+      x2 = point2.x
+      y1 = point1.y
+      y2 = point2.y
+
+      (((x2-x1)*(y1-y0))-((x1-x0)*(y2-y1))).abs/Math.sqrt((x2-x1)**2+(y2-y1)**2)
+    end
   end
 end

data/lib/point.rb

@@ -1,12 +1,20 @@
 module Geometry
   class Point < Struct.new(:x, :y)
-    def self.new_by_array(array)      
+    def self.new_by_array(array)
       self.new(array[0], array[1])
     end
 
     def ==(another_point)
       x === another_point.x && y === another_point.y
     end
+
+    def to_vector
+      Vector.new(x, y)
+    end
+
+    def advance_by(vector)
+      Point x + vector.x, y + vector.y
+    end
   end
 end
 

data/lib/polygon.rb

@@ -21,6 +21,17 @@ module Geometry
       point_in_polygon = PointInPolygon.new(point, self)
       point_in_polygon.inside? || point_in_polygon.on_the_boundary?
     end
+
+    def area
+      sum = 0.0
+      (0..vertices.length-1).each do |i|
+        a = vertices[i-1]
+        b = vertices[i]
+
+        sum = sum + ((a.x * b.y) - (a.y * b.x))
+      end
+      (sum/2).abs
+    end
   end
 end
 

data/lib/segment.rb

@@ -66,6 +66,29 @@ module Geometry
       Point.new(x, y)
     end
 
+    def distance_to(point)
+      q = point.to_vector
+      p1 = point1.to_vector
+      p2 = point2.to_vector
+
+      u = p2 - p1
+      v = q - p1
+
+      a = u.scalar_product(v)
+      if a < 0
+        p = p1
+      else
+        b = u.scalar_product(u)
+        if a > b
+          p = p2
+        else
+          p = p1 + (a.to_f / b * u)
+        end
+      end
+
+      return Geometry.distance(q, p)
+    end
+
     def length      
       Geometry.distance(point1, point2)
     end

data/ruby-geometry.gemspec

@@ -0,0 +1,22 @@
+Gem::Specification.new do |s|
+  s.name = "ruby-geometry"
+  s.version = "0.0.5"
+  s.author = ["Daniel Vartanov"]
+  s.email = ["dan@vartanov.net"]
+  s.homepage = "http://github.com/DanielVartanov/ruby-geometry"
+  s.summary = "Implementation of basic 2D geometry algorithms in Ruby"
+  s.has_rdoc = false
+  s.license = "MIT"
+
+  s.files         = `git ls-files`.split($/)
+  s.executables   = s.files.grep(%r{^bin/}) { |f| File.basename(f) }
+  s.test_files    = s.files.grep(%r{^(test|spec|features)/})
+  s.require_paths = ["lib"]
+
+  s.add_dependency 'activesupport'
+  s.add_dependency 'memoist'
+
+  s.add_development_dependency 'bundler'
+  s.add_development_dependency 'rake'
+  s.add_development_dependency 'minitest'
+end

data/test/bounding_box/contains_test.rb

@@ -1,7 +1,7 @@
-require 'test/unit'
+require 'minitest/autorun'
 require 'geometry'
 
-class ContainsTest < Test::Unit::TestCase
+class ContainsTest < MiniTest::Unit::TestCase
   include Geometry
 
   def bounding_box

data/test/geometry/distance_test.rb

@@ -1,7 +1,7 @@
-require 'test/unit'
+require 'minitest/autorun'
 require 'geometry'
 
-class DistanceTest < Test::Unit::TestCase
+class DistanceTest < MiniTest::Unit::TestCase
   include Geometry
 
   def test_trivial_cases    

data/test/line/angle_to_test.rb

@@ -1,7 +1,7 @@
-require 'test/unit'
+require 'minitest/autorun'
 require 'geometry'
 
-class AngleToTest < Test::Unit::TestCase
+class AngleToTest < MiniTest::Unit::TestCase
   include Geometry
 
   def test_angle_to_self

data/test/line/distance_to_test.rb

@@ -0,0 +1,18 @@
+require 'minitest/autorun'
+require 'geometry'
+
+class DistanceToTest < MiniTest::Unit::TestCase
+  include Geometry
+
+  def test_distance_to_point_on_line
+    line = Line.new_by_arrays([0, 2], [2, 0])
+    point = Point.new(1,1)
+    assert_equal 0, line.distance_to(point)
+  end
+
+  def test_distance_to_flat_line
+    line = Line.new_by_arrays([0, 1], [2, 1])
+    point = Point.new(1, 2)
+    assert_equal 1, line.distance_to(point)
+  end
+end

data/test/line/horizontal_test.rb

@@ -1,7 +1,7 @@
-require 'test/unit'
+require 'minitest/autorun'
 require 'geometry'
 
-class HorizontalTest < Test::Unit::TestCase
+class HorizontalTest < MiniTest::Unit::TestCase
   include Geometry
 
   def test_horizontal

data/test/line/initialize_test.rb

@@ -1,7 +1,7 @@
-require 'test/unit'
+require 'minitest/autorun'
 require 'geometry'
 
-class InitializeTest < Test::Unit::TestCase
+class InitializeTest < MiniTest::Unit::TestCase
   include Geometry
 
   def test_initialize_by_points

data/test/line/intersect_x_test.rb

@@ -1,7 +1,7 @@
-require 'test/unit'
+require 'minitest/autorun'
 require 'geometry'
 
-class IntersectXTest < Test::Unit::TestCase
+class IntersectXTest < MiniTest::Unit::TestCase
   include Geometry
 
   def test_vertical_non_overlapping

data/test/line/parallel_to_test.rb

@@ -1,7 +1,7 @@
-require 'test/unit'
+require 'minitest/autorun'
 require 'geometry'
 
-class ParallelToTest < Test::Unit::TestCase
+class ParallelToTest < MiniTest::Unit::TestCase
   include Geometry
 
   def test_identical

data/test/line/slope_test.rb

@@ -1,7 +1,7 @@
-require 'test/unit'
+require 'minitest/autorun'
 require 'geometry'
 
-class SlopeTest < Test::Unit::TestCase
+class SlopeTest < MiniTest::Unit::TestCase
   include Geometry
 
   def setup

data/test/line/vertical_test.rb

@@ -1,7 +1,7 @@
-require 'test/unit'
+require 'minitest/autorun'
 require 'geometry'
 
-class VerticalTest < Test::Unit::TestCase
+class VerticalTest < MiniTest::Unit::TestCase
   include Geometry
 
   def test_vertical

data/test/line/x_intercept_test.rb

@@ -1,7 +1,7 @@
-require 'test/unit'
+require 'minitest/autorun'
 require 'geometry'
 
-class XInterceptTest < Test::Unit::TestCase
+class XInterceptTest < MiniTest::Unit::TestCase
   include Geometry
 
   def setup

data/test/line/y_intercept_test.rb

@@ -1,7 +1,7 @@
-require 'test/unit'
+require 'minitest/autorun'
 require 'geometry'
 
-class YInterceptTest < Test::Unit::TestCase
+class YInterceptTest < MiniTest::Unit::TestCase
   include Geometry
 
   def setup

data/test/point/advance_by_test.rb

@@ -0,0 +1,12 @@
+require 'minitest/autorun'
+require 'geometry'
+
+class AdvanceByTest < MiniTest::Unit::TestCase
+  include Geometry
+
+  def test_advance_by
+    point = Point.new(10, 15)
+    vector = Vector.new(-5, -10)
+    assert_equal Point.new(5, 5), point.advance_by(vector)
+  end
+end

data/test/point/equals_test.rb

@@ -1,7 +1,7 @@
-require 'test/unit'
+require 'minitest/autorun'
 require 'geometry'
  
-class EqualsTest < Test::Unit::TestCase
+class EqualsTest < MiniTest::Unit::TestCase
   include Geometry
 
   def test_equal    

data/test/point/initialize_test.rb

@@ -1,7 +1,7 @@
-require 'test/unit'
+require 'minitest/autorun'
 require 'geometry'
 
-class InitializeTest < Test::Unit::TestCase
+class InitializeTest < MiniTest::Unit::TestCase
   include Geometry
   
   def test_initialize_by_numbers

data/test/polygon/bounding_box_test.rb

@@ -1,7 +1,7 @@
-require 'test/unit'
+require 'minitest/autorun'
 require 'geometry'
 
-class BoundingBoxTest < Test::Unit::TestCase
+class BoundingBoxTest < MiniTest::Unit::TestCase
   include Geometry
 
   def test_rectangle

data/test/polygon/contains_point_test.rb

@@ -1,7 +1,7 @@
-require 'test/unit'
+require 'minitest/autorun'
 require 'geometry'
 
-class ContainsPointTest < Test::Unit::TestCase
+class ContainsPointTest < MiniTest::Unit::TestCase
   include Geometry
 
   def test_convex

data/test/polygon/edges_test.rb

@@ -1,7 +1,7 @@
-require 'test/unit'
+require 'minitest/autorun'
 require 'geometry'
 
-class EdgesTest < Test::Unit::TestCase
+class EdgesTest < MiniTest::Unit::TestCase
   include Geometry
   
 #  +-----+

data/test/polygon/polygon_area_test.rb

@@ -0,0 +1,35 @@
+require 'minitest/autorun'
+require 'geometry'
+
+class PolygonAreaTest < MiniTest::Unit::TestCase
+  include Geometry
+  def test_area_of_empty_polygon
+    polygon = Polygon.new []
+
+    assert_equal 0, polygon.area
+  end
+
+  def test_area_of_two_points_polygon
+    polygon = Polygon.new [Point(0,0), Point(1,1)]
+
+    assert_equal 0, polygon.area
+  end
+
+  def test_area_of_triangle
+    polygon = Polygon.new [Point(0,0), Point(1,1), Point(0,1)]
+
+    assert_equal 0.5, polygon.area
+  end
+
+  def test_area_of_square
+    polygon = Polygon.new [Point(0,0), Point(0,2), Point(2,2), Point(2,0)]
+
+    assert_equal 4, polygon.area
+  end
+
+  def test_area_of_quadralateral
+    polygon = Polygon.new [Point(4,10), Point(9,7), Point(11,2), Point(2,2)]
+
+    assert_equal 45.5, polygon.area
+  end
+end

data/test/segment/bounds_test.rb

@@ -1,7 +1,7 @@
-require 'test/unit'
+require 'minitest/autorun'
 require 'geometry'
 
-class BoundsTest < Test::Unit::TestCase
+class BoundsTest < MiniTest::Unit::TestCase
   include Geometry
 
   def setup

data/test/segment/contains_point_test.rb

@@ -1,7 +1,7 @@
-require 'test/unit'
+require 'minitest/autorun'
 require 'geometry'
 
-class ContainsPointTest < Test::Unit::TestCase
+class ContainsPointTest < MiniTest::Unit::TestCase
   include Geometry
 
   #  ----*----

data/test/segment/distance_to_test.rb

@@ -0,0 +1,31 @@
+require 'minitest/autorun'
+require 'geometry'
+
+class DistanceToTest < MiniTest::Unit::TestCase
+  include Geometry
+
+  def test_distance_to_point_on_segment
+    segment = Segment.new_by_arrays([0, 2], [2, 0])
+    point = Point.new(1,1)
+    assert_equal 0, segment.distance_to(point)
+  end
+
+  def test_distance_to_flat_segment
+    segment = Segment.new_by_arrays([0, 1], [2, 1])
+    point = Point.new(1, 2)
+    assert_equal 1, segment.distance_to(point)
+  end
+
+  def test_distance_to_segment_start
+    segment = Segment.new_by_arrays([1, 1], [2, 1])
+    point = Point.new(0, 1)
+    assert_equal 1, segment.distance_to(point)
+  end
+
+  def test_distance_to_segment_end
+    segment = Segment.new_by_arrays([0, 1], [0, 2])
+    point = Point.new(0, 3)
+    assert_equal 1, segment.distance_to(point)
+  end
+
+end

data/test/segment/initialize_test.rb

@@ -1,7 +1,7 @@
-require 'test/unit'
+require 'minitest/autorun'
 require 'geometry'
 
-class InitializeTest < Test::Unit::TestCase
+class InitializeTest < MiniTest::Unit::TestCase
   include Geometry
 
   def test_initialize_by_points

data/test/segment/intersection_point_with_test.rb

@@ -1,16 +1,16 @@
-require 'test/unit'
+require 'minitest/autorun'
 require 'geometry'
 
-class IntersectionPointWithTest < Test::Unit::TestCase
+class IntersectionPointWithTest < MiniTest::Unit::TestCase
   include Geometry
-  
+
   def test_regular_case
     segment1 = Segment.new_by_arrays([0, 0], [2, 2])
     segment2 = Segment.new_by_arrays([0, 2], [2, 0])
 
     assert_equal Point.new(1, 1), segment1.intersection_point_with(segment2)
   end
-  
+
   def test_segments_intersect_at_the_endpoint
     segment1 = Segment.new_by_arrays([0, 0], [2, 2])
     segment2 = Segment.new_by_arrays([0, 2], [2, 2])
@@ -22,7 +22,7 @@ class IntersectionPointWithTest < Test::Unit::TestCase
     segment1 = Segment.new_by_arrays([0, 0], [0, 2])
     segment2 = Segment.new_by_arrays([1, 1], [2, 1])
 
-    assert_raise SegmentsDoNotIntersect do
+    assert_raises SegmentsDoNotIntersect do
       segment1.intersection_point_with(segment2)
     end
   end
@@ -31,7 +31,7 @@ class IntersectionPointWithTest < Test::Unit::TestCase
     segment1 = Segment.new_by_arrays([0, 0], [2, 2])
     segment2 = Segment.new_by_arrays([1, 0], [3, 2])
 
-    assert_raise SegmentsDoNotIntersect do
+    assert_raises SegmentsDoNotIntersect do
       segment1.intersection_point_with(segment2)
     end
   end
@@ -40,12 +40,14 @@ class IntersectionPointWithTest < Test::Unit::TestCase
     segment1 = Segment.new_by_arrays([0, 0], [2, 2])
     segment2 = Segment.new_by_arrays([1, 1], [3, 3])
 
-    assert_raise SegmentsOverlap do
+    assert_raises SegmentsOverlap do
       segment1.intersection_point_with(segment2)
     end
   end
 
   def test_segments_parallel_and_have_common_endpoint
+    skip 'Not implemented yet'
+
     segment1 = Segment.new_by_arrays([0, 0], [1, 0])
     segment2 = Segment.new_by_arrays([1, 0], [2, 0])
 

data/test/segment/intersects_with_test.rb

@@ -1,7 +1,7 @@
-require 'test/unit'
+require 'minitest/autorun'
 require 'geometry'
 
-class IntersectsTest < Test::Unit::TestCase
+class IntersectsTest < MiniTest::Unit::TestCase
   include Geometry
 
   #      |

data/test/segment/length_test.rb

@@ -1,7 +1,7 @@
-require 'test/unit'
+require 'minitest/autorun'
 require 'geometry'
 
-class LengthTest < Test::Unit::TestCase
+class LengthTest < MiniTest::Unit::TestCase
   include Geometry
   
   def test_parallel_to_axis

data/test/segment/lie_on_one_line_with.rb

@@ -0,0 +1,34 @@
+require 'minitest/autorun'
+require 'geometry'
+
+class IntersectsTest < MiniTest::Unit::TestCase
+  include Geometry
+
+  def test_segments_parralel_but_on_different_lines
+    segment1 = Segment.new_by_arrays([0, 1], [2, 1])
+    segment2 = Segment.new_by_arrays([0, 0], [2, 0])
+
+    assert ! segment1.lies_on_one_line_with?(segment2)
+  end
+
+  def test_segments_are_not_parallel
+    segment1 = Segment.new_by_arrays([0, 0], [2, 0])
+    segment2 = Segment.new_by_arrays([0, 1], [2, 2])
+
+    assert ! segment1.lies_on_one_line_with?(segment2)
+  end
+    
+  def test_segments_lie_on_one_line
+    segment1 = Segment.new_by_arrays([0, 0], [1, 0])
+    segment2 = Segment.new_by_arrays([2, 0], [3, 0])
+
+    assert segment1.lies_on_one_line_with?(segment2)
+  end
+
+  def test_segments_lin_on_one_vertical_line
+    segment1 = Segment.new_by_arrays([0, 0], [0, 1])
+    segment2 = Segment.new_by_arrays([0, 2], [0, 3])
+
+    assert segment1.lies_on_one_line_with?(segment2)
+  end
+end

data/test/segment/overlaps_test.rb

@@ -1,7 +1,7 @@
-require 'test/unit'
+require 'minitest/autorun'
 require 'geometry'
 
-class OverlapsTest < Test::Unit::TestCase
+class OverlapsTest < MiniTest::Unit::TestCase
   include Geometry
 
   def test_overlaps
@@ -24,6 +24,8 @@ class OverlapsTest < Test::Unit::TestCase
   end
 
   def test_lies_on_one_line_and_have_common_endpoint
+    skip 'Not implemented yet'
+
     segment1 = Segment.new_by_arrays([0, 0], [1, 0])
     segment2 = Segment.new_by_arrays([1, 0], [2, 0])
 
@@ -33,14 +35,14 @@ class OverlapsTest < Test::Unit::TestCase
   def test_lies_on_one_line
     segment1 = Segment.new_by_arrays([0, 0], [2, 0])
     segment2 = Segment.new_by_arrays([4, 0], [6, 0])
-    
+
     assert ! segment1.overlaps?(segment2)
   end
-  
+
   def test_lies_on_one_vertical_line
     segment1 = Segment.new_by_arrays([0, 0], [0, 1])
     segment2 = Segment.new_by_arrays([0, 2], [0, 3])
-    
+
     assert ! segment1.overlaps?(segment2)
   end
-end
+end

data/test/segment/parallel_to_test.rb

@@ -1,7 +1,7 @@
-require 'test/unit'
+require 'minitest/autorun'
 require 'geometry'
 
-class ParallelToTest < Test::Unit::TestCase
+class ParallelToTest < MiniTest::Unit::TestCase
   include Geometry
   
   def test_segments_are_parallel

data/test/segment/to_vector_test.rb

@@ -1,7 +1,7 @@
-require 'test/unit'
+require 'minitest/autorun'
 require 'geometry'
 
-class ToVectorTest < Test::Unit::TestCase
+class ToVectorTest < MiniTest::Unit::TestCase
   include Geometry
 
   def test_regular_case

data/test/vector/arithmetics_test.rb

@@ -1,7 +1,7 @@
-require 'test/unit'
+require 'minitest/autorun'
 require 'geometry'
 
-class ArithmeticsTest < Test::Unit::TestCase
+class ArithmeticsTest < MiniTest::Unit::TestCase
   include Geometry
 
   def test_summation

data/test/vector/collinear_with_test.rb

@@ -1,7 +1,7 @@
-require 'test/unit'
+require 'minitest/autorun'
 require 'geometry'
 
-class CollinearWithTest < Test::Unit::TestCase
+class CollinearWithTest < MiniTest::Unit::TestCase
   include Geometry
 
   def test_vectors_are_collinear

data/test/vector/cross_product_test.rb

@@ -1,7 +1,7 @@
-require 'test/unit'
+require 'minitest/autorun'
 require 'geometry'
 
-class CrossProductTest < Test::Unit::TestCase
+class CrossProductTest < MiniTest::Unit::TestCase
   include Geometry
 
   def test_positive

data/test/vector/equals_test.rb

@@ -1,15 +1,15 @@
-require 'test/unit'
+require 'minitest/autorun'
 require 'geometry'
 
-class EqualsTest < Test::Unit::TestCase
+class EqualsTest < MiniTest::Unit::TestCase
   include Geometry
 
-  def test_equal    
+  def test_equal
     assert_equal Vector.new(1, 3), Vector.new(1, 3)
   end
-  
-  def test_not_equal        
-    assert_not_equal Vector.new(1, 3), Vector.new(1, 2)
-    assert_not_equal Vector.new(1, 2), Vector.new(0, 2)
+
+  def test_not_equal
+    refute_equal Vector.new(1, 3), Vector.new(1, 2)
+    refute_equal Vector.new(1, 2), Vector.new(0, 2)
   end
 end

data/test/vector/modulus_test.rb

@@ -1,7 +1,7 @@
-require 'test/unit'
+require 'minitest/autorun'
 require 'geometry'
 
-class ModulusTest < Test::Unit::TestCase
+class ModulusTest < MiniTest::Unit::TestCase
   include Geometry
 
   def test_parallel_to_axis

data/test/vector/scalar_product_test.rb

@@ -1,7 +1,7 @@
-require 'test/unit'
+require 'minitest/autorun'
 require 'geometry'
 
-class ScalarProductTest < Test::Unit::TestCase
+class ScalarProductTest < MiniTest::Unit::TestCase
   include Geometry
 
   def test_vectors_are_perpendicular

metadata

@@ -1,55 +1,99 @@
 --- !ruby/object:Gem::Specification
 name: ruby-geometry
 version: !ruby/object:Gem::Version
-  version: 0.0.4
-  prerelease: 
+  version: 0.0.5
 platform: ruby
 authors:
 - Daniel Vartanov
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2012-06-30 00:00:00.000000000 Z
+date: 2014-03-15 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: activesupport
-  requirement: &2160900040 !ruby/object:Gem::Requirement
-    none: false
+  requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - ! '>='
+    - - '>='
       - !ruby/object:Gem::Version
         version: '0'
   type: :runtime
   prerelease: false
-  version_requirements: *2160900040
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - '>='
+      - !ruby/object:Gem::Version
+        version: '0'
 - !ruby/object:Gem::Dependency
   name: memoist
-  requirement: &2160898360 !ruby/object:Gem::Requirement
-    none: false
+  requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - ! '>='
+    - - '>='
       - !ruby/object:Gem::Version
         version: '0'
   type: :runtime
   prerelease: false
-  version_requirements: *2160898360
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: bundler
+  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
   name: rake
-  requirement: &2160896440 !ruby/object:Gem::Requirement
-    none: false
+  requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - ! '>='
+    - - '>='
       - !ruby/object:Gem::Version
         version: '0'
   type: :development
   prerelease: false
-  version_requirements: *2160896440
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - '>='
+      - !ruby/object:Gem::Version
+        version: '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'
 description: 
-email: daniel.vartanov@gmail.com
+email:
+- dan@vartanov.net
 executables: []
 extensions: []
 extra_rdoc_files: []
 files:
+- .gitignore
+- .ruby-version
+- Gemfile
+- MIT-LICENSE
+- README.md
+- Rakefile
+- TODO
 - lib/algorithms/point_in_polygon.rb
 - lib/bounding_box.rb
 - lib/comparison_with_precision.rb
@@ -59,9 +103,11 @@ files:
 - lib/polygon.rb
 - lib/segment.rb
 - lib/vector.rb
+- ruby-geometry.gemspec
 - test/bounding_box/contains_test.rb
 - test/geometry/distance_test.rb
 - test/line/angle_to_test.rb
+- test/line/distance_to_test.rb
 - test/line/horizontal_test.rb
 - test/line/initialize_test.rb
 - test/line/intersect_x_test.rb
@@ -70,17 +116,21 @@ files:
 - test/line/vertical_test.rb
 - test/line/x_intercept_test.rb
 - test/line/y_intercept_test.rb
+- test/point/advance_by_test.rb
 - test/point/equals_test.rb
 - test/point/initialize_test.rb
 - test/polygon/bounding_box_test.rb
 - test/polygon/contains_point_test.rb
 - test/polygon/edges_test.rb
+- test/polygon/polygon_area_test.rb
 - test/segment/bounds_test.rb
 - test/segment/contains_point_test.rb
+- test/segment/distance_to_test.rb
 - test/segment/initialize_test.rb
 - test/segment/intersection_point_with_test.rb
 - test/segment/intersects_with_test.rb
 - test/segment/length_test.rb
+- test/segment/lie_on_one_line_with.rb
 - test/segment/overlaps_test.rb
 - test/segment/parallel_to_test.rb
 - test/segment/to_vector_test.rb
@@ -91,33 +141,34 @@ files:
 - test/vector/modulus_test.rb
 - test/vector/scalar_product_test.rb
 homepage: http://github.com/DanielVartanov/ruby-geometry
-licenses: []
+licenses:
+- MIT
+metadata: {}
 post_install_message: 
 rdoc_options: []
 require_paths:
 - lib
 required_ruby_version: !ruby/object:Gem::Requirement
-  none: false
   requirements:
-  - - ! '>='
+  - - '>='
     - !ruby/object:Gem::Version
       version: '0'
 required_rubygems_version: !ruby/object:Gem::Requirement
-  none: false
   requirements:
-  - - ! '>='
+  - - '>='
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
 rubyforge_project: 
-rubygems_version: 1.8.15
+rubygems_version: 2.2.1
 signing_key: 
-specification_version: 3
+specification_version: 4
 summary: Implementation of basic 2D geometry algorithms in Ruby
 test_files:
 - test/bounding_box/contains_test.rb
 - test/geometry/distance_test.rb
 - test/line/angle_to_test.rb
+- test/line/distance_to_test.rb
 - test/line/horizontal_test.rb
 - test/line/initialize_test.rb
 - test/line/intersect_x_test.rb
@@ -126,17 +177,21 @@ test_files:
 - test/line/vertical_test.rb
 - test/line/x_intercept_test.rb
 - test/line/y_intercept_test.rb
+- test/point/advance_by_test.rb
 - test/point/equals_test.rb
 - test/point/initialize_test.rb
 - test/polygon/bounding_box_test.rb
 - test/polygon/contains_point_test.rb
 - test/polygon/edges_test.rb
+- test/polygon/polygon_area_test.rb
 - test/segment/bounds_test.rb
 - test/segment/contains_point_test.rb
+- test/segment/distance_to_test.rb
 - test/segment/initialize_test.rb
 - test/segment/intersection_point_with_test.rb
 - test/segment/intersects_with_test.rb
 - test/segment/length_test.rb
+- test/segment/lie_on_one_line_with.rb
 - test/segment/overlaps_test.rb
 - test/segment/parallel_to_test.rb
 - test/segment/to_vector_test.rb