/**********************************************************************

 *

 * 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/EdgeIntersectionList.java r428 (JTS-1.12+)

 *

 **********************************************************************/

#pragma once

#include <geos/export.h>

#include <algorithm>

#include <vector>

#include <string>

#include <geos/geomgraph/EdgeIntersection.h> // for EdgeIntersectionLessThen

#include <geos/geom/Coordinate.h> // for CoordinateLessThan

#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;

}

namespace geomgraph {

class Edge;

}

}

namespace geos {

namespace geomgraph { // geos.geomgraph

/** \brief

 * A list of edge intersections along an Edge.

 *

 * Implements splitting an edge with intersections

 * into multiple resultant edges.

 */

class GEOS_DLL EdgeIntersectionList final {

public:

    // Instead of storing edge intersections in a set, as JTS does, we store them

    // in a vector and then sort the vector if needed before iterating among the

    // edges. This is much faster.

    using container = std::vector<EdgeIntersection>;

    using const_iterator = container::const_iterator;

private:

    mutable container nodeMap;

    mutable bool sorted;

public:

    const Edge* edge;

    EdgeIntersectionList(const Edge* edge);

    ~EdgeIntersectionList() = default;

    /*

     * Adds an intersection into the list, if it isn't already there.

     * The input segmentIndex and dist are expected to be normalized.

     * @return the EdgeIntersection found or added

     */

    void add(const geom::Coordinate& coord, std::size_t segmentIndex, double dist);

    const_iterator

    begin() const

    {

        if (!sorted) {

            std::sort(nodeMap.begin(), nodeMap.end());

            nodeMap.erase(std::unique(nodeMap.begin(), nodeMap.end()), nodeMap.end());

            sorted = true;

        }

        return nodeMap.begin();

    }

    const_iterator

    end() const

    {

        return nodeMap.end();

    }

    bool isEmpty() const;

    bool isIntersection(const geom::Coordinate& pt) const;

    /*

     * Adds entries for the first and last points of the edge to the list

     */

    void addEndpoints();

    /**

     * Creates new edges for all the edges that the intersections in this

     * list split the parent edge into.

     * Adds the edges to the input list (this is so a single list

     * can be used to accumulate all split edges for a Geometry).

     *

     * @param edgeList a list of EdgeIntersections

     */

    void addSplitEdges(std::vector<Edge*>* edgeList);

    Edge* createSplitEdge(const EdgeIntersection* ei0, const EdgeIntersection* ei1);

    std::string print() const;

};

std::ostream& operator<< (std::ostream&, const EdgeIntersectionList&);

} // namespace geos.geomgraph

} // namespace geos

#ifdef _MSC_VER

#pragma warning(pop)

#endif