kdTreeRangeIterator.h

/*
 This Source Code Form is subject to the terms of the Mozilla Public
 License, v. 2.0. If a copy of the MPL was not distributed with this
 file, You can obtain one at http://mozilla.org/MPL/2.0/.
*/
 
#pragma once
 
#include <cstddef>
 
namespace Ponca
{
 
    template <typename Index, typename DataPoint, typename QueryT_>
    class KdTreeRangeIterator
    {
    protected:
        friend QueryT_;
 
    public:
        using iterator_category = std::input_iterator_tag;
        using difference_type   = std::ptrdiff_t;
        using value_type        = Index;
        using pointer           = Index*;
        using reference         = const Index&;
 
        using Scalar    = typename DataPoint::Scalar;
        using QueryType = QueryT_;
 
        PONCA_MULTIARCH inline KdTreeRangeIterator() = default;
        PONCA_MULTIARCH inline KdTreeRangeIterator(QueryType* query, Index index = -1)
            : m_query(query), m_index(index), m_start(0), m_end(0)
        {
        }
 
        PONCA_MULTIARCH inline bool operator!=(const KdTreeRangeIterator& other) const
        {
            return m_index != other.m_index;
        }
 
        PONCA_MULTIARCH inline bool operator==(const KdTreeRangeIterator& other) const
        {
            return m_index == other.m_index;
        }
 
        PONCA_MULTIARCH inline KdTreeRangeIterator& operator++()
        {
            m_query->advance(*this);
            return *this;
        }
 
        PONCA_MULTIARCH inline KdTreeRangeIterator operator++(int)
        {
            KdTreeRangeIterator tmp = *this;
            m_query->advance(*this);
            return tmp;
        }
 
        PONCA_MULTIARCH inline reference operator*() const { return const_cast<reference>(m_index); }
 
    protected:
        QueryType* m_query{nullptr};
        Index m_index{-1};
        Index m_start{0};
        Index m_end{0};
    };
} // namespace Ponca