#pragma once
/*
* Copyright (C) 2024 Brett Terpstra
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program 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 General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see .
*/
#ifndef BLT_ITERATOR_H
#define BLT_ITERATOR_H
#include
#include
#include
#include
#include
#include
namespace blt
{
// forward declare useful types
template>
class enumerator;
template>
class enumerator_rev;
namespace iterator
{
template>
class enumerate_wrapper;
/**
* struct which is returned by the enumerator.
* @tparam T type to store.
*/
template
struct enumerate_item
{
blt::size_t index;
T value;
};
/**
* base class for iterators which operate on pairs of values. Handles comparison.
* @tparam Iter1 first iterator type. this will be used for comparison.
* @tparam Iter2 second iterator type. this value is not modified by this class.
*/
template
class pair_iterator_base
{
public:
explicit pair_iterator_base(Iter1 iter1, Iter2 iter2): m_iter1(std::move(iter1)), m_iter2(std::move(iter2))
{}
friend bool operator==(const pair_iterator_base& a, const pair_iterator_base& b)
{
return a.m_iter1 == b.m_iter1;
}
friend bool operator!=(const pair_iterator_base& a, const pair_iterator_base& b)
{
return a.m_iter1 != b.m_iter1;
}
auto iter1() const
{
return m_iter1;
}
auto iter2() const
{
return m_iter2;
}
protected:
Iter1 m_iter1;
Iter2 m_iter2;
};
/**
* Base class for all enumerator iterators. Handles the deference (*) operator.
* @tparam Iter iterator type
*/
template
class enumerate_iterator_base : public pair_iterator_base
{
public:
explicit enumerate_iterator_base(Iter iter, blt::size_t place = 0):
pair_iterator_base(std::move(iter), place)
{}
enumerate_item> operator*() const
{
return {this->m_iter2, *this->m_iter1};
}
auto base() const
{
return this->iter1();
}
auto get_index() const
{
return this->iter2();
}
};
/**
* Forward iterator base class for the enumerator. Contains the ++ operator.
* @tparam Iter iterator type.
*/
template
class enumerate_forward_iterator : public enumerate_iterator_base
{
public:
using enumerate_iterator_base::enumerate_iterator_base;
enumerate_forward_iterator& operator++()
{
++this->m_iter1;
++this->m_iter2;
return *this;
}
enumerate_forward_iterator operator++(int)
{
auto tmp = *this;
++*this;
return tmp;
}
};
/**
* Bidirectional iterator base class for the enumerator. Contains the -- operator.
* @tparam Iter iterator type.
*/
template
class enumerate_bidirectional_iterator : public enumerate_forward_iterator
{
public:
using enumerate_forward_iterator::enumerate_forward_iterator;
enumerate_bidirectional_iterator& operator--()
{
--this->m_iter1;
--this->m_iter2;
return *this;
}
enumerate_bidirectional_iterator operator--(int)
{
auto tmp = *this;
--*this;
return tmp;
}
};
/**
* Wrapper class specialization for forward iterators.
* @tparam Iter iterator type
*/
template
class enumerate_wrapper, std::void_t>>
: public enumerate_forward_iterator
{
public:
using iterator_category = std::forward_iterator_tag;
using value_type = enumerate_item>;
using difference_type = typename std::iterator_traits::difference_type;
using pointer = value_type;
using reference = value_type;
using iterator_type = Iter;
using enumerate_forward_iterator::enumerate_forward_iterator;
};
/**
* Wrapper class for bidirectional iterators or random access iterators.
* @tparam Iter iterator type.
*/
template
class enumerate_wrapper, std::void_t>>
: public enumerate_bidirectional_iterator
{
public:
using iterator_category = typename std::iterator_traits::iterator_category;
using value_type = enumerate_item>;
using difference_type = typename std::iterator_traits::difference_type;
using pointer = value_type;
using reference = value_type;
using iterator_type = Iter;
using enumerate_bidirectional_iterator::enumerate_bidirectional_iterator;
};
/**
* Base class for the enumerator. Holds the begin and end iterators.
* @tparam Iter iterator type.
* @tparam IterWrapper wrapper used to iterate (enumerate_wrapper)
*/
template
class enumerator_base
{
public:
explicit enumerator_base(Iter begin, Iter end): begin_(std::move(begin)), end_(std::move(end))
{}
explicit enumerator_base(IterWrapper begin, IterWrapper end): begin_(std::move(begin)), end_(std::move(end))
{}
auto begin()
{
return begin_;
}
auto end()
{
return end_;
}
/**
* Creates an enumerator that skips the first n elements.
* @param amount amount of values to skip.
*/
auto skip(blt::size_t amount)
{
auto begin = this->begin_;
for (blt::size_t i = 0; i < amount; i++)
++begin;
return enumerator{begin.base(),
this->end_.base(),
begin.get_index(),
this->end_.get_index()};
}
/**
* Creates an enumerator that yields the first n elements, or UB if the underlying iterator ends sooner.
* @param amount amount to take.
*/
auto take(blt::size_t amount)
{
auto end = this->begin();
for (blt::size_t i = 0; i < amount; i++)
++end;
return enumerator{this->begin_.base(),
end.base(),
this->begin_.get_index(),
end.get_index()};
}
protected:
IterWrapper begin_;
IterWrapper end_;
};
/**
* Reversible (bidirectional) base class for the enumerator.
* @tparam Iter iterator type.
* @tparam IterWrapper wrapper used to iterate (enumerate_wrapper).
*/
template
class enumerator_reversible : public enumerator_base
{
public:
explicit enumerator_reversible(Iter begin, Iter end, blt::size_t container_size):
enumerator_base{IterWrapper{enumerate_wrapper{std::move(begin), 0}},
IterWrapper{enumerate_wrapper{std::move(end), container_size}}}
{}
explicit enumerator_reversible(Iter begin, Iter end, blt::size_t begin_index, blt::size_t end_index):
enumerator_base(IterWrapper{enumerate_wrapper{std::move(begin), begin_index}},
IterWrapper{enumerate_wrapper{std::move(end), end_index}})
{}
/**
* Reverses the enumerator’s direction.
*/
auto rev() const
{
return enumerator_rev{this->end_.base(),
this->begin_.base(),
this->end_.get_index(),
this->begin_.get_index()};
}
};
/**
* Random access base class for the enumerator. Has updated skip and take methods which make use of the random access nature of the iterator.
* @tparam Iter iterator type.
* @tparam IterWrapper wrapper used to iterate (enumerate_wrapper).
*/
template
class enumerator_random_access : public enumerator_reversible
{
public:
using enumerator_reversible::enumerator_reversible;
auto skip(blt::size_t amount)
{
return enumerator{this->begin_.base() + amount,
this->end_.base(),
this->begin_.get_index() + amount,
this->end_.get_index()};
}
auto take(blt::size_t amount)
{
return enumerator{this->begin_.base(),
this->begin_.base() + amount,
this->begin_.get_index(),
this->begin_.get_index() + amount};
}
};
/**
* Reversible (bidirectional) base class for the enumerator, operates in reverse for reverse enumeration.
* @tparam Iter iterator type.
* @tparam IterWrapper wrapper used to iterate (std::reverse_iterator).
*/
template
class enumerator_reversible_rev : public enumerator_reversible
{
public:
using enumerator_reversible::enumerator_reversible;
auto rev() const
{
return enumerator{this->end_.base().base(),
this->begin_.base().base(),
this->end_.base().get_index(),
this->begin_.base().get_index()};
}
auto skip(blt::size_t amount)
{
auto begin = this->begin_.base();
for (blt::size_t i = 0; i < amount; i++)
--begin;
return enumerator_rev{begin.base(),
this->end_.base().base(),
begin.get_index(),
this->end_.base().get_index()};
}
auto take(blt::size_t amount)
{
auto end = this->begin_.base();
for (blt::size_t i = 0; i < amount; i++)
--end;
return enumerator_rev{
this->begin_.base().base(),
end.base(),
this->begin_.base().get_index(),
end.get_index()};
}
};
/**
* Random access base class for the enumerator. Has updated skip and take methods which make use of the random access nature of the iterator.
* Operates in reverse for reverse enumeration.
* @tparam Iter iterator type.
* @tparam IterWrapper wrapper used to iterate (std::reverse_iterator).
*/
template
class enumerator_random_access_rev : public enumerator_reversible_rev
{
public:
using enumerator_reversible_rev::enumerator_reversible_rev;
auto skip(blt::size_t amount)
{
return enumerator_rev{this->begin_.base().base() - amount,
this->end_.base().base(),
this->begin_.base().get_index() - amount,
this->end_.base().get_index()};
}
auto take(blt::size_t amount)
{
return enumerator_rev{this->begin_.base().base(),
this->begin_.base().base() - amount,
this->begin_.base().get_index(),
this->begin_.base().get_index() - amount};
}
};
}
/**
* Enumerator specialization for forward iterators
*/
template
class enumerator, std::void_t>>
: public iterator::enumerator_base>
{
public:
using iterator::enumerator_base>::enumerator_base;
};
/**
* Enumerator specialization for bidirectional iterators
*/
template
class enumerator, std::void_t>>
: public iterator::enumerator_reversible>
{
public:
using iterator::enumerator_reversible>::enumerator_reversible;
};
/**
* Enumerator specialization for random access iterators
*/
template
class enumerator, std::void_t>>
: public iterator::enumerator_random_access>
{
public:
using iterator::enumerator_random_access>::enumerator_random_access;
};
/**
* Reverse enumerator specialization for bidirectional iterators
*/
template
class enumerator_rev, std::void_t>>
: public iterator::enumerator_reversible_rev>>
{
public:
using iterator::enumerator_reversible_rev>>::enumerator_reversible_rev;
};
/**
* Reverse enumerator specialization for random access iterators
*/
template
class enumerator_rev, std::void_t>>
: public iterator::enumerator_random_access_rev>>
{
public:
using iterator::enumerator_random_access_rev>>::enumerator_random_access_rev;
};
// CTAD for enumerators
template
enumerator(Iter, Iter) -> enumerator;
template
enumerator(Iter, Iter, blt::size_t) -> enumerator;
template
enumerator(Iter, Iter, blt::size_t, blt::size_t) -> enumerator;
template
static inline auto enumerate(const T(& container)[size])
{
return enumerator{&container[0], &container[size], size};
}
template
static inline auto enumerate(T(& container)[size])
{
return enumerator{&container[0], &container[size], size};
}
template
static inline auto enumerate(T& container)
{
return enumerator{container.begin(), container.end(), container.size()};
}
template
static inline auto enumerate(T&& container)
{
return enumerator{container.begin(), container.end(), container.size()};
}
template
static inline auto enumerate(const T& container)
{
return enumerator{container.begin(), container.end(), container.size()};
}
}
#endif //BLT_ITERATOR_H