jsmigemo 0.4.2 → 0.4.4

package/README.md

@@ -5,6 +5,31 @@
 
 JavaScriptでMigemoを利用するためのライブラリ
 
+## Install from npm
+
+```
+$ npm install jsmigemo
+```
+
+## Install from CDN
+
+`https://cdn.jsdelivr.net/npm/jsmigemo/dist/<filename>` の `<filename>` の部分に、用途に応じて以下のファイル名を指定してください。
+
+| Format | Default | Minified |
+|:------:|---------|----------|
+| ESModule | jsmigemo.mjs | jsmigemo.min.mjs |
+| CommonJS | jsmigemo.cjs | jsmigemo.min.cjs |
+| IIFE | jsmigemo.js | jsmigemo.min.js |
+
+DefaultとMinifiedの違いは以下です。
+- Defaultは、ソースコードを1つにまとめただけの、変数名もそのまま残っているJSファイルです。開発時にはこちらをご利用ください。
+- Minifiedは、ファイルサイズを小さくするための様々な処理をしたJSファイルです。配布時にはこちらをご利用ください。
+
+ESModuleとCommonJS、IIFEの違いは以下です。
+- ESModuleは、最近のバンドラやNode.JS、モダンブラウザなど幅広く利用できるフォーマットです。
+- CommonJSは、browserifyやwebpack1のような古いバンドラでの利用を意図したフォーマットです。
+- IIFEは、レガシーブラウザやESModuleの利用できない環境（例えばローカルのJSファイル）での利用を意図したフォーマットです。
+
 ## HOW TO USE
 
 ### CLI
@@ -23,7 +48,7 @@ const migemo = require('jsmigemo');
 const path = require('path');
 const fs = require('fs');
 
-const buffer = fs.readFileSync(path.join(migemo.migemo_module_path, '../../migemo-compact-dict'));
+const buffer = fs.readFileSync('migemo-compact-dict');
 const dict = new migemo.CompactDictionary(buffer.buffer);
 const m = new migemo.Migemo();
 m.setDict(dict);
@@ -31,6 +56,19 @@ console.log(m.query('kensaku'));
 //=> (kensaku|けんさく|ケンサク|建策|憲[作冊]|検索|献策|研削|羂索|ｋｅｎｓａｋｕ|ｹﾝｻｸ)
 ```
 
+### Deno
+
+```js
+import * as migemo from "https://cdn.jsdelivr.net/npm/jsmigemo/dist/jsmigemo.min.mjs";
+
+const data = await Deno.readFile("./migemo-compact-dict");
+const dict = new migemo.CompactDictionary(data.buffer);
+const m = new migemo.Migemo();
+m.setDict(dict);
+console.log(m.query("kensaku"));
+//=> (kensaku|けんさく|ケンサク|建策|憲[作冊]|検索|献策|研削|羂索|ｋｅｎｓａｋｕ|ｹﾝｻｸ)
+```
+
 ### Browser
 
 `jsmigemo.js` と `migemo-compact-dict` を本リポジトリから用意します。
@@ -70,7 +108,7 @@ queryメソッドはステートレスのため、複数のスレッドから同
 ## 辞書ファイルの生成
 
 ```shell
-> node  bin/jsmigemo-dict.js <text-dict-file> <compact-dict-file>
+> node  bin/jsmigemo-dict.mjs <text-dict-file> <compact-dict-file>
 ```
 
 `<text-dict-file>` は、C/Miemoで使われているテキスト形式の辞書ファイルです。

package/dist/jsmigemo.cjs

@@ -1,7 +1,5 @@
 'use strict';
 
-Object.defineProperty(exports, '__esModule', { value: true });
-
 class BitList {
     constructor(size) {
         if (size == undefined) {
@@ -672,18 +670,18 @@ class LOUDSTrie {
         if (index <= 0 || this.edges.length <= index) {
             throw new RangeError();
         }
-        let sb = new Array();
+        const sb = new Array();
         while (index > 1) {
             sb.push(this.edges[index]);
             index = this.parent(index);
         }
-        return sb.reverse().map(v => String.fromCharCode(v)).join('');
+        return String.fromCharCode(...sb.reverse());
     }
     parent(x) {
         return this.bitVector.rank(this.bitVector.select(x, true), false);
     }
     firstChild(x) {
-        let y = this.bitVector.select(x, false) + 1;
+        const y = this.bitVector.select(x, false) + 1;
         if (this.bitVector.get(y)) {
             return this.bitVector.rank(y, true) + 1;
         }
@@ -692,20 +690,20 @@ class LOUDSTrie {
         }
     }
     traverse(index, c) {
-        let firstChild = this.firstChild(index);
+        const firstChild = this.firstChild(index);
         if (firstChild == -1) {
             return -1;
         }
-        let childStartBit = this.bitVector.select(firstChild, true);
-        let childEndBit = this.bitVector.nextClearBit(childStartBit);
-        let childSize = childEndBit - childStartBit;
-        let result = binarySearchUint16(this.edges, firstChild, firstChild + childSize, c);
+        const childStartBit = this.bitVector.select(firstChild, true);
+        const childEndBit = this.bitVector.nextClearBit(childStartBit);
+        const childSize = childEndBit - childStartBit;
+        const result = binarySearchUint16(this.edges, firstChild, firstChild + childSize, c);
         return result >= 0 ? result : -1;
     }
     lookup(key) {
         let nodeIndex = 1;
         for (let i = 0; i < key.length; i++) {
-            let c = key.charCodeAt(i);
+            const c = key.charCodeAt(i);
             nodeIndex = this.traverse(nodeIndex, c);
             if (nodeIndex == -1) {
                 break;
@@ -824,11 +822,9 @@ class CompactDictionary {
             const size = valueEndPos - valueStartPos - 1;
             if (size > 0) {
                 const offset = this.mappingBitVector.rank(valueStartPos, false);
-                const result = new Array(size);
-                for (let i = 0; i < result.length; i++) {
+                for (let i = 0; i < size; i++) {
                     yield this.valueTrie.reverseLookup(this.mapping[valueStartPos - offset + i]);
                 }
-                return result;
             }
         }
     }
@@ -1343,19 +1339,20 @@ class TernaryRegexGenerator {
     }
 }
 
-class RomajiPredictiveResult$1 {
+class RomajiPredictiveResult {
     constructor(prefix, suffixes) {
         this.prefix = prefix;
         this.suffixes = suffixes;
     }
-}
+}
+
 class RomajiProcessor2 {
     constructor(trie, hiraganaList, remainList) {
         this.trie = trie;
         this.hiraganaList = hiraganaList;
         this.remainList = remainList;
     }
-    static buildProcessor() {
+    static build() {
         const base = new Int16Array([0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 26, 31, 95, -1, 100, 121, 147, -1, 175, 182, 203, 229, 251, -1, 266, 284, 291, 302, 334, -1, 379, 401, 420, 432, 464, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 50, 49, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 28, -1, -1, -1, -1, 52, -1, -1, -1, -1, -1, -1, 24, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 21, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 57, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 67, -1, -1, -1, -1, -1, -1, -1, 34, -1, -1, -1, -1, -1, -1, 76, -1, 93, -1, -1, -1, -1, 59, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 118, -1, 136, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 149, -1, 158, -1, 23, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 160, -1, -1, -1, -1, 177, -1, 201, -1, -1, -1, -1, -1, -1, 61, -1, -1, -1, -1, -1, -1, -1, -1, 44, -1, -1, 47, -1, 212, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 230, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 248, 86, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 269, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 317, -1, -1, -1, -1, -1, 293, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 319, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 343, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 360, -1, -1, -1, 361, -1, 362, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 384, -1, -1, -1, -1, 402, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 46, -1, 74, -1, -1, -1, -1, 85, -1, -1, -1, -1, -1, -1, -1, -1, 68, -1, -1, 83, -1, 427, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 445, -1]);
         const check = new Int16Array([-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, 0, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, -1, 0, -1, -1, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 98, 98, 147, 0, 98, 99, 147, 99, 98, 99, 147, 100, 99, 99, 98, 171, 147, 270, 159, 99, 98, 322, 147, 135, 98, 99, 152, 135, 207, 99, 152, 135, 134, 221, 152, 310, 319, 135, 319, 310, 152, 199, 520, 135, 134, 199, 152, 221, 134, 199, 214, 183, 522, 221, 214, 199, 522, 539, 214, 527, 536, 199, 536, 527, 214, -1, -1, 216, 373, 100, 214, 216, 100, 100, 102, 216, 100, 100, 102, 102, 373, 216, 102, 100, 373, -1, -1, 216, 102, 100, -1, 100, 240, 100, 102, 103, 240, -1, 102, 103, 240, 103, -1, 103, -1, -1, 240, -1, -1, 103, 242, -1, 240, -1, 242, 103, -1, 103, 242, 103, -1, 104, -1, 266, 242, 104, -1, 266, 104, 104, 242, 266, 268, -1, 296, 104, 268, 266, 296, -1, 268, 104, 296, 104, -1, 104, 268, 266, 296, 106, -1, 301, 268, 106, 296, 301, 107, 106, 106, 301, 107, -1, -1, 106, 107, 301, 107, 110, -1, 106, 107, 301, -1, 106, -1, 303, 107, 108, 107, 303, 107, 108, -1, 303, -1, 108, 324, 108, 108, 303, 324, 108, -1, -1, 324, 303, 108, 108, -1, 108, 324, 108, -1, 109, 350, -1, 324, 109, 350, -1, -1, 109, 350, -1, -1, 109, -1, 109, 350, -1, -1, -1, 372, 109, 350, 110, 372, 109, -1, 110, 372, -1, -1, 110, -1, -1, 372, -1, 110, 110, 112, -1, 372, 387, 112, 110, -1, 387, 112, 110, 116, 387, -1, -1, 112, 112, -1, 387, 113, -1, 112, -1, 113, 387, 112, 114, 113, 412, -1, 114, -1, 412, 113, 114, 113, 412, 115, -1, 113, 114, 115, 412, 114, 115, 115, 114, -1, 412, -1, 114, 115, 406, -1, 423, 115, 406, 115, 423, -1, 406, 115, 423, -1, -1, -1, 406, -1, 423, 116, -1, -1, 406, 116, 423, -1, 116, 116, 438, -1, -1, -1, 438, 116, -1, -1, 438, 116, 116, 116, -1, 116, 438, 116, -1, 449, 453, 455, 438, 449, 453, 455, -1, 449, 453, 455, -1, -1, -1, 449, 453, 455, -1, -1, 118, 449, 453, 455, 118, 500, -1, -1, 118, 500, -1, -1, -1, 500, 118, -1, -1, -1, -1, 500, 118, 118, 119, 505, 118, 500, 119, 505, -1, 119, 119, 505, 122, 122, 122, 122, 119, 505, -1, -1, -1, 120, 119, 505, 119, 120, 119, -1, 541, 120, -1, 120, 541, 121, 120, 120, 541, 121, -1, -1, 120, 120, 541, 120, 120, 120, 585, 121, 541, -1, 585, -1, -1, 121, 585, -1, -1, 121, -1, 122, 585, 122, -1, -1, -1, 122, 585, -1, -1, 122, -1, -1, 122, 122, 122, 122, 122, -1, -1, 122, -1, -1, -1, -1, -1, 122, -1, -1, -1, 122, 122]);
         const remainList = new Int8Array([-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, 0, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, -1, 0, -1, -1, -1, 0, -1, -1, -1, 0, -1, -1, -1, 0, -1, -1, -1, -1, 0, 0, -1, -1, -1, -1, -1, 0, -1, -1, -1, -1, -1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, -1, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 0, 0, 0, 0, -1, 0, 0, 0, 0, 0, 0, -1, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 0, 0, 0, 0, -1, -1, 0, 0, 0, 0, 0, 1, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0, -1, -1, -1, 0, 0, 0, -1, -1, 0, -1, 0, 0, 0, -1, -1, 0, 0, 1, -1, 0, -1, -1, 0, -1, -1, 0, 0, -1, 0, -1, 0, 0, -1, -1, 0, -1, -1, 0, -1, 0, 0, 0, -1, 0, 1, 0, 0, 0, 0, -1, 0, 0, 0, 0, 0, -1, 0, 0, 0, -1, -1, -1, 0, -1, 0, 0, -1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, -1, -1, 0, 0, 0, 1, 0, -1, 0, 0, 0, -1, -1, -1, 0, 0, 0, -1, 0, -1, 0, -1, 0, -1, 0, 0, -1, 1, 0, 0, 0, -1, -1, 0, 0, -1, 0, -1, -1, 0, -1, -1, 0, 0, -1, 0, 0, 0, -1, -1, 0, 0, -1, -1, 1, -1, 0, 0, -1, -1, -1, 0, 0, 0, 0, 0, -1, -1, 0, 0, -1, -1, 0, -1, -1, 0, -1, 0, 0, 0, -1, 0, 0, 0, 0, -1, 0, 0, -1, -1, 0, -1, -1, 0, 1, -1, 0, 0, -1, 0, -1, 0, 0, -1, 0, 0, 0, -1, 0, -1, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0, 1, -1, 0, 0, -1, 0, -1, -1, 0, 0, -1, 0, 1, 0, 0, 0, -1, 0, -1, 0, -1, -1, -1, 0, -1, 0, 0, -1, -1, 0, 0, 0, -1, -1, 0, 0, -1, -1, -1, 0, 0, -1, -1, 0, -1, 1, 0, -1, -1, 0, -1, -1, 0, 0, 0, 0, 0, 0, 0, -1, 0, 0, 0, -1, -1, -1, 0, 0, 0, -1, -1, 0, 0, 0, 0, 0, 0, -1, -1, 0, 0, -1, -1, -1, 0, 0, -1, -1, -1, -1, 0, 0, 1, 0, 0, -1, 0, 0, 0, -1, -1, 0, 0, 0, 0, 0, 0, 0, 0, -1, -1, -1, 0, 0, 0, 1, 0, -1, -1, 0, 0, -1, -1, 0, 0, 0, 0, 0, 0, -1, -1, -1, 0, 0, -1, 1, -1, 0, 0, 0, -1, 0, -1, -1, 0, 0, -1, -1, 1, -1, 0, 0, 0, -1, -1, -1, 0, 0, -1, -1, 0, -1, -1, 0, 0, 0, 0, 0, -1, -1, 0, -1, -1, -1, -1, -1, 0, -1, -1, -1, -1, 1]);
@@ -1414,10 +1411,10 @@ class RomajiProcessor2 {
                 }
                 if (list.length == 1) {
                     builder = builder + list[0];
-                    return new RomajiPredictiveResult$1(builder, [""]);
+                    return new RomajiPredictiveResult(builder, [""]);
                 }
                 else {
-                    return new RomajiPredictiveResult$1(builder, list);
+                    return new RomajiPredictiveResult(builder, list);
                 }
             }
             else if (longestNode >= 0) {
@@ -1429,7 +1426,7 @@ class RomajiProcessor2 {
                 cursor++;
             }
         }
-        return new RomajiPredictiveResult$1(builder, [""]);
+        return new RomajiPredictiveResult(builder, [""]);
     }
 }
 
@@ -1437,7 +1434,7 @@ class Migemo {
     constructor() {
         this.dict = null;
         this.rxop = null;
-        this.processor = RomajiProcessor2.buildProcessor();
+        this.processor = RomajiProcessor2.build();
     }
     queryAWord(word) {
         const generator = this.rxop == null ? TernaryRegexGenerator.getDEFAULT() : new TernaryRegexGenerator(this.rxop[0], this.rxop[1], this.rxop[2], this.rxop[3], this.rxop[4], this.rxop[5]);
@@ -1492,6 +1489,9 @@ class Migemo {
     setRxop(rxop) {
         this.rxop = rxop;
     }
+    setRomajiProcessor(processor) {
+        this.processor = processor;
+    }
     *parseQuery(query) {
         const re = /[^A-Z\s]+|[A-Z]{2,}|([A-Z][^A-Z\s]+)|([A-Z]\s*$)/g;
         let myArray;
@@ -1839,140 +1839,153 @@ const ROMAN_ENTRIES = [
     new RomanEntry("who", "うぉ", 0)
 ]
     .sort((a, b) => a.index - b.index);
-const ROMAN_INDEXES = ROMAN_ENTRIES.map(e => e.index);
-class RomajiPredictiveResult {
-    constructor(estaglishedHiragana, predictiveSuffixes) {
-        this.estaglishedHiragana = estaglishedHiragana;
-        this.predictiveSuffixes = predictiveSuffixes;
+class RomajiProcessor1 {
+    constructor(entries) {
+        this.roman_indexes = [];
+        this.roman_entries = [];
+        this.roman_entries = entries.sort((a, b) => a.index - b.index);
+        this.roman_indexes = this.roman_entries.map(e => e.index);
     }
-}
-function romajiToHiragana(romaji) {
-    if (romaji.length == 0) {
-        return "";
-    }
-    let hiragana = "";
-    let start = 0;
-    let end = 1;
-    while (start < romaji.length) {
-        let lastFound = -1;
-        let lower = 0;
-        let upper = ROMAN_INDEXES.length;
-        while (upper - lower > 1 && end <= romaji.length) {
-            const lowerKey = RomanEntry._calculateIndex(romaji, start, end);
-            lower = binarySearch(ROMAN_INDEXES, lower, upper, lowerKey);
-            if (lower >= 0) {
-                lastFound = lower;
+    static build() {
+        return new RomajiProcessor1(ROMAN_ENTRIES);
+    }
+    romajiToHiragana(romaji) {
+        if (romaji.length == 0) {
+            return "";
+        }
+        let hiragana = "";
+        let start = 0;
+        let end = 1;
+        while (start < romaji.length) {
+            let lastFound = -1;
+            let lower = 0;
+            let upper = this.roman_indexes.length;
+            while (upper - lower > 1 && end <= romaji.length) {
+                const lowerKey = RomanEntry._calculateIndex(romaji, start, end);
+                lower = binarySearch(this.roman_indexes, lower, upper, lowerKey);
+                if (lower >= 0) {
+                    lastFound = lower;
+                }
+                else {
+                    lower = -lower - 1;
+                }
+                const upperKey = lowerKey + (1 << (32 - 8 * (end - start)));
+                upper = binarySearch(this.roman_indexes, lower, upper, upperKey);
+                if (upper < 0) {
+                    upper = -upper - 1;
+                }
+                end++;
             }
-            else {
-                lower = -lower - 1;
+            if (lastFound >= 0) {
+                const entry = this.roman_entries[lastFound];
+                hiragana = hiragana + entry.hiragana;
+                start = start + entry.roman.length - entry.remain;
+                end = start + 1;
             }
-            const upperKey = lowerKey + (1 << (32 - 8 * (end - start)));
-            upper = binarySearch(ROMAN_INDEXES, lower, upper, upperKey);
-            if (upper < 0) {
-                upper = -upper - 1;
+            else {
+                hiragana = hiragana + romaji.charAt(start);
+                start++;
+                end = start + 1;
             }
-            end++;
-        }
-        if (lastFound >= 0) {
-            const entry = ROMAN_ENTRIES[lastFound];
-            hiragana = hiragana + entry.hiragana;
-            start = start + entry.roman.length - entry.remain;
-            end = start + 1;
-        }
-        else {
-            hiragana = hiragana + romaji.charAt(start);
-            start++;
-            end = start + 1;
         }
+        return hiragana;
     }
-    return hiragana;
-}
-function findRomanEntryPredicatively(roman, offset) {
-    let startIndex = 0;
-    let endIndex = ROMAN_INDEXES.length;
-    for (let i = 0; i < 4; i++) {
-        if (roman.length <= offset + i) {
-            break;
-        }
-        const startKey = RomanEntry._calculateIndex(roman, offset, offset + i + 1);
-        startIndex = binarySearch(ROMAN_INDEXES, startIndex, endIndex, startKey);
-        if (startIndex >= 0) ;
-        else {
-            startIndex = -startIndex - 1;
-        }
-        const endKey = startKey + (1 << (24 - 8 * i));
-        endIndex = binarySearch(ROMAN_INDEXES, startIndex, endIndex, endKey);
-        if (endIndex < 0) {
-            endIndex = -endIndex - 1;
-        }
-        if (endIndex - startIndex == 1) {
-            return new Set([ROMAN_ENTRIES[startIndex]]);
-        }
-    }
-    const result = new Set();
-    for (let i = startIndex; i < endIndex; i++) {
-        result.add(ROMAN_ENTRIES[i]);
-    }
-    return result;
-}
-function romajiToHiraganaPredictively(romaji) {
-    if (romaji.length == 0) {
-        return new RomajiPredictiveResult("", new Set([""]));
-    }
-    let hiragana = "";
-    let start = 0;
-    let end = 1;
-    while (start < romaji.length) {
-        let lastFound = -1;
-        let lower = 0;
-        let upper = ROMAN_INDEXES.length;
-        while (upper - lower > 1 && end <= romaji.length) {
-            const lowerKey = RomanEntry._calculateIndex(romaji, start, end);
-            lower = binarySearch(ROMAN_INDEXES, lower, upper, lowerKey);
-            if (lower >= 0) {
-                lastFound = lower;
+    findRomanEntryPredicatively(roman, offset) {
+        let startIndex = 0;
+        let endIndex = this.roman_indexes.length;
+        for (let i = 0; i < 4; i++) {
+            if (roman.length <= offset + i) {
+                break;
             }
+            const startKey = RomanEntry._calculateIndex(roman, offset, offset + i + 1);
+            startIndex = binarySearch(this.roman_indexes, startIndex, endIndex, startKey);
+            if (startIndex >= 0) ;
             else {
-                lower = -lower - 1;
+                startIndex = -startIndex - 1;
+            }
+            const endKey = startKey + (1 << (24 - 8 * i));
+            endIndex = binarySearch(this.roman_indexes, startIndex, endIndex, endKey);
+            if (endIndex < 0) {
+                endIndex = -endIndex - 1;
             }
-            const upperKey = lowerKey + (1 << (32 - 8 * (end - start)));
-            upper = binarySearch(ROMAN_INDEXES, lower, upper, upperKey);
-            if (upper < 0) {
-                upper = -upper - 1;
+            if (endIndex - startIndex == 1) {
+                return new Set([this.roman_entries[startIndex]]);
             }
-            end++;
         }
-        if (end > romaji.length && upper - lower > 1) {
-            const set = new Set();
-            for (let i = lower; i < upper; i++) {
-                const re = ROMAN_ENTRIES[i];
-                if (re.remain > 0) {
-                    let set2 = findRomanEntryPredicatively(romaji, end - 1 - re.remain);
-                    for (let re2 of set2) {
-                        if (re2.remain == 0) {
-                            set.add(re.hiragana + re2.hiragana);
+        const result = new Set();
+        for (let i = startIndex; i < endIndex; i++) {
+            result.add(this.roman_entries[i]);
+        }
+        return result;
+    }
+    romajiToHiraganaPredictively(romaji) {
+        if (romaji.length == 0) {
+            return new RomajiPredictiveResult("", [""]);
+        }
+        let hiragana = "";
+        let start = 0;
+        let end = 1;
+        while (start < romaji.length) {
+            let lastFound = -1;
+            let lower = 0;
+            let upper = this.roman_indexes.length;
+            while (upper - lower > 1 && end <= romaji.length) {
+                const lowerKey = RomanEntry._calculateIndex(romaji, start, end);
+                lower = binarySearch(this.roman_indexes, lower, upper, lowerKey);
+                if (lower >= 0) {
+                    lastFound = lower;
+                }
+                else {
+                    lower = -lower - 1;
+                }
+                const upperKey = lowerKey + (1 << (32 - 8 * (end - start)));
+                upper = binarySearch(this.roman_indexes, lower, upper, upperKey);
+                if (upper < 0) {
+                    upper = -upper - 1;
+                }
+                end++;
+            }
+            if (end > romaji.length && upper - lower > 1) {
+                const set = new Set();
+                for (let i = lower; i < upper; i++) {
+                    const re = this.roman_entries[i];
+                    if (re.remain > 0) {
+                        let set2 = this.findRomanEntryPredicatively(romaji, end - 1 - re.remain);
+                        for (let re2 of set2) {
+                            if (re2.remain == 0) {
+                                set.add(re.hiragana + re2.hiragana);
+                            }
                         }
                     }
+                    else {
+                        set.add(re.hiragana);
+                    }
+                }
+                let list = new Array();
+                for (let e of set) {
+                    list.push(e);
+                }
+                if (list.length == 1) {
+                    return new RomajiPredictiveResult(hiragana + list[0], [""]);
                 }
                 else {
-                    set.add(re.hiragana);
+                    return new RomajiPredictiveResult(hiragana, list);
                 }
             }
-            return new RomajiPredictiveResult(hiragana.toString(), set);
-        }
-        if (lastFound >= 0) {
-            const entry = ROMAN_ENTRIES[lastFound];
-            hiragana = hiragana + entry.hiragana;
-            start = start + entry.roman.length - entry.remain;
-            end = start + 1;
-        }
-        else {
-            hiragana = hiragana + romaji.charAt(start);
-            start++;
-            end = start + 1;
+            if (lastFound >= 0) {
+                const entry = this.roman_entries[lastFound];
+                hiragana = hiragana + entry.hiragana;
+                start = start + entry.roman.length - entry.remain;
+                end = start + 1;
+            }
+            else {
+                hiragana = hiragana + romaji.charAt(start);
+                start++;
+                end = start + 1;
+            }
         }
+        return new RomajiPredictiveResult(hiragana, [""]);
     }
-    return new RomajiPredictiveResult(hiragana.toString(), new Set([""]));
 }
 
 exports.BitList = BitList;
@@ -1984,18 +1997,16 @@ exports.DoubleArray = DoubleArray;
 exports.LOUDSTrie = LOUDSTrie;
 exports.LOUDSTrieBuilder = LOUDSTrieBuilder;
 exports.Migemo = Migemo;
-exports.RomajiPredictiveResult = RomajiPredictiveResult$1;
+exports.RomajiPredictiveResult = RomajiPredictiveResult;
+exports.RomajiProcessor1 = RomajiProcessor1;
 exports.RomajiProcessor2 = RomajiProcessor2;
+exports.RomanEntry = RomanEntry;
 exports.TernaryRegexGenerator = TernaryRegexGenerator;
 exports.binarySearch = binarySearch;
 exports.binarySearchString = binarySearchString;
 exports.binarySearchUint16 = binarySearchUint16;
 exports.bitCount = bitCount;
-exports.findRomanEntryPredicatively = findRomanEntryPredicatively;
 exports.han2zen_conv = han2zen_conv;
 exports.hira2kata_conv = hira2kata_conv;
 exports.numberOfTrailingZeros = numberOfTrailingZeros;
-exports.romajiToHiragana = romajiToHiragana;
-exports.romajiToHiraganaPredictively = romajiToHiraganaPredictively;
 exports.zen2han_conv = zen2han_conv;
-//# sourceMappingURL=jsmigemo.cjs.map

package/dist/jsmigemo.d.ts

@@ -83,30 +83,26 @@ declare class LOUDSTrieBuilder {
     static build(keys: string[]): [LOUDSTrie, Uint32Array];
 }
 
-declare class RomajiPredictiveResult$1 {
+declare class RomajiPredictiveResult {
     prefix: string;
     suffixes: string[];
     constructor(prefix: string, suffixes: string[]);
 }
-declare class RomajiProcessor2 {
-    trie: DoubleArray;
-    hiraganaList: Array<string>;
-    remainList: Int8Array;
-    constructor(trie: DoubleArray, hiraganaList: string[], remainList: Int8Array);
-    static buildProcessor(): RomajiProcessor2;
+interface RomajiProcessor {
     romajiToHiragana(romaji: string): string;
-    romajiToHiraganaPredictively(romaji: string): RomajiPredictiveResult$1;
+    romajiToHiraganaPredictively(romaji: string): RomajiPredictiveResult;
 }
 
 declare class Migemo {
     dict: CompactDictionary | null;
     rxop: Array<string> | null;
-    processor: RomajiProcessor2;
+    processor: RomajiProcessor;
     constructor();
     queryAWord(word: string): string;
     query(word: string): string;
     setDict(dict: CompactDictionary | null): void;
     setRxop(rxop: [string] | null): void;
+    setRomajiProcessor(processor: RomajiProcessor): void;
     parseQuery(query: string): IterableIterator<string>;
 }
 
@@ -119,14 +115,25 @@ declare class RomanEntry {
     static _calculateIndex(roman: string, start: number, end: number): number;
     static calculateIndex(roman: string): number;
 }
-declare class RomajiPredictiveResult {
-    estaglishedHiragana: string;
-    predictiveSuffixes: Set<string>;
-    constructor(estaglishedHiragana: string, predictiveSuffixes: Set<string>);
-}
-declare function romajiToHiragana(romaji: string): string;
-declare function findRomanEntryPredicatively(roman: string, offset: number): Set<RomanEntry>;
-declare function romajiToHiraganaPredictively(romaji: string): RomajiPredictiveResult;
+declare class RomajiProcessor1 implements RomajiProcessor {
+    private roman_indexes;
+    private roman_entries;
+    constructor(entries: RomanEntry[]);
+    static build(): RomajiProcessor1;
+    romajiToHiragana(romaji: string): string;
+    findRomanEntryPredicatively(roman: string, offset: number): Set<RomanEntry>;
+    romajiToHiraganaPredictively(romaji: string): RomajiPredictiveResult;
+}
+
+declare class RomajiProcessor2 implements RomajiProcessor {
+    trie: DoubleArray;
+    hiraganaList: Array<string>;
+    remainList: Int8Array;
+    constructor(trie: DoubleArray, hiraganaList: string[], remainList: Int8Array);
+    static build(): RomajiProcessor2;
+    romajiToHiragana(romaji: string): string;
+    romajiToHiraganaPredictively(romaji: string): RomajiPredictiveResult;
+}
 
 declare class TernaryRegexNode {
     value: number;
@@ -160,4 +167,4 @@ declare function binarySearchString(a: string[], fromIndex: number, toIndex: num
 declare function bitCount(i: number): number;
 declare function numberOfTrailingZeros(i: number): number;
 
-export { BitList, BitVector, CompactDictionary, CompactDictionaryBuilder, CompactHiraganaString, DoubleArray, LOUDSTrie, LOUDSTrieBuilder, Migemo, RomajiPredictiveResult$1 as RomajiPredictiveResult, RomajiProcessor2, TernaryRegexGenerator, binarySearch, binarySearchString, binarySearchUint16, bitCount, findRomanEntryPredicatively, han2zen_conv, hira2kata_conv, numberOfTrailingZeros, romajiToHiragana, romajiToHiraganaPredictively, zen2han_conv };
+export { BitList, BitVector, CompactDictionary, CompactDictionaryBuilder, CompactHiraganaString, DoubleArray, LOUDSTrie, LOUDSTrieBuilder, Migemo, RomajiPredictiveResult, RomajiProcessor, RomajiProcessor1, RomajiProcessor2, RomanEntry, TernaryRegexGenerator, binarySearch, binarySearchString, binarySearchUint16, bitCount, han2zen_conv, hira2kata_conv, numberOfTrailingZeros, zen2han_conv };