mirror of
https://github.com/LadybirdBrowser/ladybird.git
synced 2024-12-30 22:54:35 +03:00
a245ea1743
This is trivial, and makes it easier to get the code point compared to the previous `.code_points()[index]` (which was not actually checked for in-bounds length).
129 lines
2.9 KiB
C++
129 lines
2.9 KiB
C++
/*
|
|
* Copyright (c) 2020, Andreas Kling <kling@serenityos.org>
|
|
*
|
|
* SPDX-License-Identifier: BSD-2-Clause
|
|
*/
|
|
|
|
#pragma once
|
|
|
|
#include <AK/Assertions.h>
|
|
#include <AK/Checked.h>
|
|
#include <AK/Types.h>
|
|
|
|
namespace AK {
|
|
|
|
class Utf32View;
|
|
|
|
class Utf32CodePointIterator {
|
|
friend class Utf32View;
|
|
|
|
public:
|
|
Utf32CodePointIterator() = default;
|
|
~Utf32CodePointIterator() = default;
|
|
|
|
bool operator==(const Utf32CodePointIterator& other) const
|
|
{
|
|
return m_ptr == other.m_ptr && m_length == other.m_length;
|
|
}
|
|
bool operator!=(const Utf32CodePointIterator& other) const
|
|
{
|
|
return !(*this == other);
|
|
}
|
|
Utf32CodePointIterator& operator++()
|
|
{
|
|
VERIFY(m_length > 0);
|
|
m_ptr++;
|
|
m_length--;
|
|
return *this;
|
|
}
|
|
ssize_t operator-(const Utf32CodePointIterator& other) const
|
|
{
|
|
return m_ptr - other.m_ptr;
|
|
}
|
|
u32 operator*() const
|
|
{
|
|
VERIFY(m_length > 0);
|
|
return *m_ptr;
|
|
}
|
|
|
|
constexpr int code_point_length_in_bytes() const { return sizeof(u32); }
|
|
bool done() const { return !m_length; }
|
|
|
|
private:
|
|
Utf32CodePointIterator(const u32* ptr, size_t length)
|
|
: m_ptr(ptr)
|
|
, m_length((ssize_t)length)
|
|
{
|
|
}
|
|
const u32* m_ptr { nullptr };
|
|
ssize_t m_length { -1 };
|
|
};
|
|
|
|
class Utf32View {
|
|
public:
|
|
using Iterator = Utf32CodePointIterator;
|
|
|
|
Utf32View() = default;
|
|
Utf32View(const u32* code_points, size_t length)
|
|
: m_code_points(code_points)
|
|
, m_length(length)
|
|
{
|
|
VERIFY(code_points || length == 0);
|
|
}
|
|
|
|
Utf32CodePointIterator begin() const
|
|
{
|
|
return { begin_ptr(), m_length };
|
|
}
|
|
|
|
Utf32CodePointIterator end() const
|
|
{
|
|
return { end_ptr(), 0 };
|
|
}
|
|
|
|
u32 at(size_t index) const
|
|
{
|
|
VERIFY(index < m_length);
|
|
return m_code_points[index];
|
|
}
|
|
|
|
u32 operator[](size_t index) const { return at(index); }
|
|
|
|
const u32* code_points() const { return m_code_points; }
|
|
bool is_empty() const { return m_length == 0; }
|
|
bool is_null() const { return !m_code_points; }
|
|
size_t length() const { return m_length; }
|
|
|
|
size_t iterator_offset(const Utf32CodePointIterator& it) const
|
|
{
|
|
VERIFY(it.m_ptr >= m_code_points);
|
|
VERIFY(it.m_ptr < m_code_points + m_length);
|
|
return ((ptrdiff_t)it.m_ptr - (ptrdiff_t)m_code_points) / sizeof(u32);
|
|
}
|
|
|
|
Utf32View substring_view(size_t offset, size_t length) const
|
|
{
|
|
VERIFY(offset <= m_length);
|
|
VERIFY(!Checked<size_t>::addition_would_overflow(offset, length));
|
|
VERIFY((offset + length) <= m_length);
|
|
return Utf32View(m_code_points + offset, length);
|
|
}
|
|
|
|
private:
|
|
const u32* begin_ptr() const
|
|
{
|
|
return m_code_points;
|
|
}
|
|
const u32* end_ptr() const
|
|
{
|
|
return m_code_points + m_length;
|
|
}
|
|
|
|
const u32* m_code_points { nullptr };
|
|
size_t m_length { 0 };
|
|
};
|
|
|
|
}
|
|
|
|
using AK::Utf32View;
|