/**********************************************************************
 *
 * 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/MCIndexNoder.java rev. 1.6 (JTS-1.9)
 *
 **********************************************************************/

#pragma once

#include <geos/export.h>

#include <geos/index/chain/MonotoneChainOverlapAction.h> // for inheritance
#include <geos/index/chain/MonotoneChain.h>
#include <geos/index/strtree/TemplateSTRtree.h> // for composition
#include <geos/noding/NodedSegmentString.h>
#include <geos/noding/SegmentString.h>
#include <geos/noding/SinglePassNoder.h> // for inheritance
#include <geos/util.h>

#include <vector>
#include <iostream>

#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 LineSegment;
class Envelope;
}
namespace noding {
class SegmentString;
class SegmentIntersector;
}
}

namespace geos {
namespace noding { // geos.noding

/** \brief
 * Nodes a set of SegmentString using a index based
 * on [MonotoneChain](@ref index::chain::MonotoneChain)
 * and a [SpatialIndex](@ref index::SpatialIndex).
 *
 * The [SpatialIndex](@ref index::SpatialIndex) used should be something that supports
 * envelope (range) queries efficiently (such as a [Quadtree](@ref index::quadtree::Quadtree)
 * or [STRtree](@ref index::strtree::STRtree)).
 *
 * Last port: noding/MCIndexNoder.java rev. 1.4 (JTS-1.7)
 */
class GEOS_DLL MCIndexNoder : public SinglePassNoder {

private:
    std::vector<index::chain::MonotoneChain> monoChains;
    index::strtree::TemplateSTRtree<const index::chain::MonotoneChain*> index;
    std::vector<SegmentString*> nodedSegStrings;
    // statistics
    int nOverlaps;
    double overlapTolerance;
    bool indexBuilt;

    void intersectChains();

    void add(SegmentString* segStr);

public:

    MCIndexNoder(SegmentIntersector* nSegInt = nullptr, double p_overlapTolerance = 0.0)
        : SinglePassNoder(nSegInt)
        , nOverlaps(0)
        , overlapTolerance(p_overlapTolerance)
        , indexBuilt(false)
    {}

    ~MCIndexNoder() override {};


    /// \brief Return a reference to this instance's std::vector of MonotoneChains
    std::vector<index::chain::MonotoneChain>&
    getMonotoneChains()
    {
        return monoChains;
    }

    index::SpatialIndex& getIndex()
    {
        return index;
    }

    std::vector<std::unique_ptr<SegmentString>> getNodedSubstrings() override
    {
        //assert(nodedSegStrings); // must have called computeNodes before!
        return NodedSegmentString::getNodedSubstrings(nodedSegStrings);
    }

    void computeNodes(const std::vector<SegmentString*>& inputSegmentStrings) override;

    class SegmentOverlapAction : public index::chain::MonotoneChainOverlapAction {
    public:
        SegmentOverlapAction(SegmentIntersector& newSi)
            :
            index::chain::MonotoneChainOverlapAction(),
            si(newSi)
        {}

        void overlap(const index::chain::MonotoneChain& mc1, std::size_t start1,
                     const index::chain::MonotoneChain& mc2, std::size_t start2) override;
    private:
        SegmentIntersector& si;

        // Declare type as noncopyable
        SegmentOverlapAction(const SegmentOverlapAction& other) = delete;
        SegmentOverlapAction& operator=(const SegmentOverlapAction& rhs) = delete;
    };

};

} // namespace geos.noding
} // namespace geos

#ifdef _MSC_VER
#pragma warning(pop)
#endif



