shapely 1.6.1__tar.gz → 1.6.2.post1__tar.gz

{Shapely-1.6.1 → Shapely-1.6.2.post1}/CHANGES.txt

@@ -1,6 +1,22 @@
 Changes
 =======
 
+1.6.2 (2017-10-30)
+------------------
+
+- A 1.6.2.post1 release has been made to fix a problem with macosx wheels
+  uploaded to PyPI.
+
+1.6.2 (2017-10-26)
+------------------
+
+- Handle a ``TypeError`` that can occur when geometries are torn down (#473,
+  #528).
+- Splitting a linestring by one of its end points will now succeed instead of
+  failing with a ``ValueError`` (#524, #533).
+- Missing documentation of a geometry's ``overlaps`` predicate has been added
+  (#522).
+
 1.6.1 (2017-09-01)
 ------------------
 

{Shapely-1.6.1/Shapely.egg-info → Shapely-1.6.2.post1}/PKG-INFO

@@ -1,11 +1,12 @@
 Metadata-Version: 1.1
 Name: Shapely
-Version: 1.6.1
+Version: 1.6.2.post1
 Summary: Geometric objects, predicates, and operations
 Home-page: https://github.com/Toblerity/Shapely
 Author: Sean Gillies
 Author-email: sean.gillies@gmail.com
 License: BSD
+Description-Content-Type: UNKNOWN
 Description: =======
         Shapely
         =======
@@ -241,6 +242,22 @@ Description: =======
         Changes
         =======
         
+        1.6.2 (2017-10-30)
+        ------------------
+        
+        - A 1.6.2.post1 release has been made to fix a problem with macosx wheels
+          uploaded to PyPI.
+        
+        1.6.2 (2017-10-26)
+        ------------------
+        
+        - Handle a ``TypeError`` that can occur when geometries are torn down (#473,
+          #528).
+        - Splitting a linestring by one of its end points will now succeed instead of
+          failing with a ``ValueError`` (#524, #533).
+        - Missing documentation of a geometry's ``overlaps`` predicate has been added
+          (#522).
+        
         1.6.1 (2017-09-01)
         ------------------
         

{Shapely-1.6.1 → Shapely-1.6.2.post1/Shapely.egg-info}/PKG-INFO

@@ -1,11 +1,12 @@
 Metadata-Version: 1.1
 Name: Shapely
-Version: 1.6.1
+Version: 1.6.2.post1
 Summary: Geometric objects, predicates, and operations
 Home-page: https://github.com/Toblerity/Shapely
 Author: Sean Gillies
 Author-email: sean.gillies@gmail.com
 License: BSD
+Description-Content-Type: UNKNOWN
 Description: =======
         Shapely
         =======
@@ -241,6 +242,22 @@ Description: =======
         Changes
         =======
         
+        1.6.2 (2017-10-30)
+        ------------------
+        
+        - A 1.6.2.post1 release has been made to fix a problem with macosx wheels
+          uploaded to PyPI.
+        
+        1.6.2 (2017-10-26)
+        ------------------
+        
+        - Handle a ``TypeError`` that can occur when geometries are torn down (#473,
+          #528).
+        - Splitting a linestring by one of its end points will now succeed instead of
+          failing with a ``ValueError`` (#524, #533).
+        - Missing documentation of a geometry's ``overlaps`` predicate has been added
+          (#522).
+        
         1.6.1 (2017-09-01)
         ------------------
         

Shapely-1.6.2.post1/VERSION.txt

@@ -0,0 +1 @@
+1.6.2.post1

{Shapely-1.6.1 → Shapely-1.6.2.post1}/docs/manual.rst

@@ -442,7 +442,7 @@ constructor parameter.
 Polygons
 --------
 
-.. class:: Polygon(exterior [,interiors=None])
+.. class:: Polygon(shell [,holes=None])
 
   The `Polygon` constructor takes two positional parameters. The first is an
   ordered sequence of ``(x, y[, z])`` point tuples and is treated exactly as in
@@ -1145,6 +1145,11 @@ This predicate applies to all types and is the inverse of :meth:`intersects`.
 In other words, geometric objects intersect if they have any boundary or 
 interior point in common.
 
+.. method:: object.overlaps(other)
+
+  Returns ``True`` if the objects intersect (see above) but neither contains
+  the other.
+
 .. method:: object.touches(other)
 
   Returns ``True`` if the objects have at least one point in common and their

Shapely-1.6.2.post1/shapely/__init__.py

@@ -0,0 +1 @@
+__version__ = "1.6.2.post1"

{Shapely-1.6.1 → Shapely-1.6.2.post1}/shapely/geometry/base.py

@@ -699,7 +699,11 @@ class BaseGeometry(object):
         return bool(self.impl['disjoint'](self, other))
 
     def equals(self, other):
-        """Returns True if geometries are equal, else False"""
+        """Returns True if geometries are equal, else False
+        
+        Refers to point-set equality (or topological equality), and is equivalent to
+        (self.within(other) & self.contains(other))
+        """
         return bool(self.impl['equals'](self, other))
 
     def intersects(self, other):
@@ -720,12 +724,20 @@ class BaseGeometry(object):
 
     def equals_exact(self, other, tolerance):
         """Returns True if geometries are equal to within a specified
-        tolerance"""
+        tolerance
+        
+        Refers to coordinate equality, which requires coordinates to be equal 
+        and in the same order for all components of a geometry
+        """
         return bool(self.impl['equals_exact'](self, other, tolerance))
 
     def almost_equals(self, other, decimal=6):
         """Returns True if geometries are equal at all coordinates to a
-        specified decimal place"""
+        specified decimal place
+
+        Refers to approximate coordinate equality, which requires coordinates be
+        approximately equal and in the same order for all components of a geometry.
+        """
         return self.equals_exact(other, 0.5 * 10**(-decimal))
 
     def relate_pattern(self, other, pattern):

{Shapely-1.6.1 → Shapely-1.6.2.post1}/shapely/ops.py

@@ -257,7 +257,7 @@ def transform(func, geom):
 
 def nearest_points(g1, g2):
     """Returns the calculated nearest points in the input geometries
-    
+
     The points are returned in the same order as the input geometries.
     """
     seq = lgeos.methods['nearest_points'](g1._geom, g2._geom)
@@ -339,21 +339,21 @@ class SplitOp(object):
         union = poly.boundary.union(splitter)
 
         # some polygonized geometries may be holes, we do not want them
-        # that's why we test if the original polygon (poly) contains 
+        # that's why we test if the original polygon (poly) contains
         # an inner point of polygonized geometry (pg)
         return [pg for pg in polygonize(union) if poly.contains(pg.representative_point())]
 
     @staticmethod
     def _split_line_with_line(line, splitter):
         """Split a LineString with another (Multi)LineString or (Multi)Polygon"""
-        
+
         # if splitter is a polygon, pick it's boundary
         if splitter.type in ('Polygon', 'MultiPolygon'):
             splitter = splitter.boundary
 
         assert(isinstance(line, LineString))
         assert(isinstance(splitter, LineString) or isinstance(splitter, MultiLineString))
-        
+
         if splitter.crosses(line):
             # The lines cross --> return multilinestring from the split
             return line.difference(splitter)
@@ -364,7 +364,7 @@ class SplitOp(object):
             # The lines do not cross --> return collection with identity line
             return [line]
 
-    @staticmethod  
+    @staticmethod
     def _split_line_with_point(line, splitter):
         """Split a LineString with a Point"""
 
@@ -374,10 +374,13 @@ class SplitOp(object):
         # check if point is in the interior of the line
         if not line.relate_pattern(splitter, '0********'):
             # point not on line interior --> return collection with single identity line
-            # (REASONING: Returning a list with the input line reference and creating a 
-            # GeometryCollection at the general split function prevents unnecessary copying 
+            # (REASONING: Returning a list with the input line reference and creating a
+            # GeometryCollection at the general split function prevents unnecessary copying
             # of linestrings in multipoint splitting function)
             return [line]
+        elif line.coords[0] == splitter.coords[0]:
+            # if line is a closed ring the previous test doesn't behave as desired
+            return [line]
 
         # point is on line, get the distance from the first point on line
         distance_on_line = line.project(splitter)
@@ -388,7 +391,7 @@ class SplitOp(object):
             pd = line.project(Point(p))
             if pd == distance_on_line:
                 return [
-                    LineString(coords[:i+1]), 
+                    LineString(coords[:i+1]),
                     LineString(coords[i:])
                 ]
             elif distance_on_line < pd:
@@ -414,9 +417,9 @@ class SplitOp(object):
                 # add the newly split 2 lines or the same line if not split
                 new_chunks.extend(SplitOp._split_line_with_point(chunk, pt))
             chunks = new_chunks
-        
+
         return chunks
-    
+
     @staticmethod
     def split(geom, splitter):
         """