1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
|
/* This file is autogenerated by gen/prop/bool-props; DO NOT EDIT. */
#include "_bsearch.h"
#include "bitset.h"
#include "rune.h"
#include "unicode/prop.h"
/* clang-format off */
static constexpr bitset(bs, LATIN1_MAX) = {
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x0C, 0x02,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
};
static const struct {
rune lo, hi;
} lookup[] = {
{RUNE_C(0x002070), RUNE_C(0x002070)},
{RUNE_C(0x002074), RUNE_C(0x00207E)},
{RUNE_C(0x002080), RUNE_C(0x00208E)},
{RUNE_C(0x002202), RUNE_C(0x002202)},
{RUNE_C(0x002207), RUNE_C(0x002207)},
{RUNE_C(0x00221E), RUNE_C(0x00221E)},
{RUNE_C(0x01D6C1), RUNE_C(0x01D6C1)},
{RUNE_C(0x01D6DB), RUNE_C(0x01D6DB)},
{RUNE_C(0x01D6FB), RUNE_C(0x01D6FB)},
{RUNE_C(0x01D715), RUNE_C(0x01D715)},
{RUNE_C(0x01D735), RUNE_C(0x01D735)},
{RUNE_C(0x01D74F), RUNE_C(0x01D74F)},
{RUNE_C(0x01D76F), RUNE_C(0x01D76F)},
{RUNE_C(0x01D789), RUNE_C(0x01D789)},
{RUNE_C(0x01D7A9), RUNE_C(0x01D7A9)},
{RUNE_C(0x01D7C3), RUNE_C(0x01D7C3)},
};
_MLIB_DEFINE_BSEARCH_CONTAINS(lookup)
bool
uprop_is_id_compat_math_continue(rune ch)
{
return ch <= LATIN1_MAX ? TESTBIT(bs, ch) : mlib_lookup_contains(ch);
}
|
