@gmod/trix 0.2.0 → 2.0.0

package/dist/trix.esm.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"trix.esm.js","sources":["../node_modules/regenerator-runtime/runtime.js","../src/index.ts"],"sourcesContent":["/**\n * Copyright (c) 2014-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n */\n\nvar runtime = (function (exports) {\n  \"use strict\";\n\n  var Op = Object.prototype;\n  var hasOwn = Op.hasOwnProperty;\n  var undefined; // More compressible than void 0.\n  var $Symbol = typeof Symbol === \"function\" ? Symbol : {};\n  var iteratorSymbol = $Symbol.iterator || \"@@iterator\";\n  var asyncIteratorSymbol = $Symbol.asyncIterator || \"@@asyncIterator\";\n  var toStringTagSymbol = $Symbol.toStringTag || \"@@toStringTag\";\n\n  function define(obj, key, value) {\n    Object.defineProperty(obj, key, {\n      value: value,\n      enumerable: true,\n      configurable: true,\n      writable: true\n    });\n    return obj[key];\n  }\n  try {\n    // IE 8 has a broken Object.defineProperty that only works on DOM objects.\n    define({}, \"\");\n  } catch (err) {\n    define = function(obj, key, value) {\n      return obj[key] = value;\n    };\n  }\n\n  function wrap(innerFn, outerFn, self, tryLocsList) {\n    // If outerFn provided and outerFn.prototype is a Generator, then outerFn.prototype instanceof Generator.\n    var protoGenerator = outerFn && outerFn.prototype instanceof Generator ? outerFn : Generator;\n    var generator = Object.create(protoGenerator.prototype);\n    var context = new Context(tryLocsList || []);\n\n    // The ._invoke method unifies the implementations of the .next,\n    // .throw, and .return methods.\n    generator._invoke = makeInvokeMethod(innerFn, self, context);\n\n    return generator;\n  }\n  exports.wrap = wrap;\n\n  // Try/catch helper to minimize deoptimizations. Returns a completion\n  // record like context.tryEntries[i].completion. This interface could\n  // have been (and was previously) designed to take a closure to be\n  // invoked without arguments, but in all the cases we care about we\n  // already have an existing method we want to call, so there's no need\n  // to create a new function object. We can even get away with assuming\n  // the method takes exactly one argument, since that happens to be true\n  // in every case, so we don't have to touch the arguments object. The\n  // only additional allocation required is the completion record, which\n  // has a stable shape and so hopefully should be cheap to allocate.\n  function tryCatch(fn, obj, arg) {\n    try {\n      return { type: \"normal\", arg: fn.call(obj, arg) };\n    } catch (err) {\n      return { type: \"throw\", arg: err };\n    }\n  }\n\n  var GenStateSuspendedStart = \"suspendedStart\";\n  var GenStateSuspendedYield = \"suspendedYield\";\n  var GenStateExecuting = \"executing\";\n  var GenStateCompleted = \"completed\";\n\n  // Returning this object from the innerFn has the same effect as\n  // breaking out of the dispatch switch statement.\n  var ContinueSentinel = {};\n\n  // Dummy constructor functions that we use as the .constructor and\n  // .constructor.prototype properties for functions that return Generator\n  // objects. For full spec compliance, you may wish to configure your\n  // minifier not to mangle the names of these two functions.\n  function Generator() {}\n  function GeneratorFunction() {}\n  function GeneratorFunctionPrototype() {}\n\n  // This is a polyfill for %IteratorPrototype% for environments that\n  // don't natively support it.\n  var IteratorPrototype = {};\n  IteratorPrototype[iteratorSymbol] = function () {\n    return this;\n  };\n\n  var getProto = Object.getPrototypeOf;\n  var NativeIteratorPrototype = getProto && getProto(getProto(values([])));\n  if (NativeIteratorPrototype &&\n      NativeIteratorPrototype !== Op &&\n      hasOwn.call(NativeIteratorPrototype, iteratorSymbol)) {\n    // This environment has a native %IteratorPrototype%; use it instead\n    // of the polyfill.\n    IteratorPrototype = NativeIteratorPrototype;\n  }\n\n  var Gp = GeneratorFunctionPrototype.prototype =\n    Generator.prototype = Object.create(IteratorPrototype);\n  GeneratorFunction.prototype = Gp.constructor = GeneratorFunctionPrototype;\n  GeneratorFunctionPrototype.constructor = GeneratorFunction;\n  GeneratorFunction.displayName = define(\n    GeneratorFunctionPrototype,\n    toStringTagSymbol,\n    \"GeneratorFunction\"\n  );\n\n  // Helper for defining the .next, .throw, and .return methods of the\n  // Iterator interface in terms of a single ._invoke method.\n  function defineIteratorMethods(prototype) {\n    [\"next\", \"throw\", \"return\"].forEach(function(method) {\n      define(prototype, method, function(arg) {\n        return this._invoke(method, arg);\n      });\n    });\n  }\n\n  exports.isGeneratorFunction = function(genFun) {\n    var ctor = typeof genFun === \"function\" && genFun.constructor;\n    return ctor\n      ? ctor === GeneratorFunction ||\n        // For the native GeneratorFunction constructor, the best we can\n        // do is to check its .name property.\n        (ctor.displayName || ctor.name) === \"GeneratorFunction\"\n      : false;\n  };\n\n  exports.mark = function(genFun) {\n    if (Object.setPrototypeOf) {\n      Object.setPrototypeOf(genFun, GeneratorFunctionPrototype);\n    } else {\n      genFun.__proto__ = GeneratorFunctionPrototype;\n      define(genFun, toStringTagSymbol, \"GeneratorFunction\");\n    }\n    genFun.prototype = Object.create(Gp);\n    return genFun;\n  };\n\n  // Within the body of any async function, `await x` is transformed to\n  // `yield regeneratorRuntime.awrap(x)`, so that the runtime can test\n  // `hasOwn.call(value, \"__await\")` to determine if the yielded value is\n  // meant to be awaited.\n  exports.awrap = function(arg) {\n    return { __await: arg };\n  };\n\n  function AsyncIterator(generator, PromiseImpl) {\n    function invoke(method, arg, resolve, reject) {\n      var record = tryCatch(generator[method], generator, arg);\n      if (record.type === \"throw\") {\n        reject(record.arg);\n      } else {\n        var result = record.arg;\n        var value = result.value;\n        if (value &&\n            typeof value === \"object\" &&\n            hasOwn.call(value, \"__await\")) {\n          return PromiseImpl.resolve(value.__await).then(function(value) {\n            invoke(\"next\", value, resolve, reject);\n          }, function(err) {\n            invoke(\"throw\", err, resolve, reject);\n          });\n        }\n\n        return PromiseImpl.resolve(value).then(function(unwrapped) {\n          // When a yielded Promise is resolved, its final value becomes\n          // the .value of the Promise<{value,done}> result for the\n          // current iteration.\n          result.value = unwrapped;\n          resolve(result);\n        }, function(error) {\n          // If a rejected Promise was yielded, throw the rejection back\n          // into the async generator function so it can be handled there.\n          return invoke(\"throw\", error, resolve, reject);\n        });\n      }\n    }\n\n    var previousPromise;\n\n    function enqueue(method, arg) {\n      function callInvokeWithMethodAndArg() {\n        return new PromiseImpl(function(resolve, reject) {\n          invoke(method, arg, resolve, reject);\n        });\n      }\n\n      return previousPromise =\n        // If enqueue has been called before, then we want to wait until\n        // all previous Promises have been resolved before calling invoke,\n        // so that results are always delivered in the correct order. If\n        // enqueue has not been called before, then it is important to\n        // call invoke immediately, without waiting on a callback to fire,\n        // so that the async generator function has the opportunity to do\n        // any necessary setup in a predictable way. This predictability\n        // is why the Promise constructor synchronously invokes its\n        // executor callback, and why async functions synchronously\n        // execute code before the first await. Since we implement simple\n        // async functions in terms of async generators, it is especially\n        // important to get this right, even though it requires care.\n        previousPromise ? previousPromise.then(\n          callInvokeWithMethodAndArg,\n          // Avoid propagating failures to Promises returned by later\n          // invocations of the iterator.\n          callInvokeWithMethodAndArg\n        ) : callInvokeWithMethodAndArg();\n    }\n\n    // Define the unified helper method that is used to implement .next,\n    // .throw, and .return (see defineIteratorMethods).\n    this._invoke = enqueue;\n  }\n\n  defineIteratorMethods(AsyncIterator.prototype);\n  AsyncIterator.prototype[asyncIteratorSymbol] = function () {\n    return this;\n  };\n  exports.AsyncIterator = AsyncIterator;\n\n  // Note that simple async functions are implemented on top of\n  // AsyncIterator objects; they just return a Promise for the value of\n  // the final result produced by the iterator.\n  exports.async = function(innerFn, outerFn, self, tryLocsList, PromiseImpl) {\n    if (PromiseImpl === void 0) PromiseImpl = Promise;\n\n    var iter = new AsyncIterator(\n      wrap(innerFn, outerFn, self, tryLocsList),\n      PromiseImpl\n    );\n\n    return exports.isGeneratorFunction(outerFn)\n      ? iter // If outerFn is a generator, return the full iterator.\n      : iter.next().then(function(result) {\n          return result.done ? result.value : iter.next();\n        });\n  };\n\n  function makeInvokeMethod(innerFn, self, context) {\n    var state = GenStateSuspendedStart;\n\n    return function invoke(method, arg) {\n      if (state === GenStateExecuting) {\n        throw new Error(\"Generator is already running\");\n      }\n\n      if (state === GenStateCompleted) {\n        if (method === \"throw\") {\n          throw arg;\n        }\n\n        // Be forgiving, per 25.3.3.3.3 of the spec:\n        // https://people.mozilla.org/~jorendorff/es6-draft.html#sec-generatorresume\n        return doneResult();\n      }\n\n      context.method = method;\n      context.arg = arg;\n\n      while (true) {\n        var delegate = context.delegate;\n        if (delegate) {\n          var delegateResult = maybeInvokeDelegate(delegate, context);\n          if (delegateResult) {\n            if (delegateResult === ContinueSentinel) continue;\n            return delegateResult;\n          }\n        }\n\n        if (context.method === \"next\") {\n          // Setting context._sent for legacy support of Babel's\n          // function.sent implementation.\n          context.sent = context._sent = context.arg;\n\n        } else if (context.method === \"throw\") {\n          if (state === GenStateSuspendedStart) {\n            state = GenStateCompleted;\n            throw context.arg;\n          }\n\n          context.dispatchException(context.arg);\n\n        } else if (context.method === \"return\") {\n          context.abrupt(\"return\", context.arg);\n        }\n\n        state = GenStateExecuting;\n\n        var record = tryCatch(innerFn, self, context);\n        if (record.type === \"normal\") {\n          // If an exception is thrown from innerFn, we leave state ===\n          // GenStateExecuting and loop back for another invocation.\n          state = context.done\n            ? GenStateCompleted\n            : GenStateSuspendedYield;\n\n          if (record.arg === ContinueSentinel) {\n            continue;\n          }\n\n          return {\n            value: record.arg,\n            done: context.done\n          };\n\n        } else if (record.type === \"throw\") {\n          state = GenStateCompleted;\n          // Dispatch the exception by looping back around to the\n          // context.dispatchException(context.arg) call above.\n          context.method = \"throw\";\n          context.arg = record.arg;\n        }\n      }\n    };\n  }\n\n  // Call delegate.iterator[context.method](context.arg) and handle the\n  // result, either by returning a { value, done } result from the\n  // delegate iterator, or by modifying context.method and context.arg,\n  // setting context.delegate to null, and returning the ContinueSentinel.\n  function maybeInvokeDelegate(delegate, context) {\n    var method = delegate.iterator[context.method];\n    if (method === undefined) {\n      // A .throw or .return when the delegate iterator has no .throw\n      // method always terminates the yield* loop.\n      context.delegate = null;\n\n      if (context.method === \"throw\") {\n        // Note: [\"return\"] must be used for ES3 parsing compatibility.\n        if (delegate.iterator[\"return\"]) {\n          // If the delegate iterator has a return method, give it a\n          // chance to clean up.\n          context.method = \"return\";\n          context.arg = undefined;\n          maybeInvokeDelegate(delegate, context);\n\n          if (context.method === \"throw\") {\n            // If maybeInvokeDelegate(context) changed context.method from\n            // \"return\" to \"throw\", let that override the TypeError below.\n            return ContinueSentinel;\n          }\n        }\n\n        context.method = \"throw\";\n        context.arg = new TypeError(\n          \"The iterator does not provide a 'throw' method\");\n      }\n\n      return ContinueSentinel;\n    }\n\n    var record = tryCatch(method, delegate.iterator, context.arg);\n\n    if (record.type === \"throw\") {\n      context.method = \"throw\";\n      context.arg = record.arg;\n      context.delegate = null;\n      return ContinueSentinel;\n    }\n\n    var info = record.arg;\n\n    if (! info) {\n      context.method = \"throw\";\n      context.arg = new TypeError(\"iterator result is not an object\");\n      context.delegate = null;\n      return ContinueSentinel;\n    }\n\n    if (info.done) {\n      // Assign the result of the finished delegate to the temporary\n      // variable specified by delegate.resultName (see delegateYield).\n      context[delegate.resultName] = info.value;\n\n      // Resume execution at the desired location (see delegateYield).\n      context.next = delegate.nextLoc;\n\n      // If context.method was \"throw\" but the delegate handled the\n      // exception, let the outer generator proceed normally. If\n      // context.method was \"next\", forget context.arg since it has been\n      // \"consumed\" by the delegate iterator. If context.method was\n      // \"return\", allow the original .return call to continue in the\n      // outer generator.\n      if (context.method !== \"return\") {\n        context.method = \"next\";\n        context.arg = undefined;\n      }\n\n    } else {\n      // Re-yield the result returned by the delegate method.\n      return info;\n    }\n\n    // The delegate iterator is finished, so forget it and continue with\n    // the outer generator.\n    context.delegate = null;\n    return ContinueSentinel;\n  }\n\n  // Define Generator.prototype.{next,throw,return} in terms of the\n  // unified ._invoke helper method.\n  defineIteratorMethods(Gp);\n\n  define(Gp, toStringTagSymbol, \"Generator\");\n\n  // A Generator should always return itself as the iterator object when the\n  // @@iterator function is called on it. Some browsers' implementations of the\n  // iterator prototype chain incorrectly implement this, causing the Generator\n  // object to not be returned from this call. This ensures that doesn't happen.\n  // See https://github.com/facebook/regenerator/issues/274 for more details.\n  Gp[iteratorSymbol] = function() {\n    return this;\n  };\n\n  Gp.toString = function() {\n    return \"[object Generator]\";\n  };\n\n  function pushTryEntry(locs) {\n    var entry = { tryLoc: locs[0] };\n\n    if (1 in locs) {\n      entry.catchLoc = locs[1];\n    }\n\n    if (2 in locs) {\n      entry.finallyLoc = locs[2];\n      entry.afterLoc = locs[3];\n    }\n\n    this.tryEntries.push(entry);\n  }\n\n  function resetTryEntry(entry) {\n    var record = entry.completion || {};\n    record.type = \"normal\";\n    delete record.arg;\n    entry.completion = record;\n  }\n\n  function Context(tryLocsList) {\n    // The root entry object (effectively a try statement without a catch\n    // or a finally block) gives us a place to store values thrown from\n    // locations where there is no enclosing try statement.\n    this.tryEntries = [{ tryLoc: \"root\" }];\n    tryLocsList.forEach(pushTryEntry, this);\n    this.reset(true);\n  }\n\n  exports.keys = function(object) {\n    var keys = [];\n    for (var key in object) {\n      keys.push(key);\n    }\n    keys.reverse();\n\n    // Rather than returning an object with a next method, we keep\n    // things simple and return the next function itself.\n    return function next() {\n      while (keys.length) {\n        var key = keys.pop();\n        if (key in object) {\n          next.value = key;\n          next.done = false;\n          return next;\n        }\n      }\n\n      // To avoid creating an additional object, we just hang the .value\n      // and .done properties off the next function object itself. This\n      // also ensures that the minifier will not anonymize the function.\n      next.done = true;\n      return next;\n    };\n  };\n\n  function values(iterable) {\n    if (iterable) {\n      var iteratorMethod = iterable[iteratorSymbol];\n      if (iteratorMethod) {\n        return iteratorMethod.call(iterable);\n      }\n\n      if (typeof iterable.next === \"function\") {\n        return iterable;\n      }\n\n      if (!isNaN(iterable.length)) {\n        var i = -1, next = function next() {\n          while (++i < iterable.length) {\n            if (hasOwn.call(iterable, i)) {\n              next.value = iterable[i];\n              next.done = false;\n              return next;\n            }\n          }\n\n          next.value = undefined;\n          next.done = true;\n\n          return next;\n        };\n\n        return next.next = next;\n      }\n    }\n\n    // Return an iterator with no values.\n    return { next: doneResult };\n  }\n  exports.values = values;\n\n  function doneResult() {\n    return { value: undefined, done: true };\n  }\n\n  Context.prototype = {\n    constructor: Context,\n\n    reset: function(skipTempReset) {\n      this.prev = 0;\n      this.next = 0;\n      // Resetting context._sent for legacy support of Babel's\n      // function.sent implementation.\n      this.sent = this._sent = undefined;\n      this.done = false;\n      this.delegate = null;\n\n      this.method = \"next\";\n      this.arg = undefined;\n\n      this.tryEntries.forEach(resetTryEntry);\n\n      if (!skipTempReset) {\n        for (var name in this) {\n          // Not sure about the optimal order of these conditions:\n          if (name.charAt(0) === \"t\" &&\n              hasOwn.call(this, name) &&\n              !isNaN(+name.slice(1))) {\n            this[name] = undefined;\n          }\n        }\n      }\n    },\n\n    stop: function() {\n      this.done = true;\n\n      var rootEntry = this.tryEntries[0];\n      var rootRecord = rootEntry.completion;\n      if (rootRecord.type === \"throw\") {\n        throw rootRecord.arg;\n      }\n\n      return this.rval;\n    },\n\n    dispatchException: function(exception) {\n      if (this.done) {\n        throw exception;\n      }\n\n      var context = this;\n      function handle(loc, caught) {\n        record.type = \"throw\";\n        record.arg = exception;\n        context.next = loc;\n\n        if (caught) {\n          // If the dispatched exception was caught by a catch block,\n          // then let that catch block handle the exception normally.\n          context.method = \"next\";\n          context.arg = undefined;\n        }\n\n        return !! caught;\n      }\n\n      for (var i = this.tryEntries.length - 1; i >= 0; --i) {\n        var entry = this.tryEntries[i];\n        var record = entry.completion;\n\n        if (entry.tryLoc === \"root\") {\n          // Exception thrown outside of any try block that could handle\n          // it, so set the completion value of the entire function to\n          // throw the exception.\n          return handle(\"end\");\n        }\n\n        if (entry.tryLoc <= this.prev) {\n          var hasCatch = hasOwn.call(entry, \"catchLoc\");\n          var hasFinally = hasOwn.call(entry, \"finallyLoc\");\n\n          if (hasCatch && hasFinally) {\n            if (this.prev < entry.catchLoc) {\n              return handle(entry.catchLoc, true);\n            } else if (this.prev < entry.finallyLoc) {\n              return handle(entry.finallyLoc);\n            }\n\n          } else if (hasCatch) {\n            if (this.prev < entry.catchLoc) {\n              return handle(entry.catchLoc, true);\n            }\n\n          } else if (hasFinally) {\n            if (this.prev < entry.finallyLoc) {\n              return handle(entry.finallyLoc);\n            }\n\n          } else {\n            throw new Error(\"try statement without catch or finally\");\n          }\n        }\n      }\n    },\n\n    abrupt: function(type, arg) {\n      for (var i = this.tryEntries.length - 1; i >= 0; --i) {\n        var entry = this.tryEntries[i];\n        if (entry.tryLoc <= this.prev &&\n            hasOwn.call(entry, \"finallyLoc\") &&\n            this.prev < entry.finallyLoc) {\n          var finallyEntry = entry;\n          break;\n        }\n      }\n\n      if (finallyEntry &&\n          (type === \"break\" ||\n           type === \"continue\") &&\n          finallyEntry.tryLoc <= arg &&\n          arg <= finallyEntry.finallyLoc) {\n        // Ignore the finally entry if control is not jumping to a\n        // location outside the try/catch block.\n        finallyEntry = null;\n      }\n\n      var record = finallyEntry ? finallyEntry.completion : {};\n      record.type = type;\n      record.arg = arg;\n\n      if (finallyEntry) {\n        this.method = \"next\";\n        this.next = finallyEntry.finallyLoc;\n        return ContinueSentinel;\n      }\n\n      return this.complete(record);\n    },\n\n    complete: function(record, afterLoc) {\n      if (record.type === \"throw\") {\n        throw record.arg;\n      }\n\n      if (record.type === \"break\" ||\n          record.type === \"continue\") {\n        this.next = record.arg;\n      } else if (record.type === \"return\") {\n        this.rval = this.arg = record.arg;\n        this.method = \"return\";\n        this.next = \"end\";\n      } else if (record.type === \"normal\" && afterLoc) {\n        this.next = afterLoc;\n      }\n\n      return ContinueSentinel;\n    },\n\n    finish: function(finallyLoc) {\n      for (var i = this.tryEntries.length - 1; i >= 0; --i) {\n        var entry = this.tryEntries[i];\n        if (entry.finallyLoc === finallyLoc) {\n          this.complete(entry.completion, entry.afterLoc);\n          resetTryEntry(entry);\n          return ContinueSentinel;\n        }\n      }\n    },\n\n    \"catch\": function(tryLoc) {\n      for (var i = this.tryEntries.length - 1; i >= 0; --i) {\n        var entry = this.tryEntries[i];\n        if (entry.tryLoc === tryLoc) {\n          var record = entry.completion;\n          if (record.type === \"throw\") {\n            var thrown = record.arg;\n            resetTryEntry(entry);\n          }\n          return thrown;\n        }\n      }\n\n      // The context.catch method must only be called with a location\n      // argument that corresponds to a known catch block.\n      throw new Error(\"illegal catch attempt\");\n    },\n\n    delegateYield: function(iterable, resultName, nextLoc) {\n      this.delegate = {\n        iterator: values(iterable),\n        resultName: resultName,\n        nextLoc: nextLoc\n      };\n\n      if (this.method === \"next\") {\n        // Deliberately forget the last sent value so that we don't\n        // accidentally pass it on to the delegate.\n        this.arg = undefined;\n      }\n\n      return ContinueSentinel;\n    }\n  };\n\n  // Regardless of whether this script is executing as a CommonJS module\n  // or not, return the runtime object so that we can declare the variable\n  // regeneratorRuntime in the outer scope, which allows this module to be\n  // injected easily by `bin/regenerator --include-runtime script.js`.\n  return exports;\n\n}(\n  // If this script is executing as a CommonJS module, use module.exports\n  // as the regeneratorRuntime namespace. Otherwise create a new empty\n  // object. Either way, the resulting object will be used to initialize\n  // the regeneratorRuntime variable at the top of this file.\n  typeof module === \"object\" ? module.exports : {}\n));\n\ntry {\n  regeneratorRuntime = runtime;\n} catch (accidentalStrictMode) {\n  // This module should not be running in strict mode, so the above\n  // assignment should always work unless something is misconfigured. Just\n  // in case runtime.js accidentally runs in strict mode, we can escape\n  // strict mode using a global Function call. This could conceivably fail\n  // if a Content Security Policy forbids using Function, but in that case\n  // the proper solution is to fix the accidental strict mode problem. If\n  // you've misconfigured your bundler to force strict mode and applied a\n  // CSP to forbid Function, and you're not willing to fix either of those\n  // problems, please detail your unique predicament in a GitHub issue.\n  Function(\"r\", \"regeneratorRuntime = r\")(runtime);\n}\n","import type { FileHandle } from 'fs/promises';\nimport type { LocalFile, RemoteFile, BlobFile } from 'generic-filehandle';\n\ntype AnyFile = LocalFile | RemoteFile | BlobFile | FileHandle\ntype ParsedIxx = Map<string, number>;\n\nconst trixPrefixSize = 5;\n\n\n// Define this object with .ixx and .ix files.\n// Then use the trixSearch() function to search for a word.\nexport default class Trix {\n  private index: Promise<ParsedIxx>;\n  private ixFile: AnyFile;\n  maxResults: number;\n\n  /**\n   * @param ixxFile [anyFile] the second-level trix index file produced by ixIxx.\n   * @param ixFile [anyFile] the first-level trix index file produced by ixIxx.\n   * @param maxResults [number] the maximum number of results to return. Default is set to 20.\n   */\n  constructor(ixxFile: AnyFile, ixFile: AnyFile, maxResults: number = 20) {\n    this.index = this._parseIxx(ixxFile);\n    this.ixFile = ixFile;\n    this.maxResults = maxResults;\n  }\n\n  \n  /**\n   * Search trix for the given searchWord(s). Return up to {this.maxResults} results.\n   * This method matches each index prefix against each searchWord. It does not do fuzzy matching.\n   *\n   * @param searchString [string] term(s) separated by spaces to search for id(s).\n   * @returns results [Array<string>] where each string is a corresponding itemId.\n   */\n  async search(searchString: string) {\n\n    // If there is one search word, store results in resultArr.\n    let resultArr: Array<string> = [];\n\n    // If there are multiple words, store results in initialSet.\n    // firstWord indicates we are iterating the first time.\n    let firstWord: boolean = true;\n    let initialSet = new Set<string>();\n\n    let searchWords = searchString.split(' ');\n\n    // Loop for each word in searchWords.\n    // If there are more than one searchWords, use resultSet and only take the matching terms\n    // that are also in initialSet. \n    // Otherwise, just iterate once and add words to resultArr.\n    for (let w = 0; w < searchWords.length; w++) {\n      let searchWord = searchWords[w];\n      searchWord = searchWord.toLowerCase();\n\n      // 1. Seek ahead to byte `this.index` of `ixFile`. Load this section of .ix data into the buffer.\n      let bufData = await this._getBuffer(searchWord);\n      let buf: Buffer = bufData.buf;\n      let bufPos = bufData.bufEndPos;\n      let resultSet = new Set<string>();\n      let linePtr = 0;\n      let numValues = 0;\n\n      // 2. Iterate through the entire buffer\n      while (linePtr < buf.byteLength) {\n        let startsWith = true;\n        let done = false;\n        let i = linePtr;\n\n        // 3. Check if the first word in the current line has the same prefix as searchWord.\n\n        // Iterate through each char of the line in the buffer.\n        // break out of loop when we hit a \\n (unicode char 10) or the searchWord does not match the line.\n        while (buf[i] != 10) {\n\n          if (i >= buf.byteLength) {\n            \n            // In this case, we ran out of our current buffer, but could still find more matches.\n            // Load another chunk in to buf and repeat.\n            let tempBufData = await this._getNextChunk(bufPos);\n            if (tempBufData) {\n              buf = tempBufData.buf;\n              bufPos = tempBufData.bufEndPos;              \n              i = 0;\n              linePtr = 0;\n            }\n            else {\n              // If tempBufData is null, we reached the end of the file, so we are done.\n              done = true;\n              break;\n            }\n          }\n\n          \n          if (startsWith) {\n              let cur = String.fromCharCode(buf[i]);\n\n            if (i < linePtr + searchWord.length && searchWord[i - linePtr] > cur) {\n              // searchWord[i] > cur, so keep looping.\n              startsWith = false;\n            } \n            else if (i < linePtr + searchWord.length && searchWord[i - linePtr] < cur) {\n              // searchWord[i] < cur, so we lexicographically will not find any more results.\n              startsWith = false;\n              done = true;\n              break;\n            } \n            else {\n              \n              // This condition indicates we found a match.\n              if (buf[i] === 44) {\n                // We found a ',' so increment numValues by one.\n                numValues++;\n\n                // If we're searching for one word and we have enough results, break out at the next space.\n                if (numValues >= this.maxResults && searchWords.length === 1) {\n                  while (buf[i] != 32) \n                    i++;\n\n                  break;\n                }\n              }\n            }\n          }\n\n          i++;\n        }\n\n        if (done) break;\n\n        // If the line starts with the searchWord, we have a hit!\n        if (startsWith) {\n\n\n          // Parse the line and add results to arr.\n          const line: string = buf.slice(linePtr, i).toString();\n          let arr = this._parseHitString(line);\n\n          if (searchWords.length === 1) {\n            // Only a single search word so add results to array.\n            resultArr = resultArr.concat(arr);\n            // Once we have enough results, stop searching.\n            if (resultArr.length >= this.maxResults) break;\n            \n          }\n          else {\n            // Handle multiple words using sets.\n            for (let hit of arr) {\n              hit = hit.toLowerCase();\n\n              if (firstWord) {\n                resultSet.add(hit);\n              }\n              else {\n                if (initialSet.has(hit)) {\n                  resultSet.add(hit);\n                 \n                  // If it is on the last iteration of words, break after we reach maxResults\n                  if (w === searchWords.length - 1 && resultSet.size >= this.maxResults)\n                    break;\n                }\n              }\n            } \n          }\n        }\n\n        linePtr = i + 1;\n      }\n\n      initialSet = resultSet;\n      firstWord = false;\n\n      // If there aren't any results, stop looping, because an intersection with an empty set is an empty set.\n      if (resultArr.length === 0 && initialSet.size === 0)\n        return [];\n\n    }\n    \n    // 4. Return the hitList [list of string]\n    if (searchWords.length === 1) {\n      return resultArr;\n    }\n\n    // Else we need to return our set converted to an array\n    resultArr = Array.from(initialSet);\n    if (resultArr.length > this.maxResults)\n      return resultArr.slice(0, this.maxResults)\n\n    return resultArr;\n  }\n\n\n  // Private Methods:\n\n  /**\n   * Seek ahead to the correct position in the .ix file, \n   * then load that chunk of .ix into a buffer.\n   *\n   * @param searchWord [string]\n   * @returns a Buffer holding the sections we want to search.\n   */\n  private async _getBuffer(searchWord: string) {\n\n    // Get position to seek to in .ix file from indexes.\n    let seekPosStart = 0;\n    let seekPosEnd = -1;\n    const indexes = await this.index;\n    for (let [key, value] of indexes) {\n      let trimmedKey = key.slice(0, searchWord.length);\n      if (seekPosEnd === -1) {\n        if (trimmedKey >= searchWord) {\n          // We reached the end pos in the file.\n          seekPosEnd = value - 1;\n          break;\n        } \n        else {\n          seekPosStart = value;\n        }\n      }\n    }\n    \n    // Return the buffer and its end position in the file.\n    return this._createBuffer(seekPosStart, seekPosEnd);\n  }\n\n\n  /**\n   * Given the end position of the last buffer, \n   * load the next chunk  of .ix data into a buffer and return it.\n   *\n   * @param seekPosStart [number] where to start loading data into the new buffer.\n   * @returns a Buffer holding the chunk we want to search.\n   */\n  private async _getNextChunk(seekPosStart: number) {\n\n    if (seekPosStart == -1)\n      return null;\n\n    let seekPosEnd = -1;\n    // Get the next position of the end of buffer.\n    const indexes = await this.index;\n    for (let [key, value] of indexes) {\n      if (value <= seekPosStart + 1)\n        continue\n\n      seekPosEnd = value;\n      break;\n    }\n\n    seekPosStart--;\n\n    // Return the buffer and its end position in the file.\n    return this._createBuffer(seekPosStart, seekPosEnd);\n  }\n\n\n    /**\n   * Create and return a buffer given the start and end position  \n   * of what to load from the .ix file.\n   *\n   * @param seekPosStart [number] byte the buffer should start reading from file.\n   * @param seekPosEnd [number] byte the buffer should stop reading from file.\n   * @returns a Buffer holding the chunk of data.\n   */\n    private async _createBuffer(seekPosStart: number, seekPosEnd: number) {  \n      // Set bufLength to seekPosEnd or the end of the file.\n      let bufLength: number;\n      if (seekPosEnd < 0) {\n        const stat = await this.ixFile.stat();\n        bufLength = stat.size - seekPosStart;\n      } \n      else {\n        bufLength = seekPosEnd - seekPosStart;\n      }\n  \n      let buf = Buffer.alloc(bufLength);\n      await this.ixFile.read(buf, 0, bufLength, seekPosStart);\n  \n      // Return the buffer and its end position in the file.\n      return { \"buf\": buf, \"bufEndPos\": seekPosEnd };\n    }\n\n\n\n\n  /**\n   * Takes in a hit string and returns an array of result terms.\n   *\n   * @param line [string] The line of .ix that is a hit.\n   * @returns results [Array<hit>]. Each hit contains the itemId [string], and wordPos [number].\n   */\n  private _parseHitString(line: string) {\n    let arr: Array<string> = [];\n    const parts = line.split(' ');\n    // Each result is of format: \"{itemId},{wordPos}\"\n    // Parse the entire line of these and return\n    for (const part of parts) {\n      const pair = part.split(',');\n      if (pair.length === 2) {\n        const itemId: string = pair[0];\n        const wordPos: number = Number.parseInt(pair[1]);\n        if (typeof wordPos !== 'number' || isNaN(wordPos))\n          throw `Error in ix index format at term ${itemId} for word ${parts[0]}`;\n\n        arr.push(itemId);\n      } else if (pair.length > 1) {\n        throw `Error in ix index format at word ${parts[0]}`;\n      }\n    }\n    return arr;\n  }\n\n  /**\n   * Parses ixx file and constructs a map of {word: ixFileLocation}\n   *\n   * @param ixxFile [anyFile] second level index that is produced by ixIxx.\n   * @returns a ParsedIxx map.\n   */\n  private async _parseIxx(ixxFile: AnyFile): Promise<ParsedIxx> {\n    const ixx = new Map();\n\n    // Load the ixxFile into ixxData object\n    const buf = await ixxFile.readFile();\n    const lines = buf.toString('utf8').split('\\n');\n    for (const line of lines) {\n      if (line.length > 0) {\n        // Parse the ixx line\n        // Format: 5 characters prefix, 10 characters hex\n        const prefix = line.substr(0, trixPrefixSize);\n        const posStr = line.substr(trixPrefixSize);\n        const pos = Number.parseInt(posStr, 16);\n        if (typeof pos !== 'number' || isNaN(pos))\n          throw `Error in ixx index format at word ${prefix}`;\n\n        ixx.set(prefix, pos);\n      }\n    }\n\n    return ixx;\n  }\n}\n"],"names":["undefined","trixPrefixSize","Trix","ixxFile","ixFile","maxResults","index","_parseIxx","search","searchString","resultArr","firstWord","initialSet","Set","searchWords","split","w","length","searchWord","toLowerCase","_getBuffer","bufData","buf","bufPos","bufEndPos","resultSet","linePtr","numValues","byteLength","startsWith","done","i","_getNextChunk","tempBufData","cur","String","fromCharCode","line","slice","toString","arr","_parseHitString","concat","hit","add","has","size","Array","from","seekPosStart","seekPosEnd","indexes","key","value","trimmedKey","_createBuffer","stat","bufLength","Buffer","alloc","read","parts","part","pair","itemId","wordPos","Number","parseInt","isNaN","push","ixx","Map","readFile","lines","prefix","substr","posStr","pos","set"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI,OAAO,IAAI,UAAU,OAAO,EAAE;AAElC;AACA,EAAE,IAAI,EAAE,GAAG,MAAM,CAAC,SAAS,CAAC;AAC5B,EAAE,IAAI,MAAM,GAAG,EAAE,CAAC,cAAc,CAAC;AACjC,EAAE,IAAIA,WAAS,CAAC;AAChB,EAAE,IAAI,OAAO,GAAG,OAAO,MAAM,KAAK,UAAU,GAAG,MAAM,GAAG,EAAE,CAAC;AAC3D,EAAE,IAAI,cAAc,GAAG,OAAO,CAAC,QAAQ,IAAI,YAAY,CAAC;AACxD,EAAE,IAAI,mBAAmB,GAAG,OAAO,CAAC,aAAa,IAAI,iBAAiB,CAAC;AACvE,EAAE,IAAI,iBAAiB,GAAG,OAAO,CAAC,WAAW,IAAI,eAAe,CAAC;AACjE;AACA,EAAE,SAAS,MAAM,CAAC,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE;AACnC,IAAI,MAAM,CAAC,cAAc,CAAC,GAAG,EAAE,GAAG,EAAE;AACpC,MAAM,KAAK,EAAE,KAAK;AAClB,MAAM,UAAU,EAAE,IAAI;AACtB,MAAM,YAAY,EAAE,IAAI;AACxB,MAAM,QAAQ,EAAE,IAAI;AACpB,KAAK,CAAC,CAAC;AACP,IAAI,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC;AACpB,GAAG;AACH,EAAE,IAAI;AACN;AACA,IAAI,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;AACnB,GAAG,CAAC,OAAO,GAAG,EAAE;AAChB,IAAI,MAAM,GAAG,SAAS,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE;AACvC,MAAM,OAAO,GAAG,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;AAC9B,KAAK,CAAC;AACN,GAAG;AACH;AACA,EAAE,SAAS,IAAI,CAAC,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE;AACrD;AACA,IAAI,IAAI,cAAc,GAAG,OAAO,IAAI,OAAO,CAAC,SAAS,YAAY,SAAS,GAAG,OAAO,GAAG,SAAS,CAAC;AACjG,IAAI,IAAI,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC;AAC5D,IAAI,IAAI,OAAO,GAAG,IAAI,OAAO,CAAC,WAAW,IAAI,EAAE,CAAC,CAAC;AACjD;AACA;AACA;AACA,IAAI,SAAS,CAAC,OAAO,GAAG,gBAAgB,CAAC,OAAO,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;AACjE;AACA,IAAI,OAAO,SAAS,CAAC;AACrB,GAAG;AACH,EAAE,OAAO,CAAC,IAAI,GAAG,IAAI,CAAC;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,SAAS,QAAQ,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE;AAClC,IAAI,IAAI;AACR,MAAM,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;AACxD,KAAK,CAAC,OAAO,GAAG,EAAE;AAClB,MAAM,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;AACzC,KAAK;AACL,GAAG;AACH;AACA,EAAE,IAAI,sBAAsB,GAAG,gBAAgB,CAAC;AAChD,EAAE,IAAI,sBAAsB,GAAG,gBAAgB,CAAC;AAChD,EAAE,IAAI,iBAAiB,GAAG,WAAW,CAAC;AACtC,EAAE,IAAI,iBAAiB,GAAG,WAAW,CAAC;AACtC;AACA;AACA;AACA,EAAE,IAAI,gBAAgB,GAAG,EAAE,CAAC;AAC5B;AACA;AACA;AACA;AACA;AACA,EAAE,SAAS,SAAS,GAAG,EAAE;AACzB,EAAE,SAAS,iBAAiB,GAAG,EAAE;AACjC,EAAE,SAAS,0BAA0B,GAAG,EAAE;AAC1C;AACA;AACA;AACA,EAAE,IAAI,iBAAiB,GAAG,EAAE,CAAC;AAC7B,EAAE,iBAAiB,CAAC,cAAc,CAAC,GAAG,YAAY;AAClD,IAAI,OAAO,IAAI,CAAC;AAChB,GAAG,CAAC;AACJ;AACA,EAAE,IAAI,QAAQ,GAAG,MAAM,CAAC,cAAc,CAAC;AACvC,EAAE,IAAI,uBAAuB,GAAG,QAAQ,IAAI,QAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;AAC3E,EAAE,IAAI,uBAAuB;AAC7B,MAAM,uBAAuB,KAAK,EAAE;AACpC,MAAM,MAAM,CAAC,IAAI,CAAC,uBAAuB,EAAE,cAAc,CAAC,EAAE;AAC5D;AACA;AACA,IAAI,iBAAiB,GAAG,uBAAuB,CAAC;AAChD,GAAG;AACH;AACA,EAAE,IAAI,EAAE,GAAG,0BAA0B,CAAC,SAAS;AAC/C,IAAI,SAAS,CAAC,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;AAC3D,EAAE,iBAAiB,CAAC,SAAS,GAAG,EAAE,CAAC,WAAW,GAAG,0BAA0B,CAAC;AAC5E,EAAE,0BAA0B,CAAC,WAAW,GAAG,iBAAiB,CAAC;AAC7D,EAAE,iBAAiB,CAAC,WAAW,GAAG,MAAM;AACxC,IAAI,0BAA0B;AAC9B,IAAI,iBAAiB;AACrB,IAAI,mBAAmB;AACvB,GAAG,CAAC;AACJ;AACA;AACA;AACA,EAAE,SAAS,qBAAqB,CAAC,SAAS,EAAE;AAC5C,IAAI,CAAC,MAAM,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC,OAAO,CAAC,SAAS,MAAM,EAAE;AACzD,MAAM,MAAM,CAAC,SAAS,EAAE,MAAM,EAAE,SAAS,GAAG,EAAE;AAC9C,QAAQ,OAAO,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;AACzC,OAAO,CAAC,CAAC;AACT,KAAK,CAAC,CAAC;AACP,GAAG;AACH;AACA,EAAE,OAAO,CAAC,mBAAmB,GAAG,SAAS,MAAM,EAAE;AACjD,IAAI,IAAI,IAAI,GAAG,OAAO,MAAM,KAAK,UAAU,IAAI,MAAM,CAAC,WAAW,CAAC;AAClE,IAAI,OAAO,IAAI;AACf,QAAQ,IAAI,KAAK,iBAAiB;AAClC;AACA;AACA,QAAQ,CAAC,IAAI,CAAC,WAAW,IAAI,IAAI,CAAC,IAAI,MAAM,mBAAmB;AAC/D,QAAQ,KAAK,CAAC;AACd,GAAG,CAAC;AACJ;AACA,EAAE,OAAO,CAAC,IAAI,GAAG,SAAS,MAAM,EAAE;AAClC,IAAI,IAAI,MAAM,CAAC,cAAc,EAAE;AAC/B,MAAM,MAAM,CAAC,cAAc,CAAC,MAAM,EAAE,0BAA0B,CAAC,CAAC;AAChE,KAAK,MAAM;AACX,MAAM,MAAM,CAAC,SAAS,GAAG,0BAA0B,CAAC;AACpD,MAAM,MAAM,CAAC,MAAM,EAAE,iBAAiB,EAAE,mBAAmB,CAAC,CAAC;AAC7D,KAAK;AACL,IAAI,MAAM,CAAC,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;AACzC,IAAI,OAAO,MAAM,CAAC;AAClB,GAAG,CAAC;AACJ;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,CAAC,KAAK,GAAG,SAAS,GAAG,EAAE;AAChC,IAAI,OAAO,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC;AAC5B,GAAG,CAAC;AACJ;AACA,EAAE,SAAS,aAAa,CAAC,SAAS,EAAE,WAAW,EAAE;AACjD,IAAI,SAAS,MAAM,CAAC,MAAM,EAAE,GAAG,EAAE,OAAO,EAAE,MAAM,EAAE;AAClD,MAAM,IAAI,MAAM,GAAG,QAAQ,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,SAAS,EAAE,GAAG,CAAC,CAAC;AAC/D,MAAM,IAAI,MAAM,CAAC,IAAI,KAAK,OAAO,EAAE;AACnC,QAAQ,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;AAC3B,OAAO,MAAM;AACb,QAAQ,IAAI,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC;AAChC,QAAQ,IAAI,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC;AACjC,QAAQ,IAAI,KAAK;AACjB,YAAY,OAAO,KAAK,KAAK,QAAQ;AACrC,YAAY,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,SAAS,CAAC,EAAE;AAC3C,UAAU,OAAO,WAAW,CAAC,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,SAAS,KAAK,EAAE;AACzE,YAAY,MAAM,CAAC,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC;AACnD,WAAW,EAAE,SAAS,GAAG,EAAE;AAC3B,YAAY,MAAM,CAAC,OAAO,EAAE,GAAG,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC;AAClD,WAAW,CAAC,CAAC;AACb,SAAS;AACT;AACA,QAAQ,OAAO,WAAW,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,SAAS,SAAS,EAAE;AACnE;AACA;AACA;AACA,UAAU,MAAM,CAAC,KAAK,GAAG,SAAS,CAAC;AACnC,UAAU,OAAO,CAAC,MAAM,CAAC,CAAC;AAC1B,SAAS,EAAE,SAAS,KAAK,EAAE;AAC3B;AACA;AACA,UAAU,OAAO,MAAM,CAAC,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC;AACzD,SAAS,CAAC,CAAC;AACX,OAAO;AACP,KAAK;AACL;AACA,IAAI,IAAI,eAAe,CAAC;AACxB;AACA,IAAI,SAAS,OAAO,CAAC,MAAM,EAAE,GAAG,EAAE;AAClC,MAAM,SAAS,0BAA0B,GAAG;AAC5C,QAAQ,OAAO,IAAI,WAAW,CAAC,SAAS,OAAO,EAAE,MAAM,EAAE;AACzD,UAAU,MAAM,CAAC,MAAM,EAAE,GAAG,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC;AAC/C,SAAS,CAAC,CAAC;AACX,OAAO;AACP;AACA,MAAM,OAAO,eAAe;AAC5B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ,eAAe,GAAG,eAAe,CAAC,IAAI;AAC9C,UAAU,0BAA0B;AACpC;AACA;AACA,UAAU,0BAA0B;AACpC,SAAS,GAAG,0BAA0B,EAAE,CAAC;AACzC,KAAK;AACL;AACA;AACA;AACA,IAAI,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;AAC3B,GAAG;AACH;AACA,EAAE,qBAAqB,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC;AACjD,EAAE,aAAa,CAAC,SAAS,CAAC,mBAAmB,CAAC,GAAG,YAAY;AAC7D,IAAI,OAAO,IAAI,CAAC;AAChB,GAAG,CAAC;AACJ,EAAE,OAAO,CAAC,aAAa,GAAG,aAAa,CAAC;AACxC;AACA;AACA;AACA;AACA,EAAE,OAAO,CAAC,KAAK,GAAG,SAAS,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,WAAW,EAAE;AAC7E,IAAI,IAAI,WAAW,KAAK,KAAK,CAAC,EAAE,WAAW,GAAG,OAAO,CAAC;AACtD;AACA,IAAI,IAAI,IAAI,GAAG,IAAI,aAAa;AAChC,MAAM,IAAI,CAAC,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,WAAW,CAAC;AAC/C,MAAM,WAAW;AACjB,KAAK,CAAC;AACN;AACA,IAAI,OAAO,OAAO,CAAC,mBAAmB,CAAC,OAAO,CAAC;AAC/C,QAAQ,IAAI;AACZ,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,SAAS,MAAM,EAAE;AAC1C,UAAU,OAAO,MAAM,CAAC,IAAI,GAAG,MAAM,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;AAC1D,SAAS,CAAC,CAAC;AACX,GAAG,CAAC;AACJ;AACA,EAAE,SAAS,gBAAgB,CAAC,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE;AACpD,IAAI,IAAI,KAAK,GAAG,sBAAsB,CAAC;AACvC;AACA,IAAI,OAAO,SAAS,MAAM,CAAC,MAAM,EAAE,GAAG,EAAE;AACxC,MAAM,IAAI,KAAK,KAAK,iBAAiB,EAAE;AACvC,QAAQ,MAAM,IAAI,KAAK,CAAC,8BAA8B,CAAC,CAAC;AACxD,OAAO;AACP;AACA,MAAM,IAAI,KAAK,KAAK,iBAAiB,EAAE;AACvC,QAAQ,IAAI,MAAM,KAAK,OAAO,EAAE;AAChC,UAAU,MAAM,GAAG,CAAC;AACpB,SAAS;AACT;AACA;AACA;AACA,QAAQ,OAAO,UAAU,EAAE,CAAC;AAC5B,OAAO;AACP;AACA,MAAM,OAAO,CAAC,MAAM,GAAG,MAAM,CAAC;AAC9B,MAAM,OAAO,CAAC,GAAG,GAAG,GAAG,CAAC;AACxB;AACA,MAAM,OAAO,IAAI,EAAE;AACnB,QAAQ,IAAI,QAAQ,GAAG,OAAO,CAAC,QAAQ,CAAC;AACxC,QAAQ,IAAI,QAAQ,EAAE;AACtB,UAAU,IAAI,cAAc,GAAG,mBAAmB,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;AACtE,UAAU,IAAI,cAAc,EAAE;AAC9B,YAAY,IAAI,cAAc,KAAK,gBAAgB,EAAE,SAAS;AAC9D,YAAY,OAAO,cAAc,CAAC;AAClC,WAAW;AACX,SAAS;AACT;AACA,QAAQ,IAAI,OAAO,CAAC,MAAM,KAAK,MAAM,EAAE;AACvC;AACA;AACA,UAAU,OAAO,CAAC,IAAI,GAAG,OAAO,CAAC,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC;AACrD;AACA,SAAS,MAAM,IAAI,OAAO,CAAC,MAAM,KAAK,OAAO,EAAE;AAC/C,UAAU,IAAI,KAAK,KAAK,sBAAsB,EAAE;AAChD,YAAY,KAAK,GAAG,iBAAiB,CAAC;AACtC,YAAY,MAAM,OAAO,CAAC,GAAG,CAAC;AAC9B,WAAW;AACX;AACA,UAAU,OAAO,CAAC,iBAAiB,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;AACjD;AACA,SAAS,MAAM,IAAI,OAAO,CAAC,MAAM,KAAK,QAAQ,EAAE;AAChD,UAAU,OAAO,CAAC,MAAM,CAAC,QAAQ,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC;AAChD,SAAS;AACT;AACA,QAAQ,KAAK,GAAG,iBAAiB,CAAC;AAClC;AACA,QAAQ,IAAI,MAAM,GAAG,QAAQ,CAAC,OAAO,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;AACtD,QAAQ,IAAI,MAAM,CAAC,IAAI,KAAK,QAAQ,EAAE;AACtC;AACA;AACA,UAAU,KAAK,GAAG,OAAO,CAAC,IAAI;AAC9B,cAAc,iBAAiB;AAC/B,cAAc,sBAAsB,CAAC;AACrC;AACA,UAAU,IAAI,MAAM,CAAC,GAAG,KAAK,gBAAgB,EAAE;AAC/C,YAAY,SAAS;AACrB,WAAW;AACX;AACA,UAAU,OAAO;AACjB,YAAY,KAAK,EAAE,MAAM,CAAC,GAAG;AAC7B,YAAY,IAAI,EAAE,OAAO,CAAC,IAAI;AAC9B,WAAW,CAAC;AACZ;AACA,SAAS,MAAM,IAAI,MAAM,CAAC,IAAI,KAAK,OAAO,EAAE;AAC5C,UAAU,KAAK,GAAG,iBAAiB,CAAC;AACpC;AACA;AACA,UAAU,OAAO,CAAC,MAAM,GAAG,OAAO,CAAC;AACnC,UAAU,OAAO,CAAC,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC;AACnC,SAAS;AACT,OAAO;AACP,KAAK,CAAC;AACN,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,SAAS,mBAAmB,CAAC,QAAQ,EAAE,OAAO,EAAE;AAClD,IAAI,IAAI,MAAM,GAAG,QAAQ,CAAC,QAAQ,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;AACnD,IAAI,IAAI,MAAM,KAAKA,WAAS,EAAE;AAC9B;AACA;AACA,MAAM,OAAO,CAAC,QAAQ,GAAG,IAAI,CAAC;AAC9B;AACA,MAAM,IAAI,OAAO,CAAC,MAAM,KAAK,OAAO,EAAE;AACtC;AACA,QAAQ,IAAI,QAAQ,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE;AACzC;AACA;AACA,UAAU,OAAO,CAAC,MAAM,GAAG,QAAQ,CAAC;AACpC,UAAU,OAAO,CAAC,GAAG,GAAGA,WAAS,CAAC;AAClC,UAAU,mBAAmB,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;AACjD;AACA,UAAU,IAAI,OAAO,CAAC,MAAM,KAAK,OAAO,EAAE;AAC1C;AACA;AACA,YAAY,OAAO,gBAAgB,CAAC;AACpC,WAAW;AACX,SAAS;AACT;AACA,QAAQ,OAAO,CAAC,MAAM,GAAG,OAAO,CAAC;AACjC,QAAQ,OAAO,CAAC,GAAG,GAAG,IAAI,SAAS;AACnC,UAAU,gDAAgD,CAAC,CAAC;AAC5D,OAAO;AACP;AACA,MAAM,OAAO,gBAAgB,CAAC;AAC9B,KAAK;AACL;AACA,IAAI,IAAI,MAAM,GAAG,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC;AAClE;AACA,IAAI,IAAI,MAAM,CAAC,IAAI,KAAK,OAAO,EAAE;AACjC,MAAM,OAAO,CAAC,MAAM,GAAG,OAAO,CAAC;AAC/B,MAAM,OAAO,CAAC,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC;AAC/B,MAAM,OAAO,CAAC,QAAQ,GAAG,IAAI,CAAC;AAC9B,MAAM,OAAO,gBAAgB,CAAC;AAC9B,KAAK;AACL;AACA,IAAI,IAAI,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC;AAC1B;AACA,IAAI,IAAI,EAAE,IAAI,EAAE;AAChB,MAAM,OAAO,CAAC,MAAM,GAAG,OAAO,CAAC;AAC/B,MAAM,OAAO,CAAC,GAAG,GAAG,IAAI,SAAS,CAAC,kCAAkC,CAAC,CAAC;AACtE,MAAM,OAAO,CAAC,QAAQ,GAAG,IAAI,CAAC;AAC9B,MAAM,OAAO,gBAAgB,CAAC;AAC9B,KAAK;AACL;AACA,IAAI,IAAI,IAAI,CAAC,IAAI,EAAE;AACnB;AACA;AACA,MAAM,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC;AAChD;AACA;AACA,MAAM,OAAO,CAAC,IAAI,GAAG,QAAQ,CAAC,OAAO,CAAC;AACtC;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM,IAAI,OAAO,CAAC,MAAM,KAAK,QAAQ,EAAE;AACvC,QAAQ,OAAO,CAAC,MAAM,GAAG,MAAM,CAAC;AAChC,QAAQ,OAAO,CAAC,GAAG,GAAGA,WAAS,CAAC;AAChC,OAAO;AACP;AACA,KAAK,MAAM;AACX;AACA,MAAM,OAAO,IAAI,CAAC;AAClB,KAAK;AACL;AACA;AACA;AACA,IAAI,OAAO,CAAC,QAAQ,GAAG,IAAI,CAAC;AAC5B,IAAI,OAAO,gBAAgB,CAAC;AAC5B,GAAG;AACH;AACA;AACA;AACA,EAAE,qBAAqB,CAAC,EAAE,CAAC,CAAC;AAC5B;AACA,EAAE,MAAM,CAAC,EAAE,EAAE,iBAAiB,EAAE,WAAW,CAAC,CAAC;AAC7C;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,EAAE,CAAC,cAAc,CAAC,GAAG,WAAW;AAClC,IAAI,OAAO,IAAI,CAAC;AAChB,GAAG,CAAC;AACJ;AACA,EAAE,EAAE,CAAC,QAAQ,GAAG,WAAW;AAC3B,IAAI,OAAO,oBAAoB,CAAC;AAChC,GAAG,CAAC;AACJ;AACA,EAAE,SAAS,YAAY,CAAC,IAAI,EAAE;AAC9B,IAAI,IAAI,KAAK,GAAG,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;AACpC;AACA,IAAI,IAAI,CAAC,IAAI,IAAI,EAAE;AACnB,MAAM,KAAK,CAAC,QAAQ,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;AAC/B,KAAK;AACL;AACA,IAAI,IAAI,CAAC,IAAI,IAAI,EAAE;AACnB,MAAM,KAAK,CAAC,UAAU,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;AACjC,MAAM,KAAK,CAAC,QAAQ,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;AAC/B,KAAK;AACL;AACA,IAAI,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;AAChC,GAAG;AACH;AACA,EAAE,SAAS,aAAa,CAAC,KAAK,EAAE;AAChC,IAAI,IAAI,MAAM,GAAG,KAAK,CAAC,UAAU,IAAI,EAAE,CAAC;AACxC,IAAI,MAAM,CAAC,IAAI,GAAG,QAAQ,CAAC;AAC3B,IAAI,OAAO,MAAM,CAAC,GAAG,CAAC;AACtB,IAAI,KAAK,CAAC,UAAU,GAAG,MAAM,CAAC;AAC9B,GAAG;AACH;AACA,EAAE,SAAS,OAAO,CAAC,WAAW,EAAE;AAChC;AACA;AACA;AACA,IAAI,IAAI,CAAC,UAAU,GAAG,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;AAC3C,IAAI,WAAW,CAAC,OAAO,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;AAC5C,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;AACrB,GAAG;AACH;AACA,EAAE,OAAO,CAAC,IAAI,GAAG,SAAS,MAAM,EAAE;AAClC,IAAI,IAAI,IAAI,GAAG,EAAE,CAAC;AAClB,IAAI,KAAK,IAAI,GAAG,IAAI,MAAM,EAAE;AAC5B,MAAM,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACrB,KAAK;AACL,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;AACnB;AACA;AACA;AACA,IAAI,OAAO,SAAS,IAAI,GAAG;AAC3B,MAAM,OAAO,IAAI,CAAC,MAAM,EAAE;AAC1B,QAAQ,IAAI,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;AAC7B,QAAQ,IAAI,GAAG,IAAI,MAAM,EAAE;AAC3B,UAAU,IAAI,CAAC,KAAK,GAAG,GAAG,CAAC;AAC3B,UAAU,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC;AAC5B,UAAU,OAAO,IAAI,CAAC;AACtB,SAAS;AACT,OAAO;AACP;AACA;AACA;AACA;AACA,MAAM,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;AACvB,MAAM,OAAO,IAAI,CAAC;AAClB,KAAK,CAAC;AACN,GAAG,CAAC;AACJ;AACA,EAAE,SAAS,MAAM,CAAC,QAAQ,EAAE;AAC5B,IAAI,IAAI,QAAQ,EAAE;AAClB,MAAM,IAAI,cAAc,GAAG,QAAQ,CAAC,cAAc,CAAC,CAAC;AACpD,MAAM,IAAI,cAAc,EAAE;AAC1B,QAAQ,OAAO,cAAc,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;AAC7C,OAAO;AACP;AACA,MAAM,IAAI,OAAO,QAAQ,CAAC,IAAI,KAAK,UAAU,EAAE;AAC/C,QAAQ,OAAO,QAAQ,CAAC;AACxB,OAAO;AACP;AACA,MAAM,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE;AACnC,QAAQ,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,SAAS,IAAI,GAAG;AAC3C,UAAU,OAAO,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE;AACxC,YAAY,IAAI,MAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE;AAC1C,cAAc,IAAI,CAAC,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;AACvC,cAAc,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC;AAChC,cAAc,OAAO,IAAI,CAAC;AAC1B,aAAa;AACb,WAAW;AACX;AACA,UAAU,IAAI,CAAC,KAAK,GAAGA,WAAS,CAAC;AACjC,UAAU,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;AAC3B;AACA,UAAU,OAAO,IAAI,CAAC;AACtB,SAAS,CAAC;AACV;AACA,QAAQ,OAAO,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;AAChC,OAAO;AACP,KAAK;AACL;AACA;AACA,IAAI,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC;AAChC,GAAG;AACH,EAAE,OAAO,CAAC,MAAM,GAAG,MAAM,CAAC;AAC1B;AACA,EAAE,SAAS,UAAU,GAAG;AACxB,IAAI,OAAO,EAAE,KAAK,EAAEA,WAAS,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;AAC5C,GAAG;AACH;AACA,EAAE,OAAO,CAAC,SAAS,GAAG;AACtB,IAAI,WAAW,EAAE,OAAO;AACxB;AACA,IAAI,KAAK,EAAE,SAAS,aAAa,EAAE;AACnC,MAAM,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;AACpB,MAAM,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;AACpB;AACA;AACA,MAAM,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,GAAGA,WAAS,CAAC;AACzC,MAAM,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC;AACxB,MAAM,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;AAC3B;AACA,MAAM,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;AAC3B,MAAM,IAAI,CAAC,GAAG,GAAGA,WAAS,CAAC;AAC3B;AACA,MAAM,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC;AAC7C;AACA,MAAM,IAAI,CAAC,aAAa,EAAE;AAC1B,QAAQ,KAAK,IAAI,IAAI,IAAI,IAAI,EAAE;AAC/B;AACA,UAAU,IAAI,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,GAAG;AACpC,cAAc,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC;AACrC,cAAc,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE;AACtC,YAAY,IAAI,CAAC,IAAI,CAAC,GAAGA,WAAS,CAAC;AACnC,WAAW;AACX,SAAS;AACT,OAAO;AACP,KAAK;AACL;AACA,IAAI,IAAI,EAAE,WAAW;AACrB,MAAM,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;AACvB;AACA,MAAM,IAAI,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;AACzC,MAAM,IAAI,UAAU,GAAG,SAAS,CAAC,UAAU,CAAC;AAC5C,MAAM,IAAI,UAAU,CAAC,IAAI,KAAK,OAAO,EAAE;AACvC,QAAQ,MAAM,UAAU,CAAC,GAAG,CAAC;AAC7B,OAAO;AACP;AACA,MAAM,OAAO,IAAI,CAAC,IAAI,CAAC;AACvB,KAAK;AACL;AACA,IAAI,iBAAiB,EAAE,SAAS,SAAS,EAAE;AAC3C,MAAM,IAAI,IAAI,CAAC,IAAI,EAAE;AACrB,QAAQ,MAAM,SAAS,CAAC;AACxB,OAAO;AACP;AACA,MAAM,IAAI,OAAO,GAAG,IAAI,CAAC;AACzB,MAAM,SAAS,MAAM,CAAC,GAAG,EAAE,MAAM,EAAE;AACnC,QAAQ,MAAM,CAAC,IAAI,GAAG,OAAO,CAAC;AAC9B,QAAQ,MAAM,CAAC,GAAG,GAAG,SAAS,CAAC;AAC/B,QAAQ,OAAO,CAAC,IAAI,GAAG,GAAG,CAAC;AAC3B;AACA,QAAQ,IAAI,MAAM,EAAE;AACpB;AACA;AACA,UAAU,OAAO,CAAC,MAAM,GAAG,MAAM,CAAC;AAClC,UAAU,OAAO,CAAC,GAAG,GAAGA,WAAS,CAAC;AAClC,SAAS;AACT;AACA,QAAQ,OAAO,CAAC,EAAE,MAAM,CAAC;AACzB,OAAO;AACP;AACA,MAAM,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,EAAE;AAC5D,QAAQ,IAAI,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;AACvC,QAAQ,IAAI,MAAM,GAAG,KAAK,CAAC,UAAU,CAAC;AACtC;AACA,QAAQ,IAAI,KAAK,CAAC,MAAM,KAAK,MAAM,EAAE;AACrC;AACA;AACA;AACA,UAAU,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC;AAC/B,SAAS;AACT;AACA,QAAQ,IAAI,KAAK,CAAC,MAAM,IAAI,IAAI,CAAC,IAAI,EAAE;AACvC,UAAU,IAAI,QAAQ,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;AACxD,UAAU,IAAI,UAAU,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;AAC5D;AACA,UAAU,IAAI,QAAQ,IAAI,UAAU,EAAE;AACtC,YAAY,IAAI,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,QAAQ,EAAE;AAC5C,cAAc,OAAO,MAAM,CAAC,KAAK,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;AAClD,aAAa,MAAM,IAAI,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,UAAU,EAAE;AACrD,cAAc,OAAO,MAAM,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;AAC9C,aAAa;AACb;AACA,WAAW,MAAM,IAAI,QAAQ,EAAE;AAC/B,YAAY,IAAI,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,QAAQ,EAAE;AAC5C,cAAc,OAAO,MAAM,CAAC,KAAK,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;AAClD,aAAa;AACb;AACA,WAAW,MAAM,IAAI,UAAU,EAAE;AACjC,YAAY,IAAI,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,UAAU,EAAE;AAC9C,cAAc,OAAO,MAAM,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;AAC9C,aAAa;AACb;AACA,WAAW,MAAM;AACjB,YAAY,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,CAAC;AACtE,WAAW;AACX,SAAS;AACT,OAAO;AACP,KAAK;AACL;AACA,IAAI,MAAM,EAAE,SAAS,IAAI,EAAE,GAAG,EAAE;AAChC,MAAM,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,EAAE;AAC5D,QAAQ,IAAI,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;AACvC,QAAQ,IAAI,KAAK,CAAC,MAAM,IAAI,IAAI,CAAC,IAAI;AACrC,YAAY,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,YAAY,CAAC;AAC5C,YAAY,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,UAAU,EAAE;AAC1C,UAAU,IAAI,YAAY,GAAG,KAAK,CAAC;AACnC,UAAU,MAAM;AAChB,SAAS;AACT,OAAO;AACP;AACA,MAAM,IAAI,YAAY;AACtB,WAAW,IAAI,KAAK,OAAO;AAC3B,WAAW,IAAI,KAAK,UAAU,CAAC;AAC/B,UAAU,YAAY,CAAC,MAAM,IAAI,GAAG;AACpC,UAAU,GAAG,IAAI,YAAY,CAAC,UAAU,EAAE;AAC1C;AACA;AACA,QAAQ,YAAY,GAAG,IAAI,CAAC;AAC5B,OAAO;AACP;AACA,MAAM,IAAI,MAAM,GAAG,YAAY,GAAG,YAAY,CAAC,UAAU,GAAG,EAAE,CAAC;AAC/D,MAAM,MAAM,CAAC,IAAI,GAAG,IAAI,CAAC;AACzB,MAAM,MAAM,CAAC,GAAG,GAAG,GAAG,CAAC;AACvB;AACA,MAAM,IAAI,YAAY,EAAE;AACxB,QAAQ,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;AAC7B,QAAQ,IAAI,CAAC,IAAI,GAAG,YAAY,CAAC,UAAU,CAAC;AAC5C,QAAQ,OAAO,gBAAgB,CAAC;AAChC,OAAO;AACP;AACA,MAAM,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;AACnC,KAAK;AACL;AACA,IAAI,QAAQ,EAAE,SAAS,MAAM,EAAE,QAAQ,EAAE;AACzC,MAAM,IAAI,MAAM,CAAC,IAAI,KAAK,OAAO,EAAE;AACnC,QAAQ,MAAM,MAAM,CAAC,GAAG,CAAC;AACzB,OAAO;AACP;AACA,MAAM,IAAI,MAAM,CAAC,IAAI,KAAK,OAAO;AACjC,UAAU,MAAM,CAAC,IAAI,KAAK,UAAU,EAAE;AACtC,QAAQ,IAAI,CAAC,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC;AAC/B,OAAO,MAAM,IAAI,MAAM,CAAC,IAAI,KAAK,QAAQ,EAAE;AAC3C,QAAQ,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC;AAC1C,QAAQ,IAAI,CAAC,MAAM,GAAG,QAAQ,CAAC;AAC/B,QAAQ,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC;AAC1B,OAAO,MAAM,IAAI,MAAM,CAAC,IAAI,KAAK,QAAQ,IAAI,QAAQ,EAAE;AACvD,QAAQ,IAAI,CAAC,IAAI,GAAG,QAAQ,CAAC;AAC7B,OAAO;AACP;AACA,MAAM,OAAO,gBAAgB,CAAC;AAC9B,KAAK;AACL;AACA,IAAI,MAAM,EAAE,SAAS,UAAU,EAAE;AACjC,MAAM,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,EAAE;AAC5D,QAAQ,IAAI,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;AACvC,QAAQ,IAAI,KAAK,CAAC,UAAU,KAAK,UAAU,EAAE;AAC7C,UAAU,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,UAAU,EAAE,KAAK,CAAC,QAAQ,CAAC,CAAC;AAC1D,UAAU,aAAa,CAAC,KAAK,CAAC,CAAC;AAC/B,UAAU,OAAO,gBAAgB,CAAC;AAClC,SAAS;AACT,OAAO;AACP,KAAK;AACL;AACA,IAAI,OAAO,EAAE,SAAS,MAAM,EAAE;AAC9B,MAAM,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,EAAE;AAC5D,QAAQ,IAAI,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;AACvC,QAAQ,IAAI,KAAK,CAAC,MAAM,KAAK,MAAM,EAAE;AACrC,UAAU,IAAI,MAAM,GAAG,KAAK,CAAC,UAAU,CAAC;AACxC,UAAU,IAAI,MAAM,CAAC,IAAI,KAAK,OAAO,EAAE;AACvC,YAAY,IAAI,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC;AACpC,YAAY,aAAa,CAAC,KAAK,CAAC,CAAC;AACjC,WAAW;AACX,UAAU,OAAO,MAAM,CAAC;AACxB,SAAS;AACT,OAAO;AACP;AACA;AACA;AACA,MAAM,MAAM,IAAI,KAAK,CAAC,uBAAuB,CAAC,CAAC;AAC/C,KAAK;AACL;AACA,IAAI,aAAa,EAAE,SAAS,QAAQ,EAAE,UAAU,EAAE,OAAO,EAAE;AAC3D,MAAM,IAAI,CAAC,QAAQ,GAAG;AACtB,QAAQ,QAAQ,EAAE,MAAM,CAAC,QAAQ,CAAC;AAClC,QAAQ,UAAU,EAAE,UAAU;AAC9B,QAAQ,OAAO,EAAE,OAAO;AACxB,OAAO,CAAC;AACR;AACA,MAAM,IAAI,IAAI,CAAC,MAAM,KAAK,MAAM,EAAE;AAClC;AACA;AACA,QAAQ,IAAI,CAAC,GAAG,GAAGA,WAAS,CAAC;AAC7B,OAAO;AACP;AACA,MAAM,OAAO,gBAAgB,CAAC;AAC9B,KAAK;AACL,GAAG,CAAC;AACJ;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,OAAO,CAAC;AACjB;AACA,CAAC;AACD;AACA;AACA;AACA;AACA,GAA+B,MAAM,CAAC,OAAO,CAAK;AAClD,CAAC,CAAC,CAAC;AACH;AACA,IAAI;AACJ,EAAE,kBAAkB,GAAG,OAAO,CAAC;AAC/B,CAAC,CAAC,OAAO,oBAAoB,EAAE;AAC/B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,QAAQ,CAAC,GAAG,EAAE,wBAAwB,CAAC,CAAC,OAAO,CAAC,CAAC;AACnD;;;ACruBA,IAAMC,cAAc,GAAG,CAAvB;AAIA;;IACqBC;AAKnB;;;;;AAKA,gBAAYC,OAAZ,EAA8BC,MAA9B,EAA+CC,UAA/C;QAA+CA;AAAAA,MAAAA,aAAqB;;;AAClE,SAAKC,KAAL,GAAa,KAAKC,SAAL,CAAeJ,OAAf,CAAb;AACA,SAAKC,MAAL,GAAcA,MAAd;AACA,SAAKC,UAAL,GAAkBA,UAAlB;AACD;AAGD;;;;;;;;;;;SAOMG;;;8EAAN,iBAAaC,YAAb;AAAA;;AAAA;AAAA;AAAA;AAAA;AAEE;AACIC,cAAAA,SAHN,GAGiC,EAHjC;AAME;;AACIC,cAAAA,SAPN,GAO2B,IAP3B;AAQMC,cAAAA,UARN,GAQmB,IAAIC,GAAJ,EARnB;AAUMC,cAAAA,WAVN,GAUoBL,YAAY,CAACM,KAAb,CAAmB,GAAnB,CAVpB;AAaE;AACA;AACA;;AACSC,cAAAA,CAhBX,GAgBe,CAhBf;;AAAA;AAAA,oBAgBkBA,CAAC,GAAGF,WAAW,CAACG,MAhBlC;AAAA;AAAA;AAAA;;AAiBQC,cAAAA,UAjBR,GAiBqBJ,WAAW,CAACE,CAAD,CAjBhC;AAkBIE,cAAAA,UAAU,GAAGA,UAAU,CAACC,WAAX,EAAb,CAlBJ;;AAAA;AAAA,qBAqBwB,KAAKC,UAAL,CAAgBF,UAAhB,CArBxB;;AAAA;AAqBQG,cAAAA,OArBR;AAsBQC,cAAAA,GAtBR,GAsBsBD,OAAO,CAACC,GAtB9B;AAuBQC,cAAAA,MAvBR,GAuBiBF,OAAO,CAACG,SAvBzB;AAwBQC,cAAAA,SAxBR,GAwBoB,IAAIZ,GAAJ,EAxBpB;AAyBQa,cAAAA,OAzBR,GAyBkB,CAzBlB;AA0BQC,cAAAA,SA1BR,GA0BoB,CA1BpB;;AAAA;AAAA,oBA6BWD,OAAO,GAAGJ,GAAG,CAACM,UA7BzB;AAAA;AAAA;AAAA;;AA8BUC,cAAAA,UA9BV,GA8BuB,IA9BvB;AA+BUC,cAAAA,IA/BV,GA+BiB,KA/BjB;AAgCUC,cAAAA,CAhCV,GAgCcL,OAhCd;AAoCM;AACA;;AArCN;AAAA,oBAsCaJ,GAAG,CAACS,CAAD,CAAH,IAAU,EAtCvB;AAAA;AAAA;AAAA;;AAAA,oBAwCYA,CAAC,IAAIT,GAAG,CAACM,UAxCrB;AAAA;AAAA;AAAA;;AAAA;AAAA,qBA4CkC,KAAKI,aAAL,CAAmBT,MAAnB,CA5ClC;;AAAA;AA4CcU,cAAAA,WA5Cd;;AAAA,mBA6CcA,WA7Cd;AAAA;AAAA;AAAA;;AA8CYX,cAAAA,GAAG,GAAGW,WAAW,CAACX,GAAlB;AACAC,cAAAA,MAAM,GAAGU,WAAW,CAACT,SAArB;AACAO,cAAAA,CAAC,GAAG,CAAJ;AACAL,cAAAA,OAAO,GAAG,CAAV;AAjDZ;AAAA;;AAAA;AAoDY;AACAI,cAAAA,IAAI,GAAG,IAAP;AArDZ;;AAAA;AAAA,mBA2DYD,UA3DZ;AAAA;AAAA;AAAA;;AA4DgBK,cAAAA,GA5DhB,GA4DsBC,MAAM,CAACC,YAAP,CAAoBd,GAAG,CAACS,CAAD,CAAvB,CA5DtB;;AAAA,oBA8DcA,CAAC,GAAGL,OAAO,GAAGR,UAAU,CAACD,MAAzB,IAAmCC,UAAU,CAACa,CAAC,GAAGL,OAAL,CAAV,GAA0BQ,GA9D3E;AAAA;AAAA;AAAA;;AA+DY;AACAL,cAAAA,UAAU,GAAG,KAAb;AAhEZ;AAAA;;AAAA;AAAA,oBAkEmBE,CAAC,GAAGL,OAAO,GAAGR,UAAU,CAACD,MAAzB,IAAmCC,UAAU,CAACa,CAAC,GAAGL,OAAL,CAAV,GAA0BQ,GAlEhF;AAAA;AAAA;AAAA;;AAmEY;AACAL,cAAAA,UAAU,GAAG,KAAb;AACAC,cAAAA,IAAI,GAAG,IAAP;AArEZ;;AAAA;AAAA,oBA2EgBR,GAAG,CAACS,CAAD,CAAH,KAAW,EA3E3B;AAAA;AAAA;AAAA;;AA4Ec;AACAJ,cAAAA,SAAS,GA7EvB;;AAAA,oBAgFkBA,SAAS,IAAI,KAAKtB,UAAlB,IAAgCS,WAAW,CAACG,MAAZ,KAAuB,CAhFzE;AAAA;AAAA;AAAA;;AAiFgB,qBAAOK,GAAG,CAACS,CAAD,CAAH,IAAU,EAAjB;AACEA,gBAAAA,CAAC;AADH;;AAjFhB;;AAAA;AA0FQA,cAAAA,CAAC;AA1FT;AAAA;;AAAA;AAAA,mBA6FUD,IA7FV;AAAA;AAAA;AAAA;;AAAA;;AAAA;AAAA,mBAgGUD,UAhGV;AAAA;AAAA;AAAA;;AAmGQ;AACMQ,cAAAA,IApGd,GAoG6Bf,GAAG,CAACgB,KAAJ,CAAUZ,OAAV,EAAmBK,CAAnB,EAAsBQ,QAAtB,EApG7B;AAqGYC,cAAAA,GArGZ,GAqGkB,KAAKC,eAAL,CAAqBJ,IAArB,CArGlB;;AAAA,oBAuGYvB,WAAW,CAACG,MAAZ,KAAuB,CAvGnC;AAAA;AAAA;AAAA;;AAwGU;AACAP,cAAAA,SAAS,GAAGA,SAAS,CAACgC,MAAV,CAAiBF,GAAjB,CAAZ,CAzGV;;AAAA,oBA2Gc9B,SAAS,CAACO,MAAV,IAAoB,KAAKZ,UA3GvC;AAAA;AAAA;AAAA;;AAAA;;AAAA;AAAA;AAAA;;AAAA;AAAA,0DAgH0BmC,GAhH1B;;AAAA;AAAA;AAAA;AAAA;AAAA;;AAgHmBG,cAAAA,GAhHnB;AAiHYA,cAAAA,GAAG,GAAGA,GAAG,CAACxB,WAAJ,EAAN;;AAjHZ,mBAmHgBR,SAnHhB;AAAA;AAAA;AAAA;;AAoHcc,cAAAA,SAAS,CAACmB,GAAV,CAAcD,GAAd;AApHd;AAAA;;AAAA;AAAA,mBAuHkB/B,UAAU,CAACiC,GAAX,CAAeF,GAAf,CAvHlB;AAAA;AAAA;AAAA;;AAwHgBlB,cAAAA,SAAS,CAACmB,GAAV,CAAcD,GAAd,EAxHhB;;AAAA,oBA2HoB3B,CAAC,KAAKF,WAAW,CAACG,MAAZ,GAAqB,CAA3B,IAAgCQ,SAAS,CAACqB,IAAV,IAAkB,KAAKzC,UA3H3E;AAAA;AAAA;AAAA;;AAAA;;AAAA;AAAA;AAAA;;AAAA;AAmIMqB,cAAAA,OAAO,GAAGK,CAAC,GAAG,CAAd;AAnIN;AAAA;;AAAA;AAsIInB,cAAAA,UAAU,GAAGa,SAAb;AACAd,cAAAA,SAAS,GAAG,KAAZ,CAvIJ;;AAAA,oBA0IQD,SAAS,CAACO,MAAV,KAAqB,CAArB,IAA0BL,UAAU,CAACkC,IAAX,KAAoB,CA1ItD;AAAA;AAAA;AAAA;;AAAA,+CA2Ia,EA3Ib;;AAAA;AAgB0C9B,cAAAA,CAAC,EAhB3C;AAAA;AAAA;;AAAA;AAAA,oBAgJMF,WAAW,CAACG,MAAZ,KAAuB,CAhJ7B;AAAA;AAAA;AAAA;;AAAA,+CAiJWP,SAjJX;;AAAA;AAoJE;AACAA,cAAAA,SAAS,GAAGqC,KAAK,CAACC,IAAN,CAAWpC,UAAX,CAAZ;;AArJF,oBAsJMF,SAAS,CAACO,MAAV,GAAmB,KAAKZ,UAtJ9B;AAAA;AAAA;AAAA;;AAAA,+CAuJWK,SAAS,CAAC4B,KAAV,CAAgB,CAAhB,EAAmB,KAAKjC,UAAxB,CAvJX;;AAAA;AAAA,+CAyJSK,SAzJT;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;;;;;;;AA+JA;;;;;;;;;SAOcU;;;kFAAN,kBAAiBF,UAAjB;AAAA;;AAAA;AAAA;AAAA;AAAA;AAEN;AACI+B,cAAAA,YAHE,GAGa,CAHb;AAIFC,cAAAA,UAJE,GAIW,CAAC,CAJZ;AAAA;AAAA,qBAKgB,KAAK5C,KALrB;;AAAA;AAKA6C,cAAAA,OALA;AAAA,2DAMmBA,OANnB;;AAAA;AAAA;AAAA;AAAA;AAAA;;AAAA,2CAMIC,GANJ,oBAMSC,KANT;AAOAC,cAAAA,UAPA,GAOaF,GAAG,CAACd,KAAJ,CAAU,CAAV,EAAapB,UAAU,CAACD,MAAxB,CAPb;;AAAA,oBAQAiC,UAAU,KAAK,CAAC,CARhB;AAAA;AAAA;AAAA;;AAAA,oBASEI,UAAU,IAAIpC,UAThB;AAAA;AAAA;AAAA;;AAUA;AACAgC,cAAAA,UAAU,GAAGG,KAAK,GAAG,CAArB;AAXA;;AAAA;AAeAJ,cAAAA,YAAY,GAAGI,KAAf;;AAfA;AAAA;AAAA;;AAAA;AAAA,gDAqBC,KAAKE,aAAL,CAAmBN,YAAnB,EAAiCC,UAAjC,CArBD;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;;;;;;AAyBR;;;;;;;;;SAOclB;;;qFAAN,kBAAoBiB,YAApB;AAAA;;AAAA;AAAA;AAAA;AAAA;AAAA,oBAEFA,YAAY,IAAI,CAAC,CAFf;AAAA;AAAA;AAAA;;AAAA,gDAGG,IAHH;;AAAA;AAKFC,cAAAA,UALE,GAKW,CAAC,CALZ;;AAAA;AAAA,qBAOgB,KAAK5C,KAPrB;;AAAA;AAOA6C,cAAAA,OAPA;AAAA,2DAQmBA,OARnB;;AAAA;AAAA;AAAA;AAAA;AAAA;;AAAA,2CAQIC,AAAKC,KART;;AAAA,oBASAA,KAAK,IAAIJ,YAAY,GAAG,CATxB;AAAA;AAAA;AAAA;;AAAA;;AAAA;AAYJC,cAAAA,UAAU,GAAGG,KAAb;AAZI;;AAAA;AAAA;AAAA;;AAAA;AAgBNJ,cAAAA,YAAY,GAhBN;;AAAA,gDAmBC,KAAKM,aAAL,CAAmBN,YAAnB,EAAiCC,UAAjC,CAnBD;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;;;;;;AAuBN;;;;;;;;;;SAQcK;;;qFAAN,kBAAoBN,YAApB,EAA0CC,UAA1C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,oBAGFA,UAAU,GAAG,CAHX;AAAA;AAAA;AAAA;;AAAA;AAAA,qBAIe,KAAK9C,MAAL,CAAYoD,IAAZ,EAJf;;AAAA;AAIEA,cAAAA,IAJF;AAKJC,cAAAA,SAAS,GAAGD,IAAI,CAACV,IAAL,GAAYG,YAAxB;AALI;AAAA;;AAAA;AAQJQ,cAAAA,SAAS,GAAGP,UAAU,GAAGD,YAAzB;;AARI;AAWF3B,cAAAA,GAXE,GAWIoC,MAAM,CAACC,KAAP,CAAaF,SAAb,CAXJ;AAAA;AAAA,qBAYA,KAAKrD,MAAL,CAAYwD,IAAZ,CAAiBtC,GAAjB,EAAsB,CAAtB,EAAyBmC,SAAzB,EAAoCR,YAApC,CAZA;;AAAA;AAAA,gDAeC;AAAE,uBAAO3B,GAAT;AAAc,6BAAa4B;AAA3B,eAfD;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;;;;;;AAqBV;;;;;;;;SAMQT,kBAAA,yBAAgBJ,IAAhB;AACN,QAAIG,GAAG,GAAkB,EAAzB;AACA,QAAMqB,KAAK,GAAGxB,IAAI,CAACtB,KAAL,CAAW,GAAX,CAAd;AAEA;;AACA,0DAAmB8C,KAAnB,2CAA0B;AAAA,UAAfC,IAAe;AACxB,UAAMC,IAAI,GAAGD,IAAI,CAAC/C,KAAL,CAAW,GAAX,CAAb;;AACA,UAAIgD,IAAI,CAAC9C,MAAL,KAAgB,CAApB,EAAuB;AACrB,YAAM+C,MAAM,GAAWD,IAAI,CAAC,CAAD,CAA3B;AACA,YAAME,OAAO,GAAWC,MAAM,CAACC,QAAP,CAAgBJ,IAAI,CAAC,CAAD,CAApB,CAAxB;AACA,YAAI,OAAOE,OAAP,KAAmB,QAAnB,IAA+BG,KAAK,CAACH,OAAD,CAAxC,EACE,4CAA0CD,MAA1C,kBAA6DH,KAAK,CAAC,CAAD,CAAlE;AAEFrB,QAAAA,GAAG,CAAC6B,IAAJ,CAASL,MAAT;AACD,OAPD,MAOO,IAAID,IAAI,CAAC9C,MAAL,GAAc,CAAlB,EAAqB;AAC1B,oDAA0C4C,KAAK,CAAC,CAAD,CAA/C;AACD;AACF;;AACD,WAAOrB,GAAP;AACD;AAED;;;;;;;;SAMcjC;;;iFAAN,kBAAgBJ,OAAhB;AAAA;;AAAA;AAAA;AAAA;AAAA;AACAmE,cAAAA,GADA,GACM,IAAIC,GAAJ,EADN;;AAAA;AAAA,qBAIYpE,OAAO,CAACqE,QAAR,EAJZ;;AAAA;AAIAlD,cAAAA,GAJA;AAKAmD,cAAAA,KALA,GAKQnD,GAAG,CAACiB,QAAJ,CAAa,MAAb,EAAqBxB,KAArB,CAA2B,IAA3B,CALR;AAAA,2DAMa0D,KANb;;AAAA;AAAA;AAAA;AAAA;AAAA;;AAMKpC,cAAAA,IANL;;AAAA,oBAOAA,IAAI,CAACpB,MAAL,GAAc,CAPd;AAAA;AAAA;AAAA;;AAQF;AACA;AACMyD,cAAAA,MAVJ,GAUarC,IAAI,CAACsC,MAAL,CAAY,CAAZ,EAAe1E,cAAf,CAVb;AAWI2E,cAAAA,MAXJ,GAWavC,IAAI,CAACsC,MAAL,CAAY1E,cAAZ,CAXb;AAYI4E,cAAAA,GAZJ,GAYUX,MAAM,CAACC,QAAP,CAAgBS,MAAhB,EAAwB,EAAxB,CAZV;;AAAA,oBAaE,OAAOC,GAAP,KAAe,QAAf,IAA2BT,KAAK,CAACS,GAAD,CAblC;AAAA;AAAA;AAAA;;AAAA,2DAc2CH,MAd3C;;AAAA;AAgBFJ,cAAAA,GAAG,CAACQ,GAAJ,CAAQJ,MAAR,EAAgBG,GAAhB;;AAhBE;AAAA;AAAA;;AAAA;AAAA,gDAoBCP,GApBD;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;;;;;;;;;;;;"}

package/src/index.ts

@@ -1,341 +0,0 @@
-import type { FileHandle } from 'fs/promises';
-import type { LocalFile, RemoteFile, BlobFile } from 'generic-filehandle';
-
-type AnyFile = LocalFile | RemoteFile | BlobFile | FileHandle
-type ParsedIxx = Map<string, number>;
-
-const trixPrefixSize = 5;
-
-
-// Define this object with .ixx and .ix files.
-// Then use the trixSearch() function to search for a word.
-export default class Trix {
-  private index: Promise<ParsedIxx>;
-  private ixFile: AnyFile;
-  maxResults: number;
-
-  /**
-   * @param ixxFile [anyFile] the second-level trix index file produced by ixIxx.
-   * @param ixFile [anyFile] the first-level trix index file produced by ixIxx.
-   * @param maxResults [number] the maximum number of results to return. Default is set to 20.
-   */
-  constructor(ixxFile: AnyFile, ixFile: AnyFile, maxResults: number = 20) {
-    this.index = this._parseIxx(ixxFile);
-    this.ixFile = ixFile;
-    this.maxResults = maxResults;
-  }
-
-  
-  /**
-   * Search trix for the given searchWord(s). Return up to {this.maxResults} results.
-   * This method matches each index prefix against each searchWord. It does not do fuzzy matching.
-   *
-   * @param searchString [string] term(s) separated by spaces to search for id(s).
-   * @returns results [Array<string>] where each string is a corresponding itemId.
-   */
-  async search(searchString: string) {
-
-    // If there is one search word, store results in resultArr.
-    let resultArr: Array<string> = [];
-
-    // If there are multiple words, store results in initialSet.
-    // firstWord indicates we are iterating the first time.
-    let firstWord: boolean = true;
-    let initialSet = new Set<string>();
-
-    let searchWords = searchString.split(' ');
-
-    // Loop for each word in searchWords.
-    // If there are more than one searchWords, use resultSet and only take the matching terms
-    // that are also in initialSet. 
-    // Otherwise, just iterate once and add words to resultArr.
-    for (let w = 0; w < searchWords.length; w++) {
-      let searchWord = searchWords[w];
-      searchWord = searchWord.toLowerCase();
-
-      // 1. Seek ahead to byte `this.index` of `ixFile`. Load this section of .ix data into the buffer.
-      let bufData = await this._getBuffer(searchWord);
-      let buf: Buffer = bufData.buf;
-      let bufPos = bufData.bufEndPos;
-      let resultSet = new Set<string>();
-      let linePtr = 0;
-      let numValues = 0;
-
-      // 2. Iterate through the entire buffer
-      while (linePtr < buf.byteLength) {
-        let startsWith = true;
-        let done = false;
-        let i = linePtr;
-
-        // 3. Check if the first word in the current line has the same prefix as searchWord.
-
-        // Iterate through each char of the line in the buffer.
-        // break out of loop when we hit a \n (unicode char 10) or the searchWord does not match the line.
-        while (buf[i] != 10) {
-
-          if (i >= buf.byteLength) {
-            
-            // In this case, we ran out of our current buffer, but could still find more matches.
-            // Load another chunk in to buf and repeat.
-            let tempBufData = await this._getNextChunk(bufPos);
-            if (tempBufData) {
-              buf = tempBufData.buf;
-              bufPos = tempBufData.bufEndPos;              
-              i = 0;
-              linePtr = 0;
-            }
-            else {
-              // If tempBufData is null, we reached the end of the file, so we are done.
-              done = true;
-              break;
-            }
-          }
-
-          
-          if (startsWith) {
-              let cur = String.fromCharCode(buf[i]);
-
-            if (i < linePtr + searchWord.length && searchWord[i - linePtr] > cur) {
-              // searchWord[i] > cur, so keep looping.
-              startsWith = false;
-            } 
-            else if (i < linePtr + searchWord.length && searchWord[i - linePtr] < cur) {
-              // searchWord[i] < cur, so we lexicographically will not find any more results.
-              startsWith = false;
-              done = true;
-              break;
-            } 
-            else {
-              
-              // This condition indicates we found a match.
-              if (buf[i] === 44) {
-                // We found a ',' so increment numValues by one.
-                numValues++;
-
-                // If we're searching for one word and we have enough results, break out at the next space.
-                if (numValues >= this.maxResults && searchWords.length === 1) {
-                  while (buf[i] != 32) 
-                    i++;
-
-                  break;
-                }
-              }
-            }
-          }
-
-          i++;
-        }
-
-        if (done) break;
-
-        // If the line starts with the searchWord, we have a hit!
-        if (startsWith) {
-
-
-          // Parse the line and add results to arr.
-          const line: string = buf.slice(linePtr, i).toString();
-          let arr = this._parseHitString(line);
-
-          if (searchWords.length === 1) {
-            // Only a single search word so add results to array.
-            resultArr = resultArr.concat(arr);
-            // Once we have enough results, stop searching.
-            if (resultArr.length >= this.maxResults) break;
-            
-          }
-          else {
-            // Handle multiple words using sets.
-            for (let hit of arr) {
-              hit = hit.toLowerCase();
-
-              if (firstWord) {
-                resultSet.add(hit);
-              }
-              else {
-                if (initialSet.has(hit)) {
-                  resultSet.add(hit);
-                 
-                  // If it is on the last iteration of words, break after we reach maxResults
-                  if (w === searchWords.length - 1 && resultSet.size >= this.maxResults)
-                    break;
-                }
-              }
-            } 
-          }
-        }
-
-        linePtr = i + 1;
-      }
-
-      initialSet = resultSet;
-      firstWord = false;
-
-      // If there aren't any results, stop looping, because an intersection with an empty set is an empty set.
-      if (resultArr.length === 0 && initialSet.size === 0)
-        return [];
-
-    }
-    
-    // 4. Return the hitList [list of string]
-    if (searchWords.length === 1) {
-      return resultArr;
-    }
-
-    // Else we need to return our set converted to an array
-    resultArr = Array.from(initialSet);
-    if (resultArr.length > this.maxResults)
-      return resultArr.slice(0, this.maxResults)
-
-    return resultArr;
-  }
-
-
-  // Private Methods:
-
-  /**
-   * Seek ahead to the correct position in the .ix file, 
-   * then load that chunk of .ix into a buffer.
-   *
-   * @param searchWord [string]
-   * @returns a Buffer holding the sections we want to search.
-   */
-  private async _getBuffer(searchWord: string) {
-
-    // Get position to seek to in .ix file from indexes.
-    let seekPosStart = 0;
-    let seekPosEnd = -1;
-    const indexes = await this.index;
-    for (let [key, value] of indexes) {
-      let trimmedKey = key.slice(0, searchWord.length);
-      if (seekPosEnd === -1) {
-        if (trimmedKey >= searchWord) {
-          // We reached the end pos in the file.
-          seekPosEnd = value - 1;
-          break;
-        } 
-        else {
-          seekPosStart = value;
-        }
-      }
-    }
-    
-    // Return the buffer and its end position in the file.
-    return this._createBuffer(seekPosStart, seekPosEnd);
-  }
-
-
-  /**
-   * Given the end position of the last buffer, 
-   * load the next chunk  of .ix data into a buffer and return it.
-   *
-   * @param seekPosStart [number] where to start loading data into the new buffer.
-   * @returns a Buffer holding the chunk we want to search.
-   */
-  private async _getNextChunk(seekPosStart: number) {
-
-    if (seekPosStart == -1)
-      return null;
-
-    let seekPosEnd = -1;
-    // Get the next position of the end of buffer.
-    const indexes = await this.index;
-    for (let [key, value] of indexes) {
-      if (value <= seekPosStart + 1)
-        continue
-
-      seekPosEnd = value;
-      break;
-    }
-
-    seekPosStart--;
-
-    // Return the buffer and its end position in the file.
-    return this._createBuffer(seekPosStart, seekPosEnd);
-  }
-
-
-    /**
-   * Create and return a buffer given the start and end position  
-   * of what to load from the .ix file.
-   *
-   * @param seekPosStart [number] byte the buffer should start reading from file.
-   * @param seekPosEnd [number] byte the buffer should stop reading from file.
-   * @returns a Buffer holding the chunk of data.
-   */
-    private async _createBuffer(seekPosStart: number, seekPosEnd: number) {  
-      // Set bufLength to seekPosEnd or the end of the file.
-      let bufLength: number;
-      if (seekPosEnd < 0) {
-        const stat = await this.ixFile.stat();
-        bufLength = stat.size - seekPosStart;
-      } 
-      else {
-        bufLength = seekPosEnd - seekPosStart;
-      }
-  
-      let buf = Buffer.alloc(bufLength);
-      await this.ixFile.read(buf, 0, bufLength, seekPosStart);
-  
-      // Return the buffer and its end position in the file.
-      return { "buf": buf, "bufEndPos": seekPosEnd };
-    }
-
-
-
-
-  /**
-   * Takes in a hit string and returns an array of result terms.
-   *
-   * @param line [string] The line of .ix that is a hit.
-   * @returns results [Array<hit>]. Each hit contains the itemId [string], and wordPos [number].
-   */
-  private _parseHitString(line: string) {
-    let arr: Array<string> = [];
-    const parts = line.split(' ');
-    // Each result is of format: "{itemId},{wordPos}"
-    // Parse the entire line of these and return
-    for (const part of parts) {
-      const pair = part.split(',');
-      if (pair.length === 2) {
-        const itemId: string = pair[0];
-        const wordPos: number = Number.parseInt(pair[1]);
-        if (typeof wordPos !== 'number' || isNaN(wordPos))
-          throw `Error in ix index format at term ${itemId} for word ${parts[0]}`;
-
-        arr.push(itemId);
-      } else if (pair.length > 1) {
-        throw `Error in ix index format at word ${parts[0]}`;
-      }
-    }
-    return arr;
-  }
-
-  /**
-   * Parses ixx file and constructs a map of {word: ixFileLocation}
-   *
-   * @param ixxFile [anyFile] second level index that is produced by ixIxx.
-   * @returns a ParsedIxx map.
-   */
-  private async _parseIxx(ixxFile: AnyFile): Promise<ParsedIxx> {
-    const ixx = new Map();
-
-    // Load the ixxFile into ixxData object
-    const buf = await ixxFile.readFile();
-    const lines = buf.toString('utf8').split('\n');
-    for (const line of lines) {
-      if (line.length > 0) {
-        // Parse the ixx line
-        // Format: 5 characters prefix, 10 characters hex
-        const prefix = line.substr(0, trixPrefixSize);
-        const posStr = line.substr(trixPrefixSize);
-        const pos = Number.parseInt(posStr, 16);
-        if (typeof pos !== 'number' || isNaN(pos))
-          throw `Error in ixx index format at word ${prefix}`;
-
-        ixx.set(prefix, pos);
-      }
-    }
-
-    return ixx;
-  }
-}