@acrobits/ipc-sdk 0.0.14

package/lib/ipc-sdk.js

@@ -0,0 +1,3062 @@
+var Ar = Object.defineProperty;
+var Tr = (r, e, t) => e in r ? Ar(r, e, { enumerable: !0, configurable: !0, writable: !0, value: t }) : r[e] = t;
+var re = (r, e, t) => (Tr(r, typeof e != "symbol" ? e + "" : e, t), t), Cr = (r, e, t) => {
+  if (!e.has(r))
+    throw TypeError("Cannot " + t);
+};
+var vt = (r, e, t) => {
+  if (e.has(r))
+    throw TypeError("Cannot add the same private member more than once");
+  e instanceof WeakSet ? e.add(r) : e.set(r, t);
+};
+var je = (r, e, t) => (Cr(r, e, "access private method"), t);
+var H = /* @__PURE__ */ ((r) => (r.BadgeQuery = "BADGE QUERY", r.HostInForeground = "HOST IN FOREGROUND", r))(H || {}), Nr = Object.defineProperty, xr = (r, e, t) => e in r ? Nr(r, e, { enumerable: !0, configurable: !0, writable: !0, value: t }) : r[e] = t, q = (r, e, t) => (xr(r, typeof e != "symbol" ? e + "" : e, t), t), We = { exports: {} };
+const Lr = "2.0.0", Zt = 256, Pr = Number.MAX_SAFE_INTEGER || /* istanbul ignore next */
+9007199254740991, Mr = 16, _r = Zt - 6, Dr = [
+  "major",
+  "premajor",
+  "minor",
+  "preminor",
+  "patch",
+  "prepatch",
+  "prerelease"
+];
+var xe = {
+  MAX_LENGTH: Zt,
+  MAX_SAFE_COMPONENT_LENGTH: Mr,
+  MAX_SAFE_BUILD_LENGTH: _r,
+  MAX_SAFE_INTEGER: Pr,
+  RELEASE_TYPES: Dr,
+  SEMVER_SPEC_VERSION: Lr,
+  FLAG_INCLUDE_PRERELEASE: 1,
+  FLAG_LOOSE: 2
+};
+const Ur = typeof process == "object" && process.env && process.env.NODE_DEBUG && /\bsemver\b/i.test(process.env.NODE_DEBUG) ? (...r) => console.error("SEMVER", ...r) : () => {
+};
+var Le = Ur;
+(function(r, e) {
+  const {
+    MAX_SAFE_COMPONENT_LENGTH: t,
+    MAX_SAFE_BUILD_LENGTH: n,
+    MAX_LENGTH: i
+  } = xe, s = Le;
+  e = r.exports = {};
+  const a = e.re = [], c = e.safeRe = [], o = e.src = [], l = e.t = {};
+  let u = 0;
+  const p = "[a-zA-Z0-9-]", w = [
+    ["\\s", 1],
+    ["\\d", i],
+    [p, n]
+  ], f = (R) => {
+    for (const [D, Q] of w)
+      R = R.split(`${D}*`).join(`${D}{0,${Q}}`).split(`${D}+`).join(`${D}{1,${Q}}`);
+    return R;
+  }, g = (R, D, Q) => {
+    const L = f(D), W = u++;
+    s(R, W, D), l[R] = W, o[W] = D, a[W] = new RegExp(D, Q ? "g" : void 0), c[W] = new RegExp(L, Q ? "g" : void 0);
+  };
+  g("NUMERICIDENTIFIER", "0|[1-9]\\d*"), g("NUMERICIDENTIFIERLOOSE", "\\d+"), g("NONNUMERICIDENTIFIER", `\\d*[a-zA-Z-]${p}*`), g("MAINVERSION", `(${o[l.NUMERICIDENTIFIER]})\\.(${o[l.NUMERICIDENTIFIER]})\\.(${o[l.NUMERICIDENTIFIER]})`), g("MAINVERSIONLOOSE", `(${o[l.NUMERICIDENTIFIERLOOSE]})\\.(${o[l.NUMERICIDENTIFIERLOOSE]})\\.(${o[l.NUMERICIDENTIFIERLOOSE]})`), g("PRERELEASEIDENTIFIER", `(?:${o[l.NUMERICIDENTIFIER]}|${o[l.NONNUMERICIDENTIFIER]})`), g("PRERELEASEIDENTIFIERLOOSE", `(?:${o[l.NUMERICIDENTIFIERLOOSE]}|${o[l.NONNUMERICIDENTIFIER]})`), g("PRERELEASE", `(?:-(${o[l.PRERELEASEIDENTIFIER]}(?:\\.${o[l.PRERELEASEIDENTIFIER]})*))`), g("PRERELEASELOOSE", `(?:-?(${o[l.PRERELEASEIDENTIFIERLOOSE]}(?:\\.${o[l.PRERELEASEIDENTIFIERLOOSE]})*))`), g("BUILDIDENTIFIER", `${p}+`), g("BUILD", `(?:\\+(${o[l.BUILDIDENTIFIER]}(?:\\.${o[l.BUILDIDENTIFIER]})*))`), g("FULLPLAIN", `v?${o[l.MAINVERSION]}${o[l.PRERELEASE]}?${o[l.BUILD]}?`), g("FULL", `^${o[l.FULLPLAIN]}$`), g("LOOSEPLAIN", `[v=\\s]*${o[l.MAINVERSIONLOOSE]}${o[l.PRERELEASELOOSE]}?${o[l.BUILD]}?`), g("LOOSE", `^${o[l.LOOSEPLAIN]}$`), g("GTLT", "((?:<|>)?=?)"), g("XRANGEIDENTIFIERLOOSE", `${o[l.NUMERICIDENTIFIERLOOSE]}|x|X|\\*`), g("XRANGEIDENTIFIER", `${o[l.NUMERICIDENTIFIER]}|x|X|\\*`), g("XRANGEPLAIN", `[v=\\s]*(${o[l.XRANGEIDENTIFIER]})(?:\\.(${o[l.XRANGEIDENTIFIER]})(?:\\.(${o[l.XRANGEIDENTIFIER]})(?:${o[l.PRERELEASE]})?${o[l.BUILD]}?)?)?`), g("XRANGEPLAINLOOSE", `[v=\\s]*(${o[l.XRANGEIDENTIFIERLOOSE]})(?:\\.(${o[l.XRANGEIDENTIFIERLOOSE]})(?:\\.(${o[l.XRANGEIDENTIFIERLOOSE]})(?:${o[l.PRERELEASELOOSE]})?${o[l.BUILD]}?)?)?`), g("XRANGE", `^${o[l.GTLT]}\\s*${o[l.XRANGEPLAIN]}$`), g("XRANGELOOSE", `^${o[l.GTLT]}\\s*${o[l.XRANGEPLAINLOOSE]}$`), g("COERCE", `(^|[^\\d])(\\d{1,${t}})(?:\\.(\\d{1,${t}}))?(?:\\.(\\d{1,${t}}))?(?:$|[^\\d])`), g("COERCERTL", o[l.COERCE], !0), g("LONETILDE", "(?:~>?)"), g("TILDETRIM", `(\\s*)${o[l.LONETILDE]}\\s+`, !0), e.tildeTrimReplace = "$1~", g("TILDE", `^${o[l.LONETILDE]}${o[l.XRANGEPLAIN]}$`), g("TILDELOOSE", `^${o[l.LONETILDE]}${o[l.XRANGEPLAINLOOSE]}$`), g("LONECARET", "(?:\\^)"), g("CARETTRIM", `(\\s*)${o[l.LONECARET]}\\s+`, !0), e.caretTrimReplace = "$1^", g("CARET", `^${o[l.LONECARET]}${o[l.XRANGEPLAIN]}$`), g("CARETLOOSE", `^${o[l.LONECARET]}${o[l.XRANGEPLAINLOOSE]}$`), g("COMPARATORLOOSE", `^${o[l.GTLT]}\\s*(${o[l.LOOSEPLAIN]})$|^$`), g("COMPARATOR", `^${o[l.GTLT]}\\s*(${o[l.FULLPLAIN]})$|^$`), g("COMPARATORTRIM", `(\\s*)${o[l.GTLT]}\\s*(${o[l.LOOSEPLAIN]}|${o[l.XRANGEPLAIN]})`, !0), e.comparatorTrimReplace = "$1$2$3", g("HYPHENRANGE", `^\\s*(${o[l.XRANGEPLAIN]})\\s+-\\s+(${o[l.XRANGEPLAIN]})\\s*$`), g("HYPHENRANGELOOSE", `^\\s*(${o[l.XRANGEPLAINLOOSE]})\\s+-\\s+(${o[l.XRANGEPLAINLOOSE]})\\s*$`), g("STAR", "(<|>)?=?\\s*\\*"), g("GTE0", "^\\s*>=\\s*0\\.0\\.0\\s*$"), g("GTE0PRE", "^\\s*>=\\s*0\\.0\\.0-0\\s*$");
+})(We, We.exports);
+var ve = We.exports;
+const jr = Object.freeze({ loose: !0 }), Fr = Object.freeze({}), Gr = (r) => r ? typeof r != "object" ? jr : r : Fr;
+var it = Gr;
+const gt = /^[0-9]+$/, er = (r, e) => {
+  const t = gt.test(r), n = gt.test(e);
+  return t && n && (r = +r, e = +e), r === e ? 0 : t && !n ? -1 : n && !t ? 1 : r < e ? -1 : 1;
+}, kr = (r, e) => er(e, r);
+var tr = {
+  compareIdentifiers: er,
+  rcompareIdentifiers: kr
+};
+const me = Le, { MAX_LENGTH: mt, MAX_SAFE_INTEGER: Ee } = xe, { safeRe: Et, t: yt } = ve, Vr = it, { compareIdentifiers: ne } = tr;
+let Hr = class k {
+  constructor(e, t) {
+    if (t = Vr(t), e instanceof k) {
+      if (e.loose === !!t.loose && e.includePrerelease === !!t.includePrerelease)
+        return e;
+      e = e.version;
+    } else if (typeof e != "string")
+      throw new TypeError(`Invalid version. Must be a string. Got type "${typeof e}".`);
+    if (e.length > mt)
+      throw new TypeError(
+        `version is longer than ${mt} characters`
+      );
+    me("SemVer", e, t), this.options = t, this.loose = !!t.loose, this.includePrerelease = !!t.includePrerelease;
+    const n = e.trim().match(t.loose ? Et[yt.LOOSE] : Et[yt.FULL]);
+    if (!n)
+      throw new TypeError(`Invalid Version: ${e}`);
+    if (this.raw = e, this.major = +n[1], this.minor = +n[2], this.patch = +n[3], this.major > Ee || this.major < 0)
+      throw new TypeError("Invalid major version");
+    if (this.minor > Ee || this.minor < 0)
+      throw new TypeError("Invalid minor version");
+    if (this.patch > Ee || this.patch < 0)
+      throw new TypeError("Invalid patch version");
+    n[4] ? this.prerelease = n[4].split(".").map((i) => {
+      if (/^[0-9]+$/.test(i)) {
+        const s = +i;
+        if (s >= 0 && s < Ee)
+          return s;
+      }
+      return i;
+    }) : this.prerelease = [], this.build = n[5] ? n[5].split(".") : [], this.format();
+  }
+  format() {
+    return this.version = `${this.major}.${this.minor}.${this.patch}`, this.prerelease.length && (this.version += `-${this.prerelease.join(".")}`), this.version;
+  }
+  toString() {
+    return this.version;
+  }
+  compare(e) {
+    if (me("SemVer.compare", this.version, this.options, e), !(e instanceof k)) {
+      if (typeof e == "string" && e === this.version)
+        return 0;
+      e = new k(e, this.options);
+    }
+    return e.version === this.version ? 0 : this.compareMain(e) || this.comparePre(e);
+  }
+  compareMain(e) {
+    return e instanceof k || (e = new k(e, this.options)), ne(this.major, e.major) || ne(this.minor, e.minor) || ne(this.patch, e.patch);
+  }
+  comparePre(e) {
+    if (e instanceof k || (e = new k(e, this.options)), this.prerelease.length && !e.prerelease.length)
+      return -1;
+    if (!this.prerelease.length && e.prerelease.length)
+      return 1;
+    if (!this.prerelease.length && !e.prerelease.length)
+      return 0;
+    let t = 0;
+    do {
+      const n = this.prerelease[t], i = e.prerelease[t];
+      if (me("prerelease compare", t, n, i), n === void 0 && i === void 0)
+        return 0;
+      if (i === void 0)
+        return 1;
+      if (n === void 0)
+        return -1;
+      if (n !== i)
+        return ne(n, i);
+    } while (++t);
+  }
+  compareBuild(e) {
+    e instanceof k || (e = new k(e, this.options));
+    let t = 0;
+    do {
+      const n = this.build[t], i = e.build[t];
+      if (me("prerelease compare", t, n, i), n === void 0 && i === void 0)
+        return 0;
+      if (i === void 0)
+        return 1;
+      if (n === void 0)
+        return -1;
+      if (n !== i)
+        return ne(n, i);
+    } while (++t);
+  }
+  // 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(e, t, n) {
+    switch (e) {
+      case "premajor":
+        this.prerelease.length = 0, this.patch = 0, this.minor = 0, this.major++, this.inc("pre", t, n);
+        break;
+      case "preminor":
+        this.prerelease.length = 0, this.patch = 0, this.minor++, this.inc("pre", t, n);
+        break;
+      case "prepatch":
+        this.prerelease.length = 0, this.inc("patch", t, n), this.inc("pre", t, n);
+        break;
+      case "prerelease":
+        this.prerelease.length === 0 && this.inc("patch", t, n), this.inc("pre", t, n);
+        break;
+      case "major":
+        (this.minor !== 0 || this.patch !== 0 || this.prerelease.length === 0) && this.major++, this.minor = 0, this.patch = 0, this.prerelease = [];
+        break;
+      case "minor":
+        (this.patch !== 0 || this.prerelease.length === 0) && this.minor++, this.patch = 0, this.prerelease = [];
+        break;
+      case "patch":
+        this.prerelease.length === 0 && this.patch++, this.prerelease = [];
+        break;
+      case "pre": {
+        const i = Number(n) ? 1 : 0;
+        if (!t && n === !1)
+          throw new Error("invalid increment argument: identifier is empty");
+        if (this.prerelease.length === 0)
+          this.prerelease = [i];
+        else {
+          let s = this.prerelease.length;
+          for (; --s >= 0; )
+            typeof this.prerelease[s] == "number" && (this.prerelease[s]++, s = -2);
+          if (s === -1) {
+            if (t === this.prerelease.join(".") && n === !1)
+              throw new Error("invalid increment argument: identifier already exists");
+            this.prerelease.push(i);
+          }
+        }
+        if (t) {
+          let s = [t, i];
+          n === !1 && (s = [t]), ne(this.prerelease[0], t) === 0 ? isNaN(this.prerelease[1]) && (this.prerelease = s) : this.prerelease = s;
+        }
+        break;
+      }
+      default:
+        throw new Error(`invalid increment argument: ${e}`);
+    }
+    return this.raw = this.format(), this.build.length && (this.raw += `+${this.build.join(".")}`), this;
+  }
+};
+var _ = Hr;
+const bt = _, Xr = (r, e, t = !1) => {
+  if (r instanceof bt)
+    return r;
+  try {
+    return new bt(r, e);
+  } catch (n) {
+    if (!t)
+      return null;
+    throw n;
+  }
+};
+var oe = Xr;
+const Br = oe, qr = (r, e) => {
+  const t = Br(r, e);
+  return t ? t.version : null;
+};
+var Yr = qr;
+const zr = oe, Qr = (r, e) => {
+  const t = zr(r.trim().replace(/^[=v]+/, ""), e);
+  return t ? t.version : null;
+};
+var Wr = Qr;
+const wt = _, Jr = (r, e, t, n, i) => {
+  typeof t == "string" && (i = n, n = t, t = void 0);
+  try {
+    return new wt(
+      r instanceof wt ? r.version : r,
+      t
+    ).inc(e, n, i).version;
+  } catch {
+    return null;
+  }
+};
+var Kr = Jr;
+const Rt = oe, Zr = (r, e) => {
+  const t = Rt(r, null, !0), n = Rt(e, null, !0), i = t.compare(n);
+  if (i === 0)
+    return null;
+  const s = i > 0, a = s ? t : n, c = s ? n : t, o = !!a.prerelease.length;
+  if (c.prerelease.length && !o)
+    return !c.patch && !c.minor ? "major" : a.patch ? "patch" : a.minor ? "minor" : "major";
+  const l = o ? "pre" : "";
+  return t.major !== n.major ? l + "major" : t.minor !== n.minor ? l + "minor" : t.patch !== n.patch ? l + "patch" : "prerelease";
+};
+var en = Zr;
+const tn = _, rn = (r, e) => new tn(r, e).major;
+var nn = rn;
+const sn = _, on = (r, e) => new sn(r, e).minor;
+var an = on;
+const ln = _, cn = (r, e) => new ln(r, e).patch;
+var un = cn;
+const hn = oe, pn = (r, e) => {
+  const t = hn(r, e);
+  return t && t.prerelease.length ? t.prerelease : null;
+};
+var fn = pn;
+const It = _, dn = (r, e, t) => new It(r, t).compare(new It(e, t));
+var F = dn;
+const vn = F, gn = (r, e, t) => vn(e, r, t);
+var mn = gn;
+const En = F, yn = (r, e) => En(r, e, !0);
+var bn = yn;
+const $t = _, wn = (r, e, t) => {
+  const n = new $t(r, t), i = new $t(e, t);
+  return n.compare(i) || n.compareBuild(i);
+};
+var st = wn;
+const Rn = st, In = (r, e) => r.sort((t, n) => Rn(t, n, e));
+var $n = In;
+const Sn = st, On = (r, e) => r.sort((t, n) => Sn(n, t, e));
+var An = On;
+const Tn = F, Cn = (r, e, t) => Tn(r, e, t) > 0;
+var Pe = Cn;
+const Nn = F, xn = (r, e, t) => Nn(r, e, t) < 0;
+var ot = xn;
+const Ln = F, Pn = (r, e, t) => Ln(r, e, t) === 0;
+var rr = Pn;
+const Mn = F, _n = (r, e, t) => Mn(r, e, t) !== 0;
+var nr = _n;
+const Dn = F, Un = (r, e, t) => Dn(r, e, t) >= 0;
+var at = Un;
+const jn = F, Fn = (r, e, t) => jn(r, e, t) <= 0;
+var lt = Fn;
+const Gn = rr, kn = nr, Vn = Pe, Hn = at, Xn = ot, Bn = lt, qn = (r, e, t, n) => {
+  switch (e) {
+    case "===":
+      return typeof r == "object" && (r = r.version), typeof t == "object" && (t = t.version), r === t;
+    case "!==":
+      return typeof r == "object" && (r = r.version), typeof t == "object" && (t = t.version), r !== t;
+    case "":
+    case "=":
+    case "==":
+      return Gn(r, t, n);
+    case "!=":
+      return kn(r, t, n);
+    case ">":
+      return Vn(r, t, n);
+    case ">=":
+      return Hn(r, t, n);
+    case "<":
+      return Xn(r, t, n);
+    case "<=":
+      return Bn(r, t, n);
+    default:
+      throw new TypeError(`Invalid operator: ${e}`);
+  }
+};
+var ir = qn;
+const Yn = _, zn = oe, { safeRe: ye, t: be } = ve, Qn = (r, e) => {
+  if (r instanceof Yn)
+    return r;
+  if (typeof r == "number" && (r = String(r)), typeof r != "string")
+    return null;
+  e = e || {};
+  let t = null;
+  if (!e.rtl)
+    t = r.match(ye[be.COERCE]);
+  else {
+    let n;
+    for (; (n = ye[be.COERCERTL].exec(r)) && (!t || t.index + t[0].length !== r.length); )
+      (!t || n.index + n[0].length !== t.index + t[0].length) && (t = n), ye[be.COERCERTL].lastIndex = n.index + n[1].length + n[2].length;
+    ye[be.COERCERTL].lastIndex = -1;
+  }
+  return t === null ? null : zn(`${t[2]}.${t[3] || "0"}.${t[4] || "0"}`, e);
+};
+var Wn = Qn, St, Ot;
+function Jn() {
+  return Ot || (Ot = 1, St = function(r) {
+    r.prototype[Symbol.iterator] = function* () {
+      for (let e = this.head; e; e = e.next)
+        yield e.value;
+    };
+  }), St;
+}
+var Kn = $;
+$.Node = ee;
+$.create = $;
+function $(r) {
+  var e = this;
+  if (e instanceof $ || (e = new $()), e.tail = null, e.head = null, e.length = 0, r && typeof r.forEach == "function")
+    r.forEach(function(i) {
+      e.push(i);
+    });
+  else if (arguments.length > 0)
+    for (var t = 0, n = arguments.length; t < n; t++)
+      e.push(arguments[t]);
+  return e;
+}
+$.prototype.removeNode = function(r) {
+  if (r.list !== this)
+    throw new Error("removing node which does not belong to this list");
+  var e = r.next, t = r.prev;
+  return e && (e.prev = t), t && (t.next = e), r === this.head && (this.head = e), r === this.tail && (this.tail = t), r.list.length--, r.next = null, r.prev = null, r.list = null, e;
+};
+$.prototype.unshiftNode = function(r) {
+  if (r !== this.head) {
+    r.list && r.list.removeNode(r);
+    var e = this.head;
+    r.list = this, r.next = e, e && (e.prev = r), this.head = r, this.tail || (this.tail = r), this.length++;
+  }
+};
+$.prototype.pushNode = function(r) {
+  if (r !== this.tail) {
+    r.list && r.list.removeNode(r);
+    var e = this.tail;
+    r.list = this, r.prev = e, e && (e.next = r), this.tail = r, this.head || (this.head = r), this.length++;
+  }
+};
+$.prototype.push = function() {
+  for (var r = 0, e = arguments.length; r < e; r++)
+    ei(this, arguments[r]);
+  return this.length;
+};
+$.prototype.unshift = function() {
+  for (var r = 0, e = arguments.length; r < e; r++)
+    ti(this, arguments[r]);
+  return this.length;
+};
+$.prototype.pop = function() {
+  if (this.tail) {
+    var r = this.tail.value;
+    return this.tail = this.tail.prev, this.tail ? this.tail.next = null : this.head = null, this.length--, r;
+  }
+};
+$.prototype.shift = function() {
+  if (this.head) {
+    var r = this.head.value;
+    return this.head = this.head.next, this.head ? this.head.prev = null : this.tail = null, this.length--, r;
+  }
+};
+$.prototype.forEach = function(r, e) {
+  e = e || this;
+  for (var t = this.head, n = 0; t !== null; n++)
+    r.call(e, t.value, n, this), t = t.next;
+};
+$.prototype.forEachReverse = function(r, e) {
+  e = e || this;
+  for (var t = this.tail, n = this.length - 1; t !== null; n--)
+    r.call(e, t.value, n, this), t = t.prev;
+};
+$.prototype.get = function(r) {
+  for (var e = 0, t = this.head; t !== null && e < r; e++)
+    t = t.next;
+  if (e === r && t !== null)
+    return t.value;
+};
+$.prototype.getReverse = function(r) {
+  for (var e = 0, t = this.tail; t !== null && e < r; e++)
+    t = t.prev;
+  if (e === r && t !== null)
+    return t.value;
+};
+$.prototype.map = function(r, e) {
+  e = e || this;
+  for (var t = new $(), n = this.head; n !== null; )
+    t.push(r.call(e, n.value, this)), n = n.next;
+  return t;
+};
+$.prototype.mapReverse = function(r, e) {
+  e = e || this;
+  for (var t = new $(), n = this.tail; n !== null; )
+    t.push(r.call(e, n.value, this)), n = n.prev;
+  return t;
+};
+$.prototype.reduce = function(r, e) {
+  var t, n = this.head;
+  if (arguments.length > 1)
+    t = e;
+  else if (this.head)
+    n = this.head.next, t = this.head.value;
+  else
+    throw new TypeError("Reduce of empty list with no initial value");
+  for (var i = 0; n !== null; i++)
+    t = r(t, n.value, i), n = n.next;
+  return t;
+};
+$.prototype.reduceReverse = function(r, e) {
+  var t, n = this.tail;
+  if (arguments.length > 1)
+    t = e;
+  else if (this.tail)
+    n = this.tail.prev, t = this.tail.value;
+  else
+    throw new TypeError("Reduce of empty list with no initial value");
+  for (var i = this.length - 1; n !== null; i--)
+    t = r(t, n.value, i), n = n.prev;
+  return t;
+};
+$.prototype.toArray = function() {
+  for (var r = new Array(this.length), e = 0, t = this.head; t !== null; e++)
+    r[e] = t.value, t = t.next;
+  return r;
+};
+$.prototype.toArrayReverse = function() {
+  for (var r = new Array(this.length), e = 0, t = this.tail; t !== null; e++)
+    r[e] = t.value, t = t.prev;
+  return r;
+};
+$.prototype.slice = function(r, e) {
+  e = e || this.length, e < 0 && (e += this.length), r = r || 0, r < 0 && (r += this.length);
+  var t = new $();
+  if (e < r || e < 0)
+    return t;
+  r < 0 && (r = 0), e > this.length && (e = this.length);
+  for (var n = 0, i = this.head; i !== null && n < r; n++)
+    i = i.next;
+  for (; i !== null && n < e; n++, i = i.next)
+    t.push(i.value);
+  return t;
+};
+$.prototype.sliceReverse = function(r, e) {
+  e = e || this.length, e < 0 && (e += this.length), r = r || 0, r < 0 && (r += this.length);
+  var t = new $();
+  if (e < r || e < 0)
+    return t;
+  r < 0 && (r = 0), e > this.length && (e = this.length);
+  for (var n = this.length, i = this.tail; i !== null && n > e; n--)
+    i = i.prev;
+  for (; i !== null && n > r; n--, i = i.prev)
+    t.push(i.value);
+  return t;
+};
+$.prototype.splice = function(r, e, ...t) {
+  r > this.length && (r = this.length - 1), r < 0 && (r = this.length + r);
+  for (var n = 0, i = this.head; i !== null && n < r; n++)
+    i = i.next;
+  for (var s = [], n = 0; i && n < e; n++)
+    s.push(i.value), i = this.removeNode(i);
+  i === null && (i = this.tail), i !== this.head && i !== this.tail && (i = i.prev);
+  for (var n = 0; n < t.length; n++)
+    i = Zn(this, i, t[n]);
+  return s;
+};
+$.prototype.reverse = function() {
+  for (var r = this.head, e = this.tail, t = r; t !== null; t = t.prev) {
+    var n = t.prev;
+    t.prev = t.next, t.next = n;
+  }
+  return this.head = e, this.tail = r, this;
+};
+function Zn(r, e, t) {
+  var n = e === r.head ? new ee(t, null, e, r) : new ee(t, e, e.next, r);
+  return n.next === null && (r.tail = n), n.prev === null && (r.head = n), r.length++, n;
+}
+function ei(r, e) {
+  r.tail = new ee(e, r.tail, null, r), r.head || (r.head = r.tail), r.length++;
+}
+function ti(r, e) {
+  r.head = new ee(e, null, r.head, r), r.tail || (r.tail = r.head), r.length++;
+}
+function ee(r, e, t, n) {
+  if (!(this instanceof ee))
+    return new ee(r, e, t, n);
+  this.list = n, this.value = r, e ? (e.next = this, this.prev = e) : this.prev = null, t ? (t.prev = this, this.next = t) : this.next = null;
+}
+try {
+  Jn()($);
+} catch {
+}
+const ri = Kn, J = Symbol("max"), B = Symbol("length"), ie = Symbol("lengthCalculator"), he = Symbol("allowStale"), K = Symbol("maxAge"), X = Symbol("dispose"), At = Symbol("noDisposeOnSet"), x = Symbol("lruList"), j = Symbol("cache"), sr = Symbol("updateAgeOnGet"), Fe = () => 1;
+class ni {
+  constructor(e) {
+    if (typeof e == "number" && (e = { max: e }), e || (e = {}), e.max && (typeof e.max != "number" || e.max < 0))
+      throw new TypeError("max must be a non-negative number");
+    this[J] = e.max || 1 / 0;
+    const t = e.length || Fe;
+    if (this[ie] = typeof t != "function" ? Fe : t, this[he] = e.stale || !1, e.maxAge && typeof e.maxAge != "number")
+      throw new TypeError("maxAge must be a number");
+    this[K] = e.maxAge || 0, this[X] = e.dispose, this[At] = e.noDisposeOnSet || !1, this[sr] = e.updateAgeOnGet || !1, this.reset();
+  }
+  // resize the cache when the max changes.
+  set max(e) {
+    if (typeof e != "number" || e < 0)
+      throw new TypeError("max must be a non-negative number");
+    this[J] = e || 1 / 0, le(this);
+  }
+  get max() {
+    return this[J];
+  }
+  set allowStale(e) {
+    this[he] = !!e;
+  }
+  get allowStale() {
+    return this[he];
+  }
+  set maxAge(e) {
+    if (typeof e != "number")
+      throw new TypeError("maxAge must be a non-negative number");
+    this[K] = e, le(this);
+  }
+  get maxAge() {
+    return this[K];
+  }
+  // resize the cache when the lengthCalculator changes.
+  set lengthCalculator(e) {
+    typeof e != "function" && (e = Fe), e !== this[ie] && (this[ie] = e, this[B] = 0, this[x].forEach((t) => {
+      t.length = this[ie](t.value, t.key), this[B] += t.length;
+    })), le(this);
+  }
+  get lengthCalculator() {
+    return this[ie];
+  }
+  get length() {
+    return this[B];
+  }
+  get itemCount() {
+    return this[x].length;
+  }
+  rforEach(e, t) {
+    t = t || this;
+    for (let n = this[x].tail; n !== null; ) {
+      const i = n.prev;
+      Tt(this, e, n, t), n = i;
+    }
+  }
+  forEach(e, t) {
+    t = t || this;
+    for (let n = this[x].head; n !== null; ) {
+      const i = n.next;
+      Tt(this, e, n, t), n = i;
+    }
+  }
+  keys() {
+    return this[x].toArray().map((e) => e.key);
+  }
+  values() {
+    return this[x].toArray().map((e) => e.value);
+  }
+  reset() {
+    this[X] && this[x] && this[x].length && this[x].forEach((e) => this[X](e.key, e.value)), this[j] = /* @__PURE__ */ new Map(), this[x] = new ri(), this[B] = 0;
+  }
+  dump() {
+    return this[x].map((e) => Oe(this, e) ? !1 : {
+      k: e.key,
+      v: e.value,
+      e: e.now + (e.maxAge || 0)
+    }).toArray().filter((e) => e);
+  }
+  dumpLru() {
+    return this[x];
+  }
+  set(e, t, n) {
+    if (n = n || this[K], n && typeof n != "number")
+      throw new TypeError("maxAge must be a number");
+    const i = n ? Date.now() : 0, s = this[ie](t, e);
+    if (this[j].has(e)) {
+      if (s > this[J])
+        return se(this, this[j].get(e)), !1;
+      const c = this[j].get(e).value;
+      return this[X] && (this[At] || this[X](e, c.value)), c.now = i, c.maxAge = n, c.value = t, this[B] += s - c.length, c.length = s, this.get(e), le(this), !0;
+    }
+    const a = new ii(e, t, s, i, n);
+    return a.length > this[J] ? (this[X] && this[X](e, t), !1) : (this[B] += a.length, this[x].unshift(a), this[j].set(e, this[x].head), le(this), !0);
+  }
+  has(e) {
+    if (!this[j].has(e))
+      return !1;
+    const t = this[j].get(e).value;
+    return !Oe(this, t);
+  }
+  get(e) {
+    return Ge(this, e, !0);
+  }
+  peek(e) {
+    return Ge(this, e, !1);
+  }
+  pop() {
+    const e = this[x].tail;
+    return e ? (se(this, e), e.value) : null;
+  }
+  del(e) {
+    se(this, this[j].get(e));
+  }
+  load(e) {
+    this.reset();
+    const t = Date.now();
+    for (let n = e.length - 1; n >= 0; n--) {
+      const i = e[n], s = i.e || 0;
+      if (s === 0)
+        this.set(i.k, i.v);
+      else {
+        const a = s - t;
+        a > 0 && this.set(i.k, i.v, a);
+      }
+    }
+  }
+  prune() {
+    this[j].forEach((e, t) => Ge(this, t, !1));
+  }
+}
+const Ge = (r, e, t) => {
+  const n = r[j].get(e);
+  if (n) {
+    const i = n.value;
+    if (Oe(r, i)) {
+      if (se(r, n), !r[he])
+        return;
+    } else
+      t && (r[sr] && (n.value.now = Date.now()), r[x].unshiftNode(n));
+    return i.value;
+  }
+}, Oe = (r, e) => {
+  if (!e || !e.maxAge && !r[K])
+    return !1;
+  const t = Date.now() - e.now;
+  return e.maxAge ? t > e.maxAge : r[K] && t > r[K];
+}, le = (r) => {
+  if (r[B] > r[J])
+    for (let e = r[x].tail; r[B] > r[J] && e !== null; ) {
+      const t = e.prev;
+      se(r, e), e = t;
+    }
+}, se = (r, e) => {
+  if (e) {
+    const t = e.value;
+    r[X] && r[X](t.key, t.value), r[B] -= t.length, r[j].delete(t.key), r[x].removeNode(e);
+  }
+};
+class ii {
+  constructor(e, t, n, i, s) {
+    this.key = e, this.value = t, this.length = n, this.now = i, this.maxAge = s || 0;
+  }
+}
+const Tt = (r, e, t, n) => {
+  let i = t.value;
+  Oe(r, i) && (se(r, t), r[he] || (i = void 0)), i && e.call(n, i.value, i.key, r);
+};
+var si = ni, ke, Ct;
+function G() {
+  if (Ct)
+    return ke;
+  Ct = 1;
+  class r {
+    constructor(h, y) {
+      if (y = n(y), h instanceof r)
+        return h.loose === !!y.loose && h.includePrerelease === !!y.includePrerelease ? h : new r(h.raw, y);
+      if (h instanceof i)
+        return this.raw = h.value, this.set = [[h]], this.format(), this;
+      if (this.options = y, this.loose = !!y.loose, this.includePrerelease = !!y.includePrerelease, this.raw = h.trim().split(/\s+/).join(" "), this.set = this.raw.split("||").map((m) => this.parseRange(m.trim())).filter((m) => m.length), !this.set.length)
+        throw new TypeError(`Invalid SemVer Range: ${this.raw}`);
+      if (this.set.length > 1) {
+        const m = this.set[0];
+        if (this.set = this.set.filter((E) => !g(E[0])), this.set.length === 0)
+          this.set = [m];
+        else if (this.set.length > 1) {
+          for (const E of this.set)
+            if (E.length === 1 && R(E[0])) {
+              this.set = [E];
+              break;
+            }
+        }
+      }
+      this.format();
+    }
+    format() {
+      return this.range = this.set.map((h) => h.join(" ").trim()).join("||").trim(), this.range;
+    }
+    toString() {
+      return this.range;
+    }
+    parseRange(h) {
+      const y = ((this.options.includePrerelease && w) | (this.options.loose && f)) + ":" + h, m = t.get(y);
+      if (m)
+        return m;
+      const E = this.options.loose, v = E ? c[o.HYPHENRANGELOOSE] : c[o.HYPHENRANGE];
+      h = h.replace(v, Sr(this.options.includePrerelease)), s("hyphen replace", h), h = h.replace(c[o.COMPARATORTRIM], l), s("comparator trim", h), h = h.replace(c[o.TILDETRIM], u), s("tilde trim", h), h = h.replace(c[o.CARETTRIM], p), s("caret trim", h);
+      let b = h.split(" ").map((A) => Q(A, this.options)).join(" ").split(/\s+/).map((A) => $r(A, this.options));
+      E && (b = b.filter((A) => (s("loose invalid filter", A, this.options), !!A.match(c[o.COMPARATORLOOSE])))), s("range list", b);
+      const S = /* @__PURE__ */ new Map(), I = b.map((A) => new i(A, this.options));
+      for (const A of I) {
+        if (g(A))
+          return [A];
+        S.set(A.value, A);
+      }
+      S.size > 1 && S.has("") && S.delete("");
+      const O = [...S.values()];
+      return t.set(y, O), O;
+    }
+    intersects(h, y) {
+      if (!(h instanceof r))
+        throw new TypeError("a Range is required");
+      return this.set.some((m) => D(m, y) && h.set.some((E) => D(E, y) && m.every((v) => E.every((b) => v.intersects(b, y)))));
+    }
+    // if ANY of the sets match ALL of its comparators, then pass
+    test(h) {
+      if (!h)
+        return !1;
+      if (typeof h == "string")
+        try {
+          h = new a(h, this.options);
+        } catch {
+          return !1;
+        }
+      for (let y = 0; y < this.set.length; y++)
+        if (Or(this.set[y], h, this.options))
+          return !0;
+      return !1;
+    }
+  }
+  ke = r;
+  const e = si, t = new e({ max: 1e3 }), n = it, i = Me(), s = Le, a = _, {
+    safeRe: c,
+    t: o,
+    comparatorTrimReplace: l,
+    tildeTrimReplace: u,
+    caretTrimReplace: p
+  } = ve, { FLAG_INCLUDE_PRERELEASE: w, FLAG_LOOSE: f } = xe, g = (d) => d.value === "<0.0.0-0", R = (d) => d.value === "", D = (d, h) => {
+    let y = !0;
+    const m = d.slice();
+    let E = m.pop();
+    for (; y && m.length; )
+      y = m.every((v) => E.intersects(v, h)), E = m.pop();
+    return y;
+  }, Q = (d, h) => (s("comp", d, h), d = yr(d, h), s("caret", d), d = W(d, h), s("tildes", d), d = wr(d, h), s("xrange", d), d = Ir(d, h), s("stars", d), d), L = (d) => !d || d.toLowerCase() === "x" || d === "*", W = (d, h) => d.trim().split(/\s+/).map((y) => Er(y, h)).join(" "), Er = (d, h) => {
+    const y = h.loose ? c[o.TILDELOOSE] : c[o.TILDE];
+    return d.replace(y, (m, E, v, b, S) => {
+      s("tilde", d, m, E, v, b, S);
+      let I;
+      return L(E) ? I = "" : L(v) ? I = `>=${E}.0.0 <${+E + 1}.0.0-0` : L(b) ? I = `>=${E}.${v}.0 <${E}.${+v + 1}.0-0` : S ? (s("replaceTilde pr", S), I = `>=${E}.${v}.${b}-${S} <${E}.${+v + 1}.0-0`) : I = `>=${E}.${v}.${b} <${E}.${+v + 1}.0-0`, s("tilde return", I), I;
+    });
+  }, yr = (d, h) => d.trim().split(/\s+/).map((y) => br(y, h)).join(" "), br = (d, h) => {
+    s("caret", d, h);
+    const y = h.loose ? c[o.CARETLOOSE] : c[o.CARET], m = h.includePrerelease ? "-0" : "";
+    return d.replace(y, (E, v, b, S, I) => {
+      s("caret", d, E, v, b, S, I);
+      let O;
+      return L(v) ? O = "" : L(b) ? O = `>=${v}.0.0${m} <${+v + 1}.0.0-0` : L(S) ? v === "0" ? O = `>=${v}.${b}.0${m} <${v}.${+b + 1}.0-0` : O = `>=${v}.${b}.0${m} <${+v + 1}.0.0-0` : I ? (s("replaceCaret pr", I), v === "0" ? b === "0" ? O = `>=${v}.${b}.${S}-${I} <${v}.${b}.${+S + 1}-0` : O = `>=${v}.${b}.${S}-${I} <${v}.${+b + 1}.0-0` : O = `>=${v}.${b}.${S}-${I} <${+v + 1}.0.0-0`) : (s("no pr"), v === "0" ? b === "0" ? O = `>=${v}.${b}.${S}${m} <${v}.${b}.${+S + 1}-0` : O = `>=${v}.${b}.${S}${m} <${v}.${+b + 1}.0-0` : O = `>=${v}.${b}.${S} <${+v + 1}.0.0-0`), s("caret return", O), O;
+    });
+  }, wr = (d, h) => (s("replaceXRanges", d, h), d.split(/\s+/).map((y) => Rr(y, h)).join(" ")), Rr = (d, h) => {
+    d = d.trim();
+    const y = h.loose ? c[o.XRANGELOOSE] : c[o.XRANGE];
+    return d.replace(y, (m, E, v, b, S, I) => {
+      s("xRange", d, m, E, v, b, S, I);
+      const O = L(v), A = O || L(b), te = A || L(S), ae = te;
+      return E === "=" && ae && (E = ""), I = h.includePrerelease ? "-0" : "", O ? E === ">" || E === "<" ? m = "<0.0.0-0" : m = "*" : E && ae ? (A && (b = 0), S = 0, E === ">" ? (E = ">=", A ? (v = +v + 1, b = 0, S = 0) : (b = +b + 1, S = 0)) : E === "<=" && (E = "<", A ? v = +v + 1 : b = +b + 1), E === "<" && (I = "-0"), m = `${E + v}.${b}.${S}${I}`) : A ? m = `>=${v}.0.0${I} <${+v + 1}.0.0-0` : te && (m = `>=${v}.${b}.0${I} <${v}.${+b + 1}.0-0`), s("xRange return", m), m;
+    });
+  }, Ir = (d, h) => (s("replaceStars", d, h), d.trim().replace(c[o.STAR], "")), $r = (d, h) => (s("replaceGTE0", d, h), d.trim().replace(c[h.includePrerelease ? o.GTE0PRE : o.GTE0], "")), Sr = (d) => (h, y, m, E, v, b, S, I, O, A, te, ae, mo) => (L(m) ? y = "" : L(E) ? y = `>=${m}.0.0${d ? "-0" : ""}` : L(v) ? y = `>=${m}.${E}.0${d ? "-0" : ""}` : b ? y = `>=${y}` : y = `>=${y}${d ? "-0" : ""}`, L(O) ? I = "" : L(A) ? I = `<${+O + 1}.0.0-0` : L(te) ? I = `<${O}.${+A + 1}.0-0` : ae ? I = `<=${O}.${A}.${te}-${ae}` : d ? I = `<${O}.${A}.${+te + 1}-0` : I = `<=${I}`, `${y} ${I}`.trim()), Or = (d, h, y) => {
+    for (let m = 0; m < d.length; m++)
+      if (!d[m].test(h))
+        return !1;
+    if (h.prerelease.length && !y.includePrerelease) {
+      for (let m = 0; m < d.length; m++)
+        if (s(d[m].semver), d[m].semver !== i.ANY && d[m].semver.prerelease.length > 0) {
+          const E = d[m].semver;
+          if (E.major === h.major && E.minor === h.minor && E.patch === h.patch)
+            return !0;
+        }
+      return !1;
+    }
+    return !0;
+  };
+  return ke;
+}
+var Ve, Nt;
+function Me() {
+  if (Nt)
+    return Ve;
+  Nt = 1;
+  const r = Symbol("SemVer ANY");
+  class e {
+    static get ANY() {
+      return r;
+    }
+    constructor(u, p) {
+      if (p = t(p), u instanceof e) {
+        if (u.loose === !!p.loose)
+          return u;
+        u = u.value;
+      }
+      u = u.trim().split(/\s+/).join(" "), a("comparator", u, p), this.options = p, this.loose = !!p.loose, this.parse(u), this.semver === r ? this.value = "" : this.value = this.operator + this.semver.version, a("comp", this);
+    }
+    parse(u) {
+      const p = this.options.loose ? n[i.COMPARATORLOOSE] : n[i.COMPARATOR], w = u.match(p);
+      if (!w)
+        throw new TypeError(`Invalid comparator: ${u}`);
+      this.operator = w[1] !== void 0 ? w[1] : "", this.operator === "=" && (this.operator = ""), w[2] ? this.semver = new c(w[2], this.options.loose) : this.semver = r;
+    }
+    toString() {
+      return this.value;
+    }
+    test(u) {
+      if (a("Comparator.test", u, this.options.loose), this.semver === r || u === r)
+        return !0;
+      if (typeof u == "string")
+        try {
+          u = new c(u, this.options);
+        } catch {
+          return !1;
+        }
+      return s(u, this.operator, this.semver, this.options);
+    }
+    intersects(u, p) {
+      if (!(u instanceof e))
+        throw new TypeError("a Comparator is required");
+      return this.operator === "" ? this.value === "" ? !0 : new o(u.value, p).test(this.value) : u.operator === "" ? u.value === "" ? !0 : new o(this.value, p).test(u.semver) : (p = t(p), p.includePrerelease && (this.value === "<0.0.0-0" || u.value === "<0.0.0-0") || !p.includePrerelease && (this.value.startsWith("<0.0.0") || u.value.startsWith("<0.0.0")) ? !1 : !!(this.operator.startsWith(">") && u.operator.startsWith(">") || this.operator.startsWith("<") && u.operator.startsWith("<") || this.semver.version === u.semver.version && this.operator.includes("=") && u.operator.includes("=") || s(this.semver, "<", u.semver, p) && this.operator.startsWith(">") && u.operator.startsWith("<") || s(this.semver, ">", u.semver, p) && this.operator.startsWith("<") && u.operator.startsWith(">")));
+    }
+  }
+  Ve = e;
+  const t = it, { safeRe: n, t: i } = ve, s = ir, a = Le, c = _, o = G();
+  return Ve;
+}
+const oi = G(), ai = (r, e, t) => {
+  try {
+    e = new oi(e, t);
+  } catch {
+    return !1;
+  }
+  return e.test(r);
+};
+var _e = ai;
+const li = G(), ci = (r, e) => new li(r, e).set.map((t) => t.map((n) => n.value).join(" ").trim().split(" "));
+var ui = ci;
+const hi = _, pi = G(), fi = (r, e, t) => {
+  let n = null, i = null, s = null;
+  try {
+    s = new pi(e, t);
+  } catch {
+    return null;
+  }
+  return r.forEach((a) => {
+    s.test(a) && (!n || i.compare(a) === -1) && (n = a, i = new hi(n, t));
+  }), n;
+};
+var di = fi;
+const vi = _, gi = G(), mi = (r, e, t) => {
+  let n = null, i = null, s = null;
+  try {
+    s = new gi(e, t);
+  } catch {
+    return null;
+  }
+  return r.forEach((a) => {
+    s.test(a) && (!n || i.compare(a) === 1) && (n = a, i = new vi(n, t));
+  }), n;
+};
+var Ei = mi;
+const He = _, yi = G(), xt = Pe, bi = (r, e) => {
+  r = new yi(r, e);
+  let t = new He("0.0.0");
+  if (r.test(t) || (t = new He("0.0.0-0"), r.test(t)))
+    return t;
+  t = null;
+  for (let n = 0; n < r.set.length; ++n) {
+    const i = r.set[n];
+    let s = null;
+    i.forEach((a) => {
+      const c = new He(a.semver.version);
+      switch (a.operator) {
+        case ">":
+          c.prerelease.length === 0 ? c.patch++ : c.prerelease.push(0), c.raw = c.format();
+        case "":
+        case ">=":
+          (!s || xt(c, s)) && (s = c);
+          break;
+        case "<":
+        case "<=":
+          break;
+        default:
+          throw new Error(`Unexpected operation: ${a.operator}`);
+      }
+    }), s && (!t || xt(t, s)) && (t = s);
+  }
+  return t && r.test(t) ? t : null;
+};
+var wi = bi;
+const Ri = G(), Ii = (r, e) => {
+  try {
+    return new Ri(r, e).range || "*";
+  } catch {
+    return null;
+  }
+};
+var $i = Ii;
+const Si = _, or = Me(), { ANY: Oi } = or, Ai = G(), Ti = _e, Lt = Pe, Pt = ot, Ci = lt, Ni = at, xi = (r, e, t, n) => {
+  r = new Si(r, n), e = new Ai(e, n);
+  let i, s, a, c, o;
+  switch (t) {
+    case ">":
+      i = Lt, s = Ci, a = Pt, c = ">", o = ">=";
+      break;
+    case "<":
+      i = Pt, s = Ni, a = Lt, c = "<", o = "<=";
+      break;
+    default:
+      throw new TypeError('Must provide a hilo val of "<" or ">"');
+  }
+  if (Ti(r, e, n))
+    return !1;
+  for (let l = 0; l < e.set.length; ++l) {
+    const u = e.set[l];
+    let p = null, w = null;
+    if (u.forEach((f) => {
+      f.semver === Oi && (f = new or(">=0.0.0")), p = p || f, w = w || f, i(f.semver, p.semver, n) ? p = f : a(f.semver, w.semver, n) && (w = f);
+    }), p.operator === c || p.operator === o || (!w.operator || w.operator === c) && s(r, w.semver) || w.operator === o && a(r, w.semver))
+      return !1;
+  }
+  return !0;
+};
+var ct = xi;
+const Li = ct, Pi = (r, e, t) => Li(r, e, ">", t);
+var Mi = Pi;
+const _i = ct, Di = (r, e, t) => _i(r, e, "<", t);
+var Ui = Di;
+const Mt = G(), ji = (r, e, t) => (r = new Mt(r, t), e = new Mt(e, t), r.intersects(e, t));
+var Fi = ji;
+const Gi = _e, ki = F;
+var Vi = (r, e, t) => {
+  const n = [];
+  let i = null, s = null;
+  const a = r.sort((u, p) => ki(u, p, t));
+  for (const u of a)
+    Gi(u, e, t) ? (s = u, i || (i = u)) : (s && n.push([i, s]), s = null, i = null);
+  i && n.push([i, null]);
+  const c = [];
+  for (const [u, p] of n)
+    u === p ? c.push(u) : !p && u === a[0] ? c.push("*") : p ? u === a[0] ? c.push(`<=${p}`) : c.push(`${u} - ${p}`) : c.push(`>=${u}`);
+  const o = c.join(" || "), l = typeof e.raw == "string" ? e.raw : String(e);
+  return o.length < l.length ? o : e;
+};
+const _t = G(), ut = Me(), { ANY: Xe } = ut, ce = _e, ht = F, Hi = (r, e, t = {}) => {
+  if (r === e)
+    return !0;
+  r = new _t(r, t), e = new _t(e, t);
+  let n = !1;
+  e:
+    for (const i of r.set) {
+      for (const s of e.set) {
+        const a = Bi(i, s, t);
+        if (n = n || a !== null, a)
+          continue e;
+      }
+      if (n)
+        return !1;
+    }
+  return !0;
+}, Xi = [new ut(">=0.0.0-0")], Dt = [new ut(">=0.0.0")], Bi = (r, e, t) => {
+  if (r === e)
+    return !0;
+  if (r.length === 1 && r[0].semver === Xe) {
+    if (e.length === 1 && e[0].semver === Xe)
+      return !0;
+    t.includePrerelease ? r = Xi : r = Dt;
+  }
+  if (e.length === 1 && e[0].semver === Xe) {
+    if (t.includePrerelease)
+      return !0;
+    e = Dt;
+  }
+  const n = /* @__PURE__ */ new Set();
+  let i, s;
+  for (const f of r)
+    f.operator === ">" || f.operator === ">=" ? i = Ut(i, f, t) : f.operator === "<" || f.operator === "<=" ? s = jt(s, f, t) : n.add(f.semver);
+  if (n.size > 1)
+    return null;
+  let a;
+  if (i && s && (a = ht(i.semver, s.semver, t), a > 0 || a === 0 && (i.operator !== ">=" || s.operator !== "<=")))
+    return null;
+  for (const f of n) {
+    if (i && !ce(f, String(i), t) || s && !ce(f, String(s), t))
+      return null;
+    for (const g of e)
+      if (!ce(f, String(g), t))
+        return !1;
+    return !0;
+  }
+  let c, o, l, u, p = s && !t.includePrerelease && s.semver.prerelease.length ? s.semver : !1, w = i && !t.includePrerelease && i.semver.prerelease.length ? i.semver : !1;
+  p && p.prerelease.length === 1 && s.operator === "<" && p.prerelease[0] === 0 && (p = !1);
+  for (const f of e) {
+    if (u = u || f.operator === ">" || f.operator === ">=", l = l || f.operator === "<" || f.operator === "<=", i) {
+      if (w && f.semver.prerelease && f.semver.prerelease.length && f.semver.major === w.major && f.semver.minor === w.minor && f.semver.patch === w.patch && (w = !1), f.operator === ">" || f.operator === ">=") {
+        if (c = Ut(i, f, t), c === f && c !== i)
+          return !1;
+      } else if (i.operator === ">=" && !ce(i.semver, String(f), t))
+        return !1;
+    }
+    if (s) {
+      if (p && f.semver.prerelease && f.semver.prerelease.length && f.semver.major === p.major && f.semver.minor === p.minor && f.semver.patch === p.patch && (p = !1), f.operator === "<" || f.operator === "<=") {
+        if (o = jt(s, f, t), o === f && o !== s)
+          return !1;
+      } else if (s.operator === "<=" && !ce(s.semver, String(f), t))
+        return !1;
+    }
+    if (!f.operator && (s || i) && a !== 0)
+      return !1;
+  }
+  return !(i && l && !s && a !== 0 || s && u && !i && a !== 0 || w || p);
+}, Ut = (r, e, t) => {
+  if (!r)
+    return e;
+  const n = ht(r.semver, e.semver, t);
+  return n > 0 ? r : n < 0 || e.operator === ">" && r.operator === ">=" ? e : r;
+}, jt = (r, e, t) => {
+  if (!r)
+    return e;
+  const n = ht(r.semver, e.semver, t);
+  return n < 0 ? r : n > 0 || e.operator === "<" && r.operator === "<=" ? e : r;
+};
+var qi = Hi;
+const Be = ve, Ft = xe, Yi = _, Gt = tr, zi = oe, Qi = Yr, Wi = Wr, Ji = Kr, Ki = en, Zi = nn, es = an, ts = un, rs = fn, ns = F, is = mn, ss = bn, os = st, as = $n, ls = An, cs = Pe, us = ot, hs = rr, ps = nr, fs = at, ds = lt, vs = ir, gs = Wn, ms = Me(), Es = G(), ys = _e, bs = ui, ws = di, Rs = Ei, Is = wi, $s = $i, Ss = ct, Os = Mi, As = Ui, Ts = Fi, Cs = Vi, Ns = qi;
+var C = {
+  parse: zi,
+  valid: Qi,
+  clean: Wi,
+  inc: Ji,
+  diff: Ki,
+  major: Zi,
+  minor: es,
+  patch: ts,
+  prerelease: rs,
+  compare: ns,
+  rcompare: is,
+  compareLoose: ss,
+  compareBuild: os,
+  sort: as,
+  rsort: ls,
+  gt: cs,
+  lt: us,
+  eq: hs,
+  neq: ps,
+  gte: fs,
+  lte: ds,
+  cmp: vs,
+  coerce: gs,
+  Comparator: ms,
+  Range: Es,
+  satisfies: ys,
+  toComparators: bs,
+  maxSatisfying: ws,
+  minSatisfying: Rs,
+  minVersion: Is,
+  validRange: $s,
+  outside: Ss,
+  gtr: Os,
+  ltr: As,
+  intersects: Ts,
+  simplifyRange: Cs,
+  subset: Ns,
+  SemVer: Yi,
+  re: Be.re,
+  src: Be.src,
+  tokens: Be.t,
+  SEMVER_SPEC_VERSION: Ft.SEMVER_SPEC_VERSION,
+  RELEASE_TYPES: Ft.RELEASE_TYPES,
+  compareIdentifiers: Gt.compareIdentifiers,
+  rcompareIdentifiers: Gt.rcompareIdentifiers
+};
+class N extends Error {
+  constructor(e) {
+    super(`Incorrect context (${e}). Cannot perform the requested operation.`), q(this, "context"), this.context = e;
+  }
+}
+class $e extends Error {
+  constructor(e, t, n) {
+    super(`Invalid parameter (${e}). ${n}`), this.param = e, this.value = t, this.reason = n;
+  }
+}
+class xs extends Error {
+  constructor(e, t) {
+    super(
+      `'streamId' value of "${e}" is different from what we expected ("${t}")`
+    ), this.streamId = e, this.expectedStreamId = t;
+  }
+}
+class kt extends Error {
+  constructor(e) {
+    super(`${e} needs to be initialized before it can be used.`);
+  }
+}
+class Vt extends Error {
+  constructor(e, t) {
+    let n = `Unsupported Protocol ${Array.isArray(e) ? "versions" : "version"}: (${e}).`;
+    t && (n += ` Minimum version supported is ${t}.`), super(n), this.version = e;
+  }
+}
+var Je = function(r, e) {
+  return Je = Object.setPrototypeOf || { __proto__: [] } instanceof Array && function(t, n) {
+    t.__proto__ = n;
+  } || function(t, n) {
+    for (var i in n)
+      Object.prototype.hasOwnProperty.call(n, i) && (t[i] = n[i]);
+  }, Je(r, e);
+};
+function z(r, e) {
+  if (typeof e != "function" && e !== null)
+    throw new TypeError("Class extends value " + String(e) + " is not a constructor or null");
+  Je(r, e);
+  function t() {
+    this.constructor = r;
+  }
+  r.prototype = e === null ? Object.create(e) : (t.prototype = e.prototype, new t());
+}
+function Ke(r) {
+  var e = typeof Symbol == "function" && Symbol.iterator, t = e && r[e], n = 0;
+  if (t)
+    return t.call(r);
+  if (r && typeof r.length == "number")
+    return {
+      next: function() {
+        return r && n >= r.length && (r = void 0), { value: r && r[n++], done: !r };
+      }
+    };
+  throw new TypeError(e ? "Object is not iterable." : "Symbol.iterator is not defined.");
+}
+function pe(r, e) {
+  var t = typeof Symbol == "function" && r[Symbol.iterator];
+  if (!t)
+    return r;
+  var n = t.call(r), i, s = [], a;
+  try {
+    for (; (e === void 0 || e-- > 0) && !(i = n.next()).done; )
+      s.push(i.value);
+  } catch (c) {
+    a = { error: c };
+  } finally {
+    try {
+      i && !i.done && (t = n.return) && t.call(n);
+    } finally {
+      if (a)
+        throw a.error;
+    }
+  }
+  return s;
+}
+function fe(r, e, t) {
+  if (t || arguments.length === 2)
+    for (var n = 0, i = e.length, s; n < i; n++)
+      (s || !(n in e)) && (s || (s = Array.prototype.slice.call(e, 0, n)), s[n] = e[n]);
+  return r.concat(s || Array.prototype.slice.call(e));
+}
+function U(r) {
+  return typeof r == "function";
+}
+function ar(r) {
+  var e = function(n) {
+    Error.call(n), n.stack = new Error().stack;
+  }, t = r(e);
+  return t.prototype = Object.create(Error.prototype), t.prototype.constructor = t, t;
+}
+var qe = ar(function(r) {
+  return function(e) {
+    r(this), this.message = e ? e.length + ` errors occurred during unsubscription:
+` + e.map(function(t, n) {
+      return n + 1 + ") " + t.toString();
+    }).join(`
+  `) : "", this.name = "UnsubscriptionError", this.errors = e;
+  };
+});
+function Ae(r, e) {
+  if (r) {
+    var t = r.indexOf(e);
+    0 <= t && r.splice(t, 1);
+  }
+}
+var ge = function() {
+  function r(e) {
+    this.initialTeardown = e, this.closed = !1, this._parentage = null, this._finalizers = null;
+  }
+  return r.prototype.unsubscribe = function() {
+    var e, t, n, i, s;
+    if (!this.closed) {
+      this.closed = !0;
+      var a = this._parentage;
+      if (a)
+        if (this._parentage = null, Array.isArray(a))
+          try {
+            for (var c = Ke(a), o = c.next(); !o.done; o = c.next()) {
+              var l = o.value;
+              l.remove(this);
+            }
+          } catch (R) {
+            e = { error: R };
+          } finally {
+            try {
+              o && !o.done && (t = c.return) && t.call(c);
+            } finally {
+              if (e)
+                throw e.error;
+            }
+          }
+        else
+          a.remove(this);
+      var u = this.initialTeardown;
+      if (U(u))
+        try {
+          u();
+        } catch (R) {
+          s = R instanceof qe ? R.errors : [R];
+        }
+      var p = this._finalizers;
+      if (p) {
+        this._finalizers = null;
+        try {
+          for (var w = Ke(p), f = w.next(); !f.done; f = w.next()) {
+            var g = f.value;
+            try {
+              Ht(g);
+            } catch (R) {
+              s = s ?? [], R instanceof qe ? s = fe(fe([], pe(s)), pe(R.errors)) : s.push(R);
+            }
+          }
+        } catch (R) {
+          n = { error: R };
+        } finally {
+          try {
+            f && !f.done && (i = w.return) && i.call(w);
+          } finally {
+            if (n)
+              throw n.error;
+          }
+        }
+      }
+      if (s)
+        throw new qe(s);
+    }
+  }, r.prototype.add = function(e) {
+    var t;
+    if (e && e !== this)
+      if (this.closed)
+        Ht(e);
+      else {
+        if (e instanceof r) {
+          if (e.closed || e._hasParent(this))
+            return;
+          e._addParent(this);
+        }
+        (this._finalizers = (t = this._finalizers) !== null && t !== void 0 ? t : []).push(e);
+      }
+  }, r.prototype._hasParent = function(e) {
+    var t = this._parentage;
+    return t === e || Array.isArray(t) && t.includes(e);
+  }, r.prototype._addParent = function(e) {
+    var t = this._parentage;
+    this._parentage = Array.isArray(t) ? (t.push(e), t) : t ? [t, e] : e;
+  }, r.prototype._removeParent = function(e) {
+    var t = this._parentage;
+    t === e ? this._parentage = null : Array.isArray(t) && Ae(t, e);
+  }, r.prototype.remove = function(e) {
+    var t = this._finalizers;
+    t && Ae(t, e), e instanceof r && e._removeParent(this);
+  }, r.EMPTY = function() {
+    var e = new r();
+    return e.closed = !0, e;
+  }(), r;
+}(), lr = ge.EMPTY;
+function cr(r) {
+  return r instanceof ge || r && "closed" in r && U(r.remove) && U(r.add) && U(r.unsubscribe);
+}
+function Ht(r) {
+  U(r) ? r() : r.unsubscribe();
+}
+var ur = {
+  onUnhandledError: null,
+  onStoppedNotification: null,
+  Promise: void 0,
+  useDeprecatedSynchronousErrorHandling: !1,
+  useDeprecatedNextContext: !1
+}, Ls = {
+  setTimeout: function(r, e) {
+    for (var t = [], n = 2; n < arguments.length; n++)
+      t[n - 2] = arguments[n];
+    return setTimeout.apply(void 0, fe([r, e], pe(t)));
+  },
+  clearTimeout: function(r) {
+    return clearTimeout(r);
+  },
+  delegate: void 0
+};
+function Ps(r) {
+  Ls.setTimeout(function() {
+    throw r;
+  });
+}
+function Xt() {
+}
+function Se(r) {
+  r();
+}
+var pt = function(r) {
+  z(e, r);
+  function e(t) {
+    var n = r.call(this) || this;
+    return n.isStopped = !1, t ? (n.destination = t, cr(t) && t.add(n)) : n.destination = Us, n;
+  }
+  return e.create = function(t, n, i) {
+    return new Ze(t, n, i);
+  }, e.prototype.next = function(t) {
+    this.isStopped || this._next(t);
+  }, e.prototype.error = function(t) {
+    this.isStopped || (this.isStopped = !0, this._error(t));
+  }, e.prototype.complete = function() {
+    this.isStopped || (this.isStopped = !0, this._complete());
+  }, e.prototype.unsubscribe = function() {
+    this.closed || (this.isStopped = !0, r.prototype.unsubscribe.call(this), this.destination = null);
+  }, e.prototype._next = function(t) {
+    this.destination.next(t);
+  }, e.prototype._error = function(t) {
+    try {
+      this.destination.error(t);
+    } finally {
+      this.unsubscribe();
+    }
+  }, e.prototype._complete = function() {
+    try {
+      this.destination.complete();
+    } finally {
+      this.unsubscribe();
+    }
+  }, e;
+}(ge), Ms = Function.prototype.bind;
+function Ye(r, e) {
+  return Ms.call(r, e);
+}
+var _s = function() {
+  function r(e) {
+    this.partialObserver = e;
+  }
+  return r.prototype.next = function(e) {
+    var t = this.partialObserver;
+    if (t.next)
+      try {
+        t.next(e);
+      } catch (n) {
+        we(n);
+      }
+  }, r.prototype.error = function(e) {
+    var t = this.partialObserver;
+    if (t.error)
+      try {
+        t.error(e);
+      } catch (n) {
+        we(n);
+      }
+    else
+      we(e);
+  }, r.prototype.complete = function() {
+    var e = this.partialObserver;
+    if (e.complete)
+      try {
+        e.complete();
+      } catch (t) {
+        we(t);
+      }
+  }, r;
+}(), Ze = function(r) {
+  z(e, r);
+  function e(t, n, i) {
+    var s = r.call(this) || this, a;
+    if (U(t) || !t)
+      a = {
+        next: t ?? void 0,
+        error: n ?? void 0,
+        complete: i ?? void 0
+      };
+    else {
+      var c;
+      s && ur.useDeprecatedNextContext ? (c = Object.create(t), c.unsubscribe = function() {
+        return s.unsubscribe();
+      }, a = {
+        next: t.next && Ye(t.next, c),
+        error: t.error && Ye(t.error, c),
+        complete: t.complete && Ye(t.complete, c)
+      }) : a = t;
+    }
+    return s.destination = new _s(a), s;
+  }
+  return e;
+}(pt);
+function we(r) {
+  Ps(r);
+}
+function Ds(r) {
+  throw r;
+}
+var Us = {
+  closed: !0,
+  next: Xt,
+  error: Ds,
+  complete: Xt
+}, js = function() {
+  return typeof Symbol == "function" && Symbol.observable || "@@observable";
+}();
+function hr(r) {
+  return r;
+}
+function Fs(r) {
+  return r.length === 0 ? hr : r.length === 1 ? r[0] : function(e) {
+    return r.reduce(function(t, n) {
+      return n(t);
+    }, e);
+  };
+}
+var Te = function() {
+  function r(e) {
+    e && (this._subscribe = e);
+  }
+  return r.prototype.lift = function(e) {
+    var t = new r();
+    return t.source = this, t.operator = e, t;
+  }, r.prototype.subscribe = function(e, t, n) {
+    var i = this, s = ks(e) ? e : new Ze(e, t, n);
+    return Se(function() {
+      var a = i, c = a.operator, o = a.source;
+      s.add(c ? c.call(s, o) : o ? i._subscribe(s) : i._trySubscribe(s));
+    }), s;
+  }, r.prototype._trySubscribe = function(e) {
+    try {
+      return this._subscribe(e);
+    } catch (t) {
+      e.error(t);
+    }
+  }, r.prototype.forEach = function(e, t) {
+    var n = this;
+    return t = Bt(t), new t(function(i, s) {
+      var a = new Ze({
+        next: function(c) {
+          try {
+            e(c);
+          } catch (o) {
+            s(o), a.unsubscribe();
+          }
+        },
+        error: s,
+        complete: i
+      });
+      n.subscribe(a);
+    });
+  }, r.prototype._subscribe = function(e) {
+    var t;
+    return (t = this.source) === null || t === void 0 ? void 0 : t.subscribe(e);
+  }, r.prototype[js] = function() {
+    return this;
+  }, r.prototype.pipe = function() {
+    for (var e = [], t = 0; t < arguments.length; t++)
+      e[t] = arguments[t];
+    return Fs(e)(this);
+  }, r.prototype.toPromise = function(e) {
+    var t = this;
+    return e = Bt(e), new e(function(n, i) {
+      var s;
+      t.subscribe(function(a) {
+        return s = a;
+      }, function(a) {
+        return i(a);
+      }, function() {
+        return n(s);
+      });
+    });
+  }, r.create = function(e) {
+    return new r(e);
+  }, r;
+}();
+function Bt(r) {
+  var e;
+  return (e = r ?? ur.Promise) !== null && e !== void 0 ? e : Promise;
+}
+function Gs(r) {
+  return r && U(r.next) && U(r.error) && U(r.complete);
+}
+function ks(r) {
+  return r && r instanceof pt || Gs(r) && cr(r);
+}
+function Vs(r) {
+  return U(r == null ? void 0 : r.lift);
+}
+function De(r) {
+  return function(e) {
+    if (Vs(e))
+      return e.lift(function(t) {
+        try {
+          return r(t, this);
+        } catch (n) {
+          this.error(n);
+        }
+      });
+    throw new TypeError("Unable to lift unknown Observable type");
+  };
+}
+function Ue(r, e, t, n, i) {
+  return new Hs(r, e, t, n, i);
+}
+var Hs = function(r) {
+  z(e, r);
+  function e(t, n, i, s, a, c) {
+    var o = r.call(this, t) || this;
+    return o.onFinalize = a, o.shouldUnsubscribe = c, o._next = n ? function(l) {
+      try {
+        n(l);
+      } catch (u) {
+        t.error(u);
+      }
+    } : r.prototype._next, o._error = s ? function(l) {
+      try {
+        s(l);
+      } catch (u) {
+        t.error(u);
+      } finally {
+        this.unsubscribe();
+      }
+    } : r.prototype._error, o._complete = i ? function() {
+      try {
+        i();
+      } catch (l) {
+        t.error(l);
+      } finally {
+        this.unsubscribe();
+      }
+    } : r.prototype._complete, o;
+  }
+  return e.prototype.unsubscribe = function() {
+    var t;
+    if (!this.shouldUnsubscribe || this.shouldUnsubscribe()) {
+      var n = this.closed;
+      r.prototype.unsubscribe.call(this), !n && ((t = this.onFinalize) === null || t === void 0 || t.call(this));
+    }
+  }, e;
+}(pt), Xs = ar(function(r) {
+  return function() {
+    r(this), this.name = "ObjectUnsubscribedError", this.message = "object unsubscribed";
+  };
+}), pr = function(r) {
+  z(e, r);
+  function e() {
+    var t = r.call(this) || this;
+    return t.closed = !1, t.currentObservers = null, t.observers = [], t.isStopped = !1, t.hasError = !1, t.thrownError = null, t;
+  }
+  return e.prototype.lift = function(t) {
+    var n = new qt(this, this);
+    return n.operator = t, n;
+  }, e.prototype._throwIfClosed = function() {
+    if (this.closed)
+      throw new Xs();
+  }, e.prototype.next = function(t) {
+    var n = this;
+    Se(function() {
+      var i, s;
+      if (n._throwIfClosed(), !n.isStopped) {
+        n.currentObservers || (n.currentObservers = Array.from(n.observers));
+        try {
+          for (var a = Ke(n.currentObservers), c = a.next(); !c.done; c = a.next()) {
+            var o = c.value;
+            o.next(t);
+          }
+        } catch (l) {
+          i = { error: l };
+        } finally {
+          try {
+            c && !c.done && (s = a.return) && s.call(a);
+          } finally {
+            if (i)
+              throw i.error;
+          }
+        }
+      }
+    });
+  }, e.prototype.error = function(t) {
+    var n = this;
+    Se(function() {
+      if (n._throwIfClosed(), !n.isStopped) {
+        n.hasError = n.isStopped = !0, n.thrownError = t;
+        for (var i = n.observers; i.length; )
+          i.shift().error(t);
+      }
+    });
+  }, e.prototype.complete = function() {
+    var t = this;
+    Se(function() {
+      if (t._throwIfClosed(), !t.isStopped) {
+        t.isStopped = !0;
+        for (var n = t.observers; n.length; )
+          n.shift().complete();
+      }
+    });
+  }, e.prototype.unsubscribe = function() {
+    this.isStopped = this.closed = !0, this.observers = this.currentObservers = null;
+  }, Object.defineProperty(e.prototype, "observed", {
+    get: function() {
+      var t;
+      return ((t = this.observers) === null || t === void 0 ? void 0 : t.length) > 0;
+    },
+    enumerable: !1,
+    configurable: !0
+  }), e.prototype._trySubscribe = function(t) {
+    return this._throwIfClosed(), r.prototype._trySubscribe.call(this, t);
+  }, e.prototype._subscribe = function(t) {
+    return this._throwIfClosed(), this._checkFinalizedStatuses(t), this._innerSubscribe(t);
+  }, e.prototype._innerSubscribe = function(t) {
+    var n = this, i = this, s = i.hasError, a = i.isStopped, c = i.observers;
+    return s || a ? lr : (this.currentObservers = null, c.push(t), new ge(function() {
+      n.currentObservers = null, Ae(c, t);
+    }));
+  }, e.prototype._checkFinalizedStatuses = function(t) {
+    var n = this, i = n.hasError, s = n.thrownError, a = n.isStopped;
+    i ? t.error(s) : a && t.complete();
+  }, e.prototype.asObservable = function() {
+    var t = new Te();
+    return t.source = this, t;
+  }, e.create = function(t, n) {
+    return new qt(t, n);
+  }, e;
+}(Te), qt = function(r) {
+  z(e, r);
+  function e(t, n) {
+    var i = r.call(this) || this;
+    return i.destination = t, i.source = n, i;
+  }
+  return e.prototype.next = function(t) {
+    var n, i;
+    (i = (n = this.destination) === null || n === void 0 ? void 0 : n.next) === null || i === void 0 || i.call(n, t);
+  }, e.prototype.error = function(t) {
+    var n, i;
+    (i = (n = this.destination) === null || n === void 0 ? void 0 : n.error) === null || i === void 0 || i.call(n, t);
+  }, e.prototype.complete = function() {
+    var t, n;
+    (n = (t = this.destination) === null || t === void 0 ? void 0 : t.complete) === null || n === void 0 || n.call(t);
+  }, e.prototype._subscribe = function(t) {
+    var n, i;
+    return (i = (n = this.source) === null || n === void 0 ? void 0 : n.subscribe(t)) !== null && i !== void 0 ? i : lr;
+  }, e;
+}(pr), Bs = {
+  now: function() {
+    return Date.now();
+  },
+  delegate: void 0
+}, qs = function(r) {
+  z(e, r);
+  function e(t, n) {
+    return r.call(this) || this;
+  }
+  return e.prototype.schedule = function(t, n) {
+    return this;
+  }, e;
+}(ge), et = {
+  setInterval: function(r, e) {
+    for (var t = [], n = 2; n < arguments.length; n++)
+      t[n - 2] = arguments[n];
+    var i = et.delegate;
+    return i != null && i.setInterval ? i.setInterval.apply(i, fe([r, e], pe(t))) : setInterval.apply(void 0, fe([r, e], pe(t)));
+  },
+  clearInterval: function(r) {
+    return clearInterval(r);
+  },
+  delegate: void 0
+}, Ys = function(r) {
+  z(e, r);
+  function e(t, n) {
+    var i = r.call(this, t, n) || this;
+    return i.scheduler = t, i.work = n, i.pending = !1, i;
+  }
+  return e.prototype.schedule = function(t, n) {
+    var i;
+    if (n === void 0 && (n = 0), this.closed)
+      return this;
+    this.state = t;
+    var s = this.id, a = this.scheduler;
+    return s != null && (this.id = this.recycleAsyncId(a, s, n)), this.pending = !0, this.delay = n, this.id = (i = this.id) !== null && i !== void 0 ? i : this.requestAsyncId(a, this.id, n), this;
+  }, e.prototype.requestAsyncId = function(t, n, i) {
+    return i === void 0 && (i = 0), et.setInterval(t.flush.bind(t, this), i);
+  }, e.prototype.recycleAsyncId = function(t, n, i) {
+    if (i === void 0 && (i = 0), i != null && this.delay === i && this.pending === !1)
+      return n;
+    n != null && et.clearInterval(n);
+  }, e.prototype.execute = function(t, n) {
+    if (this.closed)
+      return new Error("executing a cancelled action");
+    this.pending = !1;
+    var i = this._execute(t, n);
+    if (i)
+      return i;
+    this.pending === !1 && this.id != null && (this.id = this.recycleAsyncId(this.scheduler, this.id, null));
+  }, e.prototype._execute = function(t, n) {
+    var i = !1, s;
+    try {
+      this.work(t);
+    } catch (a) {
+      i = !0, s = a || new Error("Scheduled action threw falsy error");
+    }
+    if (i)
+      return this.unsubscribe(), s;
+  }, e.prototype.unsubscribe = function() {
+    if (!this.closed) {
+      var t = this, n = t.id, i = t.scheduler, s = i.actions;
+      this.work = this.state = this.scheduler = null, this.pending = !1, Ae(s, this), n != null && (this.id = this.recycleAsyncId(i, n, null)), this.delay = null, r.prototype.unsubscribe.call(this);
+    }
+  }, e;
+}(qs), Yt = function() {
+  function r(e, t) {
+    t === void 0 && (t = r.now), this.schedulerActionCtor = e, this.now = t;
+  }
+  return r.prototype.schedule = function(e, t, n) {
+    return t === void 0 && (t = 0), new this.schedulerActionCtor(this, e).schedule(n, t);
+  }, r.now = Bs.now, r;
+}(), zs = function(r) {
+  z(e, r);
+  function e(t, n) {
+    n === void 0 && (n = Yt.now);
+    var i = r.call(this, t, n) || this;
+    return i.actions = [], i._active = !1, i;
+  }
+  return e.prototype.flush = function(t) {
+    var n = this.actions;
+    if (this._active) {
+      n.push(t);
+      return;
+    }
+    var i;
+    this._active = !0;
+    do
+      if (i = t.execute(t.state, t.delay))
+        break;
+    while (t = n.shift());
+    if (this._active = !1, i) {
+      for (; t = n.shift(); )
+        t.unsubscribe();
+      throw i;
+    }
+  }, e;
+}(Yt), Qs = new zs(Ys), Ws = Qs, Js = new Te(function(r) {
+  return r.complete();
+});
+function Ks(r) {
+  return r && U(r.schedule);
+}
+function Zs(r) {
+  return r instanceof Date && !isNaN(r);
+}
+function T(r, e) {
+  return De(function(t, n) {
+    var i = 0;
+    t.subscribe(Ue(n, function(s) {
+      n.next(r.call(e, s, i++));
+    }));
+  });
+}
+function eo(r, e, t) {
+  r === void 0 && (r = 0), t === void 0 && (t = Ws);
+  var n = -1;
+  return e != null && (Ks(e) ? t = e : n = e), new Te(function(i) {
+    var s = Zs(r) ? +r - t.now() : r;
+    s < 0 && (s = 0);
+    var a = 0;
+    return t.schedule(function() {
+      i.closed || (i.next(a++), 0 <= n ? this.schedule(void 0, n) : i.complete());
+    }, s);
+  });
+}
+function M(r, e) {
+  return De(function(t, n) {
+    var i = 0;
+    t.subscribe(Ue(n, function(s) {
+      return r.call(e, s, i++) && n.next(s);
+    }));
+  });
+}
+function V(r) {
+  return r <= 0 ? function() {
+    return Js;
+  } : De(function(e, t) {
+    var n = 0;
+    e.subscribe(Ue(t, function(i) {
+      ++n <= r && (t.next(i), r <= n && t.complete());
+    }));
+  });
+}
+function P(r, e, t) {
+  var n = U(r) || e || t ? { next: r, error: e, complete: t } : r;
+  return n ? De(function(i, s) {
+    var a;
+    (a = n.subscribe) === null || a === void 0 || a.call(n);
+    var c = !0;
+    i.subscribe(Ue(s, function(o) {
+      var l;
+      (l = n.next) === null || l === void 0 || l.call(n, o), s.next(o);
+    }, function() {
+      var o;
+      c = !1, (o = n.complete) === null || o === void 0 || o.call(n), s.complete();
+    }, function(o) {
+      var l;
+      c = !1, (l = n.error) === null || l === void 0 || l.call(n, o), s.error(o);
+    }, function() {
+      var o, l;
+      c && ((o = n.unsubscribe) === null || o === void 0 || o.call(n)), (l = n.finalize) === null || l === void 0 || l.call(n);
+    }));
+  }) : hr;
+}
+class Z {
+  static gte(e, t) {
+    return t === void 0 ? (n) => Z.gte(n, e) ? n : !1 : C.gte(C.coerce(e), C.coerce(t));
+  }
+  static lte(e, t) {
+    return t === void 0 ? (n) => Z.lte(n, e) ? n : !1 : C.lte(C.coerce(e), C.coerce(t));
+  }
+  static gt(e, t) {
+    return t === void 0 ? (n) => Z.gt(n, e) ? n : !1 : C.gt(C.coerce(e), C.coerce(t));
+  }
+  static lt(e, t) {
+    return t === void 0 ? (n) => Z.lt(n, e) ? n : !1 : C.lt(C.coerce(e), C.coerce(t));
+  }
+  /**
+   * Check if the two {@link IpcProtocolVersion} values are logically (==) equal.
+   *
+   * @param v1 - First version to compare
+   * @param v2 - Second version to compare
+   * @returns Return true if the versions are logically (==) equal.
+   */
+  static eq(e, t) {
+    return C.eq(C.coerce(e), C.coerce(t));
+  }
+  /**
+   * Check if the two {@link IpcProtocolVersion} values are not equal.
+   *
+   * @param v1 - First version to compare
+   * @param v2 - Second version to compare
+   * @returns Return true if the versions are not equal.
+   */
+  static neq(e, t) {
+    return C.neq(C.coerce(e), C.coerce(t));
+  }
+  /**
+   * Compare two {@link IpcProtocolVersion} values.
+   *
+   * @param v1 - First version to compare
+   * @param v2 - Second version to compare
+   * @returns Return 0 if v1 == v2, or 1 if v1 is greater, or -1 if v2 is greater. Sorts in
+   * ascending order if passed to Array.sort().
+   */
+  static compare(e, t) {
+    return C.compare(C.coerce(e), C.coerce(t));
+  }
+}
+const zt = "1.0";
+class to {
+  /**
+   * Create a new instance of the {@link IpcHelper | IPC Protocol Helper}.
+   *
+   * @remarks
+   * Ideally, you should always have only one instance of the helper created at any point.
+   *
+   * @param supportedVersions - An array of supported protocol versions to choose from
+   * @param logService - An instance of a logging service or utility
+   */
+  constructor(e, t) {
+    if (q(this, "negotiatedProtocolVersion"), q(this, "currentContext"), q(this, "incomingMessages$"), q(this, "inIframe", !1), q(this, "embeddedResult"), q(this, "iframePort1"), q(this, "iframePort2"), this.supportedVersions = e, this.logService = t, this.incomingMessages$ = new pr(), this.supportedVersions = e.filter(Z.gte(zt)), !this.supportedVersions.length)
+      throw new Vt(e, zt);
+    this.negotiatedProtocolVersion = this.supportedVersions[0], this.embeddedResult = null, this.iframePort2 = null;
+  }
+  get parent() {
+    return window.parent;
+  }
+  get self() {
+    return window.self;
+  }
+  get frameElement() {
+    return window.frameElement;
+  }
+  // only used by remote party, not used locally
+  // @ts-expect-error
+  get port1() {
+    var e, t;
+    return this.inIframe ? this.iframePort1 : (t = (e = window.Acrobits) == null ? void 0 : e.messageChannel) == null ? void 0 : t.port1;
+  }
+  get port2() {
+    var e, t, n, i;
+    if (this.inIframe) {
+      if (!this.iframePort2)
+        throw new kt("port2");
+      return this.iframePort2;
+    } else {
+      if (!((t = (e = window.Acrobits) == null ? void 0 : e.messageChannel) != null && t.port2))
+        throw new kt("port2");
+      return (i = (n = window.Acrobits) == null ? void 0 : n.messageChannel) == null ? void 0 : i.port2;
+    }
+  }
+  /**
+   * Determines if the app is embedded in a Host app like WebRTC or native CSP clients.
+   *
+   * @returns Observable with the {@link AppContext} the app is running under. Emits once.
+   */
+  determineContext() {
+    return eo(1e3).pipe(
+      T(() => (this.isEmbedded() ? this.currentContext = "user" : this.currentContext = "guest", this.currentContext)),
+      V(1)
+    );
+  }
+  /**
+   * Opens the IPC Bridge by sending the {@link HelloMessage} to the host application to initiate
+   * handshake and returns an Observable that emits once with the {@link HelloMessageReply}.
+   *
+   * @returns Observable with a {@link HelloMessageReply} instance. Emits once.
+   */
+  openBridge() {
+    if (!this.isEmbedded())
+      throw new N(this.currentContext);
+    const e = "HELLO", t = this.createMessage(e);
+    t.protocolVersions = this.supportedVersions, this.logCreated(e, t);
+    const n = this.incomingMessages$.pipe(
+      M((i) => i.type === e && i.replyTo === t.id),
+      T((i) => i),
+      P(this.logReceived(e)),
+      T((i) => {
+        if (this.supportedVersions.some(Z.gt(i.protocolVersion)))
+          throw new Vt(i.protocolVersion, this.supportedVersions[0]);
+        return i;
+      }),
+      P((i) => {
+        this.negotiatedProtocolVersion = i.protocolVersion, this.logService.info(
+          `[IPC] Negotiated IPC Protocol Version: ${this.negotiatedProtocolVersion}`
+        );
+      }),
+      V(1)
+    );
+    return this.logService.debug(`Created ${e} Reply handler`), this.inIframe ? this.createIframeChannel().then(() => this.finishIpcSetup(t)) : this.finishIpcSetup(t), n;
+  }
+  /**
+   * Request an SSO Token from the Host app to authenticate the current user and make further API
+   * requests on their behalf.
+   *
+   * @returns Observable with a {@link TokenMessageReply} instance containing the SSO Token. Emits
+   * once.
+   */
+  requestSSOToken() {
+    if (!this.isEmbedded())
+      throw new N(this.currentContext);
+    const e = "TOKEN", t = this.createMessage(e);
+    this.logCreated(e, t);
+    const n = this.incomingMessages$.pipe(
+      M((i) => i.type === e && i.replyTo === t.id),
+      T((i) => i),
+      P(this.logReceived(e)),
+      V(1)
+    );
+    return this.logService.debug(`Created ${e} Reply handler`), this.port2.postMessage(t), this.logSent(e, t), n;
+  }
+  /**
+   * Sends the {@link JoiningRoomMessage} lifecycle message to the Host application based on the
+   * parameters provided.
+   *
+   * @remarks
+   * This message should always be sent whenever joining a conference. The host app can use
+   * information provided by the {@link JoiningRoomMessageParams} fields to properly setup it's own
+   * state and context if needed.
+   *
+   * @param params - Parameters object for the {@link JoiningRoomMessage} message.
+   *
+   * @returns This method returns void.
+   */
+  sendJoiningRoomMessage(e) {
+    if (!this.isEmbedded())
+      throw new N(this.currentContext);
+    const {
+      roomName: t,
+      roomInvite: n,
+      displayName: i,
+      jwtToken: s,
+      serverUrl: a,
+      region: c,
+      joinMicMuted: o,
+      joinWithoutCamera: l
+    } = e, u = "JOINING ROOM", p = this.createMessage(u, !1);
+    p.roomName = t, p.jwtToken = s, p.serverUrl = a, p.region = c, p.roomInvite = n, p.joinMicMuted = o ?? !1, p.joinWithoutCamera = l ?? !1, p.displayName = i, this.logCreated(u, p), this.port2.postMessage(p), this.logSent(u, p);
+  }
+  /**
+   * Sends a {@link LeavingRoomMessage} lifecycle message to the Host app.
+   *
+   * @remarks
+   * This message should always be sent whenever leaving a conference so the host app can manage
+   * it's state and context properly.
+   *
+   * @param roomName - The name of the room or Meeting ID we are leaving
+   *
+   * @returns This method returns void.
+   */
+  sendLeavingRoomMessage(e) {
+    if (!this.isEmbedded())
+      throw new N(this.currentContext);
+    const t = "LEAVING ROOM", n = this.createMessage(t, !1);
+    n.roomName = e, this.logCreated(t, n), this.port2.postMessage(n), this.logSent(t, n);
+  }
+  /**
+   * Setup listener for {@link JoinRoomMessage}, which can be sent by a host app to ask the client
+   * to join the specified room or meeting.
+   *
+   * @remarks
+   * The client app still needs to follow the standard workflow for joining a conference, including
+   * requesting an SSO Token and then sending the {@link JoiningRoomMessage} when joining the
+   * conference.
+   *
+   * @example
+   * Here is an example of how a listener can be setup:
+   *
+   * ```ts
+   * const ipcHelper = new IpcHelper(['1.0'], console);
+   *
+   * const joinRoomSubscription = ipcHelper.onJoinRoomMessage().subscribe((msg) => {
+   *  // your logic for handling the message goes here
+   * });
+   *
+   * // don't forget to unsubscribe when you're cleaning up
+   * joinRoomSubscription.unsubscribe();
+   * ```
+   *
+   * @returns An Observable that emits whenever {@link JoinRoomMessage} is received so it can be
+   * subscribed to indefinitely.
+   */
+  onJoinRoomMessage() {
+    if (!this.isEmbedded())
+      throw new N(this.currentContext);
+    const e = "JOIN ROOM";
+    return this.incomingMessages$.pipe(
+      M((t) => t.type === e && t.target === "client"),
+      T((t) => t),
+      P(this.logReceived(e)),
+      T((t) => t)
+    );
+  }
+  /**
+   * Setup listener for {@link LeaveRoomMessage}, which can be sent by a host app to ask the client
+   * to leave the current room or meeting.
+   *
+   * @remarks
+   * The client app still needs to follow the standard workflow for leaving a conference, including
+   * sending the {@link LeavingRoomMessage} when leaving the conference.
+   *
+   * @example
+   * Here is an example of how a listener can be setup:
+   *
+   * ```ts
+   * const ipcHelper = new IpcHelper(['1.0'], console);
+   *
+   * const leaveRoomSubscription = ipcHelper.onLeaveRoomMessage().subscribe((msg) => {
+   *  // your logic for handling the message goes here
+   * });
+   *
+   * // don't forget to unsubscribe when you're cleaning up
+   * leaveRoomSubscription.unsubscribe();
+   * ```
+   *
+   * @returns An Observable that emits whenever {@link LeavingRoomMessage} is received so it can be
+   * subscribed to indefinitely.
+   */
+  onLeaveRoomMessage() {
+    if (!this.isEmbedded())
+      throw new N(this.currentContext);
+    const e = "LEAVE ROOM";
+    return this.incomingMessages$.pipe(
+      M((t) => t.type === e && t.target === "client"),
+      T((t) => t),
+      P(this.logReceived(e)),
+      T((t) => t)
+    );
+  }
+  /**
+   * Setup listener for {@link ConfigMessage}, which is be sent by a host app whenever there is
+   * an update to the user preferences or configuration (e.g. new default video camera).
+   *
+   * @remarks
+   * Ideally, the client app should honor the user preferences received via {@link ConfigMessage},
+   * however if the client app has it's own preferences for similar options as well, then they
+   * should take priority.
+   *
+   * @example
+   * Here is an example of how a listener can be setup:
+   *
+   * ```ts
+   * const ipcHelper = new IpcHelper(['1.0'], console);
+   *
+   * const configSubscription = ipcHelper.onConfigMessage().subscribe((msg) => {
+   *  // your logic for handling the configuration goes here
+   * });
+   *
+   * // don't forget to unsubscribe when you're cleaning up
+   * configSubscription.unsubscribe();
+   * ```
+   *
+   * @returns An Observable that emits whenever {@link ConfigMessage} is received so it can be
+   * subscribed to indefinitely.
+   */
+  onConfigMessage() {
+    if (!this.isEmbedded())
+      throw new N(this.currentContext);
+    const e = "CONFIG";
+    return this.incomingMessages$.pipe(
+      M((t) => t.type === e && t.target === "client"),
+      T((t) => t),
+      P(this.logReceived(e)),
+      T((t) => ({
+        preferredCameraType: t.preferredCameraType,
+        preferredMicType: t.preferredMicType,
+        preferredOutputType: t.preferredOutputType,
+        preferredCameraDeviceLabel: t.preferredCameraDeviceLabel,
+        preferredMicDeviceLabel: t.preferredMicDeviceLabel,
+        preferredOutputDeviceLabel: t.preferredOutputDeviceLabel,
+        performanceProfile: t.performanceProfile,
+        cloudUsername: t.cloudUsername,
+        configuredOAuthProviders: t.configuredOAuthProviders,
+        locales: t.locales ? [...t.locales] : []
+      }))
+    );
+  }
+  sendScreenshareSourceMessage(e) {
+    if (!this.isEmbedded())
+      throw new N(this.currentContext);
+    const t = "SCREENSHARE SOURCE", n = this.createMessage(t);
+    n.sourceTypes = e, this.logCreated(t, n);
+    const i = this.incomingMessages$.pipe(
+      M((s) => s.type === t && s.replyTo === n.id),
+      T((s) => s),
+      P(this.logReceived(t)),
+      T((s) => s),
+      V(1)
+    );
+    return this.logService.debug(`Created ${t} Reply handler`), this.port2.postMessage(n), this.logSent(t, n), i;
+  }
+  layoutChange(e, t, n) {
+    if (!this.isEmbedded())
+      throw new N(this.currentContext);
+    const i = "LAYOUT CHANGE";
+    let s, a;
+    if (t && n ? (s = this.createMessage(i, !1, n), s.result = t) : (s = this.createMessage(i), a = this.incomingMessages$.pipe(
+      M((c) => c.type === i && c.replyTo === s.id),
+      T((c) => c),
+      P(this.logReceived(i)),
+      T((c) => c),
+      V(1)
+    ), this.logService.debug(`Created ${i} Reply handler`)), s.layout = e, this.logCreated(i, s), this.port2.postMessage(s), this.logSent(i, s), a)
+      return a;
+  }
+  /**
+   * Setup listener for {@link LayoutChangeMessage}, which can be sent by a host app if it needs to
+   * request a layout change on the client.
+   *
+   * @remarks
+   * In some scenarios, a `host` app can request a layout change from the client, so this listener
+   * should be setup to support that use case.
+   *
+   * Whenever such a request is received, the `client` app **SHOULD** respond with a
+   * {@link LayoutChangeMessageReply} to acknowledge if it is ready for a change.
+   *
+   * @example
+   * Here is an example of how a listener can be setup:
+   *
+   * ```ts
+   * const ipcHelper = new IpcHelper(['1.0'], console);
+   *
+   * const layoutChangeSubscription = ipcHelper.onLayoutChangeMessage().subscribe((msg) => {
+   *  // your logic for handling the request goes here
+   *
+   *  // once you're ready to acknowledge, let the `host` app know
+   *  ipcHelper.layoutChange(msg.layout, result, msg.id);
+   * });
+   *
+   * // don't forget to unsubscribe when you're cleaning up
+   * layoutChangeSubscription.unsubscribe();
+   * ```
+   *
+   * @returns An Observable that emits whenever {@link LayoutChangeMessage} is received so it can be
+   * subscribed to indefinitely.
+   */
+  onLayoutChangeMessage() {
+    if (!this.isEmbedded())
+      throw new N(this.currentContext);
+    const e = "LAYOUT CHANGE";
+    return this.incomingMessages$.pipe(
+      M((t) => t.type === e && t.target === "client" && t.replyTo === null),
+      T((t) => t),
+      P(this.logReceived(e)),
+      T((t) => t)
+    );
+  }
+  requestOAuthToken(e) {
+    if (!this.isEmbedded())
+      throw new N(this.currentContext);
+    Array.isArray(e) || (e = [e]);
+    const t = "OAUTH TOKEN", n = this.createMessage(t);
+    n.providerTypes = e, this.logCreated(t, n);
+    const i = this.incomingMessages$.pipe(
+      M((s) => s.type === t && s.replyTo === n.id),
+      T((s) => s),
+      P(this.logReceived(t)),
+      V(1)
+    );
+    return this.logService.debug(`Created ${t} Reply handler`), this.port2.postMessage(n), this.logSent(t, n), i;
+  }
+  openUrl(e, t) {
+    if (!this.isEmbedded())
+      throw new N(this.currentContext);
+    const n = "OPEN URL", i = this.createMessage(n, !1);
+    i.url = e, i.data = t, this.logCreated(n, i), this.port2.postMessage(i), this.logSent(n, i);
+  }
+  selectContacts(e, t, n) {
+    if (!this.isEmbedded())
+      throw new N(this.currentContext);
+    if (t === "group" && n === void 0)
+      throw new $e(
+        "currentContacts",
+        n,
+        "currentContacts is required for group streams"
+      );
+    if (t === "direct" && n !== void 0)
+      throw new $e(
+        "currentContacts",
+        n,
+        "currentContacts should not be passed for direct streams"
+      );
+    const i = "SELECT CONTACTS", s = this.createMessage(i, !0);
+    s.streamType = t, s.streamId = e, s.currentContacts = n, this.logCreated(i, s);
+    const a = this.incomingMessages$.pipe(
+      M((c) => c.type === i && c.replyTo === s.id),
+      P(this.logReceived(i)),
+      // validate if `streamId` is the same as we sent
+      T((c) => {
+        const o = c;
+        if (o.streamId !== e)
+          throw new xs(o.streamId, e);
+        return t === "direct" && o.contacts.length > 1 && (o.contacts = [o.contacts[0]]), o;
+      }),
+      V(1)
+    );
+    return this.logService.debug(`Created ${i} Reply handler`), this.port2.postMessage(s), this.logSent(i, s), a;
+  }
+  /**
+   * Request detailed contact information for the given Cloud usernames.
+   *
+   * @param contacts - Cloud usernames for which we need detailed contact information
+   *
+   * @returns Observable with a {@link MatchContactsMessageReply} instance containing the requested
+   * {@link ContactItem} information. Emits once.
+   */
+  matchContacts(e) {
+    if (!this.isEmbedded())
+      throw new N(this.currentContext);
+    if (!e.length)
+      throw new $e("contacts", e, "At least one contact is required");
+    const t = "MATCH CONTACTS", n = this.createMessage(t);
+    n.contacts = [...e], this.logCreated(t, n);
+    const i = this.incomingMessages$.pipe(
+      M((s) => s.type === t && s.replyTo === n.id),
+      P(this.logReceived(t)),
+      T((s) => s),
+      V(1)
+    );
+    return this.logService.debug(`Created ${t} Reply handler`), this.port2.postMessage(n), this.logSent(t, n), i;
+  }
+  /**
+   * Setup listener for {@link PushMessageMessage}, which can be sent by a Host app to forward an
+   * an Acrobits Messaging message received via push notification to the Client app.
+   *
+   * @remarks
+   * The format of the {@link PushMessagePayload} SHOULD be kept the same as the one received from
+   * the push notification. The Client app can then use the payload to handle the message as needed.
+   *
+   * @example
+   * Here is an example of how a listener can be setup:
+   *
+   * ```ts
+   * const ipcHelper = new IpcHelper(['1.0'], console);
+   *
+   * const pushMessageSubscription = ipcHelper.onPushMessageMessage().subscribe((msg) => {
+   *  // your logic for handling the incoming push message goes here
+   * });
+   *
+   * // don't forget to unsubscribe when you're cleaning up
+   * pushMessageSubscription.unsubscribe();
+   * ```
+   *
+   * @returns An observable that emits whenever {@link PushMessageMessage} is received so it can be
+   * subscribed to indefinitely.
+   */
+  onPushMessageMessage() {
+    if (!this.isEmbedded())
+      throw new N(this.currentContext);
+    const e = "PUSH MESSAGE";
+    return this.incomingMessages$.pipe(
+      M((t) => t.type === e && t.target === "client"),
+      T((t) => t),
+      P(this.logReceived(e))
+    );
+  }
+  /**
+   * Sends a {@link PushTokenMessage} to the Host app, to request the Push Token for the current
+   * device.
+   *
+   * @remarks
+   * The Host app should reply with a {@link PushTokenMessageReply} containing the Push Token.
+   *
+   * @returns Observable with a {@link PushTokenMessageReply} instance containing the Push Token.
+   */
+  requestPushToken() {
+    if (!this.isEmbedded())
+      throw new N(this.currentContext);
+    const e = "PUSH TOKEN", t = this.createMessage(e);
+    this.logCreated(e, t);
+    const n = this.incomingMessages$.pipe(
+      M((i) => i.type === e && i.replyTo === t.id),
+      P(this.logReceived(e)),
+      T((i) => i),
+      V(1)
+    );
+    return this.logService.debug(`Created ${e} Reply handler`), this.port2.postMessage(t), this.logSent(e, t), n;
+  }
+  /**
+   * Setup listener for {@link BadgeQueryMessage}, which can be sent by a `Host` app to request the
+   * current badge counter from the `Client` app.
+   *
+   * @returns An observable that emits whenever {@link BadgeQueryMessage} is received so it can be
+   * subscribed to indefinitely.
+   */
+  onBadgeQueryMessage() {
+    if (!this.isEmbedded())
+      throw new N(this.currentContext);
+    const e = "BADGE QUERY";
+    return this.incomingMessages$.pipe(
+      M((t) => t.type === e && t.target === "client"),
+      T((t) => t),
+      P(this.logReceived(e))
+    );
+  }
+  /**
+   * Sends a {@link BadgeUpdateMessage} from the `Client` to the `Host` with the current counter.
+   *
+   * @remarks
+   * This message can be sent independently or as a reply to a {@link BadgeQueryMessage} from the
+   * Host app. If sending as a reply, the `replyTo` parameter should contain the ID of the original
+   * {@link BadgeQueryMessage}.
+   *
+   * @param count - The counter's value
+   * @param replyTo - _Optional_. The message ID to which the reply should be sent
+   */
+  sendBadgeUpdateMessage(e, t) {
+    if (!this.isEmbedded())
+      throw new N(this.currentContext);
+    const n = "BADGE UPDATE", i = this.createMessage(n, !1, t);
+    i.count = e, this.logCreated(n, i), this.port2.postMessage(i), this.logSent(n, i);
+  }
+  /**
+   * Setup listener for {@link HostInForegroundMessage}, which can be sent by a `Host` app to
+   * notify the `Client` app that it is now in the foreground.
+   *
+   * @remarks
+   * This message has no data in it's payload apart from the basic message definition. It can be
+   * used by client apps to refresh and sync their state.
+   *
+   * @returns An observable that emits whenever {@link HostInForegroundMessage} is received so it
+   * can be subscribed to indefinitely.
+   */
+  onHostInForegroundMessage() {
+    if (!this.isEmbedded())
+      throw new N(this.currentContext);
+    const e = "HOST IN FOREGROUND";
+    return this.incomingMessages$.pipe(
+      M((t) => t.type === e && t.target === "client"),
+      T((t) => t),
+      P(this.logReceived(e))
+    );
+  }
+  /**
+   * Checks if the client app is either embedded in an iframe or in a native webview.
+   *
+   * @internal
+   *
+   * @returns `true` if the client app is embedded, `false` otherwise.
+   */
+  isEmbedded() {
+    if (this.embeddedResult !== null)
+      return this.embeddedResult;
+    let e = !1;
+    return this.logService.debug("Checking if running in iframe..."), e = !!this.frameElement, e || (e = this.self !== this.parent), e ? (this.logService.debug("In iframe"), this.inIframe = !0, this.embeddedResult = !0, !0) : (this.logService.debug("Not in iframe"), this.logService.debug("Checking if running in native app..."), !e && (e = !!window.Acrobits, e) ? (this.logService.debug("In native app"), this.embeddedResult = !0, e) : (this.logService.debug("Not running in native app"), this.embeddedResult = !1, this.embeddedResult));
+  }
+  logReceived(e, t) {
+    const n = (i) => this.logService.debug(`[IPC] Received ${e} message`, i);
+    return t && n(t), n;
+  }
+  logSent(e, t) {
+    this.logService.debug(`[IPC] Sent ${e} message`, t);
+  }
+  logCreated(e, t) {
+    this.logService.debug(`[IPC] Created ${e} message`, t);
+  }
+  async createIframeChannel() {
+    return new Promise((e) => {
+      const t = (n) => {
+        n.data === "message channel port" && (this.iframePort2 = n.ports[0], this.self.removeEventListener("message", t), e());
+      };
+      this.self.addEventListener("message", t), this.parent.postMessage("get channel", "*");
+    });
+  }
+  finishIpcSetup(e) {
+    this.logService.debug("Registering listener on port2..."), this.port2.addEventListener("message", this.handleIpcMessage.bind(this)), this.port2.start(), this.logService.debug("Started listening on port2"), this.port2.postMessage(e), this.logSent("HELLO", e);
+  }
+  handleIpcMessage(e) {
+    const { data: t } = e;
+    !t.id || t.target !== "client" || this.incomingMessages$.next(t);
+  }
+  createMessage(e, t = !0, n) {
+    return {
+      type: e,
+      id: this.generateId(),
+      target: "host",
+      expectReply: t,
+      replyTo: n ?? null
+    };
+  }
+  generateId(e = 8, t = !1) {
+    let n = "1234567890qwertyuiopasdfghjklzxcvbnmQWERTYUIOPASDFGHJKLZXCVBNM";
+    const i = [];
+    t && (n = n.substr(0, n.indexOf("Q")));
+    for (let s = 0; s < e; s++)
+      i.push(n[Math.floor(Math.random() * n.length)]);
+    return i.join("");
+  }
+}
+var tt = function(r, e) {
+  return tt = Object.setPrototypeOf || { __proto__: [] } instanceof Array && function(t, n) {
+    t.__proto__ = n;
+  } || function(t, n) {
+    for (var i in n)
+      Object.prototype.hasOwnProperty.call(n, i) && (t[i] = n[i]);
+  }, tt(r, e);
+};
+function ft(r, e) {
+  if (typeof e != "function" && e !== null)
+    throw new TypeError("Class extends value " + String(e) + " is not a constructor or null");
+  tt(r, e);
+  function t() {
+    this.constructor = r;
+  }
+  r.prototype = e === null ? Object.create(e) : (t.prototype = e.prototype, new t());
+}
+function Qt(r) {
+  var e = typeof Symbol == "function" && Symbol.iterator, t = e && r[e], n = 0;
+  if (t)
+    return t.call(r);
+  if (r && typeof r.length == "number")
+    return {
+      next: function() {
+        return r && n >= r.length && (r = void 0), { value: r && r[n++], done: !r };
+      }
+    };
+  throw new TypeError(e ? "Object is not iterable." : "Symbol.iterator is not defined.");
+}
+function Ce(r, e) {
+  var t = typeof Symbol == "function" && r[Symbol.iterator];
+  if (!t)
+    return r;
+  var n = t.call(r), i, s = [], a;
+  try {
+    for (; (e === void 0 || e-- > 0) && !(i = n.next()).done; )
+      s.push(i.value);
+  } catch (c) {
+    a = { error: c };
+  } finally {
+    try {
+      i && !i.done && (t = n.return) && t.call(n);
+    } finally {
+      if (a)
+        throw a.error;
+    }
+  }
+  return s;
+}
+function Ne(r, e, t) {
+  if (t || arguments.length === 2)
+    for (var n = 0, i = e.length, s; n < i; n++)
+      (s || !(n in e)) && (s || (s = Array.prototype.slice.call(e, 0, n)), s[n] = e[n]);
+  return r.concat(s || Array.prototype.slice.call(e));
+}
+function Y(r) {
+  return typeof r == "function";
+}
+function fr(r) {
+  var e = function(n) {
+    Error.call(n), n.stack = new Error().stack;
+  }, t = r(e);
+  return t.prototype = Object.create(Error.prototype), t.prototype.constructor = t, t;
+}
+var ze = fr(function(r) {
+  return function(t) {
+    r(this), this.message = t ? t.length + ` errors occurred during unsubscription:
+` + t.map(function(n, i) {
+      return i + 1 + ") " + n.toString();
+    }).join(`
+  `) : "", this.name = "UnsubscriptionError", this.errors = t;
+  };
+});
+function Wt(r, e) {
+  if (r) {
+    var t = r.indexOf(e);
+    0 <= t && r.splice(t, 1);
+  }
+}
+var dt = function() {
+  function r(e) {
+    this.initialTeardown = e, this.closed = !1, this._parentage = null, this._finalizers = null;
+  }
+  return r.prototype.unsubscribe = function() {
+    var e, t, n, i, s;
+    if (!this.closed) {
+      this.closed = !0;
+      var a = this._parentage;
+      if (a)
+        if (this._parentage = null, Array.isArray(a))
+          try {
+            for (var c = Qt(a), o = c.next(); !o.done; o = c.next()) {
+              var l = o.value;
+              l.remove(this);
+            }
+          } catch (R) {
+            e = { error: R };
+          } finally {
+            try {
+              o && !o.done && (t = c.return) && t.call(c);
+            } finally {
+              if (e)
+                throw e.error;
+            }
+          }
+        else
+          a.remove(this);
+      var u = this.initialTeardown;
+      if (Y(u))
+        try {
+          u();
+        } catch (R) {
+          s = R instanceof ze ? R.errors : [R];
+        }
+      var p = this._finalizers;
+      if (p) {
+        this._finalizers = null;
+        try {
+          for (var w = Qt(p), f = w.next(); !f.done; f = w.next()) {
+            var g = f.value;
+            try {
+              Jt(g);
+            } catch (R) {
+              s = s ?? [], R instanceof ze ? s = Ne(Ne([], Ce(s)), Ce(R.errors)) : s.push(R);
+            }
+          }
+        } catch (R) {
+          n = { error: R };
+        } finally {
+          try {
+            f && !f.done && (i = w.return) && i.call(w);
+          } finally {
+            if (n)
+              throw n.error;
+          }
+        }
+      }
+      if (s)
+        throw new ze(s);
+    }
+  }, r.prototype.add = function(e) {
+    var t;
+    if (e && e !== this)
+      if (this.closed)
+        Jt(e);
+      else {
+        if (e instanceof r) {
+          if (e.closed || e._hasParent(this))
+            return;
+          e._addParent(this);
+        }
+        (this._finalizers = (t = this._finalizers) !== null && t !== void 0 ? t : []).push(e);
+      }
+  }, r.prototype._hasParent = function(e) {
+    var t = this._parentage;
+    return t === e || Array.isArray(t) && t.includes(e);
+  }, r.prototype._addParent = function(e) {
+    var t = this._parentage;
+    this._parentage = Array.isArray(t) ? (t.push(e), t) : t ? [t, e] : e;
+  }, r.prototype._removeParent = function(e) {
+    var t = this._parentage;
+    t === e ? this._parentage = null : Array.isArray(t) && Wt(t, e);
+  }, r.prototype.remove = function(e) {
+    var t = this._finalizers;
+    t && Wt(t, e), e instanceof r && e._removeParent(this);
+  }, r.EMPTY = function() {
+    var e = new r();
+    return e.closed = !0, e;
+  }(), r;
+}();
+dt.EMPTY;
+function ro(r) {
+  return r instanceof dt || r && "closed" in r && Y(r.remove) && Y(r.add) && Y(r.unsubscribe);
+}
+function Jt(r) {
+  Y(r) ? r() : r.unsubscribe();
+}
+var no = {
+  onUnhandledError: null,
+  onStoppedNotification: null,
+  Promise: void 0,
+  useDeprecatedSynchronousErrorHandling: !1,
+  useDeprecatedNextContext: !1
+}, rt = {
+  setTimeout: function(r, e) {
+    for (var t = [], n = 2; n < arguments.length; n++)
+      t[n - 2] = arguments[n];
+    var i = rt.delegate;
+    return i != null && i.setTimeout ? i.setTimeout.apply(i, Ne([r, e], Ce(t))) : setTimeout.apply(void 0, Ne([r, e], Ce(t)));
+  },
+  clearTimeout: function(r) {
+    var e = rt.delegate;
+    return ((e == null ? void 0 : e.clearTimeout) || clearTimeout)(r);
+  },
+  delegate: void 0
+};
+function io(r) {
+  rt.setTimeout(function() {
+    throw r;
+  });
+}
+function Kt() {
+}
+var dr = function(r) {
+  ft(e, r);
+  function e(t) {
+    var n = r.call(this) || this;
+    return n.isStopped = !1, t ? (n.destination = t, ro(t) && t.add(n)) : n.destination = lo, n;
+  }
+  return e.create = function(t, n, i) {
+    return new vr(t, n, i);
+  }, e.prototype.next = function(t) {
+    this.isStopped || this._next(t);
+  }, e.prototype.error = function(t) {
+    this.isStopped || (this.isStopped = !0, this._error(t));
+  }, e.prototype.complete = function() {
+    this.isStopped || (this.isStopped = !0, this._complete());
+  }, e.prototype.unsubscribe = function() {
+    this.closed || (this.isStopped = !0, r.prototype.unsubscribe.call(this), this.destination = null);
+  }, e.prototype._next = function(t) {
+    this.destination.next(t);
+  }, e.prototype._error = function(t) {
+    try {
+      this.destination.error(t);
+    } finally {
+      this.unsubscribe();
+    }
+  }, e.prototype._complete = function() {
+    try {
+      this.destination.complete();
+    } finally {
+      this.unsubscribe();
+    }
+  }, e;
+}(dt), so = Function.prototype.bind;
+function Qe(r, e) {
+  return so.call(r, e);
+}
+var oo = function() {
+  function r(e) {
+    this.partialObserver = e;
+  }
+  return r.prototype.next = function(e) {
+    var t = this.partialObserver;
+    if (t.next)
+      try {
+        t.next(e);
+      } catch (n) {
+        Re(n);
+      }
+  }, r.prototype.error = function(e) {
+    var t = this.partialObserver;
+    if (t.error)
+      try {
+        t.error(e);
+      } catch (n) {
+        Re(n);
+      }
+    else
+      Re(e);
+  }, r.prototype.complete = function() {
+    var e = this.partialObserver;
+    if (e.complete)
+      try {
+        e.complete();
+      } catch (t) {
+        Re(t);
+      }
+  }, r;
+}(), vr = function(r) {
+  ft(e, r);
+  function e(t, n, i) {
+    var s = r.call(this) || this, a;
+    if (Y(t) || !t)
+      a = {
+        next: t ?? void 0,
+        error: n ?? void 0,
+        complete: i ?? void 0
+      };
+    else {
+      var c;
+      s && no.useDeprecatedNextContext ? (c = Object.create(t), c.unsubscribe = function() {
+        return s.unsubscribe();
+      }, a = {
+        next: t.next && Qe(t.next, c),
+        error: t.error && Qe(t.error, c),
+        complete: t.complete && Qe(t.complete, c)
+      }) : a = t;
+    }
+    return s.destination = new oo(a), s;
+  }
+  return e;
+}(dr);
+function Re(r) {
+  io(r);
+}
+function ao(r) {
+  throw r;
+}
+var lo = {
+  closed: !0,
+  next: Kt,
+  error: ao,
+  complete: Kt
+};
+function co(r) {
+  return r;
+}
+function uo(r) {
+  return Y(r == null ? void 0 : r.lift);
+}
+function gr(r) {
+  return function(e) {
+    if (uo(e))
+      return e.lift(function(t) {
+        try {
+          return r(t, this);
+        } catch (n) {
+          this.error(n);
+        }
+      });
+    throw new TypeError("Unable to lift unknown Observable type");
+  };
+}
+function mr(r, e, t, n, i) {
+  return new ho(r, e, t, n, i);
+}
+var ho = function(r) {
+  ft(e, r);
+  function e(t, n, i, s, a, c) {
+    var o = r.call(this, t) || this;
+    return o.onFinalize = a, o.shouldUnsubscribe = c, o._next = n ? function(l) {
+      try {
+        n(l);
+      } catch (u) {
+        t.error(u);
+      }
+    } : r.prototype._next, o._error = s ? function(l) {
+      try {
+        s(l);
+      } catch (u) {
+        t.error(u);
+      } finally {
+        this.unsubscribe();
+      }
+    } : r.prototype._error, o._complete = i ? function() {
+      try {
+        i();
+      } catch (l) {
+        t.error(l);
+      } finally {
+        this.unsubscribe();
+      }
+    } : r.prototype._complete, o;
+  }
+  return e.prototype.unsubscribe = function() {
+    var t;
+    if (!this.shouldUnsubscribe || this.shouldUnsubscribe()) {
+      var n = this.closed;
+      r.prototype.unsubscribe.call(this), !n && ((t = this.onFinalize) === null || t === void 0 || t.call(this));
+    }
+  }, e;
+}(dr), po = fr(function(r) {
+  return function() {
+    r(this), this.name = "EmptyError", this.message = "no elements in sequence";
+  };
+});
+function ue(r, e) {
+  var t = typeof e == "object";
+  return new Promise(function(n, i) {
+    var s = new vr({
+      next: function(a) {
+        n(a), s.unsubscribe();
+      },
+      error: i,
+      complete: function() {
+        t ? n(e.defaultValue) : i(new po());
+      }
+    });
+    r.subscribe(s);
+  });
+}
+function Ie(r, e) {
+  return gr(function(t, n) {
+    var i = 0;
+    t.subscribe(mr(n, function(s) {
+      n.next(r.call(e, s, i++));
+    }));
+  });
+}
+function fo(r, e, t) {
+  var n = Y(r) || e || t ? { next: r, error: e, complete: t } : r;
+  return n ? gr(function(i, s) {
+    var a;
+    (a = n.subscribe) === null || a === void 0 || a.call(n);
+    var c = !0;
+    i.subscribe(mr(s, function(o) {
+      var l;
+      (l = n.next) === null || l === void 0 || l.call(n, o), s.next(o);
+    }, function() {
+      var o;
+      c = !1, (o = n.complete) === null || o === void 0 || o.call(n), s.complete();
+    }, function(o) {
+      var l;
+      c = !1, (l = n.error) === null || l === void 0 || l.call(n, o), s.error(o);
+    }, function() {
+      var o, l;
+      c && ((o = n.unsubscribe) === null || o === void 0 || o.call(n)), (l = n.finalize) === null || l === void 0 || l.call(n);
+    }));
+  }) : co;
+}
+function vo() {
+  try {
+    return import("@acrobits/log-helper").then((r) => r.LogHelper.getLogger("IpcSDK"));
+  } catch {
+    return Promise.resolve(console);
+  }
+}
+const go = ["1.0"];
+var de, nt;
+class yo {
+  /**
+   * A class that manages the IPC communication between the `Client` and the `Host`.
+   *
+   * @remarks
+   * Ideally, there should only be one instance of the IPCManager in the app. It is recommended to
+   * create the instance as a singleton and use it throughout the app.
+   *
+   * @param logger - An optional logger instance to use for logging. If not provided, a default logger
+   * will be used.
+   */
+  constructor(e) {
+    vt(this, de);
+    /**
+     * The type of the `Host` app the `Client` is embedded in.
+     */
+    re(this, "host");
+    /**
+     * The cloud ID of the `Host` app the `Client` is embedded in.
+     */
+    re(this, "cloudId");
+    re(this, "logger");
+    re(this, "helper");
+    re(this, "listeners");
+    e ? this.logger = e : (this.logger = console, vo().then((t) => {
+      this.logger = t;
+    })), this.helper = new to(go, this.logger), this.listeners = /* @__PURE__ */ new Map(), this.listeners.set(H.BadgeQuery, /* @__PURE__ */ new Set()), this.listeners.set(H.HostInForeground, /* @__PURE__ */ new Set());
+  }
+  /**
+   * Returns whether the app is running inside a native WebView (`host` context) or as a
+   * `standalone` app.
+   */
+  get context() {
+    return je(this, de, nt).call(this, this.helper.currentContext);
+  }
+  /**
+   * Determines if the app is connected to a `Host` app.
+   */
+  get isConnected() {
+    return !!(this.helper.currentContext === "user" && this.host && this.cloudId);
+  }
+  /**
+   * The negotiated IPC protocol version.
+   */
+  get negotiatedVersion() {
+    return this.helper.negotiatedProtocolVersion;
+  }
+  /**
+   * Determines if the app is embedded in a Host app or native CSP clients.
+   *
+   * @returns A promise with {@link IPCContext} the app is running under.
+   */
+  async determineContext() {
+    const e = await ue(this.helper.determineContext(), {
+      defaultValue: "guest"
+    });
+    return je(this, de, nt).call(this, e);
+  }
+  /**
+   * Initiates the IPC handshake with the `Host` app.
+   */
+  initiateConnection() {
+    return ue(
+      this.helper.openBridge().pipe(
+        fo((e) => {
+          this.helper.onBadgeQueryMessage().subscribe((t) => {
+            var n;
+            this.logger.debug("Received Badge Query: ", t);
+            for (const i of ((n = this.listeners.get(H.BadgeQuery)) == null ? void 0 : n.values()) ?? [])
+              i();
+          }), this.helper.onHostInForegroundMessage().subscribe((t) => {
+            var n;
+            this.logger.debug("Received Host In Foreground: ", t);
+            for (const i of ((n = this.listeners.get(H.HostInForeground)) == null ? void 0 : n.values()) ?? [])
+              i();
+          }), this.cloudId = e.cloudId, this.host = e.host;
+        }),
+        Ie(() => {
+        })
+      )
+    );
+  }
+  selectContacts(e, t, n) {
+    this.logger.debug("Selecting Contacts: ", ...arguments);
+    let i;
+    if (t === "multi") {
+      if (!n)
+        throw new $e(
+          "currentContacts",
+          n,
+          "currentContacts is required for group streams"
+        );
+      i = this.helper.selectContacts(e.toString(), "group", n);
+    } else
+      i = this.helper.selectContacts(e.toString(), "direct");
+    return ue(i.pipe(Ie((s) => s.contacts)));
+  }
+  /**
+   * Matches batch of {@link ContactItem} objects against the Host's contact list to fetch detailed
+   * contact information.
+   *
+   * @param contacts - List of {@link ContactItem} collection to match against the Host's contact
+   * list.
+   * @returns A collection of {@link DetailedContactItem} objects which were matched against the
+   * Host's contact list.
+   */
+  matchContacts(e) {
+    return this.logger.debug("Match Contacts: ", e), ue(this.helper.matchContacts(e).pipe(Ie((t) => t.contacts)));
+  }
+  /**
+   * Requests the `Host` app to provide the Push Token for the current device.
+   *
+   * @returns A promise with the Push Token as `string`.
+   */
+  requestPushToken() {
+    return this.logger.debug("Requesting Push Token"), ue(this.helper.requestPushToken().pipe(Ie((e) => e.pushToken)));
+  }
+  /**
+   * Sends the current badge count to the `Host` app.
+   *
+   * @param count - The count to update the badge to.
+   */
+  badgeUpdate(e) {
+    this.logger.debug("Sending Badge Update: ", e), this.helper.sendBadgeUpdateMessage(e);
+  }
+  /**
+   * Registers a callback to be invoked when a {@link IPCEvents.BadgeQuery} is received.
+   *
+   * @param callback - A callback function to be invoked when a {@link IPCEvents.BadgeQuery} event
+   * is received.
+   * @returns An unsubscribe callback to remove the listener.
+   */
+  onBadgeQueryRequest(e) {
+    var t;
+    return this.logger.debug("Registering for Badge Query"), (t = this.listeners.get(H.BadgeQuery)) == null || t.add(e), () => {
+      var n;
+      return (n = this.listeners.get(H.BadgeQuery)) == null ? void 0 : n.delete(e);
+    };
+  }
+  /**
+   * Registers a callback to be invoked when a {@link IPCEvents.HostInForeground} event is received.
+   *
+   * @param callback - A callback function to be invoked when a {@link IPCEvents.HostInForeground}
+   * event is received.
+   * @returns An unsubscribe callback to remove the listener.
+   */
+  onHostInForeground(e) {
+    var t;
+    return this.logger.debug("Registering for Host In Foreground"), (t = this.listeners.get(H.HostInForeground)) == null || t.add(e), () => {
+      var n;
+      return (n = this.listeners.get(H.HostInForeground)) == null ? void 0 : n.delete(e);
+    };
+  }
+}
+de = new WeakSet(), nt = function(e) {
+  if (e === "user")
+    return "host";
+  if (e === "guest")
+    return "standalone";
+};
+export {
+  H as IPCEvents,
+  yo as IPCManager
+};