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
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
|
/* 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, 0x06, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
};
static const struct {
rune lo, hi;
} lookup[] = {
{RUNE_C(0x00012F), RUNE_C(0x00012F)},
{RUNE_C(0x000249), RUNE_C(0x000249)},
{RUNE_C(0x000268), RUNE_C(0x000268)},
{RUNE_C(0x00029D), RUNE_C(0x00029D)},
{RUNE_C(0x0002B2), RUNE_C(0x0002B2)},
{RUNE_C(0x0003F3), RUNE_C(0x0003F3)},
{RUNE_C(0x000456), RUNE_C(0x000456)},
{RUNE_C(0x000458), RUNE_C(0x000458)},
{RUNE_C(0x001D62), RUNE_C(0x001D62)},
{RUNE_C(0x001D96), RUNE_C(0x001D96)},
{RUNE_C(0x001DA4), RUNE_C(0x001DA4)},
{RUNE_C(0x001DA8), RUNE_C(0x001DA8)},
{RUNE_C(0x001E2D), RUNE_C(0x001E2D)},
{RUNE_C(0x001ECB), RUNE_C(0x001ECB)},
{RUNE_C(0x002071), RUNE_C(0x002071)},
{RUNE_C(0x002148), RUNE_C(0x002149)},
{RUNE_C(0x002C7C), RUNE_C(0x002C7C)},
{RUNE_C(0x01D422), RUNE_C(0x01D423)},
{RUNE_C(0x01D456), RUNE_C(0x01D457)},
{RUNE_C(0x01D48A), RUNE_C(0x01D48B)},
{RUNE_C(0x01D4BE), RUNE_C(0x01D4BF)},
{RUNE_C(0x01D4F2), RUNE_C(0x01D4F3)},
{RUNE_C(0x01D526), RUNE_C(0x01D527)},
{RUNE_C(0x01D55A), RUNE_C(0x01D55B)},
{RUNE_C(0x01D58E), RUNE_C(0x01D58F)},
{RUNE_C(0x01D5C2), RUNE_C(0x01D5C3)},
{RUNE_C(0x01D5F6), RUNE_C(0x01D5F7)},
{RUNE_C(0x01D62A), RUNE_C(0x01D62B)},
{RUNE_C(0x01D65E), RUNE_C(0x01D65F)},
{RUNE_C(0x01D692), RUNE_C(0x01D693)},
{RUNE_C(0x01DF1A), RUNE_C(0x01DF1A)},
{RUNE_C(0x01E04C), RUNE_C(0x01E04D)},
{RUNE_C(0x01E068), RUNE_C(0x01E068)},
};
_MLIB_DEFINE_BSEARCH_CONTAINS(lookup)
bool
uprop_is_sd(rune ch)
{
return ch <= LATIN1_MAX ? TESTBIT(bs, ch) : mlib_lookup_contains(ch);
}
|