kdTreeNearestIterator.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>
    class KdTreeNearestIterator
    {
    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&;
 
        PONCA_MULTIARCH inline KdTreeNearestIterator() = default;
        PONCA_MULTIARCH inline KdTreeNearestIterator(Index index) : m_index(index) {}
        PONCA_MULTIARCH virtual inline ~KdTreeNearestIterator() = default;
 
    public:
        PONCA_MULTIARCH inline bool operator!=(const KdTreeNearestIterator& other) const
        {
            return m_index != other.m_index;
        }

        PONCA_MULTIARCH inline bool operator==(const KdTreeNearestIterator& other) const
        {
            return m_index == other.m_index;
        }

        PONCA_MULTIARCH inline KdTreeNearestIterator& operator++()
        {
            ++m_index;
            return *this;
        }

        PONCA_MULTIARCH inline KdTreeNearestIterator operator++(int)
        {
            KdTreeNearestIterator tmp = *this;
            ++m_index;
            return tmp;
        }

        PONCA_MULTIARCH inline void operator+=(int i) { m_index += i; }

        PONCA_MULTIARCH inline reference operator*() const { return const_cast<reference>(m_index); }
 
    protected:
        Index m_index{-1};
    };
 
} // namespace Ponca