@milaboratories/uikit 2.2.90 → 2.2.92

package/dist/node_modules/.pnpm/@vueuse_shared@13.3.0_vue@3.5.13_typescript@5.6.3_/node_modules/@vueuse/shared/index.js

@@ -0,0 +1,94 @@
+import { ref as w, toValue as a, watch as p, shallowReadonly as h, shallowRef as T, getCurrentScope as y, onScopeDispose as D } from "vue";
+function P(t) {
+  return y() ? (D(t), !0) : !1;
+}
+const S = typeof window < "u" && typeof document < "u";
+typeof WorkerGlobalScope < "u" && globalThis instanceof WorkerGlobalScope;
+const d = () => {
+};
+function g(t, r) {
+  function n(...e) {
+    return new Promise((i, o) => {
+      Promise.resolve(t(() => r.apply(this, e), { fn: r, thisArg: this, args: e })).then(i).catch(o);
+    });
+  }
+  return n;
+}
+function v(t, r = {}) {
+  let n, e, i = d;
+  const o = (l) => {
+    clearTimeout(l), i(), i = d;
+  };
+  let u;
+  return (l) => {
+    const s = a(t), c = a(r.maxWait);
+    return n && o(n), s <= 0 || c !== void 0 && c <= 0 ? (e && (o(e), e = null), Promise.resolve(l())) : new Promise((m, b) => {
+      i = r.rejectOnCancel ? b : m, u = l, c && !e && (e = setTimeout(() => {
+        n && o(n), e = null, m(u());
+      }, c)), n = setTimeout(() => {
+        e && o(e), e = null, m(l());
+      }, s);
+    });
+  };
+}
+function x(t, r = 200, n = {}) {
+  return g(
+    v(r, n),
+    t
+  );
+}
+function F(t, r = 200, n = {}) {
+  const e = w(a(t)), i = x(() => {
+    e.value = t.value;
+  }, r, n);
+  return p(t, () => i()), h(e);
+}
+function R(t, r, n = {}) {
+  const {
+    immediate: e = !0,
+    immediateCallback: i = !1
+  } = n, o = T(!1);
+  let u = null;
+  function f() {
+    u && (clearTimeout(u), u = null);
+  }
+  function l() {
+    o.value = !1, f();
+  }
+  function s(...c) {
+    i && t(), f(), o.value = !0, u = setTimeout(() => {
+      o.value = !1, u = null, t(...c);
+    }, a(r));
+  }
+  return e && (o.value = !0, S && s()), P(l), {
+    isPending: h(o),
+    start: s,
+    stop: l
+  };
+}
+function W(t, r, n) {
+  return p(
+    t,
+    (i, o, u) => {
+      i && r(i, o, u);
+    },
+    {
+      ...n,
+      once: !1
+    }
+  );
+}
+export {
+  g as createFilterWrapper,
+  v as debounceFilter,
+  F as debouncedRef,
+  S as isClient,
+  d as noop,
+  F as refDebounced,
+  P as tryOnScopeDispose,
+  F as useDebounce,
+  x as useDebounceFn,
+  R as useTimeoutFn,
+  W as whenever
+};
+//# sourceMappingURL=index.js.map

package/dist/node_modules/.pnpm/@vueuse_shared@13.3.0_vue@3.5.13_typescript@5.6.3_/node_modules/@vueuse/shared/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../../../../../../../../node_modules/.pnpm/@vueuse+shared@13.3.0_vue@3.5.13_typescript@5.6.3_/node_modules/@vueuse/shared/index.mjs"],"sourcesContent":["import { shallowRef, watchEffect, readonly, watch, customRef, getCurrentScope, onScopeDispose, effectScope, getCurrentInstance, hasInjectionContext, inject, provide, ref, isRef, unref, toValue as toValue$1, computed, reactive, toRefs as toRefs$1, toRef as toRef$1, shallowReadonly, onBeforeMount, nextTick, onBeforeUnmount, onMounted, onUnmounted, isReactive } from 'vue';\n\nfunction computedEager(fn, options) {\n  var _a;\n  const result = shallowRef();\n  watchEffect(() => {\n    result.value = fn();\n  }, {\n    ...options,\n    flush: (_a = options == null ? void 0 : options.flush) != null ? _a : \"sync\"\n  });\n  return readonly(result);\n}\n\nfunction computedWithControl(source, fn) {\n  let v = void 0;\n  let track;\n  let trigger;\n  const dirty = shallowRef(true);\n  const update = () => {\n    dirty.value = true;\n    trigger();\n  };\n  watch(source, update, { flush: \"sync\" });\n  const get = typeof fn === \"function\" ? fn : fn.get;\n  const set = typeof fn === \"function\" ? void 0 : fn.set;\n  const result = customRef((_track, _trigger) => {\n    track = _track;\n    trigger = _trigger;\n    return {\n      get() {\n        if (dirty.value) {\n          v = get(v);\n          dirty.value = false;\n        }\n        track();\n        return v;\n      },\n      set(v2) {\n        set == null ? void 0 : set(v2);\n      }\n    };\n  });\n  if (Object.isExtensible(result))\n    result.trigger = update;\n  return result;\n}\n\nfunction tryOnScopeDispose(fn) {\n  if (getCurrentScope()) {\n    onScopeDispose(fn);\n    return true;\n  }\n  return false;\n}\n\nfunction createEventHook() {\n  const fns = /* @__PURE__ */ new Set();\n  const off = (fn) => {\n    fns.delete(fn);\n  };\n  const clear = () => {\n    fns.clear();\n  };\n  const on = (fn) => {\n    fns.add(fn);\n    const offFn = () => off(fn);\n    tryOnScopeDispose(offFn);\n    return {\n      off: offFn\n    };\n  };\n  const trigger = (...args) => {\n    return Promise.all(Array.from(fns).map((fn) => fn(...args)));\n  };\n  return {\n    on,\n    off,\n    trigger,\n    clear\n  };\n}\n\nfunction createGlobalState(stateFactory) {\n  let initialized = false;\n  let state;\n  const scope = effectScope(true);\n  return (...args) => {\n    if (!initialized) {\n      state = scope.run(() => stateFactory(...args));\n      initialized = true;\n    }\n    return state;\n  };\n}\n\nconst localProvidedStateMap = /* @__PURE__ */ new WeakMap();\n\nconst injectLocal = (...args) => {\n  var _a;\n  const key = args[0];\n  const instance = (_a = getCurrentInstance()) == null ? void 0 : _a.proxy;\n  if (instance == null && !hasInjectionContext())\n    throw new Error(\"injectLocal must be called in setup\");\n  if (instance && localProvidedStateMap.has(instance) && key in localProvidedStateMap.get(instance))\n    return localProvidedStateMap.get(instance)[key];\n  return inject(...args);\n};\n\nfunction provideLocal(key, value) {\n  var _a;\n  const instance = (_a = getCurrentInstance()) == null ? void 0 : _a.proxy;\n  if (instance == null)\n    throw new Error(\"provideLocal must be called in setup\");\n  if (!localProvidedStateMap.has(instance))\n    localProvidedStateMap.set(instance, /* @__PURE__ */ Object.create(null));\n  const localProvidedState = localProvidedStateMap.get(instance);\n  localProvidedState[key] = value;\n  return provide(key, value);\n}\n\nfunction createInjectionState(composable, options) {\n  const key = (options == null ? void 0 : options.injectionKey) || Symbol(composable.name || \"InjectionState\");\n  const defaultValue = options == null ? void 0 : options.defaultValue;\n  const useProvidingState = (...args) => {\n    const state = composable(...args);\n    provideLocal(key, state);\n    return state;\n  };\n  const useInjectedState = () => injectLocal(key, defaultValue);\n  return [useProvidingState, useInjectedState];\n}\n\nfunction createRef(value, deep) {\n  if (deep === true) {\n    return ref(value);\n  } else {\n    return shallowRef(value);\n  }\n}\n\nfunction createSharedComposable(composable) {\n  let subscribers = 0;\n  let state;\n  let scope;\n  const dispose = () => {\n    subscribers -= 1;\n    if (scope && subscribers <= 0) {\n      scope.stop();\n      state = void 0;\n      scope = void 0;\n    }\n  };\n  return (...args) => {\n    subscribers += 1;\n    if (!scope) {\n      scope = effectScope(true);\n      state = scope.run(() => composable(...args));\n    }\n    tryOnScopeDispose(dispose);\n    return state;\n  };\n}\n\nfunction extendRef(ref, extend, { enumerable = false, unwrap = true } = {}) {\n  for (const [key, value] of Object.entries(extend)) {\n    if (key === \"value\")\n      continue;\n    if (isRef(value) && unwrap) {\n      Object.defineProperty(ref, key, {\n        get() {\n          return value.value;\n        },\n        set(v) {\n          value.value = v;\n        },\n        enumerable\n      });\n    } else {\n      Object.defineProperty(ref, key, { value, enumerable });\n    }\n  }\n  return ref;\n}\n\nfunction get(obj, key) {\n  if (key == null)\n    return unref(obj);\n  return unref(obj)[key];\n}\n\nfunction isDefined(v) {\n  return unref(v) != null;\n}\n\nfunction makeDestructurable(obj, arr) {\n  if (typeof Symbol !== \"undefined\") {\n    const clone = { ...obj };\n    Object.defineProperty(clone, Symbol.iterator, {\n      enumerable: false,\n      value() {\n        let index = 0;\n        return {\n          next: () => ({\n            value: arr[index++],\n            done: index > arr.length\n          })\n        };\n      }\n    });\n    return clone;\n  } else {\n    return Object.assign([...arr], obj);\n  }\n}\n\nfunction reactify(fn, options) {\n  const unrefFn = (options == null ? void 0 : options.computedGetter) === false ? unref : toValue$1;\n  return function(...args) {\n    return computed(() => fn.apply(this, args.map((i) => unrefFn(i))));\n  };\n}\n\nfunction reactifyObject(obj, optionsOrKeys = {}) {\n  let keys = [];\n  let options;\n  if (Array.isArray(optionsOrKeys)) {\n    keys = optionsOrKeys;\n  } else {\n    options = optionsOrKeys;\n    const { includeOwnProperties = true } = optionsOrKeys;\n    keys.push(...Object.keys(obj));\n    if (includeOwnProperties)\n      keys.push(...Object.getOwnPropertyNames(obj));\n  }\n  return Object.fromEntries(\n    keys.map((key) => {\n      const value = obj[key];\n      return [\n        key,\n        typeof value === \"function\" ? reactify(value.bind(obj), options) : value\n      ];\n    })\n  );\n}\n\nfunction toReactive(objectRef) {\n  if (!isRef(objectRef))\n    return reactive(objectRef);\n  const proxy = new Proxy({}, {\n    get(_, p, receiver) {\n      return unref(Reflect.get(objectRef.value, p, receiver));\n    },\n    set(_, p, value) {\n      if (isRef(objectRef.value[p]) && !isRef(value))\n        objectRef.value[p].value = value;\n      else\n        objectRef.value[p] = value;\n      return true;\n    },\n    deleteProperty(_, p) {\n      return Reflect.deleteProperty(objectRef.value, p);\n    },\n    has(_, p) {\n      return Reflect.has(objectRef.value, p);\n    },\n    ownKeys() {\n      return Object.keys(objectRef.value);\n    },\n    getOwnPropertyDescriptor() {\n      return {\n        enumerable: true,\n        configurable: true\n      };\n    }\n  });\n  return reactive(proxy);\n}\n\nfunction reactiveComputed(fn) {\n  return toReactive(computed(fn));\n}\n\nfunction reactiveOmit(obj, ...keys) {\n  const flatKeys = keys.flat();\n  const predicate = flatKeys[0];\n  return reactiveComputed(() => typeof predicate === \"function\" ? Object.fromEntries(Object.entries(toRefs$1(obj)).filter(([k, v]) => !predicate(toValue$1(v), k))) : Object.fromEntries(Object.entries(toRefs$1(obj)).filter((e) => !flatKeys.includes(e[0]))));\n}\n\nconst isClient = typeof window !== \"undefined\" && typeof document !== \"undefined\";\nconst isWorker = typeof WorkerGlobalScope !== \"undefined\" && globalThis instanceof WorkerGlobalScope;\nconst isDef = (val) => typeof val !== \"undefined\";\nconst notNullish = (val) => val != null;\nconst assert = (condition, ...infos) => {\n  if (!condition)\n    console.warn(...infos);\n};\nconst toString = Object.prototype.toString;\nconst isObject = (val) => toString.call(val) === \"[object Object]\";\nconst now = () => Date.now();\nconst timestamp = () => +Date.now();\nconst clamp = (n, min, max) => Math.min(max, Math.max(min, n));\nconst noop = () => {\n};\nconst rand = (min, max) => {\n  min = Math.ceil(min);\n  max = Math.floor(max);\n  return Math.floor(Math.random() * (max - min + 1)) + min;\n};\nconst hasOwn = (val, key) => Object.prototype.hasOwnProperty.call(val, key);\nconst isIOS = /* @__PURE__ */ getIsIOS();\nfunction getIsIOS() {\n  var _a, _b;\n  return isClient && ((_a = window == null ? void 0 : window.navigator) == null ? void 0 : _a.userAgent) && (/iP(?:ad|hone|od)/.test(window.navigator.userAgent) || ((_b = window == null ? void 0 : window.navigator) == null ? void 0 : _b.maxTouchPoints) > 2 && /iPad|Macintosh/.test(window == null ? void 0 : window.navigator.userAgent));\n}\n\nfunction toRef(...args) {\n  if (args.length !== 1)\n    return toRef$1(...args);\n  const r = args[0];\n  return typeof r === \"function\" ? readonly(customRef(() => ({ get: r, set: noop }))) : ref(r);\n}\nconst resolveRef = toRef;\n\nfunction reactivePick(obj, ...keys) {\n  const flatKeys = keys.flat();\n  const predicate = flatKeys[0];\n  return reactiveComputed(() => typeof predicate === \"function\" ? Object.fromEntries(Object.entries(toRefs$1(obj)).filter(([k, v]) => predicate(toValue$1(v), k))) : Object.fromEntries(flatKeys.map((k) => [k, toRef(obj, k)])));\n}\n\nfunction refAutoReset(defaultValue, afterMs = 1e4) {\n  return customRef((track, trigger) => {\n    let value = toValue$1(defaultValue);\n    let timer;\n    const resetAfter = () => setTimeout(() => {\n      value = toValue$1(defaultValue);\n      trigger();\n    }, toValue$1(afterMs));\n    tryOnScopeDispose(() => {\n      clearTimeout(timer);\n    });\n    return {\n      get() {\n        track();\n        return value;\n      },\n      set(newValue) {\n        value = newValue;\n        trigger();\n        clearTimeout(timer);\n        timer = resetAfter();\n      }\n    };\n  });\n}\n\nfunction createFilterWrapper(filter, fn) {\n  function wrapper(...args) {\n    return new Promise((resolve, reject) => {\n      Promise.resolve(filter(() => fn.apply(this, args), { fn, thisArg: this, args })).then(resolve).catch(reject);\n    });\n  }\n  return wrapper;\n}\nconst bypassFilter = (invoke) => {\n  return invoke();\n};\nfunction debounceFilter(ms, options = {}) {\n  let timer;\n  let maxTimer;\n  let lastRejector = noop;\n  const _clearTimeout = (timer2) => {\n    clearTimeout(timer2);\n    lastRejector();\n    lastRejector = noop;\n  };\n  let lastInvoker;\n  const filter = (invoke) => {\n    const duration = toValue$1(ms);\n    const maxDuration = toValue$1(options.maxWait);\n    if (timer)\n      _clearTimeout(timer);\n    if (duration <= 0 || maxDuration !== void 0 && maxDuration <= 0) {\n      if (maxTimer) {\n        _clearTimeout(maxTimer);\n        maxTimer = null;\n      }\n      return Promise.resolve(invoke());\n    }\n    return new Promise((resolve, reject) => {\n      lastRejector = options.rejectOnCancel ? reject : resolve;\n      lastInvoker = invoke;\n      if (maxDuration && !maxTimer) {\n        maxTimer = setTimeout(() => {\n          if (timer)\n            _clearTimeout(timer);\n          maxTimer = null;\n          resolve(lastInvoker());\n        }, maxDuration);\n      }\n      timer = setTimeout(() => {\n        if (maxTimer)\n          _clearTimeout(maxTimer);\n        maxTimer = null;\n        resolve(invoke());\n      }, duration);\n    });\n  };\n  return filter;\n}\nfunction throttleFilter(...args) {\n  let lastExec = 0;\n  let timer;\n  let isLeading = true;\n  let lastRejector = noop;\n  let lastValue;\n  let ms;\n  let trailing;\n  let leading;\n  let rejectOnCancel;\n  if (!isRef(args[0]) && typeof args[0] === \"object\")\n    ({ delay: ms, trailing = true, leading = true, rejectOnCancel = false } = args[0]);\n  else\n    [ms, trailing = true, leading = true, rejectOnCancel = false] = args;\n  const clear = () => {\n    if (timer) {\n      clearTimeout(timer);\n      timer = void 0;\n      lastRejector();\n      lastRejector = noop;\n    }\n  };\n  const filter = (_invoke) => {\n    const duration = toValue$1(ms);\n    const elapsed = Date.now() - lastExec;\n    const invoke = () => {\n      return lastValue = _invoke();\n    };\n    clear();\n    if (duration <= 0) {\n      lastExec = Date.now();\n      return invoke();\n    }\n    if (elapsed > duration && (leading || !isLeading)) {\n      lastExec = Date.now();\n      invoke();\n    } else if (trailing) {\n      lastValue = new Promise((resolve, reject) => {\n        lastRejector = rejectOnCancel ? reject : resolve;\n        timer = setTimeout(() => {\n          lastExec = Date.now();\n          isLeading = true;\n          resolve(invoke());\n          clear();\n        }, Math.max(0, duration - elapsed));\n      });\n    }\n    if (!leading && !timer)\n      timer = setTimeout(() => isLeading = true, duration);\n    isLeading = false;\n    return lastValue;\n  };\n  return filter;\n}\nfunction pausableFilter(extendFilter = bypassFilter, options = {}) {\n  const {\n    initialState = \"active\"\n  } = options;\n  const isActive = toRef(initialState === \"active\");\n  function pause() {\n    isActive.value = false;\n  }\n  function resume() {\n    isActive.value = true;\n  }\n  const eventFilter = (...args) => {\n    if (isActive.value)\n      extendFilter(...args);\n  };\n  return { isActive: readonly(isActive), pause, resume, eventFilter };\n}\n\nfunction promiseTimeout(ms, throwOnTimeout = false, reason = \"Timeout\") {\n  return new Promise((resolve, reject) => {\n    if (throwOnTimeout)\n      setTimeout(() => reject(reason), ms);\n    else\n      setTimeout(resolve, ms);\n  });\n}\nfunction identity(arg) {\n  return arg;\n}\nfunction createSingletonPromise(fn) {\n  let _promise;\n  function wrapper() {\n    if (!_promise)\n      _promise = fn();\n    return _promise;\n  }\n  wrapper.reset = async () => {\n    const _prev = _promise;\n    _promise = void 0;\n    if (_prev)\n      await _prev;\n  };\n  return wrapper;\n}\nfunction invoke(fn) {\n  return fn();\n}\nfunction containsProp(obj, ...props) {\n  return props.some((k) => k in obj);\n}\nfunction increaseWithUnit(target, delta) {\n  var _a;\n  if (typeof target === \"number\")\n    return target + delta;\n  const value = ((_a = target.match(/^-?\\d+\\.?\\d*/)) == null ? void 0 : _a[0]) || \"\";\n  const unit = target.slice(value.length);\n  const result = Number.parseFloat(value) + delta;\n  if (Number.isNaN(result))\n    return target;\n  return result + unit;\n}\nfunction pxValue(px) {\n  return px.endsWith(\"rem\") ? Number.parseFloat(px) * 16 : Number.parseFloat(px);\n}\nfunction objectPick(obj, keys, omitUndefined = false) {\n  return keys.reduce((n, k) => {\n    if (k in obj) {\n      if (!omitUndefined || obj[k] !== void 0)\n        n[k] = obj[k];\n    }\n    return n;\n  }, {});\n}\nfunction objectOmit(obj, keys, omitUndefined = false) {\n  return Object.fromEntries(Object.entries(obj).filter(([key, value]) => {\n    return (!omitUndefined || value !== void 0) && !keys.includes(key);\n  }));\n}\nfunction objectEntries(obj) {\n  return Object.entries(obj);\n}\nfunction toArray(value) {\n  return Array.isArray(value) ? value : [value];\n}\n\nfunction cacheStringFunction(fn) {\n  const cache = /* @__PURE__ */ Object.create(null);\n  return (str) => {\n    const hit = cache[str];\n    return hit || (cache[str] = fn(str));\n  };\n}\nconst hyphenateRE = /\\B([A-Z])/g;\nconst hyphenate = cacheStringFunction((str) => str.replace(hyphenateRE, \"-$1\").toLowerCase());\nconst camelizeRE = /-(\\w)/g;\nconst camelize = cacheStringFunction((str) => {\n  return str.replace(camelizeRE, (_, c) => c ? c.toUpperCase() : \"\");\n});\n\nfunction getLifeCycleTarget(target) {\n  return target || getCurrentInstance();\n}\n\nfunction useDebounceFn(fn, ms = 200, options = {}) {\n  return createFilterWrapper(\n    debounceFilter(ms, options),\n    fn\n  );\n}\n\nfunction refDebounced(value, ms = 200, options = {}) {\n  const debounced = ref(toValue$1(value));\n  const updater = useDebounceFn(() => {\n    debounced.value = value.value;\n  }, ms, options);\n  watch(value, () => updater());\n  return shallowReadonly(debounced);\n}\n\nfunction refDefault(source, defaultValue) {\n  return computed({\n    get() {\n      var _a;\n      return (_a = source.value) != null ? _a : defaultValue;\n    },\n    set(value) {\n      source.value = value;\n    }\n  });\n}\n\nfunction useThrottleFn(fn, ms = 200, trailing = false, leading = true, rejectOnCancel = false) {\n  return createFilterWrapper(\n    throttleFilter(ms, trailing, leading, rejectOnCancel),\n    fn\n  );\n}\n\nfunction refThrottled(value, delay = 200, trailing = true, leading = true) {\n  if (delay <= 0)\n    return value;\n  const throttled = ref(toValue$1(value));\n  const updater = useThrottleFn(() => {\n    throttled.value = value.value;\n  }, delay, trailing, leading);\n  watch(value, () => updater());\n  return throttled;\n}\n\nfunction refWithControl(initial, options = {}) {\n  let source = initial;\n  let track;\n  let trigger;\n  const ref = customRef((_track, _trigger) => {\n    track = _track;\n    trigger = _trigger;\n    return {\n      get() {\n        return get();\n      },\n      set(v) {\n        set(v);\n      }\n    };\n  });\n  function get(tracking = true) {\n    if (tracking)\n      track();\n    return source;\n  }\n  function set(value, triggering = true) {\n    var _a, _b;\n    if (value === source)\n      return;\n    const old = source;\n    if (((_a = options.onBeforeChange) == null ? void 0 : _a.call(options, value, old)) === false)\n      return;\n    source = value;\n    (_b = options.onChanged) == null ? void 0 : _b.call(options, value, old);\n    if (triggering)\n      trigger();\n  }\n  const untrackedGet = () => get(false);\n  const silentSet = (v) => set(v, false);\n  const peek = () => get(false);\n  const lay = (v) => set(v, false);\n  return extendRef(\n    ref,\n    {\n      get,\n      set,\n      untrackedGet,\n      silentSet,\n      peek,\n      lay\n    },\n    { enumerable: true }\n  );\n}\nconst controlledRef = refWithControl;\n\nfunction set(...args) {\n  if (args.length === 2) {\n    const [ref, value] = args;\n    ref.value = value;\n  }\n  if (args.length === 3) {\n    const [target, key, value] = args;\n    target[key] = value;\n  }\n}\n\nfunction watchWithFilter(source, cb, options = {}) {\n  const {\n    eventFilter = bypassFilter,\n    ...watchOptions\n  } = options;\n  return watch(\n    source,\n    createFilterWrapper(\n      eventFilter,\n      cb\n    ),\n    watchOptions\n  );\n}\n\nfunction watchPausable(source, cb, options = {}) {\n  const {\n    eventFilter: filter,\n    initialState = \"active\",\n    ...watchOptions\n  } = options;\n  const { eventFilter, pause, resume, isActive } = pausableFilter(filter, { initialState });\n  const stop = watchWithFilter(\n    source,\n    cb,\n    {\n      ...watchOptions,\n      eventFilter\n    }\n  );\n  return { stop, pause, resume, isActive };\n}\n\nfunction syncRef(left, right, ...[options]) {\n  const {\n    flush = \"sync\",\n    deep = false,\n    immediate = true,\n    direction = \"both\",\n    transform = {}\n  } = options || {};\n  const watchers = [];\n  const transformLTR = \"ltr\" in transform && transform.ltr || ((v) => v);\n  const transformRTL = \"rtl\" in transform && transform.rtl || ((v) => v);\n  if (direction === \"both\" || direction === \"ltr\") {\n    watchers.push(watchPausable(\n      left,\n      (newValue) => {\n        watchers.forEach((w) => w.pause());\n        right.value = transformLTR(newValue);\n        watchers.forEach((w) => w.resume());\n      },\n      { flush, deep, immediate }\n    ));\n  }\n  if (direction === \"both\" || direction === \"rtl\") {\n    watchers.push(watchPausable(\n      right,\n      (newValue) => {\n        watchers.forEach((w) => w.pause());\n        left.value = transformRTL(newValue);\n        watchers.forEach((w) => w.resume());\n      },\n      { flush, deep, immediate }\n    ));\n  }\n  const stop = () => {\n    watchers.forEach((w) => w.stop());\n  };\n  return stop;\n}\n\nfunction syncRefs(source, targets, options = {}) {\n  const {\n    flush = \"sync\",\n    deep = false,\n    immediate = true\n  } = options;\n  const targetsArray = toArray(targets);\n  return watch(\n    source,\n    (newValue) => targetsArray.forEach((target) => target.value = newValue),\n    { flush, deep, immediate }\n  );\n}\n\nfunction toRefs(objectRef, options = {}) {\n  if (!isRef(objectRef))\n    return toRefs$1(objectRef);\n  const result = Array.isArray(objectRef.value) ? Array.from({ length: objectRef.value.length }) : {};\n  for (const key in objectRef.value) {\n    result[key] = customRef(() => ({\n      get() {\n        return objectRef.value[key];\n      },\n      set(v) {\n        var _a;\n        const replaceRef = (_a = toValue$1(options.replaceRef)) != null ? _a : true;\n        if (replaceRef) {\n          if (Array.isArray(objectRef.value)) {\n            const copy = [...objectRef.value];\n            copy[key] = v;\n            objectRef.value = copy;\n          } else {\n            const newObject = { ...objectRef.value, [key]: v };\n            Object.setPrototypeOf(newObject, Object.getPrototypeOf(objectRef.value));\n            objectRef.value = newObject;\n          }\n        } else {\n          objectRef.value[key] = v;\n        }\n      }\n    }));\n  }\n  return result;\n}\n\nconst toValue = toValue$1;\nconst resolveUnref = toValue$1;\n\nfunction tryOnBeforeMount(fn, sync = true, target) {\n  const instance = getLifeCycleTarget(target);\n  if (instance)\n    onBeforeMount(fn, target);\n  else if (sync)\n    fn();\n  else\n    nextTick(fn);\n}\n\nfunction tryOnBeforeUnmount(fn, target) {\n  const instance = getLifeCycleTarget(target);\n  if (instance)\n    onBeforeUnmount(fn, target);\n}\n\nfunction tryOnMounted(fn, sync = true, target) {\n  const instance = getLifeCycleTarget(target);\n  if (instance)\n    onMounted(fn, target);\n  else if (sync)\n    fn();\n  else\n    nextTick(fn);\n}\n\nfunction tryOnUnmounted(fn, target) {\n  const instance = getLifeCycleTarget(target);\n  if (instance)\n    onUnmounted(fn, target);\n}\n\nfunction createUntil(r, isNot = false) {\n  function toMatch(condition, { flush = \"sync\", deep = false, timeout, throwOnTimeout } = {}) {\n    let stop = null;\n    const watcher = new Promise((resolve) => {\n      stop = watch(\n        r,\n        (v) => {\n          if (condition(v) !== isNot) {\n            if (stop)\n              stop();\n            else\n              nextTick(() => stop == null ? void 0 : stop());\n            resolve(v);\n          }\n        },\n        {\n          flush,\n          deep,\n          immediate: true\n        }\n      );\n    });\n    const promises = [watcher];\n    if (timeout != null) {\n      promises.push(\n        promiseTimeout(timeout, throwOnTimeout).then(() => toValue$1(r)).finally(() => stop == null ? void 0 : stop())\n      );\n    }\n    return Promise.race(promises);\n  }\n  function toBe(value, options) {\n    if (!isRef(value))\n      return toMatch((v) => v === value, options);\n    const { flush = \"sync\", deep = false, timeout, throwOnTimeout } = options != null ? options : {};\n    let stop = null;\n    const watcher = new Promise((resolve) => {\n      stop = watch(\n        [r, value],\n        ([v1, v2]) => {\n          if (isNot !== (v1 === v2)) {\n            if (stop)\n              stop();\n            else\n              nextTick(() => stop == null ? void 0 : stop());\n            resolve(v1);\n          }\n        },\n        {\n          flush,\n          deep,\n          immediate: true\n        }\n      );\n    });\n    const promises = [watcher];\n    if (timeout != null) {\n      promises.push(\n        promiseTimeout(timeout, throwOnTimeout).then(() => toValue$1(r)).finally(() => {\n          stop == null ? void 0 : stop();\n          return toValue$1(r);\n        })\n      );\n    }\n    return Promise.race(promises);\n  }\n  function toBeTruthy(options) {\n    return toMatch((v) => Boolean(v), options);\n  }\n  function toBeNull(options) {\n    return toBe(null, options);\n  }\n  function toBeUndefined(options) {\n    return toBe(void 0, options);\n  }\n  function toBeNaN(options) {\n    return toMatch(Number.isNaN, options);\n  }\n  function toContains(value, options) {\n    return toMatch((v) => {\n      const array = Array.from(v);\n      return array.includes(value) || array.includes(toValue$1(value));\n    }, options);\n  }\n  function changed(options) {\n    return changedTimes(1, options);\n  }\n  function changedTimes(n = 1, options) {\n    let count = -1;\n    return toMatch(() => {\n      count += 1;\n      return count >= n;\n    }, options);\n  }\n  if (Array.isArray(toValue$1(r))) {\n    const instance = {\n      toMatch,\n      toContains,\n      changed,\n      changedTimes,\n      get not() {\n        return createUntil(r, !isNot);\n      }\n    };\n    return instance;\n  } else {\n    const instance = {\n      toMatch,\n      toBe,\n      toBeTruthy,\n      toBeNull,\n      toBeNaN,\n      toBeUndefined,\n      changed,\n      changedTimes,\n      get not() {\n        return createUntil(r, !isNot);\n      }\n    };\n    return instance;\n  }\n}\nfunction until(r) {\n  return createUntil(r);\n}\n\nfunction defaultComparator(value, othVal) {\n  return value === othVal;\n}\nfunction useArrayDifference(...args) {\n  var _a, _b;\n  const list = args[0];\n  const values = args[1];\n  let compareFn = (_a = args[2]) != null ? _a : defaultComparator;\n  const {\n    symmetric = false\n  } = (_b = args[3]) != null ? _b : {};\n  if (typeof compareFn === \"string\") {\n    const key = compareFn;\n    compareFn = (value, othVal) => value[key] === othVal[key];\n  }\n  const diff1 = computed(() => toValue$1(list).filter((x) => toValue$1(values).findIndex((y) => compareFn(x, y)) === -1));\n  if (symmetric) {\n    const diff2 = computed(() => toValue$1(values).filter((x) => toValue$1(list).findIndex((y) => compareFn(x, y)) === -1));\n    return computed(() => symmetric ? [...toValue$1(diff1), ...toValue$1(diff2)] : toValue$1(diff1));\n  } else {\n    return diff1;\n  }\n}\n\nfunction useArrayEvery(list, fn) {\n  return computed(() => toValue$1(list).every((element, index, array) => fn(toValue$1(element), index, array)));\n}\n\nfunction useArrayFilter(list, fn) {\n  return computed(() => toValue$1(list).map((i) => toValue$1(i)).filter(fn));\n}\n\nfunction useArrayFind(list, fn) {\n  return computed(() => toValue$1(\n    toValue$1(list).find((element, index, array) => fn(toValue$1(element), index, array))\n  ));\n}\n\nfunction useArrayFindIndex(list, fn) {\n  return computed(() => toValue$1(list).findIndex((element, index, array) => fn(toValue$1(element), index, array)));\n}\n\nfunction findLast(arr, cb) {\n  let index = arr.length;\n  while (index-- > 0) {\n    if (cb(arr[index], index, arr))\n      return arr[index];\n  }\n  return void 0;\n}\nfunction useArrayFindLast(list, fn) {\n  return computed(() => toValue$1(\n    !Array.prototype.findLast ? findLast(toValue$1(list), (element, index, array) => fn(toValue$1(element), index, array)) : toValue$1(list).findLast((element, index, array) => fn(toValue$1(element), index, array))\n  ));\n}\n\nfunction isArrayIncludesOptions(obj) {\n  return isObject(obj) && containsProp(obj, \"formIndex\", \"comparator\");\n}\nfunction useArrayIncludes(...args) {\n  var _a;\n  const list = args[0];\n  const value = args[1];\n  let comparator = args[2];\n  let formIndex = 0;\n  if (isArrayIncludesOptions(comparator)) {\n    formIndex = (_a = comparator.fromIndex) != null ? _a : 0;\n    comparator = comparator.comparator;\n  }\n  if (typeof comparator === \"string\") {\n    const key = comparator;\n    comparator = (element, value2) => element[key] === toValue$1(value2);\n  }\n  comparator = comparator != null ? comparator : (element, value2) => element === toValue$1(value2);\n  return computed(() => toValue$1(list).slice(formIndex).some((element, index, array) => comparator(\n    toValue$1(element),\n    toValue$1(value),\n    index,\n    toValue$1(array)\n  )));\n}\n\nfunction useArrayJoin(list, separator) {\n  return computed(() => toValue$1(list).map((i) => toValue$1(i)).join(toValue$1(separator)));\n}\n\nfunction useArrayMap(list, fn) {\n  return computed(() => toValue$1(list).map((i) => toValue$1(i)).map(fn));\n}\n\nfunction useArrayReduce(list, reducer, ...args) {\n  const reduceCallback = (sum, value, index) => reducer(toValue$1(sum), toValue$1(value), index);\n  return computed(() => {\n    const resolved = toValue$1(list);\n    return args.length ? resolved.reduce(reduceCallback, typeof args[0] === \"function\" ? toValue$1(args[0]()) : toValue$1(args[0])) : resolved.reduce(reduceCallback);\n  });\n}\n\nfunction useArraySome(list, fn) {\n  return computed(() => toValue$1(list).some((element, index, array) => fn(toValue$1(element), index, array)));\n}\n\nfunction uniq(array) {\n  return Array.from(new Set(array));\n}\nfunction uniqueElementsBy(array, fn) {\n  return array.reduce((acc, v) => {\n    if (!acc.some((x) => fn(v, x, array)))\n      acc.push(v);\n    return acc;\n  }, []);\n}\nfunction useArrayUnique(list, compareFn) {\n  return computed(() => {\n    const resolvedList = toValue$1(list).map((element) => toValue$1(element));\n    return compareFn ? uniqueElementsBy(resolvedList, compareFn) : uniq(resolvedList);\n  });\n}\n\nfunction useCounter(initialValue = 0, options = {}) {\n  let _initialValue = unref(initialValue);\n  const count = shallowRef(initialValue);\n  const {\n    max = Number.POSITIVE_INFINITY,\n    min = Number.NEGATIVE_INFINITY\n  } = options;\n  const inc = (delta = 1) => count.value = Math.max(Math.min(max, count.value + delta), min);\n  const dec = (delta = 1) => count.value = Math.min(Math.max(min, count.value - delta), max);\n  const get = () => count.value;\n  const set = (val) => count.value = Math.max(min, Math.min(max, val));\n  const reset = (val = _initialValue) => {\n    _initialValue = val;\n    return set(val);\n  };\n  return { count: shallowReadonly(count), inc, dec, get, set, reset };\n}\n\nconst REGEX_PARSE = /^(\\d{4})[-/]?(\\d{1,2})?[-/]?(\\d{0,2})[T\\s]*(\\d{1,2})?:?(\\d{1,2})?:?(\\d{1,2})?[.:]?(\\d+)?$/i;\nconst REGEX_FORMAT = /[YMDHhms]o|\\[([^\\]]+)\\]|Y{1,4}|M{1,4}|D{1,2}|d{1,4}|H{1,2}|h{1,2}|a{1,2}|A{1,2}|m{1,2}|s{1,2}|Z{1,2}|z{1,4}|SSS/g;\nfunction defaultMeridiem(hours, minutes, isLowercase, hasPeriod) {\n  let m = hours < 12 ? \"AM\" : \"PM\";\n  if (hasPeriod)\n    m = m.split(\"\").reduce((acc, curr) => acc += `${curr}.`, \"\");\n  return isLowercase ? m.toLowerCase() : m;\n}\nfunction formatOrdinal(num) {\n  const suffixes = [\"th\", \"st\", \"nd\", \"rd\"];\n  const v = num % 100;\n  return num + (suffixes[(v - 20) % 10] || suffixes[v] || suffixes[0]);\n}\nfunction formatDate(date, formatStr, options = {}) {\n  var _a;\n  const years = date.getFullYear();\n  const month = date.getMonth();\n  const days = date.getDate();\n  const hours = date.getHours();\n  const minutes = date.getMinutes();\n  const seconds = date.getSeconds();\n  const milliseconds = date.getMilliseconds();\n  const day = date.getDay();\n  const meridiem = (_a = options.customMeridiem) != null ? _a : defaultMeridiem;\n  const stripTimeZone = (dateString) => {\n    var _a2;\n    return (_a2 = dateString.split(\" \")[1]) != null ? _a2 : \"\";\n  };\n  const matches = {\n    Yo: () => formatOrdinal(years),\n    YY: () => String(years).slice(-2),\n    YYYY: () => years,\n    M: () => month + 1,\n    Mo: () => formatOrdinal(month + 1),\n    MM: () => `${month + 1}`.padStart(2, \"0\"),\n    MMM: () => date.toLocaleDateString(toValue$1(options.locales), { month: \"short\" }),\n    MMMM: () => date.toLocaleDateString(toValue$1(options.locales), { month: \"long\" }),\n    D: () => String(days),\n    Do: () => formatOrdinal(days),\n    DD: () => `${days}`.padStart(2, \"0\"),\n    H: () => String(hours),\n    Ho: () => formatOrdinal(hours),\n    HH: () => `${hours}`.padStart(2, \"0\"),\n    h: () => `${hours % 12 || 12}`.padStart(1, \"0\"),\n    ho: () => formatOrdinal(hours % 12 || 12),\n    hh: () => `${hours % 12 || 12}`.padStart(2, \"0\"),\n    m: () => String(minutes),\n    mo: () => formatOrdinal(minutes),\n    mm: () => `${minutes}`.padStart(2, \"0\"),\n    s: () => String(seconds),\n    so: () => formatOrdinal(seconds),\n    ss: () => `${seconds}`.padStart(2, \"0\"),\n    SSS: () => `${milliseconds}`.padStart(3, \"0\"),\n    d: () => day,\n    dd: () => date.toLocaleDateString(toValue$1(options.locales), { weekday: \"narrow\" }),\n    ddd: () => date.toLocaleDateString(toValue$1(options.locales), { weekday: \"short\" }),\n    dddd: () => date.toLocaleDateString(toValue$1(options.locales), { weekday: \"long\" }),\n    A: () => meridiem(hours, minutes),\n    AA: () => meridiem(hours, minutes, false, true),\n    a: () => meridiem(hours, minutes, true),\n    aa: () => meridiem(hours, minutes, true, true),\n    z: () => stripTimeZone(date.toLocaleDateString(toValue$1(options.locales), { timeZoneName: \"shortOffset\" })),\n    zz: () => stripTimeZone(date.toLocaleDateString(toValue$1(options.locales), { timeZoneName: \"shortOffset\" })),\n    zzz: () => stripTimeZone(date.toLocaleDateString(toValue$1(options.locales), { timeZoneName: \"shortOffset\" })),\n    zzzz: () => stripTimeZone(date.toLocaleDateString(toValue$1(options.locales), { timeZoneName: \"longOffset\" }))\n  };\n  return formatStr.replace(REGEX_FORMAT, (match, $1) => {\n    var _a2, _b;\n    return (_b = $1 != null ? $1 : (_a2 = matches[match]) == null ? void 0 : _a2.call(matches)) != null ? _b : match;\n  });\n}\nfunction normalizeDate(date) {\n  if (date === null)\n    return new Date(Number.NaN);\n  if (date === void 0)\n    return /* @__PURE__ */ new Date();\n  if (date instanceof Date)\n    return new Date(date);\n  if (typeof date === \"string\" && !/Z$/i.test(date)) {\n    const d = date.match(REGEX_PARSE);\n    if (d) {\n      const m = d[2] - 1 || 0;\n      const ms = (d[7] || \"0\").substring(0, 3);\n      return new Date(d[1], m, d[3] || 1, d[4] || 0, d[5] || 0, d[6] || 0, ms);\n    }\n  }\n  return new Date(date);\n}\nfunction useDateFormat(date, formatStr = \"HH:mm:ss\", options = {}) {\n  return computed(() => formatDate(normalizeDate(toValue$1(date)), toValue$1(formatStr), options));\n}\n\nfunction useIntervalFn(cb, interval = 1e3, options = {}) {\n  const {\n    immediate = true,\n    immediateCallback = false\n  } = options;\n  let timer = null;\n  const isActive = shallowRef(false);\n  function clean() {\n    if (timer) {\n      clearInterval(timer);\n      timer = null;\n    }\n  }\n  function pause() {\n    isActive.value = false;\n    clean();\n  }\n  function resume() {\n    const intervalValue = toValue$1(interval);\n    if (intervalValue <= 0)\n      return;\n    isActive.value = true;\n    if (immediateCallback)\n      cb();\n    clean();\n    if (isActive.value)\n      timer = setInterval(cb, intervalValue);\n  }\n  if (immediate && isClient)\n    resume();\n  if (isRef(interval) || typeof interval === \"function\") {\n    const stopWatch = watch(interval, () => {\n      if (isActive.value && isClient)\n        resume();\n    });\n    tryOnScopeDispose(stopWatch);\n  }\n  tryOnScopeDispose(pause);\n  return {\n    isActive: shallowReadonly(isActive),\n    pause,\n    resume\n  };\n}\n\nfunction useInterval(interval = 1e3, options = {}) {\n  const {\n    controls: exposeControls = false,\n    immediate = true,\n    callback\n  } = options;\n  const counter = shallowRef(0);\n  const update = () => counter.value += 1;\n  const reset = () => {\n    counter.value = 0;\n  };\n  const controls = useIntervalFn(\n    callback ? () => {\n      update();\n      callback(counter.value);\n    } : update,\n    interval,\n    { immediate }\n  );\n  if (exposeControls) {\n    return {\n      counter: shallowReadonly(counter),\n      reset,\n      ...controls\n    };\n  } else {\n    return shallowReadonly(counter);\n  }\n}\n\nfunction useLastChanged(source, options = {}) {\n  var _a;\n  const ms = shallowRef((_a = options.initialValue) != null ? _a : null);\n  watch(\n    source,\n    () => ms.value = timestamp(),\n    options\n  );\n  return shallowReadonly(ms);\n}\n\nfunction useTimeoutFn(cb, interval, options = {}) {\n  const {\n    immediate = true,\n    immediateCallback = false\n  } = options;\n  const isPending = shallowRef(false);\n  let timer = null;\n  function clear() {\n    if (timer) {\n      clearTimeout(timer);\n      timer = null;\n    }\n  }\n  function stop() {\n    isPending.value = false;\n    clear();\n  }\n  function start(...args) {\n    if (immediateCallback)\n      cb();\n    clear();\n    isPending.value = true;\n    timer = setTimeout(() => {\n      isPending.value = false;\n      timer = null;\n      cb(...args);\n    }, toValue$1(interval));\n  }\n  if (immediate) {\n    isPending.value = true;\n    if (isClient)\n      start();\n  }\n  tryOnScopeDispose(stop);\n  return {\n    isPending: shallowReadonly(isPending),\n    start,\n    stop\n  };\n}\n\nfunction useTimeout(interval = 1e3, options = {}) {\n  const {\n    controls: exposeControls = false,\n    callback\n  } = options;\n  const controls = useTimeoutFn(\n    callback != null ? callback : noop,\n    interval,\n    options\n  );\n  const ready = computed(() => !controls.isPending.value);\n  if (exposeControls) {\n    return {\n      ready,\n      ...controls\n    };\n  } else {\n    return ready;\n  }\n}\n\nfunction useToNumber(value, options = {}) {\n  const {\n    method = \"parseFloat\",\n    radix,\n    nanToZero\n  } = options;\n  return computed(() => {\n    let resolved = toValue$1(value);\n    if (typeof method === \"function\")\n      resolved = method(resolved);\n    else if (typeof resolved === \"string\")\n      resolved = Number[method](resolved, radix);\n    if (nanToZero && Number.isNaN(resolved))\n      resolved = 0;\n    return resolved;\n  });\n}\n\nfunction useToString(value) {\n  return computed(() => `${toValue$1(value)}`);\n}\n\nfunction useToggle(initialValue = false, options = {}) {\n  const {\n    truthyValue = true,\n    falsyValue = false\n  } = options;\n  const valueIsRef = isRef(initialValue);\n  const _value = shallowRef(initialValue);\n  function toggle(value) {\n    if (arguments.length) {\n      _value.value = value;\n      return _value.value;\n    } else {\n      const truthy = toValue$1(truthyValue);\n      _value.value = _value.value === truthy ? toValue$1(falsyValue) : truthy;\n      return _value.value;\n    }\n  }\n  if (valueIsRef)\n    return toggle;\n  else\n    return [_value, toggle];\n}\n\nfunction watchArray(source, cb, options) {\n  let oldList = (options == null ? void 0 : options.immediate) ? [] : [...typeof source === \"function\" ? source() : Array.isArray(source) ? source : toValue$1(source)];\n  return watch(source, (newList, _, onCleanup) => {\n    const oldListRemains = Array.from({ length: oldList.length });\n    const added = [];\n    for (const obj of newList) {\n      let found = false;\n      for (let i = 0; i < oldList.length; i++) {\n        if (!oldListRemains[i] && obj === oldList[i]) {\n          oldListRemains[i] = true;\n          found = true;\n          break;\n        }\n      }\n      if (!found)\n        added.push(obj);\n    }\n    const removed = oldList.filter((_2, i) => !oldListRemains[i]);\n    cb(newList, oldList, added, removed, onCleanup);\n    oldList = [...newList];\n  }, options);\n}\n\nfunction watchAtMost(source, cb, options) {\n  const {\n    count,\n    ...watchOptions\n  } = options;\n  const current = shallowRef(0);\n  const stop = watchWithFilter(\n    source,\n    (...args) => {\n      current.value += 1;\n      if (current.value >= toValue$1(count))\n        nextTick(() => stop());\n      cb(...args);\n    },\n    watchOptions\n  );\n  return { count: current, stop };\n}\n\nfunction watchDebounced(source, cb, options = {}) {\n  const {\n    debounce = 0,\n    maxWait = void 0,\n    ...watchOptions\n  } = options;\n  return watchWithFilter(\n    source,\n    cb,\n    {\n      ...watchOptions,\n      eventFilter: debounceFilter(debounce, { maxWait })\n    }\n  );\n}\n\nfunction watchDeep(source, cb, options) {\n  return watch(\n    source,\n    cb,\n    {\n      ...options,\n      deep: true\n    }\n  );\n}\n\nfunction watchIgnorable(source, cb, options = {}) {\n  const {\n    eventFilter = bypassFilter,\n    ...watchOptions\n  } = options;\n  const filteredCb = createFilterWrapper(\n    eventFilter,\n    cb\n  );\n  let ignoreUpdates;\n  let ignorePrevAsyncUpdates;\n  let stop;\n  if (watchOptions.flush === \"sync\") {\n    const ignore = shallowRef(false);\n    ignorePrevAsyncUpdates = () => {\n    };\n    ignoreUpdates = (updater) => {\n      ignore.value = true;\n      updater();\n      ignore.value = false;\n    };\n    stop = watch(\n      source,\n      (...args) => {\n        if (!ignore.value)\n          filteredCb(...args);\n      },\n      watchOptions\n    );\n  } else {\n    const disposables = [];\n    const ignoreCounter = shallowRef(0);\n    const syncCounter = shallowRef(0);\n    ignorePrevAsyncUpdates = () => {\n      ignoreCounter.value = syncCounter.value;\n    };\n    disposables.push(\n      watch(\n        source,\n        () => {\n          syncCounter.value++;\n        },\n        { ...watchOptions, flush: \"sync\" }\n      )\n    );\n    ignoreUpdates = (updater) => {\n      const syncCounterPrev = syncCounter.value;\n      updater();\n      ignoreCounter.value += syncCounter.value - syncCounterPrev;\n    };\n    disposables.push(\n      watch(\n        source,\n        (...args) => {\n          const ignore = ignoreCounter.value > 0 && ignoreCounter.value === syncCounter.value;\n          ignoreCounter.value = 0;\n          syncCounter.value = 0;\n          if (ignore)\n            return;\n          filteredCb(...args);\n        },\n        watchOptions\n      )\n    );\n    stop = () => {\n      disposables.forEach((fn) => fn());\n    };\n  }\n  return { stop, ignoreUpdates, ignorePrevAsyncUpdates };\n}\n\nfunction watchImmediate(source, cb, options) {\n  return watch(\n    source,\n    cb,\n    {\n      ...options,\n      immediate: true\n    }\n  );\n}\n\nfunction watchOnce(source, cb, options) {\n  return watch(\n    source,\n    cb,\n    {\n      ...options,\n      once: true\n    }\n  );\n}\n\nfunction watchThrottled(source, cb, options = {}) {\n  const {\n    throttle = 0,\n    trailing = true,\n    leading = true,\n    ...watchOptions\n  } = options;\n  return watchWithFilter(\n    source,\n    cb,\n    {\n      ...watchOptions,\n      eventFilter: throttleFilter(throttle, trailing, leading)\n    }\n  );\n}\n\nfunction watchTriggerable(source, cb, options = {}) {\n  let cleanupFn;\n  function onEffect() {\n    if (!cleanupFn)\n      return;\n    const fn = cleanupFn;\n    cleanupFn = void 0;\n    fn();\n  }\n  function onCleanup(callback) {\n    cleanupFn = callback;\n  }\n  const _cb = (value, oldValue) => {\n    onEffect();\n    return cb(value, oldValue, onCleanup);\n  };\n  const res = watchIgnorable(source, _cb, options);\n  const { ignoreUpdates } = res;\n  const trigger = () => {\n    let res2;\n    ignoreUpdates(() => {\n      res2 = _cb(getWatchSources(source), getOldValue(source));\n    });\n    return res2;\n  };\n  return {\n    ...res,\n    trigger\n  };\n}\nfunction getWatchSources(sources) {\n  if (isReactive(sources))\n    return sources;\n  if (Array.isArray(sources))\n    return sources.map((item) => toValue$1(item));\n  return toValue$1(sources);\n}\nfunction getOldValue(source) {\n  return Array.isArray(source) ? source.map(() => void 0) : void 0;\n}\n\nfunction whenever(source, cb, options) {\n  const stop = watch(\n    source,\n    (v, ov, onInvalidate) => {\n      if (v) {\n        if (options == null ? void 0 : options.once)\n          nextTick(() => stop());\n        cb(v, ov, onInvalidate);\n      }\n    },\n    {\n      ...options,\n      once: false\n    }\n  );\n  return stop;\n}\n\nexport { assert, refAutoReset as autoResetRef, bypassFilter, camelize, clamp, computedEager, computedWithControl, containsProp, computedWithControl as controlledComputed, controlledRef, createEventHook, createFilterWrapper, createGlobalState, createInjectionState, reactify as createReactiveFn, createRef, createSharedComposable, createSingletonPromise, debounceFilter, refDebounced as debouncedRef, watchDebounced as debouncedWatch, computedEager as eagerComputed, extendRef, formatDate, get, getLifeCycleTarget, hasOwn, hyphenate, identity, watchIgnorable as ignorableWatch, increaseWithUnit, injectLocal, invoke, isClient, isDef, isDefined, isIOS, isObject, isWorker, makeDestructurable, noop, normalizeDate, notNullish, now, objectEntries, objectOmit, objectPick, pausableFilter, watchPausable as pausableWatch, promiseTimeout, provideLocal, pxValue, rand, reactify, reactifyObject, reactiveComputed, reactiveOmit, reactivePick, refAutoReset, refDebounced, refDefault, refThrottled, refWithControl, resolveRef, resolveUnref, set, syncRef, syncRefs, throttleFilter, refThrottled as throttledRef, watchThrottled as throttledWatch, timestamp, toArray, toReactive, toRef, toRefs, toValue, tryOnBeforeMount, tryOnBeforeUnmount, tryOnMounted, tryOnScopeDispose, tryOnUnmounted, until, useArrayDifference, useArrayEvery, useArrayFilter, useArrayFind, useArrayFindIndex, useArrayFindLast, useArrayIncludes, useArrayJoin, useArrayMap, useArrayReduce, useArraySome, useArrayUnique, useCounter, useDateFormat, refDebounced as useDebounce, useDebounceFn, useInterval, useIntervalFn, useLastChanged, refThrottled as useThrottle, useThrottleFn, useTimeout, useTimeoutFn, useToNumber, useToString, useToggle, watchArray, watchAtMost, watchDebounced, watchDeep, watchIgnorable, watchImmediate, watchOnce, watchPausable, watchThrottled, watchTriggerable, watchWithFilter, whenever };\n"],"names":["tryOnScopeDispose","fn","getCurrentScope","onScopeDispose","isClient","noop","createFilterWrapper","filter","wrapper","args","resolve","reject","debounceFilter","ms","options","timer","maxTimer","lastRejector","_clearTimeout","timer2","lastInvoker","invoke","duration","toValue$1","maxDuration","useDebounceFn","refDebounced","value","debounced","ref","updater","watch","shallowReadonly","useTimeoutFn","cb","interval","immediate","immediateCallback","isPending","shallowRef","clear","stop","start","whenever","source","v","ov","onInvalidate"],"mappings":";AAgDA,SAASA,EAAkBC,GAAI;AAC7B,SAAIC,EAAe,KACjBC,EAAeF,CAAE,GACV,MAEF;AACT;AA2OK,MAACG,IAAW,OAAO,SAAW,OAAe,OAAO,WAAa;AACrD,OAAO,oBAAsB,OAAe,sBAAsB;AAY9E,MAACC,IAAO,MAAM;AACnB;AAqDA,SAASC,EAAoBC,GAAQN,GAAI;AACvC,WAASO,KAAWC,GAAM;AACxB,WAAO,IAAI,QAAQ,CAACC,GAASC,MAAW;AACtC,cAAQ,QAAQJ,EAAO,MAAMN,EAAG,MAAM,MAAMQ,CAAI,GAAG,EAAE,IAAAR,GAAI,SAAS,MAAM,MAAAQ,EAAI,CAAE,CAAC,EAAE,KAAKC,CAAO,EAAE,MAAMC,CAAM;AAAA,IACjH,CAAK;AAAA,EACL;AACE,SAAOH;AACT;AAIA,SAASI,EAAeC,GAAIC,IAAU,IAAI;AACxC,MAAIC,GACAC,GACAC,IAAeZ;AACnB,QAAMa,IAAgB,CAACC,MAAW;AAChC,iBAAaA,CAAM,GACnBF,EAAc,GACdA,IAAeZ;AAAA,EAChB;AACD,MAAIe;AAgCJ,SA/Be,CAACC,MAAW;AACzB,UAAMC,IAAWC,EAAUV,CAAE,GACvBW,IAAcD,EAAUT,EAAQ,OAAO;AAG7C,WAFIC,KACFG,EAAcH,CAAK,GACjBO,KAAY,KAAKE,MAAgB,UAAUA,KAAe,KACxDR,MACFE,EAAcF,CAAQ,GACtBA,IAAW,OAEN,QAAQ,QAAQK,GAAQ,KAE1B,IAAI,QAAQ,CAACX,GAASC,MAAW;AACtC,MAAAM,IAAeH,EAAQ,iBAAiBH,IAASD,GACjDU,IAAcC,GACVG,KAAe,CAACR,MAClBA,IAAW,WAAW,MAAM;AAC1B,QAAID,KACFG,EAAcH,CAAK,GACrBC,IAAW,MACXN,EAAQU,EAAW,CAAE;AAAA,MACtB,GAAEI,CAAW,IAEhBT,IAAQ,WAAW,MAAM;AACvB,QAAIC,KACFE,EAAcF,CAAQ,GACxBA,IAAW,MACXN,EAAQW,EAAM,CAAE;AAAA,MACjB,GAAEC,CAAQ;AAAA,IACjB,CAAK;AAAA,EACF;AAEH;AA8JA,SAASG,EAAcxB,GAAIY,IAAK,KAAKC,IAAU,CAAA,GAAI;AACjD,SAAOR;AAAA,IACLM,EAAeC,GAAIC,CAAO;AAAA,IAC1Bb;AAAA,EACD;AACH;AAEA,SAASyB,EAAaC,GAAOd,IAAK,KAAKC,IAAU,CAAA,GAAI;AACnD,QAAMc,IAAYC,EAAIN,EAAUI,CAAK,CAAC,GAChCG,IAAUL,EAAc,MAAM;AAClC,IAAAG,EAAU,QAAQD,EAAM;AAAA,EAC5B,GAAKd,GAAIC,CAAO;AACd,SAAAiB,EAAMJ,GAAO,MAAMG,GAAS,GACrBE,EAAgBJ,CAAS;AAClC;AA+qBA,SAASK,EAAaC,GAAIC,GAAUrB,IAAU,CAAA,GAAI;AAChD,QAAM;AAAA,IACJ,WAAAsB,IAAY;AAAA,IACZ,mBAAAC,IAAoB;AAAA,EACxB,IAAMvB,GACEwB,IAAYC,EAAW,EAAK;AAClC,MAAIxB,IAAQ;AACZ,WAASyB,IAAQ;AACf,IAAIzB,MACF,aAAaA,CAAK,GAClBA,IAAQ;AAAA,EAEd;AACE,WAAS0B,IAAO;AACd,IAAAH,EAAU,QAAQ,IAClBE,EAAO;AAAA,EACX;AACE,WAASE,KAASjC,GAAM;AACtB,IAAI4B,KACFH,EAAI,GACNM,EAAO,GACPF,EAAU,QAAQ,IAClBvB,IAAQ,WAAW,MAAM;AACvB,MAAAuB,EAAU,QAAQ,IAClBvB,IAAQ,MACRmB,EAAG,GAAGzB,CAAI;AAAA,IAChB,GAAOc,EAAUY,CAAQ,CAAC;AAAA,EAC1B;AACE,SAAIC,MACFE,EAAU,QAAQ,IACdlC,KACFsC,EAAO,IAEX1C,EAAkByC,CAAI,GACf;AAAA,IACL,WAAWT,EAAgBM,CAAS;AAAA,IACpC,OAAAI;AAAA,IACA,MAAAD;AAAA,EACD;AACH;AAgSA,SAASE,EAASC,GAAQV,GAAIpB,GAAS;AAerC,SAdaiB;AAAA,IACXa;AAAA,IACA,CAACC,GAAGC,GAAIC,MAAiB;AACvB,MAAIF,KAGFX,EAAGW,GAAGC,GAAIC,CAAY;AAAA,IAEzB;AAAA,IACD;AAAA,MACE,GAAGjC;AAAA,MACH,MAAM;AAAA,IACZ;AAAA,EACG;AAEH;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/d3-array@3.2.4/node_modules/d3-array/src/array.js

@@ -0,0 +1,5 @@
+var r = Array.prototype, a = r.slice;
+export {
+  a as slice
+};
+//# sourceMappingURL=array.js.map

package/dist/node_modules/.pnpm/d3-array@3.2.4/node_modules/d3-array/src/array.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"array.js","sources":["../../../../../../../../../../node_modules/.pnpm/d3-array@3.2.4/node_modules/d3-array/src/array.js"],"sourcesContent":["var array = Array.prototype;\n\nexport var slice = array.slice;\nexport var map = array.map;\n"],"names":["array","slice"],"mappings":"AAAA,IAAIA,IAAQ,MAAM,WAEPC,IAAQD,EAAM;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/d3-array@3.2.4/node_modules/d3-array/src/ascending.js

@@ -0,0 +1,7 @@
+function u(n, l) {
+  return n == null || l == null ? NaN : n < l ? -1 : n > l ? 1 : n >= l ? 0 : NaN;
+}
+export {
+  u as default
+};
+//# sourceMappingURL=ascending.js.map

package/dist/node_modules/.pnpm/d3-array@3.2.4/node_modules/d3-array/src/ascending.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ascending.js","sources":["../../../../../../../../../../node_modules/.pnpm/d3-array@3.2.4/node_modules/d3-array/src/ascending.js"],"sourcesContent":["export default function ascending(a, b) {\n  return a == null || b == null ? NaN : a < b ? -1 : a > b ? 1 : a >= b ? 0 : NaN;\n}\n"],"names":["ascending","a","b"],"mappings":"AAAe,SAASA,EAAUC,GAAGC,GAAG;AACtC,SAAOD,KAAK,QAAQC,KAAK,OAAO,MAAMD,IAAIC,IAAI,KAAKD,IAAIC,IAAI,IAAID,KAAKC,IAAI,IAAI;AAC9E;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/d3-array@3.2.4/node_modules/d3-array/src/bin.js

@@ -0,0 +1,59 @@
+import { slice as F } from "./array.js";
+import { bisectRight as j } from "./bisect.js";
+import b from "./constant.js";
+import w from "./extent.js";
+import I from "./identity.js";
+import R from "./nice.js";
+import S, { tickIncrement as z } from "./ticks.js";
+import q from "./threshold/sturges.js";
+function L() {
+  var A = I, h = w, v = q;
+  function s(i) {
+    Array.isArray(i) || (i = Array.from(i));
+    var r, c = i.length, o, m, u = new Array(c);
+    for (r = 0; r < c; ++r)
+      u[r] = A(i[r], r, i);
+    var k = h(u), e = k[0], t = k[1], n = v(u, e, t);
+    if (!Array.isArray(n)) {
+      const g = t, x = +n;
+      if (h === w && ([e, t] = R(e, t, x)), n = S(e, t, x), n[0] <= e && (m = z(e, t, x)), n[n.length - 1] >= t)
+        if (g >= t && h === w) {
+          const l = z(e, t, x);
+          isFinite(l) && (l > 0 ? t = (Math.floor(t / l) + 1) * l : l < 0 && (t = (Math.ceil(t * -l) + 1) / -l));
+        } else
+          n.pop();
+    }
+    for (var f = n.length, a = 0, p = f; n[a] <= e; ) ++a;
+    for (; n[p - 1] > t; ) --p;
+    (a || p < f) && (n = n.slice(a, p), f = p - a);
+    var y = new Array(f + 1), M;
+    for (r = 0; r <= f; ++r)
+      M = y[r] = [], M.x0 = r > 0 ? n[r - 1] : e, M.x1 = r < f ? n[r] : t;
+    if (isFinite(m)) {
+      if (m > 0)
+        for (r = 0; r < c; ++r)
+          (o = u[r]) != null && e <= o && o <= t && y[Math.min(f, Math.floor((o - e) / m))].push(i[r]);
+      else if (m < 0) {
+        for (r = 0; r < c; ++r)
+          if ((o = u[r]) != null && e <= o && o <= t) {
+            const g = Math.floor((e - o) * m);
+            y[Math.min(f, g + (n[g] <= o))].push(i[r]);
+          }
+      }
+    } else
+      for (r = 0; r < c; ++r)
+        (o = u[r]) != null && e <= o && o <= t && y[j(n, o, 0, f)].push(i[r]);
+    return y;
+  }
+  return s.value = function(i) {
+    return arguments.length ? (A = typeof i == "function" ? i : b(i), s) : A;
+  }, s.domain = function(i) {
+    return arguments.length ? (h = typeof i == "function" ? i : b([i[0], i[1]]), s) : h;
+  }, s.thresholds = function(i) {
+    return arguments.length ? (v = typeof i == "function" ? i : b(Array.isArray(i) ? F.call(i) : i), s) : v;
+  }, s;
+}
+export {
+  L as default
+};
+//# sourceMappingURL=bin.js.map

package/dist/node_modules/.pnpm/d3-array@3.2.4/node_modules/d3-array/src/bin.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bin.js","sources":["../../../../../../../../../../node_modules/.pnpm/d3-array@3.2.4/node_modules/d3-array/src/bin.js"],"sourcesContent":["import {slice} from \"./array.js\";\nimport bisect from \"./bisect.js\";\nimport constant from \"./constant.js\";\nimport extent from \"./extent.js\";\nimport identity from \"./identity.js\";\nimport nice from \"./nice.js\";\nimport ticks, {tickIncrement} from \"./ticks.js\";\nimport sturges from \"./threshold/sturges.js\";\n\nexport default function bin() {\n  var value = identity,\n      domain = extent,\n      threshold = sturges;\n\n  function histogram(data) {\n    if (!Array.isArray(data)) data = Array.from(data);\n\n    var i,\n        n = data.length,\n        x,\n        step,\n        values = new Array(n);\n\n    for (i = 0; i < n; ++i) {\n      values[i] = value(data[i], i, data);\n    }\n\n    var xz = domain(values),\n        x0 = xz[0],\n        x1 = xz[1],\n        tz = threshold(values, x0, x1);\n\n    // Convert number of thresholds into uniform thresholds, and nice the\n    // default domain accordingly.\n    if (!Array.isArray(tz)) {\n      const max = x1, tn = +tz;\n      if (domain === extent) [x0, x1] = nice(x0, x1, tn);\n      tz = ticks(x0, x1, tn);\n\n      // If the domain is aligned with the first tick (which it will by\n      // default), then we can use quantization rather than bisection to bin\n      // values, which is substantially faster.\n      if (tz[0] <= x0) step = tickIncrement(x0, x1, tn);\n\n      // If the last threshold is coincident with the domain’s upper bound, the\n      // last bin will be zero-width. If the default domain is used, and this\n      // last threshold is coincident with the maximum input value, we can\n      // extend the niced upper bound by one tick to ensure uniform bin widths;\n      // otherwise, we simply remove the last threshold. Note that we don’t\n      // coerce values or the domain to numbers, and thus must be careful to\n      // compare order (>=) rather than strict equality (===)!\n      if (tz[tz.length - 1] >= x1) {\n        if (max >= x1 && domain === extent) {\n          const step = tickIncrement(x0, x1, tn);\n          if (isFinite(step)) {\n            if (step > 0) {\n              x1 = (Math.floor(x1 / step) + 1) * step;\n            } else if (step < 0) {\n              x1 = (Math.ceil(x1 * -step) + 1) / -step;\n            }\n          }\n        } else {\n          tz.pop();\n        }\n      }\n    }\n\n    // Remove any thresholds outside the domain.\n    // Be careful not to mutate an array owned by the user!\n    var m = tz.length, a = 0, b = m;\n    while (tz[a] <= x0) ++a;\n    while (tz[b - 1] > x1) --b;\n    if (a || b < m) tz = tz.slice(a, b), m = b - a;\n\n    var bins = new Array(m + 1),\n        bin;\n\n    // Initialize bins.\n    for (i = 0; i <= m; ++i) {\n      bin = bins[i] = [];\n      bin.x0 = i > 0 ? tz[i - 1] : x0;\n      bin.x1 = i < m ? tz[i] : x1;\n    }\n\n    // Assign data to bins by value, ignoring any outside the domain.\n    if (isFinite(step)) {\n      if (step > 0) {\n        for (i = 0; i < n; ++i) {\n          if ((x = values[i]) != null && x0 <= x && x <= x1) {\n            bins[Math.min(m, Math.floor((x - x0) / step))].push(data[i]);\n          }\n        }\n      } else if (step < 0) {\n        for (i = 0; i < n; ++i) {\n          if ((x = values[i]) != null && x0 <= x && x <= x1) {\n            const j = Math.floor((x0 - x) * step);\n            bins[Math.min(m, j + (tz[j] <= x))].push(data[i]); // handle off-by-one due to rounding\n          }\n        }\n      }\n    } else {\n      for (i = 0; i < n; ++i) {\n        if ((x = values[i]) != null && x0 <= x && x <= x1) {\n          bins[bisect(tz, x, 0, m)].push(data[i]);\n        }\n      }\n    }\n\n    return bins;\n  }\n\n  histogram.value = function(_) {\n    return arguments.length ? (value = typeof _ === \"function\" ? _ : constant(_), histogram) : value;\n  };\n\n  histogram.domain = function(_) {\n    return arguments.length ? (domain = typeof _ === \"function\" ? _ : constant([_[0], _[1]]), histogram) : domain;\n  };\n\n  histogram.thresholds = function(_) {\n    return arguments.length ? (threshold = typeof _ === \"function\" ? _ : constant(Array.isArray(_) ? slice.call(_) : _), histogram) : threshold;\n  };\n\n  return histogram;\n}\n"],"names":["bin","value","identity","domain","extent","threshold","sturges","histogram","data","i","n","x","step","values","xz","x0","x1","tz","max","tn","nice","ticks","tickIncrement","m","b","bins","j","bisect","_","constant","slice"],"mappings":";;;;;;;;AASe,SAASA,IAAM;AAC5B,MAAIC,IAAQC,GACRC,IAASC,GACTC,IAAYC;AAEhB,WAASC,EAAUC,GAAM;AACvB,IAAK,MAAM,QAAQA,CAAI,MAAGA,IAAO,MAAM,KAAKA,CAAI;AAEhD,QAAIC,GACAC,IAAIF,EAAK,QACTG,GACAC,GACAC,IAAS,IAAI,MAAMH,CAAC;AAExB,SAAKD,IAAI,GAAGA,IAAIC,GAAG,EAAED;AACnB,MAAAI,EAAOJ,CAAC,IAAIR,EAAMO,EAAKC,CAAC,GAAGA,GAAGD,CAAI;AAGpC,QAAIM,IAAKX,EAAOU,CAAM,GAClBE,IAAKD,EAAG,CAAC,GACTE,IAAKF,EAAG,CAAC,GACTG,IAAKZ,EAAUQ,GAAQE,GAAIC,CAAE;AAIjC,QAAI,CAAC,MAAM,QAAQC,CAAE,GAAG;AACtB,YAAMC,IAAMF,GAAIG,IAAK,CAACF;AAgBtB,UAfId,MAAWC,MAAQ,CAACW,GAAIC,CAAE,IAAII,EAAKL,GAAIC,GAAIG,CAAE,IACjDF,IAAKI,EAAMN,GAAIC,GAAIG,CAAE,GAKjBF,EAAG,CAAC,KAAKF,MAAIH,IAAOU,EAAcP,GAAIC,GAAIG,CAAE,IAS5CF,EAAGA,EAAG,SAAS,CAAC,KAAKD;AACvB,YAAIE,KAAOF,KAAMb,MAAWC,GAAQ;AAClC,gBAAMQ,IAAOU,EAAcP,GAAIC,GAAIG,CAAE;AACrC,UAAI,SAASP,CAAI,MACXA,IAAO,IACTI,KAAM,KAAK,MAAMA,IAAKJ,CAAI,IAAI,KAAKA,IAC1BA,IAAO,MAChBI,KAAM,KAAK,KAAKA,IAAK,CAACJ,CAAI,IAAI,KAAK,CAACA;AAAA,QAGlD;AACU,UAAAK,EAAG,IAAK;AAAA,IAGlB;AAKI,aADIM,IAAIN,EAAG,QAAQ,IAAI,GAAGO,IAAID,GACvBN,EAAG,CAAC,KAAKF,IAAI,GAAE;AACtB,WAAOE,EAAGO,IAAI,CAAC,IAAIR,IAAI,GAAEQ;AACzB,KAAI,KAAKA,IAAID,OAAGN,IAAKA,EAAG,MAAM,GAAGO,CAAC,GAAGD,IAAIC,IAAI;AAE7C,QAAIC,IAAO,IAAI,MAAMF,IAAI,CAAC,GACtBvB;AAGJ,SAAKS,IAAI,GAAGA,KAAKc,GAAG,EAAEd;AACpB,MAAAT,IAAMyB,EAAKhB,CAAC,IAAI,CAAE,GAClBT,EAAI,KAAKS,IAAI,IAAIQ,EAAGR,IAAI,CAAC,IAAIM,GAC7Bf,EAAI,KAAKS,IAAIc,IAAIN,EAAGR,CAAC,IAAIO;AAI3B,QAAI,SAASJ,CAAI;AACf,UAAIA,IAAO;AACT,aAAKH,IAAI,GAAGA,IAAIC,GAAG,EAAED;AACnB,WAAKE,IAAIE,EAAOJ,CAAC,MAAM,QAAQM,KAAMJ,KAAKA,KAAKK,KAC7CS,EAAK,KAAK,IAAIF,GAAG,KAAK,OAAOZ,IAAII,KAAMH,CAAI,CAAC,CAAC,EAAE,KAAKJ,EAAKC,CAAC,CAAC;AAAA,eAGtDG,IAAO;AAChB,aAAKH,IAAI,GAAGA,IAAIC,GAAG,EAAED;AACnB,eAAKE,IAAIE,EAAOJ,CAAC,MAAM,QAAQM,KAAMJ,KAAKA,KAAKK,GAAI;AACjD,kBAAMU,IAAI,KAAK,OAAOX,IAAKJ,KAAKC,CAAI;AACpC,YAAAa,EAAK,KAAK,IAAIF,GAAGG,KAAKT,EAAGS,CAAC,KAAKf,EAAE,CAAC,EAAE,KAAKH,EAAKC,CAAC,CAAC;AAAA,UAC5D;AAAA;AAAA;AAIM,WAAKA,IAAI,GAAGA,IAAIC,GAAG,EAAED;AACnB,SAAKE,IAAIE,EAAOJ,CAAC,MAAM,QAAQM,KAAMJ,KAAKA,KAAKK,KAC7CS,EAAKE,EAAOV,GAAIN,GAAG,GAAGY,CAAC,CAAC,EAAE,KAAKf,EAAKC,CAAC,CAAC;AAK5C,WAAOgB;AAAA,EACX;AAEE,SAAAlB,EAAU,QAAQ,SAASqB,GAAG;AAC5B,WAAO,UAAU,UAAU3B,IAAQ,OAAO2B,KAAM,aAAaA,IAAIC,EAASD,CAAC,GAAGrB,KAAaN;AAAA,EAC5F,GAEDM,EAAU,SAAS,SAASqB,GAAG;AAC7B,WAAO,UAAU,UAAUzB,IAAS,OAAOyB,KAAM,aAAaA,IAAIC,EAAS,CAACD,EAAE,CAAC,GAAGA,EAAE,CAAC,CAAC,CAAC,GAAGrB,KAAaJ;AAAA,EACxG,GAEDI,EAAU,aAAa,SAASqB,GAAG;AACjC,WAAO,UAAU,UAAUvB,IAAY,OAAOuB,KAAM,aAAaA,IAAIC,EAAS,MAAM,QAAQD,CAAC,IAAIE,EAAM,KAAKF,CAAC,IAAIA,CAAC,GAAGrB,KAAaF;AAAA,EACnI,GAEME;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/d3-array@3.2.4/node_modules/d3-array/src/bisect.js

@@ -0,0 +1,10 @@
+import r from "./ascending.js";
+import t from "./bisector.js";
+import e from "./number.js";
+const i = t(r), s = i.right;
+t(e).center;
+export {
+  s as bisectRight,
+  s as default
+};
+//# sourceMappingURL=bisect.js.map

package/dist/node_modules/.pnpm/d3-array@3.2.4/node_modules/d3-array/src/bisect.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bisect.js","sources":["../../../../../../../../../../node_modules/.pnpm/d3-array@3.2.4/node_modules/d3-array/src/bisect.js"],"sourcesContent":["import ascending from \"./ascending.js\";\nimport bisector from \"./bisector.js\";\nimport number from \"./number.js\";\n\nconst ascendingBisect = bisector(ascending);\nexport const bisectRight = ascendingBisect.right;\nexport const bisectLeft = ascendingBisect.left;\nexport const bisectCenter = bisector(number).center;\nexport default bisectRight;\n"],"names":["ascendingBisect","bisector","ascending","bisectRight","number"],"mappings":";;;AAIA,MAAMA,IAAkBC,EAASC,CAAS,GAC7BC,IAAcH,EAAgB;AAEfC,EAASG,CAAM,EAAE;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/d3-array@3.2.4/node_modules/d3-array/src/bisector.js

@@ -0,0 +1,38 @@
+import d from "./ascending.js";
+import p from "./descending.js";
+function b(c) {
+  let u, o, s;
+  c.length !== 2 ? (u = d, o = (n, e) => d(c(n), e), s = (n, e) => c(n) - e) : (u = c === d || c === p ? c : l, o = c, s = c);
+  function f(n, e, t = 0, r = n.length) {
+    if (t < r) {
+      if (u(e, e) !== 0) return r;
+      do {
+        const i = t + r >>> 1;
+        o(n[i], e) < 0 ? t = i + 1 : r = i;
+      } while (t < r);
+    }
+    return t;
+  }
+  function m(n, e, t = 0, r = n.length) {
+    if (t < r) {
+      if (u(e, e) !== 0) return r;
+      do {
+        const i = t + r >>> 1;
+        o(n[i], e) <= 0 ? t = i + 1 : r = i;
+      } while (t < r);
+    }
+    return t;
+  }
+  function g(n, e, t = 0, r = n.length) {
+    const i = f(n, e, t, r - 1);
+    return i > t && s(n[i - 1], e) > -s(n[i], e) ? i - 1 : i;
+  }
+  return { left: f, center: g, right: m };
+}
+function l() {
+  return 0;
+}
+export {
+  b as default
+};
+//# sourceMappingURL=bisector.js.map

package/dist/node_modules/.pnpm/d3-array@3.2.4/node_modules/d3-array/src/bisector.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bisector.js","sources":["../../../../../../../../../../node_modules/.pnpm/d3-array@3.2.4/node_modules/d3-array/src/bisector.js"],"sourcesContent":["import ascending from \"./ascending.js\";\nimport descending from \"./descending.js\";\n\nexport default function bisector(f) {\n  let compare1, compare2, delta;\n\n  // If an accessor is specified, promote it to a comparator. In this case we\n  // can test whether the search value is (self-) comparable. We can’t do this\n  // for a comparator (except for specific, known comparators) because we can’t\n  // tell if the comparator is symmetric, and an asymmetric comparator can’t be\n  // used to test whether a single value is comparable.\n  if (f.length !== 2) {\n    compare1 = ascending;\n    compare2 = (d, x) => ascending(f(d), x);\n    delta = (d, x) => f(d) - x;\n  } else {\n    compare1 = f === ascending || f === descending ? f : zero;\n    compare2 = f;\n    delta = f;\n  }\n\n  function left(a, x, lo = 0, hi = a.length) {\n    if (lo < hi) {\n      if (compare1(x, x) !== 0) return hi;\n      do {\n        const mid = (lo + hi) >>> 1;\n        if (compare2(a[mid], x) < 0) lo = mid + 1;\n        else hi = mid;\n      } while (lo < hi);\n    }\n    return lo;\n  }\n\n  function right(a, x, lo = 0, hi = a.length) {\n    if (lo < hi) {\n      if (compare1(x, x) !== 0) return hi;\n      do {\n        const mid = (lo + hi) >>> 1;\n        if (compare2(a[mid], x) <= 0) lo = mid + 1;\n        else hi = mid;\n      } while (lo < hi);\n    }\n    return lo;\n  }\n\n  function center(a, x, lo = 0, hi = a.length) {\n    const i = left(a, x, lo, hi - 1);\n    return i > lo && delta(a[i - 1], x) > -delta(a[i], x) ? i - 1 : i;\n  }\n\n  return {left, center, right};\n}\n\nfunction zero() {\n  return 0;\n}\n"],"names":["bisector","f","compare1","compare2","delta","ascending","d","x","descending","zero","left","a","lo","hi","mid","right","center"],"mappings":";;AAGe,SAASA,EAASC,GAAG;AAClC,MAAIC,GAAUC,GAAUC;AAOxB,EAAIH,EAAE,WAAW,KACfC,IAAWG,GACXF,IAAW,CAACG,GAAGC,MAAMF,EAAUJ,EAAEK,CAAC,GAAGC,CAAC,GACtCH,IAAQ,CAACE,GAAGC,MAAMN,EAAEK,CAAC,IAAIC,MAEzBL,IAAWD,MAAMI,KAAaJ,MAAMO,IAAaP,IAAIQ,GACrDN,IAAWF,GACXG,IAAQH;AAGV,WAASS,EAAKC,GAAGJ,GAAGK,IAAK,GAAGC,IAAKF,EAAE,QAAQ;AACzC,QAAIC,IAAKC,GAAI;AACX,UAAIX,EAASK,GAAGA,CAAC,MAAM,EAAG,QAAOM;AACjC,SAAG;AACD,cAAMC,IAAOF,IAAKC,MAAQ;AAC1B,QAAIV,EAASQ,EAAEG,CAAG,GAAGP,CAAC,IAAI,IAAGK,IAAKE,IAAM,IACnCD,IAAKC;AAAA,MACX,SAAQF,IAAKC;AAAA,IACpB;AACI,WAAOD;AAAA,EACX;AAEE,WAASG,EAAMJ,GAAGJ,GAAGK,IAAK,GAAGC,IAAKF,EAAE,QAAQ;AAC1C,QAAIC,IAAKC,GAAI;AACX,UAAIX,EAASK,GAAGA,CAAC,MAAM,EAAG,QAAOM;AACjC,SAAG;AACD,cAAMC,IAAOF,IAAKC,MAAQ;AAC1B,QAAIV,EAASQ,EAAEG,CAAG,GAAGP,CAAC,KAAK,IAAGK,IAAKE,IAAM,IACpCD,IAAKC;AAAA,MACX,SAAQF,IAAKC;AAAA,IACpB;AACI,WAAOD;AAAA,EACX;AAEE,WAASI,EAAOL,GAAGJ,GAAGK,IAAK,GAAGC,IAAKF,EAAE,QAAQ;AAC3C,UAAM,IAAID,EAAKC,GAAGJ,GAAGK,GAAIC,IAAK,CAAC;AAC/B,WAAO,IAAID,KAAMR,EAAMO,EAAE,IAAI,CAAC,GAAGJ,CAAC,IAAI,CAACH,EAAMO,EAAE,CAAC,GAAGJ,CAAC,IAAI,IAAI,IAAI;AAAA,EACpE;AAEE,SAAO,EAAC,MAAAG,GAAM,QAAAM,GAAQ,OAAAD,EAAK;AAC7B;AAEA,SAASN,IAAO;AACd,SAAO;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/d3-array@3.2.4/node_modules/d3-array/src/constant.js

@@ -0,0 +1,7 @@
+function n(t) {
+  return () => t;
+}
+export {
+  n as default
+};
+//# sourceMappingURL=constant.js.map

package/dist/node_modules/.pnpm/d3-array@3.2.4/node_modules/d3-array/src/constant.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"constant.js","sources":["../../../../../../../../../../node_modules/.pnpm/d3-array@3.2.4/node_modules/d3-array/src/constant.js"],"sourcesContent":["export default function constant(x) {\n  return () => x;\n}\n"],"names":["constant","x"],"mappings":"AAAe,SAASA,EAASC,GAAG;AAClC,SAAO,MAAMA;AACf;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/d3-array@3.2.4/node_modules/d3-array/src/count.js

@@ -0,0 +1,10 @@
+function o(e, l) {
+  let u = 0;
+  for (let t of e)
+    t != null && (t = +t) >= t && ++u;
+  return u;
+}
+export {
+  o as default
+};
+//# sourceMappingURL=count.js.map

package/dist/node_modules/.pnpm/d3-array@3.2.4/node_modules/d3-array/src/count.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"count.js","sources":["../../../../../../../../../../node_modules/.pnpm/d3-array@3.2.4/node_modules/d3-array/src/count.js"],"sourcesContent":["export default function count(values, valueof) {\n  let count = 0;\n  if (valueof === undefined) {\n    for (let value of values) {\n      if (value != null && (value = +value) >= value) {\n        ++count;\n      }\n    }\n  } else {\n    let index = -1;\n    for (let value of values) {\n      if ((value = valueof(value, ++index, values)) != null && (value = +value) >= value) {\n        ++count;\n      }\n    }\n  }\n  return count;\n}\n"],"names":["count","values","valueof","value"],"mappings":"AAAe,SAASA,EAAMC,GAAQC,GAAS;AAC7C,MAAIF,IAAQ;AAEV,WAASG,KAASF;AAChB,IAAIE,KAAS,SAASA,IAAQ,CAACA,MAAUA,KACvC,EAAEH;AAWR,SAAOA;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/d3-array@3.2.4/node_modules/d3-array/src/descending.js

@@ -0,0 +1,7 @@
+function l(n, e) {
+  return n == null || e == null ? NaN : e < n ? -1 : e > n ? 1 : e >= n ? 0 : NaN;
+}
+export {
+  l as default
+};
+//# sourceMappingURL=descending.js.map

package/dist/node_modules/.pnpm/d3-array@3.2.4/node_modules/d3-array/src/descending.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"descending.js","sources":["../../../../../../../../../../node_modules/.pnpm/d3-array@3.2.4/node_modules/d3-array/src/descending.js"],"sourcesContent":["export default function descending(a, b) {\n  return a == null || b == null ? NaN\n    : b < a ? -1\n    : b > a ? 1\n    : b >= a ? 0\n    : NaN;\n}\n"],"names":["descending","a","b"],"mappings":"AAAe,SAASA,EAAWC,GAAGC,GAAG;AACvC,SAAOD,KAAK,QAAQC,KAAK,OAAO,MAC5BA,IAAID,IAAI,KACRC,IAAID,IAAI,IACRC,KAAKD,IAAI,IACT;AACN;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/d3-array@3.2.4/node_modules/d3-array/src/extent.js

@@ -0,0 +1,16 @@
+function d(l, t) {
+  let f, n;
+  if (t === void 0)
+    for (const e of l)
+      e != null && (f === void 0 ? e >= e && (f = n = e) : (f > e && (f = e), n < e && (n = e)));
+  else {
+    let e = -1;
+    for (let i of l)
+      (i = t(i, ++e, l)) != null && (f === void 0 ? i >= i && (f = n = i) : (f > i && (f = i), n < i && (n = i)));
+  }
+  return [f, n];
+}
+export {
+  d as default
+};
+//# sourceMappingURL=extent.js.map

package/dist/node_modules/.pnpm/d3-array@3.2.4/node_modules/d3-array/src/extent.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"extent.js","sources":["../../../../../../../../../../node_modules/.pnpm/d3-array@3.2.4/node_modules/d3-array/src/extent.js"],"sourcesContent":["export default function extent(values, valueof) {\n  let min;\n  let max;\n  if (valueof === undefined) {\n    for (const value of values) {\n      if (value != null) {\n        if (min === undefined) {\n          if (value >= value) min = max = value;\n        } else {\n          if (min > value) min = value;\n          if (max < value) max = value;\n        }\n      }\n    }\n  } else {\n    let index = -1;\n    for (let value of values) {\n      if ((value = valueof(value, ++index, values)) != null) {\n        if (min === undefined) {\n          if (value >= value) min = max = value;\n        } else {\n          if (min > value) min = value;\n          if (max < value) max = value;\n        }\n      }\n    }\n  }\n  return [min, max];\n}\n"],"names":["extent","values","valueof","min","max","value","index"],"mappings":"AAAe,SAASA,EAAOC,GAAQC,GAAS;AAC9C,MAAIC,GACAC;AACJ,MAAIF,MAAY;AACd,eAAWG,KAASJ;AAClB,MAAII,KAAS,SACPF,MAAQ,SACNE,KAASA,MAAOF,IAAMC,IAAMC,MAE5BF,IAAME,MAAOF,IAAME,IACnBD,IAAMC,MAAOD,IAAMC;AAAA,OAIxB;AACL,QAAIC,IAAQ;AACZ,aAASD,KAASJ;AAChB,OAAKI,IAAQH,EAAQG,GAAO,EAAEC,GAAOL,CAAM,MAAM,SAC3CE,MAAQ,SACNE,KAASA,MAAOF,IAAMC,IAAMC,MAE5BF,IAAME,MAAOF,IAAME,IACnBD,IAAMC,MAAOD,IAAMC;AAAA,EAIjC;AACE,SAAO,CAACF,GAAKC,CAAG;AAClB;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/d3-array@3.2.4/node_modules/d3-array/src/identity.js

@@ -0,0 +1,7 @@
+function e(t) {
+  return t;
+}
+export {
+  e as default
+};
+//# sourceMappingURL=identity.js.map

package/dist/node_modules/.pnpm/d3-array@3.2.4/node_modules/d3-array/src/identity.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"identity.js","sources":["../../../../../../../../../../node_modules/.pnpm/d3-array@3.2.4/node_modules/d3-array/src/identity.js"],"sourcesContent":["export default function identity(x) {\n  return x;\n}\n"],"names":["identity","x"],"mappings":"AAAe,SAASA,EAASC,GAAG;AAClC,SAAOA;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/d3-array@3.2.4/node_modules/d3-array/src/max.js

@@ -0,0 +1,16 @@
+function l(d, i) {
+  let e;
+  if (i === void 0)
+    for (const n of d)
+      n != null && (e < n || e === void 0 && n >= n) && (e = n);
+  else {
+    let n = -1;
+    for (let f of d)
+      (f = i(f, ++n, d)) != null && (e < f || e === void 0 && f >= f) && (e = f);
+  }
+  return e;
+}
+export {
+  l as default
+};
+//# sourceMappingURL=max.js.map

package/dist/node_modules/.pnpm/d3-array@3.2.4/node_modules/d3-array/src/max.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"max.js","sources":["../../../../../../../../../../node_modules/.pnpm/d3-array@3.2.4/node_modules/d3-array/src/max.js"],"sourcesContent":["export default function max(values, valueof) {\n  let max;\n  if (valueof === undefined) {\n    for (const value of values) {\n      if (value != null\n          && (max < value || (max === undefined && value >= value))) {\n        max = value;\n      }\n    }\n  } else {\n    let index = -1;\n    for (let value of values) {\n      if ((value = valueof(value, ++index, values)) != null\n          && (max < value || (max === undefined && value >= value))) {\n        max = value;\n      }\n    }\n  }\n  return max;\n}\n"],"names":["max","values","valueof","value","index"],"mappings":"AAAe,SAASA,EAAIC,GAAQC,GAAS;AAC3C,MAAIF;AACJ,MAAIE,MAAY;AACd,eAAWC,KAASF;AAClB,MAAIE,KAAS,SACLH,IAAMG,KAAUH,MAAQ,UAAaG,KAASA,OACpDH,IAAMG;AAAA,OAGL;AACL,QAAIC,IAAQ;AACZ,aAASD,KAASF;AAChB,OAAKE,IAAQD,EAAQC,GAAO,EAAEC,GAAOH,CAAM,MAAM,SACzCD,IAAMG,KAAUH,MAAQ,UAAaG,KAASA,OACpDH,IAAMG;AAAA,EAGd;AACE,SAAOH;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/d3-array@3.2.4/node_modules/d3-array/src/min.js

@@ -0,0 +1,16 @@
+function l(i, d) {
+  let n;
+  if (d === void 0)
+    for (const e of i)
+      e != null && (n > e || n === void 0 && e >= e) && (n = e);
+  else {
+    let e = -1;
+    for (let f of i)
+      (f = d(f, ++e, i)) != null && (n > f || n === void 0 && f >= f) && (n = f);
+  }
+  return n;
+}
+export {
+  l as default
+};
+//# sourceMappingURL=min.js.map

package/dist/node_modules/.pnpm/d3-array@3.2.4/node_modules/d3-array/src/min.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"min.js","sources":["../../../../../../../../../../node_modules/.pnpm/d3-array@3.2.4/node_modules/d3-array/src/min.js"],"sourcesContent":["export default function min(values, valueof) {\n  let min;\n  if (valueof === undefined) {\n    for (const value of values) {\n      if (value != null\n          && (min > value || (min === undefined && value >= value))) {\n        min = value;\n      }\n    }\n  } else {\n    let index = -1;\n    for (let value of values) {\n      if ((value = valueof(value, ++index, values)) != null\n          && (min > value || (min === undefined && value >= value))) {\n        min = value;\n      }\n    }\n  }\n  return min;\n}\n"],"names":["min","values","valueof","value","index"],"mappings":"AAAe,SAASA,EAAIC,GAAQC,GAAS;AAC3C,MAAIF;AACJ,MAAIE,MAAY;AACd,eAAWC,KAASF;AAClB,MAAIE,KAAS,SACLH,IAAMG,KAAUH,MAAQ,UAAaG,KAASA,OACpDH,IAAMG;AAAA,OAGL;AACL,QAAIC,IAAQ;AACZ,aAASD,KAASF;AAChB,OAAKE,IAAQD,EAAQC,GAAO,EAAEC,GAAOH,CAAM,MAAM,SACzCD,IAAMG,KAAUH,MAAQ,UAAaG,KAASA,OACpDH,IAAMG;AAAA,EAGd;AACE,SAAOH;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/d3-array@3.2.4/node_modules/d3-array/src/nice.js

@@ -0,0 +1,14 @@
+import { tickIncrement as c } from "./ticks.js";
+function r(i, l, n) {
+  let f;
+  for (; ; ) {
+    const e = c(i, l, n);
+    if (e === f || e === 0 || !isFinite(e))
+      return [i, l];
+    e > 0 ? (i = Math.floor(i / e) * e, l = Math.ceil(l / e) * e) : e < 0 && (i = Math.ceil(i * e) / e, l = Math.floor(l * e) / e), f = e;
+  }
+}
+export {
+  r as default
+};
+//# sourceMappingURL=nice.js.map

package/dist/node_modules/.pnpm/d3-array@3.2.4/node_modules/d3-array/src/nice.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"nice.js","sources":["../../../../../../../../../../node_modules/.pnpm/d3-array@3.2.4/node_modules/d3-array/src/nice.js"],"sourcesContent":["import {tickIncrement} from \"./ticks.js\";\n\nexport default function nice(start, stop, count) {\n  let prestep;\n  while (true) {\n    const step = tickIncrement(start, stop, count);\n    if (step === prestep || step === 0 || !isFinite(step)) {\n      return [start, stop];\n    } else if (step > 0) {\n      start = Math.floor(start / step) * step;\n      stop = Math.ceil(stop / step) * step;\n    } else if (step < 0) {\n      start = Math.ceil(start * step) / step;\n      stop = Math.floor(stop * step) / step;\n    }\n    prestep = step;\n  }\n}\n"],"names":["nice","start","stop","count","prestep","step","tickIncrement"],"mappings":";AAEe,SAASA,EAAKC,GAAOC,GAAMC,GAAO;AAC/C,MAAIC;AACJ,aAAa;AACX,UAAMC,IAAOC,EAAcL,GAAOC,GAAMC,CAAK;AAC7C,QAAIE,MAASD,KAAWC,MAAS,KAAK,CAAC,SAASA,CAAI;AAClD,aAAO,CAACJ,GAAOC,CAAI;AACd,IAAIG,IAAO,KAChBJ,IAAQ,KAAK,MAAMA,IAAQI,CAAI,IAAIA,GACnCH,IAAO,KAAK,KAAKA,IAAOG,CAAI,IAAIA,KACvBA,IAAO,MAChBJ,IAAQ,KAAK,KAAKA,IAAQI,CAAI,IAAIA,GAClCH,IAAO,KAAK,MAAMA,IAAOG,CAAI,IAAIA,IAEnCD,IAAUC;AAAA,EACd;AACA;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/d3-array@3.2.4/node_modules/d3-array/src/number.js

@@ -0,0 +1,7 @@
+function u(n) {
+  return n === null ? NaN : +n;
+}
+export {
+  u as default
+};
+//# sourceMappingURL=number.js.map

package/dist/node_modules/.pnpm/d3-array@3.2.4/node_modules/d3-array/src/number.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"number.js","sources":["../../../../../../../../../../node_modules/.pnpm/d3-array@3.2.4/node_modules/d3-array/src/number.js"],"sourcesContent":["export default function number(x) {\n  return x === null ? NaN : +x;\n}\n\nexport function* numbers(values, valueof) {\n  if (valueof === undefined) {\n    for (let value of values) {\n      if (value != null && (value = +value) >= value) {\n        yield value;\n      }\n    }\n  } else {\n    let index = -1;\n    for (let value of values) {\n      if ((value = valueof(value, ++index, values)) != null && (value = +value) >= value) {\n        yield value;\n      }\n    }\n  }\n}\n"],"names":["number","x"],"mappings":"AAAe,SAASA,EAAOC,GAAG;AAChC,SAAOA,MAAM,OAAO,MAAM,CAACA;AAC7B;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/d3-array@3.2.4/node_modules/d3-array/src/threshold/sturges.js

@@ -0,0 +1,8 @@
+import a from "../count.js";
+function r(t) {
+  return Math.max(1, Math.ceil(Math.log(a(t)) / Math.LN2) + 1);
+}
+export {
+  r as default
+};
+//# sourceMappingURL=sturges.js.map

package/dist/node_modules/.pnpm/d3-array@3.2.4/node_modules/d3-array/src/threshold/sturges.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sturges.js","sources":["../../../../../../../../../../../node_modules/.pnpm/d3-array@3.2.4/node_modules/d3-array/src/threshold/sturges.js"],"sourcesContent":["import count from \"../count.js\";\n\nexport default function thresholdSturges(values) {\n  return Math.max(1, Math.ceil(Math.log(count(values)) / Math.LN2) + 1);\n}\n"],"names":["thresholdSturges","values","count"],"mappings":";AAEe,SAASA,EAAiBC,GAAQ;AAC/C,SAAO,KAAK,IAAI,GAAG,KAAK,KAAK,KAAK,IAAIC,EAAMD,CAAM,CAAC,IAAI,KAAK,GAAG,IAAI,CAAC;AACtE;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/d3-array@3.2.4/node_modules/d3-array/src/ticks.js

@@ -0,0 +1,33 @@
+const w = Math.sqrt(50), q = Math.sqrt(10), m = Math.sqrt(2);
+function k(i, r, f) {
+  const c = (r - i) / Math.max(0, f), M = Math.floor(Math.log10(c)), d = c / Math.pow(10, M), l = d >= w ? 10 : d >= q ? 5 : d >= m ? 2 : 1;
+  let n, h, e;
+  return M < 0 ? (e = Math.pow(10, -M) / l, n = Math.round(i * e), h = Math.round(r * e), n / e < i && ++n, h / e > r && --h, e = -e) : (e = Math.pow(10, M) * l, n = Math.round(i / e), h = Math.round(r / e), n * e < i && ++n, h * e > r && --h), h < n && 0.5 <= f && f < 2 ? k(i, r, f * 2) : [n, h, e];
+}
+function v(i, r, f) {
+  if (r = +r, i = +i, f = +f, !(f > 0)) return [];
+  if (i === r) return [i];
+  const c = r < i, [M, d, l] = c ? k(r, i, f) : k(i, r, f);
+  if (!(d >= M)) return [];
+  const n = d - M + 1, h = new Array(n);
+  if (c)
+    if (l < 0) for (let e = 0; e < n; ++e) h[e] = (d - e) / -l;
+    else for (let e = 0; e < n; ++e) h[e] = (d - e) * l;
+  else if (l < 0) for (let e = 0; e < n; ++e) h[e] = (M + e) / -l;
+  else for (let e = 0; e < n; ++e) h[e] = (M + e) * l;
+  return h;
+}
+function u(i, r, f) {
+  return r = +r, i = +i, f = +f, k(i, r, f)[2];
+}
+function x(i, r, f) {
+  r = +r, i = +i, f = +f;
+  const c = r < i, M = c ? u(r, i, f) : u(i, r, f);
+  return (c ? -1 : 1) * (M < 0 ? 1 / -M : M);
+}
+export {
+  v as default,
+  u as tickIncrement,
+  x as tickStep
+};
+//# sourceMappingURL=ticks.js.map

package/dist/node_modules/.pnpm/d3-array@3.2.4/node_modules/d3-array/src/ticks.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ticks.js","sources":["../../../../../../../../../../node_modules/.pnpm/d3-array@3.2.4/node_modules/d3-array/src/ticks.js"],"sourcesContent":["const e10 = Math.sqrt(50),\n    e5 = Math.sqrt(10),\n    e2 = Math.sqrt(2);\n\nfunction tickSpec(start, stop, count) {\n  const step = (stop - start) / Math.max(0, count),\n      power = Math.floor(Math.log10(step)),\n      error = step / Math.pow(10, power),\n      factor = error >= e10 ? 10 : error >= e5 ? 5 : error >= e2 ? 2 : 1;\n  let i1, i2, inc;\n  if (power < 0) {\n    inc = Math.pow(10, -power) / factor;\n    i1 = Math.round(start * inc);\n    i2 = Math.round(stop * inc);\n    if (i1 / inc < start) ++i1;\n    if (i2 / inc > stop) --i2;\n    inc = -inc;\n  } else {\n    inc = Math.pow(10, power) * factor;\n    i1 = Math.round(start / inc);\n    i2 = Math.round(stop / inc);\n    if (i1 * inc < start) ++i1;\n    if (i2 * inc > stop) --i2;\n  }\n  if (i2 < i1 && 0.5 <= count && count < 2) return tickSpec(start, stop, count * 2);\n  return [i1, i2, inc];\n}\n\nexport default function ticks(start, stop, count) {\n  stop = +stop, start = +start, count = +count;\n  if (!(count > 0)) return [];\n  if (start === stop) return [start];\n  const reverse = stop < start, [i1, i2, inc] = reverse ? tickSpec(stop, start, count) : tickSpec(start, stop, count);\n  if (!(i2 >= i1)) return [];\n  const n = i2 - i1 + 1, ticks = new Array(n);\n  if (reverse) {\n    if (inc < 0) for (let i = 0; i < n; ++i) ticks[i] = (i2 - i) / -inc;\n    else for (let i = 0; i < n; ++i) ticks[i] = (i2 - i) * inc;\n  } else {\n    if (inc < 0) for (let i = 0; i < n; ++i) ticks[i] = (i1 + i) / -inc;\n    else for (let i = 0; i < n; ++i) ticks[i] = (i1 + i) * inc;\n  }\n  return ticks;\n}\n\nexport function tickIncrement(start, stop, count) {\n  stop = +stop, start = +start, count = +count;\n  return tickSpec(start, stop, count)[2];\n}\n\nexport function tickStep(start, stop, count) {\n  stop = +stop, start = +start, count = +count;\n  const reverse = stop < start, inc = reverse ? tickIncrement(stop, start, count) : tickIncrement(start, stop, count);\n  return (reverse ? -1 : 1) * (inc < 0 ? 1 / -inc : inc);\n}\n"],"names":["e10","e5","e2","tickSpec","start","stop","count","step","power","error","factor","i1","i2","inc","ticks","reverse","i","tickIncrement","tickStep"],"mappings":"AAAA,MAAMA,IAAM,KAAK,KAAK,EAAE,GACpBC,IAAK,KAAK,KAAK,EAAE,GACjBC,IAAK,KAAK,KAAK,CAAC;AAEpB,SAASC,EAASC,GAAOC,GAAMC,GAAO;AACpC,QAAMC,KAAQF,IAAOD,KAAS,KAAK,IAAI,GAAGE,CAAK,GAC3CE,IAAQ,KAAK,MAAM,KAAK,MAAMD,CAAI,CAAC,GACnCE,IAAQF,IAAO,KAAK,IAAI,IAAIC,CAAK,GACjCE,IAASD,KAAST,IAAM,KAAKS,KAASR,IAAK,IAAIQ,KAASP,IAAK,IAAI;AACrE,MAAIS,GAAIC,GAAIC;AAeZ,SAdIL,IAAQ,KACVK,IAAM,KAAK,IAAI,IAAI,CAACL,CAAK,IAAIE,GAC7BC,IAAK,KAAK,MAAMP,IAAQS,CAAG,GAC3BD,IAAK,KAAK,MAAMP,IAAOQ,CAAG,GACtBF,IAAKE,IAAMT,KAAO,EAAEO,GACpBC,IAAKC,IAAMR,KAAM,EAAEO,GACvBC,IAAM,CAACA,MAEPA,IAAM,KAAK,IAAI,IAAIL,CAAK,IAAIE,GAC5BC,IAAK,KAAK,MAAMP,IAAQS,CAAG,GAC3BD,IAAK,KAAK,MAAMP,IAAOQ,CAAG,GACtBF,IAAKE,IAAMT,KAAO,EAAEO,GACpBC,IAAKC,IAAMR,KAAM,EAAEO,IAErBA,IAAKD,KAAM,OAAOL,KAASA,IAAQ,IAAUH,EAASC,GAAOC,GAAMC,IAAQ,CAAC,IACzE,CAACK,GAAIC,GAAIC,CAAG;AACrB;AAEe,SAASC,EAAMV,GAAOC,GAAMC,GAAO;AAEhD,MADAD,IAAO,CAACA,GAAMD,IAAQ,CAACA,GAAOE,IAAQ,CAACA,GACnC,EAAEA,IAAQ,GAAI,QAAO,CAAE;AAC3B,MAAIF,MAAUC,EAAM,QAAO,CAACD,CAAK;AACjC,QAAMW,IAAUV,IAAOD,GAAO,CAACO,GAAIC,GAAIC,CAAG,IAAIE,IAAUZ,EAASE,GAAMD,GAAOE,CAAK,IAAIH,EAASC,GAAOC,GAAMC,CAAK;AAClH,MAAI,EAAEM,KAAMD,GAAK,QAAO,CAAE;AAC1B,QAAM,IAAIC,IAAKD,IAAK,GAAGG,IAAQ,IAAI,MAAM,CAAC;AAC1C,MAAIC;AACF,QAAIF,IAAM,EAAG,UAASG,IAAI,GAAGA,IAAI,GAAG,EAAEA,EAAG,CAAAF,EAAME,CAAC,KAAKJ,IAAKI,KAAK,CAACH;AAAA,QAC3D,UAASG,IAAI,GAAGA,IAAI,GAAG,EAAEA,EAAG,CAAAF,EAAME,CAAC,KAAKJ,IAAKI,KAAKH;AAAA,WAEnDA,IAAM,EAAG,UAASG,IAAI,GAAGA,IAAI,GAAG,EAAEA,EAAG,CAAAF,EAAME,CAAC,KAAKL,IAAKK,KAAK,CAACH;AAAA,MAC3D,UAASG,IAAI,GAAGA,IAAI,GAAG,EAAEA,EAAG,CAAAF,EAAME,CAAC,KAAKL,IAAKK,KAAKH;AAEzD,SAAOC;AACT;AAEO,SAASG,EAAcb,GAAOC,GAAMC,GAAO;AAChD,SAAAD,IAAO,CAACA,GAAMD,IAAQ,CAACA,GAAOE,IAAQ,CAACA,GAChCH,EAASC,GAAOC,GAAMC,CAAK,EAAE,CAAC;AACvC;AAEO,SAASY,EAASd,GAAOC,GAAMC,GAAO;AAC3C,EAAAD,IAAO,CAACA,GAAMD,IAAQ,CAACA,GAAOE,IAAQ,CAACA;AACvC,QAAMS,IAAUV,IAAOD,GAAOS,IAAME,IAAUE,EAAcZ,GAAMD,GAAOE,CAAK,IAAIW,EAAcb,GAAOC,GAAMC,CAAK;AAClH,UAAQS,IAAU,KAAK,MAAMF,IAAM,IAAI,IAAI,CAACA,IAAMA;AACpD;","x_google_ignoreList":[0]}