@gmod/trix 3.0.4 → 3.0.6

package/dist/dedupe.js

@@ -2,11 +2,13 @@
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.dedupe = dedupe;
 // from https://github.com/seriousManual/dedupe/blob/master/LICENSE
-function dedupe(list, hasher = JSON.stringify) {
-    const clone = [];
-    const lookup = new Set();
-    for (const entry of list) {
-        const hashed = hasher(entry);
+function dedupe(list, hasher) {
+    if (hasher === void 0) { hasher = JSON.stringify; }
+    var clone = [];
+    var lookup = new Set();
+    for (var _i = 0, list_1 = list; _i < list_1.length; _i++) {
+        var entry = list_1[_i];
+        var hashed = hasher(entry);
         if (!lookup.has(hashed)) {
             clone.push(entry);
             lookup.add(hashed);

package/dist/dedupe.js.map

@@ -1 +1 @@
-{"version":3,"file":"dedupe.js","sourceRoot":"","sources":["../src/dedupe.ts"],"names":[],"mappings":";;AAGA,wBAcC;AAfD,mEAAmE;AACnE,SAAgB,MAAM,CAAI,IAAS,EAAE,SAAoB,IAAI,CAAC,SAAS;IACrE,MAAM,KAAK,GAAQ,EAAE,CAAA;IACrB,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAA;IAEhC,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;QACzB,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,CAAA;QAE5B,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YACxB,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;YACjB,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;QACpB,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAA;AACd,CAAC"}
+{"version":3,"file":"dedupe.js","sourceRoot":"","sources":["../src/dedupe.ts"],"names":[],"mappings":";;AAGA,wBAcC;AAfD,mEAAmE;AACnE,SAAgB,MAAM,CAAI,IAAS,EAAE,MAAkC;IAAlC,uBAAA,EAAA,SAAoB,IAAI,CAAC,SAAS;IACrE,IAAM,KAAK,GAAQ,EAAE,CAAA;IACrB,IAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAA;IAEhC,KAAoB,UAAI,EAAJ,aAAI,EAAJ,kBAAI,EAAJ,IAAI,EAAE,CAAC;QAAtB,IAAM,KAAK,aAAA;QACd,IAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,CAAA;QAE5B,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YACxB,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;YACjB,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;QACpB,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAA;AACd,CAAC"}

package/dist/index.d.ts

@@ -3,10 +3,12 @@ export default class Trix {
     ixxFile: GenericFilehandle;
     ixFile: GenericFilehandle;
     maxResults: number;
+    private decoder;
+    private indexCache?;
     constructor(ixxFile: GenericFilehandle, ixFile: GenericFilehandle, maxResults?: number);
     search(searchString: string, opts?: {
         signal?: AbortSignal;
     }): Promise<[string, string][]>;
     private getIndex;
-    private _getBuffer;
+    private getBuffer;
 }

package/dist/index.js

@@ -1,4 +1,15 @@
 "use strict";
+var __assign = (this && this.__assign) || function () {
+    __assign = Object.assign || function(t) {
+        for (var s, i = 1, n = arguments.length; i < n; i++) {
+            s = arguments[i];
+            for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p))
+                t[p] = s[p];
+        }
+        return t;
+    };
+    return __assign.apply(this, arguments);
+};
 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) {
@@ -8,124 +19,168 @@ var __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, ge
         step((generator = generator.apply(thisArg, _arguments || [])).next());
     });
 };
+var __generator = (this && this.__generator) || function (thisArg, body) {
+    var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g = Object.create((typeof Iterator === "function" ? Iterator : Object).prototype);
+    return g.next = verb(0), g["throw"] = verb(1), g["return"] = verb(2), typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
+    function verb(n) { return function (v) { return step([n, v]); }; }
+    function step(op) {
+        if (f) throw new TypeError("Generator is already executing.");
+        while (g && (g = 0, op[0] && (_ = 0)), _) try {
+            if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;
+            if (y = 0, t) op = [op[0] & 2, t.value];
+            switch (op[0]) {
+                case 0: case 1: t = op; break;
+                case 4: _.label++; return { value: op[1], done: false };
+                case 5: _.label++; y = op[1]; op = [0]; continue;
+                case 7: op = _.ops.pop(); _.trys.pop(); continue;
+                default:
+                    if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }
+                    if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }
+                    if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }
+                    if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }
+                    if (t[2]) _.ops.pop();
+                    _.trys.pop(); continue;
+            }
+            op = body.call(thisArg, _);
+        } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }
+        if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };
+    }
+};
 Object.defineProperty(exports, "__esModule", { value: true });
-const dedupe_ts_1 = require("./dedupe.js");
-const util_ts_1 = require("./util.js");
-const CHUNK_SIZE = 65536;
+var dedupe_ts_1 = require("./dedupe.js");
+var util_ts_1 = require("./util.js");
+var CHUNK_SIZE = 65536;
 // this is the number of hex characters to use for the address in ixixx, see
 // https://github.com/GMOD/ixixx-js/blob/master/src/index.ts#L182
-const ADDRESS_SIZE = 10;
-class Trix {
-    constructor(ixxFile, ixFile, maxResults = 20) {
+var ADDRESS_SIZE = 10;
+var Trix = /** @class */ (function () {
+    function Trix(ixxFile, ixFile, maxResults) {
+        if (maxResults === void 0) { maxResults = 20; }
         this.ixxFile = ixxFile;
         this.ixFile = ixFile;
         this.maxResults = maxResults;
+        this.decoder = new TextDecoder('utf8');
     }
-    search(searchString, opts) {
-        return __awaiter(this, void 0, void 0, function* () {
-            let resultArr = [];
-            const searchWords = searchString.split(' ');
-            // we only search one word at a time
-            const searchWord = searchWords[0].toLowerCase();
-            const res = yield this._getBuffer(searchWord, opts);
-            if (!res) {
-                return [];
-            }
-            let { end, buffer } = res;
-            let done = false;
-            const decoder = new TextDecoder('utf8');
-            // eslint-disable-next-line @typescript-eslint/no-unnecessary-condition
-            while (!done) {
-                let foundSomething = false;
-                const str = decoder.decode(buffer);
-                // slice to lastIndexOf('\n') to make sure we get complete records
-                // since the buffer fetch could get halfway into a record
-                const lines = str
-                    .slice(0, str.lastIndexOf('\n'))
-                    .split('\n')
-                    .filter(f => !!f);
-                const hits2 = [];
-                for (const line of lines) {
-                    const word = line.split(' ')[0];
-                    const match = word.startsWith(searchWord);
-                    if (!foundSomething && match) {
-                        foundSomething = true;
-                    }
-                    // we are done scanning if we are lexicographically greater than the
-                    // search string
-                    if (word.slice(0, searchWord.length) > searchWord) {
-                        done = true;
-                    }
-                    if (match) {
-                        hits2.push(line);
-                    }
-                }
-                const hits = hits2.flatMap(line => {
-                    const [term, ...parts] = line.split(' ');
-                    return parts.map(elt => [term, elt.split(',')[0]]);
-                });
-                // if we are not done, and we haven't filled up maxResults with hits yet,
-                // then refetch
-                if (resultArr.length + hits.length < this.maxResults && !done) {
-                    const res2 = yield this.ixFile.read(CHUNK_SIZE, end, opts);
-                    // early break if empty response
-                    if (res2.length === 0) {
+    Trix.prototype.search = function (searchString, opts) {
+        return __awaiter(this, void 0, void 0, function () {
+            var resultArr, searchWords, firstWord, searchWord, res, end, buffer, done, str, lines, hits2, _i, lines_1, line, word, hits, res2;
+            return __generator(this, function (_a) {
+                switch (_a.label) {
+                    case 0:
+                        resultArr = [];
+                        searchWords = searchString.split(' ');
+                        firstWord = searchWords[0];
+                        if (!firstWord) return [3 /*break*/, 4];
+                        searchWord = firstWord.toLowerCase();
+                        return [4 /*yield*/, this.getBuffer(searchWord, opts)];
+                    case 1:
+                        res = _a.sent();
+                        end = res.end, buffer = res.buffer;
+                        done = false;
+                        _a.label = 2;
+                    case 2:
+                        if (!!done) return [3 /*break*/, 4];
+                        str = this.decoder.decode(buffer);
+                        lines = str
+                            .slice(0, str.lastIndexOf('\n'))
+                            .split('\n')
+                            .filter(Boolean);
+                        hits2 = [];
+                        for (_i = 0, lines_1 = lines; _i < lines_1.length; _i++) {
+                            line = lines_1[_i];
+                            word = line.split(' ')[0];
+                            if (word.startsWith(searchWord)) {
+                                hits2.push(line);
+                            }
+                            else if (word > searchWord) {
+                                // we are done scanning if we are lexicographically greater than
+                                // the search string
+                                done = true;
+                            }
+                        }
+                        hits = hits2.flatMap(function (line) {
+                            var _a = line.split(' '), term = _a[0], parts = _a.slice(1);
+                            return parts
+                                .filter(Boolean)
+                                .map(function (elt) { return [term, elt.split(',')[0]]; });
+                        });
                         resultArr = resultArr.concat(hits);
-                        break;
-                    }
-                    buffer = (0, util_ts_1.concatUint8Array)([buffer, res2]);
-                    end += CHUNK_SIZE;
+                        // if we are done or have filled up maxResults, break
+                        if (done || resultArr.length >= this.maxResults) {
+                            return [3 /*break*/, 4];
+                        }
+                        return [4 /*yield*/, this.ixFile.read(CHUNK_SIZE, end, opts)];
+                    case 3:
+                        res2 = _a.sent();
+                        if (res2.length === 0) {
+                            return [3 /*break*/, 4];
+                        }
+                        buffer = (0, util_ts_1.concatUint8Array)([buffer, res2]);
+                        end += CHUNK_SIZE;
+                        return [3 /*break*/, 2];
+                    case 4: 
+                    // de-duplicate results based on the detail column (resultArr[1])
+                    return [2 /*return*/, (0, dedupe_ts_1.dedupe)(resultArr, function (elt) { return elt[1]; }).slice(0, this.maxResults)];
                 }
-                // if we have filled up the hits, or we are detected to be done via the
-                // filtering, then return
-                else if (resultArr.length + hits.length >= this.maxResults || done) {
-                    resultArr = resultArr.concat(hits);
-                    break;
-                }
-            }
-            // de-duplicate results based on the detail column (resultArr[1])
-            return (0, dedupe_ts_1.dedupe)(resultArr, elt => elt[1]).slice(0, this.maxResults);
+            });
         });
-    }
-    getIndex(opts) {
-        return __awaiter(this, void 0, void 0, function* () {
-            const file = yield this.ixxFile.readFile(Object.assign({ encoding: 'utf8' }, opts));
-            return file
-                .split('\n')
-                .filter(f => !!f)
-                .map(line => {
-                const p = line.length - ADDRESS_SIZE;
-                const prefix = line.slice(0, p);
-                const posStr = line.slice(p);
-                const pos = Number.parseInt(posStr, 16);
-                return [prefix, pos];
+    };
+    Trix.prototype.getIndex = function (opts) {
+        return __awaiter(this, void 0, void 0, function () {
+            var file, result;
+            return __generator(this, function (_a) {
+                switch (_a.label) {
+                    case 0:
+                        if (this.indexCache) {
+                            return [2 /*return*/, this.indexCache];
+                        }
+                        return [4 /*yield*/, this.ixxFile.readFile(__assign({ encoding: 'utf8' }, opts))];
+                    case 1:
+                        file = _a.sent();
+                        result = file
+                            .split('\n')
+                            .filter(Boolean)
+                            .map(function (line) {
+                            var p = line.length - ADDRESS_SIZE;
+                            var prefix = line.slice(0, p);
+                            var posStr = line.slice(p);
+                            var pos = Number.parseInt(posStr, 16);
+                            return [prefix, pos];
+                        });
+                        this.indexCache = result;
+                        return [2 /*return*/, result];
+                }
             });
         });
-    }
-    _getBuffer(searchWord, opts) {
-        return __awaiter(this, void 0, void 0, function* () {
-            let start = 0;
-            let end = 65536;
-            const indexes = yield this.getIndex(opts);
-            for (const [key, value] of indexes) {
-                const trimmedKey = key.slice(0, searchWord.length);
-                if (trimmedKey < searchWord) {
-                    start = value;
-                    end = value + 65536;
+    };
+    Trix.prototype.getBuffer = function (searchWord, opts) {
+        return __awaiter(this, void 0, void 0, function () {
+            var start, end, indexes, _i, indexes_1, _a, key, value, trimmedKey, buffer;
+            return __generator(this, function (_b) {
+                switch (_b.label) {
+                    case 0:
+                        start = 0;
+                        end = CHUNK_SIZE;
+                        return [4 /*yield*/, this.getIndex(opts)];
+                    case 1:
+                        indexes = _b.sent();
+                        for (_i = 0, indexes_1 = indexes; _i < indexes_1.length; _i++) {
+                            _a = indexes_1[_i], key = _a[0], value = _a[1];
+                            trimmedKey = key.slice(0, searchWord.length);
+                            if (trimmedKey < searchWord) {
+                                start = value;
+                                end = value + CHUNK_SIZE;
+                            }
+                        }
+                        return [4 /*yield*/, this.ixFile.read(end - start, start, opts)];
+                    case 2:
+                        buffer = _b.sent();
+                        return [2 /*return*/, { buffer: buffer, end: end }];
                 }
-            }
-            // Return the buffer and its end position in the file.
-            const len = end - start;
-            if (len < 0) {
-                return undefined;
-            }
-            const buffer = yield this.ixFile.read(len, start, opts);
-            return {
-                buffer,
-                end,
-            };
+            });
         });
-    }
-}
+    };
+    return Trix;
+}());
 exports.default = Trix;
 //# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":";;;;;;;;;;;AAAA,2CAAoC;AACpC,uCAA4C;AAI5C,MAAM,UAAU,GAAG,KAAK,CAAA;AAExB,4EAA4E;AAC5E,iEAAiE;AACjE,MAAM,YAAY,GAAG,EAAE,CAAA;AAEvB,MAAqB,IAAI;IACvB,YACS,OAA0B,EAC1B,MAAyB,EACzB,aAAa,EAAE;QAFf,YAAO,GAAP,OAAO,CAAmB;QAC1B,WAAM,GAAN,MAAM,CAAmB;QACzB,eAAU,GAAV,UAAU,CAAK;IACrB,CAAC;IAEE,MAAM,CAAC,YAAoB,EAAE,IAA+B;;YAChE,IAAI,SAAS,GAAG,EAAwB,CAAA;YACxC,MAAM,WAAW,GAAG,YAAY,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;YAE3C,oCAAoC;YACpC,MAAM,UAAU,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,CAAA;YAC/C,MAAM,GAAG,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,UAAU,EAAE,IAAI,CAAC,CAAA;YACnD,IAAI,CAAC,GAAG,EAAE,CAAC;gBACT,OAAO,EAAE,CAAA;YACX,CAAC;YAED,IAAI,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,GAAG,CAAA;YACzB,IAAI,IAAI,GAAG,KAAK,CAAA;YAChB,MAAM,OAAO,GAAG,IAAI,WAAW,CAAC,MAAM,CAAC,CAAA;YACvC,uEAAuE;YACvE,OAAO,CAAC,IAAI,EAAE,CAAC;gBACb,IAAI,cAAc,GAAG,KAAK,CAAA;gBAC1B,MAAM,GAAG,GAAG,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAA;gBAElC,kEAAkE;gBAClE,yDAAyD;gBACzD,MAAM,KAAK,GAAG,GAAG;qBACd,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;qBAC/B,KAAK,CAAC,IAAI,CAAC;qBACX,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;gBAEnB,MAAM,KAAK,GAAG,EAAc,CAAA;gBAC5B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;oBACzB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;oBAC/B,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,CAAA;oBACzC,IAAI,CAAC,cAAc,IAAI,KAAK,EAAE,CAAC;wBAC7B,cAAc,GAAG,IAAI,CAAA;oBACvB,CAAC;oBAED,oEAAoE;oBACpE,gBAAgB;oBAChB,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,UAAU,CAAC,MAAM,CAAC,GAAG,UAAU,EAAE,CAAC;wBAClD,IAAI,GAAG,IAAI,CAAA;oBACb,CAAC;oBACD,IAAI,KAAK,EAAE,CAAC;wBACV,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;oBAClB,CAAC;gBACH,CAAC;gBACD,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;oBAChC,MAAM,CAAC,IAAI,EAAE,GAAG,KAAK,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;oBACxC,OAAO,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAqB,CAAC,CAAA;gBACxE,CAAC,CAAC,CAAA;gBAEF,yEAAyE;gBACzE,eAAe;gBACf,IAAI,SAAS,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,UAAU,IAAI,CAAC,IAAI,EAAE,CAAC;oBAC9D,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,UAAU,EAAE,GAAG,EAAE,IAAI,CAAC,CAAA;oBAE1D,gCAAgC;oBAChC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;wBACtB,SAAS,GAAG,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;wBAClC,MAAK;oBACP,CAAC;oBACD,MAAM,GAAG,IAAA,0BAAgB,EAAC,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,CAAA;oBACzC,GAAG,IAAI,UAAU,CAAA;gBACnB,CAAC;gBAED,uEAAuE;gBACvE,yBAAyB;qBACpB,IAAI,SAAS,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,UAAU,IAAI,IAAI,EAAE,CAAC;oBACnE,SAAS,GAAG,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;oBAClC,MAAK;gBACP,CAAC;YACH,CAAC;YAED,iEAAiE;YACjE,OAAO,IAAA,kBAAM,EAAC,SAAS,EAAE,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,UAAU,CAAC,CAAA;QACnE,CAAC;KAAA;IAEa,QAAQ,CAAC,IAA+B;;YACpD,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,QAAQ,iBACtC,QAAQ,EAAE,MAAM,IACb,IAAI,EACP,CAAA;YACF,OAAO,IAAI;iBACR,KAAK,CAAC,IAAI,CAAC;iBACX,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;iBAChB,GAAG,CAAC,IAAI,CAAC,EAAE;gBACV,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,YAAY,CAAA;gBACpC,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;gBAC/B,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;gBAC5B,MAAM,GAAG,GAAG,MAAM,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC,CAAA;gBACvC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAU,CAAA;YAC/B,CAAC,CAAC,CAAA;QACN,CAAC;KAAA;IAEa,UAAU,CACtB,UAAkB,EAClB,IAA+B;;YAE/B,IAAI,KAAK,GAAG,CAAC,CAAA;YACb,IAAI,GAAG,GAAG,KAAK,CAAA;YACf,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAA;YACzC,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,OAAO,EAAE,CAAC;gBACnC,MAAM,UAAU,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,UAAU,CAAC,MAAM,CAAC,CAAA;gBAClD,IAAI,UAAU,GAAG,UAAU,EAAE,CAAC;oBAC5B,KAAK,GAAG,KAAK,CAAA;oBACb,GAAG,GAAG,KAAK,GAAG,KAAK,CAAA;gBACrB,CAAC;YACH,CAAC;YAED,sDAAsD;YACtD,MAAM,GAAG,GAAG,GAAG,GAAG,KAAK,CAAA;YACvB,IAAI,GAAG,GAAG,CAAC,EAAE,CAAC;gBACZ,OAAO,SAAS,CAAA;YAClB,CAAC;YACD,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,KAAK,EAAE,IAAI,CAAC,CAAA;YACvD,OAAO;gBACL,MAAM;gBACN,GAAG;aACJ,CAAA;QACH,CAAC;KAAA;CACF;AA5HD,uBA4HC"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,yCAAoC;AACpC,qCAA4C;AAI5C,IAAM,UAAU,GAAG,KAAK,CAAA;AAExB,4EAA4E;AAC5E,iEAAiE;AACjE,IAAM,YAAY,GAAG,EAAE,CAAA;AAEvB;IAIE,cACS,OAA0B,EAC1B,MAAyB,EACzB,UAAe;QAAf,2BAAA,EAAA,eAAe;QAFf,YAAO,GAAP,OAAO,CAAmB;QAC1B,WAAM,GAAN,MAAM,CAAmB;QACzB,eAAU,GAAV,UAAU,CAAK;QANhB,YAAO,GAAG,IAAI,WAAW,CAAC,MAAM,CAAC,CAAA;IAOtC,CAAC;IAEE,qBAAM,GAAZ,UAAa,YAAoB,EAAE,IAA+B;;;;;;wBAC5D,SAAS,GAAG,EAAwB,CAAA;wBAClC,WAAW,GAAG,YAAY,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;wBACrC,SAAS,GAAG,WAAW,CAAC,CAAC,CAAC,CAAA;6BAG5B,SAAS,EAAT,wBAAS;wBACL,UAAU,GAAG,SAAS,CAAC,WAAW,EAAE,CAAA;wBAC9B,qBAAM,IAAI,CAAC,SAAS,CAAC,UAAU,EAAE,IAAI,CAAC,EAAA;;wBAA5C,GAAG,GAAG,SAAsC;wBAE5C,GAAG,GAAa,GAAG,IAAhB,EAAE,MAAM,GAAK,GAAG,OAAR,CAAQ;wBACrB,IAAI,GAAG,KAAK,CAAA;;;6BAET,CAAC,IAAI;wBACJ,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAA;wBAIjC,KAAK,GAAG,GAAG;6BACd,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;6BAC/B,KAAK,CAAC,IAAI,CAAC;6BACX,MAAM,CAAC,OAAO,CAAC,CAAA;wBAEZ,KAAK,GAAG,EAAc,CAAA;wBAC5B,WAAwB,EAAL,eAAK,EAAL,mBAAK,EAAL,IAAK,EAAE,CAAC;4BAAhB,IAAI;4BACP,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;4BAE/B,IAAI,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,EAAE,CAAC;gCAChC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;4BAClB,CAAC;iCAAM,IAAI,IAAI,GAAG,UAAU,EAAE,CAAC;gCAC7B,gEAAgE;gCAChE,oBAAoB;gCACpB,IAAI,GAAG,IAAI,CAAA;4BACb,CAAC;wBACH,CAAC;wBACK,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,UAAA,IAAI;4BACvB,IAAA,KAAmB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAjC,IAAI,QAAA,EAAK,KAAK,cAAmB,CAAA;4BACxC,OAAO,KAAK;iCACT,MAAM,CAAC,OAAO,CAAC;iCACf,GAAG,CAAC,UAAA,GAAG,IAAI,OAAA,CAAC,IAAI,EAAE,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAqB,EAA7C,CAA6C,CAAC,CAAA;wBAC9D,CAAC,CAAC,CAAA;wBAEF,SAAS,GAAG,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;wBAElC,qDAAqD;wBACrD,IAAI,IAAI,IAAI,SAAS,CAAC,MAAM,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;4BAChD,wBAAK;wBACP,CAAC;wBAGY,qBAAM,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,UAAU,EAAE,GAAG,EAAE,IAAI,CAAC,EAAA;;wBAApD,IAAI,GAAG,SAA6C;wBAC1D,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;4BACtB,wBAAK;wBACP,CAAC;wBACD,MAAM,GAAG,IAAA,0BAAgB,EAAC,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,CAAA;wBACzC,GAAG,IAAI,UAAU,CAAA;;;oBAIrB,iEAAiE;oBACjE,sBAAO,IAAA,kBAAM,EAAC,SAAS,EAAE,UAAA,GAAG,IAAI,OAAA,GAAG,CAAC,CAAC,CAAC,EAAN,CAAM,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,UAAU,CAAC,EAAA;;;;KAClE;IAEa,uBAAQ,GAAtB,UAAuB,IAA+B;;;;;;wBACpD,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;4BACpB,sBAAO,IAAI,CAAC,UAAU,EAAA;wBACxB,CAAC;wBACY,qBAAM,IAAI,CAAC,OAAO,CAAC,QAAQ,YACtC,QAAQ,EAAE,MAAM,IACb,IAAI,EACP,EAAA;;wBAHI,IAAI,GAAG,SAGX;wBACI,MAAM,GAAG,IAAI;6BAChB,KAAK,CAAC,IAAI,CAAC;6BACX,MAAM,CAAC,OAAO,CAAC;6BACf,GAAG,CAAC,UAAA,IAAI;4BACP,IAAM,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,YAAY,CAAA;4BACpC,IAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;4BAC/B,IAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;4BAC5B,IAAM,GAAG,GAAG,MAAM,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC,CAAA;4BACvC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAU,CAAA;wBAC/B,CAAC,CAAC,CAAA;wBACJ,IAAI,CAAC,UAAU,GAAG,MAAM,CAAA;wBACxB,sBAAO,MAAM,EAAA;;;;KACd;IAEa,wBAAS,GAAvB,UAAwB,UAAkB,EAAE,IAA+B;;;;;;wBACrE,KAAK,GAAG,CAAC,CAAA;wBACT,GAAG,GAAG,UAAU,CAAA;wBACJ,qBAAM,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAA;;wBAAnC,OAAO,GAAG,SAAyB;wBACzC,WAAkC,EAAP,mBAAO,EAAP,qBAAO,EAAP,IAAO,EAAE,CAAC;4BAA1B,kBAAY,EAAX,GAAG,QAAA,EAAE,KAAK,QAAA;4BACd,UAAU,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,UAAU,CAAC,MAAM,CAAC,CAAA;4BAClD,IAAI,UAAU,GAAG,UAAU,EAAE,CAAC;gCAC5B,KAAK,GAAG,KAAK,CAAA;gCACb,GAAG,GAAG,KAAK,GAAG,UAAU,CAAA;4BAC1B,CAAC;wBACH,CAAC;wBAEc,qBAAM,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,GAAG,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,EAAA;;wBAAzD,MAAM,GAAG,SAAgD;wBAC/D,sBAAO,EAAE,MAAM,QAAA,EAAE,GAAG,KAAA,EAAE,EAAA;;;;KACvB;IACH,WAAC;AAAD,CAAC,AA9GD,IA8GC"}

package/dist/package.json

@@ -0,0 +1 @@
+{"type": "commonjs"}

package/dist/util.js

@@ -3,16 +3,18 @@ Object.defineProperty(exports, "__esModule", { value: true });
 exports.sum = sum;
 exports.concatUint8Array = concatUint8Array;
 function sum(array) {
-    let sum = 0;
-    for (const entry of array) {
-        sum += entry.length;
+    var total = 0;
+    for (var _i = 0, array_1 = array; _i < array_1.length; _i++) {
+        var entry = array_1[_i];
+        total += entry.length;
     }
-    return sum;
+    return total;
 }
 function concatUint8Array(args) {
-    const mergedArray = new Uint8Array(sum(args));
-    let offset = 0;
-    for (const entry of args) {
+    var mergedArray = new Uint8Array(sum(args));
+    var offset = 0;
+    for (var _i = 0, args_1 = args; _i < args_1.length; _i++) {
+        var entry = args_1[_i];
         mergedArray.set(entry, offset);
         offset += entry.length;
     }

package/dist/util.js.map

@@ -1 +1 @@
-{"version":3,"file":"util.js","sourceRoot":"","sources":["../src/util.ts"],"names":[],"mappings":";;AAAA,kBAMC;AACD,4CAQC;AAfD,SAAgB,GAAG,CAAC,KAAmB;IACrC,IAAI,GAAG,GAAG,CAAC,CAAA;IACX,KAAK,MAAM,KAAK,IAAI,KAAK,EAAE,CAAC;QAC1B,GAAG,IAAI,KAAK,CAAC,MAAM,CAAA;IACrB,CAAC;IACD,OAAO,GAAG,CAAA;AACZ,CAAC;AACD,SAAgB,gBAAgB,CAAC,IAAkB;IACjD,MAAM,WAAW,GAAG,IAAI,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAA;IAC7C,IAAI,MAAM,GAAG,CAAC,CAAA;IACd,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;QACzB,WAAW,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAA;QAC9B,MAAM,IAAI,KAAK,CAAC,MAAM,CAAA;IACxB,CAAC;IACD,OAAO,WAAW,CAAA;AACpB,CAAC"}
+{"version":3,"file":"util.js","sourceRoot":"","sources":["../src/util.ts"],"names":[],"mappings":";;AAAA,kBAMC;AACD,4CAQC;AAfD,SAAgB,GAAG,CAAC,KAAmB;IACrC,IAAI,KAAK,GAAG,CAAC,CAAA;IACb,KAAoB,UAAK,EAAL,eAAK,EAAL,mBAAK,EAAL,IAAK,EAAE,CAAC;QAAvB,IAAM,KAAK,cAAA;QACd,KAAK,IAAI,KAAK,CAAC,MAAM,CAAA;IACvB,CAAC;IACD,OAAO,KAAK,CAAA;AACd,CAAC;AACD,SAAgB,gBAAgB,CAAC,IAAkB;IACjD,IAAM,WAAW,GAAG,IAAI,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAA;IAC7C,IAAI,MAAM,GAAG,CAAC,CAAA;IACd,KAAoB,UAAI,EAAJ,aAAI,EAAJ,kBAAI,EAAJ,IAAI,EAAE,CAAC;QAAtB,IAAM,KAAK,aAAA;QACd,WAAW,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAA;QAC9B,MAAM,IAAI,KAAK,CAAC,MAAM,CAAA;IACxB,CAAC;IACD,OAAO,WAAW,CAAA;AACpB,CAAC"}

package/esm/dedupe.js

@@ -1,9 +1,14 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.dedupe = dedupe;
 // from https://github.com/seriousManual/dedupe/blob/master/LICENSE
-export function dedupe(list, hasher = JSON.stringify) {
-    const clone = [];
-    const lookup = new Set();
-    for (const entry of list) {
-        const hashed = hasher(entry);
+function dedupe(list, hasher) {
+    if (hasher === void 0) { hasher = JSON.stringify; }
+    var clone = [];
+    var lookup = new Set();
+    for (var _i = 0, list_1 = list; _i < list_1.length; _i++) {
+        var entry = list_1[_i];
+        var hashed = hasher(entry);
         if (!lookup.has(hashed)) {
             clone.push(entry);
             lookup.add(hashed);

package/esm/dedupe.js.map

@@ -1 +1 @@
-{"version":3,"file":"dedupe.js","sourceRoot":"","sources":["../src/dedupe.ts"],"names":[],"mappings":"AAEA,mEAAmE;AACnE,MAAM,UAAU,MAAM,CAAI,IAAS,EAAE,SAAoB,IAAI,CAAC,SAAS;IACrE,MAAM,KAAK,GAAQ,EAAE,CAAA;IACrB,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAA;IAEhC,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;QACzB,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,CAAA;QAE5B,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YACxB,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;YACjB,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;QACpB,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAA;AACd,CAAC"}
+{"version":3,"file":"dedupe.js","sourceRoot":"","sources":["../src/dedupe.ts"],"names":[],"mappings":";;AAGA,wBAcC;AAfD,mEAAmE;AACnE,SAAgB,MAAM,CAAI,IAAS,EAAE,MAAkC;IAAlC,uBAAA,EAAA,SAAoB,IAAI,CAAC,SAAS;IACrE,IAAM,KAAK,GAAQ,EAAE,CAAA;IACrB,IAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAA;IAEhC,KAAoB,UAAI,EAAJ,aAAI,EAAJ,kBAAI,EAAJ,IAAI,EAAE,CAAC;QAAtB,IAAM,KAAK,aAAA;QACd,IAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,CAAA;QAE5B,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YACxB,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;YACjB,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;QACpB,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAA;AACd,CAAC"}

package/esm/index.d.ts

@@ -3,10 +3,12 @@ export default class Trix {
     ixxFile: GenericFilehandle;
     ixFile: GenericFilehandle;
     maxResults: number;
+    private decoder;
+    private indexCache?;
     constructor(ixxFile: GenericFilehandle, ixFile: GenericFilehandle, maxResults?: number);
     search(searchString: string, opts?: {
         signal?: AbortSignal;
     }): Promise<[string, string][]>;
     private getIndex;
-    private _getBuffer;
+    private getBuffer;
 }

package/esm/index.js

@@ -1,119 +1,186 @@
-import { dedupe } from "./dedupe.js";
-import { concatUint8Array } from "./util.js";
-const CHUNK_SIZE = 65536;
+"use strict";
+var __assign = (this && this.__assign) || function () {
+    __assign = Object.assign || function(t) {
+        for (var s, i = 1, n = arguments.length; i < n; i++) {
+            s = arguments[i];
+            for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p))
+                t[p] = s[p];
+        }
+        return t;
+    };
+    return __assign.apply(this, arguments);
+};
+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());
+    });
+};
+var __generator = (this && this.__generator) || function (thisArg, body) {
+    var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g = Object.create((typeof Iterator === "function" ? Iterator : Object).prototype);
+    return g.next = verb(0), g["throw"] = verb(1), g["return"] = verb(2), typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
+    function verb(n) { return function (v) { return step([n, v]); }; }
+    function step(op) {
+        if (f) throw new TypeError("Generator is already executing.");
+        while (g && (g = 0, op[0] && (_ = 0)), _) try {
+            if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;
+            if (y = 0, t) op = [op[0] & 2, t.value];
+            switch (op[0]) {
+                case 0: case 1: t = op; break;
+                case 4: _.label++; return { value: op[1], done: false };
+                case 5: _.label++; y = op[1]; op = [0]; continue;
+                case 7: op = _.ops.pop(); _.trys.pop(); continue;
+                default:
+                    if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }
+                    if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }
+                    if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }
+                    if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }
+                    if (t[2]) _.ops.pop();
+                    _.trys.pop(); continue;
+            }
+            op = body.call(thisArg, _);
+        } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }
+        if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };
+    }
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+var dedupe_ts_1 = require("./dedupe.js");
+var util_ts_1 = require("./util.js");
+var CHUNK_SIZE = 65536;
 // this is the number of hex characters to use for the address in ixixx, see
 // https://github.com/GMOD/ixixx-js/blob/master/src/index.ts#L182
-const ADDRESS_SIZE = 10;
-export default class Trix {
-    ixxFile;
-    ixFile;
-    maxResults;
-    constructor(ixxFile, ixFile, maxResults = 20) {
+var ADDRESS_SIZE = 10;
+var Trix = /** @class */ (function () {
+    function Trix(ixxFile, ixFile, maxResults) {
+        if (maxResults === void 0) { maxResults = 20; }
         this.ixxFile = ixxFile;
         this.ixFile = ixFile;
         this.maxResults = maxResults;
+        this.decoder = new TextDecoder('utf8');
     }
-    async search(searchString, opts) {
-        let resultArr = [];
-        const searchWords = searchString.split(' ');
-        // we only search one word at a time
-        const searchWord = searchWords[0].toLowerCase();
-        const res = await this._getBuffer(searchWord, opts);
-        if (!res) {
-            return [];
-        }
-        let { end, buffer } = res;
-        let done = false;
-        const decoder = new TextDecoder('utf8');
-        // eslint-disable-next-line @typescript-eslint/no-unnecessary-condition
-        while (!done) {
-            let foundSomething = false;
-            const str = decoder.decode(buffer);
-            // slice to lastIndexOf('\n') to make sure we get complete records
-            // since the buffer fetch could get halfway into a record
-            const lines = str
-                .slice(0, str.lastIndexOf('\n'))
-                .split('\n')
-                .filter(f => !!f);
-            const hits2 = [];
-            for (const line of lines) {
-                const word = line.split(' ')[0];
-                const match = word.startsWith(searchWord);
-                if (!foundSomething && match) {
-                    foundSomething = true;
-                }
-                // we are done scanning if we are lexicographically greater than the
-                // search string
-                if (word.slice(0, searchWord.length) > searchWord) {
-                    done = true;
+    Trix.prototype.search = function (searchString, opts) {
+        return __awaiter(this, void 0, void 0, function () {
+            var resultArr, searchWords, firstWord, searchWord, res, end, buffer, done, str, lines, hits2, _i, lines_1, line, word, hits, res2;
+            return __generator(this, function (_a) {
+                switch (_a.label) {
+                    case 0:
+                        resultArr = [];
+                        searchWords = searchString.split(' ');
+                        firstWord = searchWords[0];
+                        if (!firstWord) return [3 /*break*/, 4];
+                        searchWord = firstWord.toLowerCase();
+                        return [4 /*yield*/, this.getBuffer(searchWord, opts)];
+                    case 1:
+                        res = _a.sent();
+                        end = res.end, buffer = res.buffer;
+                        done = false;
+                        _a.label = 2;
+                    case 2:
+                        if (!!done) return [3 /*break*/, 4];
+                        str = this.decoder.decode(buffer);
+                        lines = str
+                            .slice(0, str.lastIndexOf('\n'))
+                            .split('\n')
+                            .filter(Boolean);
+                        hits2 = [];
+                        for (_i = 0, lines_1 = lines; _i < lines_1.length; _i++) {
+                            line = lines_1[_i];
+                            word = line.split(' ')[0];
+                            if (word.startsWith(searchWord)) {
+                                hits2.push(line);
+                            }
+                            else if (word > searchWord) {
+                                // we are done scanning if we are lexicographically greater than
+                                // the search string
+                                done = true;
+                            }
+                        }
+                        hits = hits2.flatMap(function (line) {
+                            var _a = line.split(' '), term = _a[0], parts = _a.slice(1);
+                            return parts
+                                .filter(Boolean)
+                                .map(function (elt) { return [term, elt.split(',')[0]]; });
+                        });
+                        resultArr = resultArr.concat(hits);
+                        // if we are done or have filled up maxResults, break
+                        if (done || resultArr.length >= this.maxResults) {
+                            return [3 /*break*/, 4];
+                        }
+                        return [4 /*yield*/, this.ixFile.read(CHUNK_SIZE, end, opts)];
+                    case 3:
+                        res2 = _a.sent();
+                        if (res2.length === 0) {
+                            return [3 /*break*/, 4];
+                        }
+                        buffer = (0, util_ts_1.concatUint8Array)([buffer, res2]);
+                        end += CHUNK_SIZE;
+                        return [3 /*break*/, 2];
+                    case 4: 
+                    // de-duplicate results based on the detail column (resultArr[1])
+                    return [2 /*return*/, (0, dedupe_ts_1.dedupe)(resultArr, function (elt) { return elt[1]; }).slice(0, this.maxResults)];
                 }
-                if (match) {
-                    hits2.push(line);
-                }
-            }
-            const hits = hits2.flatMap(line => {
-                const [term, ...parts] = line.split(' ');
-                return parts.map(elt => [term, elt.split(',')[0]]);
             });
-            // if we are not done, and we haven't filled up maxResults with hits yet,
-            // then refetch
-            if (resultArr.length + hits.length < this.maxResults && !done) {
-                const res2 = await this.ixFile.read(CHUNK_SIZE, end, opts);
-                // early break if empty response
-                if (res2.length === 0) {
-                    resultArr = resultArr.concat(hits);
-                    break;
+        });
+    };
+    Trix.prototype.getIndex = function (opts) {
+        return __awaiter(this, void 0, void 0, function () {
+            var file, result;
+            return __generator(this, function (_a) {
+                switch (_a.label) {
+                    case 0:
+                        if (this.indexCache) {
+                            return [2 /*return*/, this.indexCache];
+                        }
+                        return [4 /*yield*/, this.ixxFile.readFile(__assign({ encoding: 'utf8' }, opts))];
+                    case 1:
+                        file = _a.sent();
+                        result = file
+                            .split('\n')
+                            .filter(Boolean)
+                            .map(function (line) {
+                            var p = line.length - ADDRESS_SIZE;
+                            var prefix = line.slice(0, p);
+                            var posStr = line.slice(p);
+                            var pos = Number.parseInt(posStr, 16);
+                            return [prefix, pos];
+                        });
+                        this.indexCache = result;
+                        return [2 /*return*/, result];
                 }
-                buffer = concatUint8Array([buffer, res2]);
-                end += CHUNK_SIZE;
-            }
-            // if we have filled up the hits, or we are detected to be done via the
-            // filtering, then return
-            else if (resultArr.length + hits.length >= this.maxResults || done) {
-                resultArr = resultArr.concat(hits);
-                break;
-            }
-        }
-        // de-duplicate results based on the detail column (resultArr[1])
-        return dedupe(resultArr, elt => elt[1]).slice(0, this.maxResults);
-    }
-    async getIndex(opts) {
-        const file = await this.ixxFile.readFile({
-            encoding: 'utf8',
-            ...opts,
+            });
         });
-        return file
-            .split('\n')
-            .filter(f => !!f)
-            .map(line => {
-            const p = line.length - ADDRESS_SIZE;
-            const prefix = line.slice(0, p);
-            const posStr = line.slice(p);
-            const pos = Number.parseInt(posStr, 16);
-            return [prefix, pos];
+    };
+    Trix.prototype.getBuffer = function (searchWord, opts) {
+        return __awaiter(this, void 0, void 0, function () {
+            var start, end, indexes, _i, indexes_1, _a, key, value, trimmedKey, buffer;
+            return __generator(this, function (_b) {
+                switch (_b.label) {
+                    case 0:
+                        start = 0;
+                        end = CHUNK_SIZE;
+                        return [4 /*yield*/, this.getIndex(opts)];
+                    case 1:
+                        indexes = _b.sent();
+                        for (_i = 0, indexes_1 = indexes; _i < indexes_1.length; _i++) {
+                            _a = indexes_1[_i], key = _a[0], value = _a[1];
+                            trimmedKey = key.slice(0, searchWord.length);
+                            if (trimmedKey < searchWord) {
+                                start = value;
+                                end = value + CHUNK_SIZE;
+                            }
+                        }
+                        return [4 /*yield*/, this.ixFile.read(end - start, start, opts)];
+                    case 2:
+                        buffer = _b.sent();
+                        return [2 /*return*/, { buffer: buffer, end: end }];
+                }
+            });
         });
-    }
-    async _getBuffer(searchWord, opts) {
-        let start = 0;
-        let end = 65536;
-        const indexes = await this.getIndex(opts);
-        for (const [key, value] of indexes) {
-            const trimmedKey = key.slice(0, searchWord.length);
-            if (trimmedKey < searchWord) {
-                start = value;
-                end = value + 65536;
-            }
-        }
-        // Return the buffer and its end position in the file.
-        const len = end - start;
-        if (len < 0) {
-            return undefined;
-        }
-        const buffer = await this.ixFile.read(len, start, opts);
-        return {
-            buffer,
-            end,
-        };
-    }
-}
+    };
+    return Trix;
+}());
+exports.default = Trix;
 //# sourceMappingURL=index.js.map

package/esm/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,MAAM,aAAa,CAAA;AACpC,OAAO,EAAE,gBAAgB,EAAE,MAAM,WAAW,CAAA;AAI5C,MAAM,UAAU,GAAG,KAAK,CAAA;AAExB,4EAA4E;AAC5E,iEAAiE;AACjE,MAAM,YAAY,GAAG,EAAE,CAAA;AAEvB,MAAM,CAAC,OAAO,OAAO,IAAI;IAEd;IACA;IACA;IAHT,YACS,OAA0B,EAC1B,MAAyB,EACzB,aAAa,EAAE;QAFf,YAAO,GAAP,OAAO,CAAmB;QAC1B,WAAM,GAAN,MAAM,CAAmB;QACzB,eAAU,GAAV,UAAU,CAAK;IACrB,CAAC;IAEJ,KAAK,CAAC,MAAM,CAAC,YAAoB,EAAE,IAA+B;QAChE,IAAI,SAAS,GAAG,EAAwB,CAAA;QACxC,MAAM,WAAW,GAAG,YAAY,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;QAE3C,oCAAoC;QACpC,MAAM,UAAU,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,CAAA;QAC/C,MAAM,GAAG,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,UAAU,EAAE,IAAI,CAAC,CAAA;QACnD,IAAI,CAAC,GAAG,EAAE,CAAC;YACT,OAAO,EAAE,CAAA;QACX,CAAC;QAED,IAAI,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,GAAG,CAAA;QACzB,IAAI,IAAI,GAAG,KAAK,CAAA;QAChB,MAAM,OAAO,GAAG,IAAI,WAAW,CAAC,MAAM,CAAC,CAAA;QACvC,uEAAuE;QACvE,OAAO,CAAC,IAAI,EAAE,CAAC;YACb,IAAI,cAAc,GAAG,KAAK,CAAA;YAC1B,MAAM,GAAG,GAAG,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAA;YAElC,kEAAkE;YAClE,yDAAyD;YACzD,MAAM,KAAK,GAAG,GAAG;iBACd,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;iBAC/B,KAAK,CAAC,IAAI,CAAC;iBACX,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;YAEnB,MAAM,KAAK,GAAG,EAAc,CAAA;YAC5B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;gBAC/B,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,CAAA;gBACzC,IAAI,CAAC,cAAc,IAAI,KAAK,EAAE,CAAC;oBAC7B,cAAc,GAAG,IAAI,CAAA;gBACvB,CAAC;gBAED,oEAAoE;gBACpE,gBAAgB;gBAChB,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,UAAU,CAAC,MAAM,CAAC,GAAG,UAAU,EAAE,CAAC;oBAClD,IAAI,GAAG,IAAI,CAAA;gBACb,CAAC;gBACD,IAAI,KAAK,EAAE,CAAC;oBACV,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;gBAClB,CAAC;YACH,CAAC;YACD,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;gBAChC,MAAM,CAAC,IAAI,EAAE,GAAG,KAAK,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;gBACxC,OAAO,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAqB,CAAC,CAAA;YACxE,CAAC,CAAC,CAAA;YAEF,yEAAyE;YACzE,eAAe;YACf,IAAI,SAAS,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,UAAU,IAAI,CAAC,IAAI,EAAE,CAAC;gBAC9D,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,UAAU,EAAE,GAAG,EAAE,IAAI,CAAC,CAAA;gBAE1D,gCAAgC;gBAChC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBACtB,SAAS,GAAG,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;oBAClC,MAAK;gBACP,CAAC;gBACD,MAAM,GAAG,gBAAgB,CAAC,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,CAAA;gBACzC,GAAG,IAAI,UAAU,CAAA;YACnB,CAAC;YAED,uEAAuE;YACvE,yBAAyB;iBACpB,IAAI,SAAS,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,UAAU,IAAI,IAAI,EAAE,CAAC;gBACnE,SAAS,GAAG,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;gBAClC,MAAK;YACP,CAAC;QACH,CAAC;QAED,iEAAiE;QACjE,OAAO,MAAM,CAAC,SAAS,EAAE,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,UAAU,CAAC,CAAA;IACnE,CAAC;IAEO,KAAK,CAAC,QAAQ,CAAC,IAA+B;QACpD,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC;YACvC,QAAQ,EAAE,MAAM;YAChB,GAAG,IAAI;SACR,CAAC,CAAA;QACF,OAAO,IAAI;aACR,KAAK,CAAC,IAAI,CAAC;aACX,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;aAChB,GAAG,CAAC,IAAI,CAAC,EAAE;YACV,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,YAAY,CAAA;YACpC,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;YAC/B,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;YAC5B,MAAM,GAAG,GAAG,MAAM,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC,CAAA;YACvC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAU,CAAA;QAC/B,CAAC,CAAC,CAAA;IACN,CAAC;IAEO,KAAK,CAAC,UAAU,CACtB,UAAkB,EAClB,IAA+B;QAE/B,IAAI,KAAK,GAAG,CAAC,CAAA;QACb,IAAI,GAAG,GAAG,KAAK,CAAA;QACf,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAA;QACzC,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,OAAO,EAAE,CAAC;YACnC,MAAM,UAAU,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,UAAU,CAAC,MAAM,CAAC,CAAA;YAClD,IAAI,UAAU,GAAG,UAAU,EAAE,CAAC;gBAC5B,KAAK,GAAG,KAAK,CAAA;gBACb,GAAG,GAAG,KAAK,GAAG,KAAK,CAAA;YACrB,CAAC;QACH,CAAC;QAED,sDAAsD;QACtD,MAAM,GAAG,GAAG,GAAG,GAAG,KAAK,CAAA;QACvB,IAAI,GAAG,GAAG,CAAC,EAAE,CAAC;YACZ,OAAO,SAAS,CAAA;QAClB,CAAC;QACD,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,KAAK,EAAE,IAAI,CAAC,CAAA;QACvD,OAAO;YACL,MAAM;YACN,GAAG;SACJ,CAAA;IACH,CAAC;CACF"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,yCAAoC;AACpC,qCAA4C;AAI5C,IAAM,UAAU,GAAG,KAAK,CAAA;AAExB,4EAA4E;AAC5E,iEAAiE;AACjE,IAAM,YAAY,GAAG,EAAE,CAAA;AAEvB;IAIE,cACS,OAA0B,EAC1B,MAAyB,EACzB,UAAe;QAAf,2BAAA,EAAA,eAAe;QAFf,YAAO,GAAP,OAAO,CAAmB;QAC1B,WAAM,GAAN,MAAM,CAAmB;QACzB,eAAU,GAAV,UAAU,CAAK;QANhB,YAAO,GAAG,IAAI,WAAW,CAAC,MAAM,CAAC,CAAA;IAOtC,CAAC;IAEE,qBAAM,GAAZ,UAAa,YAAoB,EAAE,IAA+B;;;;;;wBAC5D,SAAS,GAAG,EAAwB,CAAA;wBAClC,WAAW,GAAG,YAAY,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;wBACrC,SAAS,GAAG,WAAW,CAAC,CAAC,CAAC,CAAA;6BAG5B,SAAS,EAAT,wBAAS;wBACL,UAAU,GAAG,SAAS,CAAC,WAAW,EAAE,CAAA;wBAC9B,qBAAM,IAAI,CAAC,SAAS,CAAC,UAAU,EAAE,IAAI,CAAC,EAAA;;wBAA5C,GAAG,GAAG,SAAsC;wBAE5C,GAAG,GAAa,GAAG,IAAhB,EAAE,MAAM,GAAK,GAAG,OAAR,CAAQ;wBACrB,IAAI,GAAG,KAAK,CAAA;;;6BAET,CAAC,IAAI;wBACJ,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAA;wBAIjC,KAAK,GAAG,GAAG;6BACd,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;6BAC/B,KAAK,CAAC,IAAI,CAAC;6BACX,MAAM,CAAC,OAAO,CAAC,CAAA;wBAEZ,KAAK,GAAG,EAAc,CAAA;wBAC5B,WAAwB,EAAL,eAAK,EAAL,mBAAK,EAAL,IAAK,EAAE,CAAC;4BAAhB,IAAI;4BACP,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;4BAE/B,IAAI,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,EAAE,CAAC;gCAChC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;4BAClB,CAAC;iCAAM,IAAI,IAAI,GAAG,UAAU,EAAE,CAAC;gCAC7B,gEAAgE;gCAChE,oBAAoB;gCACpB,IAAI,GAAG,IAAI,CAAA;4BACb,CAAC;wBACH,CAAC;wBACK,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,UAAA,IAAI;4BACvB,IAAA,KAAmB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAjC,IAAI,QAAA,EAAK,KAAK,cAAmB,CAAA;4BACxC,OAAO,KAAK;iCACT,MAAM,CAAC,OAAO,CAAC;iCACf,GAAG,CAAC,UAAA,GAAG,IAAI,OAAA,CAAC,IAAI,EAAE,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAqB,EAA7C,CAA6C,CAAC,CAAA;wBAC9D,CAAC,CAAC,CAAA;wBAEF,SAAS,GAAG,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;wBAElC,qDAAqD;wBACrD,IAAI,IAAI,IAAI,SAAS,CAAC,MAAM,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;4BAChD,wBAAK;wBACP,CAAC;wBAGY,qBAAM,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,UAAU,EAAE,GAAG,EAAE,IAAI,CAAC,EAAA;;wBAApD,IAAI,GAAG,SAA6C;wBAC1D,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;4BACtB,wBAAK;wBACP,CAAC;wBACD,MAAM,GAAG,IAAA,0BAAgB,EAAC,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,CAAA;wBACzC,GAAG,IAAI,UAAU,CAAA;;;oBAIrB,iEAAiE;oBACjE,sBAAO,IAAA,kBAAM,EAAC,SAAS,EAAE,UAAA,GAAG,IAAI,OAAA,GAAG,CAAC,CAAC,CAAC,EAAN,CAAM,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,UAAU,CAAC,EAAA;;;;KAClE;IAEa,uBAAQ,GAAtB,UAAuB,IAA+B;;;;;;wBACpD,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;4BACpB,sBAAO,IAAI,CAAC,UAAU,EAAA;wBACxB,CAAC;wBACY,qBAAM,IAAI,CAAC,OAAO,CAAC,QAAQ,YACtC,QAAQ,EAAE,MAAM,IACb,IAAI,EACP,EAAA;;wBAHI,IAAI,GAAG,SAGX;wBACI,MAAM,GAAG,IAAI;6BAChB,KAAK,CAAC,IAAI,CAAC;6BACX,MAAM,CAAC,OAAO,CAAC;6BACf,GAAG,CAAC,UAAA,IAAI;4BACP,IAAM,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,YAAY,CAAA;4BACpC,IAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;4BAC/B,IAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;4BAC5B,IAAM,GAAG,GAAG,MAAM,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC,CAAA;4BACvC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAU,CAAA;wBAC/B,CAAC,CAAC,CAAA;wBACJ,IAAI,CAAC,UAAU,GAAG,MAAM,CAAA;wBACxB,sBAAO,MAAM,EAAA;;;;KACd;IAEa,wBAAS,GAAvB,UAAwB,UAAkB,EAAE,IAA+B;;;;;;wBACrE,KAAK,GAAG,CAAC,CAAA;wBACT,GAAG,GAAG,UAAU,CAAA;wBACJ,qBAAM,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAA;;wBAAnC,OAAO,GAAG,SAAyB;wBACzC,WAAkC,EAAP,mBAAO,EAAP,qBAAO,EAAP,IAAO,EAAE,CAAC;4BAA1B,kBAAY,EAAX,GAAG,QAAA,EAAE,KAAK,QAAA;4BACd,UAAU,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,UAAU,CAAC,MAAM,CAAC,CAAA;4BAClD,IAAI,UAAU,GAAG,UAAU,EAAE,CAAC;gCAC5B,KAAK,GAAG,KAAK,CAAA;gCACb,GAAG,GAAG,KAAK,GAAG,UAAU,CAAA;4BAC1B,CAAC;wBACH,CAAC;wBAEc,qBAAM,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,GAAG,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,EAAA;;wBAAzD,MAAM,GAAG,SAAgD;wBAC/D,sBAAO,EAAE,MAAM,QAAA,EAAE,GAAG,KAAA,EAAE,EAAA;;;;KACvB;IACH,WAAC;AAAD,CAAC,AA9GD,IA8GC"}

package/esm/util.js

@@ -1,14 +1,20 @@
-export function sum(array) {
-    let sum = 0;
-    for (const entry of array) {
-        sum += entry.length;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.sum = sum;
+exports.concatUint8Array = concatUint8Array;
+function sum(array) {
+    var total = 0;
+    for (var _i = 0, array_1 = array; _i < array_1.length; _i++) {
+        var entry = array_1[_i];
+        total += entry.length;
     }
-    return sum;
+    return total;
 }
-export function concatUint8Array(args) {
-    const mergedArray = new Uint8Array(sum(args));
-    let offset = 0;
-    for (const entry of args) {
+function concatUint8Array(args) {
+    var mergedArray = new Uint8Array(sum(args));
+    var offset = 0;
+    for (var _i = 0, args_1 = args; _i < args_1.length; _i++) {
+        var entry = args_1[_i];
         mergedArray.set(entry, offset);
         offset += entry.length;
     }

package/esm/util.js.map

@@ -1 +1 @@
-{"version":3,"file":"util.js","sourceRoot":"","sources":["../src/util.ts"],"names":[],"mappings":"AAAA,MAAM,UAAU,GAAG,CAAC,KAAmB;IACrC,IAAI,GAAG,GAAG,CAAC,CAAA;IACX,KAAK,MAAM,KAAK,IAAI,KAAK,EAAE,CAAC;QAC1B,GAAG,IAAI,KAAK,CAAC,MAAM,CAAA;IACrB,CAAC;IACD,OAAO,GAAG,CAAA;AACZ,CAAC;AACD,MAAM,UAAU,gBAAgB,CAAC,IAAkB;IACjD,MAAM,WAAW,GAAG,IAAI,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAA;IAC7C,IAAI,MAAM,GAAG,CAAC,CAAA;IACd,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;QACzB,WAAW,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAA;QAC9B,MAAM,IAAI,KAAK,CAAC,MAAM,CAAA;IACxB,CAAC;IACD,OAAO,WAAW,CAAA;AACpB,CAAC"}
+{"version":3,"file":"util.js","sourceRoot":"","sources":["../src/util.ts"],"names":[],"mappings":";;AAAA,kBAMC;AACD,4CAQC;AAfD,SAAgB,GAAG,CAAC,KAAmB;IACrC,IAAI,KAAK,GAAG,CAAC,CAAA;IACb,KAAoB,UAAK,EAAL,eAAK,EAAL,mBAAK,EAAL,IAAK,EAAE,CAAC;QAAvB,IAAM,KAAK,cAAA;QACd,KAAK,IAAI,KAAK,CAAC,MAAM,CAAA;IACvB,CAAC;IACD,OAAO,KAAK,CAAA;AACd,CAAC;AACD,SAAgB,gBAAgB,CAAC,IAAkB;IACjD,IAAM,WAAW,GAAG,IAAI,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAA;IAC7C,IAAI,MAAM,GAAG,CAAC,CAAA;IACd,KAAoB,UAAI,EAAJ,aAAI,EAAJ,kBAAI,EAAJ,IAAI,EAAE,CAAC;QAAtB,IAAM,KAAK,aAAA;QACd,WAAW,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAA;QAC9B,MAAM,IAAI,KAAK,CAAC,MAAM,CAAA;IACxB,CAAC;IACD,OAAO,WAAW,CAAA;AACpB,CAAC"}

package/package.json

@@ -1,8 +1,17 @@
 {
-  "version": "3.0.4",
+  "name": "@gmod/trix",
+  "version": "3.0.6",
   "license": "Apache-2.0",
-  "main": "dist/index.js",
-  "module": "esm/index.js",
+  "type": "module",
+  "types": "./dist/index.d.ts",
+  "exports": {
+    "import": {
+      "import": "./esm/index.js"
+    },
+    "require": {
+      "require": "./dist/index.js"
+    }
+  },
   "files": [
     "dist",
     "esm",
@@ -12,32 +21,33 @@
     "node": ">=10"
   },
   "scripts": {
+    "test": "vitest",
     "lint": "eslint --report-unused-disable-directives --max-warnings 0",
-    "prebuild": "rimraf dist esm",
-    "build:esm": "tsc --target esnext --outDir esm",
-    "build:es5": "tsc --target es2015 --outDir dist --module commonjs",
-    "build": "npm run build:esm && npm run build:es5",
-    "preversion": "npm run lint && npm test run && npm run build",
+    "clean": "rimraf dist esm",
+    "format": "prettier --write .",
+    "build:esm": "tsc --outDir esm",
+    "build:es5": "tsc --module commonjs --outDir dist",
+    "build": "yarn build:esm && yarn build:es5",
+    "prebuild": "yarn clean",
     "postbuild:es5": "echo '{\"type\": \"commonjs\"}' > dist/package.json",
-    "postversion": "git push --follow-tags",
-    "test": "vitest"
+    "preversion": "yarn lint && yarn test --run && yarn build",
+    "postversion": "git push --follow-tags"
   },
-  "name": "@gmod/trix",
   "author": "Matt Morgan",
   "repository": "GMOD/trix-js",
   "devDependencies": {
-    "@types/node": "^22.15.21",
-    "@typescript-eslint/eslint-plugin": "^8.4.0",
-    "@typescript-eslint/parser": "^8.4.0",
+    "@types/node": "^25.0.9",
+    "@typescript-eslint/eslint-plugin": "^8.53.0",
+    "@typescript-eslint/parser": "^8.53.0",
     "eslint": "^9.0.0",
     "eslint-plugin-import": "^2.31.0",
     "eslint-plugin-unicorn": "^62.0.0",
-    "generic-filehandle2": "^2.0.5",
-    "prettier": "^3.3.3",
+    "generic-filehandle2": "^2.0.18",
+    "prettier": "^3.8.0",
     "rimraf": "^6.0.1",
     "typescript": "^5.7.0",
-    "typescript-eslint": "^8.4.0",
-    "vitest": "^4.0.6"
+    "typescript-eslint": "^8.53.0",
+    "vitest": "^4.0.17"
   },
   "publishConfig": {
     "access": "public"

package/src/index.ts

@@ -10,6 +10,9 @@ const CHUNK_SIZE = 65536
 const ADDRESS_SIZE = 10
 
 export default class Trix {
+  private decoder = new TextDecoder('utf8')
+  private indexCache?: readonly (readonly [string, number])[]
+
   constructor(
     public ixxFile: GenericFilehandle,
     public ixFile: GenericFilehandle,
@@ -19,71 +22,60 @@ export default class Trix {
   async search(searchString: string, opts?: { signal?: AbortSignal }) {
     let resultArr = [] as [string, string][]
     const searchWords = searchString.split(' ')
+    const firstWord = searchWords[0]
+
+    // validate that we have a non-empty search term
+    if (firstWord) {
+      const searchWord = firstWord.toLowerCase()
+      const res = await this.getBuffer(searchWord, opts)
+
+      let { end, buffer } = res
+      let done = false
+      // eslint-disable-next-line @typescript-eslint/no-unnecessary-condition
+      while (!done) {
+        const str = this.decoder.decode(buffer)
+
+        // slice to lastIndexOf('\n') to make sure we get complete records
+        // since the buffer fetch could get halfway into a record
+        const lines = str
+          .slice(0, str.lastIndexOf('\n'))
+          .split('\n')
+          .filter(Boolean)
+
+        const hits2 = [] as string[]
+        for (const line of lines) {
+          const word = line.split(' ')[0]
+
+          if (word.startsWith(searchWord)) {
+            hits2.push(line)
+          } else if (word > searchWord) {
+            // we are done scanning if we are lexicographically greater than
+            // the search string
+            done = true
+          }
+        }
+        const hits = hits2.flatMap(line => {
+          const [term, ...parts] = line.split(' ')
+          return parts
+            .filter(Boolean)
+            .map(elt => [term, elt.split(',')[0]] as [string, string])
+        })
 
-    // we only search one word at a time
-    const searchWord = searchWords[0].toLowerCase()
-    const res = await this._getBuffer(searchWord, opts)
-    if (!res) {
-      return []
-    }
+        resultArr = resultArr.concat(hits)
 
-    let { end, buffer } = res
-    let done = false
-    const decoder = new TextDecoder('utf8')
-    // eslint-disable-next-line @typescript-eslint/no-unnecessary-condition
-    while (!done) {
-      let foundSomething = false
-      const str = decoder.decode(buffer)
-
-      // slice to lastIndexOf('\n') to make sure we get complete records
-      // since the buffer fetch could get halfway into a record
-      const lines = str
-        .slice(0, str.lastIndexOf('\n'))
-        .split('\n')
-        .filter(f => !!f)
-
-      const hits2 = [] as string[]
-      for (const line of lines) {
-        const word = line.split(' ')[0]
-        const match = word.startsWith(searchWord)
-        if (!foundSomething && match) {
-          foundSomething = true
+        // if we are done or have filled up maxResults, break
+        if (done || resultArr.length >= this.maxResults) {
+          break
         }
 
-        // we are done scanning if we are lexicographically greater than the
-        // search string
-        if (word.slice(0, searchWord.length) > searchWord) {
-          done = true
-        }
-        if (match) {
-          hits2.push(line)
-        }
-      }
-      const hits = hits2.flatMap(line => {
-        const [term, ...parts] = line.split(' ')
-        return parts.map(elt => [term, elt.split(',')[0]] as [string, string])
-      })
-
-      // if we are not done, and we haven't filled up maxResults with hits yet,
-      // then refetch
-      if (resultArr.length + hits.length < this.maxResults && !done) {
+        // fetch more data
         const res2 = await this.ixFile.read(CHUNK_SIZE, end, opts)
-
-        // early break if empty response
         if (res2.length === 0) {
-          resultArr = resultArr.concat(hits)
           break
         }
         buffer = concatUint8Array([buffer, res2])
         end += CHUNK_SIZE
       }
-
-      // if we have filled up the hits, or we are detected to be done via the
-      // filtering, then return
-      else if (resultArr.length + hits.length >= this.maxResults || done) {
-        resultArr = resultArr.concat(hits)
-        break
-      }
     }
 
     // de-duplicate results based on the detail column (resultArr[1])
@@ -91,13 +83,16 @@ export default class Trix {
   }
 
   private async getIndex(opts?: { signal?: AbortSignal }) {
+    if (this.indexCache) {
+      return this.indexCache
+    }
     const file = await this.ixxFile.readFile({
       encoding: 'utf8',
       ...opts,
     })
-    return file
+    const result = file
       .split('\n')
-      .filter(f => !!f)
+      .filter(Boolean)
       .map(line => {
         const p = line.length - ADDRESS_SIZE
         const prefix = line.slice(0, p)
@@ -105,32 +100,23 @@ export default class Trix {
         const pos = Number.parseInt(posStr, 16)
         return [prefix, pos] as const
       })
+    this.indexCache = result
+    return result
   }
 
-  private async _getBuffer(
-    searchWord: string,
-    opts?: { signal?: AbortSignal },
-  ) {
+  private async getBuffer(searchWord: string, opts?: { signal?: AbortSignal }) {
     let start = 0
-    let end = 65536
+    let end = CHUNK_SIZE
     const indexes = await this.getIndex(opts)
     for (const [key, value] of indexes) {
       const trimmedKey = key.slice(0, searchWord.length)
       if (trimmedKey < searchWord) {
         start = value
-        end = value + 65536
+        end = value + CHUNK_SIZE
       }
     }
 
-    // Return the buffer and its end position in the file.
-    const len = end - start
-    if (len < 0) {
-      return undefined
-    }
-    const buffer = await this.ixFile.read(len, start, opts)
-    return {
-      buffer,
-      end,
-    }
+    const buffer = await this.ixFile.read(end - start, start, opts)
+    return { buffer, end }
   }
 }

package/src/util.ts

@@ -1,9 +1,9 @@
 export function sum(array: Uint8Array[]) {
-  let sum = 0
+  let total = 0
   for (const entry of array) {
-    sum += entry.length
+    total += entry.length
   }
-  return sum
+  return total
 }
 export function concatUint8Array(args: Uint8Array[]) {
   const mergedArray = new Uint8Array(sum(args))