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
|
/* 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, 0x20, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 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(0x00058A), RUNE_C(0x00058A)},
{RUNE_C(0x0005BE), RUNE_C(0x0005BE)},
{RUNE_C(0x001400), RUNE_C(0x001400)},
{RUNE_C(0x001806), RUNE_C(0x001806)},
{RUNE_C(0x002010), RUNE_C(0x002015)},
{RUNE_C(0x002053), RUNE_C(0x002053)},
{RUNE_C(0x00207B), RUNE_C(0x00207B)},
{RUNE_C(0x00208B), RUNE_C(0x00208B)},
{RUNE_C(0x002212), RUNE_C(0x002212)},
{RUNE_C(0x002E17), RUNE_C(0x002E17)},
{RUNE_C(0x002E1A), RUNE_C(0x002E1A)},
{RUNE_C(0x002E3A), RUNE_C(0x002E3B)},
{RUNE_C(0x002E40), RUNE_C(0x002E40)},
{RUNE_C(0x002E5D), RUNE_C(0x002E5D)},
{RUNE_C(0x00301C), RUNE_C(0x00301C)},
{RUNE_C(0x003030), RUNE_C(0x003030)},
{RUNE_C(0x0030A0), RUNE_C(0x0030A0)},
{RUNE_C(0x00FE31), RUNE_C(0x00FE32)},
{RUNE_C(0x00FE58), RUNE_C(0x00FE58)},
{RUNE_C(0x00FE63), RUNE_C(0x00FE63)},
{RUNE_C(0x00FF0D), RUNE_C(0x00FF0D)},
{RUNE_C(0x010EAD), RUNE_C(0x010EAD)},
};
_MLIB_DEFINE_BSEARCH_CONTAINS(lookup)
bool
uprop_is_dash(rune ch)
{
return ch <= LATIN1_MAX ? TESTBIT(bs, ch) : mlib_lookup_contains(ch);
}
|
