BufferSubgraph.h

/**********************************************************************
 *
 * 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: operation/buffer/BufferSubgraph.java r378 (JTS-1.12)
 *
 **********************************************************************/
 
#ifndef GEOS_OP_BUFFER_BUFFERSUBGRAPH_H
#define GEOS_OP_BUFFER_BUFFERSUBGRAPH_H
 
#include <geos/export.h>
 
#include <geos/operation/buffer/RightmostEdgeFinder.h> // for composition
 
#include <vector>
#include <set>
 
#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 Coordinate;
                class Envelope;
        }
        namespace algorithm {
                class CGAlgorithms;
        }
        namespace geomgraph {
                class DirectedEdge;
                class Node;
        }
}
 
namespace geos {
namespace operation { // geos.operation
namespace buffer { // geos.operation.buffer

class GEOS_DLL BufferSubgraph {
private:
        RightmostEdgeFinder finder;
 
        std::vector<geomgraph::DirectedEdge*> dirEdgeList;
 
        std::vector<geomgraph::Node*> nodes;
 
        geom::Coordinate *rightMostCoord;
 
        geom::Envelope *env;

        void addReachable(geomgraph::Node *startNode);

        //
        void add(geomgraph::Node* node, std::vector<geomgraph::Node*>* nodeStack);
 
        void clearVisitedEdges();

        // <FIX> MD - use iteration & queue rather than recursion, for speed and robustness
        void computeDepths(geomgraph::DirectedEdge *startEdge);
 
        void computeNodeDepth(geomgraph::Node *n);
 
        void copySymDepths(geomgraph::DirectedEdge *de);
 
        bool contains(std::set<geomgraph::Node*>& nodes, geomgraph::Node *node);
 
public:
 
        friend std::ostream& operator<< (std::ostream& os, const BufferSubgraph& bs);
 
        BufferSubgraph(); 
 
        ~BufferSubgraph();
 
        std::vector<geomgraph::DirectedEdge*>* getDirectedEdges();
 
        std::vector<geomgraph::Node*>* getNodes();

        geom::Coordinate* getRightmostCoordinate();

        void create(geomgraph::Node *node);
 
        void computeDepth(int outsideDepth);

        void findResultEdges();

        int compareTo(BufferSubgraph *);

        geom::Envelope *getEnvelope();
};
 
std::ostream& operator<< (std::ostream& os, const BufferSubgraph& bs);
 
// INLINES
inline geom::Coordinate*
BufferSubgraph::getRightmostCoordinate() {return rightMostCoord;}
 
inline std::vector<geomgraph::Node*>*
BufferSubgraph::getNodes() { return &nodes; }
 
inline std::vector<geomgraph::DirectedEdge*>*
BufferSubgraph::getDirectedEdges() {
        return &dirEdgeList;
}
 
bool BufferSubgraphGT(BufferSubgraph *first, BufferSubgraph *second);
 
} // namespace geos::operation::buffer
} // namespace geos::operation
} // namespace geos
 
#ifdef _MSC_VER
#pragma warning(pop)
#endif
 
#endif // ndef GEOS_OP_BUFFER_BUFFERSUBGRAPH_H