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
|
/* 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, 0x84, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x08, 0x00, 0x08,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
};
static const struct {
rune lo, hi;
} lookup[] = {
{RUNE_C(0x002018), RUNE_C(0x00201F)},
{RUNE_C(0x002039), RUNE_C(0x00203A)},
{RUNE_C(0x002E42), RUNE_C(0x002E42)},
{RUNE_C(0x00300C), RUNE_C(0x00300F)},
{RUNE_C(0x00301D), RUNE_C(0x00301F)},
{RUNE_C(0x00FE41), RUNE_C(0x00FE44)},
{RUNE_C(0x00FF02), RUNE_C(0x00FF02)},
{RUNE_C(0x00FF07), RUNE_C(0x00FF07)},
{RUNE_C(0x00FF62), RUNE_C(0x00FF63)},
};
_MLIB_DEFINE_BSEARCH_CONTAINS(lookup)
bool
uprop_is_qmark(rune ch)
{
return ch <= LATIN1_MAX ? TESTBIT(bs, ch) : mlib_lookup_contains(ch);
}
|
