jsmigemo 0.3.1

package/lib/CompactDictionaryBuilder.js

@@ -0,0 +1,122 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.CompactDictionaryBuilder = void 0;
+const LOUDSTrieBuilder_1 = require("./LOUDSTrieBuilder");
+const CompactHiraganaString_1 = require("./CompactHiraganaString");
+const BitList_1 = require("./BitList");
+class CompactDictionaryBuilder {
+    static build(dict) {
+        // remove some keys
+        const keysToRemove = new Array();
+        for (const key of dict.keys()) {
+            try {
+                CompactHiraganaString_1.CompactHiraganaString.encodeString(key);
+            }
+            catch (e) {
+                keysToRemove.push(key);
+                console.log("skipped the world: " + key);
+            }
+        }
+        for (const key of keysToRemove) {
+            dict.delete(key);
+        }
+        // build key trie
+        const keys = Array.from(dict.keys()).sort();
+        const keyTrie = LOUDSTrieBuilder_1.LOUDSTrieBuilder.build(keys)[0];
+        // build value trie
+        const valuesSet = new Set();
+        for (const value of dict.values()) {
+            for (const v of value) {
+                valuesSet.add(v);
+            }
+        }
+        const values = Array.from(valuesSet.values()).sort();
+        const valueTrie = LOUDSTrieBuilder_1.LOUDSTrieBuilder.build(values)[0];
+        // build trie mapping
+        let mappingCount = 0;
+        for (const i of dict.values()) {
+            mappingCount += i.length;
+        }
+        const mapping = new Uint32Array(mappingCount);
+        let mappingIndex = 0;
+        const mappingBitList = new BitList_1.BitList();
+        for (let i = 1; i <= keyTrie.size(); i++) {
+            let key = keyTrie.reverseLookup(i);
+            mappingBitList.add(false);
+            let values = dict.get(key);
+            if (values != undefined) {
+                for (let j = 0; j < values.length; j++) {
+                    mappingBitList.add(true);
+                    mapping[mappingIndex] = valueTrie.lookup(values[j]);
+                    mappingIndex++;
+                }
+            }
+        }
+        // calculate output size
+        const keyTrieDataSize = 8 + keyTrie.edges.length + ((keyTrie.bitVector.size() + 63) >>> 6) * 8;
+        const valueTrieDataSize = 8 + valueTrie.edges.length * 2 + ((valueTrie.bitVector.size() + 63) >>> 6) * 8;
+        const mappingDataSize = 8 + ((mappingBitList.size + 63) >>> 6) * 8 + mapping.length * 4;
+        const outputDataSize = keyTrieDataSize + valueTrieDataSize + mappingDataSize;
+        // ready output
+        const arrayBuffer = new ArrayBuffer(outputDataSize);
+        const dataView = new DataView(arrayBuffer);
+        let dataViewIndex = 0;
+        // output key trie
+        dataView.setInt32(dataViewIndex, keyTrie.edges.length);
+        dataViewIndex += 4;
+        for (let i = 0; i < keyTrie.edges.length; i++) {
+            const compactChar = CompactHiraganaString_1.CompactHiraganaString.encodeChar(keyTrie.edges[i]);
+            dataView.setUint8(dataViewIndex, compactChar);
+            dataViewIndex += 1;
+        }
+        dataView.setInt32(dataViewIndex, keyTrie.bitVector.size());
+        dataViewIndex += 4;
+        const keyTrieBitVectorWords = keyTrie.bitVector.words;
+        for (let i = 0; i < keyTrieBitVectorWords.length >>> 1; i++) {
+            dataView.setUint32(dataViewIndex, keyTrieBitVectorWords[i * 2 + 1]);
+            dataViewIndex += 4;
+            dataView.setUint32(dataViewIndex, keyTrieBitVectorWords[i * 2]);
+            dataViewIndex += 4;
+        }
+        // output value trie
+        dataView.setInt32(dataViewIndex, valueTrie.edges.length);
+        dataViewIndex += 4;
+        for (let i = 0; i < valueTrie.edges.length; i++) {
+            dataView.setUint16(dataViewIndex, valueTrie.edges[i]);
+            dataViewIndex += 2;
+        }
+        dataView.setInt32(dataViewIndex, valueTrie.bitVector.size());
+        dataViewIndex += 4;
+        const valueTrieBitVectorWords = valueTrie.bitVector.words;
+        for (let i = 0; i < valueTrieBitVectorWords.length >>> 1; i++) {
+            dataView.setUint32(dataViewIndex, valueTrieBitVectorWords[i * 2 + 1]);
+            dataViewIndex += 4;
+            dataView.setUint32(dataViewIndex, valueTrieBitVectorWords[i * 2]);
+            dataViewIndex += 4;
+        }
+        // output mapping
+        dataView.setInt32(dataViewIndex, mappingBitList.size);
+        dataViewIndex += 4;
+        const mappingWordsLen = (mappingBitList.size + 63) >> 6;
+        for (let i = 0; i < mappingWordsLen; i++) {
+            dataView.setUint32(dataViewIndex, mappingBitList.words[i * 2 + 1]);
+            dataViewIndex += 4;
+            dataView.setUint32(dataViewIndex, mappingBitList.words[i * 2]);
+            dataViewIndex += 4;
+        }
+        // TODO: padding to 64bit words
+        dataView.setInt32(dataViewIndex, mapping.length);
+        dataViewIndex += 4;
+        for (let i = 0; i < mapping.length; i++) {
+            dataView.setUint32(dataViewIndex, mapping[i]);
+            dataViewIndex += 4;
+        }
+        // check data size
+        if (dataViewIndex !== outputDataSize) {
+            throw new Error(`file size is not valid: expected=${outputDataSize} actual=${dataViewIndex}`);
+        }
+        return arrayBuffer;
+    }
+}
+exports.CompactDictionaryBuilder = CompactDictionaryBuilder;
+//# sourceMappingURL=CompactDictionaryBuilder.js.map

package/lib/CompactDictionaryBuilder.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"CompactDictionaryBuilder.js","sourceRoot":"","sources":["../src/CompactDictionaryBuilder.ts"],"names":[],"mappings":";;;AAAA,yDAAsD;AACtD,mEAAgE;AAChE,uCAAoC;AAEpC,MAAa,wBAAwB;IAC1B,MAAM,CAAC,KAAK,CAAC,IAA2B;QAC3C,mBAAmB;QACnB,MAAM,YAAY,GAAG,IAAI,KAAK,EAAU,CAAC;QACzC,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,IAAI,EAAE,EAAE;YAC3B,IAAI;gBACA,6CAAqB,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;aAC3C;YAAC,OAAO,CAAC,EAAE;gBACR,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBACvB,OAAO,CAAC,GAAG,CAAC,qBAAqB,GAAG,GAAG,CAAC,CAAC;aAC5C;SACJ;QACD,KAAK,MAAM,GAAG,IAAI,YAAY,EAAE;YAC5B,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;SACpB;QAED,iBAAiB;QACjB,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;QAC5C,MAAM,OAAO,GAAG,mCAAgB,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAEhD,mBAAmB;QACnB,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;QACpC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,EAAE,EAAE;YAC/B,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE;gBACnB,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;aACpB;SACJ;QACD,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;QACrD,MAAM,SAAS,GAAG,mCAAgB,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QAEpD,qBAAqB;QACrB,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,EAAE;YAC3B,YAAY,IAAI,CAAC,CAAC,MAAM,CAAC;SAC5B;QACD,MAAM,OAAO,GAAG,IAAI,WAAW,CAAC,YAAY,CAAC,CAAC;QAC9C,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,MAAM,cAAc,GAAG,IAAI,iBAAO,EAAE,CAAC;QACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE;YACtC,IAAI,GAAG,GAAG,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;YACnC,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YAC1B,IAAI,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAC3B,IAAI,MAAM,IAAI,SAAS,EAAE;gBACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;oBACpC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;oBACzB,OAAO,CAAC,YAAY,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;oBACpD,YAAY,EAAE,CAAC;iBAClB;aACJ;SACJ;QAED,wBAAwB;QACxB,MAAM,eAAe,GAAG,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC;QAC/F,MAAM,iBAAiB,GAAG,CAAC,GAAG,SAAS,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,SAAS,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC;QACzG,MAAM,eAAe,GAAG,CAAC,GAAG,CAAC,CAAC,cAAc,CAAC,IAAI,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;QACxF,MAAM,cAAc,GAAG,eAAe,GAAG,iBAAiB,GAAG,eAAe,CAAC;QAE7E,eAAe;QACf,MAAM,WAAW,GAAG,IAAI,WAAW,CAAC,cAAc,CAAC,CAAC;QACpD,MAAM,QAAQ,GAAG,IAAI,QAAQ,CAAC,WAAW,CAAC,CAAC;QAC3C,IAAI,aAAa,GAAG,CAAC,CAAC;QAEtB,kBAAkB;QAClB,QAAQ,CAAC,QAAQ,CAAC,aAAa,EAAE,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QACvD,aAAa,IAAI,CAAC,CAAC;QACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAC3C,MAAM,WAAW,GAAG,6CAAqB,CAAC,UAAU,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YACvE,QAAQ,CAAC,QAAQ,CAAC,aAAa,EAAE,WAAW,CAAC,CAAC;YAC9C,aAAa,IAAI,CAAC,CAAC;SACtB;QACD,QAAQ,CAAC,QAAQ,CAAC,aAAa,EAAE,OAAO,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC;QAC3D,aAAa,IAAI,CAAC,CAAC;QACnB,MAAM,qBAAqB,GAAG,OAAO,CAAC,SAAS,CAAC,KAAK,CAAC;QACtD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,qBAAqB,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC,EAAE,EAAE;YACzD,QAAQ,CAAC,SAAS,CAAC,aAAa,EAAE,qBAAqB,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACpE,aAAa,IAAI,CAAC,CAAC;YACnB,QAAQ,CAAC,SAAS,CAAC,aAAa,EAAE,qBAAqB,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAChE,aAAa,IAAI,CAAC,CAAC;SACtB;QAED,oBAAoB;QACpB,QAAQ,CAAC,QAAQ,CAAC,aAAa,EAAE,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QACzD,aAAa,IAAI,CAAC,CAAC;QACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAC7C,QAAQ,CAAC,SAAS,CAAC,aAAa,EAAE,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YACtD,aAAa,IAAI,CAAC,CAAC;SACtB;QACD,QAAQ,CAAC,QAAQ,CAAC,aAAa,EAAE,SAAS,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC;QAC7D,aAAa,IAAI,CAAC,CAAC;QACnB,MAAM,uBAAuB,GAAG,SAAS,CAAC,SAAS,CAAC,KAAK,CAAC;QAC1D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,uBAAuB,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC,EAAE,EAAE;YAC3D,QAAQ,CAAC,SAAS,CAAC,aAAa,EAAE,uBAAuB,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACtE,aAAa,IAAI,CAAC,CAAC;YACnB,QAAQ,CAAC,SAAS,CAAC,aAAa,EAAE,uBAAuB,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAClE,aAAa,IAAI,CAAC,CAAC;SACtB;QAED,iBAAiB;QACjB,QAAQ,CAAC,QAAQ,CAAC,aAAa,EAAE,cAAc,CAAC,IAAI,CAAC,CAAC;QACtD,aAAa,IAAI,CAAC,CAAC;QACnB,MAAM,eAAe,GAAG,CAAC,cAAc,CAAC,IAAI,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;QACxD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,EAAE,CAAC,EAAE,EAAE;YACtC,QAAQ,CAAC,SAAS,CAAC,aAAa,EAAE,cAAc,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACnE,aAAa,IAAI,CAAC,CAAC;YACnB,QAAQ,CAAC,SAAS,CAAC,aAAa,EAAE,cAAc,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC/D,aAAa,IAAI,CAAC,CAAC;SACtB;QACD,+BAA+B;QAC/B,QAAQ,CAAC,QAAQ,CAAC,aAAa,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC;QACjD,aAAa,IAAI,CAAC,CAAC;QACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACrC,QAAQ,CAAC,SAAS,CAAC,aAAa,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;YAC9C,aAAa,IAAI,CAAC,CAAC;SACtB;QAED,kBAAkB;QAClB,IAAI,aAAa,KAAK,cAAc,EAAE;YAClC,MAAM,IAAI,KAAK,CAAC,oCAAoC,cAAc,WAAW,aAAa,EAAE,CAAC,CAAC;SACjG;QAED,OAAO,WAAW,CAAC;IACvB,CAAC;CACJ;AA1HD,4DA0HC"}

package/lib/CompactHiraganaString.d.ts

@@ -0,0 +1,6 @@
+export declare class CompactHiraganaString {
+    static decodeBytes(bytes: Uint8Array): string;
+    static decodeByte(c: number): string;
+    static encodeString(str: string): Uint8Array;
+    static encodeChar(b: number): number;
+}

package/lib/CompactHiraganaString.js

@@ -0,0 +1,45 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.CompactHiraganaString = void 0;
+class CompactHiraganaString {
+    static decodeBytes(bytes) {
+        let result = "";
+        for (let i = 0; i < bytes.length; i++) {
+            result += CompactHiraganaString.decodeByte(bytes[i]);
+        }
+        return result;
+    }
+    static decodeByte(c) {
+        if (0x20 <= c && c <= 0x7e) {
+            return String.fromCharCode(c);
+        }
+        if (0xa1 <= c && c <= 0xf6) {
+            return String.fromCharCode(c + 0x3040 - 0xa0);
+        }
+        throw new RangeError();
+    }
+    static encodeString(str) {
+        const result = new Uint8Array(str.length);
+        for (let i = 0; i < str.length; i++) {
+            result[i] = CompactHiraganaString.encodeChar(str.charCodeAt(i));
+        }
+        return result;
+    }
+    static encodeChar(b) {
+        if (b == 0) {
+            return 0;
+        }
+        if (0x20 <= b && b <= 0x7e) {
+            return b;
+        }
+        if (0x3041 <= b && b <= 0x3096) {
+            return b - 0x3040 + 0xa0;
+        }
+        if (0x30fc === b) {
+            return b - 0x3040 + 0xa0;
+        }
+        throw new RangeError('unknown character to encode: ' + b);
+    }
+}
+exports.CompactHiraganaString = CompactHiraganaString;
+//# sourceMappingURL=CompactHiraganaString.js.map

package/lib/CompactHiraganaString.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"CompactHiraganaString.js","sourceRoot":"","sources":["../src/CompactHiraganaString.ts"],"names":[],"mappings":";;;AACA,MAAa,qBAAqB;IACvB,MAAM,CAAC,WAAW,CAAC,KAAiB;QACvC,IAAI,MAAM,GAAG,EAAE,CAAC;QAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACnC,MAAM,IAAI,qBAAqB,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;SACxD;QACD,OAAO,MAAM,CAAC;IAClB,CAAC;IAEM,MAAM,CAAC,UAAU,CAAC,CAAS;QAC9B,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,EAAE;YACxB,OAAO,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;SACjC;QACD,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,EAAE;YACxB,OAAO,MAAM,CAAC,YAAY,CAAC,CAAC,GAAG,MAAM,GAAG,IAAI,CAAC,CAAC;SACjD;QACD,MAAM,IAAI,UAAU,EAAE,CAAC;IAC3B,CAAC;IAEM,MAAM,CAAC,YAAY,CAAC,GAAW;QAClC,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACjC,MAAM,CAAC,CAAC,CAAC,GAAG,qBAAqB,CAAC,UAAU,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;SACnE;QACD,OAAO,MAAM,CAAC;IAClB,CAAC;IAEM,MAAM,CAAC,UAAU,CAAC,CAAS;QAC9B,IAAI,CAAC,IAAI,CAAC,EAAE;YACR,OAAO,CAAC,CAAC;SACZ;QACD,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,EAAE;YACxB,OAAO,CAAC,CAAC;SACZ;QACD,IAAI,MAAM,IAAI,CAAC,IAAI,CAAC,IAAI,MAAM,EAAE;YAC5B,OAAO,CAAC,GAAG,MAAM,GAAG,IAAI,CAAC;SAC5B;QACD,IAAI,MAAM,KAAK,CAAC,EAAE;YACd,OAAO,CAAC,GAAG,MAAM,GAAG,IAAI,CAAC;SAC5B;QACD,MAAM,IAAI,UAAU,CAAC,+BAA+B,GAAG,CAAC,CAAC,CAAC;IAC9D,CAAC;CACJ;AA1CD,sDA0CC"}

package/lib/DoubleArray.d.ts

@@ -0,0 +1,12 @@
+export declare class DoubleArray {
+    base: Int16Array;
+    check: Int16Array;
+    charConverter: (arg: number) => number;
+    charSize: number;
+    constructor(base: Int16Array, check: Int16Array, charConverter: (arg: number) => number, charSize: number);
+    traverse(n: number, k: number): number;
+    lookup(str: string): number;
+    commonPrefixSearch(key: string): IterableIterator<number>;
+    predictiveSearch(key: string): IterableIterator<number>;
+    visitRecursive(n: number): IterableIterator<number>;
+}

package/lib/DoubleArray.js

@@ -0,0 +1,74 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.DoubleArray = void 0;
+class DoubleArray {
+    constructor(base, check, charConverter, charSize) {
+        this.base = base;
+        this.check = check;
+        this.charConverter = charConverter;
+        this.charSize = charSize;
+    }
+    traverse(n, k) {
+        const m = this.base[n] + k;
+        if (this.check[m] == n) {
+            return m;
+        }
+        else {
+            return -1;
+        }
+    }
+    lookup(str) {
+        if (str.length == 0) {
+            return 0;
+        }
+        let n = 0;
+        for (let i = 0; i < str.length; i++) {
+            const c = this.charConverter(str.charCodeAt(i));
+            if (c < 1) {
+                throw new Error();
+            }
+            n = this.traverse(n, c);
+            if (n == -1) {
+                return -1;
+            }
+        }
+        return n;
+    }
+    *commonPrefixSearch(key) {
+        let index = 0;
+        let offset = 0;
+        while (index != -1) {
+            const lastIndex = index;
+            if (offset == key.length) {
+                index = -1;
+            }
+            else {
+                const c = this.charConverter(key.charCodeAt(offset));
+                index = this.traverse(index, c);
+                offset++;
+            }
+            yield lastIndex;
+        }
+    }
+    *predictiveSearch(key) {
+        const n = this.lookup(key);
+        if (n == -1) {
+            return;
+        }
+        yield* this.visitRecursive(n);
+    }
+    *visitRecursive(n) {
+        yield n;
+        for (let i = 0; i < this.charSize; i++) {
+            const m = this.base[n] + i + 1;
+            if (m >= this.check.length) {
+                return;
+            }
+            if (this.check[m] == n) {
+                yield* this.visitRecursive(m);
+            }
+        }
+    }
+}
+exports.DoubleArray = DoubleArray;
+//# sourceMappingURL=DoubleArray.js.map

package/lib/DoubleArray.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"DoubleArray.js","sourceRoot":"","sources":["../src/DoubleArray.ts"],"names":[],"mappings":";;;AAAA,MAAa,WAAW;IAMpB,YAAY,IAAgB,EAAE,KAAiB,EAAE,aAAoC,EAAE,QAAgB;QACnG,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,aAAa,GAAG,aAAa,CAAC;QACnC,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;IAC7B,CAAC;IAEM,QAAQ,CAAC,CAAS,EAAE,CAAS;QAChC,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE;YACpB,OAAO,CAAC,CAAC;SACZ;aAAM;YACH,OAAO,CAAC,CAAC,CAAC;SACb;IACL,CAAC;IAEM,MAAM,CAAC,GAAW;QACrB,IAAI,GAAG,CAAC,MAAM,IAAI,CAAC,EAAE;YACjB,OAAO,CAAC,CAAC;SACZ;QACD,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACjC,MAAM,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAA;YAC/C,IAAI,CAAC,GAAG,CAAC,EAAE;gBACP,MAAM,IAAI,KAAK,EAAE,CAAC;aACrB;YACD,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACxB,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE;gBACT,OAAO,CAAC,CAAC,CAAC;aACb;SACJ;QACD,OAAO,CAAC,CAAC;IACb,CAAC;IAEM,CAAC,kBAAkB,CAAC,GAAW;QAClC,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,OAAO,KAAK,IAAI,CAAC,CAAC,EAAE;YAChB,MAAM,SAAS,GAAG,KAAK,CAAC;YACxB,IAAI,MAAM,IAAI,GAAG,CAAC,MAAM,EAAE;gBACtB,KAAK,GAAG,CAAC,CAAC,CAAC;aACd;iBAAM;gBACH,MAAM,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC;gBACrD,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;gBAChC,MAAM,EAAE,CAAC;aACZ;YACD,MAAM,SAAS,CAAC;SACnB;IACL,CAAC;IAEM,CAAC,gBAAgB,CAAC,GAAW;QAChC,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE;YACT,OAAO;SACV;QACD,KAAM,CAAC,CAAA,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;IAClC,CAAC;IAEM,CAAC,cAAc,CAAC,CAAS;QAC5B,MAAM,CAAC,CAAC;QACR,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC,EAAE,EAAE;YACpC,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAC/B,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE;gBACxB,OAAO;aACV;YACD,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE;gBACpB,KAAM,CAAC,CAAA,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;aACjC;SACJ;IACL,CAAC;CAEJ;AA7ED,kCA6EC"}

package/lib/LOUDSTrie.d.ts

@@ -0,0 +1,13 @@
+import { BitVector } from "./BitVector";
+export declare class LOUDSTrie {
+    bitVector: BitVector;
+    edges: Uint16Array;
+    constructor(bitVector: BitVector, edges: Uint16Array);
+    reverseLookup(index: number): string;
+    parent(x: number): number;
+    firstChild(x: number): number;
+    traverse(index: number, c: number): number;
+    lookup(key: string): number;
+    predictiveSearch(index: number): IterableIterator<number>;
+    size(): number;
+}

package/lib/LOUDSTrie.js

@@ -0,0 +1,71 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.LOUDSTrie = void 0;
+const utils_1 = require("./utils");
+class LOUDSTrie {
+    constructor(bitVector, edges) {
+        this.bitVector = bitVector;
+        this.edges = edges;
+    }
+    reverseLookup(index) {
+        if (index <= 0 || this.edges.length <= index) {
+            throw new RangeError();
+        }
+        let sb = new Array();
+        while (index > 1) {
+            sb.push(this.edges[index]);
+            index = this.parent(index);
+        }
+        return sb.reverse().map(v => String.fromCharCode(v)).join('');
+    }
+    parent(x) {
+        return this.bitVector.rank(this.bitVector.select(x, true), false);
+    }
+    firstChild(x) {
+        let y = this.bitVector.select(x, false) + 1;
+        if (this.bitVector.get(y)) {
+            return this.bitVector.rank(y, true) + 1;
+        }
+        else {
+            return -1;
+        }
+    }
+    traverse(index, c) {
+        let 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 = (0, utils_1.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);
+            nodeIndex = this.traverse(nodeIndex, c);
+            if (nodeIndex == -1) {
+                break;
+            }
+        }
+        return (nodeIndex >= 0) ? nodeIndex : -1;
+    }
+    *predictiveSearch(index) {
+        let lower = index;
+        let upper = index + 1;
+        while (upper - lower > 0) {
+            for (let i = lower; i < upper; i++) {
+                yield i;
+            }
+            lower = this.bitVector.rank(this.bitVector.select(lower, false) + 1, true) + 1;
+            upper = this.bitVector.rank(this.bitVector.select(upper, false) + 1, true) + 1;
+        }
+    }
+    size() {
+        return this.edges.length - 2;
+    }
+}
+exports.LOUDSTrie = LOUDSTrie;
+//# sourceMappingURL=LOUDSTrie.js.map

package/lib/LOUDSTrie.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"LOUDSTrie.js","sourceRoot":"","sources":["../src/LOUDSTrie.ts"],"names":[],"mappings":";;;AAAA,mCAA6C;AAG7C,MAAa,SAAS;IAIlB,YAAY,SAAoB,EAAE,KAAkB;QAChD,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACvB,CAAC;IAED,aAAa,CAAC,KAAa;QACvB,IAAI,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,IAAI,KAAK,EAAE;YAC1C,MAAM,IAAI,UAAU,EAAE,CAAC;SAC1B;QACD,IAAI,EAAE,GAAG,IAAI,KAAK,EAAU,CAAC;QAC7B,OAAO,KAAK,GAAG,CAAC,EAAE;YACd,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;YAC3B,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;SAC9B;QACD,OAAO,EAAE,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAClE,CAAC;IAED,MAAM,CAAC,CAAS;QACZ,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,KAAK,CAAC,CAAC;IACtE,CAAC;IAED,UAAU,CAAC,CAAS;QAChB,IAAI,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;QAC5C,IAAI,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;YACvB,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;SAC3C;aAAM;YACH,OAAO,CAAC,CAAC,CAAC;SACb;IACL,CAAC;IAED,QAAQ,CAAC,KAAa,EAAE,CAAS;QAC7B,IAAI,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QACxC,IAAI,UAAU,IAAI,CAAC,CAAC,EAAE;YAClB,OAAO,CAAC,CAAC,CAAC;SACb;QACD,IAAI,aAAa,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QAC5D,IAAI,WAAW,GAAG,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,aAAa,CAAC,CAAC;QAC7D,IAAI,SAAS,GAAG,WAAW,GAAG,aAAa,CAAC;QAC5C,IAAI,MAAM,GAAG,IAAA,0BAAkB,EAAC,IAAI,CAAC,KAAK,EAAE,UAAU,EAAE,UAAU,GAAG,SAAS,EAAE,CAAC,CAAC,CAAC;QACnF,OAAO,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACrC,CAAC;IAED,MAAM,CAAC,GAAW;QACd,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACjC,IAAI,CAAC,GAAG,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YAC1B,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;YACxC,IAAI,SAAS,IAAI,CAAC,CAAC,EAAE;gBACjB,MAAM;aACT;SACJ;QACD,OAAO,CAAC,SAAS,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7C,CAAC;IAED,CAAC,gBAAgB,CAAC,KAAa;QAC3B,IAAI,KAAK,GAAG,KAAK,CAAC;QAClB,IAAI,KAAK,GAAG,KAAK,GAAG,CAAC,CAAC;QACtB,OAAO,KAAK,GAAG,KAAK,GAAG,CAAC,EAAE;YACtB,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE;gBAChC,MAAM,CAAC,CAAC;aACX;YACD,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;YAC/E,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;SAClF;IACL,CAAC;IAED,IAAI;QACA,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IACjC,CAAC;CACJ;AAzED,8BAyEC"}

package/lib/LOUDSTrieBuilder.d.ts

@@ -0,0 +1,4 @@
+import { LOUDSTrie } from "./LOUDSTrie";
+export declare class LOUDSTrieBuilder {
+    static build(keys: string[]): [LOUDSTrie, Uint32Array];
+}

package/lib/LOUDSTrieBuilder.js

@@ -0,0 +1,73 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.LOUDSTrieBuilder = void 0;
+const LOUDSTrie_1 = require("./LOUDSTrie");
+const BitVector_1 = require("./BitVector");
+const BitList_1 = require("./BitList");
+class LOUDSTrieBuilder {
+    static build(keys) {
+        for (let i = 0; i < keys.length; i++) {
+            if (keys[i] == null) {
+                throw new Error();
+            }
+            if (i > 0 && keys[i - 1] > keys[i]) {
+                throw new Error();
+            }
+        }
+        const nodes = new Uint32Array(keys.length);
+        for (let i = 0; i < nodes.length; i++) {
+            nodes[i] = 1;
+        }
+        let cursor = 0;
+        let currentNode = 1;
+        let edges = "  ";
+        const louds = new BitList_1.BitList();
+        louds.add(true);
+        while (true) {
+            let lastChar = 0;
+            let lastParent = 0;
+            let restKeys = 0;
+            for (let i = 0; i < keys.length; i++) {
+                if (keys[i].length < cursor) {
+                    continue;
+                }
+                if (keys[i].length == cursor) {
+                    louds.add(false);
+                    lastParent = nodes[i];
+                    lastChar = 0;
+                    continue;
+                }
+                const currentChar = keys[i].charCodeAt(cursor);
+                const currentParent = nodes[i];
+                if (lastParent != currentParent) {
+                    louds.add(false);
+                    louds.add(true);
+                    edges += String.fromCharCode(currentChar);
+                    currentNode = currentNode + 1;
+                }
+                else if (lastChar != currentChar) {
+                    louds.add(true);
+                    edges += String.fromCharCode(currentChar);
+                    currentNode = currentNode + 1;
+                }
+                nodes[i] = currentNode;
+                lastChar = currentChar;
+                lastParent = currentParent;
+                restKeys++;
+            }
+            if (restKeys == 0) {
+                break;
+            }
+            cursor++;
+        }
+        const bitVectorWords = new Uint32Array(louds.words.buffer, 0, ((louds.size + 63) >> 6) * 2);
+        const bitVector = new BitVector_1.BitVector(bitVectorWords, louds.size);
+        const uint16Edges = new Uint16Array(edges.length);
+        for (let i = 0; i < edges.length; i++) {
+            uint16Edges[i] = edges.charCodeAt(i);
+        }
+        return [new LOUDSTrie_1.LOUDSTrie(bitVector, uint16Edges), nodes];
+    }
+}
+exports.LOUDSTrieBuilder = LOUDSTrieBuilder;
+//# sourceMappingURL=LOUDSTrieBuilder.js.map

package/lib/LOUDSTrieBuilder.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"LOUDSTrieBuilder.js","sourceRoot":"","sources":["../src/LOUDSTrieBuilder.ts"],"names":[],"mappings":";;;AAAA,2CAAwC;AACxC,2CAAwC;AACxC,uCAAoC;AAEpC,MAAa,gBAAgB;IACzB,MAAM,CAAC,KAAK,CAAC,IAAc;QACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAClC,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE;gBACjB,MAAM,IAAI,KAAK,EAAE,CAAC;aACrB;YACD,IAAI,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,EAAE;gBAChC,MAAM,IAAI,KAAK,EAAE,CAAC;aACrB;SACJ;QACD,MAAM,KAAK,GAAG,IAAI,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;QAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACnC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;SAChB;QACD,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,IAAI,KAAK,GAAG,IAAI,CAAC;QACjB,MAAM,KAAK,GAAG,IAAI,iBAAO,EAAE,CAAC;QAC5B,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAChB,OAAO,IAAI,EAAE;YACT,IAAI,QAAQ,GAAG,CAAC,CAAC;YACjB,IAAI,UAAU,GAAG,CAAC,CAAC;YACnB,IAAI,QAAQ,GAAG,CAAC,CAAC;YACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBAClC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,MAAM,EAAE;oBACzB,SAAS;iBACZ;gBACD,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,IAAI,MAAM,EAAE;oBAC1B,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;oBACjB,UAAU,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;oBACtB,QAAQ,GAAG,CAAC,CAAC;oBACb,SAAS;iBACZ;gBACD,MAAM,WAAW,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;gBAC/C,MAAM,aAAa,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;gBAC/B,IAAI,UAAU,IAAI,aAAa,EAAE;oBAC7B,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;oBACjB,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;oBAChB,KAAK,IAAI,MAAM,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC;oBAC1C,WAAW,GAAG,WAAW,GAAG,CAAC,CAAC;iBACjC;qBAAM,IAAI,QAAQ,IAAI,WAAW,EAAE;oBAChC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;oBAChB,KAAK,IAAI,MAAM,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC;oBAC1C,WAAW,GAAG,WAAW,GAAG,CAAC,CAAC;iBACjC;gBACD,KAAK,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC;gBACvB,QAAQ,GAAG,WAAW,CAAC;gBACvB,UAAU,GAAG,aAAa,CAAC;gBAC3B,QAAQ,EAAE,CAAC;aACd;YACD,IAAI,QAAQ,IAAI,CAAC,EAAE;gBACf,MAAM;aACT;YACD,MAAM,EAAE,CAAC;SACZ;QACD,MAAM,cAAc,GAAG,IAAI,WAAW,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,IAAI,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC5F,MAAM,SAAS,GAAG,IAAI,qBAAS,CAAC,cAAc,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;QAC5D,MAAM,WAAW,GAAG,IAAI,WAAW,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QAClD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAE,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAClC,WAAW,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;SACxC;QACD,OAAO,CAAC,IAAI,qBAAS,CAAC,SAAS,EAAE,WAAW,CAAC,EAAE,KAAK,CAAC,CAAC;IAC1D,CAAC;CACJ;AA/DD,4CA+DC"}

package/lib/Migemo.d.ts

@@ -0,0 +1,13 @@
+import { CompactDictionary } from "./CompactDictionary";
+import { RomajiProcessor2 } from "./RomajiProcessor2";
+export declare class Migemo {
+    dict: CompactDictionary | null;
+    rxop: Array<string> | null;
+    processor: RomajiProcessor2;
+    constructor();
+    queryAWord(word: string): string;
+    query(word: string): string;
+    setDict(dict: CompactDictionary | null): void;
+    setRxop(rxop: [string] | null): void;
+    parseQuery(query: string): IterableIterator<string>;
+}

package/lib/Migemo.js

@@ -0,0 +1,75 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.Migemo = void 0;
+const CharacterConverter_1 = require("./CharacterConverter");
+const TernaryRegexGenerator_1 = require("./TernaryRegexGenerator");
+const RomajiProcessor2_1 = require("./RomajiProcessor2");
+class Migemo {
+    constructor() {
+        this.dict = null;
+        this.rxop = null;
+        this.processor = RomajiProcessor2_1.RomajiProcessor2.buildProcessor();
+    }
+    queryAWord(word) {
+        const generator = this.rxop == null ? TernaryRegexGenerator_1.TernaryRegexGenerator.getDEFAULT() : new TernaryRegexGenerator_1.TernaryRegexGenerator(this.rxop[0], this.rxop[1], this.rxop[2], this.rxop[3], this.rxop[4], this.rxop[5]);
+        // query自信はもちろん候補に加える
+        generator.add(word);
+        // queryそのものでの辞書引き
+        const lower = word.toLowerCase();
+        if (this.dict != null) {
+            for (const word of this.dict.predictiveSearch(lower)) {
+                generator.add(word);
+            }
+        }
+        // queryを全角にして候補に加える
+        const zen = (0, CharacterConverter_1.han2zen_conv)(word);
+        generator.add(zen);
+        // queryを半角にして候補に加える
+        const han = (0, CharacterConverter_1.zen2han_conv)(word);
+        generator.add(han);
+        // 平仮名、カタカナ、及びそれによる辞書引き追加
+        const hiraganaResult = this.processor.romajiToHiraganaPredictively(lower);
+        for (const a of hiraganaResult.suffixes) {
+            const hira = hiraganaResult.prefix + a;
+            generator.add(hira);
+            // 平仮名による辞書引き
+            if (this.dict != null) {
+                for (const b of this.dict.predictiveSearch(hira)) {
+                    generator.add(b);
+                }
+            }
+            // 片仮名文字列を生成し候補に加える
+            const kata = (0, CharacterConverter_1.hira2kata_conv)(hira);
+            generator.add(kata);
+            // 半角カナを生成し候補に加える
+            generator.add((0, CharacterConverter_1.zen2han_conv)(kata));
+        }
+        return generator.generate();
+    }
+    query(word) {
+        if (word == "") {
+            return "";
+        }
+        const words = this.parseQuery(word);
+        let result = "";
+        for (const w of words) {
+            result += this.queryAWord(w);
+        }
+        return result;
+    }
+    setDict(dict) {
+        this.dict = dict;
+    }
+    setRxop(rxop) {
+        this.rxop = rxop;
+    }
+    *parseQuery(query) {
+        const re = /[^A-Z\s]+|[A-Z]{2,}|([A-Z][^A-Z\s]+)|([A-Z]\s*$)/g;
+        let myArray;
+        while ((myArray = re.exec(query)) !== null) {
+            yield myArray[0];
+        }
+    }
+}
+exports.Migemo = Migemo;
+//# sourceMappingURL=Migemo.js.map

package/lib/Migemo.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Migemo.js","sourceRoot":"","sources":["../src/Migemo.ts"],"names":[],"mappings":";;;AACA,6DAAgF;AAChF,mEAAgE;AAChE,yDAAsD;AACtD,MAAa,MAAM;IAIf;QACI,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,SAAS,GAAG,mCAAgB,CAAC,cAAc,EAAE,CAAC;IACvD,CAAC;IACD,UAAU,CAAC,IAAY;QACnB,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,6CAAqB,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,IAAI,6CAAqB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QACzL,qBAAqB;QACrB,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACpB,kBAAkB;QAClB,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QACjC,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,EAAE;YACnB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,EAAE;gBAClD,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;aACvB;SACJ;QACD,oBAAoB;QACpB,MAAM,GAAG,GAAG,IAAA,iCAAY,EAAC,IAAI,CAAC,CAAC;QAC/B,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACnB,oBAAoB;QACpB,MAAM,GAAG,GAAG,IAAA,iCAAY,EAAC,IAAI,CAAC,CAAC;QAC/B,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAEnB,yBAAyB;QACzB,MAAM,cAAc,GAAG,IAAI,CAAC,SAAS,CAAC,4BAA4B,CAAC,KAAK,CAAC,CAAC;QAC1E,KAAK,MAAM,CAAC,IAAI,cAAc,CAAC,QAAQ,EAAE;YACrC,MAAM,IAAI,GAAG,cAAc,CAAC,MAAM,GAAG,CAAC,CAAC;YACvC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACpB,aAAa;YACb,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,EAAE;gBACnB,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,EAAE;oBAC9C,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;iBACpB;aACJ;YACD,mBAAmB;YACnB,MAAM,IAAI,GAAG,IAAA,mCAAc,EAAC,IAAI,CAAC,CAAC;YAClC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACpB,iBAAiB;YACjB,SAAS,CAAC,GAAG,CAAC,IAAA,iCAAY,EAAC,IAAI,CAAC,CAAC,CAAC;SACrC;QACD,OAAO,SAAS,CAAC,QAAQ,EAAE,CAAC;IAChC,CAAC;IAED,KAAK,CAAC,IAAY;QACd,IAAI,IAAI,IAAI,EAAE,EAAE;YACZ,OAAO,EAAE,CAAC;SACb;QACD,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QACpC,IAAI,MAAM,GAAG,EAAE,CAAC;QAChB,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE;YACnB,MAAM,IAAI,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;SAChC;QACD,OAAO,MAAM,CAAC;IAClB,CAAC;IAED,OAAO,CAAC,IAA8B;QAClC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IACrB,CAAC;IAED,OAAO,CAAC,IAAqB;QACzB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IACrB,CAAC;IAED,CAAC,UAAU,CAAC,KAAa;QACrB,MAAM,EAAE,GAAG,mDAAmD,CAAC;QAC/D,IAAI,OAA6B,CAAC;QAClC,OAAO,CAAC,OAAO,GAAG,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,IAAI,EAAE;YACxC,MAAM,OAAO,CAAC,CAAC,CAAC,CAAC;SACpB;IACL,CAAC;CACJ;AA1ED,wBA0EC"}

package/lib/RegexGenerator.d.ts

@@ -0,0 +1,21 @@
+export declare class RegexNode {
+    code: string;
+    child: RegexNode | null;
+    next: RegexNode | null;
+    constructor(code: string);
+}
+export declare class RegexGenerator {
+    or: string;
+    beginGroup: string;
+    endGroup: string;
+    beginClass: string;
+    endClass: string;
+    newline: string;
+    root: RegexNode | null;
+    constructor(or: string, beginGroup: string, endGroup: string, beginClass: string, endClass: string, newline: string);
+    static getDEFAULT(): RegexGenerator;
+    static _add(node: RegexNode | null, word: string, offset: number): RegexNode | null;
+    add(word: string): void;
+    _generateStub(node: RegexNode | null): string;
+    generate(): string;
+}