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
|
/* 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, 0x80, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
};
static const struct {
rune lo, hi;
} lookup[] = {
{RUNE_C(0x0002D0), RUNE_C(0x0002D1)},
{RUNE_C(0x000640), RUNE_C(0x000640)},
{RUNE_C(0x0007FA), RUNE_C(0x0007FA)},
{RUNE_C(0x000B55), RUNE_C(0x000B55)},
{RUNE_C(0x000E46), RUNE_C(0x000E46)},
{RUNE_C(0x000EC6), RUNE_C(0x000EC6)},
{RUNE_C(0x00180A), RUNE_C(0x00180A)},
{RUNE_C(0x001843), RUNE_C(0x001843)},
{RUNE_C(0x001AA7), RUNE_C(0x001AA7)},
{RUNE_C(0x001C36), RUNE_C(0x001C36)},
{RUNE_C(0x001C7B), RUNE_C(0x001C7B)},
{RUNE_C(0x003005), RUNE_C(0x003005)},
{RUNE_C(0x003031), RUNE_C(0x003035)},
{RUNE_C(0x00309D), RUNE_C(0x00309E)},
{RUNE_C(0x0030FC), RUNE_C(0x0030FE)},
{RUNE_C(0x00A015), RUNE_C(0x00A015)},
{RUNE_C(0x00A60C), RUNE_C(0x00A60C)},
{RUNE_C(0x00A9CF), RUNE_C(0x00A9CF)},
{RUNE_C(0x00A9E6), RUNE_C(0x00A9E6)},
{RUNE_C(0x00AA70), RUNE_C(0x00AA70)},
{RUNE_C(0x00AADD), RUNE_C(0x00AADD)},
{RUNE_C(0x00AAF3), RUNE_C(0x00AAF4)},
{RUNE_C(0x00FF70), RUNE_C(0x00FF70)},
{RUNE_C(0x010781), RUNE_C(0x010782)},
{RUNE_C(0x01135D), RUNE_C(0x01135D)},
{RUNE_C(0x0115C6), RUNE_C(0x0115C8)},
{RUNE_C(0x011A98), RUNE_C(0x011A98)},
{RUNE_C(0x016B42), RUNE_C(0x016B43)},
{RUNE_C(0x016FE0), RUNE_C(0x016FE1)},
{RUNE_C(0x016FE3), RUNE_C(0x016FE3)},
{RUNE_C(0x01E13C), RUNE_C(0x01E13D)},
{RUNE_C(0x01E944), RUNE_C(0x01E946)},
};
_MLIB_DEFINE_BSEARCH_CONTAINS(lookup)
bool
uprop_is_ext(rune ch)
{
return ch <= LATIN1_MAX ? TESTBIT(bs, ch) : mlib_lookup_contains(ch);
}
|
