piercedKernelIterator.tpp

/*---------------------------------------------------------------------------*\
 *
 *  bitpit
 *
 *  Copyright (C) 2015-2021 OPTIMAD engineering Srl
 *
 *  -------------------------------------------------------------------------
 *  License
 *  This file is part of bitpit.
 *
 *  bitpit is free software: you can redistribute it and/or modify it
 *  under the terms of the GNU Lesser General Public License v3 (LGPL)
 *  as published by the Free Software Foundation.
 *
 *  bitpit is distributed in the hope that it will be useful, but WITHOUT
 *  ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
 *  FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public
 *  License for more details.
 *
 *  You should have received a copy of the GNU Lesser General Public License
 *  along with bitpit. If not, see <http://www.gnu.org/licenses/>.
 *
\*---------------------------------------------------------------------------*/
 
#ifndef __BITPIT_PIERCED_KERNEL_ITERATOR_TPP__
#define __BITPIT_PIERCED_KERNEL_ITERATOR_TPP__
 
namespace bitpit {
 
template<typename id_t>
PiercedKernelIterator<id_t>::PiercedKernelIterator()
    : m_kernel(nullptr), m_pos(0)
{
}
 
template<typename id_t>
PiercedKernelIterator<id_t>::PiercedKernelIterator(const kernel_t *kernel, std::size_t pos)
    : m_kernel(kernel), m_pos(pos)
{
}
 
template<typename id_t>
void PiercedKernelIterator<id_t>::swap(PiercedKernelIterator& other) noexcept
{
    std::swap(m_kernel, other.m_kernel);
    std::swap(m_pos, other.m_pos);
}
 
template<typename id_t>
const typename PiercedKernelIterator<id_t>::kernel_type & PiercedKernelIterator<id_t>::getKernel() const
{
    return *m_kernel;
}
 
template<typename id_t>
id_t PiercedKernelIterator<id_t>::getId(const id_t &fallback) const noexcept
{
    id_t id;
    if (m_pos >= m_kernel->m_end_pos) {
        id = fallback;
        return id;
    }
 
    id = m_kernel->m_ids[m_pos];
    if (id >= 0) {
        return id;
    } else {
        id = fallback;
        return id;
    }
}
 
template<typename id_t>
std::size_t PiercedKernelIterator<id_t>::getRawIndex() const noexcept
{
    return getPos();
}
 
template<typename id_t>
std::size_t PiercedKernelIterator<id_t>::getPos() const noexcept
{
    return m_pos;
}
 
template<typename id_t>
PiercedKernelIterator<id_t> & PiercedKernelIterator<id_t>::operator++()
{
    if (m_pos >= m_kernel->m_end_pos) {
        return *this;
    }
 
    auto basePosItr    = m_kernel->m_ids.begin();
    auto endPosItr     = basePosItr + m_kernel->m_end_pos;
    auto currentPosItr = basePosItr + m_pos + 1;
 
    while (currentPosItr < endPosItr) {
        id_t id = *currentPosItr;
        if (id >= 0) {
            break;
        }
 
        currentPosItr -= id;
    }
 
    m_pos = currentPosItr - basePosItr;
 
    return *this;
}
 
template<typename id_t>
PiercedKernelIterator<id_t> PiercedKernelIterator<id_t>::operator++(int)
{
    PiercedKernelIterator tmp(m_kernel, m_pos);
 
    ++(*this);
 
    return tmp;
}
 
template<typename id_t>
PiercedKernelIterator<id_t> & PiercedKernelIterator<id_t>::operator--()
{
    if (m_pos <= m_kernel->m_begin_pos) {
        return *this;
    }
 
    auto basePosItr    = m_kernel->m_ids.begin();
    auto beginPosItr   = basePosItr + m_kernel->m_begin_pos;
    auto currentPosItr = basePosItr + m_pos - 1;
 
    while (currentPosItr > beginPosItr) {
        id_t id = *currentPosItr;
        if (id >= 0) {
            break;
        }
 
        --currentPosItr;
    }
 
    m_pos = currentPosItr - basePosItr;
 
    return *this;
}
 
template<typename id_t>
PiercedKernelIterator<id_t> PiercedKernelIterator<id_t>::operator--(int)
{
    PiercedKernelIterator tmp(m_kernel, m_pos);
 
    --(*this);
 
    return tmp;
}
 
template<typename id_t>
const id_t & PiercedKernelIterator<id_t>::operator*() const
{
    return m_kernel->m_ids[m_pos];
}
 
template<typename id_t>
const id_t * PiercedKernelIterator<id_t>::operator->() const
{
    return m_kernel->m_ids[m_pos];
}
 
}
 
#endif