-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathTokenizer.js
472 lines (472 loc) · 19.2 KB
/
Tokenizer.js
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
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
var __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {
function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }
return new (P || (P = Promise))(function (resolve, reject) {
function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } }
function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }
step((generator = generator.apply(thisArg, _arguments || [])).next());
});
};
function helem(id) { return document.getElementById(id); }
function findElemIn(xs, p) {
for (let e of xs)
if (p(e))
return e;
return null;
}
// duangsuse: 很抱歉写得如此低抽象、不可复用
// 毕竟 TypeScript 不是特别走简洁风(无论面向对象还是方法扩展),而且要考虑 ES5/ES6 的问题,也比较纠结。
// 而且我也不清楚该用 object 还是 Map 的说,所以就比较混淆了,实在该打(误
// 对不起,真的对不起。 其实就是字典迭代的问题,毕竟 JS 的数据结构比较不统一嘛。
function clearChild(e) {
while (e.firstChild != null)
e.removeChild(e.firstChild);
}
function withDefaults() { return (e) => { }; }
function withText(text) { return (e) => { e.textContent = text; }; }
function element(tagName, config, ...childs) {
let e = document.createElement(tagName);
config(e);
for (let child of childs)
e.appendChild(child);
return e;
}
function xhrReadText(url) {
return new Promise((resolve, reject) => {
let xhr = new XMLHttpRequest();
xhr.open("GET", url, true);
xhr.onreadystatechange = () => {
if (xhr.readyState != XMLHttpRequest.DONE)
return;
if (xhr.status != 200)
reject([url, xhr.statusText]);
resolve(xhr.responseText);
};
xhr.send();
});
}
const alertFailedReq = ([url, msg]) => alert(`Failed get ${url}: ${msg}`);
function matchAll(re, s) {
var _a, _b;
return (_b = (_a = s.match(re)) === null || _a === void 0 ? void 0 : _a.map(part => { re.lastIndex = 0; return re.exec(part); })) !== null && _b !== void 0 ? _b : [];
}
function reduceToFirst(xs, op) {
let fst = xs[0];
for (let i = 1; i < xs.length; i++)
op(fst, xs[i]);
return fst;
}
let dict = new Map;
let trie;
let noTrie = new Trie;
noTrie.set(["X"], "待加载");
let delimiters = ["\n", "="];
const SEP = " ";
const newlines = {};
for (let nl of ["\n", "\r", "\r\n"])
newlines[nl] = null;
let customHTML;
let inwordGrep = {};
function splitTrieData(s) {
return s.split(delimiters[0]).map((row) => {
let iDelim = row.indexOf(delimiters[1]);
return (iDelim == -1) ? [row, undefined] : [row.substr(0, iDelim), row.substr(iDelim + 1, row.length)]; // split-first feat.
});
}
function tokenize(input) {
return tokenizeTrie(trie, input, c => inwordGrep[c]);
}
function registerOneshotClicks(es, actions) {
let i = 0;
for (let e of es) {
let no = i; // closure upvalue!
e.addEventListener("click", () => { let op = actions[no]; if (op != null) {
op();
actions[no] = null;
} e.setAttribute("hidden", ""); });
i++; // zip iter
}
}
document.addEventListener("DOMContentLoaded", () => __awaiter(this, void 0, void 0, function* () {
const ta_text = helem("text"), // 要分词的
ta_word = helem("text-word"), // 要查词的
abb_word = helem("abb-word"), list_possibleWord = helem("list-possibleWord"), div_out = helem("output"), sel_mode = helem("select-mode"), // 选词典
sel_display = helem("select-display"), // 选渲染
btn_gen = helem("do-generate"), num_fontSize = helem("slider-fontsize"), btn_showDict = helem("do-showDict"), btn_showTrie = helem("do-showTrie"), // 看底层字典
btn_readDict = helem("do-readDict"), btn_revDict = helem("do-reverse");
let dlStatus;
const setTrie = () => { let name = sel_mode.value; trie = dict.has(name) ? dict.get(name)() : noTrie; };
const prepLoadConfig = () => {
dlStatus = element("option", withText("待从配置加载!"));
sel_mode.appendChild(dlStatus);
setTrie(); // noTrie
};
const loadConfig = (url) => __awaiter(this, void 0, void 0, function* () {
yield readDict(url, (k, mk_trie) => {
dlStatus.textContent = `在下载 ${k}…`;
if (!dict.has(k)) {
sel_mode.appendChild(element("option", withText(k)));
} // 加字典选项 若还未存 feat appendOptUnion.
dict.set(k, mk_trie);
setTrie();
if (trie !== noTrie) {
doGenerate();
} // start rendering as early as possible
});
sel_mode.removeChild(dlStatus);
setTrie(); // first trie
});
const featConfiger = () => {
const e = btn_revDict;
let btn_import = element("button", withText("导入参数"));
btn_import.onclick = () => { prepLoadConfig(); loadConfig(ta_text.value); };
e.parentNode.insertBefore(btn_import, e.nextSibling);
let btn_loadRendered = element("button", withText("叠改已渲染文本"));
btn_loadRendered.onclick = () => { ta_text.value = div_out.innerText; doGenerate(); };
e.parentNode.insertBefore(btn_loadRendered, e.nextSibling);
};
let featureEnablers = initFeatureEnablers(btn_gen, div_out, sel_display);
featureEnablers[1] = featConfiger;
registerOneshotClicks(helem("output").getElementsByTagName("button"), featureEnablers);
let customFmtRef = [undefined];
initDisplayOnChange(sel_display, customFmtRef);
sel_mode.onchange = setTrie;
prepLoadConfig();
createIME((text) => { ta_text.value += text; }, ta_word, () => trie, abb_word, list_possibleWord);
num_fontSize.onchange = () => { div_out.style.fontSize = `${num_fontSize.value}pt`; }; // convenient shortcut methods
ta_text.addEventListener("keydown", (ev) => { if (ev.ctrlKey && ev.key == "Enter")
doGenerate(); });
btn_showDict.onclick = () => { ta_text.value = trie.toString(); };
btn_showTrie.onclick = () => {
if (sel_display.selectedIndex == 1)
for (let k of ["\n", "\r"])
trie.remove([k]); // remove-CRLF tokenize feat.
let customFmt = customFmtRef[0];
trie.formatWith(customFmt);
ta_text.value = customFmt.toString();
customFmt.clear();
};
btn_readDict.onclick = () => doLoadDict(ta_text.value.trim(), sel_mode.value);
btn_revDict.onclick = () => doRevDict(sel_mode);
const doLoadDict = (text, dict_name) => {
let table = splitTrieData(text);
let failedKs = [];
for (let [k, v] of table) {
if (v === undefined)
failedKs.push(k);
else
trie.set(chars(k), v);
}
if (failedKs.length != 0)
alert(`条目导入失败:${failedKs.join("、")} ,请按每行 k${delimiters[1]}v 输入`);
alert(`已导入 ${table.length - failedKs.length} 条词关系到词典 ${dict_name}`);
};
const doRevDict = (e) => {
let name = e.value;
if (name.startsWith('~')) {
e.value = name.substr(1);
setTrie();
} // DOM 不能把 .value= 一起 onchange 真麻烦
else {
let rName = `~${name}`;
const ok = () => { e.value = rName; setTrie(); };
if (!dict.has(rName)) {
prepLoadConfig();
loadConfig(`?${rName}=~:${name}`).then(ok);
} // rev-trie feat.
else
ok();
}
};
const doGenerate = () => { clearChild(div_out); renderTokensTo(div_out, tokenize(ta_text.value)); };
btn_gen.addEventListener("click", doGenerate); // nth=0
yield loadConfig(location.search);
if (ta_text.value.length != 0)
doGenerate();
}));
function initFeatureEnablers(btn_update, div_out, sel_display) {
const featExpander = () => {
const toggle = (ev) => {
const css = "abbr-expand";
let e = ev.target;
let e1 = e.nextElementSibling;
if (e1 != null && e1.tagName == "SPAN" && e1.classList.contains(css))
e1.remove();
else
e.parentNode.insertBefore(element("span", (newE) => { newE.textContent = `(${e.title})`; newE.classList.add(css); }), e.nextSibling);
};
const addAbbrExpand = () => {
for (let abbr of div_out.getElementsByTagName("abbr"))
abbr.onclick = toggle;
};
btn_update.addEventListener("click", addAbbrExpand);
addAbbrExpand(); // nth=1
};
const feat2ndTokenize = () => {
const wrapRender = () => {
let oldRender = customHTML;
customHTML = (k, v) => {
let elem = oldRender(k, v);
let accumHTML = elem.innerHTML; // 2nd tokenize feat
let lastV = v;
while (true) {
let newV = joinValues(tokenize(lastV), SEP);
if (newV == null)
break;
accumHTML = accumHTML.replace(lastV, newV); // replace val only
lastV = newV;
}
if (accumHTML != elem.innerHTML) {
elem.innerHTML = accumHTML;
elem.classList.add("recognized-2nd");
}
return elem;
};
};
sel_display.addEventListener("change", wrapRender);
wrapRender(); // nth=1
};
return [featExpander, null, feat2ndTokenize];
}
function initDisplayOnChange(sel_display, customFmtRef) {
const bracketFmt = new BracketFmt(["{", "}"], ", ");
const indentFmt = new IndentationFmt();
const setDisplay = () => {
var _a;
let vSel = sel_display.value;
customFmtRef[0] = vSel.endsWith(")") ? indentFmt : bracketFmt;
switch (vSel) {
case "上标(Ruby notation)":
customHTML = (k, v) => element("ruby", withDefaults(), document.createTextNode(k), element("rt", withText(v)));
break;
case "翻转上标":
customHTML = (k, v) => element("ruby", withDefaults(), document.createTextNode(v), element("rt", withText(k)));
break;
case "粗体+后括号":
customHTML = (k, v) => element("span", withDefaults(), element("b", withText(k)), document.createTextNode(`(${v})`));
break;
case "标记已识别":
customHTML = (k, v) => element("u", withText(k));
break;
case "替换已识别":
customHTML = (k, v) => element("abbr", (e) => { e.textContent = v; e.title = k; });
break;
case "添加释义":
customHTML = (k, v) => element("abbr", (e) => { e.textContent = k; e.title = v; });
break;
default:
if (vSel.endsWith("…")) {
let htmlCode = (_a = prompt("输入关于 K,V 的 HTML 代码:")) !== null && _a !== void 0 ? _a : "<a>K(V)</a>";
customHTML = (k, v) => {
let span = document.createElement("span");
span.innerHTML = htmlCode.replace(/[KV]/g, c => (c[0] == "K") ? k : v);
return span;
};
}
else
throw Error(vSel);
} //^ update vars.
};
sel_display.addEventListener("change", setDisplay);
setDisplay(); // nth=0
}
function createIME(op_out, tarea, get_trie, e_fstWord, ul_possibleWord) {
const handler = (ev) => {
let wordz;
let isDeleting = ev.inputType == "deleteContentBackward";
let input = tarea.value;
if (input == "")
return; // 别在清空时列出全部词!
try {
let point = get_trie().path(chars(input));
if (isDeleting)
e_fstWord.textContent = point.value || "见下表"; // 靠删除确定前缀子串
wordz = joinIterate(point)[Symbol.iterator]();
}
catch (e) {
e_fstWord.textContent = "?";
return;
}
if (!isDeleting) {
let possible = wordz.next().value; // 显示 longest word
if (possible == undefined)
return;
tarea.value += possible[0];
tarea.selectionStart -= possible[0].length;
e_fstWord.textContent = possible[1];
}
clearChild(ul_possibleWord); // 此外?的 possible list
let word;
while (!(word = wordz.next()).done) {
let item = element("li", withDefaults(), element("b", withText(word.value[0])), element("a", withText(word.value[1])));
item.firstChild.addEventListener("click", () => {
op_out(item.lastChild.textContent);
});
ul_possibleWord.appendChild(item);
} // 不这么做得加 DownlevelIteration
};
tarea.oninput = handler;
e_fstWord.onclick = () => { op_out(e_fstWord.textContent); tarea.value = ""; };
}
function renderTokensTo(e, tokens) {
for (let [name, desc] of tokens) {
if (desc == null) {
if (name in newlines)
e.appendChild(document.createElement("br"));
else
e.appendChild(document.createTextNode(name)); // 直接从 JS 堆提交给 DOM 吧,他们会处理好拼接
}
else {
let eRecog = customHTML(name, desc);
eRecog.classList.add("recognized");
e.appendChild(eRecog);
}
}
} //^ 或许咱不必处理换行兼容 :笑哭:
const PAT_URL_PARAM = /[?&]([^=]+)=([^&;#\n]+)/g;
const PAT_GREP = /(.)=([^=]+)=(.*)$/g;
const PAT_CSS_ARGUMENT = /\/\*\[\s*(\d+)\s*\]\*\//g;
function referText(desc) {
return __awaiter(this, void 0, void 0, function* () {
let isUrl = desc.startsWith(':');
try {
return isUrl ? yield xhrReadText(desc.substr(1)) : desc;
}
catch (req) {
alertFailedReq(req);
return "";
}
});
}
function readDict(query, on_load) {
return __awaiter(this, void 0, void 0, function* () {
for (let m of matchAll(PAT_URL_PARAM, query)) {
let name = decodeURIComponent(m[1]);
let value = decodeURIComponent(m[2]);
switch (name) {
case "text":
helem("text").value += yield referText(value); // text concat feat.
break;
case "mode":
helem("select-mode").value = value;
break;
case "font-size":
helem("output").style.fontSize = value;
break;
case "style":
let iArg = value.lastIndexOf('@'); // style=:a.css@cyan,yellow
let desc = (iArg != -1) ? value.substr(0, iArg) : value; // style-args feat.
let code = yield referText(desc);
let css = (iArg != -1) ? code.replace(PAT_CSS_ARGUMENT, (_, no) => value.substr(iArg + 1).split(',')[Number.parseInt(no)]) : code;
document.head.appendChild(element("style", withText(css))); // add-style feat
break;
case "delim0":
delimiters[0] = value;
break;
case "delim1":
delimiters[1] = value;
break;
case "conf":
try {
let qs = yield xhrReadText(value); // conf-file feat
yield readDict(qs, on_load);
}
catch (req) {
alertFailedReq(req);
}
break;
case "feat":
helem("output").getElementsByTagName("button")[Number.parseInt(value)].click();
break;
case "inword-grep":
let [_, c, sRe, subst] = PAT_GREP.exec(value);
let re = RegExp(sRe);
if (subst.length >= 2 && subst.indexOf(c, 1) != -1 && subst != c) {
alert(`${re} 替换后,"${subst}" 不得在首含外有 "${c}"`);
return;
}
inwordGrep[c] = [re, subst];
break;
default:
let trie = yield readTrie(value);
on_load(name, trie);
}
}
});
}
function readTrie(expr) {
return __awaiter(this, void 0, void 0, function* () {
const shadowKey = (key, a, b) => { if (b.has(key))
a.set(key, b.get(key)); };
let sources = yield Promise.all(expr.split('+').map(readTriePipePlus));
let fst = reduceToFirst(sources, (merged, it) => { for (let k of it.keys())
shadowKey(k, merged, it); });
for (let k in newlines)
fst.set(k, null); // append CRLF
let loaded = null;
return () => { if (loaded == null) {
loaded = Trie.fromMap(fst);
} return loaded; }; // lazy-load trie feat.
});
}
function readTriePipePlus(expr) {
return __awaiter(this, void 0, void 0, function* () {
let piped = yield Promise.all(expr.split(">>").map(readTriePipe));
return reduceToFirst(piped, (accum, rules) => {
if (accum.get("") === undefined)
accum.delete("");
for (let [k, v] of accum.entries()) {
if (v == null)
continue;
accum[k] = joinValues(tokenizeTrie(Trie.fromMap(rules), v), SEP);
}
});
});
}
function readTriePipe(expr) {
return __awaiter(this, void 0, void 0, function* () {
let pipes = yield Promise.all(expr.split('>').map(readTrieData));
return reduceToFirst(pipes, (map, data) => {
for (let [k, v] of map.entries()) {
let gotV = data.get(v);
if (gotV !== undefined)
map.set(k, gotV);
}
});
});
}
function readTrieData(expr) {
return __awaiter(this, void 0, void 0, function* () {
let inverted = expr.startsWith('~');
let path = inverted ? expr.substr(1) : expr;
let data;
let map = new Map;
if (path.startsWith(':')) {
let name = path.substr(1);
if (dict.has(name)) {
data = [...joinIterate(dict.get(name)())];
}
else {
alert(`No trie ${name} in dict`);
return map;
}
}
else {
try { // download it.
let text = yield xhrReadText(path);
data = splitTrieData(text);
}
catch (req) {
alertFailedReq(req);
return map;
}
}
if (!inverted)
for (let [k, v] of data)
map.set(k, v); // ~invert feat.
else
for (let [k, v] of data)
map.set(v, k);
return map;
});
}