perfect-shape 1.0.5 → 1.0.6

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 3645a39c245b2ce45f411b2268c23c9b967cdf2f392255a67de91924b350ec8d
-  data.tar.gz: 333f9861a3aa8f55d6d03db503ea43eae39f8391b58212e69aee8224f8ac0472
+  metadata.gz: 7cd9bf6e78e556604f5a9ff5b26e7b952ca8c61424aac789238c2d5d8961b1c8
+  data.tar.gz: a76a11a91632b22a3b3b136d55ded17ba17b10b940de7186c912bf5cb0642cc7
 SHA512:
-  metadata.gz: b08ddc48b21dc918c95297cd485e0d7ef2e8555a48e2359b7d2422b7c677aa05c25e7645a19f9a8c6b4a98f1f7515944344f70f397a06f99780d57d32fd6eb88
-  data.tar.gz: 2f43f427c47f89edfa1ad64eeb4069e50f5808d4b4222c44c8c5addb09b07e8d4aee0b22015f1e8439b2a85da569b87043e9e347cd7f1e9b93babf21f556b4a7
+  metadata.gz: 54ca03287c4efe1f2a88ab8ad9a3372c29313460f433be17e7300428ea34264d6fcfbd3bc54dedb3953959295a97669e89553fa450f04ab62e99779638501826
+  data.tar.gz: 4c254bfaa37c9d4254ec2df488a0989a580c5907594b992be1d024d3ddda1f790b5340e3f9205214454f167400b9af182d4ad71cf913336203af411a13d220e6

data/CHANGELOG.md

@@ -1,5 +1,10 @@
 # Change Log
 
+## 1.0.6
+
+- Fix issue with `Path#contain?` algorithm not working correclty when `Path` contains non-basic shapes because `shapes.count` is checked instead of `basic_shapes.count`
+- Document `PerfectShape::MultiPoint`
+
 ## 1.0.5
 
 - Support Ruby 3.1 by including bundled 'matrix' gem ('>= 0.4.2', '< 1.1.0')

data/README.md

@@ -1,4 +1,4 @@
-# Perfect Shape 1.0.5
+# Perfect Shape 1.0.6
 ## Geometric Algorithms
 [![Gem Version](https://badge.fury.io/rb/perfect-shape.svg)](http://badge.fury.io/rb/perfect-shape)
 [![Test](https://github.com/AndyObtiva/perfect-shape/actions/workflows/ruby.yml/badge.svg)](https://github.com/AndyObtiva/perfect-shape/actions/workflows/ruby.yml)
@@ -14,13 +14,13 @@ To ensure accuracy and precision, this library does all its mathematical operati
 Run:
 
 ```
-gem install perfect-shape -v 1.0.5
+gem install perfect-shape -v 1.0.6
 ```
 
 Or include in Bundler `Gemfile`:
 
 ```ruby
-gem 'perfect-shape', '~> 1.0.5'
+gem 'perfect-shape', '~> 1.0.6'
 ```
 
 And, run:
@@ -85,6 +85,18 @@ Includes `PerfectShape::PointLocation`
 - `#max_x`: max x
 - `#max_y`: max y
 
+### `PerfectShape::MultiPoint`
+
+Module
+
+- `::normalize_point_array`: normalizes `Array` of multiple points into (x,y) point coordinate `Array` format per point
+- `#initialize(points: [])`: initializes `points` with `Array` of multiple points (e.g. useful for shapes like `Line` and `Polygon`).
+- `#points`: `Array` of multiple points
+- `#min_x`: min x of all points
+- `#min_y`: min y of all points
+- `#max_x`: max x of all points
+- `#max_y`: max y of all points
+
 ### `PerfectShape::AffineTransform`
 
 Class

data/VERSION

@@ -1 +1 @@
-1.0.5
+1.0.6

data/lib/perfect_shape/path.rb

@@ -134,7 +134,7 @@ module PerfectShape
         if (x * 0.0 + y * 0.0) == 0.0
           # N * 0.0 is 0.0 only if N is finite.
           # Here we know that both x and y are finite.
-          return false if shapes.count < 2
+          return false if basic_shapes.count < 2
           mask = winding_rule == :wind_non_zero ? -1 : 1
           (point_crossings(x, y) & mask) != 0
         else
@@ -161,14 +161,14 @@ module PerfectShape
     def point_crossings(x_or_point, y = nil)
       x, y = Point.normalize_point(x_or_point, y)
       return unless x && y
-      return 0 if shapes.count == 0
+      return 0 if basic_shapes.count == 0
       movx = movy = curx = cury = endx = endy = 0
       coords = points.flatten
       curx = movx = coords[0]
       cury = movy = coords[1]
       crossings = 0
       ci = 2
-      1.upto(shapes.count - 1).each do |i|
+      1.upto(basic_shapes.count - 1).each do |i|
         case drawing_types[i]
         when :move_to
           if cury != movy
@@ -244,6 +244,7 @@ module PerfectShape
     # Lastly, if the path is closed, an extra shape is
     # added to represent the line connecting the last point to the first
     def disconnected_shapes
+      # TODO it seems basic_shapes.first should always return a point, but there is a case with CompositeShape that results in a line (shape) not point returned
       initial_point = start_point = basic_shapes.first.to_a.map {|n| BigDecimal(n.to_s)}
       final_point = nil
       the_disconnected_shapes = basic_shapes.drop(1).map do |shape|

data/perfect-shape.gemspec

@@ -2,16 +2,16 @@
 # DO NOT EDIT THIS FILE DIRECTLY
 # Instead, edit Juwelier::Tasks in Rakefile, and run 'rake gemspec'
 # -*- encoding: utf-8 -*-
-# stub: perfect-shape 1.0.5 ruby lib
+# stub: perfect-shape 1.0.6 ruby lib
 
 Gem::Specification.new do |s|
   s.name = "perfect-shape".freeze
-  s.version = "1.0.5"
+  s.version = "1.0.6"
 
   s.required_rubygems_version = Gem::Requirement.new(">= 0".freeze) if s.respond_to? :required_rubygems_version=
   s.require_paths = ["lib".freeze]
   s.authors = ["Andy Maleh".freeze]
-  s.date = "2022-06-03"
+  s.date = "2022-11-05"
   s.description = "Perfect Shape is a collection of pure Ruby geometric algorithms that are mostly useful for GUI manipulation like checking viewport rectangle intersection or containment of a mouse click point in popular geometry shapes such as rectangle, square, arc (open, chord, and pie), ellipse, circle, polygon, and paths containing lines, quadratic b\u00E9zier curves, and cubic bezier curves, potentially with affine transforms applied like translation, scale, rotation, shear/skew, and inversion (including both the Ray Casting Algorithm, aka Even-odd Rule, and the Winding Number Algorithm, aka Nonzero Rule). Additionally, it contains some purely mathematical algorithms like IEEEremainder (also known as IEEE-754 remainder).".freeze
   s.email = "andy.am@gmail.com".freeze
   s.extra_rdoc_files = [
@@ -47,7 +47,7 @@ Gem::Specification.new do |s|
   ]
   s.homepage = "http://github.com/AndyObtiva/perfect-shape".freeze
   s.licenses = ["MIT".freeze]
-  s.rubygems_version = "3.3.3".freeze
+  s.rubygems_version = "3.3.16".freeze
   s.summary = "Perfect Shape - Geometric Algorithms".freeze
 
   if s.respond_to? :specification_version then

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: perfect-shape
 version: !ruby/object:Gem::Version
-  version: 1.0.5
+  version: 1.0.6
 platform: ruby
 authors:
 - Andy Maleh
 autorequire:
 bindir: bin
 cert_chain: []
-date: 2022-06-03 00:00:00.000000000 Z
+date: 2022-11-05 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: matrix
@@ -180,7 +180,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
-rubygems_version: 3.3.3
+rubygems_version: 3.3.16
 signing_key:
 specification_version: 4
 summary: Perfect Shape - Geometric Algorithms