piercedStorageIterator.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_STORAGE_ITERATOR_TPP__
#define __BITPIT_PIERCED_STORAGE_ITERATOR_TPP__
 
namespace bitpit {

template<typename value_t, typename id_t, typename value_no_cv_t>
PiercedStorageIterator<value_t, id_t, value_no_cv_t>::PiercedStorageIterator()
    : PiercedKernelIterator<id_t>(), m_storage(nullptr)
{
}

template<typename value_t, typename id_t, typename value_no_cv_t>
template<typename other_value_t, typename std::enable_if<std::is_const<value_t>::value && !std::is_const<other_value_t>::value && std::is_same<other_value_t, typename std::remove_cv<value_t>::type>::value, int>::type>
PiercedStorageIterator<value_t, id_t, value_no_cv_t>::PiercedStorageIterator(const PiercedStorageIterator<other_value_t, id_t, value_no_cv_t> &other)
    : PiercedStorageIterator(other.m_storage, other.getRawIndex())
{
}

template<typename value_t, typename id_t, typename value_no_cv_t>
PiercedStorageIterator<value_t, id_t, value_no_cv_t>::PiercedStorageIterator(storage_t *storage, std::size_t pos)
    : PiercedKernelIterator<id_t>(storage->getKernel(), pos), m_storage(storage)
{
}

template<typename value_t, typename id_t, typename value_no_cv_t>
PiercedStorageIterator<value_t, id_t, value_no_cv_t>::PiercedStorageIterator(storage_t *storage, const bitpit::PiercedKernelIterator<id_t> &iterator)
    : PiercedKernelIterator<id_t>(iterator), m_storage(storage)
{
    assert(&(iterator.getKernel()) == &(storage->getKernel()));
}

template<typename value_t, typename id_t, typename value_no_cv_t>
void PiercedStorageIterator<value_t, id_t, value_no_cv_t>::swap(PiercedStorageIterator& other) noexcept
{
    PiercedKernelIterator<id_t>::swap();
 
    std::swap(m_storage, other.m_storage);
}

template<typename value_t, typename id_t, typename value_no_cv_t>
typename PiercedStorageIterator<value_t, id_t, value_no_cv_t>::storage_type & PiercedStorageIterator<value_t, id_t, value_no_cv_t>::getStorage() const
{
    return *m_storage;
}

template<typename value_t, typename id_t, typename value_no_cv_t>
const PiercedKernelIterator<id_t> & PiercedStorageIterator<value_t, id_t, value_no_cv_t>::getKernelIterator() const
{
    return static_cast<const PiercedKernelIterator<id_t> &>(*this);
}

template<typename value_t, typename id_t, typename value_no_cv_t>
__PSI_REFERENCE__ PiercedStorageIterator<value_t, id_t, value_no_cv_t>::getValue(std::size_t k) const
{
    if (*this == m_storage->getKernel().end()) {
        throw std::out_of_range("Iterator points to an invalid position.");
    }
 
    std::size_t rawIndex = getRawIndex();
 
    return m_storage->rawAt(rawIndex, k);
}

* Increment operator does not check whether it crosses the end() of the
* container. Thus, calling this function if the iterator is already at
* the end of the container results in undefined behavior.
*/
template<typename value_t, typename id_t, typename value_no_cv_t>
PiercedStorageIterator<value_t, id_t, value_no_cv_t> & PiercedStorageIterator<value_t, id_t, value_no_cv_t>::operator++()
{
    PiercedKernelIterator<id_t>::operator++();
 
    return *this;
}

* container. Thus, calling this function if the iterator is already at
* the end of the container results in undefined behavior.
*/
template<typename value_t, typename id_t, typename value_no_cv_t>
PiercedStorageIterator<value_t, id_t, value_no_cv_t> PiercedStorageIterator<value_t, id_t, value_no_cv_t>::operator++(int)
{
    std::size_t rawIndex = getRawIndex();
    PiercedStorageIterator tmp(m_storage, rawIndex);
 
    ++(*this);
 
    return tmp;
}

template<typename value_t, typename id_t, typename value_no_cv_t>
PiercedStorageIterator<value_t, id_t, value_no_cv_t> & PiercedStorageIterator<value_t, id_t, value_no_cv_t>::operator--()
{
    PiercedKernelIterator<id_t>::operator--();
 
    return *this;
}

template<typename value_t, typename id_t, typename value_no_cv_t>
PiercedStorageIterator<value_t, id_t, value_no_cv_t> PiercedStorageIterator<value_t, id_t, value_no_cv_t>::operator--(int)
{
    std::size_t rawIndex = getRawIndex();
    PiercedStorageIterator tmp(m_storage, rawIndex);
 
    --(*this);
 
    return tmp;
}

template<typename value_t, typename id_t, typename value_no_cv_t>
__PSI_REFERENCE__ PiercedStorageIterator<value_t, id_t, value_no_cv_t>::operator*() const
{
    std::size_t rawIndex = getRawIndex();
 
    return m_storage->rawAt(rawIndex, 0);
}

template<typename value_t, typename id_t, typename value_no_cv_t>
__PSI_POINTER__ PiercedStorageIterator<value_t, id_t, value_no_cv_t>::operator->() const
{
    std::size_t rawIndex = getRawIndex();
 
    return m_storage->rawData(rawIndex);
}

template<typename value_t, typename id_t, typename value_no_cv_t>
template<typename other_value_t, typename std::enable_if<std::is_const<value_t>::value && !std::is_const<other_value_t>::value && std::is_same<other_value_t, typename std::remove_cv<value_t>::type>::value, int>::type>
PiercedStorageIterator<value_t, id_t, value_no_cv_t> & PiercedStorageIterator<value_t, id_t, value_no_cv_t>::operator=(const PiercedStorageIterator<other_value_t, id_t, value_no_cv_t> &other)
{
    PiercedKernelIterator<id_t>::operator=(other);
    m_storage = other.m_storage;
 
    return *this;
}
 
}
 
#endif