@cpp.js/package-geos 1.0.0-beta.20 → 1.0.0-beta.22

package/dist/prebuilt/geos_c.xcframework/ios-arm64_arm64e/Headers/geos/geomgraph/Node.h

@@ -1,192 +0,0 @@
-/**********************************************************************
- *
- * GEOS - Geometry Engine Open Source
- * http://geos.osgeo.org
- *
- * Copyright (C) 2011 Sandro Santilli <strk@kbt.io>
- * Copyright (C) 2005-2006 Refractions Research Inc.
- * Copyright (C) 2001-2002 Vivid Solutions 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: geomgraph/Node.java r411 (JTS-1.12+)
- *
- **********************************************************************/
-
-
-#pragma once
-
-#include <geos/export.h>
-#include <geos/geomgraph/GraphComponent.h> // for inheritance
-#include <geos/geom/Coordinate.h> // for member
-
-#ifndef NDEBUG
-#include <geos/geomgraph/EdgeEndStar.h> // for testInvariant
-#include <geos/geomgraph/EdgeEnd.h> // for testInvariant
-#endif // ndef NDEBUG
-
-#include <cassert>
-#include <string>
-
-#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 IntersectionMatrix;
-}
-namespace geomgraph {
-class Node;
-class EdgeEndStar;
-class EdgeEnd;
-class Label;
-class NodeFactory;
-}
-}
-
-namespace geos {
-namespace geomgraph { // geos.geomgraph
-
-/** \brief The node component of a geometry graph. */
-class GEOS_DLL Node: public GraphComponent {
-    using GraphComponent::setLabel;
-
-public:
-
-    friend std::ostream& operator<< (std::ostream& os, const Node& node);
-
-    Node(const geom::Coordinate& newCoord, EdgeEndStar* newEdges);
-
-    ~Node() override;
-
-    virtual const geom::Coordinate& getCoordinate() const;
-
-    virtual EdgeEndStar* getEdges();
-
-    bool isIsolated() const override;
-
-    /** \brief
-     * Add the edge to the list of edges at this node
-     */
-    virtual void add(EdgeEnd* e);
-
-    virtual void mergeLabel(const Node& n);
-
-    /** \brief
-     * To merge labels for two nodes,
-     * the merged location for each LabelElement is computed.
-     *
-     * The location for the corresponding node LabelElement is set
-     * to the result, as long as the location is non-null.
-     */
-    virtual void mergeLabel(const Label& label2);
-
-    virtual void setLabel(uint8_t argIndex, geom::Location onLocation);
-
-    /** \brief
-     * Updates the label of a node to BOUNDARY,
-     * obeying the mod-2 boundaryDetermination rule.
-     */
-    virtual void setLabelBoundary(uint8_t argIndex);
-
-    /**
-     * The location for a given eltIndex for a node will be one
-     * of { null, INTERIOR, BOUNDARY }.
-     * A node may be on both the boundary and the interior of a geometry;
-     * in this case, the rule is that the node is considered to be
-     * in the boundary.
-     * The merged location is the maximum of the two input values.
-     */
-    virtual geom::Location computeMergedLocation(const Label& label2, uint8_t eltIndex);
-
-    virtual std::string print() const;
-
-    virtual const std::vector<double>& getZ() const;
-
-    virtual void addZ(double);
-
-    /** \brief
-     * Tests whether any incident edge is flagged as
-     * being in the result.
-     *
-     * This test can be used to determine if the node is in the result,
-     * since if any incident edge is in the result, the node must be in
-     * the result as well.
-     *
-     * @return <code>true</code> if any indicident edge in the in
-     *         the result
-     */
-    virtual bool isIncidentEdgeInResult() const;
-
-protected:
-
-    void testInvariant() const;
-
-    geom::Coordinate coord;
-
-    EdgeEndStar* edges;
-
-    /** \brief
-     * Basic nodes do not compute IMs
-     */
-    void
-    computeIM(geom::IntersectionMatrix& /*im*/) override {}
-
-private:
-
-    std::vector<double> zvals;
-
-    double ztot;
-
-};
-
-std::ostream& operator<< (std::ostream& os, const Node& node);
-
-inline void
-Node::testInvariant() const
-{
-#ifndef NDEBUG
-    if(edges) {
-        // Each EdgeEnd in the star has this Node's
-        // coordinate as first coordinate
-        for(EdgeEndStar::iterator
-                it = edges->begin(), itEnd = edges->end();
-                it != itEnd; it++) {
-            EdgeEnd* e = *it;
-            assert(e);
-            assert(e->getCoordinate().equals2D(coord));
-        }
-    }
-
-#if 0
-    // We can't rely on numerical stability with FP computations
-    // ztot is the sum of doubnle sin zvals vector
-    double ztot_check = 0.0;
-    for(std::vector<double>::const_iterator
-            i = zvals.begin(), e = zvals.end();
-            i != e;
-            i++) {
-        ztot_check += *i;
-    }
-    assert(ztot_check == ztot);
-#endif // 0
-
-#endif
-}
-
-
-} // namespace geos.geomgraph
-} // namespace geos
-
-#ifdef _MSC_VER
-#pragma warning(pop)
-#endif
-

package/dist/prebuilt/geos_c.xcframework/ios-arm64_arm64e/Headers/geos/geomgraph/NodeFactory.h

@@ -1,51 +0,0 @@
-/**********************************************************************
- *
- * GEOS - Geometry Engine Open Source
- * http://geos.osgeo.org
- *
- * Copyright (C) 2005-2006 Refractions Research Inc.
- * Copyright (C) 2001-2002 Vivid Solutions 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: geomgraph/NodeFactory.java rev. 1.3 (JTS-1.10)
- *
- **********************************************************************/
-
-
-#pragma once
-
-#include <geos/export.h>
-
-// Forward declarations
-namespace geos {
-namespace geom {
-class Coordinate;
-}
-namespace geomgraph {
-class Node;
-}
-}
-
-namespace geos {
-namespace geomgraph { // geos.geomgraph
-
-class GEOS_DLL NodeFactory {
-public:
-    virtual Node* createNode(const geom::Coordinate& coord) const;
-    static const NodeFactory& instance();
-    virtual
-    ~NodeFactory() {}
-protected:
-    NodeFactory() {}
-};
-
-
-} // namespace geos.geomgraph
-} // namespace geos
-

package/dist/prebuilt/geos_c.xcframework/ios-arm64_arm64e/Headers/geos/geomgraph/NodeMap.h

@@ -1,145 +0,0 @@
-/**********************************************************************
- *
- * GEOS - Geometry Engine Open Source
- * http://geos.osgeo.org
- *
- * Copyright (C) 2005-2006 Refractions Research Inc.
- * Copyright (C) 2001-2002 Vivid Solutions 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: geomgraph/NodeMap.java rev. 1.3 (JTS-1.10)
- *
- **********************************************************************/
-
-
-#pragma once
-
-#include <geos/export.h>
-#include <map>
-#include <memory>
-#include <vector>
-#include <string>
-
-#include <geos/geom/Coordinate.h> // for CoordinateLessThan
-#include <geos/geomgraph/Node.h> // for testInvariant
-
-
-#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 geomgraph {
-class Node;
-class EdgeEnd;
-class NodeFactory;
-}
-}
-
-namespace geos {
-namespace geomgraph { // geos.geomgraph
-
-class GEOS_DLL NodeMap {
-public:
-
-    typedef std::map<geom::Coordinate*, std::unique_ptr<Node>, geom::CoordinateLessThan> container;
-
-    typedef container::iterator iterator;
-
-    typedef container::const_iterator const_iterator;
-
-    container nodeMap;
-
-    const NodeFactory& nodeFact;
-
-    /// \brief
-    /// NodeMap will keep a reference to the NodeFactory,
-    /// keep it alive for the whole NodeMap lifetime
-    NodeMap(const NodeFactory& newNodeFact);
-
-    virtual ~NodeMap();
-
-    Node* addNode(const geom::Coordinate& coord);
-
-    Node* addNode(Node* n);
-
-    /// \brief
-    /// Adds a node for the start point of this EdgeEnd
-    /// (if one does not already exist in this map).
-    /// Adds the EdgeEnd to the (possibly new) node.
-    ///
-    /// If ownership of the EdgeEnd should be transferred
-    /// to the Node, use the unique_ptr overload instead.
-    void add(EdgeEnd* e);
-
-    void add(std::unique_ptr<EdgeEnd>&& e);
-
-    Node* find(const geom::Coordinate& coord) const;
-
-    const_iterator
-    begin() const
-    {
-        return nodeMap.begin();
-    }
-
-    const_iterator
-    end() const
-    {
-        return nodeMap.end();
-    }
-
-    iterator
-    begin()
-    {
-        return nodeMap.begin();
-    }
-
-    iterator
-    end()
-    {
-        return nodeMap.end();
-    }
-
-    void getBoundaryNodes(uint8_t geomIndex,
-                          std::vector<Node*>& bdyNodes) const;
-
-    std::string print() const;
-
-    void
-    testInvariant()
-    {
-#ifndef NDEBUG
-        // Each Coordinate key is a pointer inside the Node value
-        for(const auto& nodeIt: nodeMap) {
-            const auto* n = nodeIt.second.get();
-            geom::Coordinate* c = const_cast<geom::Coordinate*>(
-                                      &(n->getCoordinate())
-                                  );
-            assert(nodeIt.first == c);
-            (void)c;
-        }
-#endif
-    }
-
-private:
-
-    // Declare type as noncopyable
-    NodeMap(const NodeMap& other) = delete;
-    NodeMap& operator=(const NodeMap& rhs) = delete;
-};
-
-} // namespace geos.geomgraph
-} // namespace geos
-
-#ifdef _MSC_VER
-#pragma warning(pop)
-#endif
-

package/dist/prebuilt/geos_c.xcframework/ios-arm64_arm64e/Headers/geos/geomgraph/PlanarGraph.h

@@ -1,203 +0,0 @@
-/**********************************************************************
- *
- * GEOS - Geometry Engine Open Source
- * http://geos.osgeo.org
- *
- * Copyright (C) 2005-2006 Refractions Research Inc.
- * Copyright (C) 2001-2002 Vivid Solutions 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: geomgraph/PlanarGraph.java r428 (JTS-1.12+)
- *
- **********************************************************************/
-
-
-#pragma once
-
-#include <geos/export.h>
-#include <map>
-#include <vector>
-#include <memory>
-
-#include <geos/geom/Coordinate.h>
-#include <geos/geomgraph/PlanarGraph.h>
-#include <geos/geomgraph/NodeMap.h> // for typedefs
-#include <geos/geomgraph/DirectedEdgeStar.h> // for inlines
-
-// Forward declarations
-namespace geos {
-namespace geom {
-class Coordinate;
-}
-namespace geomgraph {
-class Edge;
-class Node;
-class EdgeEnd;
-class NodeFactory;
-}
-}
-
-namespace geos {
-namespace geomgraph { // geos.geomgraph
-
-/**
- * \brief
- * Represents a directed graph which is embeddable in a planar surface.
- *
- * The computation of the IntersectionMatrix relies on the use of a structure
- * called a "topology graph".  The topology graph contains nodes and edges
- * corresponding to the nodes and line segments of a Geometry. Each
- * node and edge in the graph is labeled with its topological location
- * relative to the source geometry.
- *
- * Note that there is no requirement that points of self-intersection
- * be a vertex.
- * Thus to obtain a correct topology graph, Geometry objects must be
- * self-noded before constructing their graphs.
- *
- * Two fundamental operations are supported by topology graphs:
- *
- *  - Computing the intersections between all the edges and nodes of
- *    a single graph
- *  - Computing the intersections between the edges and nodes of two
- *    different graphs
- *
- */
-class GEOS_DLL PlanarGraph {
-public:
-
-    /** \brief
-     * For nodes in the collection (first..last),
-     * link the DirectedEdges at the node that are in the result.
-     *
-     * This allows clients to link only a subset of nodes in the graph,
-     * for efficiency (because they know that only a subset is of
-     * interest).
-     */
-    template <typename It>
-    static void
-    linkResultDirectedEdges(It first, It last)
-    // throw(TopologyException);
-    {
-        for(; first != last; ++first) {
-            Node* node = *first;
-            assert(node);
-
-            EdgeEndStar* ees = node->getEdges();
-            assert(ees);
-            DirectedEdgeStar* des = dynamic_cast<DirectedEdgeStar*>(ees);
-            assert(des);
-
-            // this might throw an exception
-            des->linkResultDirectedEdges();
-        }
-    }
-
-    PlanarGraph(const NodeFactory& nodeFact);
-
-    PlanarGraph();
-
-    virtual ~PlanarGraph();
-
-    virtual std::vector<Edge*>::iterator getEdgeIterator();
-
-    virtual std::vector<EdgeEnd*>* getEdgeEnds();
-
-    virtual bool isBoundaryNode(uint8_t geomIndex, const geom::Coordinate& coord);
-
-    virtual void add(EdgeEnd* e);
-
-    virtual NodeMap::iterator getNodeIterator();
-
-    virtual void getNodes(std::vector<Node*>&);
-
-    virtual Node* addNode(Node* node);
-
-    virtual Node* addNode(const geom::Coordinate& coord);
-
-    /**
-     * @return the node if found; null otherwise
-     */
-    virtual Node* find(geom::Coordinate& coord);
-
-    /** \brief
-     * Add a set of edges to the graph.  For each edge two DirectedEdges
-     * will be created.  DirectedEdges are NOT linked by this method.
-     */
-    virtual void addEdges(const std::vector<Edge*>& edgesToAdd);
-
-    virtual void linkResultDirectedEdges();
-
-    virtual void linkAllDirectedEdges();
-
-    /** \brief
-     * Returns the EdgeEnd which has edge e as its base edge
-     * (MD 18 Feb 2002 - this should return a pair of edges)
-     *
-     * @return the edge, if found
-     *    <code>null</code> if the edge was not found
-     */
-    virtual EdgeEnd* findEdgeEnd(Edge* e);
-
-    /** \brief
-     * Returns the edge whose first two coordinates are p0 and p1
-     *
-     * @return the edge, if found
-     *    <code>null</code> if the edge was not found
-     */
-    virtual Edge* findEdge(const geom::Coordinate& p0,
-                           const geom::Coordinate& p1);
-
-    /** \brief
-     * Returns the edge which starts at p0 and whose first segment is
-     * parallel to p1
-     *
-     * @return the edge, if found
-     *    <code>null</code> if the edge was not found
-     */
-    virtual Edge* findEdgeInSameDirection(const geom::Coordinate& p0,
-                                          const geom::Coordinate& p1);
-
-    virtual std::string printEdges();
-
-    virtual NodeMap* getNodeMap();
-
-protected:
-
-    std::vector<Edge*>* edges;
-
-    NodeMap* nodes;
-
-    std::vector<EdgeEnd*>* edgeEndList;
-
-    virtual void insertEdge(Edge* e);
-
-private:
-
-    /** \brief
-     * The coordinate pairs match if they define line segments
-     * lying in the same direction.
-     *
-     * E.g. the segments are parallel and in the same quadrant
-     * (as opposed to parallel and opposite!).
-     */
-    bool matchInSameDirection(const geom::Coordinate& p0,
-                              const geom::Coordinate& p1,
-                              const geom::Coordinate& ep0,
-                              const geom::Coordinate& ep1);
-
-    PlanarGraph(const PlanarGraph&) = delete;
-    PlanarGraph& operator=(const PlanarGraph&) = delete;
-};
-
-
-
-} // namespace geos.geomgraph
-} // namespace geos
-

package/dist/prebuilt/geos_c.xcframework/ios-arm64_arm64e/Headers/geos/index/bintree/Bintree.h

@@ -1,129 +0,0 @@
-/**********************************************************************
- *
- * 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 <vector>
-
-#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 index {
-namespace bintree {
-class Interval;
-class Root;
-}
-}
-}
-
-namespace geos {
-namespace index { // geos::index
-namespace bintree { // geos::index::bintree
-
-/** \brief
- * A BinTree (or "Binary Interval Tree") is a 1-dimensional version of a quadtree.
- *
- * It indexes 1-dimensional intervals (which of course may be the projection
- * of 2-D objects on an axis). It supports range searching (where the range
- * may be a single point).
- *
- * This implementation does not require specifying the extent of the inserted
- * items beforehand. It will automatically expand to accomodate any extent
- * of dataset.
- *
- * This index is different to the "Interval Tree of Edelsbrunner"
- * or the "Segment Tree of Bentley".
- */
-class GEOS_DLL Bintree {
-
-public:
-
-    /** \brief
-     * Ensure that the Interval for the inserted item has non-zero extents.
-     *
-     * Use the current minExtent to pad it, if necessary.
-     *
-     * @note In GEOS this function always return a newly allocated object
-     *       with ownership transferred to caller. TODO: change this ?
-     *
-     * @param itemInterval source interval, ownership left to caller, no references hold
-     * @param minExtent minimal extent
-     */
-    static Interval* ensureExtent(const Interval* itemInterval,
-                                  double minExtent);
-
-    Bintree();
-
-    ~Bintree();
-
-    int depth();
-
-    int size();
-
-    int nodeSize();
-
-    /// @param itemInterval
-    ///     Ownership left to caller, NO reference hold by this class.
-    ///
-    /// @param item
-    ///     Ownership left to caller, reference kept by this class.
-    ///
-    void insert(Interval* itemInterval, void* item);
-
-    std::vector<void*>* iterator();
-
-    std::vector<void*>* query(double x);
-
-    std::vector<void*>* query(Interval* interval);
-
-    void query(Interval* interval,
-               std::vector<void*>* foundItems);
-
-private:
-
-    std::vector<Interval*>newIntervals;
-
-    Root* root;
-
-    /**
-     *  Statistics
-     *
-     * minExtent is the minimum extent of all items
-     * inserted into the tree so far. It is used as a heuristic value
-     * to construct non-zero extents for features with zero extent.
-     * Start with a non-zero extent, in case the first feature inserted has
-     * a zero extent in both directions.  This value may be non-optimal, but
-     * only one feature will be inserted with this value.
-     */
-    double minExtent;
-
-    void collectStats(Interval* interval);
-
-    Bintree(const Bintree&) = delete;
-    Bintree& operator=(const Bintree&) = delete;
-};
-
-} // namespace geos::index::bintree
-} // namespace geos::index
-} // namespace geos
-
-#ifdef _MSC_VER
-#pragma warning(pop)
-#endif
-