geometry 6.1 → 6.2

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: ed229b8577bfe815ff25060d851e6f27515cf7a7
-  data.tar.gz: 9ed183df010e991b72c216639acda3f2f68884d5
+  metadata.gz: c1d1683621a91df0a25df4e3f2cc4fe6ecdf3dfb
+  data.tar.gz: 597979326e97270c5fd7f037615f391e7f50fc18
 SHA512:
-  metadata.gz: ea42b04b4aa1bc9f89f5d64cc2e96ff61a066bff34108d6b534e492da37dd69a7aa8163f5388bb46ae350c726926074d9a201480d642c376518bf3efc63c631b
-  data.tar.gz: bafb8c4996b9017d28f43d7b56a0b1e253d738f20ade966aa196efca041513f2ebd502be560926a3404b9314c04ce3f13e4c8c382e2a1dd06d797062ada2c7ac
+  metadata.gz: 2fbe85bbe712dff07a728326e3aafc40325849f03cb995221b8a6f65e6f4b3a6ba6b10de21f13e0ed4b18b92664f92ecb1b99a67b013430173494a35449354b2
+  data.tar.gz: 5f1e1ddc4670af310745a74951eb6280bd4d515122ade09df4bc9cbbc40c6247fc5131c3ee7ef46f9d9ea4e707850e8462c03e458e6443e1793f374f950344d4

data/geometry.gemspec

@@ -3,7 +3,7 @@ $:.push File.expand_path("../lib", __FILE__)
 
 Gem::Specification.new do |s|
   s.name        = "geometry"
-  s.version     = '6.1'
+  s.version     = '6.2'
   s.authors     = ["Brandon Fosdick"]
   s.email       = ["bfoz@bfoz.net"]
   s.homepage    = "http://github.com/bfoz/geometry"

data/lib/geometry/edge.rb

@@ -130,7 +130,7 @@ An edge. It's a line segment between 2 points. Generally part of a {Polygon}.
 
 	# @return [Vector]  A {Vector} pointing from first to last
 	def vector
-	    Vector[*((last-first).to_a)]
+	    last - first
 	end
 
 	def to_a

data/lib/geometry/point.rb

@@ -156,6 +156,33 @@ geometry class (x, y, z).
 	    end
 	end
 
+	def *(other)
+	    case other
+		when NilClass
+		    nil
+		when Numeric
+		    Point[@elements.map {|e| e * other}]
+		when PointZero
+		    Point.zero
+		else
+		    if other.respond_to?(:[])
+			raise OperationNotDefined, "#{other.class} must respond to :size" unless other.respond_to?(:size)
+			raise DimensionMismatch, "Can't multiply #{self} by #{other}" if size != other.size
+			Point[Array.new(size) {|i| @elements[i] * other[i] }]
+		    else
+			Point[@elements.map {|e| e * other}]
+		    end
+	    end
+	end
+
+	def /(other)
+	    case other
+		when Matrix, Vector, Point, Size, NilClass, PointZero, SizeZero
+		    raise OperationNotDefined, "Can't divide #{self} by #{other}"
+		else
+		    Point[@elements.map {|e| e / other}]
+	    end
+	end
 # @endgroup
 
     end

data/lib/geometry/polyline.rb

@@ -48,8 +48,7 @@ also like a {Path} in that it isn't necessarily closed.
 			if @edges.last
 			    new_edge = Edge.new(previous, n)
 			    if @edges.last.parallel?(new_edge)
-				popped_edge = @edges.pop		# Remove the previous Edge
-				@vertices.pop(@edges.size ? 1 : 2)	# Remove the now unused vertex, or vertices
+				popped_edge = pop_edge		# Remove the previous Edge
 				if n == popped_edge.first
 				    popped_edge.first
 				else
@@ -94,6 +93,25 @@ also like a {Path} in that it isn't necessarily closed.
 	end
 	alias :== :eql?
 
+	# @group Attributes
+
+	# @return [Point]   The upper-right corner of the bounding rectangle that encloses the {Polyline}
+	def max
+	    vertices.reduce {|memo, vertex| Point[[memo.x, vertex.x].max, [memo.y, vertex.y].max] }
+	end
+
+	# @return [Point]   The lower-left corner of the bounding rectangle that encloses the {Polyline}
+	def min
+	    vertices.reduce {|memo, vertex| Point[[memo.x, vertex.x].min, [memo.y, vertex.y].min] }
+	end
+
+	# @return [Array<Point>]    The lower-left and upper-right corners of the enclosing bounding rectangle
+	def minmax
+	    vertices.reduce([vertices.first, vertices.first]) {|memo, vertex| [Point[[memo.first.x, vertex.x].min, [memo.first.y, vertex.y].min], Point[[memo.last.x, vertex.x].max, [memo.last.y, vertex.y].max]] }
+	end
+
+	# @endgroup
+
 	# Clone the receiver, close it, then return it
 	# @return [Polyline]	the closed clone of the receiver
 	def close
@@ -103,7 +121,36 @@ also like a {Path} in that it isn't necessarily closed.
 	# Close the receiver and return it
 	# @return [Polyline]	the receiver after closing
 	def close!
-	    push_edge Edge.new(@edges.last.last, @edges.first.first) unless @edges.empty? || closed?
+	    unless @edges.empty?
+		# NOTE: parallel? is use here instead of collinear? because the
+		#	edges are connected, and will therefore be collinear if
+		#	they're parallel
+
+		if closed?
+		    if @edges.first.parallel?(@edges.last)
+			unshift_edge Edge.new(@edges.last.first, shift_edge.last)
+		    end
+		elsif
+		    closing_edge = Edge.new(@edges.last.last, @edges.first.first)
+
+		    # If the closing edge is collinear with the last edge, then
+		    #  simply extened the last edge to fill the gap
+		    if @edges.last.parallel?(closing_edge)
+			closing_edge = Edge.new(pop_edge.first, @edges.first.first)
+		    end
+
+		    # Check that the new closing_edge isn't zero-length
+		    if closing_edge.first != closing_edge.last
+			# If the closing edge is collinear with the first edge, then
+			#  extend the first edge "backwards" to fill the gap
+			if @edges.first.parallel?(closing_edge)
+			    unshift_edge Edge.new(closing_edge.first, shift_edge.last)
+			else
+			    push_edge closing_edge
+			end
+		    end
+		end
+	    end
 	    self
 	end
 
@@ -305,6 +352,18 @@ also like a {Path} in that it isn't necessarily closed.
 	end
 	# @endgroup
 
+	# Pop the last edge, and its associated vertices
+	# @return [Edge]    the popped {Edge}
+	def pop_edge
+	    old = @edges.pop			# Remove the last Edge
+	    if 0 == @edges.length		# Remove all vertices if the only Edge was popped
+		@vertices.clear
+	    elsif old.last == @vertices.last	# Remove the last vertex if it was used by the popped Edge
+		@vertices.pop
+	    end
+	    old
+	end
+
 	def push_edge(*e)
 	    @edges.push *e
 	    @edges.uniq!
@@ -314,5 +373,21 @@ also like a {Path} in that it isn't necessarily closed.
 	    @vertices.push *v
 	    @vertices.uniq!
 	end
+
+	# Remove the first {Edge} and its associated vertices
+	# @return [Edge]    the shifted {Edge}
+	def shift_edge
+	    @vertices.shift((@edges.size > 1) ? 1 : 2)
+	    @edges.shift
+	end
+
+	# Prepend an {Edge} and its vertices
+	# @param edge [Edge]	the {Edge} to unshift
+	def unshift_edge(edge)
+	    @vertices.unshift(edge.last) unless edge.last == @edges.first.first
+	    @vertices.unshift(edge.first) # unless edge.first == @edges.last.last
+	    @vertices.pop if @vertices.last == @vertices.first
+	    @edges.unshift(edge)
+	end
     end
 end

data/lib/geometry/size.rb

@@ -25,7 +25,8 @@ methods (width, height and depth).
 	# @overload [](Vector)
 	# @return [Size]    A new {Size} object
 	def self.[](*array)
-	    array = array[0].to_a unless array[0].is_a?(Numeric)
+	    array.map! {|a| a.respond_to?(:to_a) ? a.to_a : a }
+	    array.flatten!
 	    super *array
 	end
 	
@@ -71,5 +72,73 @@ methods (width, height and depth).
 	def z
 	    @elements[2]
 	end
+
+	# Create a new {Size} that is smaller than the receiver by the specified amounts
+	# @overload inset(x,y)
+	# @param x [Number] the horizontal inset
+	# @param y [Number] the vertical inset
+	# @overload inset(options)
+	# @option options [Number] :left    the left inset
+	# @option options [Number] :right   the right inset
+	# @option options [Number] :top	    the top inset
+	# @option options [Number] :bottom  the bottom inset
+	def inset(*args)
+	    options, args = args.partition {|a| a.is_a? Hash}
+	    options = options.reduce({}, :merge)
+
+	    left = right = top = bottom = 0
+	    if 1 == args.size
+		left = top = -args.shift
+		right = bottom = 0
+	    elsif 2 == args.size
+		left = -args.shift
+		top = -args.shift
+		right = bottom = 0
+	    end
+
+	    left = -options[:x] if options[:x]
+	    top = -options[:y] if options[:y]
+
+	    top = -options[:top] if options[:top]
+	    left = -options[:left] if options[:left]
+	    bottom = -options[:bottom] if options[:bottom]
+	    right = -options[:right] if options[:right]
+
+	    self.class[left + width + right, top + height + bottom]
+	end
+
+	# Create a new {Size} that is larger than the receiver by the specified amounts
+	# @overload outset(x,y)
+	# @param x [Number] the horizontal inset
+	# @param y [Number] the vertical inset
+	# @overload outset(options)
+	# @option options [Number] :left    the left inset
+	# @option options [Number] :right   the right inset
+	# @option options [Number] :top	    the top inset
+	# @option options [Number] :bottom  the bottom inset
+	def outset(*args)
+	    options, args = args.partition {|a| a.is_a? Hash}
+	    options = options.reduce({}, :merge)
+
+	    left = right = top = bottom = 0
+	    if 1 == args.size
+		left = top = args.shift
+		right = bottom = 0
+	    elsif 2 == args.size
+		left = args.shift
+		top = args.shift
+		right = bottom = 0
+	    end
+
+	    left = options[:x] if options[:x]
+	    top = options[:y] if options[:y]
+
+	    top = options[:top] if options[:top]
+	    left = options[:left] if options[:left]
+	    bottom = options[:bottom] if options[:bottom]
+	    right = options[:right] if options[:right]
+
+	    self.class[left + width + right, top + height + bottom]
+	end
     end
 end

data/lib/geometry/square.rb

@@ -8,25 +8,53 @@ The {Square} class cluster is like the {Rectangle} class cluster, but not longer
 
 == Constructors
 
-    square = Square.new from:[1,2], to:[2,3]	# Using two corners
-    square = Square.new origin:[3,4], size:5	# Using an origin point and a size
+    Square.new from:[1,2], to:[2,3]	# Using two corners
+    Square.new origin:[3,4], size:5	# Using an origin point and a size
+    Square.new center:[5,5], size:5	# Using a center point and a size
+    Square.new size:5			# Centered on the origin
 =end
     class Square
+	include ClusterFactory
+
+	# @!attribute origin
+	#   @return [Point]  The {Square}'s origin
 	attr_reader :origin
 
+	# @overload new(:origin, :size)
+	#  Creates a {Square} with the given origin and size
+	#  @option [Point]  :origin The lower-left corner
+	#  @option [Number] :size   Bigness
+	#  @return [CenteredSquare]
+	def self.new(*args)
+	    options, args = args.partition {|a| a.is_a? Hash}
+	    options = options.reduce({}, :merge)
+
+	    if options.key?(:size)
+		unless options[:size].is_a? Numeric
+		    raise NotSquareError, 'Size must be a square' unless options[:size].all? {|a| a == options[:size].first}
+		    options[:size] = options[:size].first
+		end
+
+		if options.key? :origin
+		    SizedSquare.new(options[:origin], options[:size])
+		else
+		    CenteredSquare.new(options[:center] || PointZero.new, options[:size])
+		end
+	    elsif options.key?(:from) and options.key?(:to)
+		original_new(from: options[:from], to: options[:to])
+	    end
+	end
+
 	# Creates a {Square} given two {Point}s
 	# @option options [Point] :from	A corner (ie. bottom-left)
 	# @option options [Point] :to	The other corner (ie. top-right)
 	# @option options [Point] :origin   The lower left corner
-	# @option options [Number] :size    Bigness
 	def initialize(options={})
 	    origin = options[:from] || options[:origin]
 	    origin = origin ? Point[origin] : PointZero.new
 
 	    if options.has_key? :to
 		point1 = options[:to]
-	    elsif options.has_key? :size
-		point1 = origin + options[:size]
 	    end
 
 	    point1 = Point[point1]
@@ -41,6 +69,21 @@ The {Square} class cluster is like the {Rectangle} class cluster, but not longer
 	end
 
 # !@group Accessors
+	# @return [Point]   The upper right corner of the bounding {Rectangle}
+	def max
+	    @points.last
+	end
+
+	# @return [Point]   The lower left corner of the bounding {Rectangle}
+	def min
+	    @points.first
+	end
+
+	# @return [Array<Point>]    The lower left and upper right corners of the bounding {Rectangle}
+	def minmax
+	    [self.min, self.max]
+	end
+
 	# @attribute [r] origin
 	# @return [Point] The lower left corner
 	def origin
@@ -65,6 +108,10 @@ The {Square} class cluster is like the {Rectangle} class cluster, but not longer
 	# @return [Point]   The center of the {Square}
 	attr_reader :center
 
+	# @!attribute size
+	#   @return [Size]  The {Size} of the {Square}
+	attr_accessor :size
+
 	# @param [Point]	center	The center point
 	# @param [Numeric]	size	The length of each side
 	def initialize(center, size)
@@ -73,6 +120,23 @@ The {Square} class cluster is like the {Rectangle} class cluster, but not longer
 	end
 
 # @group Accessors
+	# @return [Point]   The upper right corner of the bounding {Rectangle}
+	def max
+	    half_size = @size/2
+	    Point[@center.x + half_size, @center.y + half_size]
+	end
+
+	# @return [Point]   The lower left corner of the bounding {Rectangle}
+	def min
+	    half_size = @size/2
+	    Point[@center.x - half_size, @center.y - half_size]
+	end
+
+	# @return [Array<Point>]    The lower left and upper right corners of the bounding {Rectangle}
+	def minmax
+	    [self.min, self.max]
+	end
+
 	# @attribute [r] origin
 	# @return [Point] The lower left corner
 	def origin
@@ -103,11 +167,60 @@ The {Square} class cluster is like the {Rectangle} class cluster, but not longer
 
     # A {Square} created with an origin point and a size
     class SizedSquare < Square
+	# @!attribute size
+	#   @return [Size]  The {Size} of the {Square}
+	attr_accessor :size
+
 	# @param [Point]    origin  The origin point (bottom-left corner)
 	# @param [Numeric]  size    The length of each side
 	def initialize(origin, size)
 	    @origin = Point[origin]
 	    @size = size
 	end
+
+# @group Accessors
+	# @!attribute center
+	#   @return [Point]  The center of it all
+	def center
+	    origin + size/2
+	end
+
+	# @return [Point]   The upper right corner of the bounding {Rectangle}
+	def max
+	    origin + size
+	end
+
+	# @return [Point]   The lower left corner of the bounding {Rectangle}
+	def min
+	    origin
+	end
+
+	# @attribute [r] origin
+	# @return [Point] The lower left corner
+	def origin
+	    @origin
+	end
+
+	# @attribute [r] points
+	# @return [Array<Point>]    The {Square}'s four points (counterclockwise)
+	def points
+	    minx = origin.x
+	    maxx = origin.x + size
+	    miny = origin.y
+	    maxy = origin.y + size
+
+	    [origin, Point[maxx, miny], Point[maxx, maxy], Point[minx,maxy]]
+	end
+
+	# @return [Number]  The size of the {Square} along the y-axis
+	def height
+	    @size
+	end
+
+	# @return [Number]  The size of the {Square} along the x-axis
+	def width
+	    @size
+	end
+# @endgroup
     end
 end

data/lib/geometry/transformation.rb

@@ -112,6 +112,18 @@ system's X-axis:
 	end
 	alias :== :eql?
 
+	# Update the translation property with the given {Point}
+	# @param point [Point]	the distance to translate by
+	# @return [Transformation]
+	def translate(point)
+	    if translation
+		@translation += Point[point]
+	    else
+		@translation = Point[point]
+	    end
+	    self
+	end
+
 	# Compose the current {Transformation} with another one
 	def +(other)
 	    return self.clone unless other

data/test/geometry/polyline.rb

@@ -22,6 +22,51 @@ describe Geometry::Polyline do
 	polyline.vertices.count.must_equal 4
     end
 
+    it 'must know the max' do
+	unit_square.max.must_equal Point[1,1]
+    end
+
+    it 'must know the min' do
+	unit_square.min.must_equal Point[0,0]
+    end
+
+    it 'must know the min and the max' do
+	unit_square.minmax.must_equal [Point[0,0], Point[1,1]]
+    end
+
+    it 'must close when the first and last edges are collinear' do
+	polygon = Polyline.new([1,0], [2,0], [2,1], [-1,1], [-1,0], [0,0]).close!
+	polygon.must_equal Polyline.new([-1,0], [2,0], [2,1], [-1,1])
+    end
+
+    it 'must close when the closing edge is collinear with the last edge' do
+	polygon = Polyline.new([1,0], [1,1], [-1,1], [-1,0], [0,0]).close!
+	polygon.must_equal Polyline.new([1,0], [1,1], [-1,1], [-1,0], [1,0])
+    end
+
+    it 'must close when the closing edge is collinear with the first edge' do
+	polygon = Polyline.new([0,0], [1,0], [1,1], [-1,1], [-1, 0]).close!
+	polygon.must_equal Polyline.new([-1,0], [1,0], [1,1], [-1,1], [-1,0])
+    end
+
+    it 'must close when the closing edge backtracks over the first edge' do
+	polygon = Polyline.new([0,0], [2,0], [2,1], [-1,1], [-1, -1], [1,-1], [1,0]).close!
+	polygon.must_equal Polyline.new([1,0], [2,0], [2,1], [-1,1], [-1,-1], [1,-1])
+
+	polygon = Polyline.new([0,-1], [0,1], [1,1], [1,0], [0,0]).close!
+	polygon.must_equal Polyline.new([0,0], [0,1], [1,1], [1,0], [0,0])
+    end
+
+    it 'must close when already closed and the first and last edges are collinear' do
+	polygon = Polyline.new([1,0], [1,1], [0,1], [0,-1], [1,-1], [1,0]).close!
+	polygon.must_equal Polyline.new([1,-1], [1,1], [0,1], [0,-1])
+    end
+
+    it 'must close when the closing edge exactly backtracks the last edge' do
+	polygon = Polyline.new([0,0], [0,1], [1,1], [1,0], [0,0], [0,1]).close!
+	polygon.must_equal Polyline.new([0,0], [0,1], [1,1], [1,0], [0,0])
+    end
+
     describe "when the Polyline is closed" do
 	let(:closed_concave_polyline) { Polyline.new [-2,0], [0,0], [0,-2], [2,-2], [2,2], [-2,2], [-2,0] }
 	subject { closed_concave_polyline }

data/test/geometry/size.rb

@@ -2,6 +2,8 @@ require 'minitest/autorun'
 require 'geometry/size'
 
 describe Geometry::Size do
+    subject { Geometry::Size[10,10] }
+
     describe "when constructed" do
 	it "create a Size object using list syntax" do
 	    size = Geometry::Size[2,1]
@@ -94,4 +96,28 @@ describe Geometry::Size do
 	size = Geometry::Size[10,11]
 	assert_equal('Size[10, 11]', size.to_s)
     end
+
+    it 'must inset with horizontal and vertical insets' do
+	subject.inset(4).must_equal Geometry::Size[6, 6]
+	subject.inset(2,3).must_equal Geometry::Size[8, 7]
+	subject.inset(x:2, y:3).must_equal Geometry::Size[8, 7]
+	subject.inset(left:2, top:3).must_equal Geometry::Size[8, 7]
+	subject.inset(right:2, bottom:3).must_equal Geometry::Size[8, 7]
+    end
+
+    it 'must inset with insets for top, left, bottom, right' do
+	subject.inset(top:1, left:2, bottom:3, right:4).must_equal Geometry::Size[4, 6]
+    end
+
+    it 'must outset' do
+	subject.outset(4).must_equal Geometry::Size[14, 14]
+	subject.outset(2,3).must_equal Geometry::Size[12, 13]
+	subject.outset(x:2, y:3).must_equal Geometry::Size[12, 13]
+	subject.outset(left:2, top:3).must_equal Geometry::Size[12, 13]
+	subject.outset(right:2, bottom:3).must_equal Geometry::Size[12, 13]
+    end
+
+    it 'must inset with insets for top, left, bottom, right' do
+	subject.outset(top:1, left:2, bottom:3, right:4).must_equal Geometry::Size[16, 14]
+    end
 end

data/test/geometry/square.rb

@@ -19,11 +19,43 @@ describe Geometry::Square do
 
 	it "must accept an origin Point and a size" do
 	    square = Square.new origin:[1,2], size:5
-	    square.must_be_kind_of Geometry::Square
+	    square.must_be_kind_of Geometry::SizedSquare
 	    square.origin.must_equal Point[1,2]
 	    square.height.must_equal 5
 	    square.width.must_equal 5
 	end
+
+	it 'must accept a center and a size' do
+	    square = Square.new center:[1,2], size:5
+	    square.must_be_kind_of Geometry::CenteredSquare
+	    square.center.must_equal Point[1,2]
+	    square.size.must_equal 5
+	end
+
+	it 'must work with only a size parameter' do
+	    square = Square.new size:5
+	    square.must_be_kind_of Geometry::CenteredSquare
+	    square.center.must_equal Point[0,0]
+	    square.size.must_equal 5
+	end
+
+	it 'must deal with a non-numeric size' do
+	    square = Square.new size:[5,5]
+	    square.must_be_kind_of Geometry::CenteredSquare
+	    square.center.must_equal Point[0,0]
+	    square.size.must_equal 5
+	end
+
+	it 'must accept a Size size' do
+	    square = Square.new size:Size[5,5]
+	    square.must_be_kind_of Geometry::CenteredSquare
+	    square.center.must_equal Point[0,0]
+	    square.size.must_equal 5
+	end
+
+	it 'must reject a size parameter that is not square' do
+	    -> { Square.new size:[1,2] }.must_raise Geometry::NotSquareError
+	end
     end
     
     describe "properties" do
@@ -32,6 +64,18 @@ describe Geometry::Square do
 	it "must have an origin accessor" do
 	    subject.origin.must_equal Point[2,3]
 	end
+
+	it "must have a minmax property that returns the corners of the bounding rectangle" do
+	    subject.minmax.must_equal [Point[2, 3], Point[3, 4]]
+	end
+
+	it "must have a max property that returns the upper right corner of the bounding rectangle" do
+	    subject.max.must_equal Point[3, 4]
+	end
+
+	it "must have a min property that returns the lower left corner of the bounding rectangle" do
+	    subject.min.must_equal Point[2, 3]
+	end
     end
 end
 
@@ -62,5 +106,59 @@ describe Geometry::CenteredSquare do
 	it "must have a width property" do
 	    square.width.must_equal 4
 	end
+
+	it "must have a minmax property that returns the corners of the bounding rectangle" do
+	    square.minmax.must_equal [Point[0, 1], Point[4, 5]]
+	end
+
+	it "must have a max property that returns the upper right corner of the bounding rectangle" do
+	    square.max.must_equal Point[4, 5]
+	end
+
+	it "must have a min property that returns the lower left corner of the bounding rectangle" do
+	    square.min.must_equal Point[0, 1]
+	end
+    end
+end
+
+describe Geometry::SizedSquare do
+    describe "when constructed" do
+	it "must create a SizedSquare from a point and a size" do
+	    square = Geometry::SizedSquare.new [2,3], 5
+	    square.must_be_instance_of Geometry::SizedSquare
+	    square.must_be_kind_of Geometry::Square
+	end
+    end
+
+    describe "properties" do
+	let(:square) { Geometry::SizedSquare.new [2,3], 4 }
+
+	it "must have a center property" do
+	    square.center.must_equal Point[4,5]
+	end
+
+	it "must have a points property" do
+	    square.points.must_equal [Point[2,3], Point[6,3], Point[6,7], Point[2,7]]
+	end
+
+	it "must have a height property" do
+	    square.height.must_equal 4
+	end
+
+	it "must have a width property" do
+	    square.width.must_equal 4
+	end
+
+	it "must have a minmax property that returns the corners of the bounding rectangle" do
+	    square.minmax.must_equal [Point[2, 3], Point[6, 7]]
+	end
+
+	it "must have a max property that returns the upper right corner of the bounding rectangle" do
+	    square.max.must_equal Point[6, 7]
+	end
+
+	it "must have a min property that returns the lower left corner of the bounding rectangle" do
+	    square.min.must_equal Point[2, 3]
+	end
     end
 end

data/test/geometry/transformation.rb

@@ -84,6 +84,14 @@ describe Geometry::Transformation do
 	end
     end
 
+    it 'must translate with a Point' do
+	Transformation.new(translate:[1,2]).translate(Point[3,4]).translation.must_equal Point[4,6]
+    end
+
+    it 'must translate with an Array' do
+	Transformation.new(translate:[1,2]).translate([3,4]).translation.must_equal Point[4,6]
+    end
+
     describe "comparison" do
 	subject { Transformation.new(origin:[1,2]) }
 

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: geometry
 version: !ruby/object:Gem::Version
-  version: '6.1'
+  version: '6.2'
 platform: ruby
 authors:
 - Brandon Fosdick
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2014-01-13 00:00:00.000000000 Z
+date: 2014-04-21 00:00:00.000000000 Z
 dependencies: []
 description: Geometric primitives and algorithms for Ruby
 email:
@@ -85,7 +85,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
       version: '0'
 requirements: []
 rubyforge_project: geometry
-rubygems_version: 2.1.11
+rubygems_version: 2.2.2
 signing_key: 
 specification_version: 4
 summary: Geometric primitives and algoritms