godash-diagrams 0.0.1

package/dist/godash-diagrams.js

@@ -0,0 +1,4524 @@
+var Ir = "@@__IMMUTABLE_INDEXED__@@";
+function Z(r) {
+  return !!(r && // @ts-expect-error: maybeIndexed is typed as `{}`, need to change in 6.0 to `maybeIndexed && typeof maybeIndexed === 'object' && IS_INDEXED_SYMBOL in maybeIndexed`
+  r[Ir]);
+}
+var qr = "@@__IMMUTABLE_KEYED__@@";
+function T(r) {
+  return !!(r && // @ts-expect-error: maybeKeyed is typed as `{}`, need to change in 6.0 to `maybeKeyed && typeof maybeKeyed === 'object' && IS_KEYED_SYMBOL in maybeKeyed`
+  r[qr]);
+}
+function wn(r) {
+  return T(r) || Z(r);
+}
+var Go = "@@__IMMUTABLE_ITERABLE__@@";
+function W(r) {
+  return !!(r && // @ts-expect-error: maybeCollection is typed as `{}`, need to change in 6.0 to `maybeCollection && typeof maybeCollection === 'object' && IS_COLLECTION_SYMBOL in maybeCollection`
+  r[Go]);
+}
+var j = function(t) {
+  return W(t) ? t : D(t);
+}, Q = /* @__PURE__ */ (function(r) {
+  function t(e) {
+    return T(e) ? e : St(e);
+  }
+  return r && (t.__proto__ = r), t.prototype = Object.create(r && r.prototype), t.prototype.constructor = t, t;
+})(j), Mt = /* @__PURE__ */ (function(r) {
+  function t(e) {
+    return Z(e) ? e : et(e);
+  }
+  return r && (t.__proto__ = r), t.prototype = Object.create(r && r.prototype), t.prototype.constructor = t, t;
+})(j), Dt = /* @__PURE__ */ (function(r) {
+  function t(e) {
+    return W(e) && !wn(e) ? e : Ut(e);
+  }
+  return r && (t.__proto__ = r), t.prototype = Object.create(r && r.prototype), t.prototype.constructor = t, t;
+})(j);
+j.Keyed = Q;
+j.Indexed = Mt;
+j.Set = Dt;
+var Ft = 0, Y = 1, X = 2, hn = typeof Symbol == "function" && Symbol.iterator, Wo = "@@iterator", Or = hn || Wo, w = function(t) {
+  this.next = t;
+};
+w.prototype.toString = function() {
+  return "[Iterator]";
+};
+w.KEYS = Ft;
+w.VALUES = Y;
+w.ENTRIES = X;
+w.prototype.inspect = w.prototype.toSource = function() {
+  return this.toString();
+};
+w.prototype[Or] = function() {
+  return this;
+};
+function R(r, t, e, n) {
+  var i = r === Ft ? t : r === Y ? e : [t, e];
+  return n ? n.value = i : n = {
+    // @ts-expect-error ensure value is not undefined
+    value: i,
+    done: !1
+  }, n;
+}
+function x() {
+  return { value: void 0, done: !0 };
+}
+function Yo(r) {
+  return Array.isArray(r) ? !0 : !!zr(r);
+}
+function ei(r) {
+  return !!(r && // @ts-expect-error: maybeIterator is typed as `{}`
+  typeof r.next == "function");
+}
+function pn(r) {
+  var t = zr(r);
+  return t && t.call(r);
+}
+function zr(r) {
+  var t = r && // @ts-expect-error: maybeIterator is typed as `{}`
+  (hn && r[hn] || // @ts-expect-error: maybeIterator is typed as `{}`
+  r[Wo]);
+  if (typeof t == "function")
+    return t;
+}
+function ns(r) {
+  var t = zr(r);
+  return t && t === r.entries;
+}
+function is(r) {
+  var t = zr(r);
+  return t && t === r.keys;
+}
+var cr = "delete", M = 5, K = 1 << M, P = K - 1, S = {};
+function _n() {
+  return { value: !1 };
+}
+function V(r) {
+  r && (r.value = !0);
+}
+function bn() {
+}
+function $t(r) {
+  return r.size === void 0 && (r.size = r.__iterate(Xo)), r.size;
+}
+function yt(r, t) {
+  if (typeof t != "number") {
+    var e = t >>> 0;
+    if ("" + e !== t || e === 4294967295)
+      return NaN;
+    t = e;
+  }
+  return t < 0 ? $t(r) + t : t;
+}
+function Xo() {
+  return !0;
+}
+function Tr(r, t, e) {
+  return (r === 0 && !Vo(r) || e !== void 0 && r <= -e) && (t === void 0 || e !== void 0 && t >= e);
+}
+function hr(r, t) {
+  return Jo(r, t, 0);
+}
+function Rr(r, t) {
+  return Jo(r, t, t);
+}
+function Jo(r, t, e) {
+  return r === void 0 ? e : Vo(r) ? t === 1 / 0 ? t : Math.max(0, t + r) | 0 : t === void 0 || t === r ? r : Math.min(t, r) | 0;
+}
+function Vo(r) {
+  return r < 0 || r === 0 && 1 / r === -1 / 0;
+}
+var Zo = "@@__IMMUTABLE_RECORD__@@";
+function Et(r) {
+  return !!(r && // @ts-expect-error: maybeRecord is typed as `{}`, need to change in 6.0 to `maybeRecord && typeof maybeRecord === 'object' && IS_RECORD_SYMBOL in maybeRecord`
+  r[Zo]);
+}
+function ct(r) {
+  return W(r) || Et(r);
+}
+var gt = "@@__IMMUTABLE_ORDERED__@@";
+function ut(r) {
+  return !!(r && // @ts-expect-error: maybeOrdered is typed as `{}`, need to change in 6.0 to `maybeOrdered && typeof maybeOrdered === 'object' && IS_ORDERED_SYMBOL in maybeOrdered`
+  r[gt]);
+}
+var Qo = "@@__IMMUTABLE_SEQ__@@";
+function In(r) {
+  return !!(r && // @ts-expect-error: maybeSeq is typed as `{}`, need to change in 6.0 to `maybeSeq && typeof maybeSeq === 'object' && MAYBE_SEQ_SYMBOL in maybeSeq`
+  r[Qo]);
+}
+var Ht = Object.prototype.hasOwnProperty;
+function ta(r) {
+  return Array.isArray(r) || typeof r == "string" ? !0 : r && typeof r == "object" && // @ts-expect-error check that `'length' in value &&`
+  Number.isInteger(r.length) && // @ts-expect-error check that `'length' in value &&`
+  r.length >= 0 && // @ts-expect-error check that `'length' in value &&`
+  (r.length === 0 ? (
+    // Only {length: 0} is considered Array-like.
+    Object.keys(r).length === 1
+  ) : (
+    // An object is only Array-like if it has a property where the last value
+    // in the array-like may be found (which could be undefined).
+    // @ts-expect-error check that `'length' in value &&`
+    r.hasOwnProperty(r.length - 1)
+  ));
+}
+var D = /* @__PURE__ */ (function(r) {
+  function t(e) {
+    return e == null ? Mn() : ct(e) ? e.toSeq() : as(e);
+  }
+  return r && (t.__proto__ = r), t.prototype = Object.create(r && r.prototype), t.prototype.constructor = t, t.prototype.toSeq = function() {
+    return this;
+  }, t.prototype.toString = function() {
+    return this.__toString("Seq {", "}");
+  }, t.prototype.cacheResult = function() {
+    return !this._cache && this.__iterateUncached && (this._cache = this.entrySeq().toArray(), this.size = this._cache.length), this;
+  }, t.prototype.__iterate = function(n, i) {
+    var o = this._cache;
+    if (o) {
+      for (var a = o.length, s = 0; s !== a; ) {
+        var u = o[i ? a - ++s : s++];
+        if (n(u[1], u[0], this) === !1)
+          break;
+      }
+      return s;
+    }
+    return this.__iterateUncached(n, i);
+  }, t.prototype.__iterator = function(n, i) {
+    var o = this._cache;
+    if (o) {
+      var a = o.length, s = 0;
+      return new w(function() {
+        if (s === a)
+          return x();
+        var u = o[i ? a - ++s : s++];
+        return R(n, u[0], u[1]);
+      });
+    }
+    return this.__iteratorUncached(n, i);
+  }, t;
+})(j), St = /* @__PURE__ */ (function(r) {
+  function t(e) {
+    return e == null ? Mn().toKeyedSeq() : W(e) ? T(e) ? e.toSeq() : e.fromEntrySeq() : Et(e) ? e.toSeq() : En(e);
+  }
+  return r && (t.__proto__ = r), t.prototype = Object.create(r && r.prototype), t.prototype.constructor = t, t.prototype.toKeyedSeq = function() {
+    return this;
+  }, t;
+})(D), et = /* @__PURE__ */ (function(r) {
+  function t(e) {
+    return e == null ? Mn() : W(e) ? T(e) ? e.entrySeq() : e.toIndexedSeq() : Et(e) ? e.toSeq().entrySeq() : ra(e);
+  }
+  return r && (t.__proto__ = r), t.prototype = Object.create(r && r.prototype), t.prototype.constructor = t, t.of = function() {
+    return t(arguments);
+  }, t.prototype.toIndexedSeq = function() {
+    return this;
+  }, t.prototype.toString = function() {
+    return this.__toString("Seq [", "]");
+  }, t;
+})(D), Ut = /* @__PURE__ */ (function(r) {
+  function t(e) {
+    return (W(e) && !wn(e) ? e : et(e)).toSetSeq();
+  }
+  return r && (t.__proto__ = r), t.prototype = Object.create(r && r.prototype), t.prototype.constructor = t, t.of = function() {
+    return t(arguments);
+  }, t.prototype.toSetSeq = function() {
+    return this;
+  }, t;
+})(D);
+D.isSeq = In;
+D.Keyed = St;
+D.Set = Ut;
+D.Indexed = et;
+D.prototype[Qo] = !0;
+var Bt = /* @__PURE__ */ (function(r) {
+  function t(e) {
+    this._array = e, this.size = e.length;
+  }
+  return r && (t.__proto__ = r), t.prototype = Object.create(r && r.prototype), t.prototype.constructor = t, t.prototype.get = function(n, i) {
+    return this.has(n) ? this._array[yt(this, n)] : i;
+  }, t.prototype.__iterate = function(n, i) {
+    for (var o = this._array, a = o.length, s = 0; s !== a; ) {
+      var u = i ? a - ++s : s++;
+      if (n(o[u], u, this) === !1)
+        break;
+    }
+    return s;
+  }, t.prototype.__iterator = function(n, i) {
+    var o = this._array, a = o.length, s = 0;
+    return new w(function() {
+      if (s === a)
+        return x();
+      var u = i ? a - ++s : s++;
+      return R(n, u, o[u]);
+    });
+  }, t;
+})(et), qn = /* @__PURE__ */ (function(r) {
+  function t(e) {
+    var n = Object.keys(e).concat(
+      Object.getOwnPropertySymbols ? Object.getOwnPropertySymbols(e) : []
+    );
+    this._object = e, this._keys = n, this.size = n.length;
+  }
+  return r && (t.__proto__ = r), t.prototype = Object.create(r && r.prototype), t.prototype.constructor = t, t.prototype.get = function(n, i) {
+    return i !== void 0 && !this.has(n) ? i : this._object[n];
+  }, t.prototype.has = function(n) {
+    return Ht.call(this._object, n);
+  }, t.prototype.__iterate = function(n, i) {
+    for (var o = this._object, a = this._keys, s = a.length, u = 0; u !== s; ) {
+      var f = a[i ? s - ++u : u++];
+      if (n(o[f], f, this) === !1)
+        break;
+    }
+    return u;
+  }, t.prototype.__iterator = function(n, i) {
+    var o = this._object, a = this._keys, s = a.length, u = 0;
+    return new w(function() {
+      if (u === s)
+        return x();
+      var f = a[i ? s - ++u : u++];
+      return R(n, f, o[f]);
+    });
+  }, t;
+})(St);
+qn.prototype[gt] = !0;
+var os = /* @__PURE__ */ (function(r) {
+  function t(e) {
+    this._collection = e, this.size = e.length || e.size;
+  }
+  return r && (t.__proto__ = r), t.prototype = Object.create(r && r.prototype), t.prototype.constructor = t, t.prototype.__iterateUncached = function(n, i) {
+    if (i)
+      return this.cacheResult().__iterate(n, i);
+    var o = this._collection, a = pn(o), s = 0;
+    if (ei(a))
+      for (var u; !(u = a.next()).done && n(u.value, s++, this) !== !1; )
+        ;
+    return s;
+  }, t.prototype.__iteratorUncached = function(n, i) {
+    if (i)
+      return this.cacheResult().__iterator(n, i);
+    var o = this._collection, a = pn(o);
+    if (!ei(a))
+      return new w(x);
+    var s = 0;
+    return new w(function() {
+      var u = a.next();
+      return u.done ? u : R(n, s++, u.value);
+    });
+  }, t;
+})(et), ni;
+function Mn() {
+  return ni || (ni = new Bt([]));
+}
+function En(r) {
+  var t = On(r);
+  if (t)
+    return t.fromEntrySeq();
+  if (typeof r == "object")
+    return new qn(r);
+  throw new TypeError(
+    "Expected Array or collection object of [k, v] entries, or keyed object: " + r
+  );
+}
+function ra(r) {
+  var t = On(r);
+  if (t)
+    return t;
+  throw new TypeError(
+    "Expected Array or collection object of values: " + r
+  );
+}
+function as(r) {
+  var t = On(r);
+  if (t)
+    return ns(r) ? t.fromEntrySeq() : is(r) ? t.toSetSeq() : t;
+  if (typeof r == "object")
+    return new qn(r);
+  throw new TypeError(
+    "Expected Array or collection object of values, or keyed object: " + r
+  );
+}
+function On(r) {
+  return ta(r) ? new Bt(r) : Yo(r) ? new os(r) : void 0;
+}
+function pr() {
+  return this.__ensureOwner();
+}
+function _r() {
+  return this.__ownerID ? this : this.__ensureOwner(new bn());
+}
+var Yt = typeof Math.imul == "function" && Math.imul(4294967295, 2) === -2 ? Math.imul : function(t, e) {
+  t |= 0, e |= 0;
+  var n = t & 65535, i = e & 65535;
+  return n * i + ((t >>> 16) * i + n * (e >>> 16) << 16 >>> 0) | 0;
+};
+function Ar(r) {
+  return r >>> 1 & 1073741824 | r & 3221225471;
+}
+var ss = Object.prototype.valueOf;
+function F(r) {
+  if (r == null)
+    return ii(r);
+  if (typeof r.hashCode == "function")
+    return Ar(r.hashCode(r));
+  var t = _s(r);
+  if (t == null)
+    return ii(t);
+  switch (typeof t) {
+    case "boolean":
+      return t ? 1108378657 : 1108378656;
+    case "number":
+      return us(t);
+    case "string":
+      return t.length > ds ? fs(t) : dn(t);
+    case "object":
+    case "function":
+      return hs(t);
+    case "symbol":
+      return cs(t);
+    default:
+      if (typeof t.toString == "function")
+        return dn(t.toString());
+      throw new Error("Value type " + typeof t + " cannot be hashed.");
+  }
+}
+function ii(r) {
+  return r === null ? 1108378658 : (
+    /* undefined */
+    1108378659
+  );
+}
+function us(r) {
+  if (r !== r || r === 1 / 0)
+    return 0;
+  var t = r | 0;
+  for (t !== r && (t ^= r * 4294967295); r > 4294967295; )
+    r /= 4294967295, t ^= r;
+  return Ar(t);
+}
+function fs(r) {
+  var t = Fr[r];
+  return t === void 0 && (t = dn(r), Dr === ls && (Dr = 0, Fr = {}), Dr++, Fr[r] = t), t;
+}
+function dn(r) {
+  for (var t = 0, e = 0; e < r.length; e++)
+    t = 31 * t + r.charCodeAt(e) | 0;
+  return Ar(t);
+}
+function cs(r) {
+  var t = si[r];
+  return t !== void 0 || (t = ea(), si[r] = t), t;
+}
+function hs(r) {
+  var t;
+  if (ln && (t = vn.get(r), t !== void 0) || (t = r[It], t !== void 0) || !ai && (t = r.propertyIsEnumerable && r.propertyIsEnumerable[It], t !== void 0 || (t = ps(r), t !== void 0)))
+    return t;
+  if (t = ea(), ln)
+    vn.set(r, t);
+  else {
+    if (oi !== void 0 && oi(r) === !1)
+      throw new Error("Non-extensible objects are not allowed as keys.");
+    if (ai)
+      Object.defineProperty(r, It, {
+        enumerable: !1,
+        configurable: !1,
+        writable: !1,
+        value: t
+      });
+    else if (r.propertyIsEnumerable !== void 0 && r.propertyIsEnumerable === r.constructor.prototype.propertyIsEnumerable)
+      r.propertyIsEnumerable = function() {
+        return this.constructor.prototype.propertyIsEnumerable.apply(
+          this,
+          // eslint-disable-next-line prefer-rest-params
+          arguments
+        );
+      }, r.propertyIsEnumerable[It] = t;
+    else if (r.nodeType !== void 0)
+      r[It] = t;
+    else
+      throw new Error("Unable to set a non-enumerable property on object.");
+  }
+  return t;
+}
+var oi = Object.isExtensible, ai = (function() {
+  try {
+    return Object.defineProperty({}, "@", {}), !0;
+  } catch {
+    return !1;
+  }
+})();
+function ps(r) {
+  if (r && r.nodeType > 0)
+    switch (r.nodeType) {
+      case 1:
+        return r.uniqueID;
+      case 9:
+        return r.documentElement && r.documentElement.uniqueID;
+    }
+}
+function _s(r) {
+  return r.valueOf !== ss && typeof r.valueOf == "function" ? (
+    // @ts-expect-error weird the "obj" parameter as `valueOf` should not have a parameter
+    r.valueOf(r)
+  ) : r;
+}
+function ea() {
+  var r = ++Nr;
+  return Nr & 1073741824 && (Nr = 0), r;
+}
+var ln = typeof WeakMap == "function", vn;
+ln && (vn = /* @__PURE__ */ new WeakMap());
+var si = /* @__PURE__ */ Object.create(null), Nr = 0, It = "__immutablehash__";
+typeof Symbol == "function" && (It = Symbol(It));
+var ds = 16, ls = 255, Dr = 0, Fr = {}, Cr = /* @__PURE__ */ (function(r) {
+  function t(e, n) {
+    this._iter = e, this._useKeys = n, this.size = e.size;
+  }
+  return r && (t.__proto__ = r), t.prototype = Object.create(r && r.prototype), t.prototype.constructor = t, t.prototype.get = function(n, i) {
+    return this._iter.get(n, i);
+  }, t.prototype.has = function(n) {
+    return this._iter.has(n);
+  }, t.prototype.valueSeq = function() {
+    return this._iter.valueSeq();
+  }, t.prototype.reverse = function() {
+    var n = this, i = zn(this, !0);
+    return this._useKeys || (i.valueSeq = function() {
+      return n._iter.toSeq().reverse();
+    }), i;
+  }, t.prototype.map = function(n, i) {
+    var o = this, a = sa(this, n, i);
+    return this._useKeys || (a.valueSeq = function() {
+      return o._iter.toSeq().map(n, i);
+    }), a;
+  }, t.prototype.__iterate = function(n, i) {
+    var o = this;
+    return this._iter.__iterate(function(a, s) {
+      return n(a, s, o);
+    }, i);
+  }, t.prototype.__iterator = function(n, i) {
+    return this._iter.__iterator(n, i);
+  }, t;
+})(St);
+Cr.prototype[gt] = !0;
+var na = /* @__PURE__ */ (function(r) {
+  function t(e) {
+    this._iter = e, this.size = e.size;
+  }
+  return r && (t.__proto__ = r), t.prototype = Object.create(r && r.prototype), t.prototype.constructor = t, t.prototype.includes = function(n) {
+    return this._iter.includes(n);
+  }, t.prototype.__iterate = function(n, i) {
+    var o = this, a = 0;
+    return i && $t(this), this._iter.__iterate(
+      function(s) {
+        return n(s, i ? o.size - ++a : a++, o);
+      },
+      i
+    );
+  }, t.prototype.__iterator = function(n, i) {
+    var o = this, a = this._iter.__iterator(Y, i), s = 0;
+    return i && $t(this), new w(function() {
+      var u = a.next();
+      return u.done ? u : R(
+        n,
+        i ? o.size - ++s : s++,
+        u.value,
+        u
+      );
+    });
+  }, t;
+})(et), ia = /* @__PURE__ */ (function(r) {
+  function t(e) {
+    this._iter = e, this.size = e.size;
+  }
+  return r && (t.__proto__ = r), t.prototype = Object.create(r && r.prototype), t.prototype.constructor = t, t.prototype.has = function(n) {
+    return this._iter.includes(n);
+  }, t.prototype.__iterate = function(n, i) {
+    var o = this;
+    return this._iter.__iterate(function(a) {
+      return n(a, a, o);
+    }, i);
+  }, t.prototype.__iterator = function(n, i) {
+    var o = this._iter.__iterator(Y, i);
+    return new w(function() {
+      var a = o.next();
+      return a.done ? a : R(n, a.value, a.value, a);
+    });
+  }, t;
+})(Ut), oa = /* @__PURE__ */ (function(r) {
+  function t(e) {
+    this._iter = e, this.size = e.size;
+  }
+  return r && (t.__proto__ = r), t.prototype = Object.create(r && r.prototype), t.prototype.constructor = t, t.prototype.entrySeq = function() {
+    return this._iter.toSeq();
+  }, t.prototype.__iterate = function(n, i) {
+    var o = this;
+    return this._iter.__iterate(function(a) {
+      if (a) {
+        fi(a);
+        var s = W(a);
+        return n(
+          s ? a.get(1) : a[1],
+          s ? a.get(0) : a[0],
+          o
+        );
+      }
+    }, i);
+  }, t.prototype.__iterator = function(n, i) {
+    var o = this._iter.__iterator(Y, i);
+    return new w(function() {
+      for (; ; ) {
+        var a = o.next();
+        if (a.done)
+          return a;
+        var s = a.value;
+        if (s) {
+          fi(s);
+          var u = W(s);
+          return R(
+            n,
+            u ? s.get(0) : s[0],
+            u ? s.get(1) : s[1],
+            a
+          );
+        }
+      }
+    });
+  }, t;
+})(St);
+na.prototype.cacheResult = Cr.prototype.cacheResult = ia.prototype.cacheResult = oa.prototype.cacheResult = An;
+function aa(r) {
+  var t = ht(r);
+  return t._iter = r, t.size = r.size, t.flip = function() {
+    return r;
+  }, t.reverse = function() {
+    var e = r.reverse.apply(this);
+    return e.flip = function() {
+      return r.reverse();
+    }, e;
+  }, t.has = function(e) {
+    return r.includes(e);
+  }, t.includes = function(e) {
+    return r.has(e);
+  }, t.cacheResult = An, t.__iterateUncached = function(e, n) {
+    var i = this;
+    return r.__iterate(function(o, a) {
+      return e(a, o, i) !== !1;
+    }, n);
+  }, t.__iteratorUncached = function(e, n) {
+    if (e === X) {
+      var i = r.__iterator(e, n);
+      return new w(function() {
+        var o = i.next();
+        if (!o.done) {
+          var a = o.value[0];
+          o.value[0] = o.value[1], o.value[1] = a;
+        }
+        return o;
+      });
+    }
+    return r.__iterator(
+      e === Y ? Ft : Y,
+      n
+    );
+  }, t;
+}
+function sa(r, t, e) {
+  var n = ht(r);
+  return n.size = r.size, n.has = function(i) {
+    return r.has(i);
+  }, n.get = function(i, o) {
+    var a = r.get(i, S);
+    return a === S ? o : t.call(e, a, i, r);
+  }, n.__iterateUncached = function(i, o) {
+    var a = this;
+    return r.__iterate(
+      function(s, u, f) {
+        return i(t.call(e, s, u, f), u, a) !== !1;
+      },
+      o
+    );
+  }, n.__iteratorUncached = function(i, o) {
+    var a = r.__iterator(X, o);
+    return new w(function() {
+      var s = a.next();
+      if (s.done)
+        return s;
+      var u = s.value, f = u[0];
+      return R(
+        i,
+        f,
+        t.call(e, u[1], f, r),
+        s
+      );
+    });
+  }, n;
+}
+function zn(r, t) {
+  var e = this, n = ht(r);
+  return n._iter = r, n.size = r.size, n.reverse = function() {
+    return r;
+  }, r.flip && (n.flip = function() {
+    var i = aa(r);
+    return i.reverse = function() {
+      return r.flip();
+    }, i;
+  }), n.get = function(i, o) {
+    return r.get(t ? i : -1 - i, o);
+  }, n.has = function(i) {
+    return r.has(t ? i : -1 - i);
+  }, n.includes = function(i) {
+    return r.includes(i);
+  }, n.cacheResult = An, n.__iterate = function(i, o) {
+    var a = this, s = 0;
+    return o && $t(r), r.__iterate(
+      function(u, f) {
+        return i(u, t ? f : o ? a.size - ++s : s++, a);
+      },
+      !o
+    );
+  }, n.__iterator = function(i, o) {
+    var a = 0;
+    o && $t(r);
+    var s = r.__iterator(X, !o);
+    return new w(function() {
+      var u = s.next();
+      if (u.done)
+        return u;
+      var f = u.value;
+      return R(
+        i,
+        t ? f[0] : o ? e.size - ++a : a++,
+        f[1],
+        u
+      );
+    });
+  }, n;
+}
+function ua(r, t, e, n) {
+  var i = ht(r);
+  return n && (i.has = function(o) {
+    var a = r.get(o, S);
+    return a !== S && !!t.call(e, a, o, r);
+  }, i.get = function(o, a) {
+    var s = r.get(o, S);
+    return s !== S && t.call(e, s, o, r) ? s : a;
+  }), i.__iterateUncached = function(o, a) {
+    var s = this, u = 0;
+    return r.__iterate(function(f, c, h) {
+      if (t.call(e, f, c, h))
+        return u++, o(f, n ? c : u - 1, s);
+    }, a), u;
+  }, i.__iteratorUncached = function(o, a) {
+    var s = r.__iterator(X, a), u = 0;
+    return new w(function() {
+      for (; ; ) {
+        var f = s.next();
+        if (f.done)
+          return f;
+        var c = f.value, h = c[0], p = c[1];
+        if (t.call(e, p, h, r))
+          return R(o, n ? h : u++, p, f);
+      }
+    });
+  }, i;
+}
+function vs(r, t, e) {
+  var n = U().asMutable();
+  return r.__iterate(function(i, o) {
+    n.update(t.call(e, i, o, r), 0, function(a) {
+      return a + 1;
+    });
+  }), n.asImmutable();
+}
+function ys(r, t, e) {
+  var n = T(r), i = (ut(r) ? dt() : U()).asMutable();
+  r.__iterate(function(a, s) {
+    i.update(
+      t.call(e, a, s, r),
+      function(u) {
+        return u = u || [], u.push(n ? [s, a] : a), u;
+      }
+    );
+  });
+  var o = Rn(r);
+  return i.map(function(a) {
+    return q(r, o(a));
+  }).asImmutable();
+}
+function gs(r, t, e) {
+  var n = T(r), i = [[], []];
+  r.__iterate(function(a, s) {
+    i[t.call(e, a, s, r) ? 1 : 0].push(
+      n ? [s, a] : a
+    );
+  });
+  var o = Rn(r);
+  return i.map(function(a) {
+    return q(r, o(a));
+  });
+}
+function Tn(r, t, e, n) {
+  var i = r.size;
+  if (Tr(t, e, i))
+    return r;
+  if (typeof i > "u" && (t < 0 || e < 0))
+    return Tn(r.toSeq().cacheResult(), t, e, n);
+  var o = hr(t, i), a = Rr(e, i), s = a - o, u;
+  s === s && (u = s < 0 ? 0 : s);
+  var f = ht(r);
+  return f.size = u === 0 ? u : r.size && u || void 0, !n && In(r) && u >= 0 && (f.get = function(c, h) {
+    return c = yt(this, c), c >= 0 && c < u ? r.get(c + o, h) : h;
+  }), f.__iterateUncached = function(c, h) {
+    var p = this;
+    if (u === 0)
+      return 0;
+    if (h)
+      return this.cacheResult().__iterate(c, h);
+    var _ = 0, d = !0, v = 0;
+    return r.__iterate(function(I, y) {
+      if (!(d && (d = _++ < o)))
+        return v++, c(I, n ? y : v - 1, p) !== !1 && v !== u;
+    }), v;
+  }, f.__iteratorUncached = function(c, h) {
+    if (u !== 0 && h)
+      return this.cacheResult().__iterator(c, h);
+    if (u === 0)
+      return new w(x);
+    var p = r.__iterator(c, h), _ = 0, d = 0;
+    return new w(function() {
+      for (; _++ < o; )
+        p.next();
+      if (++d > u)
+        return x();
+      var v = p.next();
+      return n || c === Y || v.done ? v : c === Ft ? R(c, d - 1, void 0, v) : R(c, d - 1, v.value[1], v);
+    });
+  }, f;
+}
+function ms(r, t, e) {
+  var n = ht(r);
+  return n.__iterateUncached = function(i, o) {
+    var a = this;
+    if (o)
+      return this.cacheResult().__iterate(i, o);
+    var s = 0;
+    return r.__iterate(
+      function(u, f, c) {
+        return t.call(e, u, f, c) && ++s && i(u, f, a);
+      }
+    ), s;
+  }, n.__iteratorUncached = function(i, o) {
+    var a = this;
+    if (o)
+      return this.cacheResult().__iterator(i, o);
+    var s = r.__iterator(X, o), u = !0;
+    return new w(function() {
+      if (!u)
+        return x();
+      var f = s.next();
+      if (f.done)
+        return f;
+      var c = f.value, h = c[0], p = c[1];
+      return t.call(e, p, h, a) ? i === X ? f : R(i, h, p, f) : (u = !1, x());
+    });
+  }, n;
+}
+function fa(r, t, e, n) {
+  var i = ht(r);
+  return i.__iterateUncached = function(o, a) {
+    var s = this;
+    if (a)
+      return this.cacheResult().__iterate(o, a);
+    var u = !0, f = 0;
+    return r.__iterate(function(c, h, p) {
+      if (!(u && (u = t.call(e, c, h, p))))
+        return f++, o(c, n ? h : f - 1, s);
+    }), f;
+  }, i.__iteratorUncached = function(o, a) {
+    var s = this;
+    if (a)
+      return this.cacheResult().__iterator(o, a);
+    var u = r.__iterator(X, a), f = !0, c = 0;
+    return new w(function() {
+      var h, p, _;
+      do {
+        if (h = u.next(), h.done)
+          return n || o === Y ? h : o === Ft ? R(o, c++, void 0, h) : R(o, c++, h.value[1], h);
+        var d = h.value;
+        p = d[0], _ = d[1], f && (f = t.call(e, _, p, s));
+      } while (f);
+      return o === X ? h : R(o, p, _, h);
+    });
+  }, i;
+}
+var Ss = /* @__PURE__ */ (function(r) {
+  function t(e) {
+    this._wrappedIterables = e.flatMap(function(n) {
+      return n._wrappedIterables ? n._wrappedIterables : [n];
+    }), this.size = this._wrappedIterables.reduce(function(n, i) {
+      if (n !== void 0) {
+        var o = i.size;
+        if (o !== void 0)
+          return n + o;
+      }
+    }, 0), this[qr] = this._wrappedIterables[0][qr], this[Ir] = this._wrappedIterables[0][Ir], this[gt] = this._wrappedIterables[0][gt];
+  }
+  return r && (t.__proto__ = r), t.prototype = Object.create(r && r.prototype), t.prototype.constructor = t, t.prototype.__iterateUncached = function(n, i) {
+    if (this._wrappedIterables.length !== 0) {
+      if (i)
+        return this.cacheResult().__iterate(n, i);
+      for (var o = 0, a = T(this), s = a ? X : Y, u = this._wrappedIterables[o].__iterator(
+        s,
+        i
+      ), f = !0, c = 0; f; ) {
+        for (var h = u.next(); h.done; ) {
+          if (o++, o === this._wrappedIterables.length)
+            return c;
+          u = this._wrappedIterables[o].__iterator(
+            s,
+            i
+          ), h = u.next();
+        }
+        var p = a ? n(h.value[1], h.value[0], this) : n(h.value, c, this);
+        f = p !== !1, c++;
+      }
+      return c;
+    }
+  }, t.prototype.__iteratorUncached = function(n, i) {
+    var o = this;
+    if (this._wrappedIterables.length === 0)
+      return new w(x);
+    if (i)
+      return this.cacheResult().__iterator(n, i);
+    var a = 0, s = this._wrappedIterables[a].__iterator(
+      n,
+      i
+    );
+    return new w(function() {
+      for (var u = s.next(); u.done; ) {
+        if (a++, a === o._wrappedIterables.length)
+          return u;
+        s = o._wrappedIterables[a].__iterator(
+          n,
+          i
+        ), u = s.next();
+      }
+      return u;
+    });
+  }, t;
+})(D);
+function ws(r, t) {
+  var e = T(r), n = [r].concat(t).map(function(o) {
+    return W(o) ? e && (o = Q(o)) : o = e ? En(o) : ra(Array.isArray(o) ? o : [o]), o;
+  }).filter(function(o) {
+    return o.size !== 0;
+  });
+  if (n.length === 0)
+    return r;
+  if (n.length === 1) {
+    var i = n[0];
+    if (i === r || e && T(i) || Z(r) && Z(i))
+      return i;
+  }
+  return new Ss(n);
+}
+function ca(r, t, e) {
+  var n = ht(r);
+  return n.__iterateUncached = function(i, o) {
+    if (o)
+      return this.cacheResult().__iterate(i, o);
+    var a = 0, s = !1;
+    function u(f, c) {
+      f.__iterate(function(h, p) {
+        return (!t || c < t) && W(h) ? u(h, c + 1) : (a++, i(h, e ? p : a - 1, n) === !1 && (s = !0)), !s;
+      }, o);
+    }
+    return u(r, 0), a;
+  }, n.__iteratorUncached = function(i, o) {
+    if (o)
+      return this.cacheResult().__iterator(i, o);
+    var a = r.__iterator(i, o), s = [], u = 0;
+    return new w(function() {
+      for (; a; ) {
+        var f = a.next();
+        if (f.done !== !1) {
+          a = s.pop();
+          continue;
+        }
+        var c = f.value;
+        if (i === X && (c = c[1]), (!t || s.length < t) && W(c))
+          s.push(a), a = c.__iterator(i, o);
+        else
+          return e ? f : R(i, u++, c, f);
+      }
+      return x();
+    });
+  }, n;
+}
+function bs(r, t, e) {
+  var n = Rn(r);
+  return r.toSeq().map(function(i, o) {
+    return n(t.call(e, i, o, r));
+  }).flatten(!0);
+}
+function Is(r, t) {
+  var e = ht(r);
+  return e.size = r.size && r.size * 2 - 1, e.__iterateUncached = function(n, i) {
+    var o = this, a = 0;
+    return r.__iterate(
+      function(s) {
+        return (!a || n(t, a++, o) !== !1) && n(s, a++, o) !== !1;
+      },
+      i
+    ), a;
+  }, e.__iteratorUncached = function(n, i) {
+    var o = r.__iterator(Y, i), a = 0, s;
+    return new w(function() {
+      return (!s || a % 2) && (s = o.next(), s.done) ? s : a % 2 ? R(n, a++, t) : R(n, a++, s.value, s);
+    });
+  }, e;
+}
+function kt(r, t, e) {
+  t || (t = ha);
+  var n = T(r), i = 0, o = r.toSeq().map(function(a, s) {
+    return [s, a, i++, e ? e(a, s, r) : a];
+  }).valueSeq().toArray();
+  return o.sort(function(a, s) {
+    return t(a[3], s[3]) || a[2] - s[2];
+  }).forEach(
+    n ? function(a, s) {
+      o[s].length = 2;
+    } : function(a, s) {
+      o[s] = a[1];
+    }
+  ), n ? St(o) : Z(r) ? et(o) : Ut(o);
+}
+function vr(r, t, e) {
+  if (t || (t = ha), e) {
+    var n = r.toSeq().map(function(i, o) {
+      return [i, e(i, o, r)];
+    }).reduce(function(i, o) {
+      return ui(t, i[1], o[1]) ? o : i;
+    });
+    return n && n[0];
+  }
+  return r.reduce(function(i, o) {
+    return ui(t, i, o) ? o : i;
+  });
+}
+function ui(r, t, e) {
+  var n = r(e, t);
+  return n === 0 && e !== t && (e == null || e !== e) || n > 0;
+}
+function yr(r, t, e, n) {
+  var i = ht(r), o = new Bt(e).map(function(a) {
+    return a.size;
+  });
+  return i.size = n ? o.max() : o.min(), i.__iterate = function(a, s) {
+    for (var u = this.__iterator(Y, s), f, c = 0; !(f = u.next()).done && a(f.value, c++, this) !== !1; )
+      ;
+    return c;
+  }, i.__iteratorUncached = function(a, s) {
+    var u = e.map(
+      function(h) {
+        return h = j(h), pn(s ? h.reverse() : h);
+      }
+    ), f = 0, c = !1;
+    return new w(function() {
+      var h;
+      return c || (h = u.map(function(p) {
+        return p.next();
+      }), c = n ? h.every(function(p) {
+        return p.done;
+      }) : h.some(function(p) {
+        return p.done;
+      })), c ? x() : R(
+        a,
+        f++,
+        t.apply(
+          null,
+          h.map(function(p) {
+            return p.value;
+          })
+        )
+      );
+    });
+  }, i;
+}
+function q(r, t) {
+  return r === t ? r : In(r) ? t : r.constructor(t);
+}
+function fi(r) {
+  if (r !== Object(r))
+    throw new TypeError("Expected [K, V] tuple: " + r);
+}
+function Rn(r) {
+  return T(r) ? Q : Z(r) ? Mt : Dt;
+}
+function ht(r) {
+  return Object.create(
+    (T(r) ? St : Z(r) ? et : Ut).prototype
+  );
+}
+function An() {
+  return this._iter.cacheResult ? (this._iter.cacheResult(), this.size = this._iter.size, this) : D.prototype.cacheResult.call(this);
+}
+function ha(r, t) {
+  return r === void 0 && t === void 0 ? 0 : r === void 0 ? 1 : t === void 0 ? -1 : r > t ? 1 : r < t ? -1 : 0;
+}
+function ci(r) {
+  return !!(r && // @ts-expect-error: maybeValue is typed as `{}`
+  typeof r.equals == "function" && // @ts-expect-error: maybeValue is typed as `{}`
+  typeof r.hashCode == "function");
+}
+function G(r, t) {
+  if (r === t || r !== r && t !== t)
+    return !0;
+  if (!r || !t)
+    return !1;
+  if (typeof r.valueOf == "function" && typeof t.valueOf == "function") {
+    if (r = r.valueOf(), t = t.valueOf(), r === t || r !== r && t !== t)
+      return !0;
+    if (!r || !t)
+      return !1;
+  }
+  return !!(ci(r) && ci(t) && r.equals(t));
+}
+function pa(r, t, e, n) {
+  return Kt(
+    // @ts-expect-error Index signature for type string is missing in type V[]
+    r,
+    [t],
+    e,
+    n
+  );
+}
+function _a() {
+  for (var r = [], t = arguments.length; t--; ) r[t] = arguments[t];
+  return la(this, r);
+}
+function da(r) {
+  for (var t = [], e = arguments.length - 1; e-- > 0; ) t[e] = arguments[e + 1];
+  if (typeof r != "function")
+    throw new TypeError("Invalid merger function: " + r);
+  return la(this, t, r);
+}
+function la(r, t, e) {
+  for (var n = [], i = 0; i < t.length; i++) {
+    var o = Q(t[i]);
+    o.size !== 0 && n.push(o);
+  }
+  return n.length === 0 ? r : r.toSeq().size === 0 && !r.__ownerID && n.length === 1 ? Et(r) ? r : r.constructor(n[0]) : r.withMutations(function(a) {
+    for (var s = e ? function(f, c) {
+      pa(
+        a,
+        c,
+        S,
+        function(h) {
+          return h === S ? f : e(h, f, c);
+        }
+      );
+    } : function(f, c) {
+      a.set(c, f);
+    }, u = 0; u < n.length; u++)
+      n[u].forEach(s);
+  });
+}
+var qs = Object.prototype.toString;
+function Ms(r) {
+  if (!r || typeof r != "object" || qs.call(r) !== "[object Object]")
+    return !1;
+  var t = Object.getPrototypeOf(r);
+  if (t === null)
+    return !0;
+  for (var e = t, n = Object.getPrototypeOf(t); n !== null; )
+    e = n, n = Object.getPrototypeOf(e);
+  return e === t;
+}
+function mt(r) {
+  return typeof r == "object" && (ct(r) || Array.isArray(r) || Ms(r));
+}
+function ot(r, t) {
+  t = t || 0;
+  for (var e = Math.max(0, r.length - t), n = new Array(e), i = 0; i < e; i++)
+    n[i] = r[i + t];
+  return n;
+}
+function Mr(r) {
+  if (Array.isArray(r))
+    return ot(r);
+  var t = {};
+  for (var e in r)
+    Ht.call(r, e) && (t[e] = r[e]);
+  return t;
+}
+function Cn(r, t, e) {
+  return $n(r, t, Es(e));
+}
+function $n(r, t, e) {
+  if (!mt(r))
+    throw new TypeError(
+      "Cannot merge into non-data-structure value: " + r
+    );
+  if (ct(r))
+    return typeof e == "function" && r.mergeWith ? r.mergeWith.apply(r, [e].concat(t)) : r.merge ? r.merge.apply(r, t) : r.concat.apply(r, t);
+  for (var n = Array.isArray(r), i = r, o = n ? Mt : Q, a = n ? function(u) {
+    i === r && (i = Mr(i)), i.push(u);
+  } : function(u, f) {
+    var c = Ht.call(i, f), h = c && e ? e(i[f], u, f) : u;
+    (!c || h !== i[f]) && (i === r && (i = Mr(i)), i[f] = h);
+  }, s = 0; s < t.length; s++)
+    o(t[s]).forEach(a);
+  return i;
+}
+function Es(r) {
+  function t(e, n, i) {
+    return mt(e) && mt(n) && Os(e, n) ? $n(e, [n], t) : r ? r(e, n, i) : n;
+  }
+  return t;
+}
+function Os(r, t) {
+  var e = D(r), n = D(t);
+  return Z(e) === Z(n) && T(e) === T(n);
+}
+function va() {
+  for (var r = [], t = arguments.length; t--; ) r[t] = arguments[t];
+  return Cn(this, r);
+}
+function ya(r) {
+  for (var t = [], e = arguments.length - 1; e-- > 0; ) t[e] = arguments[e + 1];
+  return Cn(this, t, r);
+}
+function Bn(r) {
+  for (var t = [], e = arguments.length - 1; e-- > 0; ) t[e] = arguments[e + 1];
+  return Kt(
+    this,
+    r,
+    st(),
+    function(n) {
+      return Cn(n, t);
+    }
+  );
+}
+function kn(r) {
+  for (var t = [], e = arguments.length - 1; e-- > 0; ) t[e] = arguments[e + 1];
+  return Kt(this, r, st(), function(n) {
+    return $n(n, t);
+  });
+}
+function zs(r, t, e) {
+  return Kt(r, t, S, function() {
+    return e;
+  });
+}
+function jn(r, t) {
+  return zs(this, r, t);
+}
+function Ln(r, t, e) {
+  return arguments.length === 1 ? r(this) : pa(this, r, t, e);
+}
+function Pn(r, t, e) {
+  return Kt(this, r, t, e);
+}
+function xn() {
+  return this.__altered;
+}
+function dr(r) {
+  var t = this.asMutable();
+  return r(t), t.wasAltered() ? t.__ensureOwner(this.__ownerID) : this;
+}
+var ga = "@@__IMMUTABLE_MAP__@@";
+function Nn(r) {
+  return !!(r && // @ts-expect-error: maybeMap is typed as `{}`, need to change in 6.0 to `maybeMap && typeof maybeMap === 'object' && IS_MAP_SYMBOL in maybeMap`
+  r[ga]);
+}
+function Zt(r, t) {
+  if (!r)
+    throw new Error(t);
+}
+function H(r) {
+  Zt(r !== 1 / 0, "Cannot perform this action with an infinite size.");
+}
+var U = /* @__PURE__ */ (function(r) {
+  function t(e) {
+    return e == null ? st() : Nn(e) && !ut(e) ? e : st().withMutations(function(n) {
+      var i = r(e);
+      H(i.size), i.forEach(function(o, a) {
+        return n.set(a, o);
+      });
+    });
+  }
+  return r && (t.__proto__ = r), t.prototype = Object.create(r && r.prototype), t.prototype.constructor = t, t.prototype.toString = function() {
+    return this.__toString("Map {", "}");
+  }, t.prototype.get = function(n, i) {
+    return this._root ? this._root.get(0, void 0, n, i) : i;
+  }, t.prototype.set = function(n, i) {
+    return _i(this, n, i);
+  }, t.prototype.remove = function(n) {
+    return _i(this, n, S);
+  }, t.prototype.deleteAll = function(n) {
+    var i = j(n);
+    return i.size === 0 ? this : this.withMutations(function(o) {
+      i.forEach(function(a) {
+        return o.remove(a);
+      });
+    });
+  }, t.prototype.clear = function() {
+    return this.size === 0 ? this : this.__ownerID ? (this.size = 0, this._root = null, this.__hash = void 0, this.__altered = !0, this) : st();
+  }, t.prototype.sort = function(n) {
+    return dt(kt(this, n));
+  }, t.prototype.sortBy = function(n, i) {
+    return dt(kt(this, i, n));
+  }, t.prototype.map = function(n, i) {
+    var o = this;
+    return this.withMutations(function(a) {
+      a.forEach(function(s, u) {
+        a.set(u, n.call(i, s, u, o));
+      });
+    });
+  }, t.prototype.__iterator = function(n, i) {
+    return new Ts(this, n, i);
+  }, t.prototype.__iterate = function(n, i) {
+    var o = this, a = 0;
+    return this._root && this._root.iterate(function(s) {
+      return a++, n(s[1], s[0], o);
+    }, i), a;
+  }, t.prototype.__ensureOwner = function(n) {
+    return n === this.__ownerID ? this : n ? Dn(this.size, this._root, n, this.__hash) : this.size === 0 ? st() : (this.__ownerID = n, this.__altered = !1, this);
+  }, t;
+})(Q);
+U.isMap = Nn;
+var z = U.prototype;
+z[ga] = !0;
+z[cr] = z.remove;
+z.removeAll = z.deleteAll;
+z.setIn = jn;
+z.removeIn = z.deleteIn = Un;
+z.update = Ln;
+z.updateIn = Pn;
+z.merge = z.concat = _a;
+z.mergeWith = da;
+z.mergeDeep = va;
+z.mergeDeepWith = ya;
+z.mergeIn = kn;
+z.mergeDeepIn = Bn;
+z.withMutations = dr;
+z.wasAltered = xn;
+z.asImmutable = pr;
+z["@@transducer/init"] = z.asMutable = _r;
+z["@@transducer/step"] = function(r, t) {
+  return r.set(t[0], t[1]);
+};
+z["@@transducer/result"] = function(r) {
+  return r.asImmutable();
+};
+var rr = function(t, e) {
+  this.ownerID = t, this.entries = e;
+};
+rr.prototype.get = function(t, e, n, i) {
+  for (var o = this.entries, a = 0, s = o.length; a < s; a++)
+    if (G(n, o[a][0]))
+      return o[a][1];
+  return i;
+};
+rr.prototype.update = function(t, e, n, i, o, a, s) {
+  for (var u = o === S, f = this.entries, c = 0, h = f.length; c < h && !G(i, f[c][0]); c++)
+    ;
+  var p = c < h;
+  if (p ? f[c][1] === o : u)
+    return this;
+  if (V(s), (u || !p) && V(a), !(u && f.length === 1)) {
+    if (!p && !u && f.length >= ks)
+      return Rs(t, f, i, o);
+    var _ = t && t === this.ownerID, d = _ ? f : ot(f);
+    return p ? u ? c === h - 1 ? d.pop() : d[c] = d.pop() : d[c] = [i, o] : d.push([i, o]), _ ? (this.entries = d, this) : new rr(t, d);
+  }
+};
+var jt = function(t, e, n) {
+  this.ownerID = t, this.bitmap = e, this.nodes = n;
+};
+jt.prototype.get = function(t, e, n, i) {
+  e === void 0 && (e = F(n));
+  var o = 1 << ((t === 0 ? e : e >>> t) & P), a = this.bitmap;
+  return (a & o) === 0 ? i : this.nodes[ma(a & o - 1)].get(
+    t + M,
+    e,
+    n,
+    i
+  );
+};
+jt.prototype.update = function(t, e, n, i, o, a, s) {
+  n === void 0 && (n = F(i));
+  var u = (e === 0 ? n : n >>> e) & P, f = 1 << u, c = this.bitmap, h = (c & f) !== 0;
+  if (!h && o === S)
+    return this;
+  var p = ma(c & f - 1), _ = this.nodes, d = h ? _[p] : void 0, v = Fn(
+    d,
+    t,
+    e + M,
+    n,
+    i,
+    o,
+    a,
+    s
+  );
+  if (v === d)
+    return this;
+  if (!h && v && _.length >= js)
+    return Cs(t, _, c, u, v);
+  if (h && !v && _.length === 2 && di(_[p ^ 1]))
+    return _[p ^ 1];
+  if (h && v && _.length === 1 && di(v))
+    return v;
+  var I = t && t === this.ownerID, y = h ? v ? c : c ^ f : c | f, m = h ? v ? Sa(_, p, v, I) : Bs(_, p, I) : $s(_, p, v, I);
+  return I ? (this.bitmap = y, this.nodes = m, this) : new jt(t, y, m);
+};
+var er = function(t, e, n) {
+  this.ownerID = t, this.count = e, this.nodes = n;
+};
+er.prototype.get = function(t, e, n, i) {
+  e === void 0 && (e = F(n));
+  var o = (t === 0 ? e : e >>> t) & P, a = this.nodes[o];
+  return a ? a.get(t + M, e, n, i) : i;
+};
+er.prototype.update = function(t, e, n, i, o, a, s) {
+  n === void 0 && (n = F(i));
+  var u = (e === 0 ? n : n >>> e) & P, f = o === S, c = this.nodes, h = c[u];
+  if (f && !h)
+    return this;
+  var p = Fn(
+    h,
+    t,
+    e + M,
+    n,
+    i,
+    o,
+    a,
+    s
+  );
+  if (p === h)
+    return this;
+  var _ = this.count;
+  if (!h)
+    _++;
+  else if (!p && (_--, _ < Ls))
+    return As(t, c, _, u);
+  var d = t && t === this.ownerID, v = Sa(c, u, p, d);
+  return d ? (this.count = _, this.nodes = v, this) : new er(t, _, v);
+};
+var Lt = function(t, e, n) {
+  this.ownerID = t, this.keyHash = e, this.entries = n;
+};
+Lt.prototype.get = function(t, e, n, i) {
+  for (var o = this.entries, a = 0, s = o.length; a < s; a++)
+    if (G(n, o[a][0]))
+      return o[a][1];
+  return i;
+};
+Lt.prototype.update = function(t, e, n, i, o, a, s) {
+  n === void 0 && (n = F(i));
+  var u = o === S;
+  if (n !== this.keyHash)
+    return u ? this : (V(s), V(a), Hn(this, t, e, n, [i, o]));
+  for (var f = this.entries, c = 0, h = f.length; c < h && !G(i, f[c][0]); c++)
+    ;
+  var p = c < h;
+  if (p ? f[c][1] === o : u)
+    return this;
+  if (V(s), (u || !p) && V(a), u && h === 2)
+    return new _t(t, this.keyHash, f[c ^ 1]);
+  var _ = t && t === this.ownerID, d = _ ? f : ot(f);
+  return p ? u ? c === h - 1 ? d.pop() : d[c] = d.pop() : d[c] = [i, o] : d.push([i, o]), _ ? (this.entries = d, this) : new Lt(t, this.keyHash, d);
+};
+var _t = function(t, e, n) {
+  this.ownerID = t, this.keyHash = e, this.entry = n;
+};
+_t.prototype.get = function(t, e, n, i) {
+  return G(n, this.entry[0]) ? this.entry[1] : i;
+};
+_t.prototype.update = function(t, e, n, i, o, a, s) {
+  var u = o === S, f = G(i, this.entry[0]);
+  if (f ? o === this.entry[1] : u)
+    return this;
+  if (V(s), u) {
+    V(a);
+    return;
+  }
+  return f ? t && t === this.ownerID ? (this.entry[1] = o, this) : new _t(t, this.keyHash, [i, o]) : (V(a), Hn(this, t, e, F(i), [i, o]));
+};
+rr.prototype.iterate = Lt.prototype.iterate = function(r, t) {
+  for (var e = this.entries, n = 0, i = e.length - 1; n <= i; n++)
+    if (r(e[t ? i - n : n]) === !1)
+      return !1;
+};
+jt.prototype.iterate = er.prototype.iterate = function(r, t) {
+  for (var e = this.nodes, n = 0, i = e.length - 1; n <= i; n++) {
+    var o = e[t ? i - n : n];
+    if (o && o.iterate(r, t) === !1)
+      return !1;
+  }
+};
+_t.prototype.iterate = function(r, t) {
+  return r(this.entry);
+};
+var Ts = /* @__PURE__ */ (function(r) {
+  function t(e, n, i) {
+    this._type = n, this._reverse = i, this._stack = e._root && hi(e._root);
+  }
+  return r && (t.__proto__ = r), t.prototype = Object.create(r && r.prototype), t.prototype.constructor = t, t.prototype.next = function() {
+    for (var n = this._type, i = this._stack; i; ) {
+      var o = i.node, a = i.index++, s = void 0;
+      if (o.entry) {
+        if (a === 0)
+          return Hr(n, o.entry);
+      } else if (o.entries) {
+        if (s = o.entries.length - 1, a <= s)
+          return Hr(
+            n,
+            o.entries[this._reverse ? s - a : a]
+          );
+      } else if (s = o.nodes.length - 1, a <= s) {
+        var u = o.nodes[this._reverse ? s - a : a];
+        if (u) {
+          if (u.entry)
+            return Hr(n, u.entry);
+          i = this._stack = hi(u, i);
+        }
+        continue;
+      }
+      i = this._stack = this._stack.__prev;
+    }
+    return x();
+  }, t;
+})(w);
+function Hr(r, t) {
+  return R(r, t[0], t[1]);
+}
+function hi(r, t) {
+  return {
+    node: r,
+    index: 0,
+    __prev: t
+  };
+}
+function Dn(r, t, e, n) {
+  var i = Object.create(z);
+  return i.size = r, i._root = t, i.__ownerID = e, i.__hash = n, i.__altered = !1, i;
+}
+var pi;
+function st() {
+  return pi || (pi = Dn(0));
+}
+function _i(r, t, e) {
+  var n, i;
+  if (r._root) {
+    var o = _n(), a = _n();
+    if (n = Fn(
+      r._root,
+      r.__ownerID,
+      0,
+      void 0,
+      t,
+      e,
+      o,
+      a
+    ), !a.value)
+      return r;
+    i = r.size + (o.value ? e === S ? -1 : 1 : 0);
+  } else {
+    if (e === S)
+      return r;
+    i = 1, n = new rr(r.__ownerID, [[t, e]]);
+  }
+  return r.__ownerID ? (r.size = i, r._root = n, r.__hash = void 0, r.__altered = !0, r) : n ? Dn(i, n) : st();
+}
+function Fn(r, t, e, n, i, o, a, s) {
+  return r ? r.update(
+    t,
+    e,
+    n,
+    i,
+    o,
+    a,
+    s
+  ) : o === S ? r : (V(s), V(a), new _t(t, n, [i, o]));
+}
+function di(r) {
+  return r.constructor === _t || r.constructor === Lt;
+}
+function Hn(r, t, e, n, i) {
+  if (r.keyHash === n)
+    return new Lt(t, n, [r.entry, i]);
+  var o = (e === 0 ? r.keyHash : r.keyHash >>> e) & P, a = (e === 0 ? n : n >>> e) & P, s, u = o === a ? [Hn(r, t, e + M, n, i)] : (s = new _t(t, n, i), o < a ? [r, s] : [s, r]);
+  return new jt(t, 1 << o | 1 << a, u);
+}
+function Rs(r, t, e, n) {
+  r || (r = new bn());
+  for (var i = new _t(r, F(e), [e, n]), o = 0; o < t.length; o++) {
+    var a = t[o];
+    i = i.update(r, 0, void 0, a[0], a[1]);
+  }
+  return i;
+}
+function As(r, t, e, n) {
+  for (var i = 0, o = 0, a = new Array(e), s = 0, u = 1, f = t.length; s < f; s++, u <<= 1) {
+    var c = t[s];
+    c !== void 0 && s !== n && (i |= u, a[o++] = c);
+  }
+  return new jt(r, i, a);
+}
+function Cs(r, t, e, n, i) {
+  for (var o = 0, a = new Array(K), s = 0; e !== 0; s++, e >>>= 1)
+    a[s] = e & 1 ? t[o++] : void 0;
+  return a[n] = i, new er(r, o + 1, a);
+}
+function ma(r) {
+  return r -= r >> 1 & 1431655765, r = (r & 858993459) + (r >> 2 & 858993459), r = r + (r >> 4) & 252645135, r += r >> 8, r += r >> 16, r & 127;
+}
+function Sa(r, t, e, n) {
+  var i = n ? r : ot(r);
+  return i[t] = e, i;
+}
+function $s(r, t, e, n) {
+  var i = r.length + 1;
+  if (n && t + 1 === i)
+    return r[t] = e, r;
+  for (var o = new Array(i), a = 0, s = 0; s < i; s++)
+    s === t ? (o[s] = e, a = -1) : o[s] = r[s + a];
+  return o;
+}
+function Bs(r, t, e) {
+  var n = r.length - 1;
+  if (e && t === n)
+    return r.pop(), r;
+  for (var i = new Array(n), o = 0, a = 0; a < n; a++)
+    a === t && (o = 1), i[a] = r[a + o];
+  return i;
+}
+var ks = K / 4, js = K / 2, Ls = K / 4;
+function wa(r) {
+  if (ta(r) && typeof r != "string")
+    return r;
+  if (ut(r))
+    return r.toArray();
+  throw new TypeError("Invalid keyPath: expected Ordered Collection or Array: " + r);
+}
+function nr(r) {
+  try {
+    return typeof r == "string" ? JSON.stringify(r) : String(r);
+  } catch {
+    return JSON.stringify(r);
+  }
+}
+function Ps(r, t) {
+  return ct(r) ? (
+    // @ts-expect-error key might be a number or symbol, which is not handled be Record key type
+    r.has(t)
+  ) : (
+    // @ts-expect-error key might be anything else than PropertyKey, and will return false in that case but runtime is OK
+    mt(r) && Ht.call(r, t)
+  );
+}
+function ba(r, t, e) {
+  return ct(r) ? r.get(t, e) : Ps(r, t) ? (
+    // @ts-expect-error weird "get" here,
+    typeof r.get == "function" ? (
+      // @ts-expect-error weird "get" here,
+      r.get(t)
+    ) : (
+      // @ts-expect-error key is unknown here,
+      r[t]
+    )
+  ) : e;
+}
+function xs(r, t) {
+  if (!mt(r))
+    throw new TypeError("Cannot update non-data-structure value: " + r);
+  if (ct(r)) {
+    if (!r.remove)
+      throw new TypeError("Cannot update immutable value without .remove() method: " + r);
+    return r.remove(t);
+  }
+  if (!Ht.call(r, t))
+    return r;
+  var e = Mr(r);
+  return Array.isArray(e) ? e.splice(t, 1) : delete e[t], e;
+}
+function Ns(r, t, e) {
+  if (!mt(r))
+    throw new TypeError("Cannot update non-data-structure value: " + r);
+  if (ct(r)) {
+    if (!r.set)
+      throw new TypeError("Cannot update immutable value without .set() method: " + r);
+    return r.set(t, e);
+  }
+  if (Ht.call(r, t) && e === r[t])
+    return r;
+  var n = Mr(r);
+  return n[t] = e, n;
+}
+function Kt(r, t, e, n) {
+  n || (n = e, e = void 0);
+  var i = Ia(
+    ct(r),
+    // @ts-expect-error type issues with Record and mixed types
+    r,
+    wa(t),
+    0,
+    e,
+    n
+  );
+  return i === S ? e : i;
+}
+function Ia(r, t, e, n, i, o) {
+  var a = t === S;
+  if (n === e.length) {
+    var s = a ? i : t, u = o(s);
+    return u === s ? t : u;
+  }
+  if (!a && !mt(t))
+    throw new TypeError("Cannot update within non-data-structure value in path [" + Array.from(e).slice(0, n).map(nr) + "]: " + t);
+  var f = e[n], c = a ? S : ba(t, f, S), h = Ia(
+    c === S ? r : ct(c),
+    // @ts-expect-error mixed type
+    c,
+    e,
+    n + 1,
+    i,
+    o
+  );
+  return h === c ? t : h === S ? xs(t, f) : Ns(a ? r ? st() : {} : t, f, h);
+}
+function Ds(r, t) {
+  return Kt(r, t, function() {
+    return S;
+  });
+}
+function Un(r) {
+  return Ds(this, r);
+}
+var qa = "@@__IMMUTABLE_LIST__@@";
+function Ma(r) {
+  return !!(r && // @ts-expect-error: maybeList is typed as `{}`, need to change in 6.0 to `maybeList && typeof maybeList === 'object' && IS_LIST_SYMBOL in maybeList`
+  r[qa]);
+}
+var $r = /* @__PURE__ */ (function(r) {
+  function t(e) {
+    var n = br();
+    if (e == null)
+      return n;
+    if (Ma(e))
+      return e;
+    var i = r(e), o = i.size;
+    return o === 0 ? n : (H(o), o > 0 && o < K ? ir(0, o, M, null, new vt(i.toArray())) : n.withMutations(function(a) {
+      a.setSize(o), i.forEach(function(s, u) {
+        return a.set(u, s);
+      });
+    }));
+  }
+  return r && (t.__proto__ = r), t.prototype = Object.create(r && r.prototype), t.prototype.constructor = t, t.of = function() {
+    return this(arguments);
+  }, t.prototype.toString = function() {
+    return this.__toString("List [", "]");
+  }, t.prototype.get = function(n, i) {
+    if (n = yt(this, n), n >= 0 && n < this.size) {
+      n += this._origin;
+      var o = Ea(this, n);
+      return o && o.array[n & P];
+    }
+    return i;
+  }, t.prototype.set = function(n, i) {
+    return Fs(this, n, i);
+  }, t.prototype.remove = function(n) {
+    return this.has(n) ? n === 0 ? this.shift() : n === this.size - 1 ? this.pop() : this.splice(n, 1) : this;
+  }, t.prototype.insert = function(n, i) {
+    return this.splice(n, 0, i);
+  }, t.prototype.clear = function() {
+    return this.size === 0 ? this : this.__ownerID ? (this.size = this._origin = this._capacity = 0, this._level = M, this._root = this._tail = this.__hash = void 0, this.__altered = !0, this) : br();
+  }, t.prototype.push = function() {
+    var n = arguments, i = this.size;
+    return this.withMutations(function(o) {
+      lt(o, 0, i + n.length);
+      for (var a = 0; a < n.length; a++)
+        o.set(i + a, n[a]);
+    });
+  }, t.prototype.pop = function() {
+    return lt(this, 0, -1);
+  }, t.prototype.unshift = function() {
+    var n = arguments;
+    return this.withMutations(function(i) {
+      lt(i, -n.length);
+      for (var o = 0; o < n.length; o++)
+        i.set(o, n[o]);
+    });
+  }, t.prototype.shift = function() {
+    return lt(this, 1);
+  }, t.prototype.shuffle = function(n) {
+    return n === void 0 && (n = Math.random), this.withMutations(function(i) {
+      for (var o = i.size, a, s; o; )
+        a = Math.floor(n() * o--), s = i.get(a), i.set(a, i.get(o)), i.set(o, s);
+    });
+  }, t.prototype.concat = function() {
+    for (var n = arguments, i = [], o = 0; o < arguments.length; o++) {
+      var a = n[o], s = r(
+        typeof a != "string" && Yo(a) ? a : [a]
+      );
+      s.size !== 0 && i.push(s);
+    }
+    return i.length === 0 ? this : this.size === 0 && !this.__ownerID && i.length === 1 ? this.constructor(i[0]) : this.withMutations(function(u) {
+      i.forEach(function(f) {
+        return f.forEach(function(c) {
+          return u.push(c);
+        });
+      });
+    });
+  }, t.prototype.setSize = function(n) {
+    return lt(this, 0, n);
+  }, t.prototype.map = function(n, i) {
+    var o = this;
+    return this.withMutations(function(a) {
+      for (var s = 0; s < o.size; s++)
+        a.set(s, n.call(i, a.get(s), s, o));
+    });
+  }, t.prototype.slice = function(n, i) {
+    var o = this.size;
+    return Tr(n, i, o) ? this : lt(
+      this,
+      hr(n, o),
+      Rr(i, o)
+    );
+  }, t.prototype.__iterator = function(n, i) {
+    var o = i ? this.size : 0, a = li(this, i);
+    return new w(function() {
+      var s = a();
+      return s === Qt ? x() : R(n, i ? --o : o++, s);
+    });
+  }, t.prototype.__iterate = function(n, i) {
+    for (var o = i ? this.size : 0, a = li(this, i), s; (s = a()) !== Qt && n(s, i ? --o : o++, this) !== !1; )
+      ;
+    return o;
+  }, t.prototype.__ensureOwner = function(n) {
+    return n === this.__ownerID ? this : n ? ir(
+      this._origin,
+      this._capacity,
+      this._level,
+      this._root,
+      this._tail,
+      n,
+      this.__hash
+    ) : this.size === 0 ? br() : (this.__ownerID = n, this.__altered = !1, this);
+  }, t;
+})(Mt);
+$r.isList = Ma;
+var $ = $r.prototype;
+$[qa] = !0;
+$[cr] = $.remove;
+$.merge = $.concat;
+$.setIn = jn;
+$.deleteIn = $.removeIn = Un;
+$.update = Ln;
+$.updateIn = Pn;
+$.mergeIn = kn;
+$.mergeDeepIn = Bn;
+$.withMutations = dr;
+$.wasAltered = xn;
+$.asImmutable = pr;
+$["@@transducer/init"] = $.asMutable = _r;
+$["@@transducer/step"] = function(r, t) {
+  return r.push(t);
+};
+$["@@transducer/result"] = function(r) {
+  return r.asImmutable();
+};
+var vt = function(t, e) {
+  this.array = t, this.ownerID = e;
+};
+vt.prototype.removeBefore = function(t, e, n) {
+  if ((n & (1 << e + M) - 1) === 0 || this.array.length === 0)
+    return this;
+  var i = n >>> e & P;
+  if (i >= this.array.length)
+    return new vt([], t);
+  var o = i === 0, a;
+  if (e > 0) {
+    var s = this.array[i];
+    if (a = s && s.removeBefore(t, e - M, n), a === s && o)
+      return this;
+  }
+  if (o && !a)
+    return this;
+  var u = Pt(this, t);
+  if (!o)
+    for (var f = 0; f < i; f++)
+      u.array[f] = void 0;
+  return a && (u.array[i] = a), u;
+};
+vt.prototype.removeAfter = function(t, e, n) {
+  if (n === (e ? 1 << e + M : K) || this.array.length === 0)
+    return this;
+  var i = n - 1 >>> e & P;
+  if (i >= this.array.length)
+    return this;
+  var o;
+  if (e > 0) {
+    var a = this.array[i];
+    if (o = a && a.removeAfter(t, e - M, n), o === a && i === this.array.length - 1)
+      return this;
+  }
+  var s = Pt(this, t);
+  return s.array.splice(i + 1), o && (s.array[i] = o), s;
+};
+var Qt = {};
+function li(r, t) {
+  var e = r._origin, n = r._capacity, i = or(n), o = r._tail;
+  return a(r._root, r._level, 0);
+  function a(f, c, h) {
+    return c === 0 ? s(f, h) : u(f, c, h);
+  }
+  function s(f, c) {
+    var h = c === i ? o && o.array : f && f.array, p = c > e ? 0 : e - c, _ = n - c;
+    return _ > K && (_ = K), function() {
+      if (p === _)
+        return Qt;
+      var d = t ? --_ : p++;
+      return h && h[d];
+    };
+  }
+  function u(f, c, h) {
+    var p, _ = f && f.array, d = h > e ? 0 : e - h >> c, v = (n - h >> c) + 1;
+    return v > K && (v = K), function() {
+      for (; ; ) {
+        if (p) {
+          var I = p();
+          if (I !== Qt)
+            return I;
+          p = null;
+        }
+        if (d === v)
+          return Qt;
+        var y = t ? --v : d++;
+        p = a(
+          _ && _[y],
+          c - M,
+          h + (y << c)
+        );
+      }
+    };
+  }
+}
+function ir(r, t, e, n, i, o, a) {
+  var s = Object.create($);
+  return s.size = t - r, s._origin = r, s._capacity = t, s._level = e, s._root = n, s._tail = i, s.__ownerID = o, s.__hash = a, s.__altered = !1, s;
+}
+function br() {
+  return ir(0, 0, M);
+}
+function Fs(r, t, e) {
+  if (t = yt(r, t), t !== t)
+    return r;
+  if (t >= r.size || t < 0)
+    return r.withMutations(function(a) {
+      t < 0 ? lt(a, t).set(0, e) : lt(a, 0, t + 1).set(t, e);
+    });
+  t += r._origin;
+  var n = r._tail, i = r._root, o = _n();
+  return t >= or(r._capacity) ? n = yn(n, r.__ownerID, 0, t, e, o) : i = yn(
+    i,
+    r.__ownerID,
+    r._level,
+    t,
+    e,
+    o
+  ), o.value ? r.__ownerID ? (r._root = i, r._tail = n, r.__hash = void 0, r.__altered = !0, r) : ir(r._origin, r._capacity, r._level, i, n) : r;
+}
+function yn(r, t, e, n, i, o) {
+  var a = n >>> e & P, s = r && a < r.array.length;
+  if (!s && i === void 0)
+    return r;
+  var u;
+  if (e > 0) {
+    var f = r && r.array[a], c = yn(
+      f,
+      t,
+      e - M,
+      n,
+      i,
+      o
+    );
+    return c === f ? r : (u = Pt(r, t), u.array[a] = c, u);
+  }
+  return s && r.array[a] === i ? r : (o && V(o), u = Pt(r, t), i === void 0 && a === u.array.length - 1 ? u.array.pop() : u.array[a] = i, u);
+}
+function Pt(r, t) {
+  return t && r && t === r.ownerID ? r : new vt(r ? r.array.slice() : [], t);
+}
+function Ea(r, t) {
+  if (t >= or(r._capacity))
+    return r._tail;
+  if (t < 1 << r._level + M) {
+    for (var e = r._root, n = r._level; e && n > 0; )
+      e = e.array[t >>> n & P], n -= M;
+    return e;
+  }
+}
+function lt(r, t, e) {
+  t !== void 0 && (t |= 0), e !== void 0 && (e |= 0);
+  var n = r.__ownerID || new bn(), i = r._origin, o = r._capacity, a = i + t, s = e === void 0 ? o : e < 0 ? o + e : i + e;
+  if (a === i && s === o)
+    return r;
+  if (a >= s)
+    return r.clear();
+  for (var u = r._level, f = r._root, c = 0; a + c < 0; )
+    f = new vt(
+      f && f.array.length ? [void 0, f] : [],
+      n
+    ), u += M, c += 1 << u;
+  c && (a += c, i += c, s += c, o += c);
+  for (var h = or(o), p = or(s); p >= 1 << u + M; )
+    f = new vt(
+      f && f.array.length ? [f] : [],
+      n
+    ), u += M;
+  var _ = r._tail, d = p < h ? Ea(r, s - 1) : p > h ? new vt([], n) : _;
+  if (_ && p > h && a < o && _.array.length) {
+    f = Pt(f, n);
+    for (var v = f, I = u; I > M; I -= M) {
+      var y = h >>> I & P;
+      v = v.array[y] = Pt(v.array[y], n);
+    }
+    v.array[h >>> M & P] = _;
+  }
+  if (s < o && (d = d && d.removeAfter(n, 0, s)), a >= p)
+    a -= p, s -= p, u = M, f = null, d = d && d.removeBefore(n, 0, a);
+  else if (a > i || p < h) {
+    for (c = 0; f; ) {
+      var m = a >>> u & P;
+      if (m !== p >>> u & P)
+        break;
+      m && (c += (1 << u) * m), u -= M, f = f.array[m];
+    }
+    f && a > i && (f = f.removeBefore(n, u, a - c)), f && p < h && (f = f.removeAfter(
+      n,
+      u,
+      p - c
+    )), c && (a -= c, s -= c);
+  }
+  return r.__ownerID ? (r.size = s - a, r._origin = a, r._capacity = s, r._level = u, r._root = f, r._tail = d, r.__hash = void 0, r.__altered = !0, r) : ir(a, s, u, f, d);
+}
+function or(r) {
+  return r < K ? 0 : r - 1 >>> M << M;
+}
+function Oa(r) {
+  return Nn(r) && ut(r);
+}
+var dt = /* @__PURE__ */ (function(r) {
+  function t(e) {
+    return e == null ? Xt() : Oa(e) ? e : Xt().withMutations(function(n) {
+      var i = Q(e);
+      H(i.size), i.forEach(function(o, a) {
+        return n.set(a, o);
+      });
+    });
+  }
+  return r && (t.__proto__ = r), t.prototype = Object.create(r && r.prototype), t.prototype.constructor = t, t.of = function() {
+    return this(arguments);
+  }, t.prototype.toString = function() {
+    return this.__toString("OrderedMap {", "}");
+  }, t.prototype.get = function(n, i) {
+    var o = this._map.get(n);
+    return o !== void 0 ? this._list.get(o)[1] : i;
+  }, t.prototype.clear = function() {
+    return this.size === 0 ? this : this.__ownerID ? (this.size = 0, this._map.clear(), this._list.clear(), this.__altered = !0, this) : Xt();
+  }, t.prototype.set = function(n, i) {
+    return yi(this, n, i);
+  }, t.prototype.remove = function(n) {
+    return yi(this, n, S);
+  }, t.prototype.__iterate = function(n, i) {
+    var o = this;
+    return this._list.__iterate(
+      function(a) {
+        return a && n(a[1], a[0], o);
+      },
+      i
+    );
+  }, t.prototype.__iterator = function(n, i) {
+    return this._list.fromEntrySeq().__iterator(n, i);
+  }, t.prototype.__ensureOwner = function(n) {
+    if (n === this.__ownerID)
+      return this;
+    var i = this._map.__ensureOwner(n), o = this._list.__ensureOwner(n);
+    return n ? Kn(i, o, n, this.__hash) : this.size === 0 ? Xt() : (this.__ownerID = n, this.__altered = !1, this._map = i, this._list = o, this);
+  }, t;
+})(U);
+dt.isOrderedMap = Oa;
+dt.prototype[gt] = !0;
+dt.prototype[cr] = dt.prototype.remove;
+function Kn(r, t, e, n) {
+  var i = Object.create(dt.prototype);
+  return i.size = r ? r.size : 0, i._map = r, i._list = t, i.__ownerID = e, i.__hash = n, i.__altered = !1, i;
+}
+var vi;
+function Xt() {
+  return vi || (vi = Kn(st(), br()));
+}
+function yi(r, t, e) {
+  var n = r._map, i = r._list, o = n.get(t), a = o !== void 0, s, u;
+  if (e === S) {
+    if (!a)
+      return r;
+    i.size >= K && i.size >= n.size * 2 ? (u = i.filter(function(f, c) {
+      return f !== void 0 && o !== c;
+    }), s = u.toKeyedSeq().map(function(f) {
+      return f[0];
+    }).flip().toMap(), r.__ownerID && (s.__ownerID = u.__ownerID = r.__ownerID)) : (s = n.remove(t), u = o === i.size - 1 ? i.pop() : i.set(o, void 0));
+  } else if (a) {
+    if (e === i.get(o)[1])
+      return r;
+    s = n, u = i.set(o, [t, e]);
+  } else
+    s = n.set(t, i.size), u = i.set(i.size, [t, e]);
+  return r.__ownerID ? (r.size = s.size, r._map = s, r._list = u, r.__hash = void 0, r.__altered = !0, r) : Kn(s, u);
+}
+var za = "@@__IMMUTABLE_STACK__@@";
+function gn(r) {
+  return !!(r && // @ts-expect-error: maybeStack is typed as `{}`, need to change in 6.0 to `maybeStack && typeof maybeStack === 'object' && MAYBE_STACK_SYMBOL in maybeStack`
+  r[za]);
+}
+var Gn = /* @__PURE__ */ (function(r) {
+  function t(e) {
+    return e == null ? gr() : gn(e) ? e : gr().pushAll(e);
+  }
+  return r && (t.__proto__ = r), t.prototype = Object.create(r && r.prototype), t.prototype.constructor = t, t.of = function() {
+    return this(arguments);
+  }, t.prototype.toString = function() {
+    return this.__toString("Stack [", "]");
+  }, t.prototype.get = function(n, i) {
+    var o = this._head;
+    for (n = yt(this, n); o && n--; )
+      o = o.next;
+    return o ? o.value : i;
+  }, t.prototype.peek = function() {
+    return this._head && this._head.value;
+  }, t.prototype.push = function() {
+    var n = arguments;
+    if (arguments.length === 0)
+      return this;
+    for (var i = this.size + arguments.length, o = this._head, a = arguments.length - 1; a >= 0; a--)
+      o = {
+        value: n[a],
+        next: o
+      };
+    return this.__ownerID ? (this.size = i, this._head = o, this.__hash = void 0, this.__altered = !0, this) : Jt(i, o);
+  }, t.prototype.pushAll = function(n) {
+    if (n = r(n), n.size === 0)
+      return this;
+    if (this.size === 0 && gn(n))
+      return n;
+    H(n.size);
+    var i = this.size, o = this._head;
+    return n.__iterate(
+      function(a) {
+        i++, o = {
+          value: a,
+          next: o
+        };
+      },
+      /* reverse */
+      !0
+    ), this.__ownerID ? (this.size = i, this._head = o, this.__hash = void 0, this.__altered = !0, this) : Jt(i, o);
+  }, t.prototype.pop = function() {
+    return this.slice(1);
+  }, t.prototype.clear = function() {
+    return this.size === 0 ? this : this.__ownerID ? (this.size = 0, this._head = void 0, this.__hash = void 0, this.__altered = !0, this) : gr();
+  }, t.prototype.slice = function(n, i) {
+    if (Tr(n, i, this.size))
+      return this;
+    var o = hr(n, this.size), a = Rr(i, this.size);
+    if (a !== this.size)
+      return r.prototype.slice.call(this, n, i);
+    for (var s = this.size - o, u = this._head; o--; )
+      u = u.next;
+    return this.__ownerID ? (this.size = s, this._head = u, this.__hash = void 0, this.__altered = !0, this) : Jt(s, u);
+  }, t.prototype.__ensureOwner = function(n) {
+    return n === this.__ownerID ? this : n ? Jt(this.size, this._head, n, this.__hash) : this.size === 0 ? gr() : (this.__ownerID = n, this.__altered = !1, this);
+  }, t.prototype.__iterate = function(n, i) {
+    var o = this;
+    if (i)
+      return new Bt(this.toArray()).__iterate(
+        function(u, f) {
+          return n(u, f, o);
+        },
+        i
+      );
+    for (var a = 0, s = this._head; s && n(s.value, a++, this) !== !1; )
+      s = s.next;
+    return a;
+  }, t.prototype.__iterator = function(n, i) {
+    if (i)
+      return new Bt(this.toArray()).__iterator(n, i);
+    var o = 0, a = this._head;
+    return new w(function() {
+      if (a) {
+        var s = a.value;
+        return a = a.next, R(n, o++, s);
+      }
+      return x();
+    });
+  }, t;
+})(Mt);
+Gn.isStack = gn;
+var N = Gn.prototype;
+N[za] = !0;
+N.shift = N.pop;
+N.unshift = N.push;
+N.unshiftAll = N.pushAll;
+N.withMutations = dr;
+N.wasAltered = xn;
+N.asImmutable = pr;
+N["@@transducer/init"] = N.asMutable = _r;
+N["@@transducer/step"] = function(r, t) {
+  return r.unshift(t);
+};
+N["@@transducer/result"] = function(r) {
+  return r.asImmutable();
+};
+function Jt(r, t, e, n) {
+  var i = Object.create(N);
+  return i.size = r, i._head = t, i.__ownerID = e, i.__hash = n, i.__altered = !1, i;
+}
+var gi;
+function gr() {
+  return gi || (gi = Jt(0));
+}
+function mi(r, t, e, n, i, o) {
+  return H(r.size), r.__iterate(function(a, s, u) {
+    i ? (i = !1, e = a) : e = t.call(n, e, a, s, u);
+  }, o), e;
+}
+function Hs(r, t) {
+  return t;
+}
+function Us(r, t) {
+  return [t, r];
+}
+function Ur(r) {
+  return function() {
+    for (var t = [], e = arguments.length; e--; ) t[e] = arguments[e];
+    return !r.apply(this, t);
+  };
+}
+function Si(r) {
+  return function() {
+    for (var t = [], e = arguments.length; e--; ) t[e] = arguments[e];
+    return -r.apply(this, t);
+  };
+}
+function wi(r, t) {
+  return r < t ? 1 : r > t ? -1 : 0;
+}
+function Ta(r, t) {
+  if (r === t)
+    return !0;
+  if (!W(t) || // @ts-expect-error size should exists on Collection
+  r.size !== void 0 && t.size !== void 0 && r.size !== t.size || // @ts-expect-error __hash exists on Collection
+  r.__hash !== void 0 && // @ts-expect-error __hash exists on Collection
+  t.__hash !== void 0 && // @ts-expect-error __hash exists on Collection
+  r.__hash !== t.__hash || T(r) !== T(t) || Z(r) !== Z(t) || // @ts-expect-error Range extends Collection, which implements [Symbol.iterator], so it is valid
+  ut(r) !== ut(t))
+    return !1;
+  if (r.size === 0 && t.size === 0)
+    return !0;
+  var e = !wn(r);
+  if (ut(r)) {
+    var n = r.entries();
+    return t.every(function(u, f) {
+      var c = n.next().value;
+      return c && G(c[1], u) && (e || G(c[0], f));
+    }) && n.next().done;
+  }
+  var i = !1;
+  if (r.size === void 0)
+    if (t.size === void 0)
+      typeof r.cacheResult == "function" && r.cacheResult();
+    else {
+      i = !0;
+      var o = r;
+      r = t, t = o;
+    }
+  var a = !0, s = (
+    // @ts-expect-error b is Range | Repeat | Collection<unknown, unknown> as it may have been flipped, and __iterate is valid
+    t.__iterate(function(u, f) {
+      if (e ? (
+        // @ts-expect-error has exists on Collection
+        !r.has(u)
+      ) : i ? (
+        // @ts-expect-error type of `get` does not "catch" the version with `notSetValue`
+        !G(u, r.get(f, S))
+      ) : (
+        // @ts-expect-error type of `get` does not "catch" the version with `notSetValue`
+        !G(r.get(f, S), u)
+      ))
+        return a = !1, !1;
+    })
+  );
+  return a && // @ts-expect-error size should exists on Collection
+  r.size === s;
+}
+var Ks = /* @__PURE__ */ (function(r) {
+  function t(e, n, i) {
+    if (i === void 0 && (i = 1), !(this instanceof t))
+      return new t(e, n, i);
+    if (Zt(i !== 0, "Cannot step a Range by 0"), Zt(
+      e !== void 0,
+      "You must define a start value when using Range"
+    ), Zt(
+      n !== void 0,
+      "You must define an end value when using Range"
+    ), i = Math.abs(i), n < e && (i = -i), this._start = e, this._end = n, this._step = i, this.size = Math.max(0, Math.ceil((n - e) / i - 1) + 1), this.size === 0) {
+      if (Kr)
+        return Kr;
+      Kr = this;
+    }
+  }
+  return r && (t.__proto__ = r), t.prototype = Object.create(r && r.prototype), t.prototype.constructor = t, t.prototype.toString = function() {
+    return this.size === 0 ? "Range []" : "Range [ " + this._start + "..." + this._end + (this._step !== 1 ? " by " + this._step : "") + " ]";
+  }, t.prototype.get = function(n, i) {
+    return this.has(n) ? this._start + yt(this, n) * this._step : i;
+  }, t.prototype.includes = function(n) {
+    var i = (n - this._start) / this._step;
+    return i >= 0 && i < this.size && i === Math.floor(i);
+  }, t.prototype.slice = function(n, i) {
+    return Tr(n, i, this.size) ? this : (n = hr(n, this.size), i = Rr(i, this.size), i <= n ? new t(0, 0) : new t(
+      this.get(n, this._end),
+      this.get(i, this._end),
+      this._step
+    ));
+  }, t.prototype.indexOf = function(n) {
+    var i = n - this._start;
+    if (i % this._step === 0) {
+      var o = i / this._step;
+      if (o >= 0 && o < this.size)
+        return o;
+    }
+    return -1;
+  }, t.prototype.lastIndexOf = function(n) {
+    return this.indexOf(n);
+  }, t.prototype.__iterate = function(n, i) {
+    for (var o = this.size, a = this._step, s = i ? this._start + (o - 1) * a : this._start, u = 0; u !== o && n(s, i ? o - ++u : u++, this) !== !1; )
+      s += i ? -a : a;
+    return u;
+  }, t.prototype.__iterator = function(n, i) {
+    var o = this.size, a = this._step, s = i ? this._start + (o - 1) * a : this._start, u = 0;
+    return new w(function() {
+      if (u === o)
+        return x();
+      var f = s;
+      return s += i ? -a : a, R(n, i ? o - ++u : u++, f);
+    });
+  }, t.prototype.equals = function(n) {
+    return n instanceof t ? this._start === n._start && this._end === n._end && this._step === n._step : Ta(this, n);
+  }, t;
+})(et), Kr, Ra = "@@__IMMUTABLE_SET__@@";
+function Wn(r) {
+  return !!(r && // @ts-expect-error: maybeSet is typed as `{}`,  need to change in 6.0 to `maybeSeq && typeof maybeSet === 'object' && MAYBE_SET_SYMBOL in maybeSet`
+  r[Ra]);
+}
+var ft = /* @__PURE__ */ (function(r) {
+  function t(e) {
+    return e == null ? Vt() : Wn(e) && !ut(e) ? e : Vt().withMutations(function(n) {
+      var i = r(e);
+      H(i.size), i.forEach(function(o) {
+        return n.add(o);
+      });
+    });
+  }
+  return r && (t.__proto__ = r), t.prototype = Object.create(r && r.prototype), t.prototype.constructor = t, t.of = function() {
+    return this(arguments);
+  }, t.fromKeys = function(n) {
+    return this(Q(n).keySeq());
+  }, t.intersect = function(n) {
+    return n = j(n).toArray(), n.length ? k.intersect.apply(t(n.pop()), n) : Vt();
+  }, t.union = function(n) {
+    return n = j(n).toArray(), n.length ? k.union.apply(t(n.pop()), n) : Vt();
+  }, t.prototype.toString = function() {
+    return this.__toString("Set {", "}");
+  }, t.prototype.has = function(n) {
+    return this._map.has(n);
+  }, t.prototype.add = function(n) {
+    return mr(this, this._map.set(n, n));
+  }, t.prototype.remove = function(n) {
+    return mr(this, this._map.remove(n));
+  }, t.prototype.clear = function() {
+    return mr(this, this._map.clear());
+  }, t.prototype.map = function(n, i) {
+    var o = this, a = !1, s = mr(
+      this,
+      this._map.mapEntries(function(u) {
+        var f = u[1], c = n.call(i, f, f, o);
+        return c !== f && (a = !0), [c, c];
+      }, i)
+    );
+    return a ? s : this;
+  }, t.prototype.union = function() {
+    for (var n = [], i = arguments.length; i--; ) n[i] = arguments[i];
+    return n = n.filter(function(o) {
+      return o.size !== 0;
+    }), n.length === 0 ? this : this.size === 0 && !this.__ownerID && n.length === 1 ? this.constructor(n[0]) : this.withMutations(function(o) {
+      for (var a = 0; a < n.length; a++)
+        typeof n[a] == "string" ? o.add(n[a]) : r(n[a]).forEach(function(s) {
+          return o.add(s);
+        });
+    });
+  }, t.prototype.intersect = function() {
+    for (var n = [], i = arguments.length; i--; ) n[i] = arguments[i];
+    if (n.length === 0)
+      return this;
+    n = n.map(function(a) {
+      return r(a);
+    });
+    var o = [];
+    return this.forEach(function(a) {
+      n.every(function(s) {
+        return s.includes(a);
+      }) || o.push(a);
+    }), this.withMutations(function(a) {
+      o.forEach(function(s) {
+        a.remove(s);
+      });
+    });
+  }, t.prototype.subtract = function() {
+    for (var n = [], i = arguments.length; i--; ) n[i] = arguments[i];
+    if (n.length === 0)
+      return this;
+    n = n.map(function(a) {
+      return r(a);
+    });
+    var o = [];
+    return this.forEach(function(a) {
+      n.some(function(s) {
+        return s.includes(a);
+      }) && o.push(a);
+    }), this.withMutations(function(a) {
+      o.forEach(function(s) {
+        a.remove(s);
+      });
+    });
+  }, t.prototype.sort = function(n) {
+    return ar(kt(this, n));
+  }, t.prototype.sortBy = function(n, i) {
+    return ar(kt(this, i, n));
+  }, t.prototype.wasAltered = function() {
+    return this._map.wasAltered();
+  }, t.prototype.__iterate = function(n, i) {
+    var o = this;
+    return this._map.__iterate(function(a) {
+      return n(a, a, o);
+    }, i);
+  }, t.prototype.__iterator = function(n, i) {
+    return this._map.__iterator(n, i);
+  }, t.prototype.__ensureOwner = function(n) {
+    if (n === this.__ownerID)
+      return this;
+    var i = this._map.__ensureOwner(n);
+    return n ? this.__make(i, n) : this.size === 0 ? this.__empty() : (this.__ownerID = n, this._map = i, this);
+  }, t;
+})(Dt);
+ft.isSet = Wn;
+var k = ft.prototype;
+k[Ra] = !0;
+k[cr] = k.remove;
+k.merge = k.concat = k.union;
+k.withMutations = dr;
+k.asImmutable = pr;
+k["@@transducer/init"] = k.asMutable = _r;
+k["@@transducer/step"] = function(r, t) {
+  return r.add(t);
+};
+k["@@transducer/result"] = function(r) {
+  return r.asImmutable();
+};
+k.__empty = Vt;
+k.__make = Aa;
+function mr(r, t) {
+  return r.__ownerID ? (r.size = t.size, r._map = t, r) : t === r._map ? r : t.size === 0 ? r.__empty() : r.__make(t);
+}
+function Aa(r, t) {
+  var e = Object.create(k);
+  return e.size = r ? r.size : 0, e._map = r, e.__ownerID = t, e;
+}
+var bi;
+function Vt() {
+  return bi || (bi = Aa(st()));
+}
+function Ca(r, t, e) {
+  for (var n = wa(t), i = 0; i !== n.length; )
+    if (r = ba(r, n[i++], S), r === S)
+      return e;
+  return r;
+}
+function $a(r, t) {
+  return Ca(this, r, t);
+}
+function Gs(r, t) {
+  return Ca(r, t, S) !== S;
+}
+function Ws(r) {
+  return Gs(this, r);
+}
+function Ba() {
+  H(this.size);
+  var r = {};
+  return this.__iterate(function(t, e) {
+    r[e] = t;
+  }), r;
+}
+function Er(r) {
+  if (!r || typeof r != "object")
+    return r;
+  if (!W(r)) {
+    if (!mt(r))
+      return r;
+    r = D(r);
+  }
+  if (T(r)) {
+    var t = {};
+    return r.__iterate(function(n, i) {
+      t[i] = Er(n);
+    }), t;
+  }
+  var e = [];
+  return r.__iterate(function(n) {
+    e.push(Er(n));
+  }), e;
+}
+function Ys(r) {
+  if (r.size === 1 / 0)
+    return 0;
+  var t = ut(r), e = T(r), n = t ? 1 : 0;
+  return r.__iterate(e ? t ? function(i, o) {
+    n = 31 * n + Ii(F(i), F(o)) | 0;
+  } : function(i, o) {
+    n = n + Ii(F(i), F(o)) | 0;
+  } : t ? function(i) {
+    n = 31 * n + F(i) | 0;
+  } : function(i) {
+    n = n + F(i) | 0;
+  }), Xs(r.size, n);
+}
+function Xs(r, t) {
+  return t = Yt(t, 3432918353), t = Yt(t << 15 | t >>> -15, 461845907), t = Yt(t << 13 | t >>> -13, 5), t = (t + 3864292196 | 0) ^ r, t = Yt(t ^ t >>> 16, 2246822507), t = Yt(t ^ t >>> 13, 3266489909), t = Ar(t ^ t >>> 16), t;
+}
+function Ii(r, t) {
+  return r ^ t + 2654435769 + (r << 6) + (r >> 2) | 0;
+}
+function Ot(r, t) {
+  var e = function(n) {
+    r.prototype[n] = t[n];
+  };
+  return Object.keys(t).forEach(e), Object.getOwnPropertySymbols && Object.getOwnPropertySymbols(t).forEach(e), r;
+}
+j.Iterator = w;
+Ot(j, {
+  // ### Conversion to other types
+  toArray: function() {
+    H(this.size);
+    var t = new Array(this.size || 0), e = T(this), n = 0;
+    return this.__iterate(function(i, o) {
+      t[n++] = e ? [o, i] : i;
+    }), t;
+  },
+  toIndexedSeq: function() {
+    return new na(this);
+  },
+  toJS: function() {
+    return Er(this);
+  },
+  toKeyedSeq: function() {
+    return new Cr(this, !0);
+  },
+  toMap: function() {
+    return U(this.toKeyedSeq());
+  },
+  toObject: Ba,
+  toOrderedMap: function() {
+    return dt(this.toKeyedSeq());
+  },
+  toOrderedSet: function() {
+    return ar(T(this) ? this.valueSeq() : this);
+  },
+  toSet: function() {
+    return ft(T(this) ? this.valueSeq() : this);
+  },
+  toSetSeq: function() {
+    return new ia(this);
+  },
+  toSeq: function() {
+    return Z(this) ? this.toIndexedSeq() : T(this) ? this.toKeyedSeq() : this.toSetSeq();
+  },
+  toStack: function() {
+    return Gn(T(this) ? this.valueSeq() : this);
+  },
+  toList: function() {
+    return $r(T(this) ? this.valueSeq() : this);
+  },
+  // ### Common JavaScript methods and properties
+  toString: function() {
+    return "[Collection]";
+  },
+  __toString: function(t, e) {
+    return this.size === 0 ? t + e : t + " " + this.toSeq().map(this.__toStringMapper).join(", ") + " " + e;
+  },
+  // ### ES6 Collection methods (ES6 Array and Map)
+  concat: function() {
+    for (var t = [], e = arguments.length; e--; ) t[e] = arguments[e];
+    return q(this, ws(this, t));
+  },
+  includes: function(t) {
+    return this.some(function(e) {
+      return G(e, t);
+    });
+  },
+  entries: function() {
+    return this.__iterator(X);
+  },
+  every: function(t, e) {
+    H(this.size);
+    var n = !0;
+    return this.__iterate(function(i, o, a) {
+      if (!t.call(e, i, o, a))
+        return n = !1, !1;
+    }), n;
+  },
+  filter: function(t, e) {
+    return q(this, ua(this, t, e, !0));
+  },
+  partition: function(t, e) {
+    return gs(this, t, e);
+  },
+  find: function(t, e, n) {
+    var i = this.findEntry(t, e);
+    return i ? i[1] : n;
+  },
+  forEach: function(t, e) {
+    return H(this.size), this.__iterate(e ? t.bind(e) : t);
+  },
+  join: function(t) {
+    H(this.size), t = t !== void 0 ? "" + t : ",";
+    var e = "", n = !0;
+    return this.__iterate(function(i) {
+      n ? n = !1 : e += t, e += i != null ? i.toString() : "";
+    }), e;
+  },
+  keys: function() {
+    return this.__iterator(Ft);
+  },
+  map: function(t, e) {
+    return q(this, sa(this, t, e));
+  },
+  reduce: function(t, e, n) {
+    return mi(
+      this,
+      t,
+      e,
+      n,
+      arguments.length < 2,
+      !1
+    );
+  },
+  reduceRight: function(t, e, n) {
+    return mi(
+      this,
+      t,
+      e,
+      n,
+      arguments.length < 2,
+      !0
+    );
+  },
+  reverse: function() {
+    return q(this, zn(this, !0));
+  },
+  slice: function(t, e) {
+    return q(this, Tn(this, t, e, !0));
+  },
+  some: function(t, e) {
+    H(this.size);
+    var n = !1;
+    return this.__iterate(function(i, o, a) {
+      if (t.call(e, i, o, a))
+        return n = !0, !1;
+    }), n;
+  },
+  sort: function(t) {
+    return q(this, kt(this, t));
+  },
+  values: function() {
+    return this.__iterator(Y);
+  },
+  // ### More sequential methods
+  butLast: function() {
+    return this.slice(0, -1);
+  },
+  isEmpty: function() {
+    return this.size !== void 0 ? this.size === 0 : !this.some(function() {
+      return !0;
+    });
+  },
+  count: function(t, e) {
+    return $t(
+      t ? this.toSeq().filter(t, e) : this
+    );
+  },
+  countBy: function(t, e) {
+    return vs(this, t, e);
+  },
+  equals: function(t) {
+    return Ta(this, t);
+  },
+  entrySeq: function() {
+    var t = this;
+    if (t._cache)
+      return new Bt(t._cache);
+    var e = t.toSeq().map(Us).toIndexedSeq();
+    return e.fromEntrySeq = function() {
+      return t.toSeq();
+    }, e;
+  },
+  filterNot: function(t, e) {
+    return this.filter(Ur(t), e);
+  },
+  findEntry: function(t, e, n) {
+    var i = n;
+    return this.__iterate(function(o, a, s) {
+      if (t.call(e, o, a, s))
+        return i = [a, o], !1;
+    }), i;
+  },
+  findKey: function(t, e) {
+    var n = this.findEntry(t, e);
+    return n && n[0];
+  },
+  findLast: function(t, e, n) {
+    return this.toKeyedSeq().reverse().find(t, e, n);
+  },
+  findLastEntry: function(t, e, n) {
+    return this.toKeyedSeq().reverse().findEntry(t, e, n);
+  },
+  findLastKey: function(t, e) {
+    return this.toKeyedSeq().reverse().findKey(t, e);
+  },
+  first: function(t) {
+    return this.find(Xo, null, t);
+  },
+  flatMap: function(t, e) {
+    return q(this, bs(this, t, e));
+  },
+  flatten: function(t) {
+    return q(this, ca(this, t, !0));
+  },
+  fromEntrySeq: function() {
+    return new oa(this);
+  },
+  get: function(t, e) {
+    return this.find(function(n, i) {
+      return G(i, t);
+    }, void 0, e);
+  },
+  getIn: $a,
+  groupBy: function(t, e) {
+    return ys(this, t, e);
+  },
+  has: function(t) {
+    return this.get(t, S) !== S;
+  },
+  hasIn: Ws,
+  isSubset: function(t) {
+    return t = typeof t.includes == "function" ? t : j(t), this.every(function(e) {
+      return t.includes(e);
+    });
+  },
+  isSuperset: function(t) {
+    return t = typeof t.isSubset == "function" ? t : j(t), t.isSubset(this);
+  },
+  keyOf: function(t) {
+    return this.findKey(function(e) {
+      return G(e, t);
+    });
+  },
+  keySeq: function() {
+    return this.toSeq().map(Hs).toIndexedSeq();
+  },
+  last: function(t) {
+    return this.toSeq().reverse().first(t);
+  },
+  lastKeyOf: function(t) {
+    return this.toKeyedSeq().reverse().keyOf(t);
+  },
+  max: function(t) {
+    return vr(this, t);
+  },
+  maxBy: function(t, e) {
+    return vr(this, e, t);
+  },
+  min: function(t) {
+    return vr(
+      this,
+      t ? Si(t) : wi
+    );
+  },
+  minBy: function(t, e) {
+    return vr(
+      this,
+      e ? Si(e) : wi,
+      t
+    );
+  },
+  rest: function() {
+    return this.slice(1);
+  },
+  skip: function(t) {
+    return t === 0 ? this : this.slice(Math.max(0, t));
+  },
+  skipLast: function(t) {
+    return t === 0 ? this : this.slice(0, -Math.max(0, t));
+  },
+  skipWhile: function(t, e) {
+    return q(this, fa(this, t, e, !0));
+  },
+  skipUntil: function(t, e) {
+    return this.skipWhile(Ur(t), e);
+  },
+  sortBy: function(t, e) {
+    return q(this, kt(this, e, t));
+  },
+  take: function(t) {
+    return this.slice(0, Math.max(0, t));
+  },
+  takeLast: function(t) {
+    return this.slice(-Math.max(0, t));
+  },
+  takeWhile: function(t, e) {
+    return q(this, ms(this, t, e));
+  },
+  takeUntil: function(t, e) {
+    return this.takeWhile(Ur(t), e);
+  },
+  update: function(t) {
+    return t(this);
+  },
+  valueSeq: function() {
+    return this.toIndexedSeq();
+  },
+  // ### Hashable Object
+  hashCode: function() {
+    return this.__hash || (this.__hash = Ys(this));
+  }
+  // ### Internal
+  // abstract __iterate(fn, reverse)
+  // abstract __iterator(type, reverse)
+});
+var L = j.prototype;
+L[Go] = !0;
+L[Or] = L.values;
+L.toJSON = L.toArray;
+L.__toStringMapper = nr;
+L.inspect = L.toSource = function() {
+  return this.toString();
+};
+L.chain = L.flatMap;
+L.contains = L.includes;
+Ot(Q, {
+  // ### More sequential methods
+  flip: function() {
+    return q(this, aa(this));
+  },
+  mapEntries: function(t, e) {
+    var n = this, i = 0;
+    return q(
+      this,
+      this.toSeq().map(function(o, a) {
+        return t.call(e, [a, o], i++, n);
+      }).fromEntrySeq()
+    );
+  },
+  mapKeys: function(t, e) {
+    var n = this;
+    return q(
+      this,
+      this.toSeq().flip().map(function(i, o) {
+        return t.call(e, i, o, n);
+      }).flip()
+    );
+  }
+});
+var lr = Q.prototype;
+lr[qr] = !0;
+lr[Or] = L.entries;
+lr.toJSON = Ba;
+lr.__toStringMapper = function(r, t) {
+  return nr(t) + ": " + nr(r);
+};
+Ot(Mt, {
+  // ### Conversion to other types
+  toKeyedSeq: function() {
+    return new Cr(this, !1);
+  },
+  // ### ES6 Collection methods (ES6 Array and Map)
+  filter: function(t, e) {
+    return q(this, ua(this, t, e, !1));
+  },
+  findIndex: function(t, e) {
+    var n = this.findEntry(t, e);
+    return n ? n[0] : -1;
+  },
+  indexOf: function(t) {
+    var e = this.keyOf(t);
+    return e === void 0 ? -1 : e;
+  },
+  lastIndexOf: function(t) {
+    var e = this.lastKeyOf(t);
+    return e === void 0 ? -1 : e;
+  },
+  reverse: function() {
+    return q(this, zn(this, !1));
+  },
+  slice: function(t, e) {
+    return q(this, Tn(this, t, e, !1));
+  },
+  splice: function(t, e) {
+    var n = arguments.length;
+    if (e = Math.max(e || 0, 0), n === 0 || n === 2 && !e)
+      return this;
+    t = hr(t, t < 0 ? this.count() : this.size);
+    var i = this.slice(0, t);
+    return q(
+      this,
+      n === 1 ? i : i.concat(ot(arguments, 2), this.slice(t + e))
+    );
+  },
+  // ### More collection methods
+  findLastIndex: function(t, e) {
+    var n = this.findLastEntry(t, e);
+    return n ? n[0] : -1;
+  },
+  first: function(t) {
+    return this.get(0, t);
+  },
+  flatten: function(t) {
+    return q(this, ca(this, t, !1));
+  },
+  get: function(t, e) {
+    return t = yt(this, t), t < 0 || this.size === 1 / 0 || this.size !== void 0 && t > this.size ? e : this.find(function(n, i) {
+      return i === t;
+    }, void 0, e);
+  },
+  has: function(t) {
+    return t = yt(this, t), t >= 0 && (this.size !== void 0 ? this.size === 1 / 0 || t < this.size : this.indexOf(t) !== -1);
+  },
+  interpose: function(t) {
+    return q(this, Is(this, t));
+  },
+  interleave: function() {
+    var t = [this].concat(ot(arguments)), e = yr(this.toSeq(), et.of, t), n = e.flatten(!0);
+    return e.size && (n.size = e.size * t.length), q(this, n);
+  },
+  keySeq: function() {
+    return Ks(0, this.size);
+  },
+  last: function(t) {
+    return this.get(-1, t);
+  },
+  skipWhile: function(t, e) {
+    return q(this, fa(this, t, e, !1));
+  },
+  zip: function() {
+    var t = [this].concat(ot(arguments));
+    return q(this, yr(this, qi, t));
+  },
+  zipAll: function() {
+    var t = [this].concat(ot(arguments));
+    return q(this, yr(this, qi, t, !0));
+  },
+  zipWith: function(t) {
+    var e = ot(arguments);
+    return e[0] = this, q(this, yr(this, t, e));
+  }
+});
+var Gt = Mt.prototype;
+Gt[Ir] = !0;
+Gt[gt] = !0;
+Ot(Dt, {
+  // ### ES6 Collection methods (ES6 Array and Map)
+  get: function(t, e) {
+    return this.has(t) ? t : e;
+  },
+  includes: function(t) {
+    return this.has(t);
+  },
+  // ### More sequential methods
+  keySeq: function() {
+    return this.valueSeq();
+  }
+});
+var xt = Dt.prototype;
+xt.has = L.includes;
+xt.contains = xt.includes;
+xt.keys = xt.values;
+Ot(St, lr);
+Ot(et, Gt);
+Ot(Ut, xt);
+function qi() {
+  return ot(arguments);
+}
+function ka(r) {
+  return Wn(r) && ut(r);
+}
+var ar = /* @__PURE__ */ (function(r) {
+  function t(e) {
+    return e == null ? mn() : ka(e) ? e : mn().withMutations(function(n) {
+      var i = Dt(e);
+      H(i.size), i.forEach(function(o) {
+        return n.add(o);
+      });
+    });
+  }
+  return r && (t.__proto__ = r), t.prototype = Object.create(r && r.prototype), t.prototype.constructor = t, t.of = function() {
+    return this(arguments);
+  }, t.fromKeys = function(n) {
+    return this(Q(n).keySeq());
+  }, t.prototype.toString = function() {
+    return this.__toString("OrderedSet {", "}");
+  }, t;
+})(ft);
+ar.isOrderedSet = ka;
+var zt = ar.prototype;
+zt[gt] = !0;
+zt.zip = Gt.zip;
+zt.zipWith = Gt.zipWith;
+zt.zipAll = Gt.zipAll;
+zt.__empty = mn;
+zt.__make = ja;
+function ja(r, t) {
+  var e = Object.create(zt);
+  return e.size = r ? r.size : 0, e._map = r, e.__ownerID = t, e;
+}
+var Mi;
+function mn() {
+  return Mi || (Mi = ja(Xt()));
+}
+function Js(r) {
+  if (Et(r))
+    throw new Error(
+      "Can not call `Record` with an immutable Record as default values. Use a plain javascript object instead."
+    );
+  if (ct(r))
+    throw new Error(
+      "Can not call `Record` with an immutable Collection as default values. Use a plain javascript object instead."
+    );
+  if (r === null || typeof r != "object")
+    throw new Error(
+      "Can not call `Record` with a non-object as default values. Use a plain javascript object instead."
+    );
+}
+var A = function(t, e) {
+  var n;
+  Js(t);
+  var i = function(s) {
+    var u = this;
+    if (s instanceof i)
+      return s;
+    if (!(this instanceof i))
+      return new i(s);
+    if (!n) {
+      n = !0;
+      var f = Object.keys(t), c = o._indices = {};
+      o._name = e, o._keys = f, o._defaultValues = t;
+      for (var h = 0; h < f.length; h++) {
+        var p = f[h];
+        c[p] = h, o[p] ? typeof console == "object" && console.warn && console.warn(
+          "Cannot define " + Xn(this) + ' with property "' + p + '" since that property name is part of the Record API.'
+        ) : Vs(o, p);
+      }
+    }
+    return this.__ownerID = void 0, this._values = $r().withMutations(function(_) {
+      _.setSize(u._keys.length), Q(s).forEach(function(d, v) {
+        _.set(u._indices[v], d === u._defaultValues[v] ? void 0 : d);
+      });
+    }), this;
+  }, o = i.prototype = Object.create(O);
+  return o.constructor = i, e && (i.displayName = e), i;
+};
+A.prototype.toString = function() {
+  for (var t = Xn(this) + " { ", e = this._keys, n, i = 0, o = e.length; i !== o; i++)
+    n = e[i], t += (i ? ", " : "") + n + ": " + nr(this.get(n));
+  return t + " }";
+};
+A.prototype.equals = function(t) {
+  return this === t || Et(t) && Nt(this).equals(Nt(t));
+};
+A.prototype.hashCode = function() {
+  return Nt(this).hashCode();
+};
+A.prototype.has = function(t) {
+  return this._indices.hasOwnProperty(t);
+};
+A.prototype.get = function(t, e) {
+  if (!this.has(t))
+    return e;
+  var n = this._indices[t], i = this._values.get(n);
+  return i === void 0 ? this._defaultValues[t] : i;
+};
+A.prototype.set = function(t, e) {
+  if (this.has(t)) {
+    var n = this._values.set(
+      this._indices[t],
+      e === this._defaultValues[t] ? void 0 : e
+    );
+    if (n !== this._values && !this.__ownerID)
+      return Yn(this, n);
+  }
+  return this;
+};
+A.prototype.remove = function(t) {
+  return this.set(t);
+};
+A.prototype.clear = function() {
+  var t = this._values.clear().setSize(this._keys.length);
+  return this.__ownerID ? this : Yn(this, t);
+};
+A.prototype.wasAltered = function() {
+  return this._values.wasAltered();
+};
+A.prototype.toSeq = function() {
+  return Nt(this);
+};
+A.prototype.toJS = function() {
+  return Er(this);
+};
+A.prototype.entries = function() {
+  return this.__iterator(X);
+};
+A.prototype.__iterator = function(t, e) {
+  return Nt(this).__iterator(t, e);
+};
+A.prototype.__iterate = function(t, e) {
+  return Nt(this).__iterate(t, e);
+};
+A.prototype.__ensureOwner = function(t) {
+  if (t === this.__ownerID)
+    return this;
+  var e = this._values.__ensureOwner(t);
+  return t ? Yn(this, e, t) : (this.__ownerID = t, this._values = e, this);
+};
+A.isRecord = Et;
+A.getDescriptiveName = Xn;
+var O = A.prototype;
+O[Zo] = !0;
+O[cr] = O.remove;
+O.deleteIn = O.removeIn = Un;
+O.getIn = $a;
+O.hasIn = L.hasIn;
+O.merge = _a;
+O.mergeWith = da;
+O.mergeIn = kn;
+O.mergeDeep = va;
+O.mergeDeepWith = ya;
+O.mergeDeepIn = Bn;
+O.setIn = jn;
+O.update = Ln;
+O.updateIn = Pn;
+O.withMutations = dr;
+O.asMutable = _r;
+O.asImmutable = pr;
+O[Or] = O.entries;
+O.toJSON = O.toObject = L.toObject;
+O.inspect = O.toSource = function() {
+  return this.toString();
+};
+function Yn(r, t, e) {
+  var n = Object.create(Object.getPrototypeOf(r));
+  return n._values = t, n.__ownerID = e, n;
+}
+function Xn(r) {
+  return r.constructor.displayName || r.constructor.name || "Record";
+}
+function Nt(r) {
+  return En(r._keys.map(function(t) {
+    return [t, r.get(t)];
+  }));
+}
+function Vs(r, t) {
+  try {
+    Object.defineProperty(r, t, {
+      get: function() {
+        return this.get(t);
+      },
+      set: function(e) {
+        Zt(this.__ownerID, "Cannot set on an immutable record."), this.set(t, e);
+      }
+    });
+  } catch {
+  }
+}
+var Sr = typeof globalThis < "u" ? globalThis : typeof window < "u" ? window : typeof global < "u" ? global : typeof self < "u" ? self : {};
+function Zs(r) {
+  return r && r.__esModule && Object.prototype.hasOwnProperty.call(r, "default") ? r.default : r;
+}
+var Gr, Ei;
+function La() {
+  if (Ei) return Gr;
+  Ei = 1;
+  function r(t, e) {
+    for (var n = -1, i = e.length, o = t.length; ++n < i; )
+      t[o + n] = e[n];
+    return t;
+  }
+  return Gr = r, Gr;
+}
+var Wr, Oi;
+function Qs() {
+  if (Oi) return Wr;
+  Oi = 1;
+  var r = typeof Sr == "object" && Sr && Sr.Object === Object && Sr;
+  return Wr = r, Wr;
+}
+var Yr, zi;
+function Jn() {
+  if (zi) return Yr;
+  zi = 1;
+  var r = Qs(), t = typeof self == "object" && self && self.Object === Object && self, e = r || t || Function("return this")();
+  return Yr = e, Yr;
+}
+var Xr, Ti;
+function Br() {
+  if (Ti) return Xr;
+  Ti = 1;
+  var r = Jn(), t = r.Symbol;
+  return Xr = t, Xr;
+}
+var Jr, Ri;
+function tu() {
+  if (Ri) return Jr;
+  Ri = 1;
+  var r = Br(), t = Object.prototype, e = t.hasOwnProperty, n = t.toString, i = r ? r.toStringTag : void 0;
+  function o(a) {
+    var s = e.call(a, i), u = a[i];
+    try {
+      a[i] = void 0;
+      var f = !0;
+    } catch {
+    }
+    var c = n.call(a);
+    return f && (s ? a[i] = u : delete a[i]), c;
+  }
+  return Jr = o, Jr;
+}
+var Vr, Ai;
+function ru() {
+  if (Ai) return Vr;
+  Ai = 1;
+  var r = Object.prototype, t = r.toString;
+  function e(n) {
+    return t.call(n);
+  }
+  return Vr = e, Vr;
+}
+var Zr, Ci;
+function Vn() {
+  if (Ci) return Zr;
+  Ci = 1;
+  var r = Br(), t = tu(), e = ru(), n = "[object Null]", i = "[object Undefined]", o = r ? r.toStringTag : void 0;
+  function a(s) {
+    return s == null ? s === void 0 ? i : n : o && o in Object(s) ? t(s) : e(s);
+  }
+  return Zr = a, Zr;
+}
+var Qr, $i;
+function Zn() {
+  if ($i) return Qr;
+  $i = 1;
+  function r(t) {
+    return t != null && typeof t == "object";
+  }
+  return Qr = r, Qr;
+}
+var te, Bi;
+function eu() {
+  if (Bi) return te;
+  Bi = 1;
+  var r = Vn(), t = Zn(), e = "[object Arguments]";
+  function n(i) {
+    return t(i) && r(i) == e;
+  }
+  return te = n, te;
+}
+var re, ki;
+function Pa() {
+  if (ki) return re;
+  ki = 1;
+  var r = eu(), t = Zn(), e = Object.prototype, n = e.hasOwnProperty, i = e.propertyIsEnumerable, o = r(/* @__PURE__ */ (function() {
+    return arguments;
+  })()) ? r : function(a) {
+    return t(a) && n.call(a, "callee") && !i.call(a, "callee");
+  };
+  return re = o, re;
+}
+var ee, ji;
+function Wt() {
+  if (ji) return ee;
+  ji = 1;
+  var r = Array.isArray;
+  return ee = r, ee;
+}
+var ne, Li;
+function nu() {
+  if (Li) return ne;
+  Li = 1;
+  var r = Br(), t = Pa(), e = Wt(), n = r ? r.isConcatSpreadable : void 0;
+  function i(o) {
+    return e(o) || t(o) || !!(n && o && o[n]);
+  }
+  return ne = i, ne;
+}
+var ie, Pi;
+function iu() {
+  if (Pi) return ie;
+  Pi = 1;
+  var r = La(), t = nu();
+  function e(n, i, o, a, s) {
+    var u = -1, f = n.length;
+    for (o || (o = t), s || (s = []); ++u < f; ) {
+      var c = n[u];
+      i > 0 && o(c) ? i > 1 ? e(c, i - 1, o, a, s) : r(s, c) : a || (s[s.length] = c);
+    }
+    return s;
+  }
+  return ie = e, ie;
+}
+var oe, xi;
+function ou() {
+  if (xi) return oe;
+  xi = 1;
+  function r(t, e) {
+    var n = -1, i = t.length;
+    for (e || (e = Array(i)); ++n < i; )
+      e[n] = t[n];
+    return e;
+  }
+  return oe = r, oe;
+}
+var ae, Ni;
+function au() {
+  if (Ni) return ae;
+  Ni = 1;
+  var r = La(), t = iu(), e = ou(), n = Wt();
+  function i() {
+    var o = arguments.length;
+    if (!o)
+      return [];
+    for (var a = Array(o - 1), s = arguments[0], u = o; u--; )
+      a[u - 1] = arguments[u];
+    return r(n(s) ? e(s) : [s], t(a, 1));
+  }
+  return ae = i, ae;
+}
+au();
+var se, Di;
+function su() {
+  if (Di) return se;
+  Di = 1;
+  function r(t, e) {
+    return t != null && e in Object(t);
+  }
+  return se = r, se;
+}
+var ue, Fi;
+function kr() {
+  if (Fi) return ue;
+  Fi = 1;
+  var r = Vn(), t = Zn(), e = "[object Symbol]";
+  function n(i) {
+    return typeof i == "symbol" || t(i) && r(i) == e;
+  }
+  return ue = n, ue;
+}
+var fe, Hi;
+function uu() {
+  if (Hi) return fe;
+  Hi = 1;
+  var r = Wt(), t = kr(), e = /\.|\[(?:[^[\]]*|(["'])(?:(?!\1)[^\\]|\\.)*?\1)\]/, n = /^\w*$/;
+  function i(o, a) {
+    if (r(o))
+      return !1;
+    var s = typeof o;
+    return s == "number" || s == "symbol" || s == "boolean" || o == null || t(o) ? !0 : n.test(o) || !e.test(o) || a != null && o in Object(a);
+  }
+  return fe = i, fe;
+}
+var ce, Ui;
+function Qn() {
+  if (Ui) return ce;
+  Ui = 1;
+  function r(t) {
+    var e = typeof t;
+    return t != null && (e == "object" || e == "function");
+  }
+  return ce = r, ce;
+}
+var he, Ki;
+function fu() {
+  if (Ki) return he;
+  Ki = 1;
+  var r = Vn(), t = Qn(), e = "[object AsyncFunction]", n = "[object Function]", i = "[object GeneratorFunction]", o = "[object Proxy]";
+  function a(s) {
+    if (!t(s))
+      return !1;
+    var u = r(s);
+    return u == n || u == i || u == e || u == o;
+  }
+  return he = a, he;
+}
+var pe, Gi;
+function cu() {
+  if (Gi) return pe;
+  Gi = 1;
+  var r = Jn(), t = r["__core-js_shared__"];
+  return pe = t, pe;
+}
+var _e, Wi;
+function hu() {
+  if (Wi) return _e;
+  Wi = 1;
+  var r = cu(), t = (function() {
+    var n = /[^.]+$/.exec(r && r.keys && r.keys.IE_PROTO || "");
+    return n ? "Symbol(src)_1." + n : "";
+  })();
+  function e(n) {
+    return !!t && t in n;
+  }
+  return _e = e, _e;
+}
+var de, Yi;
+function pu() {
+  if (Yi) return de;
+  Yi = 1;
+  var r = Function.prototype, t = r.toString;
+  function e(n) {
+    if (n != null) {
+      try {
+        return t.call(n);
+      } catch {
+      }
+      try {
+        return n + "";
+      } catch {
+      }
+    }
+    return "";
+  }
+  return de = e, de;
+}
+var le, Xi;
+function _u() {
+  if (Xi) return le;
+  Xi = 1;
+  var r = fu(), t = hu(), e = Qn(), n = pu(), i = /[\\^$.*+?()[\]{}|]/g, o = /^\[object .+?Constructor\]$/, a = Function.prototype, s = Object.prototype, u = a.toString, f = s.hasOwnProperty, c = RegExp(
+    "^" + u.call(f).replace(i, "\\$&").replace(/hasOwnProperty|(function).*?(?=\\\()| for .+?(?=\\\])/g, "$1.*?") + "$"
+  );
+  function h(p) {
+    if (!e(p) || t(p))
+      return !1;
+    var _ = r(p) ? c : o;
+    return _.test(n(p));
+  }
+  return le = h, le;
+}
+var ve, Ji;
+function du() {
+  if (Ji) return ve;
+  Ji = 1;
+  function r(t, e) {
+    return t?.[e];
+  }
+  return ve = r, ve;
+}
+var ye, Vi;
+function xa() {
+  if (Vi) return ye;
+  Vi = 1;
+  var r = _u(), t = du();
+  function e(n, i) {
+    var o = t(n, i);
+    return r(o) ? o : void 0;
+  }
+  return ye = e, ye;
+}
+var ge, Zi;
+function jr() {
+  if (Zi) return ge;
+  Zi = 1;
+  var r = xa(), t = r(Object, "create");
+  return ge = t, ge;
+}
+var me, Qi;
+function lu() {
+  if (Qi) return me;
+  Qi = 1;
+  var r = jr();
+  function t() {
+    this.__data__ = r ? r(null) : {}, this.size = 0;
+  }
+  return me = t, me;
+}
+var Se, to;
+function vu() {
+  if (to) return Se;
+  to = 1;
+  function r(t) {
+    var e = this.has(t) && delete this.__data__[t];
+    return this.size -= e ? 1 : 0, e;
+  }
+  return Se = r, Se;
+}
+var we, ro;
+function yu() {
+  if (ro) return we;
+  ro = 1;
+  var r = jr(), t = "__lodash_hash_undefined__", e = Object.prototype, n = e.hasOwnProperty;
+  function i(o) {
+    var a = this.__data__;
+    if (r) {
+      var s = a[o];
+      return s === t ? void 0 : s;
+    }
+    return n.call(a, o) ? a[o] : void 0;
+  }
+  return we = i, we;
+}
+var be, eo;
+function gu() {
+  if (eo) return be;
+  eo = 1;
+  var r = jr(), t = Object.prototype, e = t.hasOwnProperty;
+  function n(i) {
+    var o = this.__data__;
+    return r ? o[i] !== void 0 : e.call(o, i);
+  }
+  return be = n, be;
+}
+var Ie, no;
+function mu() {
+  if (no) return Ie;
+  no = 1;
+  var r = jr(), t = "__lodash_hash_undefined__";
+  function e(n, i) {
+    var o = this.__data__;
+    return this.size += this.has(n) ? 0 : 1, o[n] = r && i === void 0 ? t : i, this;
+  }
+  return Ie = e, Ie;
+}
+var qe, io;
+function Su() {
+  if (io) return qe;
+  io = 1;
+  var r = lu(), t = vu(), e = yu(), n = gu(), i = mu();
+  function o(a) {
+    var s = -1, u = a == null ? 0 : a.length;
+    for (this.clear(); ++s < u; ) {
+      var f = a[s];
+      this.set(f[0], f[1]);
+    }
+  }
+  return o.prototype.clear = r, o.prototype.delete = t, o.prototype.get = e, o.prototype.has = n, o.prototype.set = i, qe = o, qe;
+}
+var Me, oo;
+function wu() {
+  if (oo) return Me;
+  oo = 1;
+  function r() {
+    this.__data__ = [], this.size = 0;
+  }
+  return Me = r, Me;
+}
+var Ee, ao;
+function bu() {
+  if (ao) return Ee;
+  ao = 1;
+  function r(t, e) {
+    return t === e || t !== t && e !== e;
+  }
+  return Ee = r, Ee;
+}
+var Oe, so;
+function Lr() {
+  if (so) return Oe;
+  so = 1;
+  var r = bu();
+  function t(e, n) {
+    for (var i = e.length; i--; )
+      if (r(e[i][0], n))
+        return i;
+    return -1;
+  }
+  return Oe = t, Oe;
+}
+var ze, uo;
+function Iu() {
+  if (uo) return ze;
+  uo = 1;
+  var r = Lr(), t = Array.prototype, e = t.splice;
+  function n(i) {
+    var o = this.__data__, a = r(o, i);
+    if (a < 0)
+      return !1;
+    var s = o.length - 1;
+    return a == s ? o.pop() : e.call(o, a, 1), --this.size, !0;
+  }
+  return ze = n, ze;
+}
+var Te, fo;
+function qu() {
+  if (fo) return Te;
+  fo = 1;
+  var r = Lr();
+  function t(e) {
+    var n = this.__data__, i = r(n, e);
+    return i < 0 ? void 0 : n[i][1];
+  }
+  return Te = t, Te;
+}
+var Re, co;
+function Mu() {
+  if (co) return Re;
+  co = 1;
+  var r = Lr();
+  function t(e) {
+    return r(this.__data__, e) > -1;
+  }
+  return Re = t, Re;
+}
+var Ae, ho;
+function Eu() {
+  if (ho) return Ae;
+  ho = 1;
+  var r = Lr();
+  function t(e, n) {
+    var i = this.__data__, o = r(i, e);
+    return o < 0 ? (++this.size, i.push([e, n])) : i[o][1] = n, this;
+  }
+  return Ae = t, Ae;
+}
+var Ce, po;
+function Ou() {
+  if (po) return Ce;
+  po = 1;
+  var r = wu(), t = Iu(), e = qu(), n = Mu(), i = Eu();
+  function o(a) {
+    var s = -1, u = a == null ? 0 : a.length;
+    for (this.clear(); ++s < u; ) {
+      var f = a[s];
+      this.set(f[0], f[1]);
+    }
+  }
+  return o.prototype.clear = r, o.prototype.delete = t, o.prototype.get = e, o.prototype.has = n, o.prototype.set = i, Ce = o, Ce;
+}
+var $e, _o;
+function zu() {
+  if (_o) return $e;
+  _o = 1;
+  var r = xa(), t = Jn(), e = r(t, "Map");
+  return $e = e, $e;
+}
+var Be, lo;
+function Tu() {
+  if (lo) return Be;
+  lo = 1;
+  var r = Su(), t = Ou(), e = zu();
+  function n() {
+    this.size = 0, this.__data__ = {
+      hash: new r(),
+      map: new (e || t)(),
+      string: new r()
+    };
+  }
+  return Be = n, Be;
+}
+var ke, vo;
+function Ru() {
+  if (vo) return ke;
+  vo = 1;
+  function r(t) {
+    var e = typeof t;
+    return e == "string" || e == "number" || e == "symbol" || e == "boolean" ? t !== "__proto__" : t === null;
+  }
+  return ke = r, ke;
+}
+var je, yo;
+function Pr() {
+  if (yo) return je;
+  yo = 1;
+  var r = Ru();
+  function t(e, n) {
+    var i = e.__data__;
+    return r(n) ? i[typeof n == "string" ? "string" : "hash"] : i.map;
+  }
+  return je = t, je;
+}
+var Le, go;
+function Au() {
+  if (go) return Le;
+  go = 1;
+  var r = Pr();
+  function t(e) {
+    var n = r(this, e).delete(e);
+    return this.size -= n ? 1 : 0, n;
+  }
+  return Le = t, Le;
+}
+var Pe, mo;
+function Cu() {
+  if (mo) return Pe;
+  mo = 1;
+  var r = Pr();
+  function t(e) {
+    return r(this, e).get(e);
+  }
+  return Pe = t, Pe;
+}
+var xe, So;
+function $u() {
+  if (So) return xe;
+  So = 1;
+  var r = Pr();
+  function t(e) {
+    return r(this, e).has(e);
+  }
+  return xe = t, xe;
+}
+var Ne, wo;
+function Bu() {
+  if (wo) return Ne;
+  wo = 1;
+  var r = Pr();
+  function t(e, n) {
+    var i = r(this, e), o = i.size;
+    return i.set(e, n), this.size += i.size == o ? 0 : 1, this;
+  }
+  return Ne = t, Ne;
+}
+var De, bo;
+function ku() {
+  if (bo) return De;
+  bo = 1;
+  var r = Tu(), t = Au(), e = Cu(), n = $u(), i = Bu();
+  function o(a) {
+    var s = -1, u = a == null ? 0 : a.length;
+    for (this.clear(); ++s < u; ) {
+      var f = a[s];
+      this.set(f[0], f[1]);
+    }
+  }
+  return o.prototype.clear = r, o.prototype.delete = t, o.prototype.get = e, o.prototype.has = n, o.prototype.set = i, De = o, De;
+}
+var Fe, Io;
+function ju() {
+  if (Io) return Fe;
+  Io = 1;
+  var r = ku(), t = "Expected a function";
+  function e(n, i) {
+    if (typeof n != "function" || i != null && typeof i != "function")
+      throw new TypeError(t);
+    var o = function() {
+      var a = arguments, s = i ? i.apply(this, a) : a[0], u = o.cache;
+      if (u.has(s))
+        return u.get(s);
+      var f = n.apply(this, a);
+      return o.cache = u.set(s, f) || u, f;
+    };
+    return o.cache = new (e.Cache || r)(), o;
+  }
+  return e.Cache = r, Fe = e, Fe;
+}
+var He, qo;
+function Lu() {
+  if (qo) return He;
+  qo = 1;
+  var r = ju(), t = 500;
+  function e(n) {
+    var i = r(n, function(a) {
+      return o.size === t && o.clear(), a;
+    }), o = i.cache;
+    return i;
+  }
+  return He = e, He;
+}
+var Ue, Mo;
+function Pu() {
+  if (Mo) return Ue;
+  Mo = 1;
+  var r = Lu(), t = /[^.[\]]+|\[(?:(-?\d+(?:\.\d+)?)|(["'])((?:(?!\2)[^\\]|\\.)*?)\2)\]|(?=(?:\.|\[\])(?:\.|\[\]|$))/g, e = /\\(\\)?/g, n = r(function(i) {
+    var o = [];
+    return i.charCodeAt(0) === 46 && o.push(""), i.replace(t, function(a, s, u, f) {
+      o.push(u ? f.replace(e, "$1") : s || a);
+    }), o;
+  });
+  return Ue = n, Ue;
+}
+var Ke, Eo;
+function xu() {
+  if (Eo) return Ke;
+  Eo = 1;
+  function r(t, e) {
+    for (var n = -1, i = t == null ? 0 : t.length, o = Array(i); ++n < i; )
+      o[n] = e(t[n], n, t);
+    return o;
+  }
+  return Ke = r, Ke;
+}
+var Ge, Oo;
+function Nu() {
+  if (Oo) return Ge;
+  Oo = 1;
+  var r = Br(), t = xu(), e = Wt(), n = kr(), i = r ? r.prototype : void 0, o = i ? i.toString : void 0;
+  function a(s) {
+    if (typeof s == "string")
+      return s;
+    if (e(s))
+      return t(s, a) + "";
+    if (n(s))
+      return o ? o.call(s) : "";
+    var u = s + "";
+    return u == "0" && 1 / s == -1 / 0 ? "-0" : u;
+  }
+  return Ge = a, Ge;
+}
+var We, zo;
+function Du() {
+  if (zo) return We;
+  zo = 1;
+  var r = Nu();
+  function t(e) {
+    return e == null ? "" : r(e);
+  }
+  return We = t, We;
+}
+var Ye, To;
+function Fu() {
+  if (To) return Ye;
+  To = 1;
+  var r = Wt(), t = uu(), e = Pu(), n = Du();
+  function i(o, a) {
+    return r(o) ? o : t(o, a) ? [o] : e(n(o));
+  }
+  return Ye = i, Ye;
+}
+var Xe, Ro;
+function Hu() {
+  if (Ro) return Xe;
+  Ro = 1;
+  var r = 9007199254740991, t = /^(?:0|[1-9]\d*)$/;
+  function e(n, i) {
+    var o = typeof n;
+    return i = i ?? r, !!i && (o == "number" || o != "symbol" && t.test(n)) && n > -1 && n % 1 == 0 && n < i;
+  }
+  return Xe = e, Xe;
+}
+var Je, Ao;
+function Uu() {
+  if (Ao) return Je;
+  Ao = 1;
+  var r = 9007199254740991;
+  function t(e) {
+    return typeof e == "number" && e > -1 && e % 1 == 0 && e <= r;
+  }
+  return Je = t, Je;
+}
+var Ve, Co;
+function Ku() {
+  if (Co) return Ve;
+  Co = 1;
+  var r = kr();
+  function t(e) {
+    if (typeof e == "string" || r(e))
+      return e;
+    var n = e + "";
+    return n == "0" && 1 / e == -1 / 0 ? "-0" : n;
+  }
+  return Ve = t, Ve;
+}
+var Ze, $o;
+function Gu() {
+  if ($o) return Ze;
+  $o = 1;
+  var r = Fu(), t = Pa(), e = Wt(), n = Hu(), i = Uu(), o = Ku();
+  function a(s, u, f) {
+    u = r(u, s);
+    for (var c = -1, h = u.length, p = !1; ++c < h; ) {
+      var _ = o(u[c]);
+      if (!(p = s != null && f(s, _)))
+        break;
+      s = s[_];
+    }
+    return p || ++c != h ? p : (h = s == null ? 0 : s.length, !!h && i(h) && n(_, h) && (e(s) || t(s)));
+  }
+  return Ze = a, Ze;
+}
+var Qe, Bo;
+function Wu() {
+  if (Bo) return Qe;
+  Bo = 1;
+  var r = su(), t = Gu();
+  function e(n, i) {
+    return n != null && t(n, i, r);
+  }
+  return Qe = e, Qe;
+}
+Wu();
+var tn, ko;
+function Yu() {
+  if (ko) return tn;
+  ko = 1;
+  var r = Math.max, t = Math.min;
+  function e(n, i, o) {
+    return n >= t(i, o) && n < r(i, o);
+  }
+  return tn = e, tn;
+}
+var rn, jo;
+function Xu() {
+  if (jo) return rn;
+  jo = 1;
+  var r = /\s/;
+  function t(e) {
+    for (var n = e.length; n-- && r.test(e.charAt(n)); )
+      ;
+    return n;
+  }
+  return rn = t, rn;
+}
+var en, Lo;
+function Ju() {
+  if (Lo) return en;
+  Lo = 1;
+  var r = Xu(), t = /^\s+/;
+  function e(n) {
+    return n && n.slice(0, r(n) + 1).replace(t, "");
+  }
+  return en = e, en;
+}
+var nn, Po;
+function Na() {
+  if (Po) return nn;
+  Po = 1;
+  var r = Ju(), t = Qn(), e = kr(), n = NaN, i = /^[-+]0x[0-9a-f]+$/i, o = /^0b[01]+$/i, a = /^0o[0-7]+$/i, s = parseInt;
+  function u(f) {
+    if (typeof f == "number")
+      return f;
+    if (e(f))
+      return n;
+    if (t(f)) {
+      var c = typeof f.valueOf == "function" ? f.valueOf() : f;
+      f = t(c) ? c + "" : c;
+    }
+    if (typeof f != "string")
+      return f === 0 ? f : +f;
+    f = r(f);
+    var h = o.test(f);
+    return h || a.test(f) ? s(f.slice(2), h ? 2 : 8) : i.test(f) ? n : +f;
+  }
+  return nn = u, nn;
+}
+var on, xo;
+function Da() {
+  if (xo) return on;
+  xo = 1;
+  var r = Na(), t = 1 / 0, e = 17976931348623157e292;
+  function n(i) {
+    if (!i)
+      return i === 0 ? i : 0;
+    if (i = r(i), i === t || i === -t) {
+      var o = i < 0 ? -1 : 1;
+      return o * e;
+    }
+    return i === i ? i : 0;
+  }
+  return on = n, on;
+}
+var an, No;
+function Vu() {
+  if (No) return an;
+  No = 1;
+  var r = Yu(), t = Da(), e = Na();
+  function n(i, o, a) {
+    return o = t(o), a === void 0 ? (a = o, o = 0) : a = t(a), i = e(i), r(i, o, a);
+  }
+  return an = n, an;
+}
+var Zu = Vu();
+const Qu = /* @__PURE__ */ Zs(Zu);
+var sn, Do;
+function Fa() {
+  if (Do) return sn;
+  Do = 1;
+  var r = Da();
+  function t(e) {
+    var n = r(e), i = n % 1;
+    return n === n ? i ? n - i : n : 0;
+  }
+  return sn = t, sn;
+}
+var un, Fo;
+function tf() {
+  if (Fo) return un;
+  Fo = 1;
+  var r = Fa();
+  function t(e) {
+    return typeof e == "number" && e == r(e);
+  }
+  return un = t, un;
+}
+tf();
+var fn, Ho;
+function rf() {
+  if (Ho) return fn;
+  Ho = 1;
+  function r(t, e, n) {
+    var i = -1, o = t.length;
+    e < 0 && (e = -e > o ? 0 : o + e), n = n > o ? o : n, n < 0 && (n += o), o = e > n ? 0 : n - e >>> 0, e >>>= 0;
+    for (var a = Array(o); ++i < o; )
+      a[i] = t[i + e];
+    return a;
+  }
+  return fn = r, fn;
+}
+var cn, Uo;
+function ef() {
+  if (Uo) return cn;
+  Uo = 1;
+  var r = rf(), t = Fa();
+  function e(n, i, o) {
+    return n && n.length ? (i = o || i === void 0 ? 1 : t(i), r(n, 0, i < 0 ? 0 : i)) : [];
+  }
+  return cn = e, cn;
+}
+ef();
+const sr = "black", ur = "white", tt = null;
+class Ha extends A({ dimensions: 19, moves: U() }, "Board") {
+  constructor(t = 19, ...e) {
+    super({
+      dimensions: t,
+      moves: U(
+        e.map((n) => [n.coordinate, n.color])
+      )
+    });
+  }
+  toMap(t = null) {
+    const e = {
+      [sr]: sr,
+      [ur]: ur,
+      [tt]: tt
+    }, n = t || e;
+    return Array(this.dimensions).fill(tt).map(
+      (i, o) => Array(this.dimensions).fill(tt).map(
+        (a, s) => {
+          const u = this.moves.get(rt(s, o), tt);
+          return n[u] || e[u];
+        }
+      )
+    );
+  }
+}
+function Ua(...r) {
+  return Reflect.construct(Ha, r);
+}
+Ua.prototype = Ha.prototype;
+class Ka extends A({ x: 0, y: 0 }, "Coordinate") {
+  constructor(t, e) {
+    super({ x: t, y: e });
+  }
+}
+function rt(...r) {
+  return Reflect.construct(Ka, r);
+}
+rt.prototype = Ka.prototype;
+class Ga extends A({ coordinate: rt(), color: tt }, "Move") {
+  constructor(t, e) {
+    super({ coordinate: t, color: e });
+  }
+}
+function Wa(...r) {
+  return Reflect.construct(Ga, r);
+}
+Wa.prototype = Ga.prototype;
+rt(4, 4);
+rt(6, 6);
+rt(9, 9);
+function nf(r, t) {
+  const { x: e, y: n } = t, i = (o) => Qu(o, r.dimensions);
+  return ft.of(
+    rt(e, n + 1),
+    rt(e, n - 1),
+    rt(e + 1, n),
+    rt(e - 1, n)
+  ).filter((o) => i(o.x) && i(o.y));
+}
+function xr(r, t, e) {
+  const n = e === void 0 ? r.moves.get(t, tt) : e;
+  return nf(r, t).filter((i) => r.moves.get(i, tt) === n);
+}
+function Ya(r, t) {
+  let e = ft(), n = ft.of(t);
+  for (; !n.isEmpty(); ) {
+    const i = n.first(), o = xr(r, i);
+    e = e.add(i), n = n.rest().union(o.subtract(e));
+  }
+  return e;
+}
+function Xa(r) {
+  return r === sr ? ur : r === ur ? sr : tt;
+}
+function of(r, t) {
+  return Ya(r, t).reduce(
+    (e, n) => e.union(
+      xr(r, n, tt)
+    ),
+    ft()
+  );
+}
+function Sn(r, t) {
+  return of(r, t).size;
+}
+function Ja(r, t) {
+  const e = Sn(
+    r.setIn(["moves", t.coordinate], t.color),
+    t.coordinate
+  ) > 0, n = xr(
+    r,
+    t.coordinate,
+    Xa(t.color)
+  ).some((i) => Sn(r, i) === 1);
+  return e || n;
+}
+function af(r, t) {
+  return r.setIn(
+    ["moves"],
+    t.reduce(
+      (e, n) => e.delete(n),
+      r.moves
+    )
+  );
+}
+function sf(r, t) {
+  if (!Ja(r, t))
+    throw new Error("Not a valid position");
+  if (r.moves.has(t.coordinate))
+    throw new Error("There is already a stone there");
+  const e = xr(
+    r,
+    t.coordinate,
+    Xa(t.color)
+  ).reduce(
+    (n, i) => n.union(
+      Sn(r, i) === 1 ? Ya(r, i) : ft()
+    ),
+    ft()
+  );
+  return af(r, e).setIn(
+    ["moves", t.coordinate],
+    t.color
+  );
+}
+const wt = {
+  BLACK: sr,
+  Board: Ua,
+  Coordinate: rt,
+  EMPTY: tt,
+  Move: Wa,
+  WHITE: ur,
+  addMove: sf,
+  isLegalMove: Ja
+}, J = wt.BLACK, Ko = wt.Board, fr = wt.Coordinate, tr = wt.EMPTY, qt = wt.Move, at = wt.WHITE, Ct = wt.addMove, Va = wt.isLegalMove;
+function wr(r) {
+  return `
+    <div style="background: #fee2e2; color: #991b1b; padding: 1rem; border-radius: 4px;">${r}</div>
+  `;
+}
+function ti(r, t, e) {
+  const n = r.dimensions, i = t ?? n, o = e ?? n, a = 30, s = a, u = a * 0.4, f = n === o, c = n === i, h = (f ? o - 1 : o) * a + s * 2, p = (c ? i - 1 : i) * a + s * 2;
+  let _ = `<svg width="${h}" height="${p}" xmlns="http://www.w3.org/2000/svg">`;
+  _ += `<rect width="${h}" height="${p}" fill="#dcb35c"/>`;
+  const d = o < n, v = i < n, I = s + (d ? o : o - 1) * a, y = s + (v ? i : i - 1) * a;
+  for (let l = 0; l < o; l++) {
+    const g = s + l * a;
+    _ += `<line x1="${g}" y1="${s}" x2="${g}" y2="${y}" stroke="#000" stroke-width="1"/>`;
+  }
+  for (let l = 0; l < i; l++) {
+    const g = s + l * a;
+    _ += `<line x1="${s}" y1="${g}" x2="${I}" y2="${g}" stroke="#000" stroke-width="1"/>`;
+  }
+  const m = [];
+  n === 9 ? m.push([2, 2], [2, 6], [4, 4], [6, 2], [6, 6]) : n === 13 ? m.push([3, 3], [3, 9], [6, 6], [9, 3], [9, 9]) : n === 19 && m.push([3, 3], [3, 9], [3, 15], [9, 3], [9, 9], [9, 15], [15, 3], [15, 9], [15, 15]);
+  for (const [l, g] of m)
+    if (l < i && g < o) {
+      const b = s + g * a, B = s + l * a;
+      _ += `<circle cx="${b}" cy="${B}" r="3" fill="#000"/>`;
+    }
+  for (let l = 0; l < i; l++)
+    for (let g = 0; g < o; g++) {
+      const b = r.moves.get(fr(l, g), tr);
+      if (b !== tr) {
+        const B = s + g * a, C = s + l * a;
+        b === J ? _ += `<circle cx="${B}" cy="${C}" r="${u}" fill="#000" stroke="#000" stroke-width="1"/>` : b === at && (_ += `<circle cx="${B}" cy="${C}" r="${u}" fill="#fff" stroke="#000" stroke-width="1"/>`);
+      }
+    }
+  return _ += "</svg>", _;
+}
+class it extends Error {
+  constructor(t) {
+    super(t), this.name = "ValidationError";
+  }
+}
+function Za(r, t) {
+  const e = {};
+  let n = null, i = !1;
+  for (let o = t; o < r.length; o++) {
+    const a = r[o].trim();
+    if (a === "") continue;
+    const s = a.indexOf(":");
+    if (s > 0) {
+      const u = a.substring(0, s).trim(), f = a.substring(s + 1).trim();
+      e[u] = f, n = u, i = f === "";
+    } else n && i && (Array.isArray(e[n]) ? e[n].push(a) : e[n] = [a]);
+  }
+  return e;
+}
+function ri(r, t = {}) {
+  const { allowEmpty: e = !1, validateCharacters: n = !0 } = t;
+  let i = 1;
+  for (; i < r.length && r[i].trim() === ""; )
+    i++;
+  if (i >= r.length)
+    throw new it("No board definition or options found");
+  const o = [];
+  let a = i;
+  for (let y = i; y < r.length; y++) {
+    const m = r[y];
+    if (m.trim() === "") {
+      a = y;
+      break;
+    }
+    if (m.indexOf(":") > 0) {
+      a = y;
+      break;
+    }
+    o.push(m), a = y + 1;
+  }
+  const s = Za(r, a);
+  let u;
+  if (s.size) {
+    const y = s.size;
+    if (Array.isArray(y))
+      throw new it("Size option cannot have multiple values");
+    const m = parseInt(y, 10);
+    if (isNaN(m) || m <= 1 || m > 19)
+      throw new it("Size must be a positive integer greater than 1 and less than or equal to 19");
+    u = m;
+  }
+  if (o.length === 0) {
+    if (!e)
+      throw new it("Board definition is required");
+    if (!u)
+      throw new it('Empty board requires a "size" option');
+    return {
+      board: Ko(u),
+      rowCount: u,
+      columnCount: u,
+      configStartIndex: a,
+      otherMarks: {}
+    };
+  }
+  const f = o.map((y) => y.replace(/\s/g, "").length), c = f[0];
+  if (!f.every((y) => y === c))
+    throw new it("All board rows must have the same number of non-space characters");
+  const h = o.length, p = o[0].replace(/\s/g, "").length, _ = h === p;
+  if (u && (h > u || p > u))
+    throw new it(`Board dimensions (${h}x${p}) exceed specified size (${u})`);
+  if (!_ && !u)
+    throw new it(`Rectangle boards require a "size" option (found ${h}x${p} board)`);
+  u || (u = h);
+  const d = [], v = {};
+  for (let y = 0; y < o.length; y++) {
+    const m = o[y];
+    let l = 0;
+    for (let g = 0; g < m.length; g++) {
+      const b = m[g];
+      if (b === " ") continue;
+      const B = /^[.+XOxo]$/.test(b);
+      if (n && !B)
+        throw new it(`Invalid board character '${b}' at row ${y + 1}, col ${l + 1}. Valid characters: . or + (empty), X or x (black stone), O or o (white stone)`);
+      let C = tr;
+      b === "X" || b === "x" ? C = J : b === "O" || b === "o" ? C = at : b === "." || b === "+" ? C = tr : n || (v[b] || (v[b] = []), v[b].push(fr(y, l))), C !== tr && d.push(qt(fr(y, l), C)), l++;
+    }
+  }
+  return {
+    board: Ko(u, ...d),
+    rowCount: h,
+    columnCount: p,
+    configStartIndex: a,
+    otherMarks: v
+  };
+}
+const nt = {
+  Success: "success",
+  Failure: "failure",
+  Incomplete: "incomplete"
+};
+class Qa {
+  parsedBoard;
+  element;
+  constructor(t, e) {
+    this.element = t, this.parsedBoard = ri(e, {});
+  }
+  render() {
+    const t = this.element, { board: e, rowCount: n, columnCount: i } = this.parsedBoard, o = ti(e, n, i);
+    t.innerHTML = o;
+  }
+}
+class ts {
+  parsedBoard;
+  element;
+  toPlay;
+  sequenceTree;
+  result;
+  currentTree;
+  playedMoves;
+  currentBoard;
+  isBlackTurn;
+  constructor(t, e) {
+    this.element = t;
+    const n = ri(e, { allowEmpty: !1, validateCharacters: !1 });
+    for (const [l, g] of Object.entries(n.otherMarks))
+      if (g.length > 1)
+        throw new Error(`Mark '${l}' appears at multiple coordinates. Each mark must be unique.`);
+    const i = Za(e, n.configStartIndex), o = i.black, a = i.white, s = o ? Array.isArray(o) ? o : o.split(",").map((l) => l.trim()).filter((l) => l.length > 0) : [], u = a ? Array.isArray(a) ? a : a.split(",").map((l) => l.trim()).filter((l) => l.length > 0) : [], f = new Set(u), c = s.filter((l) => f.has(l));
+    if (c.length > 0)
+      throw new Error(`Marks cannot appear in both black and white: ${c.join(", ")}`);
+    const h = new Set(Object.keys(n.otherMarks));
+    for (const l of s)
+      if (!h.has(l))
+        throw new Error(`Black mark '${l}' does not appear in the board`);
+    for (const l of u)
+      if (!h.has(l))
+        throw new Error(`White mark '${l}' does not appear in the board`);
+    const p = i["to-play"], _ = p ? (Array.isArray(p) ? p[0] : p).toLowerCase() : "";
+    if (_ && _ !== "black" && _ !== "white")
+      throw new Error(`Invalid to-play value '${_}'. Must be 'black' or 'white'`);
+    this.toPlay = _ === "white" ? at : J;
+    let d = n.board;
+    for (const l of s) {
+      const g = n.otherMarks[l];
+      for (const b of g)
+        d = Ct(d, qt(b, J));
+    }
+    for (const l of u) {
+      const g = n.otherMarks[l];
+      for (const b of g)
+        d = Ct(d, qt(b, at));
+    }
+    this.parsedBoard = { ...n, board: d }, this.result = nt.Incomplete, this.currentTree = U(), this.playedMoves = [], this.currentBoard = d, this.isBlackTurn = this.toPlay === J;
+    const v = (l, g) => {
+      const b = l.split(">").map((E) => E.trim()).filter((E) => E.length > 0);
+      for (const E of b)
+        if (!n.otherMarks[E])
+          throw new Error(`${g} '${l}': mark '${E}' does not appear in the board`);
+      let B = d, C = this.toPlay;
+      for (let E = 0; E < b.length; E++) {
+        const pt = b[E], bt = n.otherMarks[pt][0], Rt = qt(bt, C);
+        if (!Va(B, Rt))
+          throw new Error(`${g} '${l}': move ${E + 1} (${pt}) is illegal`);
+        try {
+          B = Ct(B, Rt);
+        } catch (At) {
+          const es = At instanceof Error ? At.message : String(At);
+          throw new Error(`${g} '${l}': move ${E + 1} (${pt}) failed - ${es}`);
+        }
+        C = C === J ? at : J;
+      }
+    }, I = i.solutions, y = [];
+    if (I) {
+      const l = Array.isArray(I) ? I : [I];
+      for (const g of l)
+        v(g, "Solution"), y.push({ sequence: g, isSolution: !0 });
+    }
+    const m = i.sequences;
+    if (m) {
+      const l = Array.isArray(m) ? m : [m];
+      for (const g of l)
+        v(g, "Sequence"), y.push({ sequence: g, isSolution: !1 });
+    }
+    this.sequenceTree = U();
+    for (const { sequence: l, isSolution: g } of y) {
+      const b = l.split(">").map((E) => E.trim()).filter((E) => E.length > 0), B = [];
+      for (const E of b)
+        B.push(n.otherMarks[E][0]);
+      let C = U();
+      for (let E = B.length - 1; E >= 0; E--) {
+        const pt = B[E], Tt = E === B.length - 1;
+        let bt;
+        Tt ? bt = g ? nt.Success : nt.Failure : bt = nt.Incomplete;
+        const Rt = {
+          result: bt,
+          children: C
+        };
+        C = U().set(pt, Rt);
+      }
+      this.sequenceTree = this.mergeSequenceTrees(this.sequenceTree, C);
+    }
+    this.currentTree = this.sequenceTree;
+  }
+  mergeSequenceTrees(t, e) {
+    return e.reduce((n, i, o) => {
+      const a = n.get(o);
+      if (a) {
+        const s = this.mergeSequenceTrees(a.children, i.children), c = {
+          result: s.size > 0 ? nt.Incomplete : a.result,
+          children: s
+        };
+        return n.set(o, c);
+      } else
+        return n.set(o, i);
+    }, t);
+  }
+  handleUserMove(t) {
+    const e = this.currentTree.get(t), n = this.isBlackTurn ? J : at, i = qt(t, n);
+    if (this.playedMoves.push(i), this.currentBoard = Ct(this.currentBoard, i), this.isBlackTurn = !this.isBlackTurn, !e) {
+      this.result !== nt.Success && (this.result = nt.Failure), this.currentTree = U(), this.render();
+      return;
+    }
+    this.currentTree = e.children, this.result = e.result, this.render(), e.children.size > 0 && setTimeout(() => this.playComputerResponse(), 500);
+  }
+  playComputerResponse() {
+    const t = Array.from(this.currentTree.entries());
+    if (t.length === 0) return;
+    const e = Math.floor(Math.random() * t.length), [n, i] = t[e], o = this.isBlackTurn ? J : at, a = qt(n, o);
+    this.playedMoves.push(a), this.currentBoard = Ct(this.currentBoard, a), this.isBlackTurn = !this.isBlackTurn, this.currentTree = i.children, this.result = i.result, this.render();
+  }
+  reset() {
+    this.currentTree = this.sequenceTree, this.playedMoves = [], this.currentBoard = this.parsedBoard.board, this.isBlackTurn = this.toPlay === J, this.result = nt.Incomplete, this.render();
+  }
+  render() {
+    const t = this.element, { rowCount: e, columnCount: n } = this.parsedBoard;
+    let o = ti(this.currentBoard, e, n);
+    const a = `reset-${Math.random().toString(36).substr(2, 9)}`, s = "padding: 0.5rem 1rem; margin: 0.5rem 0.25rem; border: 1px solid #ccc; border-radius: 4px; background: #fff; cursor: pointer; font-size: 0.9rem;";
+    o += '<div style="margin-top: 1rem; display: flex; align-items: center;">', o += `<button id="${a}" style="${s}">Reset</button>`, this.result === nt.Success ? o += '<span style="margin-left: 1rem; font-weight: 600; font-size: 1.1rem; color: #155724;">Success!</span>' : this.result === nt.Failure && (o += '<span style="margin-left: 1rem; font-weight: 600; font-size: 1.1rem; color: #721c24;">Incorrect</span>'), o += "</div>", t.innerHTML = o;
+    const u = t.querySelector("svg");
+    u && (u.style.cursor = "pointer", u.addEventListener("click", (c) => {
+      const h = c, p = u.getBoundingClientRect(), _ = h.clientX - p.left, d = h.clientY - p.top, v = 30, I = v, y = Math.round((_ - I) / v), m = Math.round((d - I) / v);
+      if (m >= 0 && m < e && y >= 0 && y < n) {
+        const l = fr(m, y);
+        this.handleUserMove(l);
+      }
+    }));
+    const f = document.getElementById(a);
+    f && f.addEventListener("click", () => this.reset());
+  }
+}
+class rs {
+  parsedBoard;
+  element;
+  currentBoard;
+  initialBoard;
+  history;
+  currentMoveIndex;
+  // -1 means no moves yet
+  isBlackTurn;
+  constructor(t, e) {
+    this.element = t, this.parsedBoard = ri(e, { allowEmpty: !0 }), this.initialBoard = this.parsedBoard.board, this.currentBoard = this.parsedBoard.board, this.history = [], this.currentMoveIndex = -1, this.isBlackTurn = !0;
+  }
+  rebuildBoard() {
+    let t = this.initialBoard;
+    for (let e = 0; e <= this.currentMoveIndex; e++) {
+      const n = this.history[e];
+      n.type === "move" && (t = Ct(t, n.move));
+    }
+    if (this.currentBoard = t, this.currentMoveIndex === -1)
+      this.isBlackTurn = !0;
+    else {
+      const e = this.history[this.currentMoveIndex], n = e.type === "move" ? e.move.color : e.color;
+      this.isBlackTurn = n === at;
+    }
+  }
+  undo() {
+    this.currentMoveIndex >= 0 && (this.currentMoveIndex--, this.rebuildBoard(), this.render());
+  }
+  redo() {
+    this.currentMoveIndex < this.history.length - 1 && (this.currentMoveIndex++, this.rebuildBoard(), this.render());
+  }
+  pass() {
+    this.history = this.history.slice(0, this.currentMoveIndex + 1);
+    const t = this.isBlackTurn ? J : at;
+    this.history.push({ type: "pass", color: t }), this.currentMoveIndex++, this.isBlackTurn = !this.isBlackTurn, this.render();
+  }
+  reset() {
+    this.history = [], this.currentMoveIndex = -1, this.currentBoard = this.initialBoard, this.isBlackTurn = !0, this.render();
+  }
+  render() {
+    const t = this.element, { rowCount: e, columnCount: n } = this.parsedBoard, i = ti(this.currentBoard, e, n), o = `turn-info-${Math.random().toString(36).substr(2, 9)}`, a = `undo-${Math.random().toString(36).substr(2, 9)}`, s = `redo-${Math.random().toString(36).substr(2, 9)}`, u = `pass-${Math.random().toString(36).substr(2, 9)}`, f = `reset-${Math.random().toString(36).substr(2, 9)}`;
+    let c = '<div class="freeplay-container">';
+    c += `<div id="${o}" style="margin-bottom: 1rem; padding: 0.5rem; font-weight: 600; font-size: 1.1rem;">${this.isBlackTurn ? "Black" : "White"} to play</div>`, c += i;
+    const h = "padding: 0.5rem 1rem; margin: 0.5rem 0.25rem; border: 1px solid #ccc; border-radius: 4px; background: #fff; cursor: pointer; font-size: 0.9rem;", p = "padding: 0.5rem 1rem; margin: 0.5rem 0.25rem; border: 1px solid #ccc; border-radius: 4px; background: #f0f0f0; cursor: not-allowed; font-size: 0.9rem; color: #999;";
+    c += '<div style="margin-top: 1rem;">', c += `<button id="${a}" style="${this.currentMoveIndex >= 0 ? h : p}" ${this.currentMoveIndex < 0 ? "disabled" : ""}>← Undo</button>`, c += `<button id="${s}" style="${this.currentMoveIndex < this.history.length - 1 ? h : p}" ${this.currentMoveIndex >= this.history.length - 1 ? "disabled" : ""}>Redo →</button>`, c += `<button id="${u}" style="${h}">Pass</button>`, c += `<button id="${f}" style="${h}">Reset</button>`, c += "</div>", c += "</div>", t.innerHTML = c;
+    const _ = t.querySelector("svg"), d = document.getElementById(a), v = document.getElementById(s), I = document.getElementById(u), y = document.getElementById(f);
+    _ && (_.style.cursor = "pointer", _.addEventListener("click", (m) => {
+      const l = m, g = _.getBoundingClientRect(), b = l.clientX - g.left, B = l.clientY - g.top, C = 30, E = C, pt = Math.round((b - E) / C), Tt = Math.round((B - E) / C);
+      if (Tt >= 0 && Tt < e && pt >= 0 && pt < n) {
+        const bt = fr(Tt, pt), Rt = this.isBlackTurn ? J : at, At = qt(bt, Rt);
+        Va(this.currentBoard, At) && (this.history = this.history.slice(0, this.currentMoveIndex + 1), this.history.push({ type: "move", move: At }), this.currentMoveIndex++, this.rebuildBoard(), this.render());
+      }
+    })), d && d.addEventListener("click", () => this.undo()), v && v.addEventListener("click", () => this.redo()), I && I.addEventListener("click", () => this.pass()), y && y.addEventListener("click", () => this.reset());
+  }
+}
+const uf = {
+  static: Qa,
+  freeplay: rs,
+  problem: ts
+}, hf = "0.0.0", ff = ".godash-diagram";
+function cf(r, t) {
+  const e = t.split(`
+`);
+  if (e.length === 0) {
+    r.innerHTML = wr("Empty diagram source");
+    return;
+  }
+  const n = e[0].trim();
+  try {
+    let i;
+    switch (n) {
+      case "static":
+        i = new Qa(r, e);
+        break;
+      case "freeplay":
+        i = new rs(r, e);
+        break;
+      case "problem":
+        i = new ts(r, e);
+        break;
+      default:
+        r.innerHTML = wr(`Unsupported diagram type "${n}". Supported types: ${Object.keys(uf).join(", ")}`);
+        return;
+    }
+    i.render();
+  } catch (i) {
+    i instanceof it ? r.innerHTML = wr(i.message) : r.innerHTML = wr(i instanceof Error ? i.message : String(i));
+  }
+}
+function pf(r, t) {
+  const e = r ?? ff, n = document.querySelectorAll(e);
+  if (n.length === 0)
+    throw new Error(`No elements found for selector: ${e}`);
+  n.forEach((i) => {
+    const o = t?.diagramSource ?? i.textContent ?? "";
+    cf(i, o);
+  });
+}
+export {
+  pf as init,
+  hf as version
+};