318 lines
7.1 KiB
C++
318 lines
7.1 KiB
C++
#pragma once
|
|
|
|
#include <BAN/Assert.h>
|
|
#include <BAN/Traits.h>
|
|
|
|
namespace BAN
|
|
{
|
|
|
|
template<typename It>
|
|
It next(It it, size_t count)
|
|
{
|
|
for (size_t i = 0; i < count; i++)
|
|
++it;
|
|
return it;
|
|
}
|
|
|
|
template<typename It>
|
|
requires requires(It it, size_t n) { requires is_same_v<decltype(it + n), It>; }
|
|
It next(It it, size_t count)
|
|
{
|
|
return it + count;
|
|
}
|
|
|
|
template<typename It>
|
|
It prev(It it, size_t count)
|
|
{
|
|
for (size_t i = 0; i < count; i++)
|
|
--it;
|
|
return it;
|
|
}
|
|
|
|
template<typename It>
|
|
requires requires(It it, size_t n) { requires is_same_v<decltype(it - n), It>; }
|
|
It prev(It it, size_t count)
|
|
{
|
|
return it - count;
|
|
}
|
|
|
|
template<typename It>
|
|
size_t distance(It it1, It it2)
|
|
{
|
|
size_t dist = 0;
|
|
while (it1 != it2)
|
|
{
|
|
++it1;
|
|
++dist;
|
|
}
|
|
return dist;
|
|
}
|
|
|
|
template<typename It>
|
|
requires requires(It it1, It it2) { requires is_integral_v<decltype(it2 - it1)>; }
|
|
size_t distance(It it1, It it2)
|
|
{
|
|
return it2 - it1;
|
|
}
|
|
|
|
template<typename T, typename Container, bool CONST>
|
|
class IteratorSimpleGeneral
|
|
{
|
|
public:
|
|
using value_type = T;
|
|
|
|
public:
|
|
IteratorSimpleGeneral() = default;
|
|
template<bool CONST2, typename = enable_if_t<CONST2 == CONST || CONST>>
|
|
IteratorSimpleGeneral(const IteratorSimpleGeneral<T, Container, CONST2>& other)
|
|
: m_pointer(other.m_pointer)
|
|
, m_valid(other.m_valid)
|
|
{
|
|
}
|
|
|
|
const T& operator*() const
|
|
{
|
|
ASSERT(m_pointer);
|
|
return *m_pointer;
|
|
}
|
|
template<bool CONST2 = CONST>
|
|
enable_if_t<!CONST2, T&> operator*()
|
|
{
|
|
ASSERT(*this);
|
|
ASSERT(m_pointer);
|
|
return *m_pointer;
|
|
}
|
|
|
|
const T* operator->() const
|
|
{
|
|
ASSERT(*this);
|
|
ASSERT(m_pointer);
|
|
return m_pointer;
|
|
}
|
|
template<bool CONST2 = CONST>
|
|
enable_if_t<!CONST2, T*> operator->()
|
|
{
|
|
ASSERT(*this);
|
|
ASSERT(m_pointer);
|
|
return m_pointer;
|
|
}
|
|
|
|
IteratorSimpleGeneral& operator++()
|
|
{
|
|
ASSERT(*this);
|
|
ASSERT(m_pointer);
|
|
++m_pointer;
|
|
return *this;
|
|
}
|
|
IteratorSimpleGeneral operator++(int)
|
|
{
|
|
auto temp = *this;
|
|
++(*this);
|
|
return temp;
|
|
}
|
|
|
|
IteratorSimpleGeneral& operator--()
|
|
{
|
|
ASSERT(*this);
|
|
ASSERT(m_pointer);
|
|
--m_pointer;
|
|
return *this;
|
|
}
|
|
IteratorSimpleGeneral operator--(int)
|
|
{
|
|
auto temp = *this;
|
|
--(*this);
|
|
return temp;
|
|
}
|
|
|
|
size_t operator-(const IteratorSimpleGeneral& other) const
|
|
{
|
|
ASSERT(*this && other);
|
|
return m_pointer - other.m_pointer;
|
|
}
|
|
|
|
IteratorSimpleGeneral operator+(size_t offset) const
|
|
{
|
|
return IteratorSimpleGeneral(m_pointer + offset);
|
|
}
|
|
|
|
IteratorSimpleGeneral operator-(size_t offset) const
|
|
{
|
|
return IteratorSimpleGeneral(m_pointer - offset);
|
|
}
|
|
|
|
bool operator<(const IteratorSimpleGeneral& other) const
|
|
{
|
|
ASSERT(*this);
|
|
return m_pointer < other.m_pointer;
|
|
}
|
|
|
|
bool operator==(const IteratorSimpleGeneral& other) const
|
|
{
|
|
ASSERT(*this);
|
|
return m_pointer == other.m_pointer;
|
|
}
|
|
bool operator!=(const IteratorSimpleGeneral& other) const
|
|
{
|
|
ASSERT(*this);
|
|
return !(*this == other);
|
|
}
|
|
|
|
explicit operator bool() const
|
|
{
|
|
return m_valid;
|
|
}
|
|
|
|
private:
|
|
IteratorSimpleGeneral(maybe_const_t<CONST, T>* pointer)
|
|
: m_pointer(pointer)
|
|
, m_valid(true)
|
|
{
|
|
}
|
|
|
|
private:
|
|
maybe_const_t<CONST, T>* m_pointer = nullptr;
|
|
bool m_valid = false;
|
|
|
|
friend IteratorSimpleGeneral<T, Container, !CONST>;
|
|
friend Container;
|
|
};
|
|
|
|
template<typename T, template<typename> typename OuterContainer, template<typename> typename InnerContainer, typename Container, bool CONST>
|
|
class IteratorDoubleGeneral
|
|
{
|
|
public:
|
|
using Inner = InnerContainer<T>;
|
|
using Outer = OuterContainer<Inner>;
|
|
|
|
using InnerIterator = either_or_t<CONST, typename Inner::const_iterator, typename Inner::iterator>;
|
|
using OuterIterator = either_or_t<CONST, typename Outer::const_iterator, typename Outer::iterator>;
|
|
|
|
using value_type = T;
|
|
|
|
public:
|
|
IteratorDoubleGeneral() = default;
|
|
template<bool CONST2, typename = enable_if_t<CONST2 == CONST || CONST>>
|
|
IteratorDoubleGeneral(const IteratorDoubleGeneral<T, OuterContainer, InnerContainer, Container, CONST2>& other)
|
|
: m_outer_end(other.m_outer_end)
|
|
, m_outer_current(other.m_outer_current)
|
|
, m_inner_current(other.m_inner_current)
|
|
{
|
|
}
|
|
|
|
const T& operator*() const
|
|
{
|
|
ASSERT(*this);
|
|
ASSERT(m_outer_current != m_outer_end);
|
|
ASSERT(m_inner_current);
|
|
return m_inner_current.operator*();
|
|
}
|
|
template<bool CONST2 = CONST>
|
|
enable_if_t<!CONST2, T&> operator*()
|
|
{
|
|
ASSERT(*this);
|
|
ASSERT(m_outer_current != m_outer_end);
|
|
ASSERT(m_inner_current);
|
|
return m_inner_current.operator*();
|
|
}
|
|
|
|
const T* operator->() const
|
|
{
|
|
ASSERT(*this);
|
|
ASSERT(m_outer_current != m_outer_end);
|
|
ASSERT(m_inner_current);
|
|
return m_inner_current.operator->();
|
|
}
|
|
template<bool CONST2 = CONST>
|
|
enable_if_t<!CONST2, T*> operator->()
|
|
{
|
|
ASSERT(*this);
|
|
ASSERT(m_outer_current != m_outer_end);
|
|
ASSERT(m_inner_current);
|
|
return m_inner_current.operator->();
|
|
}
|
|
|
|
IteratorDoubleGeneral& operator++()
|
|
{
|
|
ASSERT(*this);
|
|
ASSERT(m_outer_current != m_outer_end);
|
|
ASSERT(m_inner_current);
|
|
m_inner_current++;
|
|
find_valid_or_end();
|
|
return *this;
|
|
}
|
|
IteratorDoubleGeneral operator++(int)
|
|
{
|
|
auto temp = *this;
|
|
++(*this);
|
|
return temp;
|
|
}
|
|
|
|
bool operator==(const IteratorDoubleGeneral& other) const
|
|
{
|
|
ASSERT(*this && other);
|
|
if (m_outer_end != other.m_outer_end)
|
|
return false;
|
|
if (m_outer_current != other.m_outer_current)
|
|
return false;
|
|
if (m_outer_current == m_outer_end)
|
|
return true;
|
|
ASSERT(m_inner_current && other.m_inner_current);
|
|
return m_inner_current == other.m_inner_current;
|
|
}
|
|
bool operator!=(const IteratorDoubleGeneral& other) const
|
|
{
|
|
return !(*this == other);
|
|
}
|
|
|
|
explicit operator bool() const
|
|
{
|
|
return !!m_outer_current;
|
|
}
|
|
|
|
private:
|
|
IteratorDoubleGeneral(const OuterIterator& outer_end, const OuterIterator& outer_current)
|
|
: m_outer_end(outer_end)
|
|
, m_outer_current(outer_current)
|
|
{
|
|
if (outer_current != outer_end)
|
|
{
|
|
m_inner_current = m_outer_current->begin();
|
|
find_valid_or_end();
|
|
}
|
|
}
|
|
|
|
void find_valid_or_end()
|
|
{
|
|
while (m_inner_current == m_outer_current->end())
|
|
{
|
|
m_outer_current++;
|
|
if (m_outer_current == m_outer_end)
|
|
break;
|
|
m_inner_current = m_outer_current->begin();
|
|
}
|
|
}
|
|
|
|
private:
|
|
OuterIterator m_outer_end;
|
|
OuterIterator m_outer_current;
|
|
InnerIterator m_inner_current;
|
|
|
|
friend class IteratorDoubleGeneral<T, OuterContainer, InnerContainer, Container, !CONST>;
|
|
friend Container;
|
|
};
|
|
|
|
template<typename T, typename Container>
|
|
using IteratorSimple = IteratorSimpleGeneral<T, Container, false>;
|
|
|
|
template<typename T, typename Container>
|
|
using ConstIteratorSimple = IteratorSimpleGeneral<T, Container, true>;
|
|
|
|
template<typename T, template<typename> typename OuterContainer, template<typename> typename InnerContainer, typename Container>
|
|
using IteratorDouble = IteratorDoubleGeneral<T, OuterContainer, InnerContainer, Container, false>;
|
|
|
|
template<typename T, template<typename> typename OuterContainer, template<typename> typename InnerContainer, typename Container>
|
|
using ConstIteratorDouble = IteratorDoubleGeneral<T, OuterContainer, InnerContainer, Container, true>;
|
|
|
|
}
|