2012-10-08 14:25:58 +02:00
|
|
|
#ifndef utf8_iterator_hh_INCLUDED
|
|
|
|
#define utf8_iterator_hh_INCLUDED
|
|
|
|
|
|
|
|
#include "utf8.hh"
|
|
|
|
|
|
|
|
namespace Kakoune
|
|
|
|
{
|
|
|
|
|
|
|
|
namespace utf8
|
|
|
|
{
|
|
|
|
|
|
|
|
// adapter for an iterator on bytes which permits to iterate
|
|
|
|
// on unicode codepoints instead.
|
2012-10-13 18:31:29 +02:00
|
|
|
template<typename Iterator,
|
2012-10-17 17:01:51 +02:00
|
|
|
typename InvalidPolicy = InvalidBytePolicy::Assert>
|
2012-10-08 14:25:58 +02:00
|
|
|
class utf8_iterator
|
|
|
|
{
|
|
|
|
public:
|
|
|
|
utf8_iterator() = default;
|
|
|
|
utf8_iterator(Iterator it) : m_it(std::move(it)) {}
|
|
|
|
|
|
|
|
utf8_iterator& operator++()
|
|
|
|
{
|
|
|
|
m_it = utf8::next(m_it);
|
|
|
|
invalidate_value();
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
|
|
|
utf8_iterator operator++(int)
|
|
|
|
{
|
|
|
|
utf8_iterator save = *this;
|
|
|
|
++*this;
|
|
|
|
return save;
|
|
|
|
}
|
|
|
|
|
2013-03-06 19:03:43 +01:00
|
|
|
void advance(CharCount count, const utf8_iterator& end)
|
|
|
|
{
|
|
|
|
while (*this != end and count-- > 0)
|
|
|
|
++*this;
|
|
|
|
}
|
|
|
|
|
2012-10-08 14:25:58 +02:00
|
|
|
utf8_iterator& operator--()
|
|
|
|
{
|
|
|
|
m_it = utf8::previous(m_it);
|
|
|
|
invalidate_value();
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
|
|
|
utf8_iterator operator--(int)
|
|
|
|
{
|
|
|
|
utf8_iterator save = *this;
|
|
|
|
--*this;
|
|
|
|
return save;
|
|
|
|
}
|
|
|
|
|
2012-10-27 13:26:40 +02:00
|
|
|
utf8_iterator operator+(CharCount count) const
|
2012-10-08 14:25:58 +02:00
|
|
|
{
|
|
|
|
if (count < 0)
|
|
|
|
return operator-(-count);
|
|
|
|
|
|
|
|
utf8_iterator res = *this;
|
|
|
|
while (count--)
|
|
|
|
++res;
|
|
|
|
return res;
|
|
|
|
}
|
|
|
|
|
2012-10-27 13:26:40 +02:00
|
|
|
utf8_iterator operator-(CharCount count) const
|
2012-10-08 14:25:58 +02:00
|
|
|
{
|
|
|
|
if (count < 0)
|
|
|
|
return operator+(-count);
|
|
|
|
|
|
|
|
utf8_iterator res = *this;
|
|
|
|
while (count--)
|
|
|
|
--res;
|
|
|
|
return res;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool operator==(const utf8_iterator& other) { return m_it == other.m_it; }
|
|
|
|
bool operator!=(const utf8_iterator& other) { return m_it != other.m_it; }
|
|
|
|
|
|
|
|
bool operator< (const utf8_iterator& other) const
|
|
|
|
{
|
|
|
|
return m_it < other.m_it;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool operator<= (const utf8_iterator& other) const
|
|
|
|
{
|
|
|
|
return m_it <= other.m_it;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool operator> (const utf8_iterator& other) const
|
|
|
|
{
|
|
|
|
return m_it > other.m_it;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool operator>= (const utf8_iterator& other) const
|
|
|
|
{
|
|
|
|
return m_it >= other.m_it;
|
|
|
|
}
|
|
|
|
|
2012-10-27 13:26:40 +02:00
|
|
|
CharCount operator-(utf8_iterator other) const
|
2012-10-08 14:25:58 +02:00
|
|
|
{
|
|
|
|
//assert(other < *this);
|
|
|
|
check_invariant();
|
|
|
|
other.check_invariant();
|
2012-10-27 13:26:40 +02:00
|
|
|
CharCount dist = 0;
|
2012-10-08 14:25:58 +02:00
|
|
|
while (other.m_it != m_it)
|
|
|
|
{
|
|
|
|
++dist;
|
|
|
|
++other;
|
|
|
|
}
|
|
|
|
return dist;
|
|
|
|
}
|
|
|
|
|
|
|
|
Codepoint operator*() const
|
|
|
|
{
|
|
|
|
return get_value();
|
|
|
|
}
|
|
|
|
|
|
|
|
const Iterator& underlying_iterator() const { return m_it; }
|
|
|
|
Iterator& underlying_iterator() { return m_it; }
|
|
|
|
|
|
|
|
protected:
|
|
|
|
void check_invariant() const
|
|
|
|
{
|
|
|
|
// always point to a character first byte;
|
|
|
|
// assert(is_character_start(it));
|
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
|
|
|
void invalidate_value() { m_value = -1; }
|
|
|
|
Codepoint get_value() const
|
|
|
|
{
|
|
|
|
if (m_value == -1)
|
2012-10-13 18:31:29 +02:00
|
|
|
m_value = utf8::codepoint<InvalidPolicy>(m_it);
|
2012-10-08 14:25:58 +02:00
|
|
|
return m_value;
|
|
|
|
}
|
|
|
|
|
|
|
|
Iterator m_it;
|
|
|
|
mutable Codepoint m_value = -1;
|
|
|
|
};
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
#endif // utf8_iterator_hh_INCLUDED
|