@gmod/trix 0.2.1 → 2.0.1

package/dist/trix.cjs.development.js

@@ -1,1472 +0,0 @@
-'use strict';
-
-Object.defineProperty(exports, '__esModule', { value: true });
-
-function asyncGeneratorStep(gen, resolve, reject, _next, _throw, key, arg) {
-  try {
-    var info = gen[key](arg);
-    var value = info.value;
-  } catch (error) {
-    reject(error);
-    return;
-  }
-
-  if (info.done) {
-    resolve(value);
-  } else {
-    Promise.resolve(value).then(_next, _throw);
-  }
-}
-
-function _asyncToGenerator(fn) {
-  return function () {
-    var self = this,
-        args = arguments;
-    return new Promise(function (resolve, reject) {
-      var gen = fn.apply(self, args);
-
-      function _next(value) {
-        asyncGeneratorStep(gen, resolve, reject, _next, _throw, "next", value);
-      }
-
-      function _throw(err) {
-        asyncGeneratorStep(gen, resolve, reject, _next, _throw, "throw", err);
-      }
-
-      _next(undefined);
-    });
-  };
-}
-
-function _unsupportedIterableToArray(o, minLen) {
-  if (!o) return;
-  if (typeof o === "string") return _arrayLikeToArray(o, minLen);
-  var n = Object.prototype.toString.call(o).slice(8, -1);
-  if (n === "Object" && o.constructor) n = o.constructor.name;
-  if (n === "Map" || n === "Set") return Array.from(o);
-  if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen);
-}
-
-function _arrayLikeToArray(arr, len) {
-  if (len == null || len > arr.length) len = arr.length;
-
-  for (var i = 0, arr2 = new Array(len); i < len; i++) arr2[i] = arr[i];
-
-  return arr2;
-}
-
-function _createForOfIteratorHelperLoose(o, allowArrayLike) {
-  var it;
-
-  if (typeof Symbol === "undefined" || o[Symbol.iterator] == null) {
-    if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") {
-      if (it) o = it;
-      var i = 0;
-      return function () {
-        if (i >= o.length) return {
-          done: true
-        };
-        return {
-          done: false,
-          value: o[i++]
-        };
-      };
-    }
-
-    throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
-  }
-
-  it = o[Symbol.iterator]();
-  return it.next.bind(it);
-}
-
-function createCommonjsModule(fn, module) {
-	return module = { exports: {} }, fn(module, module.exports), module.exports;
-}
-
-var runtime_1 = createCommonjsModule(function (module) {
-/**
- * Copyright (c) 2014-present, Facebook, Inc.
- *
- * This source code is licensed under the MIT license found in the
- * LICENSE file in the root directory of this source tree.
- */
-
-var runtime = (function (exports) {
-
-  var Op = Object.prototype;
-  var hasOwn = Op.hasOwnProperty;
-  var undefined$1; // More compressible than void 0.
-  var $Symbol = typeof Symbol === "function" ? Symbol : {};
-  var iteratorSymbol = $Symbol.iterator || "@@iterator";
-  var asyncIteratorSymbol = $Symbol.asyncIterator || "@@asyncIterator";
-  var toStringTagSymbol = $Symbol.toStringTag || "@@toStringTag";
-
-  function define(obj, key, value) {
-    Object.defineProperty(obj, key, {
-      value: value,
-      enumerable: true,
-      configurable: true,
-      writable: true
-    });
-    return obj[key];
-  }
-  try {
-    // IE 8 has a broken Object.defineProperty that only works on DOM objects.
-    define({}, "");
-  } catch (err) {
-    define = function(obj, key, value) {
-      return obj[key] = value;
-    };
-  }
-
-  function wrap(innerFn, outerFn, self, tryLocsList) {
-    // If outerFn provided and outerFn.prototype is a Generator, then outerFn.prototype instanceof Generator.
-    var protoGenerator = outerFn && outerFn.prototype instanceof Generator ? outerFn : Generator;
-    var generator = Object.create(protoGenerator.prototype);
-    var context = new Context(tryLocsList || []);
-
-    // The ._invoke method unifies the implementations of the .next,
-    // .throw, and .return methods.
-    generator._invoke = makeInvokeMethod(innerFn, self, context);
-
-    return generator;
-  }
-  exports.wrap = wrap;
-
-  // Try/catch helper to minimize deoptimizations. Returns a completion
-  // record like context.tryEntries[i].completion. This interface could
-  // have been (and was previously) designed to take a closure to be
-  // invoked without arguments, but in all the cases we care about we
-  // already have an existing method we want to call, so there's no need
-  // to create a new function object. We can even get away with assuming
-  // the method takes exactly one argument, since that happens to be true
-  // in every case, so we don't have to touch the arguments object. The
-  // only additional allocation required is the completion record, which
-  // has a stable shape and so hopefully should be cheap to allocate.
-  function tryCatch(fn, obj, arg) {
-    try {
-      return { type: "normal", arg: fn.call(obj, arg) };
-    } catch (err) {
-      return { type: "throw", arg: err };
-    }
-  }
-
-  var GenStateSuspendedStart = "suspendedStart";
-  var GenStateSuspendedYield = "suspendedYield";
-  var GenStateExecuting = "executing";
-  var GenStateCompleted = "completed";
-
-  // Returning this object from the innerFn has the same effect as
-  // breaking out of the dispatch switch statement.
-  var ContinueSentinel = {};
-
-  // Dummy constructor functions that we use as the .constructor and
-  // .constructor.prototype properties for functions that return Generator
-  // objects. For full spec compliance, you may wish to configure your
-  // minifier not to mangle the names of these two functions.
-  function Generator() {}
-  function GeneratorFunction() {}
-  function GeneratorFunctionPrototype() {}
-
-  // This is a polyfill for %IteratorPrototype% for environments that
-  // don't natively support it.
-  var IteratorPrototype = {};
-  IteratorPrototype[iteratorSymbol] = function () {
-    return this;
-  };
-
-  var getProto = Object.getPrototypeOf;
-  var NativeIteratorPrototype = getProto && getProto(getProto(values([])));
-  if (NativeIteratorPrototype &&
-      NativeIteratorPrototype !== Op &&
-      hasOwn.call(NativeIteratorPrototype, iteratorSymbol)) {
-    // This environment has a native %IteratorPrototype%; use it instead
-    // of the polyfill.
-    IteratorPrototype = NativeIteratorPrototype;
-  }
-
-  var Gp = GeneratorFunctionPrototype.prototype =
-    Generator.prototype = Object.create(IteratorPrototype);
-  GeneratorFunction.prototype = Gp.constructor = GeneratorFunctionPrototype;
-  GeneratorFunctionPrototype.constructor = GeneratorFunction;
-  GeneratorFunction.displayName = define(
-    GeneratorFunctionPrototype,
-    toStringTagSymbol,
-    "GeneratorFunction"
-  );
-
-  // Helper for defining the .next, .throw, and .return methods of the
-  // Iterator interface in terms of a single ._invoke method.
-  function defineIteratorMethods(prototype) {
-    ["next", "throw", "return"].forEach(function(method) {
-      define(prototype, method, function(arg) {
-        return this._invoke(method, arg);
-      });
-    });
-  }
-
-  exports.isGeneratorFunction = function(genFun) {
-    var ctor = typeof genFun === "function" && genFun.constructor;
-    return ctor
-      ? ctor === GeneratorFunction ||
-        // For the native GeneratorFunction constructor, the best we can
-        // do is to check its .name property.
-        (ctor.displayName || ctor.name) === "GeneratorFunction"
-      : false;
-  };
-
-  exports.mark = function(genFun) {
-    if (Object.setPrototypeOf) {
-      Object.setPrototypeOf(genFun, GeneratorFunctionPrototype);
-    } else {
-      genFun.__proto__ = GeneratorFunctionPrototype;
-      define(genFun, toStringTagSymbol, "GeneratorFunction");
-    }
-    genFun.prototype = Object.create(Gp);
-    return genFun;
-  };
-
-  // Within the body of any async function, `await x` is transformed to
-  // `yield regeneratorRuntime.awrap(x)`, so that the runtime can test
-  // `hasOwn.call(value, "__await")` to determine if the yielded value is
-  // meant to be awaited.
-  exports.awrap = function(arg) {
-    return { __await: arg };
-  };
-
-  function AsyncIterator(generator, PromiseImpl) {
-    function invoke(method, arg, resolve, reject) {
-      var record = tryCatch(generator[method], generator, arg);
-      if (record.type === "throw") {
-        reject(record.arg);
-      } else {
-        var result = record.arg;
-        var value = result.value;
-        if (value &&
-            typeof value === "object" &&
-            hasOwn.call(value, "__await")) {
-          return PromiseImpl.resolve(value.__await).then(function(value) {
-            invoke("next", value, resolve, reject);
-          }, function(err) {
-            invoke("throw", err, resolve, reject);
-          });
-        }
-
-        return PromiseImpl.resolve(value).then(function(unwrapped) {
-          // When a yielded Promise is resolved, its final value becomes
-          // the .value of the Promise<{value,done}> result for the
-          // current iteration.
-          result.value = unwrapped;
-          resolve(result);
-        }, function(error) {
-          // If a rejected Promise was yielded, throw the rejection back
-          // into the async generator function so it can be handled there.
-          return invoke("throw", error, resolve, reject);
-        });
-      }
-    }
-
-    var previousPromise;
-
-    function enqueue(method, arg) {
-      function callInvokeWithMethodAndArg() {
-        return new PromiseImpl(function(resolve, reject) {
-          invoke(method, arg, resolve, reject);
-        });
-      }
-
-      return previousPromise =
-        // If enqueue has been called before, then we want to wait until
-        // all previous Promises have been resolved before calling invoke,
-        // so that results are always delivered in the correct order. If
-        // enqueue has not been called before, then it is important to
-        // call invoke immediately, without waiting on a callback to fire,
-        // so that the async generator function has the opportunity to do
-        // any necessary setup in a predictable way. This predictability
-        // is why the Promise constructor synchronously invokes its
-        // executor callback, and why async functions synchronously
-        // execute code before the first await. Since we implement simple
-        // async functions in terms of async generators, it is especially
-        // important to get this right, even though it requires care.
-        previousPromise ? previousPromise.then(
-          callInvokeWithMethodAndArg,
-          // Avoid propagating failures to Promises returned by later
-          // invocations of the iterator.
-          callInvokeWithMethodAndArg
-        ) : callInvokeWithMethodAndArg();
-    }
-
-    // Define the unified helper method that is used to implement .next,
-    // .throw, and .return (see defineIteratorMethods).
-    this._invoke = enqueue;
-  }
-
-  defineIteratorMethods(AsyncIterator.prototype);
-  AsyncIterator.prototype[asyncIteratorSymbol] = function () {
-    return this;
-  };
-  exports.AsyncIterator = AsyncIterator;
-
-  // Note that simple async functions are implemented on top of
-  // AsyncIterator objects; they just return a Promise for the value of
-  // the final result produced by the iterator.
-  exports.async = function(innerFn, outerFn, self, tryLocsList, PromiseImpl) {
-    if (PromiseImpl === void 0) PromiseImpl = Promise;
-
-    var iter = new AsyncIterator(
-      wrap(innerFn, outerFn, self, tryLocsList),
-      PromiseImpl
-    );
-
-    return exports.isGeneratorFunction(outerFn)
-      ? iter // If outerFn is a generator, return the full iterator.
-      : iter.next().then(function(result) {
-          return result.done ? result.value : iter.next();
-        });
-  };
-
-  function makeInvokeMethod(innerFn, self, context) {
-    var state = GenStateSuspendedStart;
-
-    return function invoke(method, arg) {
-      if (state === GenStateExecuting) {
-        throw new Error("Generator is already running");
-      }
-
-      if (state === GenStateCompleted) {
-        if (method === "throw") {
-          throw arg;
-        }
-
-        // Be forgiving, per 25.3.3.3.3 of the spec:
-        // https://people.mozilla.org/~jorendorff/es6-draft.html#sec-generatorresume
-        return doneResult();
-      }
-
-      context.method = method;
-      context.arg = arg;
-
-      while (true) {
-        var delegate = context.delegate;
-        if (delegate) {
-          var delegateResult = maybeInvokeDelegate(delegate, context);
-          if (delegateResult) {
-            if (delegateResult === ContinueSentinel) continue;
-            return delegateResult;
-          }
-        }
-
-        if (context.method === "next") {
-          // Setting context._sent for legacy support of Babel's
-          // function.sent implementation.
-          context.sent = context._sent = context.arg;
-
-        } else if (context.method === "throw") {
-          if (state === GenStateSuspendedStart) {
-            state = GenStateCompleted;
-            throw context.arg;
-          }
-
-          context.dispatchException(context.arg);
-
-        } else if (context.method === "return") {
-          context.abrupt("return", context.arg);
-        }
-
-        state = GenStateExecuting;
-
-        var record = tryCatch(innerFn, self, context);
-        if (record.type === "normal") {
-          // If an exception is thrown from innerFn, we leave state ===
-          // GenStateExecuting and loop back for another invocation.
-          state = context.done
-            ? GenStateCompleted
-            : GenStateSuspendedYield;
-
-          if (record.arg === ContinueSentinel) {
-            continue;
-          }
-
-          return {
-            value: record.arg,
-            done: context.done
-          };
-
-        } else if (record.type === "throw") {
-          state = GenStateCompleted;
-          // Dispatch the exception by looping back around to the
-          // context.dispatchException(context.arg) call above.
-          context.method = "throw";
-          context.arg = record.arg;
-        }
-      }
-    };
-  }
-
-  // Call delegate.iterator[context.method](context.arg) and handle the
-  // result, either by returning a { value, done } result from the
-  // delegate iterator, or by modifying context.method and context.arg,
-  // setting context.delegate to null, and returning the ContinueSentinel.
-  function maybeInvokeDelegate(delegate, context) {
-    var method = delegate.iterator[context.method];
-    if (method === undefined$1) {
-      // A .throw or .return when the delegate iterator has no .throw
-      // method always terminates the yield* loop.
-      context.delegate = null;
-
-      if (context.method === "throw") {
-        // Note: ["return"] must be used for ES3 parsing compatibility.
-        if (delegate.iterator["return"]) {
-          // If the delegate iterator has a return method, give it a
-          // chance to clean up.
-          context.method = "return";
-          context.arg = undefined$1;
-          maybeInvokeDelegate(delegate, context);
-
-          if (context.method === "throw") {
-            // If maybeInvokeDelegate(context) changed context.method from
-            // "return" to "throw", let that override the TypeError below.
-            return ContinueSentinel;
-          }
-        }
-
-        context.method = "throw";
-        context.arg = new TypeError(
-          "The iterator does not provide a 'throw' method");
-      }
-
-      return ContinueSentinel;
-    }
-
-    var record = tryCatch(method, delegate.iterator, context.arg);
-
-    if (record.type === "throw") {
-      context.method = "throw";
-      context.arg = record.arg;
-      context.delegate = null;
-      return ContinueSentinel;
-    }
-
-    var info = record.arg;
-
-    if (! info) {
-      context.method = "throw";
-      context.arg = new TypeError("iterator result is not an object");
-      context.delegate = null;
-      return ContinueSentinel;
-    }
-
-    if (info.done) {
-      // Assign the result of the finished delegate to the temporary
-      // variable specified by delegate.resultName (see delegateYield).
-      context[delegate.resultName] = info.value;
-
-      // Resume execution at the desired location (see delegateYield).
-      context.next = delegate.nextLoc;
-
-      // If context.method was "throw" but the delegate handled the
-      // exception, let the outer generator proceed normally. If
-      // context.method was "next", forget context.arg since it has been
-      // "consumed" by the delegate iterator. If context.method was
-      // "return", allow the original .return call to continue in the
-      // outer generator.
-      if (context.method !== "return") {
-        context.method = "next";
-        context.arg = undefined$1;
-      }
-
-    } else {
-      // Re-yield the result returned by the delegate method.
-      return info;
-    }
-
-    // The delegate iterator is finished, so forget it and continue with
-    // the outer generator.
-    context.delegate = null;
-    return ContinueSentinel;
-  }
-
-  // Define Generator.prototype.{next,throw,return} in terms of the
-  // unified ._invoke helper method.
-  defineIteratorMethods(Gp);
-
-  define(Gp, toStringTagSymbol, "Generator");
-
-  // A Generator should always return itself as the iterator object when the
-  // @@iterator function is called on it. Some browsers' implementations of the
-  // iterator prototype chain incorrectly implement this, causing the Generator
-  // object to not be returned from this call. This ensures that doesn't happen.
-  // See https://github.com/facebook/regenerator/issues/274 for more details.
-  Gp[iteratorSymbol] = function() {
-    return this;
-  };
-
-  Gp.toString = function() {
-    return "[object Generator]";
-  };
-
-  function pushTryEntry(locs) {
-    var entry = { tryLoc: locs[0] };
-
-    if (1 in locs) {
-      entry.catchLoc = locs[1];
-    }
-
-    if (2 in locs) {
-      entry.finallyLoc = locs[2];
-      entry.afterLoc = locs[3];
-    }
-
-    this.tryEntries.push(entry);
-  }
-
-  function resetTryEntry(entry) {
-    var record = entry.completion || {};
-    record.type = "normal";
-    delete record.arg;
-    entry.completion = record;
-  }
-
-  function Context(tryLocsList) {
-    // The root entry object (effectively a try statement without a catch
-    // or a finally block) gives us a place to store values thrown from
-    // locations where there is no enclosing try statement.
-    this.tryEntries = [{ tryLoc: "root" }];
-    tryLocsList.forEach(pushTryEntry, this);
-    this.reset(true);
-  }
-
-  exports.keys = function(object) {
-    var keys = [];
-    for (var key in object) {
-      keys.push(key);
-    }
-    keys.reverse();
-
-    // Rather than returning an object with a next method, we keep
-    // things simple and return the next function itself.
-    return function next() {
-      while (keys.length) {
-        var key = keys.pop();
-        if (key in object) {
-          next.value = key;
-          next.done = false;
-          return next;
-        }
-      }
-
-      // To avoid creating an additional object, we just hang the .value
-      // and .done properties off the next function object itself. This
-      // also ensures that the minifier will not anonymize the function.
-      next.done = true;
-      return next;
-    };
-  };
-
-  function values(iterable) {
-    if (iterable) {
-      var iteratorMethod = iterable[iteratorSymbol];
-      if (iteratorMethod) {
-        return iteratorMethod.call(iterable);
-      }
-
-      if (typeof iterable.next === "function") {
-        return iterable;
-      }
-
-      if (!isNaN(iterable.length)) {
-        var i = -1, next = function next() {
-          while (++i < iterable.length) {
-            if (hasOwn.call(iterable, i)) {
-              next.value = iterable[i];
-              next.done = false;
-              return next;
-            }
-          }
-
-          next.value = undefined$1;
-          next.done = true;
-
-          return next;
-        };
-
-        return next.next = next;
-      }
-    }
-
-    // Return an iterator with no values.
-    return { next: doneResult };
-  }
-  exports.values = values;
-
-  function doneResult() {
-    return { value: undefined$1, done: true };
-  }
-
-  Context.prototype = {
-    constructor: Context,
-
-    reset: function(skipTempReset) {
-      this.prev = 0;
-      this.next = 0;
-      // Resetting context._sent for legacy support of Babel's
-      // function.sent implementation.
-      this.sent = this._sent = undefined$1;
-      this.done = false;
-      this.delegate = null;
-
-      this.method = "next";
-      this.arg = undefined$1;
-
-      this.tryEntries.forEach(resetTryEntry);
-
-      if (!skipTempReset) {
-        for (var name in this) {
-          // Not sure about the optimal order of these conditions:
-          if (name.charAt(0) === "t" &&
-              hasOwn.call(this, name) &&
-              !isNaN(+name.slice(1))) {
-            this[name] = undefined$1;
-          }
-        }
-      }
-    },
-
-    stop: function() {
-      this.done = true;
-
-      var rootEntry = this.tryEntries[0];
-      var rootRecord = rootEntry.completion;
-      if (rootRecord.type === "throw") {
-        throw rootRecord.arg;
-      }
-
-      return this.rval;
-    },
-
-    dispatchException: function(exception) {
-      if (this.done) {
-        throw exception;
-      }
-
-      var context = this;
-      function handle(loc, caught) {
-        record.type = "throw";
-        record.arg = exception;
-        context.next = loc;
-
-        if (caught) {
-          // If the dispatched exception was caught by a catch block,
-          // then let that catch block handle the exception normally.
-          context.method = "next";
-          context.arg = undefined$1;
-        }
-
-        return !! caught;
-      }
-
-      for (var i = this.tryEntries.length - 1; i >= 0; --i) {
-        var entry = this.tryEntries[i];
-        var record = entry.completion;
-
-        if (entry.tryLoc === "root") {
-          // Exception thrown outside of any try block that could handle
-          // it, so set the completion value of the entire function to
-          // throw the exception.
-          return handle("end");
-        }
-
-        if (entry.tryLoc <= this.prev) {
-          var hasCatch = hasOwn.call(entry, "catchLoc");
-          var hasFinally = hasOwn.call(entry, "finallyLoc");
-
-          if (hasCatch && hasFinally) {
-            if (this.prev < entry.catchLoc) {
-              return handle(entry.catchLoc, true);
-            } else if (this.prev < entry.finallyLoc) {
-              return handle(entry.finallyLoc);
-            }
-
-          } else if (hasCatch) {
-            if (this.prev < entry.catchLoc) {
-              return handle(entry.catchLoc, true);
-            }
-
-          } else if (hasFinally) {
-            if (this.prev < entry.finallyLoc) {
-              return handle(entry.finallyLoc);
-            }
-
-          } else {
-            throw new Error("try statement without catch or finally");
-          }
-        }
-      }
-    },
-
-    abrupt: function(type, arg) {
-      for (var i = this.tryEntries.length - 1; i >= 0; --i) {
-        var entry = this.tryEntries[i];
-        if (entry.tryLoc <= this.prev &&
-            hasOwn.call(entry, "finallyLoc") &&
-            this.prev < entry.finallyLoc) {
-          var finallyEntry = entry;
-          break;
-        }
-      }
-
-      if (finallyEntry &&
-          (type === "break" ||
-           type === "continue") &&
-          finallyEntry.tryLoc <= arg &&
-          arg <= finallyEntry.finallyLoc) {
-        // Ignore the finally entry if control is not jumping to a
-        // location outside the try/catch block.
-        finallyEntry = null;
-      }
-
-      var record = finallyEntry ? finallyEntry.completion : {};
-      record.type = type;
-      record.arg = arg;
-
-      if (finallyEntry) {
-        this.method = "next";
-        this.next = finallyEntry.finallyLoc;
-        return ContinueSentinel;
-      }
-
-      return this.complete(record);
-    },
-
-    complete: function(record, afterLoc) {
-      if (record.type === "throw") {
-        throw record.arg;
-      }
-
-      if (record.type === "break" ||
-          record.type === "continue") {
-        this.next = record.arg;
-      } else if (record.type === "return") {
-        this.rval = this.arg = record.arg;
-        this.method = "return";
-        this.next = "end";
-      } else if (record.type === "normal" && afterLoc) {
-        this.next = afterLoc;
-      }
-
-      return ContinueSentinel;
-    },
-
-    finish: function(finallyLoc) {
-      for (var i = this.tryEntries.length - 1; i >= 0; --i) {
-        var entry = this.tryEntries[i];
-        if (entry.finallyLoc === finallyLoc) {
-          this.complete(entry.completion, entry.afterLoc);
-          resetTryEntry(entry);
-          return ContinueSentinel;
-        }
-      }
-    },
-
-    "catch": function(tryLoc) {
-      for (var i = this.tryEntries.length - 1; i >= 0; --i) {
-        var entry = this.tryEntries[i];
-        if (entry.tryLoc === tryLoc) {
-          var record = entry.completion;
-          if (record.type === "throw") {
-            var thrown = record.arg;
-            resetTryEntry(entry);
-          }
-          return thrown;
-        }
-      }
-
-      // The context.catch method must only be called with a location
-      // argument that corresponds to a known catch block.
-      throw new Error("illegal catch attempt");
-    },
-
-    delegateYield: function(iterable, resultName, nextLoc) {
-      this.delegate = {
-        iterator: values(iterable),
-        resultName: resultName,
-        nextLoc: nextLoc
-      };
-
-      if (this.method === "next") {
-        // Deliberately forget the last sent value so that we don't
-        // accidentally pass it on to the delegate.
-        this.arg = undefined$1;
-      }
-
-      return ContinueSentinel;
-    }
-  };
-
-  // Regardless of whether this script is executing as a CommonJS module
-  // or not, return the runtime object so that we can declare the variable
-  // regeneratorRuntime in the outer scope, which allows this module to be
-  // injected easily by `bin/regenerator --include-runtime script.js`.
-  return exports;
-
-}(
-  // If this script is executing as a CommonJS module, use module.exports
-  // as the regeneratorRuntime namespace. Otherwise create a new empty
-  // object. Either way, the resulting object will be used to initialize
-  // the regeneratorRuntime variable at the top of this file.
-   module.exports 
-));
-
-try {
-  regeneratorRuntime = runtime;
-} catch (accidentalStrictMode) {
-  // This module should not be running in strict mode, so the above
-  // assignment should always work unless something is misconfigured. Just
-  // in case runtime.js accidentally runs in strict mode, we can escape
-  // strict mode using a global Function call. This could conceivably fail
-  // if a Content Security Policy forbids using Function, but in that case
-  // the proper solution is to fix the accidental strict mode problem. If
-  // you've misconfigured your bundler to force strict mode and applied a
-  // CSP to forbid Function, and you're not willing to fix either of those
-  // problems, please detail your unique predicament in a GitHub issue.
-  Function("r", "regeneratorRuntime = r")(runtime);
-}
-});
-
-var trixPrefixSize = 5; // Define this object with .ixx and .ix files.
-// Then use the trixSearch() function to search for a word.
-
-var Trix = /*#__PURE__*/function () {
-  /**
-   * @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.
-   */
-  function Trix(ixxFile, ixFile, maxResults) {
-    if (maxResults === void 0) {
-      maxResults = 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.
-   */
-
-
-  var _proto = Trix.prototype;
-
-  _proto.search =
-  /*#__PURE__*/
-  function () {
-    var _search = /*#__PURE__*/_asyncToGenerator( /*#__PURE__*/runtime_1.mark(function _callee(searchString) {
-      var resultArr, firstWord, initialSet, searchWords, w, searchWord, bufData, buf, bufPos, resultSet, linePtr, numValues, startsWith, done, i, tempBufData, cur, line, arr, _iterator, _step, hit;
-
-      return runtime_1.wrap(function _callee$(_context) {
-        while (1) {
-          switch (_context.prev = _context.next) {
-            case 0:
-              // If there is one search word, store results in resultArr.
-              resultArr = []; // If there are multiple words, store results in initialSet.
-              // firstWord indicates we are iterating the first time.
-
-              firstWord = true;
-              initialSet = new Set();
-              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.
-
-              w = 0;
-
-            case 5:
-              if (!(w < searchWords.length)) {
-                _context.next = 89;
-                break;
-              }
-
-              searchWord = searchWords[w];
-              searchWord = searchWord.toLowerCase(); // 1. Seek ahead to byte `this.index` of `ixFile`. Load this section of .ix data into the buffer.
-
-              _context.next = 10;
-              return this._getBuffer(searchWord);
-
-            case 10:
-              bufData = _context.sent;
-              buf = bufData.buf;
-              bufPos = bufData.bufEndPos;
-              resultSet = new Set();
-              linePtr = 0;
-              numValues = 0; // 2. Iterate through the entire buffer
-
-            case 16:
-              if (!(linePtr < buf.byteLength)) {
-                _context.next = 82;
-                break;
-              }
-
-              startsWith = true;
-              done = false;
-              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.
-
-            case 20:
-              if (!(buf[i] != 10)) {
-                _context.next = 54;
-                break;
-              }
-
-              if (!(i >= buf.byteLength)) {
-                _context.next = 34;
-                break;
-              }
-
-              _context.next = 24;
-              return this._getNextChunk(bufPos);
-
-            case 24:
-              tempBufData = _context.sent;
-
-              if (!tempBufData) {
-                _context.next = 32;
-                break;
-              }
-
-              buf = tempBufData.buf;
-              bufPos = tempBufData.bufEndPos;
-              i = 0;
-              linePtr = 0;
-              _context.next = 34;
-              break;
-
-            case 32:
-              // If tempBufData is null, we reached the end of the file, so we are done.
-              done = true;
-              return _context.abrupt("break", 54);
-
-            case 34:
-              if (!startsWith) {
-                _context.next = 51;
-                break;
-              }
-
-              cur = String.fromCharCode(buf[i]);
-
-              if (!(i < linePtr + searchWord.length && searchWord[i - linePtr] > cur)) {
-                _context.next = 40;
-                break;
-              }
-
-              // searchWord[i] > cur, so keep looping.
-              startsWith = false;
-              _context.next = 51;
-              break;
-
-            case 40:
-              if (!(i < linePtr + searchWord.length && searchWord[i - linePtr] < cur)) {
-                _context.next = 46;
-                break;
-              }
-
-              // searchWord[i] < cur, so we lexicographically will not find any more results.
-              startsWith = false;
-              done = true;
-              return _context.abrupt("break", 54);
-
-            case 46:
-              if (!(buf[i] === 44)) {
-                _context.next = 51;
-                break;
-              }
-
-              // 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)) {
-                _context.next = 51;
-                break;
-              }
-
-              while (buf[i] != 32) {
-                i++;
-              }
-
-              return _context.abrupt("break", 54);
-
-            case 51:
-              i++;
-              _context.next = 20;
-              break;
-
-            case 54:
-              if (!done) {
-                _context.next = 56;
-                break;
-              }
-
-              return _context.abrupt("break", 82);
-
-            case 56:
-              if (!startsWith) {
-                _context.next = 79;
-                break;
-              }
-
-              // Parse the line and add results to arr.
-              line = buf.slice(linePtr, i).toString();
-              arr = this._parseHitString(line);
-
-              if (!(searchWords.length === 1)) {
-                _context.next = 65;
-                break;
-              }
-
-              // 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)) {
-                _context.next = 63;
-                break;
-              }
-
-              return _context.abrupt("break", 82);
-
-            case 63:
-              _context.next = 79;
-              break;
-
-            case 65:
-              _iterator = _createForOfIteratorHelperLoose(arr);
-
-            case 66:
-              if ((_step = _iterator()).done) {
-                _context.next = 79;
-                break;
-              }
-
-              hit = _step.value;
-              hit = hit.toLowerCase();
-
-              if (!firstWord) {
-                _context.next = 73;
-                break;
-              }
-
-              resultSet.add(hit);
-              _context.next = 77;
-              break;
-
-            case 73:
-              if (!initialSet.has(hit)) {
-                _context.next = 77;
-                break;
-              }
-
-              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)) {
-                _context.next = 77;
-                break;
-              }
-
-              return _context.abrupt("break", 79);
-
-            case 77:
-              _context.next = 66;
-              break;
-
-            case 79:
-              linePtr = i + 1;
-              _context.next = 16;
-              break;
-
-            case 82:
-              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)) {
-                _context.next = 86;
-                break;
-              }
-
-              return _context.abrupt("return", []);
-
-            case 86:
-              w++;
-              _context.next = 5;
-              break;
-
-            case 89:
-              if (!(searchWords.length === 1)) {
-                _context.next = 91;
-                break;
-              }
-
-              return _context.abrupt("return", resultArr);
-
-            case 91:
-              // Else we need to return our set converted to an array
-              resultArr = Array.from(initialSet);
-
-              if (!(resultArr.length > this.maxResults)) {
-                _context.next = 94;
-                break;
-              }
-
-              return _context.abrupt("return", resultArr.slice(0, this.maxResults));
-
-            case 94:
-              return _context.abrupt("return", resultArr);
-
-            case 95:
-            case "end":
-              return _context.stop();
-          }
-        }
-      }, _callee, this);
-    }));
-
-    function search(_x) {
-      return _search.apply(this, arguments);
-    }
-
-    return search;
-  }() // 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.
-   */
-  ;
-
-  _proto._getBuffer =
-  /*#__PURE__*/
-  function () {
-    var _getBuffer2 = /*#__PURE__*/_asyncToGenerator( /*#__PURE__*/runtime_1.mark(function _callee2(searchWord) {
-      var seekPosStart, seekPosEnd, indexes, _iterator2, _step2, _step2$value, key, value, trimmedKey;
-
-      return runtime_1.wrap(function _callee2$(_context2) {
-        while (1) {
-          switch (_context2.prev = _context2.next) {
-            case 0:
-              // Get position to seek to in .ix file from indexes.
-              seekPosStart = 0;
-              seekPosEnd = -1;
-              _context2.next = 4;
-              return this.index;
-
-            case 4:
-              indexes = _context2.sent;
-              _iterator2 = _createForOfIteratorHelperLoose(indexes);
-
-            case 6:
-              if ((_step2 = _iterator2()).done) {
-                _context2.next = 18;
-                break;
-              }
-
-              _step2$value = _step2.value, key = _step2$value[0], value = _step2$value[1];
-              trimmedKey = key.slice(0, searchWord.length);
-
-              if (!(seekPosEnd === -1)) {
-                _context2.next = 16;
-                break;
-              }
-
-              if (!(trimmedKey >= searchWord)) {
-                _context2.next = 15;
-                break;
-              }
-
-              // We reached the end pos in the file.
-              seekPosEnd = value - 1;
-              return _context2.abrupt("break", 18);
-
-            case 15:
-              seekPosStart = value;
-
-            case 16:
-              _context2.next = 6;
-              break;
-
-            case 18:
-              return _context2.abrupt("return", this._createBuffer(seekPosStart, seekPosEnd));
-
-            case 19:
-            case "end":
-              return _context2.stop();
-          }
-        }
-      }, _callee2, this);
-    }));
-
-    function _getBuffer(_x2) {
-      return _getBuffer2.apply(this, arguments);
-    }
-
-    return _getBuffer;
-  }()
-  /**
-   * 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.
-   */
-  ;
-
-  _proto._getNextChunk =
-  /*#__PURE__*/
-  function () {
-    var _getNextChunk2 = /*#__PURE__*/_asyncToGenerator( /*#__PURE__*/runtime_1.mark(function _callee3(seekPosStart) {
-      var seekPosEnd, indexes, _iterator3, _step3, _step3$value, value;
-
-      return runtime_1.wrap(function _callee3$(_context3) {
-        while (1) {
-          switch (_context3.prev = _context3.next) {
-            case 0:
-              if (!(seekPosStart == -1)) {
-                _context3.next = 2;
-                break;
-              }
-
-              return _context3.abrupt("return", null);
-
-            case 2:
-              seekPosEnd = -1; // Get the next position of the end of buffer.
-
-              _context3.next = 5;
-              return this.index;
-
-            case 5:
-              indexes = _context3.sent;
-              _iterator3 = _createForOfIteratorHelperLoose(indexes);
-
-            case 7:
-              if ((_step3 = _iterator3()).done) {
-                _context3.next = 15;
-                break;
-              }
-
-              _step3$value = _step3.value, value = _step3$value[1];
-
-              if (!(value <= seekPosStart + 1)) {
-                _context3.next = 11;
-                break;
-              }
-
-              return _context3.abrupt("continue", 13);
-
-            case 11:
-              seekPosEnd = value;
-              return _context3.abrupt("break", 15);
-
-            case 13:
-              _context3.next = 7;
-              break;
-
-            case 15:
-              seekPosStart--; // Return the buffer and its end position in the file.
-
-              return _context3.abrupt("return", this._createBuffer(seekPosStart, seekPosEnd));
-
-            case 17:
-            case "end":
-              return _context3.stop();
-          }
-        }
-      }, _callee3, this);
-    }));
-
-    function _getNextChunk(_x3) {
-      return _getNextChunk2.apply(this, arguments);
-    }
-
-    return _getNextChunk;
-  }()
-  /**
-   * 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.
-   */
-  ;
-
-  _proto._createBuffer =
-  /*#__PURE__*/
-  function () {
-    var _createBuffer2 = /*#__PURE__*/_asyncToGenerator( /*#__PURE__*/runtime_1.mark(function _callee4(seekPosStart, seekPosEnd) {
-      var bufLength, stat, buf;
-      return runtime_1.wrap(function _callee4$(_context4) {
-        while (1) {
-          switch (_context4.prev = _context4.next) {
-            case 0:
-              if (!(seekPosEnd < 0)) {
-                _context4.next = 7;
-                break;
-              }
-
-              _context4.next = 3;
-              return this.ixFile.stat();
-
-            case 3:
-              stat = _context4.sent;
-              bufLength = stat.size - seekPosStart;
-              _context4.next = 8;
-              break;
-
-            case 7:
-              bufLength = seekPosEnd - seekPosStart;
-
-            case 8:
-              buf = Buffer.alloc(bufLength);
-              _context4.next = 11;
-              return this.ixFile.read(buf, 0, bufLength, seekPosStart);
-
-            case 11:
-              return _context4.abrupt("return", {
-                buf: buf,
-                bufEndPos: seekPosEnd
-              });
-
-            case 12:
-            case "end":
-              return _context4.stop();
-          }
-        }
-      }, _callee4, this);
-    }));
-
-    function _createBuffer(_x4, _x5) {
-      return _createBuffer2.apply(this, arguments);
-    }
-
-    return _createBuffer;
-  }()
-  /**
-   * 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].
-   */
-  ;
-
-  _proto._parseHitString = function _parseHitString(line) {
-    var arr = [];
-    var parts = line.split(' ').slice(1); // skip term
-    // Each result is of format: "{itemId},{wordPos}"
-    // Parse the entire line of these and return
-
-    for (var _iterator4 = _createForOfIteratorHelperLoose(parts), _step4; !(_step4 = _iterator4()).done;) {
-      var part = _step4.value;
-      var pair = part.split(',');
-
-      if (pair.length === 2) {
-        var itemId = pair[0];
-        var wordPos = Number.parseInt(pair[1]);
-        if (typeof wordPos !== 'number' || isNaN(wordPos)) throw new Error("Error in ix index format at term " + itemId + " for word " + parts[0]);
-        arr.push(itemId);
-      } else if (pair.length > 1) {
-        throw new Error("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.
-   */
-  ;
-
-  _proto._parseIxx =
-  /*#__PURE__*/
-  function () {
-    var _parseIxx2 = /*#__PURE__*/_asyncToGenerator( /*#__PURE__*/runtime_1.mark(function _callee5(ixxFile) {
-      var ixx, buf, lines, _iterator5, _step5, line, prefix, posStr, pos;
-
-      return runtime_1.wrap(function _callee5$(_context5) {
-        while (1) {
-          switch (_context5.prev = _context5.next) {
-            case 0:
-              ixx = new Map(); // Load the ixxFile into ixxData object
-
-              _context5.next = 3;
-              return ixxFile.readFile();
-
-            case 3:
-              buf = _context5.sent;
-              lines = buf.toString('utf8').split('\n');
-              _iterator5 = _createForOfIteratorHelperLoose(lines);
-
-            case 6:
-              if ((_step5 = _iterator5()).done) {
-                _context5.next = 17;
-                break;
-              }
-
-              line = _step5.value;
-
-              if (!(line.length > 0)) {
-                _context5.next = 15;
-                break;
-              }
-
-              // Parse the ixx line
-              // Format: 5 characters prefix, 10 characters hex
-              prefix = line.substr(0, trixPrefixSize);
-              posStr = line.substr(trixPrefixSize);
-              pos = Number.parseInt(posStr, 16);
-
-              if (!(typeof pos !== 'number' || isNaN(pos))) {
-                _context5.next = 14;
-                break;
-              }
-
-              throw new Error("Error in ixx index format at word " + prefix);
-
-            case 14:
-              ixx.set(prefix, pos);
-
-            case 15:
-              _context5.next = 6;
-              break;
-
-            case 17:
-              return _context5.abrupt("return", ixx);
-
-            case 18:
-            case "end":
-              return _context5.stop();
-          }
-        }
-      }, _callee5);
-    }));
-
-    function _parseIxx(_x6) {
-      return _parseIxx2.apply(this, arguments);
-    }
-
-    return _parseIxx;
-  }();
-
-  return Trix;
-}();
-
-exports.default = Trix;
-//# sourceMappingURL=trix.cjs.development.js.map