@nil-/xit 0.4.18 → 0.4.20

package/assets/svelte/reactivity.js

@@ -1,266 +1,289 @@
-var le = Object.getPrototypeOf;
-var de = Reflect.get;
-var ee = (o) => {
+var _s = Object.getPrototypeOf;
+var zs = Reflect.get;
+var is = (o) => {
   throw TypeError(o);
 };
-var H = (o, a, e) => a.has(o) || ee("Cannot " + e);
-var s = (o, a, e) => (H(o, a, "read from private field"), e ? e.call(o) : a.get(o)), n = (o, a, e) => a.has(o) ? ee("Cannot add the same private member more than once") : a instanceof WeakSet ? a.add(o) : a.set(o, e), b = (o, a, e, t) => (H(o, a, "write to private field"), t ? t.call(o, e) : a.set(o, e), e), d = (o, a, e) => (H(o, a, "access private method"), e);
-var se = (o, a, e) => de(le(o), e, a);
-import { b as p, f as te, g as r, d as re, k as ve, a as u, o as me } from "./index.js";
-import "./internal/client.js";
-import { i as f, c as ge } from "./store.js";
-var ie = !1, k, N, Q, V, oe;
-const X = class X extends Date {
+var Y = (o, n, s) => n.has(o) || is("Cannot " + s);
+var e = (o, n, s) => (Y(o, n, "read from private field"), s ? s.call(o) : n.get(o)), u = (o, n, s) => n.has(o) ? is("Cannot add the same private member more than once") : n instanceof WeakSet ? n.add(o) : n.set(o, s), P = (o, n, s, t) => (Y(o, n, "write to private field"), t ? t.call(o, s) : n.set(o, s), s), f = (o, n, s) => (Y(o, n, "access private method"), s);
+var hs = (o, n, s) => zs(_s(o), s, n);
+import { c9 as c, g as us, a4 as r, s as as, bL as ys, a1 as a, cB as V, a6 as ls, cC as l, cD as Ss } from "./store.js";
+import { o as bs } from "./internal/client.js";
+var ns = !1, W, T, G, H, ds;
+const ss = class ss extends Date {
   /** @param {any[]} params */
-  constructor(...e) {
-    super(...e);
-    n(this, V);
-    n(this, k, p(super.getTime()));
+  constructor(...s) {
+    super(...s);
+    u(this, H);
+    u(this, W, c(super.getTime()));
     /** @type {Map<keyof Date, Source<unknown>>} */
-    n(this, N, /* @__PURE__ */ new Map());
-    n(this, Q, te);
-    ie || d(this, V, oe).call(this);
+    u(this, T, /* @__PURE__ */ new Map());
+    u(this, G, us);
+    ns || f(this, H, ds).call(this);
   }
 };
-k = new WeakMap(), N = new WeakMap(), Q = new WeakMap(), V = new WeakSet(), oe = function() {
-  ie = !0;
-  var e = X.prototype, t = Date.prototype, i = (
+W = new WeakMap(), T = new WeakMap(), G = new WeakMap(), H = new WeakSet(), ds = function() {
+  ns = !0;
+  var s = ss.prototype, t = Date.prototype, i = (
     /** @type {Array<keyof Date & string>} */
     Object.getOwnPropertyNames(t)
   );
   for (const h of i)
-    (h.startsWith("get") || h.startsWith("to") || h === "valueOf") && (e[h] = function(...z) {
+    (h.startsWith("get") || h.startsWith("to") || h === "valueOf") && (s[h] = function(...z) {
       if (z.length > 0)
-        return r(s(this, k)), t[h].apply(this, z);
-      var _ = s(this, N).get(h);
-      if (_ === void 0) {
-        const M = te;
-        re(s(this, Q)), _ = ve(() => (r(s(this, k)), t[h].apply(this, z))), s(this, N).set(h, _), re(M);
+        return r(e(this, W)), t[h].apply(this, z);
+      var b = e(this, T).get(h);
+      if (b === void 0) {
+        const M = us;
+        as(e(this, G)), b = ys(() => (r(e(this, W)), t[h].apply(this, z))), e(this, T).set(h, b), as(M);
       }
-      return r(_);
-    }), h.startsWith("set") && (e[h] = function(...z) {
-      var _ = t[h].apply(this, z);
-      return u(s(this, k), t.getTime.call(this)), _;
+      return r(b);
+    }), h.startsWith("set") && (s[h] = function(...z) {
+      var b = t[h].apply(this, z);
+      return a(e(this, W), t.getTime.call(this)), b;
     });
 };
-let he = X;
-var we = ["forEach", "isDisjointFrom", "isSubsetOf", "isSupersetOf"], ze = ["difference", "intersection", "symmetricDifference", "union"], ue = !1, D, l, P, B, pe;
-const G = class G extends Set {
+let os = ss;
+var Ps = ["forEach", "isDisjointFrom", "isSubsetOf", "isSupersetOf"], xs = ["difference", "intersection", "symmetricDifference", "union"], ps = !1, $, d, x, I, k, vs, ms;
+const K = class K extends Set {
   /**
    * @param {Iterable<T> | null | undefined} [value]
    */
-  constructor(e) {
+  constructor(s) {
     super();
-    n(this, B);
+    u(this, k);
     /** @type {Map<T, Source<boolean>>} */
-    n(this, D, /* @__PURE__ */ new Map());
-    n(this, l, p(0));
-    n(this, P, p(0));
-    if (e) {
-      for (var t of e)
+    u(this, $, /* @__PURE__ */ new Map());
+    u(this, d, c(0));
+    u(this, x, c(0));
+    u(this, I, V || -1);
+    if (s) {
+      for (var t of s)
         super.add(t);
-      s(this, P).v = super.size;
+      e(this, x).v = super.size;
     }
-    ue || d(this, B, pe).call(this);
+    ps || f(this, k, ms).call(this);
   }
   /** @param {T} value */
-  has(e) {
-    var t = super.has(e), i = s(this, D), h = i.get(e);
+  has(s) {
+    var t = super.has(s), i = e(this, $), h = i.get(s);
     if (h === void 0) {
       if (!t)
-        return r(s(this, l)), !1;
-      h = p(!0), i.set(e, h);
+        return r(e(this, d)), !1;
+      h = f(this, k, vs).call(this, !0), i.set(s, h);
     }
     return r(h), t;
   }
   /** @param {T} value */
-  add(e) {
-    return super.has(e) || (super.add(e), u(s(this, P), super.size), f(s(this, l))), this;
+  add(s) {
+    return super.has(s) || (super.add(s), a(e(this, x), super.size), l(e(this, d))), this;
   }
   /** @param {T} value */
-  delete(e) {
-    var t = super.delete(e), i = s(this, D), h = i.get(e);
-    return h !== void 0 && (i.delete(e), u(h, !1)), t && (u(s(this, P), super.size), f(s(this, l))), t;
+  delete(s) {
+    var t = super.delete(s), i = e(this, $), h = i.get(s);
+    return h !== void 0 && (i.delete(s), a(h, !1)), t && (a(e(this, x), super.size), l(e(this, d))), t;
   }
   clear() {
     if (super.size !== 0) {
       super.clear();
-      var e = s(this, D);
-      for (var t of e.values())
-        u(t, !1);
-      e.clear(), u(s(this, P), 0), f(s(this, l));
+      var s = e(this, $);
+      for (var t of s.values())
+        a(t, !1);
+      s.clear(), a(e(this, x), 0), l(e(this, d));
     }
   }
   keys() {
     return this.values();
   }
   values() {
-    return r(s(this, l)), super.values();
+    return r(e(this, d)), super.values();
   }
   entries() {
-    return r(s(this, l)), super.entries();
+    return r(e(this, d)), super.entries();
   }
   [Symbol.iterator]() {
     return this.keys();
   }
   get size() {
-    return r(s(this, P));
+    return r(e(this, x));
   }
 };
-D = new WeakMap(), l = new WeakMap(), P = new WeakMap(), B = new WeakSet(), // We init as part of the first instance so that we can treeshake this class
-pe = function() {
-  ue = !0;
-  var e = G.prototype, t = Set.prototype;
-  for (const i of we)
-    e[i] = function(...h) {
-      return r(s(this, l)), t[i].apply(this, h);
+$ = new WeakMap(), d = new WeakMap(), x = new WeakMap(), I = new WeakMap(), k = new WeakSet(), /**
+ * If the source is being created inside the same reaction as the SvelteSet instance,
+ * we use `state` so that it will not be a dependency of the reaction. Otherwise we
+ * use `source` so it will be.
+ *
+ * @template T
+ * @param {T} value
+ * @returns {Source<T>}
+ */
+vs = function(s) {
+  return V === e(this, I) ? c(s) : ls(s);
+}, // We init as part of the first instance so that we can treeshake this class
+ms = function() {
+  ps = !0;
+  var s = K.prototype, t = Set.prototype;
+  for (const i of Ps)
+    s[i] = function(...h) {
+      return r(e(this, d)), t[i].apply(this, h);
     };
-  for (const i of ze)
-    e[i] = function(...h) {
-      r(s(this, l));
+  for (const i of xs)
+    s[i] = function(...h) {
+      r(e(this, d));
       var z = (
         /** @type {Set<T>} */
         t[i].apply(this, h)
       );
-      return new G(z);
+      return new K(z);
     };
 };
-let ae = G;
-var v, m, y, W, J;
-const Y = class Y extends Map {
+let cs = K;
+var m, g, y, X, v, C, Q;
+const es = class es extends Map {
   /**
    * @param {Iterable<readonly [K, V]> | null | undefined} [value]
    */
-  constructor(e) {
+  constructor(s) {
     super();
-    n(this, W);
+    u(this, v);
     /** @type {Map<K, Source<number>>} */
-    n(this, v, /* @__PURE__ */ new Map());
-    n(this, m, p(0));
-    n(this, y, p(0));
-    if (e) {
-      for (var [t, i] of e)
+    u(this, m, /* @__PURE__ */ new Map());
+    u(this, g, c(0));
+    u(this, y, c(0));
+    u(this, X, V || -1);
+    if (s) {
+      for (var [t, i] of s)
         super.set(t, i);
-      s(this, y).v = super.size;
+      e(this, y).v = super.size;
     }
   }
   /** @param {K} key */
-  has(e) {
-    var t = s(this, v), i = t.get(e);
-    if (i === void 0) {
-      var h = super.get(e);
-      if (h !== void 0)
-        i = p(0), t.set(e, i);
+  has(s) {
+    var t = e(this, m), i = t.get(s);
+    if (i === void 0)
+      if (super.has(s))
+        i = f(this, v, C).call(this, 0), t.set(s, i);
       else
-        return r(s(this, m)), !1;
-    }
+        return r(e(this, g)), !1;
     return r(i), !0;
   }
   /**
    * @param {(value: V, key: K, map: Map<K, V>) => void} callbackfn
    * @param {any} [this_arg]
    */
-  forEach(e, t) {
-    d(this, W, J).call(this), super.forEach(e, t);
+  forEach(s, t) {
+    f(this, v, Q).call(this), super.forEach(s, t);
   }
   /** @param {K} key */
-  get(e) {
-    var t = s(this, v), i = t.get(e);
-    if (i === void 0) {
-      var h = super.get(e);
-      if (h !== void 0)
-        i = p(0), t.set(e, i);
+  get(s) {
+    var t = e(this, m), i = t.get(s);
+    if (i === void 0)
+      if (super.has(s))
+        i = f(this, v, C).call(this, 0), t.set(s, i);
       else {
-        r(s(this, m));
+        r(e(this, g));
         return;
       }
-    }
-    return r(i), super.get(e);
+    return r(i), super.get(s);
   }
   /**
    * @param {K} key
    * @param {V} value
    * */
-  set(e, t) {
-    var q;
-    var i = s(this, v), h = i.get(e), z = super.get(e), _ = super.set(e, t), M = s(this, m);
+  set(s, t) {
+    var rs;
+    var i = e(this, m), h = i.get(s), z = super.get(s), b = super.set(s, t), M = e(this, g);
     if (h === void 0)
-      i.set(e, p(0)), u(s(this, y), super.size), f(M);
+      h = f(this, v, C).call(this, 0), i.set(s, h), a(e(this, y), super.size), l(M);
     else if (z !== t) {
-      f(h);
-      var Z = M.reactions === null ? null : new Set(M.reactions), ce = Z === null || !((q = h.reactions) != null && q.every(
-        (fe) => (
+      l(h);
+      var ts = M.reactions === null ? null : new Set(M.reactions), gs = ts === null || !((rs = h.reactions) != null && rs.every(
+        (ws) => (
           /** @type {NonNullable<typeof v_reactions>} */
-          Z.has(fe)
+          ts.has(ws)
         )
       ));
-      ce && f(M);
+      gs && l(M);
     }
-    return _;
+    return b;
   }
   /** @param {K} key */
-  delete(e) {
-    var t = s(this, v), i = t.get(e), h = super.delete(e);
-    return i !== void 0 && (t.delete(e), u(s(this, y), super.size), u(i, -1), f(s(this, m))), h;
+  delete(s) {
+    var t = e(this, m), i = t.get(s), h = super.delete(s);
+    return i !== void 0 && (t.delete(s), a(i, -1)), h && (a(e(this, y), super.size), l(e(this, g))), h;
   }
   clear() {
     if (super.size !== 0) {
       super.clear();
-      var e = s(this, v);
-      u(s(this, y), 0);
-      for (var t of e.values())
-        u(t, -1);
-      f(s(this, m)), e.clear();
+      var s = e(this, m);
+      a(e(this, y), 0);
+      for (var t of s.values())
+        a(t, -1);
+      l(e(this, g)), s.clear();
     }
   }
   keys() {
-    return r(s(this, m)), super.keys();
+    return r(e(this, g)), super.keys();
   }
   values() {
-    return d(this, W, J).call(this), super.values();
+    return f(this, v, Q).call(this), super.values();
   }
   entries() {
-    return d(this, W, J).call(this), super.entries();
+    return f(this, v, Q).call(this), super.entries();
   }
   [Symbol.iterator]() {
     return this.entries();
   }
   get size() {
-    return r(s(this, y)), super.size;
+    return r(e(this, y)), super.size;
   }
 };
-v = new WeakMap(), m = new WeakMap(), y = new WeakMap(), W = new WeakSet(), J = function() {
-  r(s(this, m));
-  var e = s(this, v);
-  if (s(this, y).v !== e.size)
-    for (var t of se(Y.prototype, this, "keys").call(this))
-      e.has(t) || e.set(t, p(0));
-  for (var [, i] of s(this, v))
+m = new WeakMap(), g = new WeakMap(), y = new WeakMap(), X = new WeakMap(), v = new WeakSet(), /**
+ * If the source is being created inside the same reaction as the SvelteMap instance,
+ * we use `state` so that it will not be a dependency of the reaction. Otherwise we
+ * use `source` so it will be.
+ *
+ * @template T
+ * @param {T} value
+ * @returns {Source<T>}
+ */
+C = function(s) {
+  return V === e(this, X) ? c(s) : ls(s);
+}, Q = function() {
+  r(e(this, g));
+  var s = e(this, m);
+  if (e(this, y).v !== s.size) {
+    for (var t of hs(es.prototype, this, "keys").call(this))
+      if (!s.has(t)) {
+        var i = f(this, v, C).call(this, 0);
+        s.set(t, i);
+      }
+  }
+  for ([, i] of e(this, m))
     r(i);
 };
-let ne = Y;
-const I = Symbol();
-var c, T, S, R, $;
-class ye extends URLSearchParams {
+let fs = es;
+const Z = Symbol();
+var p, B, S, R, N;
+class Ls extends URLSearchParams {
   constructor() {
     super(...arguments);
-    n(this, R);
-    n(this, c, p(0));
-    n(this, T, Se());
-    n(this, S, !1);
+    u(this, R);
+    u(this, p, c(0));
+    u(this, B, Rs());
+    u(this, S, !1);
   }
   /**
    * @param {URLSearchParams} params
    * @internal
    */
-  [I](e) {
-    if (!s(this, S)) {
-      b(this, S, !0);
+  [Z](s) {
+    if (!e(this, S)) {
+      P(this, S, !0);
       for (const t of [...super.keys()])
         super.delete(t);
-      for (const [t, i] of e)
+      for (const [t, i] of s)
         super.append(t, i);
-      f(s(this, c)), b(this, S, !1);
+      l(e(this, p)), P(this, S, !1);
     }
   }
   /**
@@ -268,166 +291,166 @@ class ye extends URLSearchParams {
    * @param {string} value
    * @returns {void}
    */
-  append(e, t) {
-    super.append(e, t), d(this, R, $).call(this), f(s(this, c));
+  append(s, t) {
+    super.append(s, t), f(this, R, N).call(this), l(e(this, p));
   }
   /**
    * @param {string} name
    * @param {string=} value
    * @returns {void}
    */
-  delete(e, t) {
-    var i = super.has(e, t);
-    super.delete(e, t), i && (d(this, R, $).call(this), f(s(this, c)));
+  delete(s, t) {
+    var i = super.has(s, t);
+    super.delete(s, t), i && (f(this, R, N).call(this), l(e(this, p)));
   }
   /**
    * @param {string} name
    * @returns {string|null}
    */
-  get(e) {
-    return r(s(this, c)), super.get(e);
+  get(s) {
+    return r(e(this, p)), super.get(s);
   }
   /**
    * @param {string} name
    * @returns {string[]}
    */
-  getAll(e) {
-    return r(s(this, c)), super.getAll(e);
+  getAll(s) {
+    return r(e(this, p)), super.getAll(s);
   }
   /**
    * @param {string} name
    * @param {string=} value
    * @returns {boolean}
    */
-  has(e, t) {
-    return r(s(this, c)), super.has(e, t);
+  has(s, t) {
+    return r(e(this, p)), super.has(s, t);
   }
   keys() {
-    return r(s(this, c)), super.keys();
+    return r(e(this, p)), super.keys();
   }
   /**
    * @param {string} name
    * @param {string} value
    * @returns {void}
    */
-  set(e, t) {
-    var i = super.getAll(e).join("");
-    super.set(e, t), i !== super.getAll(e).join("") && (d(this, R, $).call(this), f(s(this, c)));
+  set(s, t) {
+    var i = super.getAll(s).join("");
+    super.set(s, t), i !== super.getAll(s).join("") && (f(this, R, N).call(this), l(e(this, p)));
   }
   sort() {
-    super.sort(), d(this, R, $).call(this), f(s(this, c));
+    super.sort(), f(this, R, N).call(this), l(e(this, p));
   }
   toString() {
-    return r(s(this, c)), super.toString();
+    return r(e(this, p)), super.toString();
   }
   values() {
-    return r(s(this, c)), super.values();
+    return r(e(this, p)), super.values();
   }
   entries() {
-    return r(s(this, c)), super.entries();
+    return r(e(this, p)), super.entries();
   }
   [Symbol.iterator]() {
     return this.entries();
   }
   get size() {
-    return r(s(this, c)), super.size;
+    return r(e(this, p)), super.size;
   }
 }
-c = new WeakMap(), T = new WeakMap(), S = new WeakMap(), R = new WeakSet(), $ = function() {
-  if (!s(this, T) || s(this, S)) return;
-  b(this, S, !0);
-  const e = this.toString();
-  s(this, T).search = e && `?${e}`, b(this, S, !1);
+p = new WeakMap(), B = new WeakMap(), S = new WeakMap(), R = new WeakSet(), N = function() {
+  if (!e(this, B) || e(this, S)) return;
+  P(this, S, !0);
+  const s = this.toString();
+  e(this, B).search = s && `?${s}`, P(this, S, !1);
 };
-let K = null;
-function Se() {
-  return K;
+let q = null;
+function Rs() {
+  return q;
 }
-var x, L, O, g, w, A, E, U, j;
-class Ae extends URL {
+var L, O, A, w, _, E, U, j, D;
+class Ms extends URL {
   /**
    * @param {string | URL} url
    * @param {string | URL} [base]
    */
-  constructor(e, t) {
-    e = new URL(e, t);
-    super(e);
-    n(this, x, p(super.protocol));
-    n(this, L, p(super.username));
-    n(this, O, p(super.password));
-    n(this, g, p(super.hostname));
-    n(this, w, p(super.port));
-    n(this, A, p(super.pathname));
-    n(this, E, p(super.hash));
-    n(this, U, p(super.search));
-    n(this, j);
-    K = this, b(this, j, new ye(e.searchParams)), K = null;
+  constructor(s, t) {
+    s = new URL(s, t);
+    super(s);
+    u(this, L, c(super.protocol));
+    u(this, O, c(super.username));
+    u(this, A, c(super.password));
+    u(this, w, c(super.hostname));
+    u(this, _, c(super.port));
+    u(this, E, c(super.pathname));
+    u(this, U, c(super.hash));
+    u(this, j, c(super.search));
+    u(this, D);
+    q = this, P(this, D, new Ls(s.searchParams)), q = null;
   }
   get hash() {
-    return r(s(this, E));
+    return r(e(this, U));
   }
-  set hash(e) {
-    super.hash = e, u(s(this, E), super.hash);
+  set hash(s) {
+    super.hash = s, a(e(this, U), super.hash);
   }
   get host() {
-    return r(s(this, g)), r(s(this, w)), super.host;
+    return r(e(this, w)), r(e(this, _)), super.host;
   }
-  set host(e) {
-    super.host = e, u(s(this, g), super.hostname), u(s(this, w), super.port);
+  set host(s) {
+    super.host = s, a(e(this, w), super.hostname), a(e(this, _), super.port);
   }
   get hostname() {
-    return r(s(this, g));
+    return r(e(this, w));
   }
-  set hostname(e) {
-    super.hostname = e, u(s(this, g), super.hostname);
+  set hostname(s) {
+    super.hostname = s, a(e(this, w), super.hostname);
   }
   get href() {
-    return r(s(this, x)), r(s(this, L)), r(s(this, O)), r(s(this, g)), r(s(this, w)), r(s(this, A)), r(s(this, E)), r(s(this, U)), super.href;
+    return r(e(this, L)), r(e(this, O)), r(e(this, A)), r(e(this, w)), r(e(this, _)), r(e(this, E)), r(e(this, U)), r(e(this, j)), super.href;
   }
-  set href(e) {
-    super.href = e, u(s(this, x), super.protocol), u(s(this, L), super.username), u(s(this, O), super.password), u(s(this, g), super.hostname), u(s(this, w), super.port), u(s(this, A), super.pathname), u(s(this, E), super.hash), u(s(this, U), super.search), s(this, j)[I](super.searchParams);
+  set href(s) {
+    super.href = s, a(e(this, L), super.protocol), a(e(this, O), super.username), a(e(this, A), super.password), a(e(this, w), super.hostname), a(e(this, _), super.port), a(e(this, E), super.pathname), a(e(this, U), super.hash), a(e(this, j), super.search), e(this, D)[Z](super.searchParams);
   }
   get password() {
-    return r(s(this, O));
+    return r(e(this, A));
   }
-  set password(e) {
-    super.password = e, u(s(this, O), super.password);
+  set password(s) {
+    super.password = s, a(e(this, A), super.password);
   }
   get pathname() {
-    return r(s(this, A));
+    return r(e(this, E));
   }
-  set pathname(e) {
-    super.pathname = e, u(s(this, A), super.pathname);
+  set pathname(s) {
+    super.pathname = s, a(e(this, E), super.pathname);
   }
   get port() {
-    return r(s(this, w));
+    return r(e(this, _));
   }
-  set port(e) {
-    super.port = e, u(s(this, w), super.port);
+  set port(s) {
+    super.port = s, a(e(this, _), super.port);
   }
   get protocol() {
-    return r(s(this, x));
+    return r(e(this, L));
   }
-  set protocol(e) {
-    super.protocol = e, u(s(this, x), super.protocol);
+  set protocol(s) {
+    super.protocol = s, a(e(this, L), super.protocol);
   }
   get search() {
-    return r(s(this, U));
+    return r(e(this, j));
   }
-  set search(e) {
-    super.search = e, u(s(this, U), e), s(this, j)[I](super.searchParams);
+  set search(s) {
+    super.search = s, a(e(this, j), super.search), e(this, D)[Z](super.searchParams);
   }
   get username() {
-    return r(s(this, L));
+    return r(e(this, O));
   }
-  set username(e) {
-    super.username = e, u(s(this, L), super.username);
+  set username(s) {
+    super.username = s, a(e(this, O), super.username);
   }
   get origin() {
-    return r(s(this, x)), r(s(this, g)), r(s(this, w)), super.origin;
+    return r(e(this, L)), r(e(this, w)), r(e(this, _)), super.origin;
   }
   get searchParams() {
-    return s(this, j);
+    return e(this, D);
   }
   toString() {
     return this.href;
@@ -436,46 +459,46 @@ class Ae extends URL {
     return this.href;
   }
 }
-x = new WeakMap(), L = new WeakMap(), O = new WeakMap(), g = new WeakMap(), w = new WeakMap(), A = new WeakMap(), E = new WeakMap(), U = new WeakMap(), j = new WeakMap();
-var C, F;
-class _e {
+L = new WeakMap(), O = new WeakMap(), A = new WeakMap(), w = new WeakMap(), _ = new WeakMap(), E = new WeakMap(), U = new WeakMap(), j = new WeakMap(), D = new WeakMap();
+var F, J;
+class Os {
   /**
    *
    * @param {() => T} fn
    * @param {(update: () => void) => void} onsubscribe
    */
-  constructor(a, e) {
-    n(this, C);
-    n(this, F);
-    b(this, C, a), b(this, F, ge(e));
+  constructor(n, s) {
+    u(this, F);
+    u(this, J);
+    P(this, F, n), P(this, J, Ss(s));
   }
   get current() {
-    return s(this, F).call(this), s(this, C).call(this);
+    return e(this, J).call(this), e(this, F).call(this);
   }
 }
-C = new WeakMap(), F = new WeakMap();
-const be = /\(.+\)/, Pe = /* @__PURE__ */ new Set(["all", "print", "screen", "and", "or", "not", "only"]);
-class Ee extends _e {
+F = new WeakMap(), J = new WeakMap();
+const As = /\(.+\)/, Es = /* @__PURE__ */ new Set(["all", "print", "screen", "and", "or", "not", "only"]);
+class Ws extends Os {
   /**
    * @param {string} query A media query string
    * @param {boolean} [fallback] Fallback value for the server
    */
-  constructor(a, e) {
-    let t = be.test(a) || // we need to use `some` here because technically this `window.matchMedia('random,screen')` still returns true
-    a.split(/[\s,]+/).some((h) => Pe.has(h.trim())) ? a : `(${a})`;
+  constructor(n, s) {
+    let t = As.test(n) || // we need to use `some` here because technically this `window.matchMedia('random,screen')` still returns true
+    n.split(/[\s,]+/).some((h) => Es.has(h.trim())) ? n : `(${n})`;
     const i = window.matchMedia(t);
     super(
       () => i.matches,
-      (h) => me(i, "change", h)
+      (h) => bs(i, "change", h)
     );
   }
 }
 export {
-  Ee as MediaQuery,
-  he as SvelteDate,
-  ne as SvelteMap,
-  ae as SvelteSet,
-  Ae as SvelteURL,
-  ye as SvelteURLSearchParams,
-  ge as createSubscriber
+  Ws as MediaQuery,
+  os as SvelteDate,
+  fs as SvelteMap,
+  cs as SvelteSet,
+  Ms as SvelteURL,
+  Ls as SvelteURLSearchParams,
+  Ss as createSubscriber
 };