grapheme.hpp

// Copyright Take Vos 2019-2021.
// Distributed under the Boost Software License, Version 1.0.
// (See accompanying file LICENSE_1_0.txt or copy at https://www.boost.org/LICENSE_1_0.txt)
 
#pragma once
 
#include "../required.hpp"
#include "../strings.hpp"
#include "../unfair_mutex.hpp"
#include "../cast.hpp"
#include "../stable_set.hpp"
#include <cstdint>
#include <string>
#include <string_view>
#include <cstddef>
#include <memory>
#include <vector>
#include <algorithm>
#include <bit>
 
namespace hi::inline v1 {
namespace detail {
 
inline auto long_graphemes = ::hi::stable_set<std::u32string>{};
 
} // namespace detail
 
struct composed_t {};
 
struct grapheme {
    using value_type = uint32_t;
 
    value_type _value;
 
    constexpr grapheme() noexcept = default;
    constexpr grapheme(grapheme const&) noexcept = default;
    constexpr grapheme(grapheme&&) noexcept = default;
    constexpr grapheme& operator=(grapheme const&) noexcept = default;
    constexpr grapheme& operator=(grapheme&&) noexcept = default;
 
    constexpr explicit grapheme(char32_t code_point) noexcept : _value(truncate<value_type>(code_point))
    {
        hi_axiom(code_point <= 0x10ffff);
    }
 
    constexpr explicit grapheme(char ascii_char) noexcept : _value(truncate<value_type>(ascii_char))
    {
        hi_axiom(ascii_char >= 0 and ascii_char <= 0x7f);
    }
 
    constexpr grapheme& operator=(char32_t code_point) noexcept
    {
        _value = truncate<value_type>(code_point);
        return *this;
    }
 
    constexpr grapheme& operator=(char ascii_char) noexcept
    {
        hi_axiom(ascii_char >= 0 and ascii_char <= 0x7f);
        _value = truncate<value_type>(ascii_char);
        return *this;
    }
 
    explicit grapheme(std::u32string_view code_points) noexcept;
 
    explicit grapheme(composed_t, std::u32string_view code_points) noexcept;
 
    [[nodiscard]] static constexpr grapheme eof() noexcept
    {
        grapheme r;
        r._value = 0x1f'ffff;
        return r;
    }
 
    constexpr void clear() noexcept
    {
        _value = 0x1f'ffff;
    }
 
    [[nodiscard]] constexpr bool empty() const noexcept
    {
        return _value == 0x1f'ffff;
    }
 
    constexpr operator bool() const noexcept
    {
        return not empty();
    }
 
    [[nodiscard]] bool valid() const noexcept;
 
    [[nodiscard]] std::u32string const &long_grapheme() const noexcept
    {
        hi_axiom(_value >= 0x10'0000 and _value < 0x1f'ffff);
        return detail::long_graphemes[_value - 0x11'0000];
    }
 
    [[nodiscard]] constexpr std::size_t size() const noexcept
    {
        if (_value == 0x1f'ffff) {
            return 0;
 
        } else if (_value <= 0x10'ffff) {
            return 1;
 
        } else {
            return long_grapheme().size();
        }
    }
 
    [[nodiscard]] constexpr char32_t operator[](size_t i) const noexcept
    {
        hi_axiom(i < size());
 
        if (_value <= 0x10'ffff) {
            return truncate<char32_t>(_value);
        } else {
            return long_grapheme()[i];
        }
    }
 
    template<size_t I>
    [[nodiscard]] friend constexpr char32_t get(grapheme const& rhs) noexcept
    {
        hi_axiom(I < rhs.size());
 
        if (rhs._value <= 0x10'ffff) {
            return rhs._value;
        } else {
            return rhs.long_grapheme()[I];
        }
    }
 
    [[nodiscard]] constexpr std::u32string composed() const noexcept
    {
        if (_value <= 0x10'ffff) {
            return std::u32string{truncate<char32_t>(_value)};
        } else {
            return long_grapheme();
        }
    }
 
    [[nodiscard]] std::u32string decomposed() const noexcept;
 
    [[nodiscard]] friend constexpr bool operator==(grapheme const&, grapheme const&) noexcept = default;
 
    [[nodiscard]] friend constexpr std::strong_ordering operator<=>(grapheme const& lhs, grapheme const& rhs) noexcept
    {
        return lhs.decomposed() <=> rhs.decomposed();
    }
 
    [[nodiscard]] friend constexpr bool operator==(grapheme const& lhs, char32_t const& rhs) noexcept
    {
        return lhs == grapheme{rhs};
    }
 
    [[nodiscard]] friend constexpr std::strong_ordering operator<=>(grapheme const& lhs, char32_t const& rhs) noexcept
    {
        return lhs <=> grapheme{rhs};
    }
 
    [[nodiscard]] friend constexpr bool operator==(grapheme const& lhs, char const& rhs) noexcept
    {
        return lhs == grapheme{rhs};
    }
 
    [[nodiscard]] friend constexpr std::strong_ordering operator<=>(grapheme const& lhs, char const& rhs) noexcept
    {
        return lhs <=> grapheme{rhs};
    }
 
    [[nodiscard]] friend std::string to_string(grapheme const& rhs) noexcept
    {
        return hi::to_string(rhs.composed());
    }
 
    [[nodiscard]] friend std::u32string to_u32string(grapheme const& rhs) noexcept
    {
        return rhs.composed();
    }
};
 
} // namespace hi::inline v1
 
template<>
struct std::hash<hi::grapheme> {
    [[nodiscard]] std::size_t operator()(hi::grapheme const& rhs) const noexcept
    {
        return std::hash<hi::grapheme::value_type>{}(rhs._value);
    }
};