@univerjs/drawing 0.17.0 → 0.18.0

package/lib/index.js

@@ -1,2061 +1 @@
-var xt = Object.defineProperty;
-var Bt = (a, e, t) => e in a ? xt(a, e, { enumerable: !0, configurable: !0, writable: !0, value: t }) : a[e] = t;
-var G = (a, e, t) => Bt(a, typeof e != "symbol" ? e + "" : e, t);
-import { createIdentifier as Wt, CommandType as Lt, sortRules as Gt, sortRulesByDesc as qt, ImageSourceType as lt, ImageUploadStatusType as tt, generateRandomId as $t, Disposable as Kt, toDisposable as Ft, Inject as Vt, Injector as Ht, IConfigService as zt, ICommandService as Xt, Plugin as Jt, merge as Yt, mergeOverrideWithDependencies as Zt, IImageIoService as Qt, IURLImageService as en } from "@univerjs/core";
-import { IImageIoService as Sn, ImageSourceType as Un, ImageUploadStatusType as An } from "@univerjs/core";
-import { Subject as be } from "rxjs";
-const In = 500, Cn = 500, En = 10, tn = 5 * 1024 * 1024, nn = ["image/png", "image/jpeg", "image/jpg", "image/gif", "image/bmp"], Ut = Wt("univer.drawing-manager.service"), rn = {
-  id: "drawing.operation.set-drawing-selected",
-  type: Lt.OPERATION,
-  handler: (a, e) => {
-    const t = a.get(Ut);
-    return e == null ? !1 : (t.focusDrawing(e), !0);
-  }
-}, sn = "@univerjs/drawing", on = "0.17.0", _t = {
-  name: sn,
-  version: on
-}, an = "drawing.config", vt = {};
-var Ve = {}, Ze = {}, nt = {}, Ot;
-function ln() {
-  if (Ot) return nt;
-  Ot = 1, Object.defineProperty(nt, "__esModule", { value: !0 });
-  function a(n, r) {
-    if (Array.isArray(r))
-      return !1;
-    for (let u in n)
-      if (!t(n[u], r[u]))
-        return !1;
-    for (let u in r)
-      if (n[u] === void 0)
-        return !1;
-    return !0;
-  }
-  function e(n, r) {
-    if (!Array.isArray(r) || n.length !== r.length)
-      return !1;
-    for (let u = 0; u < n.length; u++)
-      if (!t(n[u], r[u]))
-        return !1;
-    return !0;
-  }
-  function t(n, r) {
-    return n === r ? !0 : n === null || r === null || typeof n != "object" || typeof r != "object" ? !1 : Array.isArray(n) ? e(n, r) : a(n, r);
-  }
-  return nt.default = t, nt;
-}
-var rt = {}, wt;
-function un() {
-  if (wt) return rt;
-  wt = 1, Object.defineProperty(rt, "__esModule", { value: !0 });
-  function a(e) {
-    if (e === null)
-      return null;
-    if (Array.isArray(e))
-      return e.map(a);
-    if (typeof e == "object") {
-      const t = {};
-      for (let n in e)
-        t[n] = a(e[n]);
-      return t;
-    } else
-      return e;
-  }
-  return rt.default = a, rt;
-}
-var ut = {}, bt;
-function At() {
-  return bt || (bt = 1, (function(a) {
-    Object.defineProperty(a, "__esModule", { value: !0 }), a.eachChildOf = a.advancer = a.readCursor = a.writeCursor = a.WriteCursor = a.ReadCursor = a.isValidPathItem = void 0;
-    function e(m, s) {
-      if (!m)
-        throw new Error(s);
-    }
-    const t = (m) => m != null && typeof m == "object" && !Array.isArray(m), n = (m, s) => (
-      // All the numbers, then all the letters. Just as the gods of ascii intended.
-      typeof m == typeof s ? m > s : typeof m == "string" && typeof s == "number"
-    );
-    function r(m, s) {
-      for (let c in m) {
-        const h = c;
-        s.write(h, m[h]);
-      }
-    }
-    a.isValidPathItem = (m) => typeof m == "number" || typeof m == "string" && m !== "__proto__";
-    class u {
-      constructor(s = null) {
-        this.parents = [], this.indexes = [], this.lcIdx = -1, this.idx = -1, this.container = s;
-      }
-      ascend() {
-        e(this.parents.length === this.indexes.length / 2), this.idx === 0 ? this.parents.length ? (this.lcIdx = this.indexes.pop(), this.container = this.parents.pop(), this.idx = this.indexes.pop()) : (this.lcIdx = 0, this.idx = -1) : (e(this.idx > 0), this.idx--, t(this.container[this.idx]) && this.idx--);
-      }
-      getPath() {
-        const s = [];
-        let c = this.container, h = this.parents.length - 1, M = this.idx;
-        for (; M >= 0; )
-          s.unshift(c[M]), M === 0 ? (M = this.indexes[h * 2], c = this.parents[h--]) : M -= t(c[M - 1]) ? 2 : 1;
-        return s;
-      }
-    }
-    class o extends u {
-      get() {
-        return this.container ? this.container.slice(this.idx + 1) : null;
-      }
-      // Its only valid to call this after descending into a child.
-      getKey() {
-        return e(this.container != null, "Invalid call to getKey before cursor descended"), this.container[this.idx];
-      }
-      getComponent() {
-        let s;
-        return this.container && this.container.length > this.idx + 1 && t(s = this.container[this.idx + 1]) ? s : null;
-      }
-      descendFirst() {
-        let s = this.idx + 1;
-        if (!this.container || s >= this.container.length || t(this.container[s]) && s + 1 >= this.container.length)
-          return !1;
-        t(this.container[s]) && s++;
-        const c = this.container[s];
-        return Array.isArray(c) ? (this.indexes.push(this.idx), this.parents.push(this.container), this.indexes.push(s), this.idx = 0, this.container = c) : this.idx = s, !0;
-      }
-      nextSibling() {
-        if (e(this.parents.length === this.indexes.length / 2), this.idx > 0 || this.parents.length === 0)
-          return !1;
-        const s = this.indexes[this.indexes.length - 1] + 1, c = this.parents[this.parents.length - 1];
-        return s >= c.length ? !1 : (e(!isNaN(s)), this.indexes[this.indexes.length - 1] = s, this.container = c[s], !0);
-      }
-      _init(s, c, h, M) {
-        this.container = s, this.idx = c, this.parents = h.slice(), this.indexes = M.slice();
-      }
-      clone() {
-        const s = new o();
-        return s._init(this.container, this.idx, this.parents, this.indexes), s;
-      }
-      *[Symbol.iterator]() {
-        if (this.descendFirst()) {
-          do
-            yield this.getKey();
-          while (this.nextSibling());
-          this.ascend();
-        }
-      }
-      // TODO(cleanup): Consider moving these functions out of cursor, since
-      // they're really just helper methods.
-      // It'd be really nice to do this using generators.
-      traverse(s, c) {
-        const h = this.getComponent();
-        h && c(h, s);
-        for (const M of this)
-          s && s.descend(M), this.traverse(s, c), s && s.ascend();
-      }
-      eachPick(s, c) {
-        this.traverse(s, (h, M) => {
-          h.p != null && c(h.p, M);
-        });
-      }
-      eachDrop(s, c) {
-        this.traverse(s, (h, M) => {
-          h.d != null && c(h.d, M);
-        });
-      }
-    }
-    a.ReadCursor = o;
-    class l extends u {
-      constructor(s = null) {
-        super(s), this.pendingDescent = [], this._op = s;
-      }
-      flushDescent() {
-        e(this.parents.length === this.indexes.length / 2), this.container === null && (this._op = this.container = []);
-        for (let s = 0; s < this.pendingDescent.length; s++) {
-          const c = this.pendingDescent[s];
-          let h = this.idx + 1;
-          if (h < this.container.length && t(this.container[h]) && h++, e(h === this.container.length || !t(this.container[h])), h === this.container.length)
-            this.container.push(c), this.idx = h;
-          else if (this.container[h] === c)
-            this.idx = h;
-          else {
-            if (!Array.isArray(this.container[h])) {
-              const M = this.container.splice(h, this.container.length - h);
-              this.container.push(M), this.lcIdx > -1 && (this.lcIdx = h);
-            }
-            for (this.indexes.push(this.idx), this.parents.push(this.container), this.lcIdx !== -1 && (e(n(c, this.container[this.lcIdx][0])), h = this.lcIdx + 1, this.lcIdx = -1); h < this.container.length && n(c, this.container[h][0]); )
-              h++;
-            if (this.indexes.push(h), this.idx = 0, h < this.container.length && this.container[h][0] === c)
-              this.container = this.container[h];
-            else {
-              const M = [c];
-              this.container.splice(h, 0, M), this.container = M;
-            }
-          }
-        }
-        this.pendingDescent.length = 0;
-      }
-      reset() {
-        this.lcIdx = -1;
-      }
-      // Creates and returns a component, creating one if need be. You should
-      // probably write to it immediately - ops are not valid with empty
-      // components.
-      getComponent() {
-        this.flushDescent();
-        const s = this.idx + 1;
-        if (s < this.container.length && t(this.container[s]))
-          return this.container[s];
-        {
-          const c = {};
-          return this.container.splice(s, 0, c), c;
-        }
-      }
-      write(s, c) {
-        const h = this.getComponent();
-        e(h[s] == null || h[s] === c, "Internal consistency error: Overwritten component. File a bug"), h[s] = c;
-      }
-      get() {
-        return this._op;
-      }
-      descend(s) {
-        if (!a.isValidPathItem(s))
-          throw Error("Invalid JSON key");
-        this.pendingDescent.push(s);
-      }
-      descendPath(s) {
-        return this.pendingDescent.push(...s), this;
-      }
-      ascend() {
-        this.pendingDescent.length ? this.pendingDescent.pop() : super.ascend();
-      }
-      mergeTree(s, c = r) {
-        if (s === null)
-          return;
-        if (e(Array.isArray(s)), s === this._op)
-          throw Error("Cannot merge into my own tree");
-        const h = this.lcIdx, M = this.parents.length;
-        let Y = 0;
-        for (let pe = 0; pe < s.length; pe++) {
-          const Z = s[pe];
-          typeof Z == "string" || typeof Z == "number" ? (Y++, this.descend(Z)) : Array.isArray(Z) ? this.mergeTree(Z, c) : typeof Z == "object" && c(Z, this);
-        }
-        for (; Y--; )
-          this.ascend();
-        this.lcIdx = this.parents.length === M ? h : -1;
-      }
-      at(s, c) {
-        this.descendPath(s), c(this);
-        for (let h = 0; h < s.length; h++)
-          this.ascend();
-        return this;
-      }
-      // This is used by helpers, so the strict ordering guarantees are
-      // relaxed.
-      writeAtPath(s, c, h) {
-        return this.at(s, () => this.write(c, h)), this.reset(), this;
-      }
-      writeMove(s, c, h = 0) {
-        return this.writeAtPath(s, "p", h).writeAtPath(c, "d", h);
-      }
-      getPath() {
-        const s = super.getPath();
-        return s.push(...this.pendingDescent), s;
-      }
-    }
-    a.WriteCursor = l, a.writeCursor = () => new l(), a.readCursor = (m) => new o(m);
-    function E(m, s, c) {
-      let h, M;
-      M = h = m ? m.descendFirst() : !1;
-      function Y(pe) {
-        let Z;
-        for (; M; ) {
-          const Ie = Z = m.getKey();
-          if (pe != null) {
-            let qe = !1;
-            if (s && typeof Ie == "number" && (Z = s(Ie, m.getComponent()), Z < 0 && (Z = ~Z, qe = !0)), n(Z, pe))
-              return null;
-            if (Z === pe && !qe)
-              return m;
-          }
-          c && typeof Z == "number" && c(Z, m.getComponent()), M = m.nextSibling();
-        }
-        return null;
-      }
-      return Y.end = () => {
-        h && m.ascend();
-      }, Y;
-    }
-    a.advancer = E;
-    function B(m, s, c) {
-      let h, M, Y, pe;
-      for (h = M = m && m.descendFirst(), Y = pe = s && s.descendFirst(); h || Y; ) {
-        let Z = h ? m.getKey() : null, Ie = Y ? s.getKey() : null;
-        Z !== null && Ie !== null && (n(Ie, Z) ? Ie = null : Z !== Ie && (Z = null)), c(Z == null ? Ie : Z, Z != null ? m : null, Ie != null ? s : null), Z != null && h && (h = m.nextSibling()), Ie != null && Y && (Y = s.nextSibling());
-      }
-      M && m.ascend(), pe && s.ascend();
-    }
-    a.eachChildOf = B;
-  })(ut)), ut;
-}
-var ct = {}, It;
-function Mt() {
-  return It || (It = 1, (function(a) {
-    Object.defineProperty(a, "__esModule", { value: !0 }), a.ConflictType = void 0, (function(e) {
-      e[e.RM_UNEXPECTED_CONTENT = 1] = "RM_UNEXPECTED_CONTENT", e[e.DROP_COLLISION = 2] = "DROP_COLLISION", e[e.BLACKHOLE = 3] = "BLACKHOLE";
-    })(a.ConflictType || (a.ConflictType = {}));
-  })(ct)), ct;
-}
-var Me = {}, He = {}, Ct;
-function pt() {
-  return Ct || (Ct = 1, Object.defineProperty(He, "__esModule", { value: !0 }), He.uniToStrPos = He.strPosToUni = void 0, He.strPosToUni = (a, e = a.length) => {
-    let t = 0, n = 0;
-    for (; n < e; n++) {
-      const r = a.charCodeAt(n);
-      r >= 55296 && r <= 57343 && (t++, n++);
-    }
-    if (n !== e)
-      throw Error("Invalid offset - splits unicode bytes");
-    return n - t;
-  }, He.uniToStrPos = (a, e) => {
-    let t = 0;
-    for (; e > 0; e--) {
-      const n = a.charCodeAt(t);
-      t += n >= 55296 && n <= 57343 ? 2 : 1;
-    }
-    return t;
-  }), He;
-}
-var dt = {}, Et;
-function ht() {
-  return Et || (Et = 1, (function(a) {
-    Object.defineProperty(a, "__esModule", { value: !0 }), a.uniSlice = a.dlen = a.eachOp = void 0;
-    const e = pt(), t = (f) => {
-      if (!Array.isArray(f))
-        throw Error("Op must be an array of components");
-      let y = null;
-      for (let b = 0; b < f.length; b++) {
-        const $ = f[b];
-        switch (typeof $) {
-          case "object":
-            if (typeof $.d != "number" && typeof $.d != "string")
-              throw Error("Delete must be number or string");
-            if (a.dlen($.d) <= 0)
-              throw Error("Deletes must not be empty");
-            break;
-          case "string":
-            if (!($.length > 0))
-              throw Error("Inserts cannot be empty");
-            break;
-          case "number":
-            if (!($ > 0))
-              throw Error("Skip components must be >0");
-            if (typeof y == "number")
-              throw Error("Adjacent skip components should be combined");
-            break;
-        }
-        y = $;
-      }
-      if (typeof y == "number")
-        throw Error("Op has a trailing skip");
-    };
-    function n(f, y) {
-      let b = 0, $ = 0;
-      for (let z = 0; z < f.length; z++) {
-        const K = f[z];
-        switch (y(K, b, $), typeof K) {
-          case "object":
-            b += a.dlen(K.d);
-            break;
-          case "string":
-            $ += e.strPosToUni(K);
-            break;
-          case "number":
-            b += K, $ += K;
-            break;
-        }
-      }
-    }
-    a.eachOp = n;
-    function r(f, y) {
-      const b = [], $ = l(b);
-      return n(f, (z, K, Ee) => {
-        $(y(z, K, Ee));
-      }), s(b);
-    }
-    const u = (f) => f, o = (f) => r(f, u);
-    a.dlen = (f) => typeof f == "number" ? f : e.strPosToUni(f);
-    const l = (f) => (y) => {
-      if (!(!y || y.d === 0 || y.d === "")) if (f.length === 0)
-        f.push(y);
-      else if (typeof y == typeof f[f.length - 1])
-        if (typeof y == "object") {
-          const b = f[f.length - 1];
-          b.d = typeof b.d == "string" && typeof y.d == "string" ? b.d + y.d : a.dlen(b.d) + a.dlen(y.d);
-        } else
-          f[f.length - 1] += y;
-      else
-        f.push(y);
-    }, E = (f) => typeof f == "number" ? f : typeof f == "string" ? e.strPosToUni(f) : typeof f.d == "number" ? f.d : e.strPosToUni(f.d);
-    a.uniSlice = (f, y, b) => {
-      const $ = e.uniToStrPos(f, y), z = b == null ? 1 / 0 : e.uniToStrPos(f, b);
-      return f.slice($, z);
-    };
-    const B = (f, y, b) => typeof f == "number" ? b == null ? f - y : Math.min(f, b) - y : a.uniSlice(f, y, b), m = (f) => {
-      let y = 0, b = 0;
-      return { take: (K, Ee) => {
-        if (y === f.length)
-          return K === -1 ? null : K;
-        const ce = f[y];
-        let ne;
-        if (typeof ce == "number")
-          return K === -1 || ce - b <= K ? (ne = ce - b, ++y, b = 0, ne) : (b += K, K);
-        if (typeof ce == "string") {
-          if (K === -1 || Ee === "i" || e.strPosToUni(ce.slice(b)) <= K)
-            return ne = ce.slice(b), ++y, b = 0, ne;
-          {
-            const le = b + e.uniToStrPos(ce.slice(b), K);
-            return ne = ce.slice(b, le), b = le, ne;
-          }
-        } else {
-          if (K === -1 || Ee === "d" || a.dlen(ce.d) - b <= K)
-            return ne = { d: B(ce.d, b) }, ++y, b = 0, ne;
-          {
-            let le = B(ce.d, b, b + K);
-            return b += K, { d: le };
-          }
-        }
-      }, peek: () => f[y] };
-    }, s = (f) => (f.length > 0 && typeof f[f.length - 1] == "number" && f.pop(), f);
-    function c(f, y, b) {
-      if (b !== "left" && b !== "right")
-        throw Error("side (" + b + ") must be 'left' or 'right'");
-      t(f), t(y);
-      const $ = [], z = l($), { take: K, peek: Ee } = m(f);
-      for (let ne = 0; ne < y.length; ne++) {
-        const le = y[ne];
-        let ge, De;
-        switch (typeof le) {
-          case "number":
-            for (ge = le; ge > 0; )
-              De = K(ge, "i"), z(De), typeof De != "string" && (ge -= E(De));
-            break;
-          case "string":
-            b === "left" && typeof Ee() == "string" && z(K(-1)), z(e.strPosToUni(le));
-            break;
-          case "object":
-            for (ge = a.dlen(le.d); ge > 0; )
-              switch (De = K(ge, "i"), typeof De) {
-                case "number":
-                  ge -= De;
-                  break;
-                case "string":
-                  z(De);
-                  break;
-                case "object":
-                  ge -= a.dlen(De.d);
-              }
-            break;
-        }
-      }
-      let ce;
-      for (; ce = K(-1); )
-        z(ce);
-      return s($);
-    }
-    function h(f, y) {
-      t(f), t(y);
-      const b = [], $ = l(b), { take: z } = m(f);
-      for (let Ee = 0; Ee < y.length; Ee++) {
-        const ce = y[Ee];
-        let ne, le;
-        switch (typeof ce) {
-          case "number":
-            for (ne = ce; ne > 0; )
-              le = z(ne, "d"), $(le), typeof le != "object" && (ne -= E(le));
-            break;
-          case "string":
-            $(ce);
-            break;
-          case "object":
-            ne = a.dlen(ce.d);
-            let ge = 0;
-            for (; ge < ne; )
-              switch (le = z(ne - ge, "d"), typeof le) {
-                case "number":
-                  $({ d: B(ce.d, ge, ge + le) }), ge += le;
-                  break;
-                case "string":
-                  ge += e.strPosToUni(le);
-                  break;
-                case "object":
-                  $(le);
-              }
-            break;
-        }
-      }
-      let K;
-      for (; K = z(-1); )
-        $(K);
-      return s(b);
-    }
-    const M = (f, y) => {
-      let b = 0;
-      for (let $ = 0; $ < y.length && f > b; $++) {
-        const z = y[$];
-        switch (typeof z) {
-          case "number": {
-            b += z;
-            break;
-          }
-          case "string":
-            const K = e.strPosToUni(z);
-            b += K, f += K;
-            break;
-          case "object":
-            f -= Math.min(a.dlen(z.d), f - b);
-            break;
-        }
-      }
-      return f;
-    }, Y = (f, y) => typeof f == "number" ? M(f, y) : f.map((b) => M(b, y));
-    function pe(f, y, b) {
-      return r(f, ($, z) => typeof $ == "object" && typeof $.d == "number" ? { d: b.slice(y, z, z + $.d) } : $);
-    }
-    function Z(f) {
-      return r(f, (y) => {
-        switch (typeof y) {
-          case "object":
-            if (typeof y.d == "number")
-              throw Error("Cannot invert text op: Deleted characters missing from operation. makeInvertible must be called first.");
-            return y.d;
-          // delete -> insert
-          case "string":
-            return { d: y };
-          // Insert -> delete
-          case "number":
-            return y;
-        }
-      });
-    }
-    function Ie(f) {
-      return r(f, (y) => typeof y == "object" && typeof y.d == "string" ? { d: e.strPosToUni(y.d) } : y);
-    }
-    function qe(f) {
-      let y = !0;
-      return n(f, (b) => {
-        typeof b == "object" && typeof b.d == "number" && (y = !1);
-      }), y;
-    }
-    function _e(f) {
-      return {
-        name: "text-unicode",
-        uri: "http://sharejs.org/types/text-unicode",
-        trim: s,
-        normalize: o,
-        checkOp: t,
-        /** Create a new text snapshot.
-         *
-         * @param {string} initial - initial snapshot data. Optional. Defaults to ''.
-         * @returns {Snap} Initial document snapshot object
-         */
-        create(y = "") {
-          if (typeof y != "string")
-            throw Error("Initial data must be a string");
-          return f.create(y);
-        },
-        /** Apply an operation to a document snapshot
-         */
-        apply(y, b) {
-          t(b);
-          const $ = f.builder(y);
-          for (let z = 0; z < b.length; z++) {
-            const K = b[z];
-            switch (typeof K) {
-              case "number":
-                $.skip(K);
-                break;
-              case "string":
-                $.append(K);
-                break;
-              case "object":
-                $.del(a.dlen(K.d));
-                break;
-            }
-          }
-          return $.build();
-        },
-        transform: c,
-        compose: h,
-        transformPosition: M,
-        transformSelection: Y,
-        isInvertible: qe,
-        makeInvertible(y, b) {
-          return pe(y, b, f);
-        },
-        stripInvertible: Ie,
-        invert: Z,
-        invertWithDoc(y, b) {
-          return Z(pe(y, b, f));
-        },
-        isNoop: (y) => y.length === 0
-      };
-    }
-    a.default = _e;
-  })(dt)), dt;
-}
-var it = {}, Dt;
-function cn() {
-  if (Dt) return it;
-  Dt = 1, Object.defineProperty(it, "__esModule", { value: !0 });
-  const a = ht(), e = pt();
-  function t(n, r) {
-    return {
-      // Returns the text content of the document
-      get: n,
-      // Returns the number of characters in the string
-      getLength() {
-        return n().length;
-      },
-      // Insert the specified text at the given position in the document
-      insert(u, o, l) {
-        const E = e.strPosToUni(n(), u);
-        return r([E, o], l);
-      },
-      remove(u, o, l) {
-        const E = e.strPosToUni(n(), u);
-        return r([E, { d: o }], l);
-      },
-      // When you use this API, you should implement these two methods
-      // in your editing context.
-      //onInsert: function(pos, text) {},
-      //onRemove: function(pos, removedLength) {},
-      _onOp(u) {
-        a.eachOp(u, (o, l, E) => {
-          switch (typeof o) {
-            case "string":
-              this.onInsert && this.onInsert(E, o);
-              break;
-            case "object":
-              const B = a.dlen(o.d);
-              this.onRemove && this.onRemove(E, B);
-          }
-        });
-      },
-      onInsert: null,
-      onRemove: null
-    };
-  }
-  return it.default = t, t.provides = { text: !0 }, it;
-}
-var Pt;
-function dn() {
-  return Pt || (Pt = 1, (function(a) {
-    var e = Me && Me.__createBinding || (Object.create ? (function(c, h, M, Y) {
-      Y === void 0 && (Y = M), Object.defineProperty(c, Y, { enumerable: !0, get: function() {
-        return h[M];
-      } });
-    }) : (function(c, h, M, Y) {
-      Y === void 0 && (Y = M), c[Y] = h[M];
-    })), t = Me && Me.__setModuleDefault || (Object.create ? (function(c, h) {
-      Object.defineProperty(c, "default", { enumerable: !0, value: h });
-    }) : function(c, h) {
-      c.default = h;
-    }), n = Me && Me.__importStar || function(c) {
-      if (c && c.__esModule) return c;
-      var h = {};
-      if (c != null) for (var M in c) Object.hasOwnProperty.call(c, M) && e(h, c, M);
-      return t(h, c), h;
-    }, r = Me && Me.__importDefault || function(c) {
-      return c && c.__esModule ? c : { default: c };
-    };
-    Object.defineProperty(a, "__esModule", { value: !0 }), a.type = a.remove = a.insert = void 0;
-    const u = pt(), o = n(ht()), l = r(cn()), E = {
-      create(c) {
-        return c;
-      },
-      toString(c) {
-        return c;
-      },
-      builder(c) {
-        if (typeof c != "string")
-          throw Error("Invalid document snapshot: " + c);
-        const h = [];
-        return {
-          skip(M) {
-            let Y = u.uniToStrPos(c, M);
-            if (Y > c.length)
-              throw Error("The op is too long for this document");
-            h.push(c.slice(0, Y)), c = c.slice(Y);
-          },
-          append(M) {
-            h.push(M);
-          },
-          del(M) {
-            c = c.slice(u.uniToStrPos(c, M));
-          },
-          build() {
-            return h.join("") + c;
-          }
-        };
-      },
-      slice: o.uniSlice
-    }, B = o.default(E), m = Object.assign(Object.assign({}, B), { api: l.default });
-    a.type = m, a.insert = (c, h) => h.length === 0 ? [] : c === 0 ? [h] : [c, h], a.remove = (c, h) => o.dlen(h) === 0 ? [] : c === 0 ? [{ d: h }] : [c, { d: h }];
-    var s = ht();
-    Object.defineProperty(a, "makeType", { enumerable: !0, get: function() {
-      return s.default;
-    } });
-  })(Me)), Me;
-}
-var Tt;
-function fn() {
-  return Tt || (Tt = 1, (function(a) {
-    var e = Ze && Ze.__importDefault || function(i) {
-      return i && i.__esModule ? i : {
-        default: i
-      };
-    };
-    Object.defineProperty(a, "__esModule", {
-      value: !0
-    }), a.editOp = a.replaceOp = a.insertOp = a.moveOp = a.removeOp = a.type = void 0;
-    const t = e(ln()), n = e(un()), r = At(), u = Mt();
-    function o(i, d) {
-      if (!i) throw new Error(d);
-    }
-    a.type = {
-      name: "json1",
-      uri: "http://sharejs.org/types/JSONv1",
-      readCursor: r.readCursor,
-      writeCursor: r.writeCursor,
-      create: (i) => i,
-      isNoop: (i) => i == null,
-      setDebug(i) {
-      },
-      registerSubtype: Z,
-      checkValidOp: z,
-      normalize: K,
-      apply: Ee,
-      transformPosition: ce,
-      compose: ne,
-      tryTransform: ot,
-      transform: Nt,
-      makeInvertible: De,
-      invert: le,
-      invertWithDoc: jt,
-      RM_UNEXPECTED_CONTENT: u.ConflictType.RM_UNEXPECTED_CONTENT,
-      DROP_COLLISION: u.ConflictType.DROP_COLLISION,
-      BLACKHOLE: u.ConflictType.BLACKHOLE,
-      transformNoConflict: (i, d, v) => yt(() => !0, i, d, v),
-      typeAllowingConflictsPred: (i) => Object.assign(Object.assign({}, a.type), {
-        transform: (d, v, D) => yt(i, d, v, D)
-      })
-    };
-    const l = (i) => i ? i.getComponent() : null;
-    function E(i) {
-      return i && typeof i == "object" && !Array.isArray(i);
-    }
-    const B = (i) => Array.isArray(i) ? i.slice() : i !== null && typeof i == "object" ? Object.assign({}, i) : i, m = (i) => i && (i.p != null || i.r !== void 0), s = (i) => i && (i.d != null || i.i !== void 0);
-    function c(i, d) {
-      return o(i != null), typeof d == "number" ? (o(Array.isArray(i), "Invalid key - child is not an array"), (i = i.slice()).splice(d, 1)) : (o(E(i), "Invalid key - child is not an object"), delete (i = Object.assign({}, i))[d]), i;
-    }
-    function h(i, d, v) {
-      return typeof d == "number" ? (o(i != null, "Container is missing for key"), o(Array.isArray(i), "Cannot use numerical key for object container"), o(i.length >= d, "Cannot insert into out of bounds index"), i.splice(d, 0, v)) : (o(E(i), "Cannot insert into missing item"), o(i[d] === void 0, "Trying to overwrite value at key. Your op needs to remove it first"), i[d] = v), v;
-    }
-    a.removeOp = (i, d = !0) => r.writeCursor().writeAtPath(i, "r", d).get(), a.moveOp = (i, d) => r.writeCursor().writeMove(i, d).get(), a.insertOp = (i, d) => r.writeCursor().writeAtPath(i, "i", d).get(), a.replaceOp = (i, d, v) => r.writeCursor().at(i, (D) => {
-      D.write("r", d), D.write("i", v);
-    }).get(), a.editOp = (i, d, v, D = !1) => r.writeCursor().at(i, (O) => y(O, d, v, D)).get();
-    const M = (i, d) => i != null && (typeof d == "number" ? Array.isArray(i) : typeof i == "object"), Y = (i, d) => M(i, d) ? i[d] : void 0, pe = {};
-    function Z(i) {
-      let d = i.type ? i.type : i;
-      d.name && (pe[d.name] = d), d.uri && (pe[d.uri] = d);
-    }
-    const Ie = (i) => {
-      const d = pe[i];
-      if (d) return d;
-      throw Error("Missing type: " + i);
-    };
-    Z(dn());
-    const qe = (i, d) => i + d;
-    Z({
-      name: "number",
-      apply: qe,
-      compose: qe,
-      invert: (i) => -i,
-      transform: (i) => i
-    });
-    const _e = (i) => i == null ? null : i.et ? Ie(i.et) : i.es ? pe["text-unicode"] : i.ena != null ? pe.number : null, f = (i) => i.es ? i.es : i.ena != null ? i.ena : i.e, y = (i, d, v, D = !1) => {
-      const [O, C] = typeof d == "string" ? [Ie(d), d] : [d, d.name];
-      !D && O.isNoop && O.isNoop(v) || (C === "number" ? i.write("ena", v) : C === "text-unicode" ? i.write("es", v) : (i.write("et", C), i.write("e", v)));
-    };
-    function b(i) {
-      o(typeof i == "number"), o(i >= 0), o(i === (0 | i));
-    }
-    function $(i) {
-      typeof i == "number" ? b(i) : o(typeof i == "string");
-    }
-    function z(i) {
-      if (i === null) return;
-      const d = /* @__PURE__ */ new Set(), v = /* @__PURE__ */ new Set(), D = (C) => {
-        let x = !0, N = !1;
-        for (let p in C) {
-          const _ = C[p];
-          if (x = !1, o(p === "p" || p === "r" || p === "d" || p === "i" || p === "e" || p === "es" || p === "ena" || p === "et", "Invalid component item '" + p + "'"), p === "p") b(_), o(!d.has(_)), d.add(_), o(C.r === void 0);
-          else if (p === "d") b(_), o(!v.has(_)), v.add(_), o(C.i === void 0);
-          else if (p === "e" || p === "es" || p === "ena") {
-            o(!N), N = !0;
-            const w = _e(C);
-            o(w, "Missing type in edit"), w.checkValidOp && w.checkValidOp(f(C));
-          }
-        }
-        o(!x);
-      }, O = (C, x, N) => {
-        if (!Array.isArray(C)) throw Error("Op must be null or a list");
-        if (C.length === 0) throw Error("Empty descent");
-        x || $(C[0]);
-        let p = 1, _ = 0, w = 0;
-        for (let I = 0; I < C.length; I++) {
-          const R = C[I];
-          if (o(R != null), Array.isArray(R)) {
-            const W = O(R, !1);
-            if (_) {
-              const g = typeof w, U = typeof W;
-              g === U ? o(w < W, "descent keys are not in order") : o(g === "number" && U === "string");
-            }
-            w = W, _++, p = 3;
-          } else typeof R == "object" ? (o(p === 1, `Prev not scalar - instead ${p}`), D(R), p = 2) : (o(p !== 3), $(R), o(r.isValidPathItem(R), "Invalid path key"), p = 1);
-        }
-        return o(_ !== 1, "Operation makes multiple descents. Remove some []"), o(p === 2 || p === 3), C[0];
-      };
-      O(i, !0), o(d.size === v.size, "Mismatched picks and drops in op");
-      for (let C = 0; C < d.size; C++) o(d.has(C)), o(v.has(C));
-    }
-    function K(i) {
-      let d = 0, v = [];
-      const D = r.writeCursor();
-      return D.mergeTree(i, (O, C) => {
-        const x = _e(O);
-        if (x) {
-          const p = f(O);
-          y(C, x, x.normalize ? x.normalize(p) : p);
-        }
-        for (const p of ["r", "p", "i", "d"]) if (O[p] !== void 0) {
-          const _ = p === "p" || p === "d" ? (N = O[p], v[N] == null && (v[N] = d++), v[N]) : O[p];
-          C.write(p, _);
-        }
-        var N;
-      }), D.get();
-    }
-    function Ee(i, d) {
-      if (z(d), d === null) return i;
-      const v = [];
-      return (function D(O, C) {
-        let x = O, N = 0, p = {
-          root: O
-        }, _ = 0, w = p, I = "root";
-        function R() {
-          for (; _ < N; _++) {
-            let W = C[_];
-            typeof W != "object" && (o(M(w, I)), w = w[I] = B(w[I]), I = W);
-          }
-        }
-        for (; N < C.length; N++) {
-          const W = C[N];
-          if (Array.isArray(W)) {
-            const g = D(x, W);
-            g !== x && g !== void 0 && (R(), x = w[I] = g);
-          } else if (typeof W == "object") {
-            W.d != null ? (R(), x = h(w, I, v[W.d])) : W.i !== void 0 && (R(), x = h(w, I, W.i));
-            const g = _e(W);
-            if (g) R(), x = w[I] = g.apply(x, f(W));
-            else if (W.e !== void 0) throw Error("Subtype " + W.et + " undefined");
-          } else x = Y(x, W);
-        }
-        return p.root;
-      })(i = (function D(O, C) {
-        const x = [];
-        let N = 0;
-        for (; N < C.length; N++) {
-          const I = C[N];
-          if (Array.isArray(I)) break;
-          typeof I != "object" && (x.push(O), O = Y(O, I));
-        }
-        for (let I = C.length - 1; I >= N; I--) O = D(O, C[I]);
-        for (--N; N >= 0; N--) {
-          const I = C[N];
-          if (typeof I != "object") {
-            const R = x.pop();
-            O = O === Y(R, I) ? R : O === void 0 ? c(R, I) : (_ = I, w = O, (p = B(p = R))[_] = w, p);
-          } else m(I) && (o(O !== void 0, "Cannot pick up or remove undefined"), I.p != null && (v[I.p] = O), O = void 0);
-        }
-        var p, _, w;
-        return O;
-      })(i, d), d);
-    }
-    function ce(i, d) {
-      i = i.slice(), z(d);
-      const v = r.readCursor(d);
-      let D, O, C = !1;
-      const x = [];
-      for (let p = 0; ; p++) {
-        const _ = i[p], w = v.getComponent();
-        if (w && (w.r !== void 0 ? C = !0 : w.p != null && (C = !1, D = w.p, O = p)), p >= i.length) break;
-        let I = 0;
-        const R = r.advancer(v, void 0, (g, U) => {
-          m(U) && I++;
-        });
-        x.unshift(R);
-        const W = R(_);
-        if (typeof _ == "number" && (i[p] -= I), !W) break;
-      }
-      if (x.forEach((p) => p.end()), C) return null;
-      const N = () => {
-        let p = 0;
-        if (D != null) {
-          const _ = v.getPath();
-          p = _.length, i = _.concat(i.slice(O));
-        }
-        for (; p < i.length; p++) {
-          const _ = i[p], w = l(v), I = _e(w);
-          if (I) {
-            const g = f(w);
-            I.transformPosition && (i[p] = I.transformPosition(i[p], g));
-            break;
-          }
-          let R = 0;
-          const W = r.advancer(v, (g, U) => s(U) ? ~(g - R) : g - R, (g, U) => {
-            s(U) && R++;
-          })(_);
-          if (typeof _ == "number" && (i[p] += R), !W) break;
-        }
-      };
-      return D != null ? v.eachDrop(null, (p) => {
-        p === D && N();
-      }) : N(), i;
-    }
-    function ne(i, d) {
-      if (z(i), z(d), i == null) return d;
-      if (d == null) return i;
-      let v = 0;
-      const D = r.readCursor(i), O = r.readCursor(d), C = r.writeCursor(), x = [], N = [], p = [], _ = [], w = [], I = [], R = /* @__PURE__ */ new Set();
-      D.traverse(null, (g) => {
-        g.p != null && (p[g.p] = D.clone());
-      }), O.traverse(null, (g) => {
-        g.d != null && (_[g.d] = O.clone());
-      });
-      const W = r.writeCursor();
-      return (function g(U, re, te, F, se, Re, Oe, ye) {
-        o(re || te);
-        const oe = l(re), Pe = l(te), ke = !!Pe && Pe.r !== void 0, $e = !!oe && oe.i !== void 0, Te = oe ? oe.d : null, Ce = Pe ? Pe.p : null, xe = (Re || ke) && Ce == null;
-        if (Ce != null) F = _[Ce], Oe = N[Ce] = new r.WriteCursor();
-        else if (Pe && Pe.r !== void 0) F = null;
-        else {
-          const T = l(F);
-          T && T.d != null && (F = null);
-        }
-        const Q = l(F);
-        if (Te != null) if (U = p[Te], ye = x[Te] = new r.WriteCursor(), xe) Re && !ke && ye.write("r", !0);
-        else {
-          const T = w[Te] = v++;
-          Oe.write("d", T);
-        }
-        else if (oe && oe.i !== void 0) U = null;
-        else {
-          const T = l(U);
-          T && T.p != null && (U = null);
-        }
-        let k;
-        $e ? (o(se === void 0), k = oe.i) : k = se;
-        const L = (Ce == null ? !$e || Re || ke : k === void 0) ? null : Oe.getComponent();
-        if (Ce != null) {
-          if (!(se !== void 0 || $e)) {
-            const T = Te != null ? w[Te] : v++;
-            I[Ce] = T, ye.write("p", T);
-          }
-        } else ke && ($e || se !== void 0 || (Pe.r, ye.write("r", Pe.r)));
-        const S = xe ? null : _e(oe), P = _e(Q);
-        if ((S || P) && (S && S.name, P && P.name), S && P) {
-          o(S === P);
-          const T = f(oe), q = f(Q), he = S.compose(T, q);
-          y(Oe, S, he), R.add(Q);
-        } else S ? y(Oe, S, f(oe)) : P && (y(Oe, P, f(Q)), R.add(Q));
-        const A = typeof k == "object" && k != null;
-        let J = !1, X = 0, ee = 0, fe = 0, de = 0, ae = 0;
-        const ve = r.advancer(F, (T, q) => s(q) ? de - T - 1 : T - de, (T, q) => {
-          s(q) && de++;
-        }), H = r.advancer(U, (T, q) => m(q) ? X - T - 1 : T - X, (T, q) => {
-          m(q) && X++;
-        });
-        if (r.eachChildOf(re, te, (T, q, he) => {
-          let we, Be, Ke = T, Se = T, Ye = T;
-          if (typeof T == "number") {
-            let me = T + fe;
-            Be = ve(me), Se = me + de;
-            let ue = T + ee;
-            we = H(ue), s(l(Be)) && (we = null), Ke = ue + X, Ye = T + ae, o(Ke >= 0, "p1PickKey is negative"), o(Se >= 0, "p2DropKey is negative");
-            const Ue = s(l(q)), We = m(l(he));
-            (Ue || We && !xe) && ae--, Ue && ee--, We && fe--;
-          } else we = H(T), Be = ve(T);
-          ye.descend(Ke), Oe.descend(Se);
-          const Xe = A && !s(l(q)) ? k[Ye] : void 0, je = g(we, q, he, Be, Xe, xe, Oe, ye);
-          var Ne, j, ie;
-          A && !xe ? Xe !== je && (J || (k = Array.isArray(k) ? k.slice() : Object.assign({}, k), J = !0), Ne = k, ie = je, typeof (j = Ye) == "number" ? (o(Array.isArray(Ne)), o(j < Ne.length)) : (o(!Array.isArray(Ne)), o(Ne[j] !== void 0)), ie === void 0 ? typeof j == "number" ? Ne.splice(j, 1) : delete Ne[j] : Ne[j] = ie) : o(je === void 0), Oe.ascend(), ye.ascend();
-        }), H.end(), ve.end(), L != null) L.i = k;
-        else if (!Re && !ke && Ce == null) return k;
-      })(D, D.clone(), O, O.clone(), void 0, !1, C, W), C.reset(), C.mergeTree(W.get()), C.reset(), C.get(), x.map((g) => g.get()), N.map((g) => g.get()), D.traverse(C, (g, U) => {
-        const re = g.p;
-        if (re != null) {
-          const te = w[re];
-          te != null && U.write("p", te);
-          const F = x[re];
-          F && F.get(), F && U.mergeTree(F.get());
-        } else g.r !== void 0 && U.write("r", g.r);
-      }), C.reset(), C.get(), O.traverse(C, (g, U) => {
-        const re = g.d;
-        if (re != null) {
-          const F = I[re];
-          F != null && U.write("d", F);
-          const se = N[re];
-          se && U.mergeTree(se.get());
-        } else g.i !== void 0 && U.write("i", g.i);
-        const te = _e(g);
-        te && !R.has(g) && y(U, te, f(g));
-      }), C.get();
-    }
-    function le(i) {
-      if (i == null) return null;
-      const d = new r.ReadCursor(i), v = new r.WriteCursor();
-      let D;
-      const O = [], C = [];
-      return (function x(N, p, _) {
-        const w = N.getComponent();
-        let I, R = !1;
-        if (w) {
-          w.p != null && (p.write("d", w.p), O[w.p] = N.clone()), w.r !== void 0 && p.write("i", w.r), w.d != null && (p.write("p", w.d), _ = void 0), w.i !== void 0 && (_ = I = w.i);
-          const g = _e(w);
-          g && (_ === void 0 ? (D || (D = /* @__PURE__ */ new Set()), D.add(w)) : (f(w), _ = g.apply(_, f(w)), R = !0));
-        }
-        let W = 0;
-        for (const g of N) {
-          p.descend(g);
-          const U = typeof g == "number" ? g - W : g, re = Y(_, U);
-          s(N.getComponent()) && W++;
-          const te = x(N, p, re);
-          if (_ !== void 0 && te !== void 0) {
-            if (R || (R = !0, _ = B(_)), !M(_, U)) throw Error("Cannot modify child - invalid operation");
-            _[U] = te;
-          }
-          p.ascend();
-        }
-        if (I === void 0) return R ? _ : void 0;
-        p.write("r", _);
-      })(d, v, void 0), D && (v.reset(), (function x(N, p, _) {
-        const w = p.getComponent();
-        if (w) {
-          const g = w.d;
-          if (g != null && (N = O[g], _ = C[g] = r.writeCursor()), D.has(w)) {
-            const U = _e(w);
-            if (!U.invert) throw Error(`Cannot invert subtype ${U.name}`);
-            y(_, U, U.invert(f(w)));
-          }
-        }
-        let I = 0, R = 0;
-        const W = r.advancer(N, (g, U) => m(U) ? I - g - 1 : g - I, (g, U) => {
-          m(U) && I++;
-        });
-        for (const g of p) if (typeof g == "number") {
-          const U = g - R, re = W(U), te = U + I;
-          _.descend(te), x(re, p, _), s(p.getComponent()) && R++, _.ascend();
-        } else _.descend(g), x(W(g), p, _), _.ascend();
-        W.end();
-      })(d.clone(), d, v), C.length && (v.reset(), d.traverse(v, (x, N) => {
-        const p = x.p;
-        if (p != null) {
-          const _ = C[p];
-          _ && _.get(), _ && N.mergeTree(_.get());
-        }
-      }))), v.get();
-    }
-    const ge = (i, d) => i.some((v) => typeof v == "object" && (Array.isArray(v) ? ge(v, d) : d(v)));
-    function De(i, d) {
-      if (i == null || !ge(i, (p) => {
-        var _;
-        return p.r !== void 0 || ((_ = _e(p)) === null || _ === void 0 ? void 0 : _.makeInvertible) != null;
-      })) return i;
-      const v = new r.ReadCursor(i), D = new r.WriteCursor();
-      let O = !1;
-      const C = [], x = [], N = (p, _, w) => {
-        const I = p.getComponent();
-        let R = !1;
-        if (I) {
-          I.d != null && _.write("d", I.d), I.i !== void 0 && _.write("i", I.i);
-          const g = I.p;
-          if (g != null && (C[g] = p.clone(), o(w !== void 0, "Operation picks up at an invalid key"), x[g] = w, _.write("p", I.p)), I.r !== void 0 && w === void 0) throw Error("Invalid doc / op in makeInvertible: removed item missing from doc");
-          const U = _e(I);
-          U && (U.makeInvertible ? O = !0 : y(_, U, f(I), !0));
-        }
-        let W = 0;
-        for (const g of p) {
-          _.descend(g);
-          const U = typeof g == "number" ? g - W : g, re = Y(w, U), te = N(p, _, re);
-          re !== te && (R || (R = !0, w = B(w)), te === void 0 ? (w = c(w, U), typeof g == "number" && W++) : w[U] = te), _.ascend();
-        }
-        return I && (I.r !== void 0 ? (_.write("r", n.default(w)), w = void 0) : I.p != null && (w = void 0)), w;
-      };
-      return N(v, D, d), D.get(), O && (D.reset(), (function p(_, w, I, R, W) {
-        const g = w.getComponent();
-        if (g) {
-          g.i !== void 0 ? (R = g.i, W = !0) : g.d != null && (R = x[g.d], _ = C[g.d], W = !1, g.d);
-          let F = _e(g);
-          if (F && F.makeInvertible) {
-            const se = f(g);
-            y(I, F, F.makeInvertible(se, R), !0);
-          }
-        }
-        let U = 0, re = 0;
-        const te = r.advancer(_, (F, se) => m(se) ? U - F - 1 : F - U, (F, se) => {
-          m(se) && U++;
-        });
-        for (const F of w) if (typeof F == "number") {
-          const se = F - re, Re = te(se), Oe = se + U, ye = Y(R, W ? se : Oe);
-          I.descend(F), p(Re, w, I, ye, W), s(w.getComponent()) && re++, I.ascend();
-        } else {
-          const se = Y(R, F);
-          I.descend(F), p(te(F), w, I, se, W), I.ascend();
-        }
-        te.end();
-      })(v.clone(), v, D, d, !1)), D.get();
-    }
-    function jt(i, d) {
-      return le(De(i, d));
-    }
-    const st = (i) => {
-      if (i == null) return null;
-      const d = i.slice();
-      for (let v = 0; v < i.length; v++) {
-        const D = d[v];
-        Array.isArray(D) && (d[v] = st(D));
-      }
-      return d;
-    };
-    function ot(i, d, v) {
-      o(v === "left" || v === "right", "Direction must be left or right");
-      const D = v === "left" ? 0 : 1;
-      if (d == null) return {
-        ok: !0,
-        result: i
-      };
-      z(i), z(d);
-      let O = null;
-      const C = [], x = [], N = [], p = [], _ = [], w = [], I = [], R = [], W = [], g = [], U = [], re = [], te = [], F = [], se = [];
-      let Re = 0;
-      const Oe = r.readCursor(i), ye = r.readCursor(d), oe = r.writeCursor();
-      if ((function Q(k, L = null, S) {
-        const P = l(L);
-        P && (P.r !== void 0 ? S = L.clone() : P.p != null && (S = null, w[P.p] = k.clone()));
-        const A = k.getComponent();
-        let J;
-        A && (J = A.p) != null && (_[J] = L ? L.clone() : null, N[J] = k.clone(), S && (g[J] = !0, W[J] = S), P && P.p != null && (F[J] = P.p));
-        const X = r.advancer(L);
-        for (const ee of k) Q(k, X(ee), S);
-        X.end();
-      })(ye, Oe, null), (function Q(k, L, S, P, A) {
-        const J = S.getComponent();
-        let X, ee = !1;
-        J && ((X = J.d) != null ? (p[X] = S.clone(), P != null && (se[P] == null && (se[P] = []), se[P].push(X)), g[X], k = _[X] || null, L = N[X] || null, g[X] ? (A && (U[X] = !0), A = W[X] || null) : !A || D !== 1 && F[X] != null || O == null && (O = {
-          type: u.ConflictType.RM_UNEXPECTED_CONTENT,
-          op1: a.removeOp(A.getPath()),
-          op2: a.moveOp(L.getPath(), S.getPath())
-        }), ee = !0) : J.i !== void 0 && (k = L = null, ee = !0, A && O == null && (O = {
-          type: u.ConflictType.RM_UNEXPECTED_CONTENT,
-          op1: a.removeOp(A.getPath()),
-          op2: a.insertOp(S.getPath(), J.i)
-        })));
-        const fe = l(k);
-        fe && (fe.r !== void 0 ? A = k.clone() : fe.p != null && (fe.p, P = fe.p, A = null));
-        const de = _e(J);
-        de && A && O == null && (O = {
-          type: u.ConflictType.RM_UNEXPECTED_CONTENT,
-          op1: a.removeOp(A.getPath()),
-          op2: a.editOp(S.getPath(), de, f(J), !0)
-        });
-        let ae = 0, ve = 0;
-        const H = r.advancer(L, (q, he) => m(he) ? ae - q - 1 : q - ae, (q, he) => {
-          m(he) && ae++;
-        }), T = r.advancer(k);
-        for (const q of S) if (typeof q == "number") {
-          const he = q - ve, we = H(he);
-          ve += +Q(T(he + ae), we, S, P, A);
-        } else {
-          const he = H(q);
-          Q(T(q), he, S, P, A);
-        }
-        return H.end(), T.end(), ee;
-      })(Oe, ye, ye.clone(), null, null), p.map((Q) => Q && Q.get()), O) return {
-        ok: !1,
-        conflict: O
-      };
-      U.map((Q) => !!Q);
-      const Pe = [];
-      let ke = null;
-      (function Q(k, L, S, P, A) {
-        let J = !1;
-        const X = l(L);
-        if (m(X)) {
-          const H = X.p;
-          H != null ? (S = p[H], P = re[H] = r.writeCursor(), J = !0, A = null) : (S = null, A = L.clone());
-        } else s(l(S)) && (S = null);
-        const ee = k.getComponent();
-        if (ee) {
-          const H = ee.p;
-          H != null ? (A && (R[H] = A), Pe[H] = A || D === 1 && J ? null : P.getComponent(), C[H] = k.clone(), S && (I[H] = S.clone())) : ee.r !== void 0 && (A || P.write("r", !0), (A || J) && (ke == null && (ke = /* @__PURE__ */ new Set()), ke.add(ee)));
-        }
-        let fe = 0, de = 0;
-        const ae = r.advancer(L, void 0, (H, T) => {
-          m(T) && fe++;
-        }), ve = r.advancer(S, (H, T) => s(T) ? ~(H - de) : H - de, (H, T) => {
-          s(T) && de++;
-        });
-        if (k) for (const H of k) if (typeof H == "string") {
-          const T = ae(H), q = ve(H);
-          P.descend(H), Q(k, T, q, P, A), P.ascend();
-        } else {
-          const T = ae(H), q = H - fe, he = m(l(T)) ? null : ve(q), we = q + de;
-          o(we >= 0), P.descend(we), Q(k, T, he, P, A), P.ascend();
-        }
-        ae.end(), ve.end();
-      })(Oe, ye, ye.clone(), oe, null), oe.reset();
-      let $e = [];
-      if ((function Q(k, L, S, P, A, J) {
-        o(L);
-        const X = L.getComponent();
-        let ee = l(P), fe = !1;
-        const de = (j, ie, me) => j ? a.moveOp(j.getPath(), ie.getPath()) : a.insertOp(ie.getPath(), me.i);
-        if (s(X)) {
-          const j = X.d;
-          j != null && (x[j] = L.clone());
-          const ie = j != null ? Pe[j] : null;
-          let me = !1;
-          if (X.i !== void 0 || j != null && ie) {
-            let ue;
-            ee && (ee.i !== void 0 || (ue = ee.d) != null && !g[ue]) && (me = ue != null ? j != null && j === F[ue] : t.default(ee.i, X.i), me || ue != null && D !== 1 && F[ue] != null || O == null && (O = {
-              type: u.ConflictType.DROP_COLLISION,
-              op1: de(j != null ? C[j] : null, L, X),
-              op2: de(ue != null ? N[ue] : null, P, ee)
-            })), me || (J ? O == null && (O = {
-              type: u.ConflictType.RM_UNEXPECTED_CONTENT,
-              op1: de(j != null ? C[j] : null, L, X),
-              op2: a.removeOp(J.getPath())
-            }) : (j != null ? ($e[Re] = j, A.write("d", ie.p = Re++)) : A.write("i", n.default(X.i)), fe = !0));
-          } else if (j != null && !ie) {
-            const ue = R[j];
-            ue && (J = ue.clone());
-          }
-          j != null ? (k = C[j], S = w[j], P = I[j]) : X.i !== void 0 && (k = S = null, me || (P = null));
-        } else m(l(k)) && (k = S = P = null);
-        const ae = l(k), ve = l(S);
-        if (m(ve)) {
-          const j = ve.p;
-          ve.r !== void 0 && (!ae || ae.r === void 0) || g[j] ? (P = null, J = S.clone()) : j != null && (P = p[j], D !== 1 && F[j] != null || ((A = te[j]) || (A = te[j] = r.writeCursor()), A.reset(), J = null));
-        } else !s(X) && s(ee) && (P = null);
-        ee = P != null ? P.getComponent() : null;
-        const H = _e(X);
-        if (H) {
-          const j = f(X);
-          if (J) O == null && (O = {
-            type: u.ConflictType.RM_UNEXPECTED_CONTENT,
-            op1: a.editOp(L.getPath(), H, j, !0),
-            op2: a.removeOp(J.getPath())
-          });
-          else {
-            const ie = _e(ee);
-            let me;
-            if (ie) {
-              if (H !== ie) throw Error("Transforming incompatible types");
-              const ue = f(ee);
-              me = H.transform(j, ue, v);
-            } else me = n.default(j);
-            y(A, H, me);
-          }
-        }
-        let T = 0, q = 0, he = 0, we = 0, Be = 0, Ke = 0, Se = k != null && k.descendFirst(), Ye = Se;
-        const Xe = r.advancer(S, void 0, (j, ie) => {
-          m(ie) && he++;
-        });
-        let je = P != null && P.descendFirst(), Ne = je;
-        for (const j of L) if (typeof j == "number") {
-          let ie;
-          const me = s(L.getComponent()), ue = j - q;
-          {
-            let Le;
-            for (; Se && typeof (Le = k.getKey()) == "number"; ) {
-              Le += T;
-              const Ae = k.getComponent(), Je = m(Ae);
-              if (Le > ue || Le === ue && (!Je || D === 0 && me)) break;
-              if (Je) {
-                T--;
-                const Fe = Ae.p;
-                F.includes(Fe), Ae.d, l(te[Ae.d]), m(l(te[Ae.d])), (Ae.r === void 0 || ke && ke.has(Ae)) && (Fe == null || !Pe[Fe] || D !== 1 && F.includes(Fe)) || Be--;
-              }
-              Se = k.nextSibling();
-            }
-            ie = Se && Le === ue ? k : null;
-          }
-          const Ue = ue - T;
-          let We = Xe(Ue);
-          const at = Ue - he;
-          let et = null;
-          {
-            let Le, Ae;
-            for (; je && typeof (Le = P.getKey()) == "number"; ) {
-              Ae = Le - we;
-              const Je = P.getComponent(), Fe = s(Je);
-              if (Ae > at) break;
-              if (Ae === at) {
-                if (!Fe) {
-                  et = P;
-                  break;
-                }
-                {
-                  if (D === 0 && me) {
-                    et = P;
-                    break;
-                  }
-                  const Ge = We && m(We.getComponent());
-                  if (D === 0 && Ge) break;
-                }
-              }
-              if (Fe) {
-                const Ge = Je.d;
-                g[Ge], F[Ge], Je.i === void 0 && (g[Ge] || F[Ge] != null && D !== 1) ? (g[Ge] || F[Ge] != null && D === 0) && (we++, Ke--) : we++;
-              }
-              je = P.nextSibling();
-            }
-          }
-          const mt = at + we + Be + Ke;
-          o(mt >= 0, "trying to descend to a negative index"), A.descend(mt), me && (ie = We = et = null, q++), Q(ie, L, We, et, A, J) && Ke++, A.ascend();
-        } else {
-          let ie;
-          for (; Se && (ie = k.getKey(), typeof ie != "string" || !(ie > j || ie === j)); ) Se = k.nextSibling();
-          const me = Se && ie === j ? k : null, ue = Xe(j);
-          let Ue;
-          for (; je && (Ue = P.getKey(), typeof Ue != "string" || !(Ue > j || Ue === j)); ) je = P.nextSibling();
-          const We = je && Ue === j ? P : null;
-          A.descend(j), Q(me, L, ue, We, A, J), A.ascend();
-        }
-        return Xe.end(), Ye && k.ascend(), Ne && P.ascend(), fe;
-      })(Oe, Oe.clone(), ye, ye.clone(), oe, null), O) return {
-        ok: !1,
-        conflict: O
-      };
-      oe.reset();
-      const Te = (Q, k, L) => Q.traverse(k, (S, P) => {
-        S.d != null && L(S.d, Q, P);
-      });
-      (g.length || re.length) && (Te(ye, oe, (Q, k, L) => {
-        g[Q] && !U[Q] && L.write("r", !0), re[Q] && L.mergeTree(re[Q].get());
-      }), oe.reset());
-      const Ce = [], xe = [];
-      if ((te.length || g.length) && !O) {
-        const Q = r.readCursor(st(oe.get()));
-        if (Te(Q, null, (k, L) => {
-          Ce[k] = L.clone();
-        }), te.forEach((k) => {
-          k && Te(r.readCursor(k.get()), null, (L, S) => {
-            Ce[L] = S.clone();
-          });
-        }), (function k(L, S, P, A, J, X) {
-          const ee = l(S);
-          if (ee && m(ee)) if (ee.p != null) {
-            const T = ee.p;
-            Ce[T].getPath(), P = Ce[T], A = xe[T] = r.writeCursor();
-          } else ee.r !== void 0 && (P = null);
-          else s(l(P)) && (P = null);
-          const fe = L.getComponent();
-          if (fe) {
-            let T;
-            if ((T = fe.d) != null) {
-              const q = te[T];
-              q && (q.get(), A.mergeTree(q.get()), P = r.readCursor(q.get()));
-            }
-          }
-          let de = 0, ae = 0;
-          const ve = r.advancer(S, void 0, (T, q) => {
-            m(q) && de--;
-          }), H = r.advancer(P, (T, q) => s(q) ? -(T - ae) - 1 : T - ae, (T, q) => {
-            s(q) && ae++;
-          });
-          for (const T of L) if (typeof T == "number") {
-            const q = ve(T), he = T + de, we = H(he), Be = he + ae;
-            A.descend(Be), k(L, q, we, A), A.ascend();
-          } else A.descend(T), k(L, ve(T), H(T), A), A.ascend();
-          ve.end(), H.end();
-        })(ye, Q, Q.clone(), oe), oe.reset(), O) return {
-          ok: !1,
-          conflict: O
-        };
-        if (oe.get(), xe.length) {
-          const k = xe.map((S) => S ? S.get() : null), L = r.readCursor(st(oe.get()));
-          if (Te(L, oe, (S, P, A) => {
-            const J = k[S];
-            J && (A.mergeTree(J), k[S] = null);
-          }), k.find((S) => S)) {
-            const S = r.writeCursor(), P = r.writeCursor();
-            let A = 0, J = 0;
-            k.forEach((X) => {
-              X != null && Te(r.readCursor(X), null, (ee) => {
-                const fe = $e[ee];
-                S.writeMove(C[fe].getPath(), x[fe].getPath(), A++);
-                const de = se[fe];
-                de && de.forEach((ae) => {
-                  g[ae] || D !== 1 && F[ae] != null || P.writeMove(N[ae].getPath(), p[ae].getPath(), J++);
-                });
-              });
-            }), O = {
-              type: u.ConflictType.BLACKHOLE,
-              op1: S.get(),
-              op2: P.get()
-            };
-          }
-        }
-      }
-      return O ? {
-        ok: !1,
-        conflict: O
-      } : {
-        ok: !0,
-        result: oe.get()
-      };
-    }
-    const gt = (i) => {
-      const d = new Error("Transform detected write conflict");
-      throw d.conflict = i, d.type = d.name = "writeConflict", d;
-    };
-    function Nt(i, d, v) {
-      const D = ot(i, d, v);
-      if (D.ok) return D.result;
-      gt(D.conflict);
-    }
-    const ze = (i) => {
-      const d = r.writeCursor();
-      return r.readCursor(i).traverse(d, (v, D) => {
-        (s(v) || _e(v)) && D.write("r", !0);
-      }), d.get();
-    }, Rt = (i, d) => {
-      const { type: v, op1: D, op2: O } = i;
-      switch (v) {
-        case u.ConflictType.DROP_COLLISION:
-          return d === "left" ? [null, ze(O)] : [ze(D), null];
-        case u.ConflictType.RM_UNEXPECTED_CONTENT:
-          let C = !1;
-          return r.readCursor(D).traverse(null, (x) => {
-            x.r !== void 0 && (C = !0);
-          }), C ? [null, ze(O)] : [ze(D), null];
-        case u.ConflictType.BLACKHOLE:
-          return [ze(D), ze(O)];
-        default:
-          throw Error("Unrecognised conflict: " + v);
-      }
-    };
-    function yt(i, d, v, D) {
-      let O = null;
-      for (; ; ) {
-        const C = ot(d, v, D);
-        if (C.ok) return ne(O, C.result);
-        {
-          const { conflict: x } = C;
-          i(x) || gt(x);
-          const [N, p] = Rt(x, D);
-          d = ne(K(d), N), v = ne(K(v), p), O = ne(O, p);
-        }
-      }
-    }
-  })(Ze)), Ze;
-}
-var kt;
-function hn() {
-  return kt || (kt = 1, (function(a) {
-    var e = Ve && Ve.__createBinding || (Object.create ? (function(u, o, l, E) {
-      E === void 0 && (E = l), Object.defineProperty(u, E, { enumerable: !0, get: function() {
-        return o[l];
-      } });
-    }) : (function(u, o, l, E) {
-      E === void 0 && (E = l), u[E] = o[l];
-    })), t = Ve && Ve.__exportStar || function(u, o) {
-      for (var l in u) l !== "default" && !o.hasOwnProperty(l) && e(o, u, l);
-    };
-    Object.defineProperty(a, "__esModule", { value: !0 }), t(fn(), a);
-    var n = At();
-    Object.defineProperty(a, "ReadCursor", { enumerable: !0, get: function() {
-      return n.ReadCursor;
-    } }), Object.defineProperty(a, "WriteCursor", { enumerable: !0, get: function() {
-      return n.WriteCursor;
-    } });
-    var r = Mt();
-    Object.defineProperty(a, "ConflictType", { enumerable: !0, get: function() {
-      return r.ConflictType;
-    } });
-  })(Ve)), Ve;
-}
-var V = hn();
-class pn {
-  constructor() {
-    G(this, "drawingManagerData", {});
-    G(this, "_oldDrawingManagerData", {});
-    G(this, "_focusDrawings", []);
-    G(this, "_remove$", new be());
-    G(this, "remove$", this._remove$.asObservable());
-    G(this, "_add$", new be());
-    G(this, "add$", this._add$.asObservable());
-    G(this, "_update$", new be());
-    G(this, "update$", this._update$.asObservable());
-    G(this, "_order$", new be());
-    G(this, "order$", this._order$.asObservable());
-    G(this, "_group$", new be());
-    G(this, "group$", this._group$.asObservable());
-    G(this, "_ungroup$", new be());
-    G(this, "ungroup$", this._ungroup$.asObservable());
-    G(this, "_refreshTransform$", new be());
-    G(this, "refreshTransform$", this._refreshTransform$.asObservable());
-    G(this, "_visible$", new be());
-    G(this, "visible$", this._visible$.asObservable());
-    // private readonly _externalUpdate$ = new Subject<T[]>();
-    // readonly externalUpdate$ = this._externalUpdate$.asObservable();
-    G(this, "_focus$", new be());
-    G(this, "focus$", this._focus$.asObservable());
-    G(this, "_featurePluginUpdate$", new be());
-    G(this, "featurePluginUpdate$", this._featurePluginUpdate$.asObservable());
-    G(this, "_featurePluginAdd$", new be());
-    G(this, "featurePluginAdd$", this._featurePluginAdd$.asObservable());
-    G(this, "_featurePluginRemove$", new be());
-    G(this, "featurePluginRemove$", this._featurePluginRemove$.asObservable());
-    G(this, "_featurePluginOrderUpdate$", new be());
-    G(this, "featurePluginOrderUpdate$", this._featurePluginOrderUpdate$.asObservable());
-    G(this, "_featurePluginGroupUpdate$", new be());
-    G(this, "featurePluginGroupUpdate$", this._featurePluginGroupUpdate$.asObservable());
-    G(this, "_featurePluginUngroupUpdate$", new be());
-    G(this, "featurePluginUngroupUpdate$", this._featurePluginUngroupUpdate$.asObservable());
-    G(this, "_visible", !0);
-    G(this, "_editable", !0);
-  }
-  dispose() {
-    this._remove$.complete(), this._add$.complete(), this._update$.complete(), this._order$.complete(), this._focus$.complete(), this._featurePluginUpdate$.complete(), this._featurePluginAdd$.complete(), this._featurePluginRemove$.complete(), this._featurePluginOrderUpdate$.complete(), this.drawingManagerData = {}, this._oldDrawingManagerData = {};
-  }
-  visibleNotification(e) {
-    this._visible$.next(e);
-  }
-  refreshTransform(e) {
-    e.forEach((t) => {
-      const n = this._getCurrentBySearch(t);
-      n != null && (n.transform = t.transform, n.transforms = t.transforms, n.isMultiTransform = t.isMultiTransform);
-    }), this.refreshTransformNotification(e);
-  }
-  getDrawingDataForUnit(e) {
-    return this.drawingManagerData[e] || {};
-  }
-  removeDrawingDataForUnit(e) {
-    const t = this.drawingManagerData[e];
-    if (t == null)
-      return;
-    delete this.drawingManagerData[e];
-    const n = [];
-    Object.keys(t).forEach((r) => {
-      const u = t[r];
-      (u == null ? void 0 : u.data) != null && Object.keys(u.data).forEach((o) => {
-        n.push({ unitId: e, subUnitId: r, drawingId: o });
-      });
-    }), n.length > 0 && this.removeNotification(n);
-  }
-  registerDrawingData(e, t) {
-    this.drawingManagerData[e] = t;
-  }
-  initializeNotification(e) {
-    const t = [], n = this.drawingManagerData[e];
-    n != null && (Object.keys(n).forEach((r) => {
-      this._establishDrawingMap(e, r);
-      const u = n[r];
-      Object.keys(u.data).forEach((o) => {
-        const l = u.data[o];
-        l.unitId = e, l.subUnitId = r, t.push(l);
-      });
-    }), t.length > 0 && this.addNotification(t));
-  }
-  getDrawingData(e, t) {
-    return this._getDrawingData(e, t);
-  }
-  // Use in doc only.
-  setDrawingData(e, t, n) {
-    this.drawingManagerData[e][t].data = n;
-  }
-  getBatchAddOp(e) {
-    const t = [], n = [], r = [];
-    e.forEach((B) => {
-      const { op: m, invertOp: s } = this._addByParam(B);
-      t.push({ unitId: B.unitId, subUnitId: B.subUnitId, drawingId: B.drawingId }), n.push(m), r.push(s);
-    });
-    const u = n.reduce(V.type.compose, null), o = r.reduce(V.type.compose, null), { unitId: l, subUnitId: E } = e[0];
-    return { undo: o, redo: u, unitId: l, subUnitId: E, objects: t };
-  }
-  getBatchRemoveOp(e) {
-    const t = [], n = [];
-    e.forEach((E) => {
-      const { op: B, invertOp: m } = this._removeByParam(E);
-      t.unshift(B), n.push(m);
-    });
-    const r = t.reduce(V.type.compose, null), u = n.reduce(V.type.compose, null), { unitId: o, subUnitId: l } = e[0];
-    return { undo: u, redo: r, unitId: o, subUnitId: l, objects: e };
-  }
-  getBatchUpdateOp(e) {
-    const t = [], n = [], r = [];
-    e.forEach((B) => {
-      const { op: m, invertOp: s } = this._updateByParam(B);
-      t.push({ unitId: B.unitId, subUnitId: B.subUnitId, drawingId: B.drawingId }), n.push(m), r.push(s);
-    });
-    const u = n.reduce(V.type.compose, null), o = r.reduce(V.type.compose, null), { unitId: l, subUnitId: E } = e[0];
-    return { undo: o, redo: u, unitId: l, subUnitId: E, objects: t };
-  }
-  removeNotification(e) {
-    this._remove$.next(e);
-  }
-  addNotification(e) {
-    this._add$.next(e);
-  }
-  updateNotification(e) {
-    this._update$.next(e);
-  }
-  orderNotification(e) {
-    this._order$.next(e);
-  }
-  groupUpdateNotification(e) {
-    this._group$.next(e);
-  }
-  ungroupUpdateNotification(e) {
-    this._ungroup$.next(e);
-  }
-  refreshTransformNotification(e) {
-    this._refreshTransform$.next(e);
-  }
-  getGroupDrawingOp(e) {
-    const t = [], { unitId: n, subUnitId: r } = e[0].parent;
-    e.forEach((l) => {
-      t.push(this._getGroupDrawingOp(l));
-    });
-    const u = t.reduce(V.type.compose, null);
-    return { undo: V.type.invertWithDoc(u, this.drawingManagerData), redo: u, unitId: n, subUnitId: r, objects: e };
-  }
-  getUngroupDrawingOp(e) {
-    const t = [], { unitId: n, subUnitId: r } = e[0].parent;
-    e.forEach((l) => {
-      t.push(this._getUngroupDrawingOp(l));
-    });
-    const u = t.reduce(V.type.compose, null);
-    return { undo: V.type.invertWithDoc(u, this.drawingManagerData), redo: u, unitId: n, subUnitId: r, objects: e };
-  }
-  getDrawingsByGroup(e) {
-    const { unitId: t, subUnitId: n, drawingId: r } = e;
-    if (this.getDrawingByParam({ unitId: t, subUnitId: n, drawingId: r }) == null)
-      return [];
-    const o = this._getDrawingData(t, n), l = [];
-    return Object.keys(o).forEach((E) => {
-      const B = o[E];
-      B.groupId === r && l.push(B);
-    }), l;
-  }
-  _getGroupDrawingOp(e) {
-    const { parent: t, children: n } = e, { unitId: r, subUnitId: u, drawingId: o } = t, l = [];
-    l.push(
-      V.insertOp([r, u, "data", o], t)
-    );
-    let E = Number.NEGATIVE_INFINITY;
-    return n.forEach((B) => {
-      const { unitId: m, subUnitId: s, drawingId: c } = B, h = this._hasDrawingOrder({ unitId: m, subUnitId: s, drawingId: c });
-      E = Math.max(E, h), l.push(
-        ...this._getUpdateParamCompareOp(B, this.getDrawingByParam({ unitId: m, subUnitId: s, drawingId: c }))
-      );
-    }), E === Number.NEGATIVE_INFINITY && (E = this._getDrawingOrder(r, u).length), l.push(
-      V.insertOp([r, u, "order", E], o)
-    ), l.reduce(V.type.compose, null);
-  }
-  _getUngroupDrawingOp(e) {
-    const { parent: t, children: n } = e, { unitId: r, subUnitId: u, drawingId: o } = t, l = [];
-    return n.forEach((E) => {
-      const { unitId: B, subUnitId: m, drawingId: s } = E;
-      l.push(
-        ...this._getUpdateParamCompareOp(E, this.getDrawingByParam({ unitId: B, subUnitId: m, drawingId: s }))
-      );
-    }), l.push(
-      V.removeOp([r, u, "data", o], !0)
-    ), l.push(
-      V.removeOp([r, u, "order", this._getDrawingOrder(r, u).indexOf(o)], !0)
-    ), l.reduce(V.type.compose, null);
-  }
-  applyJson1(e, t, n) {
-    this._establishDrawingMap(e, t), this._oldDrawingManagerData = { ...this.drawingManagerData }, this.drawingManagerData = V.type.apply(this.drawingManagerData, n);
-  }
-  // private _fillMissingFields(jsonOp: JSONOp) {
-  //     if (jsonOp == null) {
-  //         return;
-  //     }
-  //     let object: { [key: string]: {} } = this.drawingManagerData;
-  //     for (let i = 0; i < jsonOp.length; i++) {
-  //         const op = jsonOp[i];
-  //         if (Array.isArray(op)) {
-  //             const opKey = op[0] as string;
-  //             if (!(opKey in object)) {
-  //                 object[opKey] = null as unknown as never;
-  //             }
-  //         } else if (typeof op === 'string') {
-  //             object = object[op];
-  //             if (object == null) {
-  //                 break;
-  //             }
-  //         }
-  //     }
-  // }
-  featurePluginUpdateNotification(e) {
-    this._featurePluginUpdate$.next(e);
-  }
-  featurePluginOrderUpdateNotification(e) {
-    this._featurePluginOrderUpdate$.next(e);
-  }
-  featurePluginAddNotification(e) {
-    this._featurePluginAdd$.next(e);
-  }
-  featurePluginRemoveNotification(e) {
-    this._featurePluginRemove$.next(e);
-  }
-  featurePluginGroupUpdateNotification(e) {
-    this._featurePluginGroupUpdate$.next(e);
-  }
-  featurePluginUngroupUpdateNotification(e) {
-    this._featurePluginUngroupUpdate$.next(e);
-  }
-  getDrawingByParam(e) {
-    return this._getCurrentBySearch(e);
-  }
-  getOldDrawingByParam(e) {
-    return this._getOldBySearch(e);
-  }
-  getDrawingOKey(e) {
-    const [t, n, r] = e.split("#-#");
-    return this._getCurrentBySearch({ unitId: t, subUnitId: n, drawingId: r });
-  }
-  focusDrawing(e) {
-    if (e == null || e.length === 0) {
-      this._focusDrawings = [], this._focus$.next([]);
-      return;
-    }
-    const t = [];
-    e.forEach((n) => {
-      var E;
-      const { unitId: r, subUnitId: u, drawingId: o } = n, l = (E = this._getDrawingData(r, u)) == null ? void 0 : E[o];
-      l != null && t.push(l);
-    }), t.length > 0 && (this._focusDrawings = t, this._focus$.next(t));
-  }
-  getFocusDrawings() {
-    const e = [];
-    return this._focusDrawings.forEach((t) => {
-      var l;
-      const { unitId: n, subUnitId: r, drawingId: u } = t, o = (l = this._getDrawingData(n, r)) == null ? void 0 : l[u];
-      o != null && e.push(o);
-    }), e;
-  }
-  getDrawingOrder(e, t) {
-    return this._getDrawingOrder(e, t);
-  }
-  // Use in doc only.
-  setDrawingOrder(e, t, n) {
-    this.drawingManagerData[e][t].order = n;
-  }
-  orderUpdateNotification(e) {
-    this._order$.next(e);
-  }
-  getForwardDrawingsOp(e) {
-    const { unitId: t, subUnitId: n, drawingIds: r } = e, u = [], o = this.getDrawingOrder(t, n), l = [...r];
-    r.forEach((m) => {
-      const s = this._hasDrawingOrder({ unitId: t, subUnitId: n, drawingId: m });
-      if (s === -1 || s === o.length - 1)
-        return;
-      const c = V.moveOp([t, n, "order", s], [t, n, "order", s + 1]);
-      u.push(c), l.includes(o[s + 1]) || l.push(o[s + 1]);
-    });
-    const E = u.reduce(V.type.compose, null);
-    return { undo: V.type.invertWithDoc(E, this.drawingManagerData), redo: E, unitId: t, subUnitId: n, objects: { ...e, drawingIds: l } };
-  }
-  getBackwardDrawingOp(e) {
-    const { unitId: t, subUnitId: n, drawingIds: r } = e, u = [], o = this.getDrawingOrder(t, n), l = [...r];
-    r.forEach((m) => {
-      const s = this._hasDrawingOrder({ unitId: t, subUnitId: n, drawingId: m });
-      if (s === -1 || s === 0)
-        return;
-      const c = V.moveOp([t, n, "order", s], [t, n, "order", s - 1]);
-      u.push(c), l.includes(o[s - 1]) || l.push(o[s - 1]);
-    });
-    const E = u.reduce(V.type.compose, null);
-    return { undo: V.type.invertWithDoc(E, this.drawingManagerData), redo: E, unitId: t, subUnitId: n, objects: { ...e, drawingIds: l } };
-  }
-  getFrontDrawingsOp(e) {
-    const { unitId: t, subUnitId: n, drawingIds: r } = e, u = this._getOrderFromSearchParams(t, n, r), o = [...r], l = this.getDrawingOrder(t, n), E = [];
-    u.forEach((s) => {
-      const { drawingId: c } = s, h = this._getDrawingCount(t, n) - 1, M = V.moveOp([t, n, "order", this._getDrawingOrder(t, n).indexOf(c)], [t, n, "order", h]);
-      E.push(M), o.includes(l[h]) || o.push(l[h]);
-    });
-    const B = E.reduce(V.type.compose, null);
-    return { undo: V.type.invertWithDoc(B, this.drawingManagerData), redo: B, unitId: t, subUnitId: n, objects: { ...e, drawingIds: o } };
-  }
-  getBackDrawingsOp(e) {
-    const { unitId: t, subUnitId: n, drawingIds: r } = e, u = this._getOrderFromSearchParams(t, n, r, !0), o = [...r], l = this.getDrawingOrder(t, n), E = [];
-    u.forEach((s) => {
-      const { drawingId: c } = s, h = V.moveOp([t, n, "order", this._getDrawingOrder(t, n).indexOf(c)], [t, n, "order", 0]);
-      E.push(h), o.includes(l[0]) || o.push(l[0]);
-    });
-    const B = E.reduce(V.type.compose, null);
-    return { undo: V.type.invertWithDoc(B, this.drawingManagerData), redo: B, unitId: t, subUnitId: n, objects: { ...e, drawingIds: o } };
-  }
-  _getDrawingCount(e, t) {
-    return this.getDrawingOrder(e, t).length || 0;
-  }
-  _getOrderFromSearchParams(e, t, n, r = !1) {
-    return n.map((u) => {
-      const o = this._hasDrawingOrder({ unitId: e, subUnitId: t, drawingId: u });
-      return { drawingId: u, zIndex: o };
-    }).sort(r === !1 ? Gt : qt);
-  }
-  _hasDrawingOrder(e) {
-    if (e == null)
-      return -1;
-    const { unitId: t, subUnitId: n, drawingId: r } = e;
-    return this._establishDrawingMap(t, n), this._getDrawingOrder(t, n).indexOf(r);
-  }
-  _getCurrentBySearch(e) {
-    var u, o, l;
-    if (e == null)
-      return;
-    const { unitId: t, subUnitId: n, drawingId: r } = e;
-    return (l = (o = (u = this.drawingManagerData[t]) == null ? void 0 : u[n]) == null ? void 0 : o.data) == null ? void 0 : l[r];
-  }
-  _getOldBySearch(e) {
-    var u, o, l;
-    if (e == null)
-      return;
-    const { unitId: t, subUnitId: n, drawingId: r } = e;
-    return (l = (o = (u = this._oldDrawingManagerData[t]) == null ? void 0 : u[n]) == null ? void 0 : o.data) == null ? void 0 : l[r];
-  }
-  _establishDrawingMap(e, t, n) {
-    var r;
-    return this.drawingManagerData[e] || (this.drawingManagerData[e] = {}), this.drawingManagerData[e][t] || (this.drawingManagerData[e][t] = {
-      data: {},
-      order: []
-    }), n == null ? null : (r = this.drawingManagerData[e][t].data) == null ? void 0 : r[n];
-  }
-  _addByParam(e) {
-    const { unitId: t, subUnitId: n, drawingId: r } = e;
-    this._establishDrawingMap(t, n, r);
-    const u = V.insertOp([t, n, "data", r], e), o = V.insertOp([t, n, "order", this._getDrawingOrder(t, n).length], r), l = [u, o].reduce(V.type.compose, null), E = V.type.invertWithDoc(l, this.drawingManagerData);
-    return { op: l, invertOp: E };
-  }
-  _removeByParam(e) {
-    if (e == null)
-      return { op: [], invertOp: [] };
-    const { unitId: t, subUnitId: n, drawingId: r } = e;
-    if (this._establishDrawingMap(t, n, r) == null)
-      return { op: [], invertOp: [] };
-    const o = V.removeOp([t, n, "data", r], !0), l = V.removeOp([t, n, "order", this._getDrawingOrder(t, n).indexOf(r)], !0), E = [o, l].reduce(V.type.compose, null), B = V.type.invertWithDoc(E, this.drawingManagerData);
-    return { op: E, invertOp: B };
-  }
-  _updateByParam(e) {
-    const { unitId: t, subUnitId: n, drawingId: r } = e, u = this._establishDrawingMap(t, n, r);
-    if (u == null)
-      return { op: [], invertOp: [] };
-    const l = this._getUpdateParamCompareOp(e, u).reduce(V.type.compose, null), E = V.type.invertWithDoc(l, this.drawingManagerData);
-    return { op: l, invertOp: E };
-  }
-  // private _initializeDrawingData(updateParam: T, oldParam: T) {
-  //     Object.keys(updateParam).forEach((key) => {
-  //         if (!(key in oldParam)) {
-  //             oldParam[key as keyof IDrawingParam] = null as unknown as never;
-  //         }
-  //     });
-  // }
-  _getUpdateParamCompareOp(e, t) {
-    const { unitId: n, subUnitId: r, drawingId: u } = e, o = [];
-    return Object.keys(e).forEach((l) => {
-      const E = e[l], B = t[l];
-      B !== E && o.push(
-        V.replaceOp([n, r, "data", u, l], B, E)
-      );
-    }), o;
-  }
-  _getDrawingData(e, t) {
-    var n, r;
-    return ((r = (n = this.drawingManagerData[e]) == null ? void 0 : n[t]) == null ? void 0 : r.data) || {};
-  }
-  _getDrawingOrder(e, t) {
-    var n, r;
-    return ((r = (n = this.drawingManagerData[e]) == null ? void 0 : n[t]) == null ? void 0 : r.order) || [];
-  }
-  getDrawingVisible() {
-    return this._visible;
-  }
-  getDrawingEditable() {
-    return this._editable;
-  }
-  setDrawingVisible(e) {
-    this._visible = e;
-  }
-  setDrawingEditable(e) {
-    this._editable = e;
-  }
-}
-class gn extends pn {
-}
-class yn {
-  constructor() {
-    G(this, "_waitCount", 0);
-    G(this, "_change$", new be());
-    G(this, "change$", this._change$);
-    G(this, "_imageSourceCache", /* @__PURE__ */ new Map());
-  }
-  setWaitCount(e) {
-    this._waitCount = e, this._change$.next(e);
-  }
-  getImageSourceCache(e, t) {
-    if (t === lt.BASE64) {
-      const n = new Image();
-      return n.src = e, n;
-    }
-    return this._imageSourceCache.get(e);
-  }
-  addImageSourceCache(e, t, n) {
-    t === lt.BASE64 || n == null || this._imageSourceCache.set(e, n);
-  }
-  async getImage(e) {
-    return Promise.resolve(e);
-  }
-  async saveImage(e) {
-    return new Promise((t, n) => {
-      if (!nn.includes(e.type)) {
-        n(new Error(tt.ERROR_IMAGE_TYPE)), this._decreaseWaiting();
-        return;
-      }
-      if (e.size > tn) {
-        n(new Error(tt.ERROR_EXCEED_SIZE)), this._decreaseWaiting();
-        return;
-      }
-      const r = new FileReader();
-      r.readAsDataURL(e), r.onload = (u) => {
-        var E;
-        const o = (E = u.target) == null ? void 0 : E.result;
-        if (o == null) {
-          n(new Error(tt.ERROR_IMAGE)), this._decreaseWaiting();
-          return;
-        }
-        const l = $t(6);
-        t({
-          imageId: l,
-          imageSourceType: lt.BASE64,
-          source: o,
-          base64Cache: o,
-          status: tt.SUCCUSS
-        }), this._decreaseWaiting();
-      };
-    });
-  }
-  _decreaseWaiting() {
-    this._waitCount -= 1, this._change$.next(this._waitCount);
-  }
-}
-class mn extends Kt {
-  constructor() {
-    super(...arguments);
-    G(this, "_urlImageDownloader", null);
-  }
-  registerURLImageDownloader(t) {
-    return this._urlImageDownloader = t, Ft(() => {
-      this._urlImageDownloader = null;
-    });
-  }
-  async getImage(t) {
-    if (this._urlImageDownloader)
-      try {
-        return await this._urlImageDownloader(t);
-      } catch (n) {
-        console.error(`Custom downloader failed for ${t}, falling back to default behavior:`, n);
-      }
-    return t;
-  }
-  async downloadImage(t) {
-    if (this._urlImageDownloader)
-      try {
-        const r = await this._urlImageDownloader(t);
-        return await (await fetch(r)).blob();
-      } catch (r) {
-        console.error(`Custom downloader failed for ${t}, falling back to default fetch:`, r);
-      }
-    return await (await fetch(t)).blob();
-  }
-}
-var _n = Object.getOwnPropertyDescriptor, vn = (a, e, t, n) => {
-  for (var r = n > 1 ? void 0 : n ? _n(e, t) : e, u = a.length - 1, o; u >= 0; u--)
-    (o = a[u]) && (r = o(r) || r);
-  return r;
-}, ft = (a, e) => (t, n) => e(t, n, a), Qe;
-let St = (Qe = class extends Jt {
-  constructor(a = vt, e, t, n) {
-    super(), this._config = a, this._injector = e, this._configService = t, this._commandService = n;
-    const { ...r } = Yt(
-      {},
-      vt,
-      this._config
-    );
-    this._configService.setConfig(an, r);
-  }
-  onStarting() {
-    this._initCommands(), this._initDependencies();
-  }
-  _initDependencies() {
-    var t;
-    Zt([
-      [Qt, { useClass: yn }],
-      [en, { useClass: mn }],
-      [Ut, { useClass: gn }]
-    ], (t = this._config) == null ? void 0 : t.override).forEach((n) => this._injector.add(n));
-  }
-  _initCommands() {
-    [
-      rn
-    ].forEach((a) => this.disposeWithMe(this._commandService.registerCommand(a)));
-  }
-}, G(Qe, "pluginName", "UNIVER_DRAWING_PLUGIN"), G(Qe, "packageName", _t.name), G(Qe, "version", _t.version), Qe);
-St = vn([
-  ft(1, Vt(Ht)),
-  ft(2, zt),
-  ft(3, Xt)
-], St);
-function Dn({ unitId: a, subUnitId: e, drawingId: t }, n) {
-  return typeof n == "number" ? `${a}#-#${e}#-#${t}#-#${n}` : `${a}#-#${e}#-#${t}`;
-}
-const Pn = async (a) => new Promise((e, t) => {
-  const n = new Image();
-  n.src = a, n.onload = () => {
-    e({
-      width: n.width,
-      height: n.height,
-      image: n
-    });
-  }, n.onerror = (r) => {
-    t(r);
-  };
-});
-export {
-  nn as DRAWING_IMAGE_ALLOW_IMAGE_LIST,
-  tn as DRAWING_IMAGE_ALLOW_SIZE,
-  En as DRAWING_IMAGE_COUNT_LIMIT,
-  Cn as DRAWING_IMAGE_HEIGHT_LIMIT,
-  In as DRAWING_IMAGE_WIDTH_LIMIT,
-  gn as DrawingManagerService,
-  Ut as IDrawingManagerService,
-  Sn as IImageIoService,
-  yn as ImageIoService,
-  Un as ImageSourceType,
-  An as ImageUploadStatusType,
-  rn as SetDrawingSelectedOperation,
-  mn as URLImageService,
-  pn as UnitDrawingService,
-  St as UniverDrawingPlugin,
-  Dn as getDrawingShapeKeyByDrawingSearch,
-  Pn as getImageSize
-};
+import{CommandType as e,Disposable as t,DrawingTypeEnum as n,ICommandService as r,IConfigService as i,IImageIoService as a,IURLImageService as o,ImageSourceType as s,ImageUploadStatusType as c,Inject as l,Injector as u,Plugin as d,createIdentifier as f,generateRandomId as p,merge as m,mergeOverrideWithDependencies as h,sortRules as g,sortRulesByDesc as _,toDisposable as v}from"@univerjs/core";import*as y from"ot-json1";import{Subject as b}from"rxjs";const x=500,S=500,C=10,w=5*1024*1024,T=[`image/png`,`image/jpeg`,`image/jpg`,`image/gif`,`image/bmp`],E=f(`univer.drawing-manager.service`),D={id:`drawing.operation.set-drawing-selected`,type:e.OPERATION,handler:(e,t)=>{let n=e.get(E);return t==null?!1:(n.focusDrawing(t),!0)}};var O=`@univerjs/drawing`,k=`0.18.0`;const A=`drawing.config`;Symbol(A);const j={};function M(e){"@babel/helpers - typeof";return M=typeof Symbol==`function`&&typeof Symbol.iterator==`symbol`?function(e){return typeof e}:function(e){return e&&typeof Symbol==`function`&&e.constructor===Symbol&&e!==Symbol.prototype?`symbol`:typeof e},M(e)}function N(e,t){if(M(e)!=`object`||!e)return e;var n=e[Symbol.toPrimitive];if(n!==void 0){var r=n.call(e,t||`default`);if(M(r)!=`object`)return r;throw TypeError(`@@toPrimitive must return a primitive value.`)}return(t===`string`?String:Number)(e)}function P(e){var t=N(e,`string`);return M(t)==`symbol`?t:t+``}function F(e,t,n){return(t=P(t))in e?Object.defineProperty(e,t,{value:n,enumerable:!0,configurable:!0,writable:!0}):e[t]=n,e}var I=function(e){return e.data=`data`,e.order=`order`,e}(I||{}),L=class{constructor(){F(this,`drawingManagerData`,{}),F(this,`_oldDrawingManagerData`,{}),F(this,`_focusDrawings`,[]),F(this,`_remove$`,new b),F(this,`remove$`,this._remove$.asObservable()),F(this,`_add$`,new b),F(this,`add$`,this._add$.asObservable()),F(this,`_update$`,new b),F(this,`update$`,this._update$.asObservable()),F(this,`_order$`,new b),F(this,`order$`,this._order$.asObservable()),F(this,`_group$`,new b),F(this,`group$`,this._group$.asObservable()),F(this,`_ungroup$`,new b),F(this,`ungroup$`,this._ungroup$.asObservable()),F(this,`_refreshTransform$`,new b),F(this,`refreshTransform$`,this._refreshTransform$.asObservable()),F(this,`_visible$`,new b),F(this,`visible$`,this._visible$.asObservable()),F(this,`_focus$`,new b),F(this,`focus$`,this._focus$.asObservable()),F(this,`_featurePluginUpdate$`,new b),F(this,`featurePluginUpdate$`,this._featurePluginUpdate$.asObservable()),F(this,`_featurePluginAdd$`,new b),F(this,`featurePluginAdd$`,this._featurePluginAdd$.asObservable()),F(this,`_featurePluginRemove$`,new b),F(this,`featurePluginRemove$`,this._featurePluginRemove$.asObservable()),F(this,`_featurePluginOrderUpdate$`,new b),F(this,`featurePluginOrderUpdate$`,this._featurePluginOrderUpdate$.asObservable()),F(this,`_featurePluginGroupUpdate$`,new b),F(this,`featurePluginGroupUpdate$`,this._featurePluginGroupUpdate$.asObservable()),F(this,`_featurePluginUngroupUpdate$`,new b),F(this,`featurePluginUngroupUpdate$`,this._featurePluginUngroupUpdate$.asObservable()),F(this,`_visible`,!0),F(this,`_editable`,!0)}dispose(){this._remove$.complete(),this._add$.complete(),this._update$.complete(),this._order$.complete(),this._focus$.complete(),this._featurePluginUpdate$.complete(),this._featurePluginAdd$.complete(),this._featurePluginRemove$.complete(),this._featurePluginOrderUpdate$.complete(),this.drawingManagerData={},this._oldDrawingManagerData={}}visibleNotification(e){this._visible$.next(e)}refreshTransform(e){e.forEach(e=>{let t=this._getCurrentBySearch(e);t!=null&&(t.transform=e.transform,t.transforms=e.transforms,t.isMultiTransform=e.isMultiTransform)}),this.refreshTransformNotification(e)}getDrawingDataForUnit(e){return this.drawingManagerData[e]||{}}removeDrawingDataForUnit(e){let t=this.drawingManagerData[e];if(t==null)return;delete this.drawingManagerData[e];let n=[];Object.keys(t).forEach(r=>{let i=t[r];(i==null?void 0:i.data)!=null&&Object.keys(i.data).forEach(t=>{n.push({unitId:e,subUnitId:r,drawingId:t})})}),n.length>0&&this.removeNotification(n)}registerDrawingData(e,t){this.drawingManagerData[e]=t}initializeNotification(e){let t=[],n=this.drawingManagerData[e];n!=null&&(Object.keys(n).forEach(r=>{this._establishDrawingMap(e,r);let i=n[r];Object.keys(i.data).forEach(n=>{let a=i.data[n];a.unitId=e,a.subUnitId=r,t.push(a)})}),t.length>0&&this.addNotification(t))}getDrawingData(e,t){return this._getDrawingData(e,t)}setDrawingData(e,t,n){this.drawingManagerData[e][t].data=n}getBatchAddOp(e){let t=[],n=[],r=[];e.forEach(e=>{let{op:i,invertOp:a}=this._addByParam(e);t.push({unitId:e.unitId,subUnitId:e.subUnitId,drawingId:e.drawingId}),n.push(i),r.push(a)});let i=n.reduce(y.type.compose,null),a=r.reduce(y.type.compose,null),{unitId:o,subUnitId:s}=e[0];return{undo:a,redo:i,unitId:o,subUnitId:s,objects:t}}getBatchRemoveOp(e){let t=[],n=[];e.forEach(e=>{let{op:r,invertOp:i}=this._removeByParam(e);t.unshift(r),n.push(i)});let r=t.reduce(y.type.compose,null),i=n.reduce(y.type.compose,null),{unitId:a,subUnitId:o}=e[0];return{undo:i,redo:r,unitId:a,subUnitId:o,objects:e}}getBatchUpdateOp(e){let t=[],n=[],r=[];e.forEach(e=>{let{op:i,invertOp:a}=this._updateByParam(e);t.push({unitId:e.unitId,subUnitId:e.subUnitId,drawingId:e.drawingId}),n.push(i),r.push(a)});let i=n.reduce(y.type.compose,null),a=r.reduce(y.type.compose,null),{unitId:o,subUnitId:s}=e[0];return{undo:a,redo:i,unitId:o,subUnitId:s,objects:t}}removeNotification(e){this._remove$.next(e)}addNotification(e){this._add$.next(e)}updateNotification(e){this._update$.next(e)}orderNotification(e){this._order$.next(e)}groupUpdateNotification(e){this._group$.next(e)}ungroupUpdateNotification(e){this._ungroup$.next(e)}refreshTransformNotification(e){this._refreshTransform$.next(e)}getGroupDrawingOp(e){let t=[],{unitId:n,subUnitId:r}=e[0].parent;e.forEach(e=>{t.push(this._getGroupDrawingOp(e))});let i=t.reduce(y.type.compose,null);return{undo:y.type.invertWithDoc(i,this.drawingManagerData),redo:i,unitId:n,subUnitId:r,objects:e}}getUngroupDrawingOp(e){let t=[],{unitId:n,subUnitId:r}=e[0].parent;e.forEach(e=>{t.push(this._getUngroupDrawingOp(e))});let i=t.reduce(y.type.compose,null);return{undo:y.type.invertWithDoc(i,this.drawingManagerData),redo:i,unitId:n,subUnitId:r,objects:e}}getDrawingsByGroup(e){let{unitId:t,subUnitId:n,drawingId:r}=e;if(this.getDrawingByParam({unitId:t,subUnitId:n,drawingId:r})==null)return[];let i=this._getDrawingData(t,n),a=[];return Object.keys(i).forEach(e=>{let t=i[e];t.groupId===r&&a.push(t)}),a}getDrawingsByGroupNested(e){let{unitId:t,subUnitId:r}=e,i=this.getDrawingByParam(e);if(!i)return null;let a=this._getDrawingData(t,r),o=new Map;Object.values(a).forEach(e=>{e.groupId!=null&&(o.has(e.groupId)||o.set(e.groupId,[]),o.get(e.groupId).push(e.drawingId))});let s=[],c=[],l={},u=e=>{var t;let{drawingId:r}=e,i=(t=o.get(r))==null?[]:t;l[r]={drawingId:r,children:i},i.forEach(e=>{let t=a[e];t&&(t.drawingType===n.DRAWING_GROUP?(u(t),c.push(t)):s.push(t))})};return u(i),c.push(i),{nestedIdRecord:l,flatChildren:s,groups:c}}_getGroupDrawingOp(e){let{parent:t,children:n}=e,{unitId:r,subUnitId:i,drawingId:a}=t,o=[];o.push(y.insertOp([r,i,I.data,a],t));let s=-1/0;return n.forEach(e=>{let{unitId:t,subUnitId:n,drawingId:r}=e,i=this._hasDrawingOrder({unitId:t,subUnitId:n,drawingId:r});s=Math.max(s,i),o.push(...this._getUpdateParamCompareOp(e,this.getDrawingByParam({unitId:t,subUnitId:n,drawingId:r})))}),s===-1/0&&(s=this._getDrawingOrder(r,i).length),o.push(y.insertOp([r,i,I.order,s],a)),o.reduce(y.type.compose,null)}_getUngroupDrawingOp(e){let{parent:t,children:n}=e,{unitId:r,subUnitId:i,drawingId:a}=t,o=[];return n.forEach(e=>{let{unitId:t,subUnitId:n,drawingId:r}=e;o.push(...this._getUpdateParamCompareOp(e,this.getDrawingByParam({unitId:t,subUnitId:n,drawingId:r})))}),o.push(y.removeOp([r,i,I.data,a],!0)),o.push(y.removeOp([r,i,I.order,this._getDrawingOrder(r,i).indexOf(a)],!0)),o.reduce(y.type.compose,null)}applyJson1(e,t,n){this._establishDrawingMap(e,t),this._oldDrawingManagerData={...this.drawingManagerData},this.drawingManagerData=y.type.apply(this.drawingManagerData,n)}featurePluginUpdateNotification(e){this._featurePluginUpdate$.next(e)}featurePluginOrderUpdateNotification(e){this._featurePluginOrderUpdate$.next(e)}featurePluginAddNotification(e){this._featurePluginAdd$.next(e)}featurePluginRemoveNotification(e){this._featurePluginRemove$.next(e)}featurePluginGroupUpdateNotification(e){this._featurePluginGroupUpdate$.next(e)}featurePluginUngroupUpdateNotification(e){this._featurePluginUngroupUpdate$.next(e)}getDrawingByParam(e){return this._getCurrentBySearch(e)}getOldDrawingByParam(e){return this._getOldBySearch(e)}getDrawingOKey(e){let[t,n,r]=e.split(`#-#`);return this._getCurrentBySearch({unitId:t,subUnitId:n,drawingId:r})}focusDrawing(e){if(e==null||e.length===0){this._focusDrawings=[],this._focus$.next([]);return}let t=[];e.forEach(e=>{var n;let{unitId:r,subUnitId:i,drawingId:a}=e,o=(n=this._getDrawingData(r,i))==null?void 0:n[a];o!=null&&t.push(o)}),t.length>0&&(this._focusDrawings=t,this._focus$.next(t))}getFocusDrawings(){let e=[];return this._focusDrawings.forEach(t=>{var n;let{unitId:r,subUnitId:i,drawingId:a}=t,o=(n=this._getDrawingData(r,i))==null?void 0:n[a];o!=null&&e.push(o)}),e}getDrawingOrder(e,t){return this._getDrawingOrder(e,t)}setDrawingOrder(e,t,n){this.drawingManagerData[e][t].order=n}orderUpdateNotification(e){this._order$.next(e)}getForwardDrawingsOp(e){let{unitId:t,subUnitId:n,drawingIds:r}=e,i=[],a=this.getDrawingOrder(t,n),o=[...r];r.forEach(e=>{let r=this._hasDrawingOrder({unitId:t,subUnitId:n,drawingId:e});if(r===-1||r===a.length-1)return;let s=y.moveOp([t,n,I.order,r],[t,n,I.order,r+1]);i.push(s),o.includes(a[r+1])||o.push(a[r+1])});let s=i.reduce(y.type.compose,null);return{undo:y.type.invertWithDoc(s,this.drawingManagerData),redo:s,unitId:t,subUnitId:n,objects:{...e,drawingIds:o}}}getBackwardDrawingOp(e){let{unitId:t,subUnitId:n,drawingIds:r}=e,i=[],a=this.getDrawingOrder(t,n),o=[...r];r.forEach(e=>{let r=this._hasDrawingOrder({unitId:t,subUnitId:n,drawingId:e});if(r===-1||r===0)return;let s=y.moveOp([t,n,I.order,r],[t,n,I.order,r-1]);i.push(s),o.includes(a[r-1])||o.push(a[r-1])});let s=i.reduce(y.type.compose,null);return{undo:y.type.invertWithDoc(s,this.drawingManagerData),redo:s,unitId:t,subUnitId:n,objects:{...e,drawingIds:o}}}getFrontDrawingsOp(e){let{unitId:t,subUnitId:n,drawingIds:r}=e,i=this._getOrderFromSearchParams(t,n,r),a=[...r],o=this.getDrawingOrder(t,n),s=[];i.forEach(e=>{let{drawingId:r}=e,i=this._getDrawingCount(t,n)-1,c=y.moveOp([t,n,I.order,this._getDrawingOrder(t,n).indexOf(r)],[t,n,I.order,i]);s.push(c),a.includes(o[i])||a.push(o[i])});let c=s.reduce(y.type.compose,null);return{undo:y.type.invertWithDoc(c,this.drawingManagerData),redo:c,unitId:t,subUnitId:n,objects:{...e,drawingIds:a}}}getBackDrawingsOp(e){let{unitId:t,subUnitId:n,drawingIds:r}=e,i=this._getOrderFromSearchParams(t,n,r,!0),a=[...r],o=this.getDrawingOrder(t,n),s=[];i.forEach(e=>{let{drawingId:r}=e,i=y.moveOp([t,n,I.order,this._getDrawingOrder(t,n).indexOf(r)],[t,n,I.order,0]);s.push(i),a.includes(o[0])||a.push(o[0])});let c=s.reduce(y.type.compose,null);return{undo:y.type.invertWithDoc(c,this.drawingManagerData),redo:c,unitId:t,subUnitId:n,objects:{...e,drawingIds:a}}}_getDrawingCount(e,t){return this.getDrawingOrder(e,t).length||0}_getOrderFromSearchParams(e,t,n,r=!1){return n.map(n=>({drawingId:n,zIndex:this._hasDrawingOrder({unitId:e,subUnitId:t,drawingId:n})})).sort(r===!1?g:_)}_hasDrawingOrder(e){if(e==null)return-1;let{unitId:t,subUnitId:n,drawingId:r}=e;return this._establishDrawingMap(t,n),this._getDrawingOrder(t,n).indexOf(r)}_getCurrentBySearch(e){var t;if(e==null)return;let{unitId:n,subUnitId:r,drawingId:i}=e;return(t=this.drawingManagerData[n])==null||(t=t[r])==null||(t=t.data)==null?void 0:t[i]}_getOldBySearch(e){var t;if(e==null)return;let{unitId:n,subUnitId:r,drawingId:i}=e;return(t=this._oldDrawingManagerData[n])==null||(t=t[r])==null||(t=t.data)==null?void 0:t[i]}_establishDrawingMap(e,t,n){var r;return this.drawingManagerData[e]||(this.drawingManagerData[e]={}),this.drawingManagerData[e][t]||(this.drawingManagerData[e][t]={data:{},order:[]}),n==null?null:(r=this.drawingManagerData[e][t].data)==null?void 0:r[n]}_addByParam(e){let{unitId:t,subUnitId:n,drawingId:r}=e;this._establishDrawingMap(t,n,r);let i=[y.insertOp([t,n,I.data,r],e),y.insertOp([t,n,I.order,this._getDrawingOrder(t,n).length],r)].reduce(y.type.compose,null);return{op:i,invertOp:y.type.invertWithDoc(i,this.drawingManagerData)}}_removeByParam(e){if(e==null)return{op:[],invertOp:[]};let{unitId:t,subUnitId:n,drawingId:r}=e;if(this._establishDrawingMap(t,n,r)==null)return{op:[],invertOp:[]};let i=[y.removeOp([t,n,I.data,r],!0),y.removeOp([t,n,I.order,this._getDrawingOrder(t,n).indexOf(r)],!0)].reduce(y.type.compose,null);return{op:i,invertOp:y.type.invertWithDoc(i,this.drawingManagerData)}}_updateByParam(e){let{unitId:t,subUnitId:n,drawingId:r}=e,i=this._establishDrawingMap(t,n,r);if(i==null)return{op:[],invertOp:[]};let a=this._getUpdateParamCompareOp(e,i).reduce(y.type.compose,null);return{op:a,invertOp:y.type.invertWithDoc(a,this.drawingManagerData)}}_getUpdateParamCompareOp(e,t){let{unitId:n,subUnitId:r,drawingId:i}=e,a=[];return Object.keys(e).forEach(o=>{let s=e[o],c=t[o];c!==s&&a.push(y.replaceOp([n,r,I.data,i,o],c,s))}),a}_getDrawingData(e,t){var n;return((n=this.drawingManagerData[e])==null||(n=n[t])==null?void 0:n.data)||{}}_getDrawingOrder(e,t){var n;return((n=this.drawingManagerData[e])==null||(n=n[t])==null?void 0:n.order)||[]}getDrawingVisible(){return this._visible}getDrawingEditable(){return this._editable}setDrawingVisible(e){this._visible=e}setDrawingEditable(e){this._editable=e}},R=class extends L{},z=class{constructor(){F(this,`_waitCount`,0),F(this,`_change$`,new b),F(this,`change$`,this._change$),F(this,`_imageSourceCache`,new Map)}setWaitCount(e){this._waitCount=e,this._change$.next(e)}getImageSourceCache(e,t){if(t===s.BASE64){let t=new Image;return t.src=e,t}return this._imageSourceCache.get(e)}addImageSourceCache(e,t,n){t===s.BASE64||n==null||this._imageSourceCache.set(e,n)}async getImage(e){return Promise.resolve(e)}async saveImage(e){return new Promise((t,n)=>{if(!T.includes(e.type)){n(Error(c.ERROR_IMAGE_TYPE)),this._decreaseWaiting();return}if(e.size>5242880){n(Error(c.ERROR_EXCEED_SIZE)),this._decreaseWaiting();return}let r=new FileReader;r.readAsDataURL(e),r.onload=e=>{var r;let i=(r=e.target)==null?void 0:r.result;if(i==null){n(Error(c.ERROR_IMAGE)),this._decreaseWaiting();return}t({imageId:p(6),imageSourceType:s.BASE64,source:i,base64Cache:i,status:c.SUCCUSS}),this._decreaseWaiting()}})}_decreaseWaiting(){--this._waitCount,this._change$.next(this._waitCount)}},B=class extends t{constructor(...e){super(...e),F(this,`_urlImageDownloader`,null)}registerURLImageDownloader(e){return this._urlImageDownloader=e,v(()=>{this._urlImageDownloader=null})}async getImage(e){if(this._urlImageDownloader)try{return await this._urlImageDownloader(e)}catch(t){console.error(`Custom downloader failed for ${e}, falling back to default behavior:`,t)}return e}async downloadImage(e){if(this._urlImageDownloader)try{let t=await this._urlImageDownloader(e);return await(await fetch(t)).blob()}catch(t){console.error(`Custom downloader failed for ${e}, falling back to default fetch:`,t)}return await(await fetch(e)).blob()}};function V(e,t){return function(n,r){t(n,r,e)}}function H(e,t,n,r){var i=arguments.length,a=i<3?t:r===null?r=Object.getOwnPropertyDescriptor(t,n):r,o;if(typeof Reflect==`object`&&typeof Reflect.decorate==`function`)a=Reflect.decorate(e,t,n,r);else for(var s=e.length-1;s>=0;s--)(o=e[s])&&(a=(i<3?o(a):i>3?o(t,n,a):o(t,n))||a);return i>3&&a&&Object.defineProperty(t,n,a),a}let U=class extends d{constructor(e=j,t,n,r){super(),this._config=e,this._injector=t,this._configService=n,this._commandService=r;let{...i}=m({},j,this._config);this._configService.setConfig(A,i)}onStarting(){this._initCommands(),this._initDependencies()}_initDependencies(){var e;h([[a,{useClass:z}],[o,{useClass:B}],[E,{useClass:R}]],(e=this._config)==null?void 0:e.override).forEach(e=>this._injector.add(e))}_initCommands(){[D].forEach(e=>this.disposeWithMe(this._commandService.registerCommand(e)))}};F(U,`pluginName`,`UNIVER_DRAWING_PLUGIN`),F(U,`packageName`,O),F(U,`version`,k),U=H([V(1,l(u)),V(2,i),V(3,r)],U);function W({unitId:e,subUnitId:t,drawingId:n},r){return typeof r==`number`?`${e}#-#${t}#-#${n}#-#${r}`:`${e}#-#${t}#-#${n}`}const G=async e=>new Promise((t,n)=>{let r=new Image;r.src=e,r.onload=()=>{t({width:r.width,height:r.height,image:r})},r.onerror=e=>{n(e)}});export{T as DRAWING_IMAGE_ALLOW_IMAGE_LIST,w as DRAWING_IMAGE_ALLOW_SIZE,C as DRAWING_IMAGE_COUNT_LIMIT,S as DRAWING_IMAGE_HEIGHT_LIMIT,x as DRAWING_IMAGE_WIDTH_LIMIT,R as DrawingManagerService,E as IDrawingManagerService,a as IImageIoService,z as ImageIoService,s as ImageSourceType,c as ImageUploadStatusType,D as SetDrawingSelectedOperation,B as URLImageService,L as UnitDrawingService,U as UniverDrawingPlugin,W as getDrawingShapeKeyByDrawingSearch,G as getImageSize};