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
|
/* 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, 0xFE, 0xFF, 0x00, 0xFC,
0x01, 0x00, 0x00, 0x78, 0x01, 0x00, 0x00, 0x78,
0x00, 0x00, 0x00, 0x00, 0xFE, 0x5A, 0x43, 0x88,
0x00, 0x00, 0x80, 0x00, 0x00, 0x00, 0x80, 0x00,
};
static const struct {
rune lo, hi;
} lookup[] = {
{RUNE_C(0x002010), RUNE_C(0x002027)},
{RUNE_C(0x002030), RUNE_C(0x00203E)},
{RUNE_C(0x002041), RUNE_C(0x002053)},
{RUNE_C(0x002055), RUNE_C(0x00205E)},
{RUNE_C(0x002190), RUNE_C(0x00245F)},
{RUNE_C(0x002500), RUNE_C(0x002775)},
{RUNE_C(0x002794), RUNE_C(0x002BFF)},
{RUNE_C(0x002E00), RUNE_C(0x002E7F)},
{RUNE_C(0x003001), RUNE_C(0x003003)},
{RUNE_C(0x003008), RUNE_C(0x003020)},
{RUNE_C(0x003030), RUNE_C(0x003030)},
{RUNE_C(0x00FD3E), RUNE_C(0x00FD3F)},
{RUNE_C(0x00FE45), RUNE_C(0x00FE46)},
};
_MLIB_DEFINE_BSEARCH_CONTAINS(lookup)
bool
uprop_is_pat_syn(rune ch)
{
return ch <= LATIN1_MAX ? TESTBIT(bs, ch) : mlib_lookup_contains(ch);
}
|
