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
62
|
/*
* Copyright (C) 2026 Peter Mikkelsen <petermikkelsen10@gmail.com>
*
* This file is part of aplwc.
*
* Aplwc is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* Aplwc is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with aplwc. If not, see <https://www.gnu.org/licenses/>.
*/
#include "aplwc_internal.h"
#include "unicode_properties.c"
static int
is(uint32_t c, enum unicode_property p)
{
int n, a, b, i;
struct unicode_range *r;
unicode_get(p, &n, &r);
a = 0;
b = n-1;
while(a <= b){
i = a + (b-a) / 2;
if(c >= r[i].from && c <= r[i].to)
return 1;
else if(c < r[i].from)
b = i-1;
else{
assert(c > r[i].to);
a = i+1;
}
}
return 0;
}
int
is_id_start(uint32_t c)
{
return is(c, ID_Start);
}
int
is_id_continue(uint32_t c)
{
return is(c, ID_Continue);
}
int
is_pattern_syntax(uint32_t c)
{
return is(c, Pattern_Syntax);
}
|