mirror of
https://github.com/LadybirdBrowser/ladybird.git
synced 2024-09-20 09:49:15 +03:00
945c58c7c1
These allow us to binary search the code point compositions based on the first code point being combined, which makes the search close to O(log N) instead of O(N).
35 lines
723 B
C++
35 lines
723 B
C++
/*
|
|
* Copyright (c) 2022, mat
|
|
*
|
|
* SPDX-License-Identifier: BSD-2-Clause
|
|
*/
|
|
|
|
#pragma once
|
|
|
|
#include <AK/Error.h>
|
|
#include <AK/Forward.h>
|
|
#include <AK/Optional.h>
|
|
#include <AK/Span.h>
|
|
#include <AK/String.h>
|
|
#include <AK/StringView.h>
|
|
#include <LibUnicode/Forward.h>
|
|
|
|
namespace Unicode {
|
|
|
|
Optional<CodePointDecomposition const> code_point_decomposition(u32 code_point);
|
|
Optional<u32> code_point_composition(u32 first_code_point, u32 second_code_point);
|
|
|
|
enum class NormalizationForm {
|
|
NFD,
|
|
NFC,
|
|
NFKD,
|
|
NFKC
|
|
};
|
|
|
|
NormalizationForm normalization_form_from_string(StringView form);
|
|
StringView normalization_form_to_string(NormalizationForm form);
|
|
|
|
String normalize(StringView string, NormalizationForm form);
|
|
|
|
}
|