@music-lyric-player/base 0.15.0 → 0.17.0

package/dist/index.ecma.js

@@ -1,6 +1,5 @@
-import { freezeObjectDeep as fr, ConfigManager as mr, Event as pr } from "@music-lyric-player/utils";
-import "lodash-es";
-const Ht = fr({
+import { freezeObjectDeep as mr, ConfigManager as dr, Event as pr } from "@music-lyric-player/utils";
+const Ht = mr({
   driver: "animation",
   bridgeActive: !0,
   mergeWindow: 300,
@@ -10,32 +9,47 @@ const Ht = fr({
     useMeta: !0,
     resetTempOnLyricChange: !0
   }
-}), ns = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+}), os = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   DEFAULT: Ht
-}, Symbol.toStringTag, { value: "Module" })), B = (s = 8) => {
-  let e = "";
-  for (; e.length < s; )
-    e += Math.random().toString(36).slice(2);
-  return e.slice(0, s);
-};
-var zt = /* @__PURE__ */ ((s) => (s.ChineseSimplified = "zh-hans", s.ChineseTraditional = "zh-hant", s.English = "en", s.Japanese = "ja", s.Korean = "ko", s.Russian = "ru", s.French = "fr", s.German = "de", s.Spanish = "es", s.Italian = "it", s.Portuguese = "pt", s))(zt || {});
-class dr {
+}, Symbol.toStringTag, { value: "Module" }));
+var zt = /* @__PURE__ */ ((r) => (r.ChineseSimplified = "zh-hans", r.ChineseTraditional = "zh-hant", r.English = "en", r.Japanese = "ja", r.Korean = "ko", r.Russian = "ru", r.French = "fr", r.German = "de", r.Spanish = "es", r.Italian = "it", r.Portuguese = "pt", r))(zt || {});
+class Er {
   /**
    * Language tag.
    */
-  tag = "";
+  tag;
   /**
    * Share within the lyric, ranging from 0 to 100.
    * Recommended to be computed from word-level language counts.
    */
-  percent = 0;
+  percent;
+  constructor(e = {}) {
+    this.tag = e.tag ?? "", this.percent = e.percent ?? 0;
+  }
 }
 class Yt {
   /**
    * All languages with their shares.
+   *
+   * Shares are a snapshot filled by the language transform; stale after lines change.
    */
-  list = [];
+  list;
+  constructor(e = {}) {
+    this.list = e.list ?? [];
+  }
+  /**
+   * Whether a language of the given tag is present.
+   */
+  has(e) {
+    return this.list.some((t) => t.tag === e);
+  }
+  /**
+   * The language entry of the given tag.
+   */
+  byType(e) {
+    return this.list.find((t) => t.tag === e);
+  }
   /**
    * The language with the highest share.
    */
@@ -50,11 +64,14 @@ class Kt {
   /**
    * Start time in milliseconds.
    */
-  start = 0;
+  start;
   /**
    * End time in milliseconds.
    */
-  end = 0;
+  end;
+  constructor(e = 0, t = 0) {
+    this.start = e, this.end = t;
+  }
   /**
    * Duration in milliseconds, derived from end minus start.
    */
@@ -62,11 +79,7 @@ class Kt {
     return this.end - this.start;
   }
 }
-class Er {
-  /**
-   * Unique identifier of the token.
-   */
-  id = B(6).toUpperCase();
+class gr {
   /**
    * Time range of the token.
    */
@@ -74,13 +87,12 @@ class Er {
   /**
    * Text content of the token.
    */
-  content = "";
+  content;
+  constructor(e = {}) {
+    this.time = e.time, this.content = e.content ?? "";
+  }
 }
-class Jt {
-  /**
-   * Unique identifier of the item.
-   */
-  id = B(6).toUpperCase();
+class ze {
   /**
    * Time range of the item, independent from its words.
    */
@@ -88,14 +100,19 @@ class Jt {
   /**
    * Tokens composing the item in order.
    */
-  words = [];
+  words;
   /**
    * Language or transliteration scheme of this item.
    * Should be set when multiple languages coexist, since line-level aggregation groups items by it.
    */
   language;
+  constructor(e = {}) {
+    this.time = e.time, this.words = e.words ?? [], this.language = e.language;
+  }
   /**
    * Flat text joined from every word.
+   *
+   * Live: recomputed on each access.
    */
   get content() {
     let e = "";
@@ -104,13 +121,25 @@ class Jt {
     return e;
   }
 }
-class gr extends Jt {
+class Rr extends ze {
+  /**
+   * Whether this ruby marks the start of a phrase.
+   */
+  phraseStart;
+  constructor(e = {}) {
+    super(e), this.phraseStart = e.phraseStart ?? !1;
+  }
+}
+class vr extends ze {
   /**
    * Original annotation type name.
    */
-  key = "";
+  key;
+  constructor(e = {}) {
+    super(e), this.key = e.key ?? "";
+  }
 }
-class Rr {
+class Ir {
   /**
    * Ruby annotation such as furigana.
    */
@@ -123,13 +152,12 @@ class Rr {
    * Unknown annotations keyed by their original type name.
    */
   unknowns;
+  constructor(e = {}) {
+    this.ruby = e.ruby, this.romans = e.romans, this.unknowns = e.unknowns;
+  }
 }
-var k = /* @__PURE__ */ ((s) => (s.Normal = "Normal", s.Space = "Space", s))(k || {});
-class vr {
-  /**
-   * Unique identifier of the word.
-   */
-  id = B(6).toUpperCase();
+var k = /* @__PURE__ */ ((r) => (r.Normal = "Normal", r.Space = "Space", r))(k || {});
+class $r {
   /**
    * Discriminant marking this as a normal word.
    */
@@ -141,7 +169,7 @@ class vr {
   /**
    * Text content of the word.
    */
-  content = "";
+  content;
   /**
    * Language of this word.
    */
@@ -153,9 +181,12 @@ class vr {
   /**
    * Whether the word is stressed.
    */
-  stress = !1;
+  stress;
+  constructor(e = {}) {
+    this.time = e.time, this.content = e.content ?? "", this.language = e.language, this.annotation = e.annotation, this.stress = e.stress ?? !1;
+  }
 }
-class Ir {
+class Lr {
   /**
    * Discriminant marking this as a space.
    */
@@ -163,182 +194,134 @@ class Ir {
   /**
    * Number of consecutive space characters.
    */
-  count = 1;
+  count;
+  constructor(e = {}) {
+    this.count = e.count ?? 1;
+  }
 }
-class Y {
-  /**
-   * Language or transliteration scheme of this item.
-   * Should be set when multiple languages coexist, since aggregation from words groups by it.
-   */
-  language;
+var Zt = /* @__PURE__ */ ((r) => (r.Ruby = "Ruby", r.Roman = "Roman", r.Translate = "Translate", r.Unknown = "Unknown", r))(Zt || {});
+const Tr = [
+  "Ruby",
+  "Roman",
+  "Unknown"
+  /* Unknown */
+];
+class Jt {
   /**
-   * Original text.
+   * All annotation items in order.
+   *
+   * Derived items are a snapshot from `deriveLineAnnotation`; re-run it after words change.
    */
-  content = "";
-}
-class Zt extends Y {
+  list;
+  constructor(e = {}) {
+    this.list = e.list ?? [];
+  }
   /**
-   * Original annotation type name.
+   * Whether any item of a kind exists.
    */
-  key = "";
-}
-class Qt {
-  #e;
-  constructor(e) {
-    this.#e = e;
+  has(e) {
+    return this.list.some((t) => t.kind === e);
   }
   /**
-   * Aggregate one per-word item into a single line item, padding spaces to follow word spacing.
+   * All items of a kind.
    */
-  #i(e) {
-    let t = "", n = 0, i, c = !1;
-    for (let h = 0, o = this.#e.words.length; h < o; h++) {
-      const a = this.#e.words[h];
-      if (a.type === k.Space) {
-        n += a.count;
-        continue;
-      }
-      const r = e(a);
-      r && (c && (t += " ".repeat(n)), t += r.content, i ??= r.language, n = 0, c = !0);
-    }
-    if (!c)
-      return;
-    const l = new Y();
-    return l.content = t, l.language = i, l;
+  all(e) {
+    return this.list.filter((t) => t.kind === e);
   }
   /**
-   * Aggregate multi-value per-word items into line items, one per language.
+   * The first item of a kind, preferring a language match then falling back to the first.
    */
-  #a(e) {
-    const t = [];
-    for (let i = 0, c = this.#e.words.length; i < c; i++) {
-      const l = this.#e.words[i];
-      if (l.type === k.Space)
-        continue;
-      const h = e(l);
-      if (h)
-        for (const o of h) {
-          const a = o.language ?? "";
-          t.includes(a) || t.push(a);
-        }
+  first(e, t) {
+    const n = this.all(e);
+    if (t !== void 0) {
+      const i = n.find((c) => c.language === t);
+      if (i)
+        return i;
     }
-    if (!t.length)
-      return;
-    const n = [];
-    for (const i of t) {
-      let c = "", l = 0, h = !1;
-      for (let a = 0, r = this.#e.words.length; a < r; a++) {
-        const u = this.#e.words[a];
-        if (u.type === k.Space) {
-          l += u.count;
-          continue;
-        }
-        const f = e(u)?.find((E) => (E.language ?? "") === i);
-        f && (h && (c += " ".repeat(l)), c += f.content, l = 0, h = !0);
+    return n[0];
+  }
+}
+const H = (r, e) => ({
+  derived: !1,
+  ...e,
+  kind: r
+}), se = (r, e, t, n) => {
+  const i = [];
+  for (let o = 0, h = r.length; o < h; o++) {
+    const a = r[o];
+    if (a.type === k.Space)
+      continue;
+    const l = e(a);
+    if (l)
+      for (const s of l) {
+        const u = t(s);
+        i.includes(u) || i.push(u);
       }
-      const o = new Y();
-      o.content = c, o.language = i || void 0, n.push(o);
-    }
-    return n;
   }
-  /**
-   * Aggregate unknown per-word items into line items, one per key.
-   */
-  #o() {
-    const e = [];
-    for (let n = 0, i = this.#e.words.length; n < i; n++) {
-      const c = this.#e.words[n];
-      if (c.type === k.Space)
+  const c = [];
+  for (const o of i) {
+    let h = "", a = 0, l, s = !1;
+    for (let u = 0, f = r.length; u < f; u++) {
+      const E = r[u];
+      if (E.type === k.Space) {
+        a += E.count;
         continue;
-      const l = c.annotation?.unknowns;
-      if (l)
-        for (const h of l)
-          e.includes(h.key) || e.push(h.key);
-    }
-    if (!e.length)
-      return;
-    const t = [];
-    for (const n of e) {
-      let i = "", c = 0, l, h = !1;
-      for (let a = 0, r = this.#e.words.length; a < r; a++) {
-        const u = this.#e.words[a];
-        if (u.type === k.Space) {
-          c += u.count;
-          continue;
-        }
-        const f = u.annotation?.unknowns?.find((E) => E.key === n);
-        f && (h && (i += " ".repeat(c)), i += f.content, l ??= f.language, c = 0, h = !0);
       }
-      const o = new Zt();
-      o.key = n, o.content = i, o.language = l, t.push(o);
+      const S = e(E)?.find((d) => t(d) === o);
+      S && (s && (h += " ".repeat(a)), h += S.content, l ??= S.language, a = 0, s = !0);
     }
-    return t;
-  }
-  #t;
-  /**
-   * Ruby annotation: the explicit value, otherwise aggregated from words.
-   */
-  get ruby() {
-    return this.#t ?? this.#i((e) => e.annotation?.ruby);
-  }
-  /**
-   * Override the words-derived ruby with an explicit value.
-   */
-  set ruby(e) {
-    this.#t = e;
-  }
-  #r;
-  /**
-   * Romanized transliterations: the explicit value, otherwise aggregated from words grouped by language.
-   */
-  get romans() {
-    return this.#r ?? this.#a((e) => e.annotation?.romans);
-  }
-  /**
-   * Override the words-derived romans with explicit values.
-   */
-  set romans(e) {
-    this.#r = e;
-  }
-  #s;
-  /**
-   * Translations, explicit only since words carry no line-level translation.
-   */
-  get translates() {
-    return this.#s;
-  }
-  /**
-   * Set the explicit translations.
-   */
-  set translates(e) {
-    this.#s = e;
-  }
-  #n;
-  /**
-   * Unknown annotations: the explicit value, otherwise aggregated from words grouped by key.
-   */
-  get unknowns() {
-    return this.#n ?? this.#o();
-  }
-  /**
-   * Override the words-derived unknowns with explicit values.
-   */
-  set unknowns(e) {
-    this.#n = e;
+    s && c.push(n(o, h, l));
+  }
+  return c;
+}, Nr = (r) => {
+  const { words: e, annotation: t } = r;
+  for (const n of Tr) {
+    const i = t.list.some((o) => o.kind === n && !o.derived);
+    if (t.list = t.list.filter((o) => !(o.kind === n && o.derived)), i)
+      continue;
+    let c;
+    switch (n) {
+      case "Ruby":
+        c = se(
+          e,
+          (o) => {
+            const h = o.annotation?.ruby;
+            return h ? [h] : void 0;
+          },
+          () => "",
+          (o, h, a) => H("Ruby", { content: h, language: a, derived: !0 })
+        );
+        break;
+      case "Roman":
+        c = se(
+          e,
+          (o) => o.annotation?.romans,
+          (o) => o.language ?? "",
+          (o, h) => H("Roman", { content: h, language: o || void 0, derived: !0 })
+        );
+        break;
+      default:
+        c = se(
+          e,
+          (o) => o.annotation?.unknowns,
+          (o) => o.key,
+          (o, h, a) => H("Unknown", { content: h, language: a, key: o, derived: !0 })
+        );
+    }
+    t.list.push(...c);
   }
-}
-var er = /* @__PURE__ */ ((s) => (s.Normal = "Normal", s.Interlude = "Interlude", s))(er || {});
-class tr {
-  /**
-   * Unique identifier of the line.
-   */
-  id = B(6).toUpperCase();
+};
+var Qt = /* @__PURE__ */ ((r) => (r.Normal = "Normal", r.Interlude = "Interlude", r))(Qt || {});
+class er {
   /**
    * Time range of the line.
    */
-  time = new Kt();
+  time;
+  constructor(e = {}) {
+    this.time = e.time ?? new Kt();
+  }
 }
-class rr extends tr {
+class tr extends er {
   /**
    * Discriminant marking this as a normal line.
    */
@@ -350,9 +333,18 @@ class rr extends tr {
   /**
    * Words composing the line in order.
    */
-  words = [];
+  words;
+  /**
+   * Annotations applied to the whole line, derived from words unless set explicitly.
+   */
+  annotation;
+  constructor(e = {}) {
+    super(e), this.agent = e.agent, this.words = e.words ?? [], this.annotation = e.annotation ?? new Jt(), e.languages && (this.languages = e.languages);
+  }
   /**
    * Plain text of the line joined from every word.
+   *
+   * Live: recomputed from words on each access.
    */
   get original() {
     let e = "";
@@ -362,13 +354,9 @@ class rr extends tr {
     }
     return e;
   }
-  /**
-   * Annotations applied to the whole line, derived from words unless set explicitly.
-   */
-  annotation = new Qt(this);
   #e;
   /**
-   * Language tags of this line: the value set explicitly, otherwise collected from words.
+   * Language tags of this line: the explicit value, otherwise live-collected from words on each access.
    */
   get languages() {
     if (this.#e?.length)
@@ -387,22 +375,24 @@ class rr extends tr {
     this.#e = e;
   }
 }
-class $r extends rr {
+class Sr extends tr {
   /**
    * Background lines attached to this line.
    */
   background;
+  constructor(e = {}) {
+    super(e), this.background = e.background;
+  }
 }
-class Lr extends tr {
+class Or extends er {
   /**
    * Discriminant marking this as an interlude line.
    */
   type = "Interlude";
 }
-var _ = /* @__PURE__ */ ((s) => (s.Offset = "Offset", s.Duration = "Duration", s.Title = "Title", s.Singer = "Singer", s.Album = "Album", s.Creator = "Creator", s.Author = "Author", s.Isrc = "Isrc", s.Unknown = "Unknown", s))(_ || {});
-const Tr = (s, e, t) => ({
-  id: B(6).toUpperCase(),
-  type: s,
+var rr = /* @__PURE__ */ ((r) => (r.Offset = "Offset", r.Duration = "Duration", r.Title = "Title", r.Singer = "Singer", r.Album = "Album", r.Creator = "Creator", r.Author = "Author", r.Isrc = "Isrc", r.Unknown = "Unknown", r))(rr || {});
+const Ar = (r, e, t) => ({
+  type: r,
   key: e,
   value: t
 });
@@ -410,162 +400,186 @@ class sr {
   /**
    * All meta entries in order.
    */
-  list = [];
-  listOf(e) {
-    return this.list.filter((t) => t.type === e);
+  list;
+  constructor(e = {}) {
+    this.list = e.list ?? [];
   }
   /**
-   * All offset meta entries.
+   * Whether any entry of a meta type exists.
    */
-  get offsets() {
-    return this.listOf(_.Offset);
+  has(e) {
+    return this.list.some((t) => t.type === e);
   }
   /**
-   * All duration meta entries.
+   * All entries of a meta type.
    */
-  get durations() {
-    return this.listOf(_.Duration);
+  all(e) {
+    return this.list.filter((t) => t.type === e);
   }
   /**
-   * All title meta entries.
+   * The first entry of a meta type.
    */
-  get titles() {
-    return this.listOf(_.Title);
+  first(e) {
+    return this.list.find((t) => t.type === e);
   }
   /**
-   * All singer meta entries.
+   * All entries with the given original key.
    */
-  get singers() {
-    return this.listOf(_.Singer);
+  byKey(e) {
+    return this.list.filter((t) => t.key === e);
   }
+}
+var nr = /* @__PURE__ */ ((r) => (r.Person = "Person", r.Group = "Group", r.Other = "Other", r.Unknown = "Unknown", r))(nr || {});
+class wr {
   /**
-   * All album meta entries.
+   * Unique identifier of the agent.
    */
-  get albums() {
-    return this.listOf(_.Album);
-  }
+  id;
   /**
-   * All creator meta entries.
+   * Performing type of the agent.
    */
-  get creators() {
-    return this.listOf(_.Creator);
-  }
+  type;
   /**
-   * All author meta entries.
+   * Number of lines performed by this agent.
+   *
+   * Snapshot filled by `calcAgentIndex` at parse time; stale after lines change.
    */
-  get authors() {
-    return this.listOf(_.Author);
-  }
+  count;
   /**
-   * All isrc meta entries.
+   * Display names of the agent; a group may carry more than one.
    */
-  get isrcs() {
-    return this.listOf(_.Isrc);
+  names;
+  constructor(e = {}) {
+    this.id = e.id ?? "", this.type = e.type ?? "Unknown", this.count = e.count ?? 0, this.names = e.names ?? [];
   }
+}
+class yr {
   /**
-   * All unknown meta entries.
+   * Identifier of the referenced agent.
    */
-  get unknowns() {
-    return this.listOf(_.Unknown);
-  }
-}
-var nr = /* @__PURE__ */ ((s) => (s.Person = "Person", s.Group = "Group", s.Other = "Other", s.Unknown = "Unknown", s))(nr || {});
-class Or {
+  id;
   /**
-   * Unique identifier of the agent.
+   * Index of this agent occurrence among all lines.
+   *
+   * Snapshot filled by `calcAgentIndex` at parse time.
    */
-  id = "";
+  globalIndex;
   /**
-   * Performing type of the agent.
+   * Index of this agent occurrence within its block.
+   *
+   * Snapshot filled by `calcAgentIndex` at parse time.
    */
-  type = "Unknown";
+  blockIndex;
+  constructor(e = {}) {
+    this.id = e.id ?? "", this.globalIndex = e.globalIndex ?? 0, this.blockIndex = e.blockIndex ?? 0;
+  }
+}
+class ir {
   /**
-   * Number of lines performed by this agent.
+   * All agents in order.
    */
-  count = 0;
+  list;
+  constructor(e = {}) {
+    this.list = e.list ?? [];
+  }
   /**
-   * Display names of the agent; a group may carry more than one.
+   * Whether any agent of a type exists.
    */
-  names = [];
-}
-class Sr {
+  has(e) {
+    return this.list.some((t) => t.type === e);
+  }
   /**
-   * Identifier of the referenced Agent.
+   * All agents of a type.
    */
-  id = "";
+  all(e) {
+    return this.list.filter((t) => t.type === e);
+  }
   /**
-   * Index of this agent occurrence among all lines.
+   * The agent with the given id, used to resolve a LineAgent reference.
    */
-  globalIndex = 0;
+  byId(e) {
+    return this.list.find((t) => t.id === e);
+  }
   /**
-   * Index of this agent occurrence within its block.
+   * The agent performing the most lines.
    */
-  blockIndex = 0;
+  get primary() {
+    let e;
+    for (let t = 0, n = this.list.length; t < n; t++)
+      (!e || this.list[t].count > e.count) && (e = this.list[t]);
+    return e;
+  }
 }
-const ir = "0.8.0";
-var ar = /* @__PURE__ */ ((s) => (s.Invalid = "Invalid", s.Empty = "Empty", s.Normal = "Normal", s))(ar || {}), or = /* @__PURE__ */ ((s) => (s.None = "None", s.Line = "Line", s.Syllable = "Syllable", s))(or || {});
-class Nr {
+const ar = "0.9.0";
+var or = /* @__PURE__ */ ((r) => (r.Invalid = "Invalid", r.Empty = "Empty", r.Normal = "Normal", r))(or || {}), lr = /* @__PURE__ */ ((r) => (r.None = "None", r.Line = "Line", r.Syllable = "Syllable", r))(lr || {});
+class Cr {
   /**
    * Schema version of this data model.
    */
-  version = ir;
+  version = ar;
   /**
    * Overall classification of the lyric.
    */
-  type = "Invalid";
+  type;
   /**
    * Timing precision of the lyric.
    */
-  timing = "None";
+  timing;
   /**
    * Metadata of the lyric.
    */
-  meta = new sr();
+  meta;
   /**
    * Language distribution of the lyric.
    */
-  language = new Yt();
+  language;
   /**
    * Performing agents referenced by lines.
    */
-  agents = [];
+  agent;
   /**
    * Lyric lines in order.
    */
-  lines = [];
+  lines;
+  constructor(e = {}) {
+    this.type = e.type ?? "Invalid", this.timing = e.timing ?? "None", this.meta = e.meta ?? new sr(), this.language = e.language ?? new Yt(), this.agent = e.agent ?? new ir(), this.lines = e.lines ?? [];
+  }
 }
-const z = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const X = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  Agent: Or,
+  Agent: ir,
+  AgentItem: wr,
   AgentType: nr,
-  Info: Nr,
-  InfoTiming: or,
-  InfoType: ar,
+  Info: Cr,
+  InfoTiming: lr,
+  InfoType: or,
   Language: Yt,
-  LanguageItem: dr,
+  LanguageItem: Er,
   LanguageType: zt,
-  LineAgent: Sr,
-  LineAnnotation: Qt,
-  LineAnnotationItem: Y,
-  LineInterlude: Lr,
-  LineNormal: $r,
-  LineNormalBase: rr,
-  LineType: er,
-  LineUnknownAnnotation: Zt,
+  LineAgent: yr,
+  LineAnnotation: Jt,
+  LineAnnotationKind: Zt,
+  LineInterlude: Or,
+  LineNormal: Sr,
+  LineNormalBase: tr,
+  LineType: Qt,
   Meta: sr,
-  MetaType: _,
+  MetaType: rr,
   Time: Kt,
-  Version: ir,
-  WordAnnotation: Rr,
-  WordAnnotationContent: Er,
-  WordAnnotationItem: Jt,
-  WordNormal: vr,
-  WordSpace: Ir,
+  Version: ar,
+  WordAnnotation: Ir,
+  WordAnnotationContent: gr,
+  WordAnnotationItem: ze,
+  WordNormal: $r,
+  WordRubyAnnotation: Rr,
+  WordSpace: Lr,
   WordType: k,
-  WordUnknownAnnotation: gr,
-  createMetaItem: Tr
+  WordUnknownAnnotation: vr,
+  createLineAnnotationItem: H,
+  createMetaItem: Ar,
+  deriveLineAnnotation: Nr
 }, Symbol.toStringTag, { value: "Module" }));
-class wr {
+class Pr {
   lines = [];
   mergedEnd = [];
   /**
@@ -587,13 +601,13 @@ class wr {
       this.mergedEnd = c;
       return;
     }
-    const l = Math.max(0, t), h = n > 0 ? n : 1 / 0;
-    let o = this.getRawTime(i - 1);
-    c[i - 1] = o;
-    let a = 1;
-    for (let r = i - 2; r >= 0; r--) {
-      const u = this.getRawTime(r);
-      l > 0 && a < h && Math.abs(o - u) < l ? (c[r] = Math.max(u, c[r + 1]), a++) : (c[r] = u, a = 1), o = u;
+    const o = Math.max(0, t), h = n > 0 ? n : 1 / 0;
+    let a = this.getRawTime(i - 1);
+    c[i - 1] = a;
+    let l = 1;
+    for (let s = i - 2; s >= 0; s--) {
+      const u = this.getRawTime(s);
+      o > 0 && l < h && Math.abs(a - u) < o ? (c[s] = Math.max(u, c[s + 1]), l++) : (c[s] = u, l = 1), a = u;
     }
     this.mergedEnd = c;
   }
@@ -605,7 +619,7 @@ class wr {
     return t === void 0 ? this.getRawTime(e) : t;
   }
 }
-class Ar {
+class qr {
   temp = 0;
   meta = 0;
   setTemp(e) {
@@ -619,7 +633,7 @@ class Ar {
       this.meta = 0;
       return;
     }
-    const n = e.meta.offsets[0]?.value;
+    const n = e.meta.first(X.MetaType.Offset)?.value;
     this.meta = typeof n == "number" && Number.isFinite(n) ? n : 0;
   }
   resolve(e) {
@@ -627,7 +641,7 @@ class Ar {
     return Number.isFinite(t) ? t : 0;
   }
 }
-class yr {
+class br {
   frameId = null;
   timerId = null;
   schedule(e, t) {
@@ -644,13 +658,13 @@ class yr {
     this.frameId !== null && (globalThis.cancelAnimationFrame(this.frameId), this.frameId = null), this.timerId !== null && (globalThis.clearTimeout(this.timerId), this.timerId = null);
   }
 }
-var H = { exports: {} }, ie, tt;
-function K() {
-  if (tt) return ie;
+var W = { exports: {} }, ne, tt;
+function z() {
+  if (tt) return ne;
   tt = 1;
-  const s = "2.0.0", e = 256, t = Number.MAX_SAFE_INTEGER || /* istanbul ignore next */
+  const r = "2.0.0", e = 256, t = Number.MAX_SAFE_INTEGER || /* istanbul ignore next */
   9007199254740991, n = 16, i = e - 6;
-  return ie = {
+  return ne = {
     MAX_LENGTH: e,
     MAX_SAFE_COMPONENT_LENGTH: n,
     MAX_SAFE_BUILD_LENGTH: i,
@@ -664,86 +678,86 @@ function K() {
       "prepatch",
       "prerelease"
     ],
-    SEMVER_SPEC_VERSION: s,
+    SEMVER_SPEC_VERSION: r,
     FLAG_INCLUDE_PRERELEASE: 1,
     FLAG_LOOSE: 2
-  }, ie;
+  }, ne;
 }
-var ae, rt;
-function J() {
-  return rt || (rt = 1, ae = typeof process == "object" && process.env && process.env.NODE_DEBUG && /\bsemver\b/i.test(process.env.NODE_DEBUG) ? (...e) => console.error("SEMVER", ...e) : () => {
-  }), ae;
+var ie, rt;
+function Y() {
+  return rt || (rt = 1, ie = typeof process == "object" && process.env && process.env.NODE_DEBUG && /\bsemver\b/i.test(process.env.NODE_DEBUG) ? (...e) => console.error("SEMVER", ...e) : () => {
+  }), ie;
 }
 var st;
-function W() {
-  return st || (st = 1, (function(s, e) {
+function B() {
+  return st || (st = 1, (function(r, e) {
     const {
       MAX_SAFE_COMPONENT_LENGTH: t,
       MAX_SAFE_BUILD_LENGTH: n,
       MAX_LENGTH: i
-    } = K(), c = J();
-    e = s.exports = {};
-    const l = e.re = [], h = e.safeRe = [], o = e.src = [], a = e.safeSrc = [], r = e.t = {};
+    } = z(), c = Y();
+    e = r.exports = {};
+    const o = e.re = [], h = e.safeRe = [], a = e.src = [], l = e.safeSrc = [], s = e.t = {};
     let u = 0;
     const f = "[a-zA-Z0-9-]", E = [
       ["\\s", 1],
       ["\\d", i],
       [f, n]
-    ], S = (O) => {
-      for (const [w, G] of E)
-        O = O.split(`${w}*`).join(`${w}{0,${G}}`).split(`${w}+`).join(`${w}{1,${G}}`);
-      return O;
-    }, p = (O, w, G) => {
-      const A = S(w), b = u++;
-      c(O, b, w), r[O] = b, o[b] = w, a[b] = A, l[b] = new RegExp(w, G ? "g" : void 0), h[b] = new RegExp(A, G ? "g" : void 0);
+    ], S = (N) => {
+      for (const [A, b] of E)
+        N = N.split(`${A}*`).join(`${A}{0,${b}}`).split(`${A}+`).join(`${A}{1,${b}}`);
+      return N;
+    }, d = (N, A, b) => {
+      const w = S(A), G = u++;
+      c(N, G, A), s[N] = G, a[G] = A, l[G] = w, o[G] = new RegExp(A, b ? "g" : void 0), h[G] = new RegExp(w, b ? "g" : void 0);
     };
-    p("NUMERICIDENTIFIER", "0|[1-9]\\d*"), p("NUMERICIDENTIFIERLOOSE", "\\d+"), p("NONNUMERICIDENTIFIER", `\\d*[a-zA-Z-]${f}*`), p("MAINVERSION", `(${o[r.NUMERICIDENTIFIER]})\\.(${o[r.NUMERICIDENTIFIER]})\\.(${o[r.NUMERICIDENTIFIER]})`), p("MAINVERSIONLOOSE", `(${o[r.NUMERICIDENTIFIERLOOSE]})\\.(${o[r.NUMERICIDENTIFIERLOOSE]})\\.(${o[r.NUMERICIDENTIFIERLOOSE]})`), p("PRERELEASEIDENTIFIER", `(?:${o[r.NONNUMERICIDENTIFIER]}|${o[r.NUMERICIDENTIFIER]})`), p("PRERELEASEIDENTIFIERLOOSE", `(?:${o[r.NONNUMERICIDENTIFIER]}|${o[r.NUMERICIDENTIFIERLOOSE]})`), p("PRERELEASE", `(?:-(${o[r.PRERELEASEIDENTIFIER]}(?:\\.${o[r.PRERELEASEIDENTIFIER]})*))`), p("PRERELEASELOOSE", `(?:-?(${o[r.PRERELEASEIDENTIFIERLOOSE]}(?:\\.${o[r.PRERELEASEIDENTIFIERLOOSE]})*))`), p("BUILDIDENTIFIER", `${f}+`), p("BUILD", `(?:\\+(${o[r.BUILDIDENTIFIER]}(?:\\.${o[r.BUILDIDENTIFIER]})*))`), p("FULLPLAIN", `v?${o[r.MAINVERSION]}${o[r.PRERELEASE]}?${o[r.BUILD]}?`), p("FULL", `^${o[r.FULLPLAIN]}$`), p("LOOSEPLAIN", `[v=\\s]*${o[r.MAINVERSIONLOOSE]}${o[r.PRERELEASELOOSE]}?${o[r.BUILD]}?`), p("LOOSE", `^${o[r.LOOSEPLAIN]}$`), p("GTLT", "((?:<|>)?=?)"), p("XRANGEIDENTIFIERLOOSE", `${o[r.NUMERICIDENTIFIERLOOSE]}|x|X|\\*`), p("XRANGEIDENTIFIER", `${o[r.NUMERICIDENTIFIER]}|x|X|\\*`), p("XRANGEPLAIN", `[v=\\s]*(${o[r.XRANGEIDENTIFIER]})(?:\\.(${o[r.XRANGEIDENTIFIER]})(?:\\.(${o[r.XRANGEIDENTIFIER]})(?:${o[r.PRERELEASE]})?${o[r.BUILD]}?)?)?`), p("XRANGEPLAINLOOSE", `[v=\\s]*(${o[r.XRANGEIDENTIFIERLOOSE]})(?:\\.(${o[r.XRANGEIDENTIFIERLOOSE]})(?:\\.(${o[r.XRANGEIDENTIFIERLOOSE]})(?:${o[r.PRERELEASELOOSE]})?${o[r.BUILD]}?)?)?`), p("XRANGE", `^${o[r.GTLT]}\\s*${o[r.XRANGEPLAIN]}$`), p("XRANGELOOSE", `^${o[r.GTLT]}\\s*${o[r.XRANGEPLAINLOOSE]}$`), p("COERCEPLAIN", `(^|[^\\d])(\\d{1,${t}})(?:\\.(\\d{1,${t}}))?(?:\\.(\\d{1,${t}}))?`), p("COERCE", `${o[r.COERCEPLAIN]}(?:$|[^\\d])`), p("COERCEFULL", o[r.COERCEPLAIN] + `(?:${o[r.PRERELEASE]})?(?:${o[r.BUILD]})?(?:$|[^\\d])`), p("COERCERTL", o[r.COERCE], !0), p("COERCERTLFULL", o[r.COERCEFULL], !0), p("LONETILDE", "(?:~>?)"), p("TILDETRIM", `(\\s*)${o[r.LONETILDE]}\\s+`, !0), e.tildeTrimReplace = "$1~", p("TILDE", `^${o[r.LONETILDE]}${o[r.XRANGEPLAIN]}$`), p("TILDELOOSE", `^${o[r.LONETILDE]}${o[r.XRANGEPLAINLOOSE]}$`), p("LONECARET", "(?:\\^)"), p("CARETTRIM", `(\\s*)${o[r.LONECARET]}\\s+`, !0), e.caretTrimReplace = "$1^", p("CARET", `^${o[r.LONECARET]}${o[r.XRANGEPLAIN]}$`), p("CARETLOOSE", `^${o[r.LONECARET]}${o[r.XRANGEPLAINLOOSE]}$`), p("COMPARATORLOOSE", `^${o[r.GTLT]}\\s*(${o[r.LOOSEPLAIN]})$|^$`), p("COMPARATOR", `^${o[r.GTLT]}\\s*(${o[r.FULLPLAIN]})$|^$`), p("COMPARATORTRIM", `(\\s*)${o[r.GTLT]}\\s*(${o[r.LOOSEPLAIN]}|${o[r.XRANGEPLAIN]})`, !0), e.comparatorTrimReplace = "$1$2$3", p("HYPHENRANGE", `^\\s*(${o[r.XRANGEPLAIN]})\\s+-\\s+(${o[r.XRANGEPLAIN]})\\s*$`), p("HYPHENRANGELOOSE", `^\\s*(${o[r.XRANGEPLAINLOOSE]})\\s+-\\s+(${o[r.XRANGEPLAINLOOSE]})\\s*$`), p("STAR", "(<|>)?=?\\s*\\*"), p("GTE0", "^\\s*>=\\s*0\\.0\\.0\\s*$"), p("GTE0PRE", "^\\s*>=\\s*0\\.0\\.0-0\\s*$");
-  })(H, H.exports)), H.exports;
+    d("NUMERICIDENTIFIER", "0|[1-9]\\d*"), d("NUMERICIDENTIFIERLOOSE", "\\d+"), d("NONNUMERICIDENTIFIER", `\\d*[a-zA-Z-]${f}*`), d("MAINVERSION", `(${a[s.NUMERICIDENTIFIER]})\\.(${a[s.NUMERICIDENTIFIER]})\\.(${a[s.NUMERICIDENTIFIER]})`), d("MAINVERSIONLOOSE", `(${a[s.NUMERICIDENTIFIERLOOSE]})\\.(${a[s.NUMERICIDENTIFIERLOOSE]})\\.(${a[s.NUMERICIDENTIFIERLOOSE]})`), d("PRERELEASEIDENTIFIER", `(?:${a[s.NONNUMERICIDENTIFIER]}|${a[s.NUMERICIDENTIFIER]})`), d("PRERELEASEIDENTIFIERLOOSE", `(?:${a[s.NONNUMERICIDENTIFIER]}|${a[s.NUMERICIDENTIFIERLOOSE]})`), d("PRERELEASE", `(?:-(${a[s.PRERELEASEIDENTIFIER]}(?:\\.${a[s.PRERELEASEIDENTIFIER]})*))`), d("PRERELEASELOOSE", `(?:-?(${a[s.PRERELEASEIDENTIFIERLOOSE]}(?:\\.${a[s.PRERELEASEIDENTIFIERLOOSE]})*))`), d("BUILDIDENTIFIER", `${f}+`), d("BUILD", `(?:\\+(${a[s.BUILDIDENTIFIER]}(?:\\.${a[s.BUILDIDENTIFIER]})*))`), d("FULLPLAIN", `v?${a[s.MAINVERSION]}${a[s.PRERELEASE]}?${a[s.BUILD]}?`), d("FULL", `^${a[s.FULLPLAIN]}$`), d("LOOSEPLAIN", `[v=\\s]*${a[s.MAINVERSIONLOOSE]}${a[s.PRERELEASELOOSE]}?${a[s.BUILD]}?`), d("LOOSE", `^${a[s.LOOSEPLAIN]}$`), d("GTLT", "((?:<|>)?=?)"), d("XRANGEIDENTIFIERLOOSE", `${a[s.NUMERICIDENTIFIERLOOSE]}|x|X|\\*`), d("XRANGEIDENTIFIER", `${a[s.NUMERICIDENTIFIER]}|x|X|\\*`), d("XRANGEPLAIN", `[v=\\s]*(${a[s.XRANGEIDENTIFIER]})(?:\\.(${a[s.XRANGEIDENTIFIER]})(?:\\.(${a[s.XRANGEIDENTIFIER]})(?:${a[s.PRERELEASE]})?${a[s.BUILD]}?)?)?`), d("XRANGEPLAINLOOSE", `[v=\\s]*(${a[s.XRANGEIDENTIFIERLOOSE]})(?:\\.(${a[s.XRANGEIDENTIFIERLOOSE]})(?:\\.(${a[s.XRANGEIDENTIFIERLOOSE]})(?:${a[s.PRERELEASELOOSE]})?${a[s.BUILD]}?)?)?`), d("XRANGE", `^${a[s.GTLT]}\\s*${a[s.XRANGEPLAIN]}$`), d("XRANGELOOSE", `^${a[s.GTLT]}\\s*${a[s.XRANGEPLAINLOOSE]}$`), d("COERCEPLAIN", `(^|[^\\d])(\\d{1,${t}})(?:\\.(\\d{1,${t}}))?(?:\\.(\\d{1,${t}}))?`), d("COERCE", `${a[s.COERCEPLAIN]}(?:$|[^\\d])`), d("COERCEFULL", a[s.COERCEPLAIN] + `(?:${a[s.PRERELEASE]})?(?:${a[s.BUILD]})?(?:$|[^\\d])`), d("COERCERTL", a[s.COERCE], !0), d("COERCERTLFULL", a[s.COERCEFULL], !0), d("LONETILDE", "(?:~>?)"), d("TILDETRIM", `(\\s*)${a[s.LONETILDE]}\\s+`, !0), e.tildeTrimReplace = "$1~", d("TILDE", `^${a[s.LONETILDE]}${a[s.XRANGEPLAIN]}$`), d("TILDELOOSE", `^${a[s.LONETILDE]}${a[s.XRANGEPLAINLOOSE]}$`), d("LONECARET", "(?:\\^)"), d("CARETTRIM", `(\\s*)${a[s.LONECARET]}\\s+`, !0), e.caretTrimReplace = "$1^", d("CARET", `^${a[s.LONECARET]}${a[s.XRANGEPLAIN]}$`), d("CARETLOOSE", `^${a[s.LONECARET]}${a[s.XRANGEPLAINLOOSE]}$`), d("COMPARATORLOOSE", `^${a[s.GTLT]}\\s*(${a[s.LOOSEPLAIN]})$|^$`), d("COMPARATOR", `^${a[s.GTLT]}\\s*(${a[s.FULLPLAIN]})$|^$`), d("COMPARATORTRIM", `(\\s*)${a[s.GTLT]}\\s*(${a[s.LOOSEPLAIN]}|${a[s.XRANGEPLAIN]})`, !0), e.comparatorTrimReplace = "$1$2$3", d("HYPHENRANGE", `^\\s*(${a[s.XRANGEPLAIN]})\\s+-\\s+(${a[s.XRANGEPLAIN]})\\s*$`), d("HYPHENRANGELOOSE", `^\\s*(${a[s.XRANGEPLAINLOOSE]})\\s+-\\s+(${a[s.XRANGEPLAINLOOSE]})\\s*$`), d("STAR", "(<|>)?=?\\s*\\*"), d("GTE0", "^\\s*>=\\s*0\\.0\\.0\\s*$"), d("GTE0PRE", "^\\s*>=\\s*0\\.0\\.0-0\\s*$");
+  })(W, W.exports)), W.exports;
 }
-var oe, nt;
+var ae, nt;
 function Ye() {
-  if (nt) return oe;
+  if (nt) return ae;
   nt = 1;
-  const s = Object.freeze({ loose: !0 }), e = Object.freeze({});
-  return oe = (n) => n ? typeof n != "object" ? s : n : e, oe;
+  const r = Object.freeze({ loose: !0 }), e = Object.freeze({});
+  return ae = (n) => n ? typeof n != "object" ? r : n : e, ae;
 }
-var le, it;
-function lr() {
-  if (it) return le;
+var oe, it;
+function cr() {
+  if (it) return oe;
   it = 1;
-  const s = /^[0-9]+$/, e = (n, i) => {
+  const r = /^[0-9]+$/, e = (n, i) => {
     if (typeof n == "number" && typeof i == "number")
       return n === i ? 0 : n < i ? -1 : 1;
-    const c = s.test(n), l = s.test(i);
-    return c && l && (n = +n, i = +i), n === i ? 0 : c && !l ? -1 : l && !c ? 1 : n < i ? -1 : 1;
+    const c = r.test(n), o = r.test(i);
+    return c && o && (n = +n, i = +i), n === i ? 0 : c && !o ? -1 : o && !c ? 1 : n < i ? -1 : 1;
   };
-  return le = {
+  return oe = {
     compareIdentifiers: e,
     rcompareIdentifiers: (n, i) => e(i, n)
-  }, le;
+  }, oe;
 }
-var ce, at;
-function x() {
-  if (at) return ce;
+var le, at;
+function D() {
+  if (at) return le;
   at = 1;
-  const s = J(), { MAX_LENGTH: e, MAX_SAFE_INTEGER: t } = K(), { safeRe: n, t: i } = W(), c = Ye(), { compareIdentifiers: l } = lr();
+  const r = Y(), { MAX_LENGTH: e, MAX_SAFE_INTEGER: t } = z(), { safeRe: n, t: i } = B(), c = Ye(), { compareIdentifiers: o } = cr();
   class h {
-    constructor(a, r) {
-      if (r = c(r), a instanceof h) {
-        if (a.loose === !!r.loose && a.includePrerelease === !!r.includePrerelease)
-          return a;
-        a = a.version;
-      } else if (typeof a != "string")
-        throw new TypeError(`Invalid version. Must be a string. Got type "${typeof a}".`);
-      if (a.length > e)
+    constructor(l, s) {
+      if (s = c(s), l instanceof h) {
+        if (l.loose === !!s.loose && l.includePrerelease === !!s.includePrerelease)
+          return l;
+        l = l.version;
+      } else if (typeof l != "string")
+        throw new TypeError(`Invalid version. Must be a string. Got type "${typeof l}".`);
+      if (l.length > e)
         throw new TypeError(
           `version is longer than ${e} characters`
         );
-      s("SemVer", a, r), this.options = r, this.loose = !!r.loose, this.includePrerelease = !!r.includePrerelease;
-      const u = a.trim().match(r.loose ? n[i.LOOSE] : n[i.FULL]);
+      r("SemVer", l, s), this.options = s, this.loose = !!s.loose, this.includePrerelease = !!s.includePrerelease;
+      const u = l.trim().match(s.loose ? n[i.LOOSE] : n[i.FULL]);
       if (!u)
-        throw new TypeError(`Invalid Version: ${a}`);
-      if (this.raw = a, this.major = +u[1], this.minor = +u[2], this.patch = +u[3], this.major > t || this.major < 0)
+        throw new TypeError(`Invalid Version: ${l}`);
+      if (this.raw = l, this.major = +u[1], this.minor = +u[2], this.patch = +u[3], this.major > t || this.major < 0)
         throw new TypeError("Invalid major version");
       if (this.minor > t || this.minor < 0)
         throw new TypeError("Invalid minor version");
@@ -764,28 +778,28 @@ function x() {
     toString() {
       return this.version;
     }
-    compare(a) {
-      if (s("SemVer.compare", this.version, this.options, a), !(a instanceof h)) {
-        if (typeof a == "string" && a === this.version)
+    compare(l) {
+      if (r("SemVer.compare", this.version, this.options, l), !(l instanceof h)) {
+        if (typeof l == "string" && l === this.version)
           return 0;
-        a = new h(a, this.options);
+        l = new h(l, this.options);
       }
-      return a.version === this.version ? 0 : this.compareMain(a) || this.comparePre(a);
+      return l.version === this.version ? 0 : this.compareMain(l) || this.comparePre(l);
     }
-    compareMain(a) {
-      return a instanceof h || (a = new h(a, this.options)), this.major < a.major ? -1 : this.major > a.major ? 1 : this.minor < a.minor ? -1 : this.minor > a.minor ? 1 : this.patch < a.patch ? -1 : this.patch > a.patch ? 1 : 0;
+    compareMain(l) {
+      return l instanceof h || (l = new h(l, this.options)), this.major < l.major ? -1 : this.major > l.major ? 1 : this.minor < l.minor ? -1 : this.minor > l.minor ? 1 : this.patch < l.patch ? -1 : this.patch > l.patch ? 1 : 0;
     }
-    comparePre(a) {
-      if (a instanceof h || (a = new h(a, this.options)), this.prerelease.length && !a.prerelease.length)
+    comparePre(l) {
+      if (l instanceof h || (l = new h(l, this.options)), this.prerelease.length && !l.prerelease.length)
         return -1;
-      if (!this.prerelease.length && a.prerelease.length)
+      if (!this.prerelease.length && l.prerelease.length)
         return 1;
-      if (!this.prerelease.length && !a.prerelease.length)
+      if (!this.prerelease.length && !l.prerelease.length)
         return 0;
-      let r = 0;
+      let s = 0;
       do {
-        const u = this.prerelease[r], f = a.prerelease[r];
-        if (s("prerelease compare", r, u, f), u === void 0 && f === void 0)
+        const u = this.prerelease[s], f = l.prerelease[s];
+        if (r("prerelease compare", s, u, f), u === void 0 && f === void 0)
           return 0;
         if (f === void 0)
           return 1;
@@ -793,15 +807,15 @@ function x() {
           return -1;
         if (u === f)
           continue;
-        return l(u, f);
-      } while (++r);
+        return o(u, f);
+      } while (++s);
     }
-    compareBuild(a) {
-      a instanceof h || (a = new h(a, this.options));
-      let r = 0;
+    compareBuild(l) {
+      l instanceof h || (l = new h(l, this.options));
+      let s = 0;
       do {
-        const u = this.build[r], f = a.build[r];
-        if (s("build compare", r, u, f), u === void 0 && f === void 0)
+        const u = this.build[s], f = l.build[s];
+        if (r("build compare", s, u, f), u === void 0 && f === void 0)
           return 0;
         if (f === void 0)
           return 1;
@@ -809,35 +823,35 @@ function x() {
           return -1;
         if (u === f)
           continue;
-        return l(u, f);
-      } while (++r);
+        return o(u, f);
+      } while (++s);
     }
     // preminor will bump the version up to the next minor release, and immediately
     // down to pre-release. premajor and prepatch work the same way.
-    inc(a, r, u) {
-      if (a.startsWith("pre")) {
-        if (!r && u === !1)
+    inc(l, s, u) {
+      if (l.startsWith("pre")) {
+        if (!s && u === !1)
           throw new Error("invalid increment argument: identifier is empty");
-        if (r) {
-          const f = `-${r}`.match(this.options.loose ? n[i.PRERELEASELOOSE] : n[i.PRERELEASE]);
-          if (!f || f[1] !== r)
-            throw new Error(`invalid identifier: ${r}`);
+        if (s) {
+          const f = `-${s}`.match(this.options.loose ? n[i.PRERELEASELOOSE] : n[i.PRERELEASE]);
+          if (!f || f[1] !== s)
+            throw new Error(`invalid identifier: ${s}`);
         }
       }
-      switch (a) {
+      switch (l) {
         case "premajor":
-          this.prerelease.length = 0, this.patch = 0, this.minor = 0, this.major++, this.inc("pre", r, u);
+          this.prerelease.length = 0, this.patch = 0, this.minor = 0, this.major++, this.inc("pre", s, u);
           break;
         case "preminor":
-          this.prerelease.length = 0, this.patch = 0, this.minor++, this.inc("pre", r, u);
+          this.prerelease.length = 0, this.patch = 0, this.minor++, this.inc("pre", s, u);
           break;
         case "prepatch":
-          this.prerelease.length = 0, this.inc("patch", r, u), this.inc("pre", r, u);
+          this.prerelease.length = 0, this.inc("patch", s, u), this.inc("pre", s, u);
           break;
         // If the input is a non-prerelease version, this acts the same as
         // prepatch.
         case "prerelease":
-          this.prerelease.length === 0 && this.inc("patch", r, u), this.inc("pre", r, u);
+          this.prerelease.length === 0 && this.inc("patch", s, u), this.inc("pre", s, u);
           break;
         case "release":
           if (this.prerelease.length === 0)
@@ -864,263 +878,263 @@ function x() {
             for (; --E >= 0; )
               typeof this.prerelease[E] == "number" && (this.prerelease[E]++, E = -2);
             if (E === -1) {
-              if (r === this.prerelease.join(".") && u === !1)
+              if (s === this.prerelease.join(".") && u === !1)
                 throw new Error("invalid increment argument: identifier already exists");
               this.prerelease.push(f);
             }
           }
-          if (r) {
-            let E = [r, f];
-            u === !1 && (E = [r]), l(this.prerelease[0], r) === 0 ? isNaN(this.prerelease[1]) && (this.prerelease = E) : this.prerelease = E;
+          if (s) {
+            let E = [s, f];
+            u === !1 && (E = [s]), o(this.prerelease[0], s) === 0 ? isNaN(this.prerelease[1]) && (this.prerelease = E) : this.prerelease = E;
           }
           break;
         }
         default:
-          throw new Error(`invalid increment argument: ${a}`);
+          throw new Error(`invalid increment argument: ${l}`);
       }
       return this.raw = this.format(), this.build.length && (this.raw += `+${this.build.join(".")}`), this;
     }
   }
-  return ce = h, ce;
+  return le = h, le;
 }
-var ue, ot;
-function M() {
-  if (ot) return ue;
+var ce, ot;
+function j() {
+  if (ot) return ce;
   ot = 1;
-  const s = x();
-  return ue = (t, n, i = !1) => {
-    if (t instanceof s)
+  const r = D();
+  return ce = (t, n, i = !1) => {
+    if (t instanceof r)
       return t;
     try {
-      return new s(t, n);
+      return new r(t, n);
     } catch (c) {
       if (!i)
         return null;
       throw c;
     }
-  }, ue;
+  }, ce;
 }
-var he, lt;
-function Cr() {
-  if (lt) return he;
+var ue, lt;
+function Gr() {
+  if (lt) return ue;
   lt = 1;
-  const s = M();
-  return he = (t, n) => {
-    const i = s(t, n);
+  const r = j();
+  return ue = (t, n) => {
+    const i = r(t, n);
     return i ? i.version : null;
-  }, he;
+  }, ue;
 }
-var fe, ct;
-function Pr() {
-  if (ct) return fe;
+var he, ct;
+function xr() {
+  if (ct) return he;
   ct = 1;
-  const s = M();
-  return fe = (t, n) => {
-    const i = s(t.trim().replace(/^[=v]+/, ""), n);
+  const r = j();
+  return he = (t, n) => {
+    const i = r(t.trim().replace(/^[=v]+/, ""), n);
     return i ? i.version : null;
-  }, fe;
+  }, he;
 }
-var me, ut;
-function qr() {
-  if (ut) return me;
+var fe, ut;
+function Dr() {
+  if (ut) return fe;
   ut = 1;
-  const s = x();
-  return me = (t, n, i, c, l) => {
-    typeof i == "string" && (l = c, c = i, i = void 0);
+  const r = D();
+  return fe = (t, n, i, c, o) => {
+    typeof i == "string" && (o = c, c = i, i = void 0);
     try {
-      return new s(
-        t instanceof s ? t.version : t,
+      return new r(
+        t instanceof r ? t.version : t,
         i
-      ).inc(n, c, l).version;
+      ).inc(n, c, o).version;
     } catch {
       return null;
     }
-  }, me;
+  }, fe;
 }
-var pe, ht;
-function Gr() {
-  if (ht) return pe;
+var me, ht;
+function _r() {
+  if (ht) return me;
   ht = 1;
-  const s = M();
-  return pe = (t, n) => {
-    const i = s(t, null, !0), c = s(n, null, !0), l = i.compare(c);
-    if (l === 0)
+  const r = j();
+  return me = (t, n) => {
+    const i = r(t, null, !0), c = r(n, null, !0), o = i.compare(c);
+    if (o === 0)
       return null;
-    const h = l > 0, o = h ? i : c, a = h ? c : i, r = !!o.prerelease.length;
-    if (!!a.prerelease.length && !r) {
-      if (!a.patch && !a.minor)
+    const h = o > 0, a = h ? i : c, l = h ? c : i, s = !!a.prerelease.length;
+    if (!!l.prerelease.length && !s) {
+      if (!l.patch && !l.minor)
         return "major";
-      if (a.compareMain(o) === 0)
-        return a.minor && !a.patch ? "minor" : "patch";
+      if (l.compareMain(a) === 0)
+        return l.minor && !l.patch ? "minor" : "patch";
     }
-    const f = r ? "pre" : "";
+    const f = s ? "pre" : "";
     return i.major !== c.major ? f + "major" : i.minor !== c.minor ? f + "minor" : i.patch !== c.patch ? f + "patch" : "prerelease";
-  }, pe;
+  }, me;
 }
 var de, ft;
-function br() {
+function Ur() {
   if (ft) return de;
   ft = 1;
-  const s = x();
-  return de = (t, n) => new s(t, n).major, de;
+  const r = D();
+  return de = (t, n) => new r(t, n).major, de;
 }
-var Ee, mt;
-function Dr() {
-  if (mt) return Ee;
+var pe, mt;
+function Fr() {
+  if (mt) return pe;
   mt = 1;
-  const s = x();
-  return Ee = (t, n) => new s(t, n).minor, Ee;
+  const r = D();
+  return pe = (t, n) => new r(t, n).minor, pe;
+}
+var Ee, dt;
+function kr() {
+  if (dt) return Ee;
+  dt = 1;
+  const r = D();
+  return Ee = (t, n) => new r(t, n).patch, Ee;
 }
 var ge, pt;
-function xr() {
+function jr() {
   if (pt) return ge;
   pt = 1;
-  const s = x();
-  return ge = (t, n) => new s(t, n).patch, ge;
-}
-var Re, dt;
-function Ur() {
-  if (dt) return Re;
-  dt = 1;
-  const s = M();
-  return Re = (t, n) => {
-    const i = s(t, n);
+  const r = j();
+  return ge = (t, n) => {
+    const i = r(t, n);
     return i && i.prerelease.length ? i.prerelease : null;
-  }, Re;
+  }, ge;
 }
-var ve, Et;
-function F() {
-  if (Et) return ve;
+var Re, Et;
+function U() {
+  if (Et) return Re;
   Et = 1;
-  const s = x();
-  return ve = (t, n, i) => new s(t, i).compare(new s(n, i)), ve;
+  const r = D();
+  return Re = (t, n, i) => new r(t, i).compare(new r(n, i)), Re;
 }
-var Ie, gt;
-function _r() {
-  if (gt) return Ie;
+var ve, gt;
+function Mr() {
+  if (gt) return ve;
   gt = 1;
-  const s = F();
-  return Ie = (t, n, i) => s(n, t, i), Ie;
+  const r = U();
+  return ve = (t, n, i) => r(n, t, i), ve;
 }
-var $e, Rt;
-function Fr() {
-  if (Rt) return $e;
+var Ie, Rt;
+function Vr() {
+  if (Rt) return Ie;
   Rt = 1;
-  const s = F();
-  return $e = (t, n) => s(t, n, !0), $e;
+  const r = U();
+  return Ie = (t, n) => r(t, n, !0), Ie;
 }
-var Le, vt;
+var $e, vt;
 function Ke() {
-  if (vt) return Le;
+  if (vt) return $e;
   vt = 1;
-  const s = x();
-  return Le = (t, n, i) => {
-    const c = new s(t, i), l = new s(n, i);
-    return c.compare(l) || c.compareBuild(l);
-  }, Le;
+  const r = D();
+  return $e = (t, n, i) => {
+    const c = new r(t, i), o = new r(n, i);
+    return c.compare(o) || c.compareBuild(o);
+  }, $e;
 }
-var Te, It;
-function jr() {
-  if (It) return Te;
+var Le, It;
+function Xr() {
+  if (It) return Le;
   It = 1;
-  const s = Ke();
-  return Te = (t, n) => t.sort((i, c) => s(i, c, n)), Te;
+  const r = Ke();
+  return Le = (t, n) => t.sort((i, c) => r(i, c, n)), Le;
 }
-var Oe, $t;
-function kr() {
-  if ($t) return Oe;
+var Te, $t;
+function Br() {
+  if ($t) return Te;
   $t = 1;
-  const s = Ke();
-  return Oe = (t, n) => t.sort((i, c) => s(c, i, n)), Oe;
+  const r = Ke();
+  return Te = (t, n) => t.sort((i, c) => r(c, i, n)), Te;
 }
-var Se, Lt;
-function Z() {
-  if (Lt) return Se;
+var Ne, Lt;
+function K() {
+  if (Lt) return Ne;
   Lt = 1;
-  const s = F();
-  return Se = (t, n, i) => s(t, n, i) > 0, Se;
+  const r = U();
+  return Ne = (t, n, i) => r(t, n, i) > 0, Ne;
 }
-var Ne, Tt;
-function Je() {
-  if (Tt) return Ne;
+var Se, Tt;
+function Ze() {
+  if (Tt) return Se;
   Tt = 1;
-  const s = F();
-  return Ne = (t, n, i) => s(t, n, i) < 0, Ne;
+  const r = U();
+  return Se = (t, n, i) => r(t, n, i) < 0, Se;
 }
-var we, Ot;
-function cr() {
-  if (Ot) return we;
-  Ot = 1;
-  const s = F();
-  return we = (t, n, i) => s(t, n, i) === 0, we;
+var Oe, Nt;
+function ur() {
+  if (Nt) return Oe;
+  Nt = 1;
+  const r = U();
+  return Oe = (t, n, i) => r(t, n, i) === 0, Oe;
 }
 var Ae, St;
-function ur() {
+function hr() {
   if (St) return Ae;
   St = 1;
-  const s = F();
-  return Ae = (t, n, i) => s(t, n, i) !== 0, Ae;
+  const r = U();
+  return Ae = (t, n, i) => r(t, n, i) !== 0, Ae;
 }
-var ye, Nt;
-function Ze() {
-  if (Nt) return ye;
-  Nt = 1;
-  const s = F();
-  return ye = (t, n, i) => s(t, n, i) >= 0, ye;
+var we, Ot;
+function Je() {
+  if (Ot) return we;
+  Ot = 1;
+  const r = U();
+  return we = (t, n, i) => r(t, n, i) >= 0, we;
 }
-var Ce, wt;
+var ye, At;
 function Qe() {
+  if (At) return ye;
+  At = 1;
+  const r = U();
+  return ye = (t, n, i) => r(t, n, i) <= 0, ye;
+}
+var Ce, wt;
+function fr() {
   if (wt) return Ce;
   wt = 1;
-  const s = F();
-  return Ce = (t, n, i) => s(t, n, i) <= 0, Ce;
-}
-var Pe, At;
-function hr() {
-  if (At) return Pe;
-  At = 1;
-  const s = cr(), e = ur(), t = Z(), n = Ze(), i = Je(), c = Qe();
-  return Pe = (h, o, a, r) => {
-    switch (o) {
+  const r = ur(), e = hr(), t = K(), n = Je(), i = Ze(), c = Qe();
+  return Ce = (h, a, l, s) => {
+    switch (a) {
       case "===":
-        return typeof h == "object" && (h = h.version), typeof a == "object" && (a = a.version), h === a;
+        return typeof h == "object" && (h = h.version), typeof l == "object" && (l = l.version), h === l;
       case "!==":
-        return typeof h == "object" && (h = h.version), typeof a == "object" && (a = a.version), h !== a;
+        return typeof h == "object" && (h = h.version), typeof l == "object" && (l = l.version), h !== l;
       case "":
       case "=":
       case "==":
-        return s(h, a, r);
+        return r(h, l, s);
       case "!=":
-        return e(h, a, r);
+        return e(h, l, s);
       case ">":
-        return t(h, a, r);
+        return t(h, l, s);
       case ">=":
-        return n(h, a, r);
+        return n(h, l, s);
       case "<":
-        return i(h, a, r);
+        return i(h, l, s);
       case "<=":
-        return c(h, a, r);
+        return c(h, l, s);
       default:
-        throw new TypeError(`Invalid operator: ${o}`);
+        throw new TypeError(`Invalid operator: ${a}`);
     }
-  }, Pe;
+  }, Ce;
 }
-var qe, yt;
-function Mr() {
-  if (yt) return qe;
+var Pe, yt;
+function Wr() {
+  if (yt) return Pe;
   yt = 1;
-  const s = x(), e = M(), { safeRe: t, t: n } = W();
-  return qe = (c, l) => {
-    if (c instanceof s)
+  const r = D(), e = j(), { safeRe: t, t: n } = B();
+  return Pe = (c, o) => {
+    if (c instanceof r)
       return c;
     if (typeof c == "number" && (c = String(c)), typeof c != "string")
       return null;
-    l = l || {};
+    o = o || {};
     let h = null;
-    if (!l.rtl)
-      h = c.match(l.includePrerelease ? t[n.COERCEFULL] : t[n.COERCE]);
+    if (!o.rtl)
+      h = c.match(o.includePrerelease ? t[n.COERCEFULL] : t[n.COERCE]);
     else {
-      const E = l.includePrerelease ? t[n.COERCERTLFULL] : t[n.COERCERTL];
+      const E = o.includePrerelease ? t[n.COERCERTLFULL] : t[n.COERCERTL];
       let S;
       for (; (S = E.exec(c)) && (!h || h.index + h[0].length !== c.length); )
         (!h || S.index + S[0].length !== h.index + h[0].length) && (h = S), E.lastIndex = S.index + S[1].length + S[2].length;
@@ -1128,15 +1142,15 @@ function Mr() {
     }
     if (h === null)
       return null;
-    const o = h[2], a = h[3] || "0", r = h[4] || "0", u = l.includePrerelease && h[5] ? `-${h[5]}` : "", f = l.includePrerelease && h[6] ? `+${h[6]}` : "";
-    return e(`${o}.${a}.${r}${u}${f}`, l);
-  }, qe;
+    const a = h[2], l = h[3] || "0", s = h[4] || "0", u = o.includePrerelease && h[5] ? `-${h[5]}` : "", f = o.includePrerelease && h[6] ? `+${h[6]}` : "";
+    return e(`${a}.${l}.${s}${u}${f}`, o);
+  }, Pe;
 }
-var Ge, Ct;
-function Vr() {
-  if (Ct) return Ge;
+var qe, Ct;
+function Hr() {
+  if (Ct) return qe;
   Ct = 1;
-  class s {
+  class r {
     constructor() {
       this.max = 1e3, this.map = /* @__PURE__ */ new Map();
     }
@@ -1159,28 +1173,28 @@ function Vr() {
       return this;
     }
   }
-  return Ge = s, Ge;
+  return qe = r, qe;
 }
 var be, Pt;
-function j() {
+function F() {
   if (Pt) return be;
   Pt = 1;
-  const s = /\s+/g;
+  const r = /\s+/g;
   class e {
     constructor(m, v) {
       if (v = i(v), m instanceof e)
         return m.loose === !!v.loose && m.includePrerelease === !!v.includePrerelease ? m : new e(m.raw, v);
       if (m instanceof c)
         return this.raw = m.value, this.set = [[m]], this.formatted = void 0, this;
-      if (this.options = v, this.loose = !!v.loose, this.includePrerelease = !!v.includePrerelease, this.raw = m.trim().replace(s, " "), this.set = this.raw.split("||").map((g) => this.parseRange(g.trim())).filter((g) => g.length), !this.set.length)
+      if (this.options = v, this.loose = !!v.loose, this.includePrerelease = !!v.includePrerelease, this.raw = m.trim().replace(r, " "), this.set = this.raw.split("||").map((g) => this.parseRange(g.trim())).filter((g) => g.length), !this.set.length)
         throw new TypeError(`Invalid SemVer Range: ${this.raw}`);
       if (this.set.length > 1) {
         const g = this.set[0];
-        if (this.set = this.set.filter((I) => !p(I[0])), this.set.length === 0)
+        if (this.set = this.set.filter((I) => !d(I[0])), this.set.length === 0)
           this.set = [g];
         else if (this.set.length > 1) {
           for (const I of this.set)
-            if (I.length === 1 && O(I[0])) {
+            if (I.length === 1 && N(I[0])) {
               this.set = [I];
               break;
             }
@@ -1210,24 +1224,24 @@ function j() {
       const g = ((this.options.includePrerelease && E) | (this.options.loose && S)) + ":" + m, I = n.get(g);
       if (I)
         return I;
-      const R = this.options.loose, $ = R ? o[a.HYPHENRANGELOOSE] : o[a.HYPHENRANGE];
-      m = m.replace($, se(this.options.includePrerelease)), l("hyphen replace", m), m = m.replace(o[a.COMPARATORTRIM], r), l("comparator trim", m), m = m.replace(o[a.TILDETRIM], u), l("tilde trim", m), m = m.replace(o[a.CARETTRIM], f), l("caret trim", m);
-      let N = m.split(" ").map((P) => G(P, this.options)).join(" ").split(/\s+/).map((P) => re(P, this.options));
-      R && (N = N.filter((P) => (l("loose invalid filter", P, this.options), !!P.match(o[a.COMPARATORLOOSE])))), l("range list", N);
-      const T = /* @__PURE__ */ new Map(), y = N.map((P) => new c(P, this.options));
+      const R = this.options.loose, $ = R ? a[l.HYPHENRANGELOOSE] : a[l.HYPHENRANGE];
+      m = m.replace($, te(this.options.includePrerelease)), o("hyphen replace", m), m = m.replace(a[l.COMPARATORTRIM], s), o("comparator trim", m), m = m.replace(a[l.TILDETRIM], u), o("tilde trim", m), m = m.replace(a[l.CARETTRIM], f), o("caret trim", m);
+      let O = m.split(" ").map((P) => b(P, this.options)).join(" ").split(/\s+/).map((P) => ee(P, this.options));
+      R && (O = O.filter((P) => (o("loose invalid filter", P, this.options), !!P.match(a[l.COMPARATORLOOSE])))), o("range list", O);
+      const T = /* @__PURE__ */ new Map(), y = O.map((P) => new c(P, this.options));
       for (const P of y) {
-        if (p(P))
+        if (d(P))
           return [P];
         T.set(P.value, P);
       }
       T.size > 1 && T.has("") && T.delete("");
-      const D = [...T.values()];
-      return n.set(g, D), D;
+      const x = [...T.values()];
+      return n.set(g, x), x;
     }
     intersects(m, v) {
       if (!(m instanceof e))
         throw new TypeError("a Range is required");
-      return this.set.some((g) => w(g, v) && m.set.some((I) => w(I, v) && g.every((R) => I.every(($) => R.intersects($, v)))));
+      return this.set.some((g) => A(g, v) && m.set.some((I) => A(I, v) && g.every((R) => I.every(($) => R.intersects($, v)))));
     }
     // if ANY of the sets match ALL of its comparators, then pass
     test(m) {
@@ -1240,56 +1254,56 @@ function j() {
           return !1;
         }
       for (let v = 0; v < this.set.length; v++)
-        if (ne(this.set[v], m, this.options))
+        if (re(this.set[v], m, this.options))
           return !0;
       return !1;
     }
   }
   be = e;
-  const t = Vr(), n = new t(), i = Ye(), c = Q(), l = J(), h = x(), {
-    safeRe: o,
-    t: a,
-    comparatorTrimReplace: r,
+  const t = Hr(), n = new t(), i = Ye(), c = Z(), o = Y(), h = D(), {
+    safeRe: a,
+    t: l,
+    comparatorTrimReplace: s,
     tildeTrimReplace: u,
     caretTrimReplace: f
-  } = W(), { FLAG_INCLUDE_PRERELEASE: E, FLAG_LOOSE: S } = K(), p = (d) => d.value === "<0.0.0-0", O = (d) => d.value === "", w = (d, m) => {
+  } = B(), { FLAG_INCLUDE_PRERELEASE: E, FLAG_LOOSE: S } = z(), d = (p) => p.value === "<0.0.0-0", N = (p) => p.value === "", A = (p, m) => {
     let v = !0;
-    const g = d.slice();
+    const g = p.slice();
     let I = g.pop();
     for (; v && g.length; )
       v = g.every((R) => I.intersects(R, m)), I = g.pop();
     return v;
-  }, G = (d, m) => (d = d.replace(o[a.BUILD], ""), l("comp", d, m), d = C(d, m), l("caret", d), d = b(d, m), l("tildes", d), d = L(d, m), l("xrange", d), d = te(d, m), l("stars", d), d), A = (d) => !d || d.toLowerCase() === "x" || d === "*", b = (d, m) => d.trim().split(/\s+/).map((v) => U(v, m)).join(" "), U = (d, m) => {
-    const v = m.loose ? o[a.TILDELOOSE] : o[a.TILDE];
-    return d.replace(v, (g, I, R, $, N) => {
-      l("tilde", d, g, I, R, $, N);
+  }, b = (p, m) => (p = p.replace(a[l.BUILD], ""), o("comp", p, m), p = C(p, m), o("caret", p), p = G(p, m), o("tildes", p), p = L(p, m), o("xrange", p), p = Q(p, m), o("stars", p), p), w = (p) => !p || p.toLowerCase() === "x" || p === "*", G = (p, m) => p.trim().split(/\s+/).map((v) => _(v, m)).join(" "), _ = (p, m) => {
+    const v = m.loose ? a[l.TILDELOOSE] : a[l.TILDE];
+    return p.replace(v, (g, I, R, $, O) => {
+      o("tilde", p, g, I, R, $, O);
       let T;
-      return A(I) ? T = "" : A(R) ? T = `>=${I}.0.0 <${+I + 1}.0.0-0` : A($) ? T = `>=${I}.${R}.0 <${I}.${+R + 1}.0-0` : N ? (l("replaceTilde pr", N), T = `>=${I}.${R}.${$}-${N} <${I}.${+R + 1}.0-0`) : T = `>=${I}.${R}.${$} <${I}.${+R + 1}.0-0`, l("tilde return", T), T;
+      return w(I) ? T = "" : w(R) ? T = `>=${I}.0.0 <${+I + 1}.0.0-0` : w($) ? T = `>=${I}.${R}.0 <${I}.${+R + 1}.0-0` : O ? (o("replaceTilde pr", O), T = `>=${I}.${R}.${$}-${O} <${I}.${+R + 1}.0-0`) : T = `>=${I}.${R}.${$} <${I}.${+R + 1}.0-0`, o("tilde return", T), T;
     });
-  }, C = (d, m) => d.trim().split(/\s+/).map((v) => q(v, m)).join(" "), q = (d, m) => {
-    l("caret", d, m);
-    const v = m.loose ? o[a.CARETLOOSE] : o[a.CARET], g = m.includePrerelease ? "-0" : "";
-    return d.replace(v, (I, R, $, N, T) => {
-      l("caret", d, I, R, $, N, T);
+  }, C = (p, m) => p.trim().split(/\s+/).map((v) => q(v, m)).join(" "), q = (p, m) => {
+    o("caret", p, m);
+    const v = m.loose ? a[l.CARETLOOSE] : a[l.CARET], g = m.includePrerelease ? "-0" : "";
+    return p.replace(v, (I, R, $, O, T) => {
+      o("caret", p, I, R, $, O, T);
       let y;
-      return A(R) ? y = "" : A($) ? y = `>=${R}.0.0${g} <${+R + 1}.0.0-0` : A(N) ? R === "0" ? y = `>=${R}.${$}.0${g} <${R}.${+$ + 1}.0-0` : y = `>=${R}.${$}.0${g} <${+R + 1}.0.0-0` : T ? (l("replaceCaret pr", T), R === "0" ? $ === "0" ? y = `>=${R}.${$}.${N}-${T} <${R}.${$}.${+N + 1}-0` : y = `>=${R}.${$}.${N}-${T} <${R}.${+$ + 1}.0-0` : y = `>=${R}.${$}.${N}-${T} <${+R + 1}.0.0-0`) : (l("no pr"), R === "0" ? $ === "0" ? y = `>=${R}.${$}.${N}${g} <${R}.${$}.${+N + 1}-0` : y = `>=${R}.${$}.${N}${g} <${R}.${+$ + 1}.0-0` : y = `>=${R}.${$}.${N} <${+R + 1}.0.0-0`), l("caret return", y), y;
+      return w(R) ? y = "" : w($) ? y = `>=${R}.0.0${g} <${+R + 1}.0.0-0` : w(O) ? R === "0" ? y = `>=${R}.${$}.0${g} <${R}.${+$ + 1}.0-0` : y = `>=${R}.${$}.0${g} <${+R + 1}.0.0-0` : T ? (o("replaceCaret pr", T), R === "0" ? $ === "0" ? y = `>=${R}.${$}.${O}-${T} <${R}.${$}.${+O + 1}-0` : y = `>=${R}.${$}.${O}-${T} <${R}.${+$ + 1}.0-0` : y = `>=${R}.${$}.${O}-${T} <${+R + 1}.0.0-0`) : (o("no pr"), R === "0" ? $ === "0" ? y = `>=${R}.${$}.${O}${g} <${R}.${$}.${+O + 1}-0` : y = `>=${R}.${$}.${O}${g} <${R}.${+$ + 1}.0-0` : y = `>=${R}.${$}.${O} <${+R + 1}.0.0-0`), o("caret return", y), y;
     });
-  }, L = (d, m) => (l("replaceXRanges", d, m), d.split(/\s+/).map((v) => V(v, m)).join(" ")), V = (d, m) => {
-    d = d.trim();
-    const v = m.loose ? o[a.XRANGELOOSE] : o[a.XRANGE];
-    return d.replace(v, (g, I, R, $, N, T) => {
-      l("xRange", d, g, I, R, $, N, T);
-      const y = A(R), D = y || A($), P = D || A(N), X = P;
-      return I === "=" && X && (I = ""), T = m.includePrerelease ? "-0" : "", y ? I === ">" || I === "<" ? g = "<0.0.0-0" : g = "*" : I && X ? (D && ($ = 0), N = 0, I === ">" ? (I = ">=", D ? (R = +R + 1, $ = 0, N = 0) : ($ = +$ + 1, N = 0)) : I === "<=" && (I = "<", D ? R = +R + 1 : $ = +$ + 1), I === "<" && (T = "-0"), g = `${I + R}.${$}.${N}${T}`) : D ? g = `>=${R}.0.0${T} <${+R + 1}.0.0-0` : P && (g = `>=${R}.${$}.0${T} <${R}.${+$ + 1}.0-0`), l("xRange return", g), g;
+  }, L = (p, m) => (o("replaceXRanges", p, m), p.split(/\s+/).map((v) => M(v, m)).join(" ")), M = (p, m) => {
+    p = p.trim();
+    const v = m.loose ? a[l.XRANGELOOSE] : a[l.XRANGE];
+    return p.replace(v, (g, I, R, $, O, T) => {
+      o("xRange", p, g, I, R, $, O, T);
+      const y = w(R), x = y || w($), P = x || w(O), V = P;
+      return I === "=" && V && (I = ""), T = m.includePrerelease ? "-0" : "", y ? I === ">" || I === "<" ? g = "<0.0.0-0" : g = "*" : I && V ? (x && ($ = 0), O = 0, I === ">" ? (I = ">=", x ? (R = +R + 1, $ = 0, O = 0) : ($ = +$ + 1, O = 0)) : I === "<=" && (I = "<", x ? R = +R + 1 : $ = +$ + 1), I === "<" && (T = "-0"), g = `${I + R}.${$}.${O}${T}`) : x ? g = `>=${R}.0.0${T} <${+R + 1}.0.0-0` : P && (g = `>=${R}.${$}.0${T} <${R}.${+$ + 1}.0-0`), o("xRange return", g), g;
     });
-  }, te = (d, m) => (l("replaceStars", d, m), d.trim().replace(o[a.STAR], "")), re = (d, m) => (l("replaceGTE0", d, m), d.trim().replace(o[m.includePrerelease ? a.GTE0PRE : a.GTE0], "")), se = (d) => (m, v, g, I, R, $, N, T, y, D, P, X) => (A(g) ? v = "" : A(I) ? v = `>=${g}.0.0${d ? "-0" : ""}` : A(R) ? v = `>=${g}.${I}.0${d ? "-0" : ""}` : $ ? v = `>=${v}` : v = `>=${v}${d ? "-0" : ""}`, A(y) ? T = "" : A(D) ? T = `<${+y + 1}.0.0-0` : A(P) ? T = `<${y}.${+D + 1}.0-0` : X ? T = `<=${y}.${D}.${P}-${X}` : d ? T = `<${y}.${D}.${+P + 1}-0` : T = `<=${T}`, `${v} ${T}`.trim()), ne = (d, m, v) => {
-    for (let g = 0; g < d.length; g++)
-      if (!d[g].test(m))
+  }, Q = (p, m) => (o("replaceStars", p, m), p.trim().replace(a[l.STAR], "")), ee = (p, m) => (o("replaceGTE0", p, m), p.trim().replace(a[m.includePrerelease ? l.GTE0PRE : l.GTE0], "")), te = (p) => (m, v, g, I, R, $, O, T, y, x, P, V) => (w(g) ? v = "" : w(I) ? v = `>=${g}.0.0${p ? "-0" : ""}` : w(R) ? v = `>=${g}.${I}.0${p ? "-0" : ""}` : $ ? v = `>=${v}` : v = `>=${v}${p ? "-0" : ""}`, w(y) ? T = "" : w(x) ? T = `<${+y + 1}.0.0-0` : w(P) ? T = `<${y}.${+x + 1}.0-0` : V ? T = `<=${y}.${x}.${P}-${V}` : p ? T = `<${y}.${x}.${+P + 1}-0` : T = `<=${T}`, `${v} ${T}`.trim()), re = (p, m, v) => {
+    for (let g = 0; g < p.length; g++)
+      if (!p[g].test(m))
         return !1;
     if (m.prerelease.length && !v.includePrerelease) {
-      for (let g = 0; g < d.length; g++)
-        if (l(d[g].semver), d[g].semver !== c.ANY && d[g].semver.prerelease.length > 0) {
-          const I = d[g].semver;
+      for (let g = 0; g < p.length; g++)
+        if (o(p[g].semver), p[g].semver !== c.ANY && p[g].semver.prerelease.length > 0) {
+          const I = p[g].semver;
           if (I.major === m.major && I.minor === m.minor && I.patch === m.patch)
             return !0;
         }
@@ -1299,256 +1313,256 @@ function j() {
   };
   return be;
 }
-var De, qt;
-function Q() {
-  if (qt) return De;
+var Ge, qt;
+function Z() {
+  if (qt) return Ge;
   qt = 1;
-  const s = /* @__PURE__ */ Symbol("SemVer ANY");
+  const r = /* @__PURE__ */ Symbol("SemVer ANY");
   class e {
     static get ANY() {
-      return s;
+      return r;
     }
-    constructor(r, u) {
-      if (u = t(u), r instanceof e) {
-        if (r.loose === !!u.loose)
-          return r;
-        r = r.value;
+    constructor(s, u) {
+      if (u = t(u), s instanceof e) {
+        if (s.loose === !!u.loose)
+          return s;
+        s = s.value;
       }
-      r = r.trim().split(/\s+/).join(" "), l("comparator", r, u), this.options = u, this.loose = !!u.loose, this.parse(r), this.semver === s ? this.value = "" : this.value = this.operator + this.semver.version, l("comp", this);
+      s = s.trim().split(/\s+/).join(" "), o("comparator", s, u), this.options = u, this.loose = !!u.loose, this.parse(s), this.semver === r ? this.value = "" : this.value = this.operator + this.semver.version, o("comp", this);
     }
-    parse(r) {
-      const u = this.options.loose ? n[i.COMPARATORLOOSE] : n[i.COMPARATOR], f = r.match(u);
+    parse(s) {
+      const u = this.options.loose ? n[i.COMPARATORLOOSE] : n[i.COMPARATOR], f = s.match(u);
       if (!f)
-        throw new TypeError(`Invalid comparator: ${r}`);
-      this.operator = f[1] !== void 0 ? f[1] : "", this.operator === "=" && (this.operator = ""), f[2] ? this.semver = new h(f[2], this.options.loose) : this.semver = s;
+        throw new TypeError(`Invalid comparator: ${s}`);
+      this.operator = f[1] !== void 0 ? f[1] : "", this.operator === "=" && (this.operator = ""), f[2] ? this.semver = new h(f[2], this.options.loose) : this.semver = r;
     }
     toString() {
       return this.value;
     }
-    test(r) {
-      if (l("Comparator.test", r, this.options.loose), this.semver === s || r === s)
+    test(s) {
+      if (o("Comparator.test", s, this.options.loose), this.semver === r || s === r)
         return !0;
-      if (typeof r == "string")
+      if (typeof s == "string")
         try {
-          r = new h(r, this.options);
+          s = new h(s, this.options);
         } catch {
           return !1;
         }
-      return c(r, this.operator, this.semver, this.options);
+      return c(s, this.operator, this.semver, this.options);
     }
-    intersects(r, u) {
-      if (!(r instanceof e))
+    intersects(s, u) {
+      if (!(s instanceof e))
         throw new TypeError("a Comparator is required");
-      return this.operator === "" ? this.value === "" ? !0 : new o(r.value, u).test(this.value) : r.operator === "" ? r.value === "" ? !0 : new o(this.value, u).test(r.semver) : (u = t(u), u.includePrerelease && (this.value === "<0.0.0-0" || r.value === "<0.0.0-0") || !u.includePrerelease && (this.value.startsWith("<0.0.0") || r.value.startsWith("<0.0.0")) ? !1 : !!(this.operator.startsWith(">") && r.operator.startsWith(">") || this.operator.startsWith("<") && r.operator.startsWith("<") || this.semver.version === r.semver.version && this.operator.includes("=") && r.operator.includes("=") || c(this.semver, "<", r.semver, u) && this.operator.startsWith(">") && r.operator.startsWith("<") || c(this.semver, ">", r.semver, u) && this.operator.startsWith("<") && r.operator.startsWith(">")));
+      return this.operator === "" ? this.value === "" ? !0 : new a(s.value, u).test(this.value) : s.operator === "" ? s.value === "" ? !0 : new a(this.value, u).test(s.semver) : (u = t(u), u.includePrerelease && (this.value === "<0.0.0-0" || s.value === "<0.0.0-0") || !u.includePrerelease && (this.value.startsWith("<0.0.0") || s.value.startsWith("<0.0.0")) ? !1 : !!(this.operator.startsWith(">") && s.operator.startsWith(">") || this.operator.startsWith("<") && s.operator.startsWith("<") || this.semver.version === s.semver.version && this.operator.includes("=") && s.operator.includes("=") || c(this.semver, "<", s.semver, u) && this.operator.startsWith(">") && s.operator.startsWith("<") || c(this.semver, ">", s.semver, u) && this.operator.startsWith("<") && s.operator.startsWith(">")));
     }
   }
-  De = e;
-  const t = Ye(), { safeRe: n, t: i } = W(), c = hr(), l = J(), h = x(), o = j();
-  return De;
+  Ge = e;
+  const t = Ye(), { safeRe: n, t: i } = B(), c = fr(), o = Y(), h = D(), a = F();
+  return Ge;
 }
-var xe, Gt;
-function ee() {
-  if (Gt) return xe;
-  Gt = 1;
-  const s = j();
+var xe, bt;
+function J() {
+  if (bt) return xe;
+  bt = 1;
+  const r = F();
   return xe = (t, n, i) => {
     try {
-      n = new s(n, i);
+      n = new r(n, i);
     } catch {
       return !1;
     }
     return n.test(t);
   }, xe;
 }
-var Ue, bt;
-function Xr() {
-  if (bt) return Ue;
-  bt = 1;
-  const s = j();
-  return Ue = (t, n) => new s(t, n).set.map((i) => i.map((c) => c.value).join(" ").trim().split(" ")), Ue;
+var De, Gt;
+function zr() {
+  if (Gt) return De;
+  Gt = 1;
+  const r = F();
+  return De = (t, n) => new r(t, n).set.map((i) => i.map((c) => c.value).join(" ").trim().split(" ")), De;
 }
-var _e, Dt;
-function Br() {
-  if (Dt) return _e;
-  Dt = 1;
-  const s = x(), e = j();
+var _e, xt;
+function Yr() {
+  if (xt) return _e;
+  xt = 1;
+  const r = D(), e = F();
   return _e = (n, i, c) => {
-    let l = null, h = null, o = null;
+    let o = null, h = null, a = null;
     try {
-      o = new e(i, c);
+      a = new e(i, c);
     } catch {
       return null;
     }
-    return n.forEach((a) => {
-      o.test(a) && (!l || h.compare(a) === -1) && (l = a, h = new s(l, c));
-    }), l;
+    return n.forEach((l) => {
+      a.test(l) && (!o || h.compare(l) === -1) && (o = l, h = new r(o, c));
+    }), o;
   }, _e;
 }
-var Fe, xt;
-function Wr() {
-  if (xt) return Fe;
-  xt = 1;
-  const s = x(), e = j();
-  return Fe = (n, i, c) => {
-    let l = null, h = null, o = null;
+var Ue, Dt;
+function Kr() {
+  if (Dt) return Ue;
+  Dt = 1;
+  const r = D(), e = F();
+  return Ue = (n, i, c) => {
+    let o = null, h = null, a = null;
     try {
-      o = new e(i, c);
+      a = new e(i, c);
     } catch {
       return null;
     }
-    return n.forEach((a) => {
-      o.test(a) && (!l || h.compare(a) === 1) && (l = a, h = new s(l, c));
-    }), l;
-  }, Fe;
+    return n.forEach((l) => {
+      a.test(l) && (!o || h.compare(l) === 1) && (o = l, h = new r(o, c));
+    }), o;
+  }, Ue;
 }
-var je, Ut;
-function Hr() {
-  if (Ut) return je;
-  Ut = 1;
-  const s = x(), e = j(), t = Z();
-  return je = (i, c) => {
+var Fe, _t;
+function Zr() {
+  if (_t) return Fe;
+  _t = 1;
+  const r = D(), e = F(), t = K();
+  return Fe = (i, c) => {
     i = new e(i, c);
-    let l = new s("0.0.0");
-    if (i.test(l) || (l = new s("0.0.0-0"), i.test(l)))
-      return l;
-    l = null;
+    let o = new r("0.0.0");
+    if (i.test(o) || (o = new r("0.0.0-0"), i.test(o)))
+      return o;
+    o = null;
     for (let h = 0; h < i.set.length; ++h) {
-      const o = i.set[h];
-      let a = null;
-      o.forEach((r) => {
-        const u = new s(r.semver.version);
-        switch (r.operator) {
+      const a = i.set[h];
+      let l = null;
+      a.forEach((s) => {
+        const u = new r(s.semver.version);
+        switch (s.operator) {
           case ">":
             u.prerelease.length === 0 ? u.patch++ : u.prerelease.push(0), u.raw = u.format();
           /* fallthrough */
           case "":
           case ">=":
-            (!a || t(u, a)) && (a = u);
+            (!l || t(u, l)) && (l = u);
             break;
           case "<":
           case "<=":
             break;
           /* istanbul ignore next */
           default:
-            throw new Error(`Unexpected operation: ${r.operator}`);
+            throw new Error(`Unexpected operation: ${s.operator}`);
         }
-      }), a && (!l || t(l, a)) && (l = a);
+      }), l && (!o || t(o, l)) && (o = l);
     }
-    return l && i.test(l) ? l : null;
-  }, je;
+    return o && i.test(o) ? o : null;
+  }, Fe;
 }
-var ke, _t;
-function zr() {
-  if (_t) return ke;
-  _t = 1;
-  const s = j();
+var ke, Ut;
+function Jr() {
+  if (Ut) return ke;
+  Ut = 1;
+  const r = F();
   return ke = (t, n) => {
     try {
-      return new s(t, n).range || "*";
+      return new r(t, n).range || "*";
     } catch {
       return null;
     }
   }, ke;
 }
-var Me, Ft;
+var je, Ft;
 function et() {
-  if (Ft) return Me;
+  if (Ft) return je;
   Ft = 1;
-  const s = x(), e = Q(), { ANY: t } = e, n = j(), i = ee(), c = Z(), l = Je(), h = Qe(), o = Ze();
-  return Me = (r, u, f, E) => {
-    r = new s(r, E), u = new n(u, E);
-    let S, p, O, w, G;
+  const r = D(), e = Z(), { ANY: t } = e, n = F(), i = J(), c = K(), o = Ze(), h = Qe(), a = Je();
+  return je = (s, u, f, E) => {
+    s = new r(s, E), u = new n(u, E);
+    let S, d, N, A, b;
     switch (f) {
       case ">":
-        S = c, p = h, O = l, w = ">", G = ">=";
+        S = c, d = h, N = o, A = ">", b = ">=";
         break;
       case "<":
-        S = l, p = o, O = c, w = "<", G = "<=";
+        S = o, d = a, N = c, A = "<", b = "<=";
         break;
       default:
         throw new TypeError('Must provide a hilo val of "<" or ">"');
     }
-    if (i(r, u, E))
+    if (i(s, u, E))
       return !1;
-    for (let A = 0; A < u.set.length; ++A) {
-      const b = u.set[A];
-      let U = null, C = null;
-      if (b.forEach((q) => {
-        q.semver === t && (q = new e(">=0.0.0")), U = U || q, C = C || q, S(q.semver, U.semver, E) ? U = q : O(q.semver, C.semver, E) && (C = q);
-      }), U.operator === w || U.operator === G || (!C.operator || C.operator === w) && p(r, C.semver))
+    for (let w = 0; w < u.set.length; ++w) {
+      const G = u.set[w];
+      let _ = null, C = null;
+      if (G.forEach((q) => {
+        q.semver === t && (q = new e(">=0.0.0")), _ = _ || q, C = C || q, S(q.semver, _.semver, E) ? _ = q : N(q.semver, C.semver, E) && (C = q);
+      }), _.operator === A || _.operator === b || (!C.operator || C.operator === A) && d(s, C.semver))
         return !1;
-      if (C.operator === G && O(r, C.semver))
+      if (C.operator === b && N(s, C.semver))
         return !1;
     }
     return !0;
-  }, Me;
+  }, je;
+}
+var Me, kt;
+function Qr() {
+  if (kt) return Me;
+  kt = 1;
+  const r = et();
+  return Me = (t, n, i) => r(t, n, ">", i), Me;
 }
 var Ve, jt;
-function Yr() {
+function es() {
   if (jt) return Ve;
   jt = 1;
-  const s = et();
-  return Ve = (t, n, i) => s(t, n, ">", i), Ve;
+  const r = et();
+  return Ve = (t, n, i) => r(t, n, "<", i), Ve;
 }
-var Xe, kt;
-function Kr() {
-  if (kt) return Xe;
-  kt = 1;
-  const s = et();
-  return Xe = (t, n, i) => s(t, n, "<", i), Xe;
-}
-var Be, Mt;
-function Jr() {
-  if (Mt) return Be;
+var Xe, Mt;
+function ts() {
+  if (Mt) return Xe;
   Mt = 1;
-  const s = j();
-  return Be = (t, n, i) => (t = new s(t, i), n = new s(n, i), t.intersects(n, i)), Be;
+  const r = F();
+  return Xe = (t, n, i) => (t = new r(t, i), n = new r(n, i), t.intersects(n, i)), Xe;
 }
-var We, Vt;
-function Zr() {
-  if (Vt) return We;
+var Be, Vt;
+function rs() {
+  if (Vt) return Be;
   Vt = 1;
-  const s = ee(), e = F();
-  return We = (t, n, i) => {
+  const r = J(), e = U();
+  return Be = (t, n, i) => {
     const c = [];
-    let l = null, h = null;
-    const o = t.sort((f, E) => e(f, E, i));
-    for (const f of o)
-      s(f, n, i) ? (h = f, l || (l = f)) : (h && c.push([l, h]), h = null, l = null);
-    l && c.push([l, null]);
-    const a = [];
+    let o = null, h = null;
+    const a = t.sort((f, E) => e(f, E, i));
+    for (const f of a)
+      r(f, n, i) ? (h = f, o || (o = f)) : (h && c.push([o, h]), h = null, o = null);
+    o && c.push([o, null]);
+    const l = [];
     for (const [f, E] of c)
-      f === E ? a.push(f) : !E && f === o[0] ? a.push("*") : E ? f === o[0] ? a.push(`<=${E}`) : a.push(`${f} - ${E}`) : a.push(`>=${f}`);
-    const r = a.join(" || "), u = typeof n.raw == "string" ? n.raw : String(n);
-    return r.length < u.length ? r : n;
-  }, We;
-}
-var He, Xt;
-function Qr() {
-  if (Xt) return He;
+      f === E ? l.push(f) : !E && f === a[0] ? l.push("*") : E ? f === a[0] ? l.push(`<=${E}`) : l.push(`${f} - ${E}`) : l.push(`>=${f}`);
+    const s = l.join(" || "), u = typeof n.raw == "string" ? n.raw : String(n);
+    return s.length < u.length ? s : n;
+  }, Be;
+}
+var We, Xt;
+function ss() {
+  if (Xt) return We;
   Xt = 1;
-  const s = j(), e = Q(), { ANY: t } = e, n = ee(), i = F(), c = (u, f, E = {}) => {
+  const r = F(), e = Z(), { ANY: t } = e, n = J(), i = U(), c = (u, f, E = {}) => {
     if (u === f)
       return !0;
-    u = new s(u, E), f = new s(f, E);
+    u = new r(u, E), f = new r(f, E);
     let S = !1;
-    e: for (const p of u.set) {
-      for (const O of f.set) {
-        const w = o(p, O, E);
-        if (S = S || w !== null, w)
+    e: for (const d of u.set) {
+      for (const N of f.set) {
+        const A = a(d, N, E);
+        if (S = S || A !== null, A)
           continue e;
       }
       if (S)
         return !1;
     }
     return !0;
-  }, l = [new e(">=0.0.0-0")], h = [new e(">=0.0.0")], o = (u, f, E) => {
+  }, o = [new e(">=0.0.0-0")], h = [new e(">=0.0.0")], a = (u, f, E) => {
     if (u === f)
       return !0;
     if (u.length === 1 && u[0].semver === t) {
       if (f.length === 1 && f[0].semver === t)
         return !0;
-      E.includePrerelease ? u = l : u = h;
+      E.includePrerelease ? u = o : u = h;
     }
     if (f.length === 1 && f[0].semver === t) {
       if (E.includePrerelease)
@@ -1556,125 +1570,125 @@ function Qr() {
       f = h;
     }
     const S = /* @__PURE__ */ new Set();
-    let p, O;
+    let d, N;
     for (const L of u)
-      L.operator === ">" || L.operator === ">=" ? p = a(p, L, E) : L.operator === "<" || L.operator === "<=" ? O = r(O, L, E) : S.add(L.semver);
+      L.operator === ">" || L.operator === ">=" ? d = l(d, L, E) : L.operator === "<" || L.operator === "<=" ? N = s(N, L, E) : S.add(L.semver);
     if (S.size > 1)
       return null;
-    let w;
-    if (p && O) {
-      if (w = i(p.semver, O.semver, E), w > 0)
+    let A;
+    if (d && N) {
+      if (A = i(d.semver, N.semver, E), A > 0)
         return null;
-      if (w === 0 && (p.operator !== ">=" || O.operator !== "<="))
+      if (A === 0 && (d.operator !== ">=" || N.operator !== "<="))
         return null;
     }
     for (const L of S) {
-      if (p && !n(L, String(p), E) || O && !n(L, String(O), E))
+      if (d && !n(L, String(d), E) || N && !n(L, String(N), E))
         return null;
-      for (const V of f)
-        if (!n(L, String(V), E))
+      for (const M of f)
+        if (!n(L, String(M), E))
           return !1;
       return !0;
     }
-    let G, A, b, U, C = O && !E.includePrerelease && O.semver.prerelease.length ? O.semver : !1, q = p && !E.includePrerelease && p.semver.prerelease.length ? p.semver : !1;
-    C && C.prerelease.length === 1 && O.operator === "<" && C.prerelease[0] === 0 && (C = !1);
+    let b, w, G, _, C = N && !E.includePrerelease && N.semver.prerelease.length ? N.semver : !1, q = d && !E.includePrerelease && d.semver.prerelease.length ? d.semver : !1;
+    C && C.prerelease.length === 1 && N.operator === "<" && C.prerelease[0] === 0 && (C = !1);
     for (const L of f) {
-      if (U = U || L.operator === ">" || L.operator === ">=", b = b || L.operator === "<" || L.operator === "<=", p) {
+      if (_ = _ || L.operator === ">" || L.operator === ">=", G = G || L.operator === "<" || L.operator === "<=", d) {
         if (q && L.semver.prerelease && L.semver.prerelease.length && L.semver.major === q.major && L.semver.minor === q.minor && L.semver.patch === q.patch && (q = !1), L.operator === ">" || L.operator === ">=") {
-          if (G = a(p, L, E), G === L && G !== p)
+          if (b = l(d, L, E), b === L && b !== d)
             return !1;
-        } else if (p.operator === ">=" && !n(p.semver, String(L), E))
+        } else if (d.operator === ">=" && !n(d.semver, String(L), E))
           return !1;
       }
-      if (O) {
+      if (N) {
         if (C && L.semver.prerelease && L.semver.prerelease.length && L.semver.major === C.major && L.semver.minor === C.minor && L.semver.patch === C.patch && (C = !1), L.operator === "<" || L.operator === "<=") {
-          if (A = r(O, L, E), A === L && A !== O)
+          if (w = s(N, L, E), w === L && w !== N)
             return !1;
-        } else if (O.operator === "<=" && !n(O.semver, String(L), E))
+        } else if (N.operator === "<=" && !n(N.semver, String(L), E))
           return !1;
       }
-      if (!L.operator && (O || p) && w !== 0)
+      if (!L.operator && (N || d) && A !== 0)
         return !1;
     }
-    return !(p && b && !O && w !== 0 || O && U && !p && w !== 0 || q || C);
-  }, a = (u, f, E) => {
+    return !(d && G && !N && A !== 0 || N && _ && !d && A !== 0 || q || C);
+  }, l = (u, f, E) => {
     if (!u)
       return f;
     const S = i(u.semver, f.semver, E);
     return S > 0 ? u : S < 0 || f.operator === ">" && u.operator === ">=" ? f : u;
-  }, r = (u, f, E) => {
+  }, s = (u, f, E) => {
     if (!u)
       return f;
     const S = i(u.semver, f.semver, E);
     return S < 0 ? u : S > 0 || f.operator === "<" && u.operator === "<=" ? f : u;
   };
-  return He = c, He;
+  return We = c, We;
 }
-var ze, Bt;
-function es() {
-  if (Bt) return ze;
+var He, Bt;
+function ns() {
+  if (Bt) return He;
   Bt = 1;
-  const s = W(), e = K(), t = x(), n = lr(), i = M(), c = Cr(), l = Pr(), h = qr(), o = Gr(), a = br(), r = Dr(), u = xr(), f = Ur(), E = F(), S = _r(), p = Fr(), O = Ke(), w = jr(), G = kr(), A = Z(), b = Je(), U = cr(), C = ur(), q = Ze(), L = Qe(), V = hr(), te = Mr(), re = Q(), se = j(), ne = ee(), d = Xr(), m = Br(), v = Wr(), g = Hr(), I = zr(), R = et(), $ = Yr(), N = Kr(), T = Jr(), y = Zr(), D = Qr();
-  return ze = {
+  const r = B(), e = z(), t = D(), n = cr(), i = j(), c = Gr(), o = xr(), h = Dr(), a = _r(), l = Ur(), s = Fr(), u = kr(), f = jr(), E = U(), S = Mr(), d = Vr(), N = Ke(), A = Xr(), b = Br(), w = K(), G = Ze(), _ = ur(), C = hr(), q = Je(), L = Qe(), M = fr(), Q = Wr(), ee = Z(), te = F(), re = J(), p = zr(), m = Yr(), v = Kr(), g = Zr(), I = Jr(), R = et(), $ = Qr(), O = es(), T = ts(), y = rs(), x = ss();
+  return He = {
     parse: i,
     valid: c,
-    clean: l,
+    clean: o,
     inc: h,
-    diff: o,
-    major: a,
-    minor: r,
+    diff: a,
+    major: l,
+    minor: s,
     patch: u,
     prerelease: f,
     compare: E,
     rcompare: S,
-    compareLoose: p,
-    compareBuild: O,
-    sort: w,
-    rsort: G,
-    gt: A,
-    lt: b,
-    eq: U,
+    compareLoose: d,
+    compareBuild: N,
+    sort: A,
+    rsort: b,
+    gt: w,
+    lt: G,
+    eq: _,
     neq: C,
     gte: q,
     lte: L,
-    cmp: V,
-    coerce: te,
-    Comparator: re,
-    Range: se,
-    satisfies: ne,
-    toComparators: d,
+    cmp: M,
+    coerce: Q,
+    Comparator: ee,
+    Range: te,
+    satisfies: re,
+    toComparators: p,
     maxSatisfying: m,
     minSatisfying: v,
     minVersion: g,
     validRange: I,
     outside: R,
     gtr: $,
-    ltr: N,
+    ltr: O,
     intersects: T,
     simplifyRange: y,
-    subset: D,
+    subset: x,
     SemVer: t,
-    re: s.re,
-    src: s.src,
-    tokens: s.t,
+    re: r.re,
+    src: r.src,
+    tokens: r.t,
     SEMVER_SPEC_VERSION: e.SEMVER_SPEC_VERSION,
     RELEASE_TYPES: e.RELEASE_TYPES,
     compareIdentifiers: n.compareIdentifiers,
     rcompareIdentifiers: n.rcompareIdentifiers
-  }, ze;
+  }, He;
 }
-var ts = es();
-const Wt = `^${z.Version}`;
-class is {
-  config = new mr(Ht);
+var is = ns();
+const Wt = `^${X.Version}`;
+class ls {
+  config = new dr(Ht);
   event = new pr();
   state;
   active;
   time;
   info;
-  merger = new wr();
-  offset = new Ar();
-  driver = new yr();
+  merger = new Pr();
+  offset = new qr();
+  driver = new br();
   constructor() {
     this.state = {
       playing: !1,
@@ -1685,7 +1699,7 @@ class is {
     }, this.time = {
       start: 0,
       seek: 0
-    }, this.info = new z.Info(), this.config.event.add("update", this.onConfigUpdate);
+    }, this.info = new X.Info(), this.config.event.add("update", this.onConfigUpdate);
   }
   onConfigUpdate = (e) => {
     const t = e.has("offset.useMeta");
@@ -1715,14 +1729,14 @@ class is {
     if (i - n + 1 === t.length)
       return { lines: e, index: t };
     const c = /* @__PURE__ */ new Map();
-    for (let o = 0; o < t.length; o++)
-      c.set(t[o], e[o]);
-    const l = [], h = [];
-    for (let o = n; o <= i; o++) {
-      const a = c.get(o) ?? this.info.lines[o];
-      a && (l.push(a), h.push(o));
+    for (let a = 0; a < t.length; a++)
+      c.set(t[a], e[a]);
+    const o = [], h = [];
+    for (let a = n; a <= i; a++) {
+      const l = c.get(a) ?? this.info.lines[a];
+      l && (o.push(l), h.push(a));
     }
-    return { lines: l, index: h };
+    return { lines: o, index: h };
   }
   handleEmitLinesUpdate(e) {
     const t = this.handleBridgeActive(this.active.lines, this.active.index);
@@ -1734,12 +1748,12 @@ class is {
     const t = [], n = [];
     let i = this.info.lines.length;
     for (let c = 0; c < this.info.lines.length; c++) {
-      const l = this.info.lines[c];
-      if (l.time.start > e) {
+      const o = this.info.lines[c];
+      if (o.time.start > e) {
         i = c;
         break;
       }
-      this.merger.getMergedTime(c) > e && (t.push(l), n.push(c));
+      this.merger.getMergedTime(c) > e && (t.push(o), n.push(c));
     }
     this.state.scanIndex = i, this.active.lines = t, this.active.index = n, this.handleEmitLinesUpdate(!0);
   }
@@ -1747,8 +1761,8 @@ class is {
     let t = !1;
     const n = [], i = [];
     for (let c = 0; c < this.active.lines.length; c++) {
-      const l = this.active.lines[c], h = this.active.index[c];
-      e >= this.merger.getMergedTime(h) ? t = !0 : (n.push(l), i.push(h));
+      const o = this.active.lines[c], h = this.active.index[c];
+      e >= this.merger.getMergedTime(h) ? t = !0 : (n.push(o), i.push(h));
     }
     for (; this.state.scanIndex < this.info.lines.length; ) {
       const c = this.info.lines[this.state.scanIndex];
@@ -1769,7 +1783,7 @@ class is {
     if (!e)
       return;
     let t = e;
-    ts.satisfies(e.version, Wt) || (console.warn(`[music-lyric-player] ignored lyric with incompatible version "${e.version}", expected "${Wt}"`), t = new z.Info()), this.pause(), this.info = t, this.handleBuildMergedLineEnd(), this.offset.refreshFromMeta(this.info, this.config.current.offset.useMeta), this.config.current.offset.resetTempOnLyricChange && this.offset.resetTemp(), this.active.lines = [], this.active.index = [], this.state.scanIndex = 0, this.time.seek = 0, this.event.emit("lyricUpdate", t), this.event.emit("linesUpdate", [], [], -1, !1);
+    is.satisfies(e.version, Wt) || (console.warn(`[music-lyric-player] ignored lyric with incompatible version "${e.version}", expected "${Wt}"`), t = new X.Info()), this.pause(), this.info = t, this.handleBuildMergedLineEnd(), this.offset.refreshFromMeta(this.info, this.config.current.offset.useMeta), this.config.current.offset.resetTempOnLyricChange && this.offset.resetTemp(), this.active.lines = [], this.active.index = [], this.state.scanIndex = 0, this.time.seek = 0, this.event.emit("lyricUpdate", t), this.event.emit("linesUpdate", [], [], -1, !1);
   }
   /**
    * Start playback
@@ -1789,7 +1803,7 @@ class is {
    * Stop playback
    */
   dispose() {
-    this.pause(), this.event.clear(), this.config.event.remove("update", this.onConfigUpdate), this.active.lines = [], this.active.index = [], this.info = new z.Info();
+    this.pause(), this.event.clear(), this.config.event.remove("update", this.onConfigUpdate), this.active.lines = [], this.active.index = [], this.info = new X.Info();
   }
   /**
    * Update the temp offset in ms (the user's temporary adjustment).
@@ -1811,10 +1825,10 @@ class is {
   matchLinesWithTime(e) {
     const t = e + this.currentOffset, n = [], i = [];
     for (let c = 0; c < this.info.lines.length; c++) {
-      const l = this.info.lines[c];
-      if (l.time.start > t)
+      const o = this.info.lines[c];
+      if (o.time.start > t)
         break;
-      this.merger.getMergedTime(c) > t && (n.push(l), i.push(c));
+      this.merger.getMergedTime(c) > t && (n.push(o), i.push(c));
     }
     return this.handleBridgeActive(n, i);
   }
@@ -1872,7 +1886,7 @@ class is {
   }
 }
 export {
-  is as BaseLyricPlayer,
-  ns as BaseLyricPlayerConfig
+  ls as BaseLyricPlayer,
+  os as BaseLyricPlayerConfig
 };
 //# sourceMappingURL=index.ecma.js.map