kakoune/src/utf8.hh

174 lines
3.6 KiB
C++
Raw Normal View History

2012-10-08 14:25:05 +02:00
#ifndef utf8_hh_INCLUDED
#define utf8_hh_INCLUDED
#include <cstddef>
#include "unicode.hh"
2012-10-27 13:26:40 +02:00
#include "units.hh"
#include "assert.hh"
2012-10-08 14:25:05 +02:00
namespace Kakoune
{
namespace utf8
{
// returns an iterator to next character first byte
template<typename Iterator>
Iterator next(Iterator it)
{
if (*it++ & 0x80)
while ((*(it) & 0xC0) == 0x80)
++it;
return it;
}
// returns it's parameter if it points to a character first byte,
// or else returns next character first byte
template<typename Iterator>
Iterator finish(Iterator it)
{
while ((*(it) & 0xC0) == 0x80)
++it;
return it;
}
// returns an iterator to the previous character first byte
template<typename Iterator>
Iterator previous(Iterator it)
{
while ((*(--it) & 0xC0) == 0x80)
;
return it;
}
// returns an iterator pointing to the first byte of the
// dth character after (or before if d < 0) the character
// pointed by it
2012-10-27 13:26:40 +02:00
template<typename Iterator>
Iterator advance(Iterator it, Iterator end, CharCount d)
2012-10-08 14:25:05 +02:00
{
if (d < 0)
{
while (it != end and d++)
it = utf8::previous(it);
2012-10-08 14:25:05 +02:00
}
else
{
while (it != end and d--)
it = utf8::next(it);
2012-10-08 14:25:05 +02:00
}
return it;
}
// returns the character count between begin and end
template<typename Iterator>
2012-10-27 13:26:40 +02:00
CharCount distance(Iterator begin, Iterator end)
2012-10-08 14:25:05 +02:00
{
2012-10-27 13:26:40 +02:00
CharCount dist = 0;
2012-10-08 14:25:05 +02:00
while (begin != end)
{
if ((*begin++ & 0xC0) != 0x80)
++dist;
}
return dist;
2012-10-08 14:25:05 +02:00
}
// return true if it points to the first byte of a (either single or
// multibyte) character
template<typename Iterator>
bool is_character_start(Iterator it)
{
return (*it & 0xC0) != 0x80;
}
2013-02-26 14:05:51 +01:00
// returns an iterator to the first byte of the character it is into
template<typename Iterator>
Iterator character_start(Iterator it)
{
while (not is_character_start(it))
--it;
return it;
}
namespace InvalidBytePolicy
{
struct Assert
{
Codepoint operator()(char byte) const { assert(false); return byte; }
};
struct Pass
{
Codepoint operator()(char byte) const { return byte; }
};
}
2012-10-08 14:25:05 +02:00
// returns the codepoint of the character whose first byte
// is pointed by it
template<typename InvalidPolicy = InvalidBytePolicy::Assert,
typename Iterator>
2012-10-08 14:25:05 +02:00
Codepoint codepoint(Iterator it)
{
// According to rfc3629, UTF-8 allows only up to 4 bytes.
// (21 bits codepoint)
Codepoint cp;
char byte = *it++;
if (not (byte & 0x80)) // 0xxxxxxx
cp = byte;
else if ((byte & 0xE0) == 0xC0) // 110xxxxx
{
cp = ((byte & 0x1F) << 6) | (*it & 0x3F);
}
else if ((byte & 0xF0) == 0xE0) // 1110xxxx
{
cp = ((byte & 0x0F) << 12) | ((*it++ & 0x3F) << 6);
cp |= (*it & 0x3F);
}
else if ((byte & 0xF8) == 0xF0) // 11110xxx
{
cp = ((byte & 0x0F) << 18) | ((*it++ & 0x3F) << 12);
cp |= (*it++ & 0x3F) << 6;
cp |= (*it & 0x3F);
}
else
cp = InvalidPolicy{}(byte);
return cp;
2012-10-08 14:25:05 +02:00
}
struct invalid_codepoint{};
template<typename OutputIterator>
void dump(OutputIterator& it, Codepoint cp)
{
if (cp <= 0x7F)
*it++ = cp;
else if (cp <= 0x7FF)
{
*it++ = 0xC0 | (cp >> 6);
*it++ = 0x80 | (cp & 0x3F);
}
else if (cp <= 0xFFFF)
{
*it++ = 0xE0 | (cp >> 12);
*it++ = 0x80 | ((cp >> 6) & 0x3F);
*it++ = 0x80 | (cp & 0x3F);
}
else if (cp <= 0x10FFFF)
{
*it++ = 0xF0 | (cp >> 18);
*it++ = 0x80 | ((cp >> 12) & 0x3F);
*it++ = 0x80 | ((cp >> 6) & 0x3F);
*it++ = 0x80 | (cp & 0x3F);
}
else
throw invalid_codepoint{};
}
2012-10-08 14:25:05 +02:00
}
}
#endif // utf8_hh_INCLUDED