agstring.hpp

// Copyright Take Vos 2022.
// 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 "agrapheme.hpp"
#include "../unicode/gstring.hpp"
#include "../utility/module.hpp"
#include "../strings.hpp"
#include <vector>
#include <string>
 
template<>
struct std::char_traits<hi::agrapheme> {
    using char_type = hi::agrapheme;
    using int_type = hi::agrapheme::value_type;
    using off_type = std::streamoff;
    using state_type = std::mbstate_t;
    using pos_type = std::fpos<state_type>;
    using comparison_category = std::strong_ordering;
 
    static constexpr void assign(char_type& r, char_type const& a) noexcept
    {
        r = a;
    }
 
    static constexpr char_type *assign(char_type *p, std::size_t count, char_type a) noexcept
    {
        hi_axiom_not_null(p);
 
        for (std::size_t i = 0; i != count; ++i) {
            p[i] = a;
        }
        return p;
    }
 
    [[nodiscard]] static constexpr bool eq(char_type a, char_type b) noexcept
    {
        return a == b;
    }
 
    [[nodiscard]] static constexpr bool lt(char_type a, char_type b) noexcept
    {
        return a < b;
    }
 
    static constexpr char_type *move(char_type *dst, char_type const *src, std::size_t count) noexcept
    {
        hi_axiom_not_null(src);
        hi_axiom_not_null(dst);
 
        if (src >= dst) {
            for (std::size_t i = 0; i != count; ++i) {
                dst[i] = src[i];
            }
        } else {
            for (std::size_t i = count; i != 0; --i) {
                dst[i - 1] = src[i - 1];
            }
        }
        return dst;
    }
 
    static constexpr char_type *copy(char_type *dst, char_type const *src, std::size_t count) noexcept
    {
        hi_axiom_not_null(src);
        hi_axiom_not_null(dst);
 
        for (std::size_t i = 0; i != count; ++i) {
            dst[i] = src[i];
        }
        return dst;
    }
 
    static constexpr int compare(char_type const *s1, char_type const *s2, std::size_t count) noexcept
    {
        hi_axiom_not_null(s1);
        hi_axiom_not_null(s2);
 
        for (std::size_t i = 0; i != count; ++i) {
            if (s1[i] != s2[i]) {
                return s1[i] < s2[i] ? -1 : 1;
            }
        }
        return 0;
    }
 
    static constexpr std::size_t length(char_type const *s) noexcept
    {
        hi_axiom_not_null(s);
 
        std::size_t i = 0;
        while (not s[i].empty()) {
            ++i;
        }
        return i;
    }
 
    static constexpr char_type const *find(const char_type *p, std::size_t count, const char_type& ch) noexcept
    {
        hi_axiom_not_null(p);
 
        for (std::size_t i = 0; i != count; ++i, ++p) {
            if (*p == ch) {
                return p;
            }
        }
        return nullptr;
    }
 
    static constexpr char_type to_char_type(int_type c) noexcept
    {
        char_type r;
        r._value = c;
        return r;
    }
 
    static constexpr int_type to_int_type(char_type c) noexcept
    {
        return c._value;
    }
 
    static constexpr bool eq_int_type(int_type c1, int_type c2) noexcept
    {
        return c1 == c2;
    }
 
    static constexpr int_type eof() noexcept
    {
        // The empty grapheme has all 21 bit '1'.
        return 0x1f'ffffULL << 43;
    }
 
    static constexpr int_type not_eof(int_type e) noexcept
    {
        // Return the replacement-char if e is eof.
        return e == eof() ? (0xfffdULL << 43) : e;
    }
};
 
namespace hi::inline v1 {
 
using agstring = std::basic_string<agrapheme>;
using agstring_view = std::basic_string_view<agrapheme>;
 
namespace pmr {
using agstring = std::pmr::basic_string<agrapheme>;
}
 
} // namespace hi::inline v1
 
template<>
struct std::hash<hi::agstring> {
    [[nodiscard]] std::size_t operator()(hi::agstring const& rhs) noexcept
    {
        auto r = std::hash<std::size_t>{}(rhs.size());
        for (hilet c : rhs) {
            r = hi::hash_mix_two(r, std::hash<hi::agrapheme>{}(c));
        }
        return r;
    }
};
 
template<>
struct std::hash<hi::pmr::agstring> {
    [[nodiscard]] std::size_t operator()(hi::pmr::agstring const& rhs) noexcept
    {
        auto r = std::hash<std::size_t>{}(rhs.size());
        for (hilet c : rhs) {
            r = hi::hash_mix_two(r, std::hash<hi::agrapheme>{}(c));
        }
        return r;
    }
};