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
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
|
"use strict";
const lua = require('./lua.js');
const lauxlib = require('./lauxlib.js');
const llimit = require('./llimit.js');
const MAXUNICODE = 0x10FFFF;
const iscont = function(p) {
let c = p & 0xC0;
return c === 0x80;
};
/* translate a relative string position: negative means back from end */
const u_posrelat = function(pos, len) {
if (pos >= 0) return pos;
else if (0 - pos > len) return 0;
else return len + pos + 1;
};
/*
** Decode one UTF-8 sequence, returning NULL if byte sequence is invalid.
*/
const utf8_decode = function(s, val) {
let limits = [0xFF, 0x7F, 0x7FF, 0xFFFF];
let c = s[0];
let res = 0; /* final result */
let pos = 0;
if (c < 0x80) /* ascii? */
res = c;
else {
let count = 0; /* to count number of continuation bytes */
while (c & 0x40) { /* still have continuation bytes? */
let cc = s[++count]; /* read next byte */
if ((cc & 0xC0) != 0x80) /* not a continuation byte? */
return null; /* invalid byte sequence */
res = (res << 6) | (cc & 0x3F); /* add lower 6 bits from cont. byte */
c <<= 1; /* to test next bit */
}
res |= ((c & 0x7F) << (count * 5)); /* add first byte */
if (count > 3 || res > MAXUNICODE || res <= limits[count])
return null; /* invalid byte sequence */
s = s.slice(count); /* skip continuation bytes read */
pos += count;
}
return {
string: s.slice(1), /* +1 to include first byte */
code: res,
pos: pos + 1
};
};
/*
** utf8len(s [, i [, j]]) --> number of characters that start in the
** range [i,j], or nil + current position if 's' is not well formed in
** that interval
*/
const utflen = function(L) {
let n = 0;
let s = lauxlib.luaL_checkstring(L, 1);
let len = s.length;
let posi = u_posrelat(lauxlib.luaL_optinteger(L, 2, 1), len);
let posj = u_posrelat(lauxlib.luaL_optinteger(L, 3, -1), len);
lauxlib.luaL_argcheck(L, 1 <= posi && --posi <= len, 2, "initial position out of string");
lauxlib.luaL_argcheck(L, --posj < len, 3, "final position out of string");
while (posi <= posj) {
let dec = utf8_decode(s.slice(posi));
let s1 = dec ? dec.string : null;
if (s1 === null) {
/* conversion error? */
lua.lua_pushnil(L); /* return nil ... */
lua.lua_pushinteger(L, posi + 1); /* ... and current position */
return 2;
}
posi = s.length - s1.length;
n++;
}
lua.lua_pushinteger(L, n);
return 1;
};
const pushutfchar = function(L, arg) {
let code = lauxlib.luaL_checkinteger(L, arg);
lauxlib.luaL_argcheck(L, 0 <= code && code <= MAXUNICODE, arg, lua.to_luastring("value out of range", true));
lua.lua_pushstring(L, lua.to_luastring(String.fromCharCode(code)));
};
/*
** utfchar(n1, n2, ...) -> char(n1)..char(n2)...
*/
const utfchar = function(L) {
let n = lua.lua_gettop(L); /* number of arguments */
if (n === 1) /* optimize common case of single char */
pushutfchar(L, 1);
else {
let b = new lauxlib.luaL_Buffer();
lauxlib.luaL_buffinit(L, b);
for (let i = 1; i <= n; i++) {
pushutfchar(L, i);
lauxlib.luaL_addvalue(b);
}
lauxlib.luaL_pushresult(b);
}
return 1;
};
/*
** offset(s, n, [i]) -> index where n-th character counting from
** position 'i' starts; 0 means character at 'i'.
*/
const byteoffset = function(L) {
let s = lauxlib.luaL_checkstring(L, 1);
let n = lauxlib.luaL_checkinteger(L, 2);
let posi = n >= 0 ? 1 : s.length + 1;
posi = u_posrelat(lauxlib.luaL_optinteger(L, 3, posi), s.length);
lauxlib.luaL_argcheck(L, 1 <= posi && --posi <= s.length, 3, lua.to_luastring("position out of range", true));
if (n === 0) {
/* find beginning of current byte sequence */
while (posi > 0 && iscont(s[posi])) posi--;
} else {
if (iscont(s[posi]))
lauxlib.luaL_error(L, lua.to_luastring("initial position is a continuation byte", true));
if (n < 0) {
while (n < 0 && posi > 0) { /* move back */
do { /* find beginning of previous character */
posi--;
} while (posi > 0 && iscont(s[posi]));
n++;
}
} else {
n--; /* do not move for 1st character */
while (n > 0 && posi < s.length) {
do { /* find beginning of next character */
posi++;
} while (iscont(s[posi])); /* (cannot pass final '\0') */
n--;
}
}
}
if (n === 0) /* did it find given character? */
lua.lua_pushinteger(L, posi + 1);
else /* no such character */
lua.lua_pushnil(L);
return 1;
};
/*
** codepoint(s, [i, [j]]) -> returns codepoints for all characters
** that start in the range [i,j]
*/
const codepoint = function(L) {
let s = lauxlib.luaL_checkstring(L, 1);
let posi = u_posrelat(lauxlib.luaL_optinteger(L, 2, 1), s.length);
let pose = u_posrelat(lauxlib.luaL_optinteger(L, 3, posi), s.length);
lauxlib.luaL_argcheck(L, posi >= 1, 2, lua.to_luastring("out of range", true));
lauxlib.luaL_argcheck(L, pose <= s.length, 3, lua.to_luastring("out of range", true));
if (posi > pose) return 0; /* empty interval; return no values */
if (pose - posi >= llimit.MAX_INT)
return lauxlib.luaL_error(L, lua.to_luastring("string slice too long", true));
let n = (pose - posi) + 1;
lauxlib.luaL_checkstack(L, n, lua.to_luastring("string slice too long", true));
n = 0;
for (s = s.slice(posi - 1); n < pose - posi;) {
let dec = utf8_decode(s);
if (dec === null)
return lauxlib.luaL_error(L, lua.to_luastring("invalid UTF-8 code", true));
s = dec.string;
let code = dec.code;
lua.lua_pushinteger(L, code);
n++;
}
return n;
};
const iter_aux = function(L) {
let s = lauxlib.luaL_checkstring(L, 1);
let len = s.length;
let n = lua.lua_tointeger(L, 2) - 1;
if (n < 0) /* first iteration? */
n = 0; /* start from here */
else if (n < len) {
n++; /* skip current byte */
while (iscont(s[n])) n++; /* and its continuations */
}
if (n >= len)
return 0; /* no more codepoints */
else {
let dec = utf8_decode(s.slice(n));
let code = dec ? dec.code : null;
let next = dec ? dec.string : null;
if (next === null || iscont(next[0]))
return lauxlib.luaL_error(L, lua.to_luastring("invalid UTF-8 code", true));
lua.lua_pushinteger(L, n + 1);
lua.lua_pushinteger(L, code);
return 2;
}
};
const iter_codes = function(L) {
lauxlib.luaL_checkstring(L, 1);
lua.lua_pushcfunction(L, iter_aux);
lua.lua_pushvalue(L, 1);
lua.lua_pushinteger(L, 0);
return 3;
};
const funcs = {
"char": utfchar,
"codepoint": codepoint,
"codes": iter_codes,
"len": utflen,
"offset": byteoffset
};
/* pattern to match a single UTF-8 character */
const UTF8PATT = "[\0-\x7F\xC2-\xF4][\x80-\xBF]*";
const luaopen_utf8 = function(L) {
lauxlib.luaL_newlib(L, funcs);
lua.lua_pushstring(L, lua.to_luastring(UTF8PATT));
lua.lua_setfield(L, -2, lua.to_luastring("charpattern", true));
return 1;
};
module.exports.luaopen_utf8 = luaopen_utf8;
|