blob: 113c35e20bfd1b8cf7f9c890a66fb06b702bbaee (
plain)
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
63
64
65
66
67
68
69
70
71
|
#include <u.h>
#include <libutf.h>
static
rune*
rangesearch(rune c, rune *t, int n, int ne)
{
rune *p;
int m;
while(n > 1) {
m = n >> 1;
p = t + m*ne;
if(c >= p[0]){
t = p;
n = n-m;
}else
n = m;
}
if(n && c >= t[0])
return t;
return 0;
}
static rune width0_range[] = {
0x2028, 0x2029,
};
static int
iswidth0(rune c)
{
rune *p;
p = rangesearch(c, width0_range, arrlen(width0_range)/2, 2);
if(p && c >= p[0] && c <= p[1])
return 1;
return 0;
}
static rune width1_single[] = {
0x00ad,
};
static int
iswidth1(rune c)
{
rune *p;
p = rangesearch(c, width1_single, arrlen(width1_single), 1);
if(p && c == p[0])
return 1;
return 0;
}
static int
iswidth2(rune c)
{
rune *p;
return 0;
}
int
utf8ยทrunewidth(rune c)
{
if(iswidth1(c))
return 1;
if(iswidth2(c))
return 2;
return 0;
}
|