@crossbind/port-geos-linuxmusl 0.0.0-stage → 2.0.0-beta.63

package/dist/prebuilt/linuxmusl-arm64-mt-release/include/geos/noding/SimpleNoder.h

@@ -0,0 +1,65 @@
+/**********************************************************************
+ *
+ * GEOS - Geometry Engine Open Source
+ * http://geos.osgeo.org
+ *
+ * Copyright (C) 2006      Refractions Research Inc.
+ *
+ * This is free software; you can redistribute and/or modify it under
+ * the terms of the GNU Lesser General Public Licence as published
+ * by the Free Software Foundation.
+ * See the COPYING file for more information.
+ *
+ **********************************************************************
+ *
+ * Last port: noding/SimpleNoder.java rev. 1.7 (JTS-1.9)
+ *
+ **********************************************************************/
+
+#pragma once
+
+#include <geos/export.h>
+
+#include <vector>
+
+#include <geos/noding/ArcNoder.h>
+
+// Forward declarations
+namespace geos {
+namespace noding {
+class PathString;
+}
+}
+
+namespace geos {
+namespace noding { // geos.noding
+
+/** \brief
+ * Nodes a set of {@link SegmentString}s and/or {@link ArcString}s by
+ * performing a brute-force comparison of every segment to every other one.
+ *
+ * This has n^2 performance, so is too slow for use on large numbers
+ * of segments.
+ *
+ * @version 1.7
+ */
+class GEOS_DLL SimpleNoder: public ArcNoder {
+private:
+    std::vector<PathString*> nodedSegStrings;
+    void computeIntersects(PathString& e0, PathString& e1);
+
+public:
+
+    using ArcNoder::ArcNoder;
+
+    void computePathNodes(const std::vector<PathString*>& inputSegmentStrings) override;
+
+    std::vector<std::unique_ptr<PathString>> getNodedPaths() override;
+
+private:
+    std::vector<PathString*> m_pathStrings;
+};
+
+} // namespace geos.noding
+} // namespace geos
+

package/dist/prebuilt/linuxmusl-arm64-mt-release/include/geos/noding/SinglePassNoder.h

@@ -0,0 +1,75 @@
+/**********************************************************************
+ *
+ * GEOS - Geometry Engine Open Source
+ * http://geos.osgeo.org
+ *
+ * Copyright (C) 2006      Refractions Research Inc.
+ *
+ * This is free software; you can redistribute and/or modify it under
+ * the terms of the GNU Lesser General Public Licence as published
+ * by the Free Software Foundation.
+ * See the COPYING file for more information.
+ *
+ **********************************************************************/
+
+#pragma once
+
+#include <geos/export.h>
+#include <geos/noding/Noder.h>
+
+// Forward declarations
+namespace geos {
+namespace noding {
+class SegmentString;
+class SegmentIntersector;
+}
+}
+
+namespace geos {
+namespace noding { // geos.noding
+
+
+/** \brief
+ * Base class for {@link Noder}s which make a single
+ * pass to find intersections.
+ *
+ * This allows using a custom SegmentIntersector
+ * (which for instance may simply identify intersections, rather than
+ * insert them).
+ *
+ * Last port: noding/SinglePassNoder.java rev. 1.3 (JTS-1.7)
+ *
+ */
+class GEOS_DLL SinglePassNoder : public Noder { // implements Noder
+
+protected:
+
+    /// Externally owned
+    SegmentIntersector* segInt;
+
+public:
+
+    SinglePassNoder(SegmentIntersector* nSegInt = nullptr): segInt(nSegInt) {}
+
+    ~SinglePassNoder() override {}
+
+    /** \brief
+     * Sets the SegmentIntersector to use with this noder.
+     *
+     * A SegmentIntersector will normally add intersection nodes
+     * to the input segment strings, but it may not - it may
+     * simply record the presence of intersections.
+     * However, some Noders may require that intersections be added.
+     *
+     * @param newSegInt
+     */
+    virtual void
+    setSegmentIntersector(SegmentIntersector* newSegInt)
+    {
+        segInt = newSegInt;
+    }
+
+};
+
+} // namespace geos.noding
+} // namespace geos

package/dist/prebuilt/linuxmusl-arm64-mt-release/include/geos/noding/ValidatingNoder.h

@@ -0,0 +1,81 @@
+/**********************************************************************
+ *
+ * GEOS - Geometry Engine Open Source
+ * http://geos.osgeo.org
+ *
+ * Copyright (C) 2020 Paul Ramsey <pramsey@cleverelephant.ca>
+ *
+ * This is free software; you can redistribute and/or modify it under
+ * the terms of the GNU Lesser General Public Licence as published
+ * by the Free Software Foundation.
+ * See the COPYING file for more information.
+ *
+ **********************************************************************/
+
+#pragma once
+
+
+#include <geos/export.h>
+#include <geos/noding/Noder.h>
+#include <geos/noding/SegmentString.h>
+
+#include <memory> // for unique_ptr
+
+// Forward declarations
+namespace geos {
+namespace algorithm {
+class LineIntersector;
+}
+namespace geom {
+class Geometry;
+}
+}
+
+namespace geos {
+namespace noding { // geos.noding
+
+/**
+ * A wrapper for {@link noding::Noder}s which validates
+ * the output arrangement is correctly noded.
+ * An arrangement of line segments is fully noded if
+ * there is no line segment
+ * which has another segment intersecting its interior.
+ * If the noding is not correct, a {@link util::TopologyException} is thrown
+ * with details of the first invalid location found.
+ *
+ * @author mdavis
+ *
+ * @see FastNodingValidator
+ *
+ */
+class GEOS_DLL ValidatingNoder : public Noder {
+
+private:
+
+    std::vector<std::unique_ptr<SegmentString>> nodedSS;
+    noding::Noder& noder;
+
+
+public:
+
+    ValidatingNoder(Noder& noderArg)
+        : noder(noderArg)
+        {}
+
+    ~ValidatingNoder() override;
+
+    void computeNodes(const std::vector<SegmentString*>& segStrings) override;
+
+    void validate() const;
+
+    std::vector<std::unique_ptr<SegmentString>> getNodedSubstrings() override;
+
+    // Declare type as noncopyable
+    ValidatingNoder(ValidatingNoder const&) = delete;
+    ValidatingNoder& operator=(ValidatingNoder const&) = delete;
+
+};
+
+} // namespace geos.noding
+} // namespace geos
+

package/dist/prebuilt/linuxmusl-arm64-mt-release/include/geos/noding/snap/SnappingIntersectionAdder.h

@@ -0,0 +1,109 @@
+/**********************************************************************
+ *
+ * GEOS - Geometry Engine Open Source
+ * http://geos.osgeo.org
+ *
+ * Copyright (C) 2020 Paul Ramsey <pramsey@cleverelephant.ca>
+ *
+ * This is free software; you can redistribute and/or modify it under
+ * the terms of the GNU Lesser General Public Licence as published
+ * by the Free Software Foundation.
+ * See the COPYING file for more information.
+ *
+ **********************************************************************/
+
+#pragma once
+
+#include <geos/export.h>
+
+#include <vector>
+
+#include <geos/algorithm/LineIntersector.h> // for composition
+#include <geos/geom/Coordinate.h> // for use in vector
+#include <geos/geom/PrecisionModel.h> // for inlines (should drop)
+#include <geos/noding/SegmentIntersector.h>
+
+
+// Forward declarations
+namespace geos {
+namespace geom {
+class PrecisionModel;
+}
+namespace noding {
+class SegmentString;
+class NodedSegmentString;
+namespace snap {
+class SnappingPointIndex;
+}
+}
+}
+
+namespace geos {
+namespace noding { // geos::noding
+namespace snap { // geos::noding::snap
+
+class GEOS_DLL SnappingIntersectionAdder: public SegmentIntersector { // implements SegmentIntersector
+
+private:
+
+    algorithm::LineIntersector li;
+    double snapTolerance;
+    SnappingPointIndex& snapPointIndex;
+
+    /**
+    * If an endpoint of one segment is near
+    * the <i>interior</i> of the other segment, add it as an intersection.
+    * EXCEPT if the endpoint is also close to a segment endpoint
+    * (since this can introduce "zigs" in the linework).
+    * <p>
+    * This resolves situations where
+    * a segment A endpoint is extremely close to another segment B,
+    * but is not quite crossing.  Due to robustness issues
+    * in orientation detection, this can
+    * result in the snapped segment A crossing segment B
+    * without a node being introduced.
+    */
+    void processNearVertex(
+        SegmentString* srcSS,
+        std::size_t srcIndex,
+        const geom::Coordinate& p,
+        SegmentString* ss,
+        std::size_t segIndex,
+        const geom::Coordinate& p0,
+        const geom::Coordinate& p1);
+
+    /**
+    * Tests if segments are adjacent on the same SegmentString.
+    * Closed segStrings require a check for the point shared by the beginning
+    * and end segments.
+    */
+    static bool isAdjacent(SegmentString* ss0, std::size_t segIndex0, SegmentString* ss1, std::size_t segIndex1);
+
+
+public:
+
+    SnappingIntersectionAdder(double p_snapTolerance, SnappingPointIndex& p_snapPointIndex);
+
+    /**
+    * This method is called by clients
+    * of the {@link SegmentIntersector} class to process
+    * intersections for two segments of the {@link SegmentString}s being intersected.
+    * Note that some clients (such as <code>MonotoneChain</code>s) may optimize away
+    * this call for segment pairs which they have determined do not intersect
+    * (e.g. by an disjoint envelope test).
+    */
+    void processIntersections(SegmentString* e0, std::size_t segIndex0, SegmentString* e1, std::size_t segIndex1) override;
+
+    bool isDone() const override { return false; };
+
+
+};
+
+} // namespace geos::noding::snapround
+} // namespace geos::noding
+} // namespace geos
+
+
+
+
+

package/dist/prebuilt/linuxmusl-arm64-mt-release/include/geos/noding/snap/SnappingNoder.h

@@ -0,0 +1,122 @@
+/**********************************************************************
+ *
+ * GEOS - Geometry Engine Open Source
+ * http://geos.osgeo.org
+ *
+ * Copyright (C) 2020 Paul Ramsey <pramsey@cleverelephant.ca>
+ *
+ * This is free software; you can redistribute and/or modify it under
+ * the terms of the GNU Lesser General Public Licence as published
+ * by the Free Software Foundation.
+ * See the COPYING file for more information.
+ *
+ **********************************************************************
+ *
+ * Last port: noding/snap/SnappingNoder.java
+ *
+ **********************************************************************/
+
+#pragma once
+
+#include <geos/export.h>
+
+#include <geos/geom/Coordinate.h>
+#include <geos/geom/CoordinateSequence.h>
+#include <geos/geom/Envelope.h>
+#include <geos/noding/Noder.h>
+#include <geos/noding/SegmentString.h>
+#include <geos/noding/snap/SnappingPointIndex.h>
+
+
+// Forward declarations
+namespace geos {
+namespace geom {
+class Envelope;
+class PrecisionModel;
+}
+namespace noding {
+class NodedSegmentString;
+}
+}
+
+namespace geos {
+namespace noding { // geos::noding
+namespace snap {   // geos::noding::snap
+
+/**
+ * Nodes a set of segment strings
+ * snapping vertices and intersection points together if
+ * they lie within the given snap tolerance distance.
+ * Vertices take priority over intersection points for snapping.
+ * Input segment strings are generally only split at true node points
+ * (i.e. the output segment strings are of maximal length in the output arrangement).
+ *
+ * The snap tolerance should be chosen to be as small as possible
+ * while still producing a correct result.
+ * It probably only needs to be small enough to eliminate
+ * "nearly-coincident" segments, for which intersection points cannot be computed accurately.
+ * This implies a factor of about 10e-12
+ * smaller than the magnitude of the segment coordinates.
+ *
+ * With an appropriate snap tolerance this algorithm appears to be very robust.
+ * So far no failure cases have been found,
+ * given a small enough snap tolerance.
+ *
+ * The correctness of the output is not verified by this noder.
+ * If required this can be done by {@link noding::ValidatingNoder}.
+ */
+class GEOS_DLL SnappingNoder : public Noder {
+
+private:
+
+    // Members
+    double snapTolerance;
+    SnappingPointIndex snapIndex;
+    std::vector<std::unique_ptr<SegmentString>> nodedResult;
+
+    // Methods
+
+    void seedSnapIndex(const std::vector<SegmentString*>& segStrings);
+
+    void snapVertices(const std::vector<SegmentString*>& segStrings, std::vector<SegmentString*>& nodedStrings);
+
+    std::unique_ptr<SegmentString> snapVertices(const SegmentString* ss);
+
+    std::shared_ptr<geom::CoordinateSequence> snap(const geom::CoordinateSequence *cs);
+
+    /**
+    * Computes all interior intersections in the collection of {@link SegmentString}s,
+    * and returns their {@link Coordinate}s.
+    *
+    * Also adds the intersection nodes to the segments.
+    *
+    * @return a list of Coordinates for the intersections
+    */
+    std::vector<std::unique_ptr<SegmentString>> snapIntersections(std::vector<SegmentString*>& inputSS);
+
+
+public:
+
+    /**
+     * Creates a snapping noder using the given snap distance tolerance.
+     * @param p_snapTolerance points are snapped if within this distance
+     */
+    SnappingNoder(double p_snapTolerance)
+        : snapTolerance(p_snapTolerance)
+        , snapIndex(p_snapTolerance)
+        {}
+
+    /**
+    * @return a Collection of NodedSegmentStrings representing the substrings
+    */
+    std::vector<std::unique_ptr<SegmentString>> getNodedSubstrings() override;
+
+    void computeNodes(const std::vector<SegmentString*>& inputSegStrings) override;
+
+
+};
+
+
+} // namespace geos::noding::snap
+} // namespace geos::noding
+} // namespace geos

package/dist/prebuilt/linuxmusl-arm64-mt-release/include/geos/noding/snap/SnappingPointIndex.h

@@ -0,0 +1,62 @@
+/**********************************************************************
+ *
+ * GEOS - Geometry Engine Open Source
+ * http://geos.osgeo.org
+ *
+ * Copyright (C) 2020 Paul Ramsey <pramsey@cleverelephant.ca>
+ *
+ * This is free software; you can redistribute and/or modify it under
+ * the terms of the GNU Lesser General Public Licence as published
+ * by the Free Software Foundation.
+ * See the COPYING file for more information.
+ *
+ **********************************************************************
+ *
+ * Last port: noding/snap/SnappingPointIndex.java
+ *
+ **********************************************************************/
+
+#pragma once
+
+#include <geos/geom/Coordinate.h>
+#include <geos/index/kdtree/KdTree.h>
+#include <geos/index/kdtree/KdNode.h>
+
+namespace geos {
+namespace noding { // geos::noding
+namespace snap { // geos::noding::snap
+
+class GEOS_DLL SnappingPointIndex {
+
+/**
+ * An index providing fast creation and lookup of snap points.
+ * @author mdavis
+ */
+
+private:
+
+    // double snapTolerance;
+    std::unique_ptr<index::kdtree::KdTree> snapPointIndex;
+
+public:
+
+    SnappingPointIndex(double p_snapTolerance);
+
+    /**
+    * Snaps a coordinate to an existing snap point,
+    * if it is within the snap tolerance distance.
+    * Otherwise adds the coordinate to the snap point index.
+    *
+    * @param p the point to snap
+    * @return the point it snapped to, or the input point
+    */
+    const geom::Coordinate& snap(const geom::Coordinate& p);
+
+};
+
+} // namespace geos::noding::snap
+} // namespace geos::noding
+} // namespace geos
+
+
+

package/dist/prebuilt/linuxmusl-arm64-mt-release/include/geos/noding/snapround/HotPixel.h

@@ -0,0 +1,171 @@
+/**********************************************************************
+ *
+ * GEOS - Geometry Engine Open Source
+ * http://geos.osgeo.org
+ *
+ * Copyright (C) 2006      Refractions Research Inc.
+ *
+ * This is free software; you can redistribute and/or modify it under
+ * the terms of the GNU Lesser General Public Licence as published
+ * by the Free Software Foundation.
+ * See the COPYING file for more information.
+ *
+ **********************************************************************
+ *
+ * Last port: noding/snapround/HotPixel.java r320 (JTS-1.12)
+ *
+ **********************************************************************/
+
+#pragma once
+
+#include <geos/export.h>
+
+#include <geos/geom/Coordinate.h> // for composition
+#include <geos/util/IllegalArgumentException.h>
+#include <geos/util/math.h>
+
+#include <array>
+
+#ifdef _MSC_VER
+#pragma warning(push)
+#pragma warning(disable: 4251) // warning C4251: needs to have dll-interface to be used by clients of class
+#endif
+
+// Forward declarations
+namespace geos {
+namespace geom {
+class Envelope;
+}
+namespace algorithm {
+class LineIntersector;
+}
+namespace noding {
+class NodedSegmentString;
+}
+}
+
+namespace geos {
+namespace noding { // geos::noding
+namespace snapround { // geos::noding::snapround
+
+/** \brief
+ * Implements a "hot pixel" as used in the Snap Rounding algorithm.
+ *
+ * A hot pixel contains the interior of the tolerance square and
+ * the boundary minus the top and right segments.
+ *
+ * The hot pixel operations are all computed in the integer domain
+ * to avoid rounding problems.
+ */
+class GEOS_DLL HotPixel {
+
+private:
+
+    static constexpr double TOLERANCE = 0.5;
+
+    static constexpr int UPPER_RIGHT = 0;
+    static constexpr int UPPER_LEFT  = 1;
+    static constexpr int LOWER_LEFT  = 2;
+    static constexpr int LOWER_RIGHT = 3;
+
+    // Store all ordinates because we may use them in constructing a SegmentNode.
+    geom::CoordinateXYZM originalPt;
+    double scaleFactor;
+
+    /* The scaled ordinates of the hot pixel point */
+    double hpx;
+    double hpy;
+
+    /* Indicates if this hot pixel must be a node in the output. */
+    bool hpIsNode;
+
+    double scaleRound(double val) const
+    {
+        // Use Java-compatible round implementation
+        return util::round(val * scaleFactor);
+    };
+
+    double scale(double val) const
+    {
+        return val * scaleFactor;
+    };
+
+    bool intersectsPixelClosure(const geom::Coordinate& p0,
+                                const geom::Coordinate& p1) const;
+
+    bool intersectsScaled(double p0x, double p0y, double p1x, double p1y) const;
+
+    // Declare type as noncopyable
+    HotPixel(const HotPixel& other) = delete;
+    HotPixel& operator=(const HotPixel& rhs) = delete;
+
+public:
+
+    /**
+    * Gets the width of the hot pixel in the original coordinate system.
+    */
+    double getWidth() const { return 1.0 / scaleFactor; };
+
+    double getScaleFactor() const { return scaleFactor; };
+
+    /**
+     * Creates a new hot pixel.
+     *
+     * @param pt the coordinate at the centre of the pixel.
+     * @param scaleFact the scaleFactor determining the pixel size     */
+    template<typename CoordType>
+    HotPixel(const CoordType& pt, double scaleFact)
+        : originalPt(pt)
+        , scaleFactor(scaleFact)
+        , hpx(pt.x)
+        , hpy(pt.y)
+        , hpIsNode(false)
+    {
+        if(scaleFactor <= 0.0) {
+            throw util::IllegalArgumentException("Scale factor must be non-zero");
+        }
+        if(scaleFactor != 1.0) {
+            hpx = scaleRound(pt.x);
+            hpy = scaleRound(pt.y);
+        }
+    }
+
+    /*
+    * Gets the coordinate this hot pixel is based at.
+    *
+    * @return the coordinate of the pixel
+    */
+    const geom::CoordinateXYZM& getCoordinate() const;
+
+    /**
+     * Tests whether the line segment (p0-p1) intersects this hot pixel.
+     *
+     * @param p0 the first coordinate of the line segment to test
+     * @param p1 the second coordinate of the line segment to test
+     * @return true if the line segment intersects this hot pixel
+     */
+    bool intersects(const geom::CoordinateXY& p0,
+                    const geom::CoordinateXY& p1) const;
+
+    /**
+    * Tests whether a coordinate lies in (intersects) this hot pixel.
+    *
+    * @param p the coordinate to test
+    * @return true if the coordinate intersects this hot pixel
+    */
+    bool intersects(const geom::CoordinateXY& p) const;
+
+    bool isNode() const { return hpIsNode; };
+    void setToNode() { hpIsNode = true; };
+
+    std::ostream& operator<< (std::ostream& os);
+};
+
+} // namespace geos::noding::snapround
+} // namespace geos::noding
+} // namespace geos
+
+#ifdef _MSC_VER
+#pragma warning(pop)
+#endif
+