@univerjs/drawing 0.2.1 → 0.2.3

package/lib/es/index.js

@@ -1,59 +1,59 @@
-var Dt = Object.defineProperty;
-var Ut = (t, e, n) => e in t ? Dt(t, e, { enumerable: !0, configurable: !0, writable: !0, value: n }) : t[e] = n;
-var V = (t, e, n) => Ut(t, typeof e != "symbol" ? e + "" : e, n);
+var Pt = Object.defineProperty;
+var Ut = (n, e, t) => e in n ? Pt(n, e, { enumerable: !0, configurable: !0, writable: !0, value: t }) : n[e] = t;
+var V = (n, e, t) => Ut(n, typeof e != "symbol" ? e + "" : e, t);
 import { Subject as we } from "rxjs";
 import { sortRules as Mt, sortRulesByDesc as Nt, Tools as kt, Plugin as Rt, mergeOverrideWithDependencies as St } from "@univerjs/core";
 import { createIdentifier as It, Inject as jt, Injector as Tt } from "@wendellhu/redi";
 const on = 500, ln = 500, an = 10, $t = 5 * 1024 * 1024, Wt = ["image/png", "image/jpeg", "image/jpg", "image/gif", "image/bmp"];
 var Ce = typeof globalThis < "u" ? globalThis : typeof window < "u" ? window : typeof global < "u" ? global : typeof self < "u" ? self : {}, F = {}, Ct = {}, ct = {};
 Object.defineProperty(ct, "__esModule", { value: !0 });
-function Gt(t, e) {
+function Gt(n, e) {
   if (Array.isArray(e))
     return !1;
-  for (let n in t)
-    if (!ut(t[n], e[n]))
+  for (let t in n)
+    if (!ut(n[t], e[t]))
       return !1;
-  for (let n in e)
-    if (t[n] === void 0)
+  for (let t in e)
+    if (n[t] === void 0)
       return !1;
   return !0;
 }
-function Bt(t, e) {
-  if (!Array.isArray(e) || t.length !== e.length)
+function Bt(n, e) {
+  if (!Array.isArray(e) || n.length !== e.length)
     return !1;
-  for (let n = 0; n < t.length; n++)
-    if (!ut(t[n], e[n]))
+  for (let t = 0; t < n.length; t++)
+    if (!ut(n[t], e[t]))
       return !1;
   return !0;
 }
-function ut(t, e) {
-  return t === e ? !0 : t === null || e === null || typeof t != "object" || typeof e != "object" ? !1 : Array.isArray(t) ? Bt(t, e) : Gt(t, e);
+function ut(n, e) {
+  return n === e ? !0 : n === null || e === null || typeof n != "object" || typeof e != "object" ? !1 : Array.isArray(n) ? Bt(n, e) : Gt(n, e);
 }
 ct.default = ut;
 var dt = {};
 Object.defineProperty(dt, "__esModule", { value: !0 });
-function lt(t) {
-  if (t === null)
+function lt(n) {
+  if (n === null)
     return null;
-  if (Array.isArray(t))
-    return t.map(lt);
-  if (typeof t == "object") {
+  if (Array.isArray(n))
+    return n.map(lt);
+  if (typeof n == "object") {
     const e = {};
-    for (let n in t)
-      e[n] = lt(t[n]);
+    for (let t in n)
+      e[t] = lt(n[t]);
     return e;
   } else
-    return t;
+    return n;
 }
 dt.default = lt;
 var ft = {};
-(function(t) {
-  Object.defineProperty(t, "__esModule", { value: !0 }), t.eachChildOf = t.advancer = t.readCursor = t.writeCursor = t.WriteCursor = t.ReadCursor = t.isValidPathItem = void 0;
+(function(n) {
+  Object.defineProperty(n, "__esModule", { value: !0 }), n.eachChildOf = n.advancer = n.readCursor = n.writeCursor = n.WriteCursor = n.ReadCursor = n.isValidPathItem = void 0;
   function e(O, o) {
     if (!O)
       throw new Error(o);
   }
-  const n = (O) => O != null && typeof O == "object" && !Array.isArray(O), s = (O, o) => (
+  const t = (O) => O != null && typeof O == "object" && !Array.isArray(O), s = (O, o) => (
     // All the numbers, then all the letters. Just as the gods of ascii intended.
     typeof O == typeof o ? O > o : typeof O == "string" && typeof o == "number"
   );
@@ -63,19 +63,19 @@ var ft = {};
       o.write(h, O[h]);
     }
   }
-  t.isValidPathItem = (O) => typeof O == "number" || typeof O == "string" && O !== "__proto__";
+  n.isValidPathItem = (O) => typeof O == "number" || typeof O == "string" && O !== "__proto__";
   class d {
     constructor(o = null) {
       this.parents = [], this.indexes = [], this.lcIdx = -1, this.idx = -1, this.container = o;
     }
     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--, n(this.container[this.idx]) && this.idx--);
+      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 o = [];
       let c = this.container, h = this.parents.length - 1, R = this.idx;
       for (; R >= 0; )
-        o.unshift(c[R]), R === 0 ? (R = this.indexes[h * 2], c = this.parents[h--]) : R -= n(c[R - 1]) ? 2 : 1;
+        o.unshift(c[R]), R === 0 ? (R = this.indexes[h * 2], c = this.parents[h--]) : R -= t(c[R - 1]) ? 2 : 1;
       return o;
     }
   }
@@ -89,13 +89,13 @@ var ft = {};
     }
     getComponent() {
       let o;
-      return this.container && this.container.length > this.idx + 1 && n(o = this.container[this.idx + 1]) ? o : null;
+      return this.container && this.container.length > this.idx + 1 && t(o = this.container[this.idx + 1]) ? o : null;
     }
     descendFirst() {
       let o = this.idx + 1;
-      if (!this.container || o >= this.container.length || n(this.container[o]) && o + 1 >= this.container.length)
+      if (!this.container || o >= this.container.length || t(this.container[o]) && o + 1 >= this.container.length)
         return !1;
-      n(this.container[o]) && o++;
+      t(this.container[o]) && o++;
       const c = this.container[o];
       return Array.isArray(c) ? (this.indexes.push(this.idx), this.parents.push(this.container), this.indexes.push(o), this.idx = 0, this.container = c) : this.idx = o, !0;
     }
@@ -140,7 +140,7 @@ var ft = {};
       });
     }
   }
-  t.ReadCursor = l;
+  n.ReadCursor = l;
   class a extends d {
     constructor(o = null) {
       super(o), this.pendingDescent = [], this._op = o;
@@ -150,7 +150,7 @@ var ft = {};
       for (let o = 0; o < this.pendingDescent.length; o++) {
         const c = this.pendingDescent[o];
         let h = this.idx + 1;
-        if (h < this.container.length && n(this.container[h]) && h++, e(h === this.container.length || !n(this.container[h])), h === this.container.length)
+        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;
@@ -180,7 +180,7 @@ var ft = {};
     getComponent() {
       this.flushDescent();
       const o = this.idx + 1;
-      if (o < this.container.length && n(this.container[o]))
+      if (o < this.container.length && t(this.container[o]))
         return this.container[o];
       {
         const c = {};
@@ -195,7 +195,7 @@ var ft = {};
       return this._op;
     }
     descend(o) {
-      if (!t.isValidPathItem(o))
+      if (!n.isValidPathItem(o))
         throw Error("Invalid JSON key");
       this.pendingDescent.push(o);
     }
@@ -239,7 +239,7 @@ var ft = {};
       return o.push(...this.pendingDescent), o;
     }
   }
-  t.WriteCursor = a, t.writeCursor = () => new a(), t.readCursor = (O) => new l(O);
+  n.WriteCursor = a, n.writeCursor = () => new a(), n.readCursor = (O) => new l(O);
   function E(O, o, c) {
     let h, R;
     R = h = O ? O.descendFirst() : !1;
@@ -262,7 +262,7 @@ var ft = {};
       h && O.ascend();
     }, Z;
   }
-  t.advancer = E;
+  n.advancer = E;
   function W(O, o, c) {
     let h, R, Z, pe;
     for (h = R = O && O.descendFirst(), Z = pe = o && o.descendFirst(); h || Z; ) {
@@ -271,39 +271,39 @@ var ft = {};
     }
     R && O.ascend(), pe && o.ascend();
   }
-  t.eachChildOf = W;
+  n.eachChildOf = W;
 })(ft);
 var ht = {};
-(function(t) {
-  Object.defineProperty(t, "__esModule", { value: !0 }), t.ConflictType = void 0, function(e) {
+(function(n) {
+  Object.defineProperty(n, "__esModule", { value: !0 }), n.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";
-  }(t.ConflictType || (t.ConflictType = {}));
+  }(n.ConflictType || (n.ConflictType = {}));
 })(ht);
 var it = {}, Fe = {}, vt;
 function pt() {
-  return vt || (vt = 1, Object.defineProperty(Fe, "__esModule", { value: !0 }), Fe.uniToStrPos = Fe.strPosToUni = void 0, Fe.strPosToUni = (t, e = t.length) => {
-    let n = 0, s = 0;
+  return vt || (vt = 1, Object.defineProperty(Fe, "__esModule", { value: !0 }), Fe.uniToStrPos = Fe.strPosToUni = void 0, Fe.strPosToUni = (n, e = n.length) => {
+    let t = 0, s = 0;
     for (; s < e; s++) {
-      const i = t.charCodeAt(s);
-      i >= 55296 && i <= 57343 && (n++, s++);
+      const i = n.charCodeAt(s);
+      i >= 55296 && i <= 57343 && (t++, s++);
     }
     if (s !== e)
       throw Error("Invalid offset - splits unicode bytes");
-    return s - n;
-  }, Fe.uniToStrPos = (t, e) => {
-    let n = 0;
+    return s - t;
+  }, Fe.uniToStrPos = (n, e) => {
+    let t = 0;
     for (; e > 0; e--) {
-      const s = t.charCodeAt(n);
-      n += s >= 55296 && s <= 57343 ? 2 : 1;
+      const s = n.charCodeAt(t);
+      t += s >= 55296 && s <= 57343 ? 2 : 1;
     }
-    return n;
+    return t;
   }), Fe;
 }
 var st = {}, yt;
 function at() {
-  return yt || (yt = 1, function(t) {
-    Object.defineProperty(t, "__esModule", { value: !0 }), t.uniSlice = t.dlen = t.eachOp = void 0;
-    const e = pt(), n = (f) => {
+  return yt || (yt = 1, function(n) {
+    Object.defineProperty(n, "__esModule", { value: !0 }), n.uniSlice = n.dlen = n.eachOp = void 0;
+    const e = pt(), t = (f) => {
       if (!Array.isArray(f))
         throw Error("Op must be an array of components");
       let _ = null;
@@ -313,7 +313,7 @@ function at() {
           case "object":
             if (typeof L.d != "number" && typeof L.d != "string")
               throw Error("Delete must be number or string");
-            if (t.dlen(L.d) <= 0)
+            if (n.dlen(L.d) <= 0)
               throw Error("Deletes must not be empty");
             break;
           case "string":
@@ -338,7 +338,7 @@ function at() {
         const H = f[z];
         switch (_(H, w, L), typeof H) {
           case "object":
-            w += t.dlen(H.d);
+            w += n.dlen(H.d);
             break;
           case "string":
             L += e.strPosToUni(H);
@@ -349,34 +349,34 @@ function at() {
         }
       }
     }
-    t.eachOp = s;
+    n.eachOp = s;
     function i(f, _) {
       const w = [], L = a(w);
-      return s(f, (z, H, Ae) => {
-        L(_(z, H, Ae));
+      return s(f, (z, H, De) => {
+        L(_(z, H, De));
       }), o(w);
     }
     const d = (f) => f, l = (f) => i(f, d);
-    t.dlen = (f) => typeof f == "number" ? f : e.strPosToUni(f);
+    n.dlen = (f) => typeof f == "number" ? f : e.strPosToUni(f);
     const a = (f) => (_) => {
       if (!(!_ || _.d === 0 || _.d === "")) if (f.length === 0)
         f.push(_);
       else if (typeof _ == typeof f[f.length - 1])
         if (typeof _ == "object") {
           const w = f[f.length - 1];
-          w.d = typeof w.d == "string" && typeof _.d == "string" ? w.d + _.d : t.dlen(w.d) + t.dlen(_.d);
+          w.d = typeof w.d == "string" && typeof _.d == "string" ? w.d + _.d : n.dlen(w.d) + n.dlen(_.d);
         } else
           f[f.length - 1] += _;
       else
         f.push(_);
     }, E = (f) => typeof f == "number" ? f : typeof f == "string" ? e.strPosToUni(f) : typeof f.d == "number" ? f.d : e.strPosToUni(f.d);
-    t.uniSlice = (f, _, w) => {
+    n.uniSlice = (f, _, w) => {
       const L = e.uniToStrPos(f, _), z = w == null ? 1 / 0 : e.uniToStrPos(f, w);
       return f.slice(L, z);
     };
-    const W = (f, _, w) => typeof f == "number" ? w == null ? f - _ : Math.min(f, w) - _ : t.uniSlice(f, _, w), O = (f) => {
+    const W = (f, _, w) => typeof f == "number" ? w == null ? f - _ : Math.min(f, w) - _ : n.uniSlice(f, _, w), O = (f) => {
       let _ = 0, w = 0;
-      return { take: (H, Ae) => {
+      return { take: (H, De) => {
         if (_ === f.length)
           return H === -1 ? null : H;
         const ue = f[_];
@@ -384,14 +384,14 @@ function at() {
         if (typeof ue == "number")
           return H === -1 || ue - w <= H ? (ne = ue - w, ++_, w = 0, ne) : (w += H, H);
         if (typeof ue == "string") {
-          if (H === -1 || Ae === "i" || e.strPosToUni(ue.slice(w)) <= H)
+          if (H === -1 || De === "i" || e.strPosToUni(ue.slice(w)) <= H)
             return ne = ue.slice(w), ++_, w = 0, ne;
           {
             const ae = w + e.uniToStrPos(ue.slice(w), H);
             return ne = ue.slice(w, ae), w = ae, ne;
           }
         } else {
-          if (H === -1 || Ae === "d" || t.dlen(ue.d) - w <= H)
+          if (H === -1 || De === "d" || n.dlen(ue.d) - w <= H)
             return ne = { d: W(ue.d, w) }, ++_, w = 0, ne;
           {
             let ae = W(ue.d, w, w + H);
@@ -403,30 +403,30 @@ function at() {
     function c(f, _, w) {
       if (w !== "left" && w !== "right")
         throw Error("side (" + w + ") must be 'left' or 'right'");
-      n(f), n(_);
-      const L = [], z = a(L), { take: H, peek: Ae } = O(f);
+      t(f), t(_);
+      const L = [], z = a(L), { take: H, peek: De } = O(f);
       for (let ne = 0; ne < _.length; ne++) {
         const ae = _[ne];
-        let ge, Pe;
+        let ge, Ae;
         switch (typeof ae) {
           case "number":
             for (ge = ae; ge > 0; )
-              Pe = H(ge, "i"), z(Pe), typeof Pe != "string" && (ge -= E(Pe));
+              Ae = H(ge, "i"), z(Ae), typeof Ae != "string" && (ge -= E(Ae));
             break;
           case "string":
-            w === "left" && typeof Ae() == "string" && z(H(-1)), z(e.strPosToUni(ae));
+            w === "left" && typeof De() == "string" && z(H(-1)), z(e.strPosToUni(ae));
             break;
           case "object":
-            for (ge = t.dlen(ae.d); ge > 0; )
-              switch (Pe = H(ge, "i"), typeof Pe) {
+            for (ge = n.dlen(ae.d); ge > 0; )
+              switch (Ae = H(ge, "i"), typeof Ae) {
                 case "number":
-                  ge -= Pe;
+                  ge -= Ae;
                   break;
                 case "string":
-                  z(Pe);
+                  z(Ae);
                   break;
                 case "object":
-                  ge -= t.dlen(Pe.d);
+                  ge -= n.dlen(Ae.d);
               }
             break;
         }
@@ -437,10 +437,10 @@ function at() {
       return o(L);
     }
     function h(f, _) {
-      n(f), n(_);
+      t(f), t(_);
       const w = [], L = a(w), { take: z } = O(f);
-      for (let Ae = 0; Ae < _.length; Ae++) {
-        const ue = _[Ae];
+      for (let De = 0; De < _.length; De++) {
+        const ue = _[De];
         let ne, ae;
         switch (typeof ue) {
           case "number":
@@ -451,7 +451,7 @@ function at() {
             L(ue);
             break;
           case "object":
-            ne = t.dlen(ue.d);
+            ne = n.dlen(ue.d);
             let ge = 0;
             for (; ge < ne; )
               switch (ae = z(ne - ge, "d"), typeof ae) {
@@ -486,7 +486,7 @@ function at() {
             w += H, f += H;
             break;
           case "object":
-            f -= Math.min(t.dlen(z.d), f - w);
+            f -= Math.min(n.dlen(z.d), f - w);
             break;
         }
       }
@@ -524,7 +524,7 @@ function at() {
         uri: "http://sharejs.org/types/text-unicode",
         trim: o,
         normalize: l,
-        checkOp: n,
+        checkOp: t,
         /** Create a new text snapshot.
          *
          * @param {string} initial - initial snapshot data. Optional. Defaults to ''.
@@ -538,7 +538,7 @@ function at() {
         /** Apply an operation to a document snapshot
          */
         apply(_, w) {
-          n(w);
+          t(w);
           const L = f.builder(_);
           for (let z = 0; z < w.length; z++) {
             const H = w[z];
@@ -550,7 +550,7 @@ function at() {
                 L.append(H);
                 break;
               case "object":
-                L.del(t.dlen(H.d));
+                L.del(n.dlen(H.d));
                 break;
             }
           }
@@ -572,15 +572,15 @@ function at() {
         isNoop: (_) => _.length === 0
       };
     }
-    t.default = ve;
+    n.default = ve;
   }(st)), st;
 }
 var Qe = {}, bt;
 function xt() {
   if (bt) return Qe;
   bt = 1, Object.defineProperty(Qe, "__esModule", { value: !0 });
-  const t = at(), e = pt();
-  function n(s, i) {
+  const n = at(), e = pt();
+  function t(s, i) {
     return {
       // Returns the text content of the document
       get: s,
@@ -602,13 +602,13 @@ function xt() {
       //onInsert: function(pos, text) {},
       //onRemove: function(pos, removedLength) {},
       _onOp(d) {
-        t.eachOp(d, (l, a, E) => {
+        n.eachOp(d, (l, a, E) => {
           switch (typeof l) {
             case "string":
               this.onInsert && this.onInsert(E, l);
               break;
             case "object":
-              const W = t.dlen(l.d);
+              const W = n.dlen(l.d);
               this.onRemove && this.onRemove(E, W);
           }
         });
@@ -617,18 +617,18 @@ function xt() {
       onRemove: null
     };
   }
-  return Qe.default = n, n.provides = { text: !0 }, Qe;
+  return Qe.default = t, t.provides = { text: !0 }, Qe;
 }
 var mt;
 function Lt() {
-  return mt || (mt = 1, function(t) {
+  return mt || (mt = 1, function(n) {
     var e = Ce && Ce.__createBinding || (Object.create ? function(c, h, R, Z) {
       Z === void 0 && (Z = R), Object.defineProperty(c, Z, { enumerable: !0, get: function() {
         return h[R];
       } });
     } : function(c, h, R, Z) {
       Z === void 0 && (Z = R), c[Z] = h[R];
-    }), n = Ce && Ce.__setModuleDefault || (Object.create ? function(c, h) {
+    }), t = Ce && Ce.__setModuleDefault || (Object.create ? function(c, h) {
       Object.defineProperty(c, "default", { enumerable: !0, value: h });
     } : function(c, h) {
       c.default = h;
@@ -636,11 +636,11 @@ function Lt() {
       if (c && c.__esModule) return c;
       var h = {};
       if (c != null) for (var R in c) Object.hasOwnProperty.call(c, R) && e(h, c, R);
-      return n(h, c), h;
+      return t(h, c), h;
     }, i = Ce && Ce.__importDefault || function(c) {
       return c && c.__esModule ? c : { default: c };
     };
-    Object.defineProperty(t, "__esModule", { value: !0 }), t.type = t.remove = t.insert = void 0;
+    Object.defineProperty(n, "__esModule", { value: !0 }), n.type = n.remove = n.insert = void 0;
     const d = pt(), l = s(at()), a = i(xt()), E = {
       create(c) {
         return c;
@@ -672,27 +672,27 @@ function Lt() {
       },
       slice: l.uniSlice
     }, W = l.default(E), O = Object.assign(Object.assign({}, W), { api: a.default });
-    t.type = O, t.insert = (c, h) => h.length === 0 ? [] : c === 0 ? [h] : [c, h], t.remove = (c, h) => l.dlen(h) === 0 ? [] : c === 0 ? [{ d: h }] : [c, { d: h }];
+    n.type = O, n.insert = (c, h) => h.length === 0 ? [] : c === 0 ? [h] : [c, h], n.remove = (c, h) => l.dlen(h) === 0 ? [] : c === 0 ? [{ d: h }] : [c, { d: h }];
     var o = at();
-    Object.defineProperty(t, "makeType", { enumerable: !0, get: function() {
+    Object.defineProperty(n, "makeType", { enumerable: !0, get: function() {
       return o.default;
     } });
   }(it)), it;
 }
-(function(t) {
+(function(n) {
   var e = Ce && Ce.__importDefault || function(r) {
     return r && r.__esModule ? r : {
       default: r
     };
   };
-  Object.defineProperty(t, "__esModule", {
+  Object.defineProperty(n, "__esModule", {
     value: !0
-  }), t.editOp = t.replaceOp = t.insertOp = t.moveOp = t.removeOp = t.type = void 0;
-  const n = e(ct), s = e(dt), i = ft, d = ht;
+  }), n.editOp = n.replaceOp = n.insertOp = n.moveOp = n.removeOp = n.type = void 0;
+  const t = e(ct), s = e(dt), i = ft, d = ht;
   function l(r, u) {
     if (!r) throw new Error(u);
   }
-  t.type = {
+  n.type = {
     name: "json1",
     uri: "http://sharejs.org/types/JSONv1",
     readCursor: i.readCursor,
@@ -704,20 +704,20 @@ function Lt() {
     registerSubtype: J,
     checkValidOp: z,
     normalize: H,
-    apply: Ae,
+    apply: De,
     transformPosition: ue,
     compose: ne,
     tryTransform: nt,
-    transform: At,
-    makeInvertible: Pe,
+    transform: Dt,
+    makeInvertible: Ae,
     invert: ae,
     invertWithDoc: Et,
     RM_UNEXPECTED_CONTENT: d.ConflictType.RM_UNEXPECTED_CONTENT,
     DROP_COLLISION: d.ConflictType.DROP_COLLISION,
     BLACKHOLE: d.ConflictType.BLACKHOLE,
     transformNoConflict: (r, u, y) => _t(() => !0, r, u, y),
-    typeAllowingConflictsPred: (r) => Object.assign(Object.assign({}, t.type), {
-      transform: (u, y, A) => _t(r, u, y, A)
+    typeAllowingConflictsPred: (r) => Object.assign(Object.assign({}, n.type), {
+      transform: (u, y, D) => _t(r, u, y, D)
     })
   };
   const a = (r) => r ? r.getComponent() : null;
@@ -731,9 +731,9 @@ function Lt() {
   function h(r, u, y) {
     return typeof u == "number" ? (l(r != null, "Container is missing for key"), l(Array.isArray(r), "Cannot use numerical key for object container"), l(r.length >= u, "Cannot insert into out of bounds index"), r.splice(u, 0, y)) : (l(E(r), "Cannot insert into missing item"), l(r[u] === void 0, "Trying to overwrite value at key. Your op needs to remove it first"), r[u] = y), y;
   }
-  t.removeOp = (r, u = !0) => i.writeCursor().writeAtPath(r, "r", u).get(), t.moveOp = (r, u) => i.writeCursor().writeMove(r, u).get(), t.insertOp = (r, u) => i.writeCursor().writeAtPath(r, "i", u).get(), t.replaceOp = (r, u, y) => i.writeCursor().at(r, (A) => {
-    A.write("r", u), A.write("i", y);
-  }).get(), t.editOp = (r, u, y, A = !1) => i.writeCursor().at(r, (b) => _(b, u, y, A)).get();
+  n.removeOp = (r, u = !0) => i.writeCursor().writeAtPath(r, "r", u).get(), n.moveOp = (r, u) => i.writeCursor().writeMove(r, u).get(), n.insertOp = (r, u) => i.writeCursor().writeAtPath(r, "i", u).get(), n.replaceOp = (r, u, y) => i.writeCursor().at(r, (D) => {
+    D.write("r", u), D.write("i", y);
+  }).get(), n.editOp = (r, u, y, D = !1) => i.writeCursor().at(r, (b) => _(b, u, y, D)).get();
   const R = (r, u) => r != null && (typeof u == "number" ? Array.isArray(r) : typeof r == "object"), Z = (r, u) => R(r, u) ? r[u] : void 0, pe = {};
   function J(r) {
     let u = r.type ? r.type : r;
@@ -753,9 +753,9 @@ function Lt() {
     invert: (r) => -r,
     transform: (r) => r
   });
-  const ve = (r) => r == null ? null : r.et ? Ie(r.et) : r.es ? pe["text-unicode"] : r.ena != null ? pe.number : null, f = (r) => r.es ? r.es : r.ena != null ? r.ena : r.e, _ = (r, u, y, A = !1) => {
+  const ve = (r) => r == null ? null : r.et ? Ie(r.et) : r.es ? pe["text-unicode"] : r.ena != null ? pe.number : null, f = (r) => r.es ? r.es : r.ena != null ? r.ena : r.e, _ = (r, u, y, D = !1) => {
     const [b, C] = typeof u == "string" ? [Ie(u), u] : [u, u.name];
-    !A && b.isNoop && b.isNoop(y) || (C === "number" ? r.write("ena", y) : C === "text-unicode" ? r.write("es", y) : (r.write("et", C), r.write("e", y)));
+    !D && b.isNoop && b.isNoop(y) || (C === "number" ? r.write("ena", y) : C === "text-unicode" ? r.write("es", y) : (r.write("et", C), r.write("e", y)));
   };
   function w(r) {
     l(typeof r == "number"), l(r >= 0), l(r === (0 | r));
@@ -765,7 +765,7 @@ function Lt() {
   }
   function z(r) {
     if (r === null) return;
-    const u = /* @__PURE__ */ new Set(), y = /* @__PURE__ */ new Set(), A = (C) => {
+    const u = /* @__PURE__ */ new Set(), y = /* @__PURE__ */ new Set(), D = (C) => {
       let $ = !0, j = !1;
       for (let p in C) {
         const v = C[p];
@@ -792,7 +792,7 @@ function Lt() {
             g === N ? l(m < G, "descent keys are not in order") : l(g === "number" && N === "string");
           }
           m = G, v++, p = 3;
-        } else typeof T == "object" ? (l(p === 1, `Prev not scalar - instead ${p}`), A(T), p = 2) : (l(p !== 3), L(T), l(i.isValidPathItem(T), "Invalid path key"), p = 1);
+        } else typeof T == "object" ? (l(p === 1, `Prev not scalar - instead ${p}`), D(T), p = 2) : (l(p !== 3), L(T), l(i.isValidPathItem(T), "Invalid path key"), p = 1);
       }
       return l(v !== 1, "Operation makes multiple descents. Remove some []"), l(p === 2 || p === 3), C[0];
     };
@@ -801,8 +801,8 @@ function Lt() {
   }
   function H(r) {
     let u = 0, y = [];
-    const A = i.writeCursor();
-    return A.mergeTree(r, (b, C) => {
+    const D = i.writeCursor();
+    return D.mergeTree(r, (b, C) => {
       const $ = ve(b);
       if ($) {
         const p = f(b);
@@ -813,12 +813,12 @@ function Lt() {
         C.write(p, v);
       }
       var j;
-    }), A.get();
+    }), D.get();
   }
-  function Ae(r, u) {
+  function De(r, u) {
     if (z(u), u === null) return r;
     const y = [];
-    return function A(b, C) {
+    return function D(b, C) {
       let $ = b, j = 0, p = {
         root: b
       }, v = 0, m = p, I = "root";
@@ -831,7 +831,7 @@ function Lt() {
       for (; j < C.length; j++) {
         const G = C[j];
         if (Array.isArray(G)) {
-          const g = A($, G);
+          const g = D($, G);
           g !== $ && g !== void 0 && (T(), $ = m[I] = g);
         } else if (typeof G == "object") {
           G.d != null ? (T(), $ = h(m, I, y[G.d])) : G.i !== void 0 && (T(), $ = h(m, I, G.i));
@@ -841,7 +841,7 @@ function Lt() {
         } else $ = Z($, G);
       }
       return p.root;
-    }(r = function A(b, C) {
+    }(r = function D(b, C) {
       const $ = [];
       let j = 0;
       for (; j < C.length; j++) {
@@ -849,7 +849,7 @@ function Lt() {
         if (Array.isArray(I)) break;
         typeof I != "object" && ($.push(b), b = Z(b, I));
       }
-      for (let I = C.length - 1; I >= j; I--) b = A(b, C[I]);
+      for (let I = C.length - 1; I >= j; I--) b = D(b, C[I]);
       for (--j; j >= 0; j--) {
         const I = C[j];
         if (typeof I != "object") {
@@ -864,11 +864,11 @@ function Lt() {
   function ue(r, u) {
     r = r.slice(), z(u);
     const y = i.readCursor(u);
-    let A, b, C = !1;
+    let D, b, C = !1;
     const $ = [];
     for (let p = 0; ; p++) {
       const v = r[p], m = y.getComponent();
-      if (m && (m.r !== void 0 ? C = !0 : m.p != null && (C = !1, A = m.p, b = p)), p >= r.length) break;
+      if (m && (m.r !== void 0 ? C = !0 : m.p != null && (C = !1, D = m.p, b = p)), p >= r.length) break;
       let I = 0;
       const T = i.advancer(y, void 0, (g, N) => {
         O(N) && I++;
@@ -880,7 +880,7 @@ function Lt() {
     if ($.forEach((p) => p.end()), C) return null;
     const j = () => {
       let p = 0;
-      if (A != null) {
+      if (D != null) {
         const v = y.getPath();
         p = v.length, r = v.concat(r.slice(b));
       }
@@ -898,80 +898,80 @@ function Lt() {
         if (typeof v == "number" && (r[p] += T), !G) break;
       }
     };
-    return A != null ? y.eachDrop(null, (p) => {
-      p === A && j();
+    return D != null ? y.eachDrop(null, (p) => {
+      p === D && j();
     }) : j(), r;
   }
   function ne(r, u) {
     if (z(r), z(u), r == null) return u;
     if (u == null) return r;
     let y = 0;
-    const A = i.readCursor(r), b = i.readCursor(u), C = i.writeCursor(), $ = [], j = [], p = [], v = [], m = [], I = [], T = /* @__PURE__ */ new Set();
-    A.traverse(null, (g) => {
-      g.p != null && (p[g.p] = A.clone());
+    const D = i.readCursor(r), b = i.readCursor(u), C = i.writeCursor(), $ = [], j = [], p = [], v = [], m = [], I = [], T = /* @__PURE__ */ new Set();
+    D.traverse(null, (g) => {
+      g.p != null && (p[g.p] = D.clone());
     }), b.traverse(null, (g) => {
       g.d != null && (v[g.d] = b.clone());
     });
     const G = i.writeCursor();
     return function g(N, re, te, K, se, Te, be, _e) {
       l(re || te);
-      const oe = a(re), De = a(te), Me = !!De && De.r !== void 0, Le = !!oe && oe.i !== void 0, Ue = oe ? oe.d : null, Ee = De ? De.p : null, $e = (Te || Me) && Ee == null;
+      const oe = a(re), Pe = a(te), Me = !!Pe && Pe.r !== void 0, Le = !!oe && oe.i !== void 0, Ue = oe ? oe.d : null, Ee = Pe ? Pe.p : null, $e = (Te || Me) && Ee == null;
       if (Ee != null) K = v[Ee], be = j[Ee] = new i.WriteCursor();
-      else if (De && De.r !== void 0) K = null;
+      else if (Pe && Pe.r !== void 0) K = null;
       else {
-        const D = a(K);
-        D && D.d != null && (K = null);
+        const P = a(K);
+        P && P.d != null && (K = null);
       }
       const Q = a(K);
       if (Ue != null) if (N = p[Ue], _e = $[Ue] = new i.WriteCursor(), $e) Te && !Me && _e.write("r", !0);
       else {
-        const D = m[Ue] = y++;
-        be.write("d", D);
+        const P = m[Ue] = y++;
+        be.write("d", P);
       }
       else if (oe && oe.i !== void 0) N = null;
       else {
-        const D = a(N);
-        D && D.p != null && (N = null);
+        const P = a(N);
+        P && P.p != null && (N = null);
       }
       let U;
       Le ? (l(se === void 0), U = oe.i) : U = se;
       const B = (Ee == null ? !Le || Te || Me : U === void 0) ? null : be.getComponent();
       if (Ee != null) {
         if (!(se !== void 0 || Le)) {
-          const D = Ue != null ? m[Ue] : y++;
-          I[Ee] = D, _e.write("p", D);
+          const P = Ue != null ? m[Ue] : y++;
+          I[Ee] = P, _e.write("p", P);
         }
-      } else Me && (Le || se !== void 0 || (De.r, _e.write("r", De.r)));
-      const M = $e ? null : ve(oe), P = ve(Q);
-      if ((M || P) && (M && M.name, P && P.name), M && P) {
-        l(M === P);
-        const D = f(oe), x = f(Q), he = M.compose(D, x);
+      } else Me && (Le || se !== void 0 || (Pe.r, _e.write("r", Pe.r)));
+      const M = $e ? null : ve(oe), A = ve(Q);
+      if ((M || A) && (M && M.name, A && A.name), M && A) {
+        l(M === A);
+        const P = f(oe), x = f(Q), he = M.compose(P, x);
         _(be, M, he), T.add(Q);
-      } else M ? _(be, M, f(oe)) : P && (_(be, P, f(Q)), T.add(Q));
+      } else M ? _(be, M, f(oe)) : A && (_(be, A, f(Q)), T.add(Q));
       const k = typeof U == "object" && U != null;
       let X = !1, Y = 0, ee = 0, fe = 0, de = 0, le = 0;
-      const ye = i.advancer(K, (D, x) => o(x) ? de - D - 1 : D - de, (D, x) => {
+      const ye = i.advancer(K, (P, x) => o(x) ? de - P - 1 : P - de, (P, x) => {
         o(x) && de++;
-      }), q = i.advancer(N, (D, x) => O(x) ? Y - D - 1 : D - Y, (D, x) => {
+      }), q = i.advancer(N, (P, x) => O(x) ? Y - P - 1 : P - Y, (P, x) => {
         O(x) && Y++;
       });
-      if (i.eachChildOf(re, te, (D, x, he) => {
-        let me, We, He = D, Ne = D, Ye = D;
-        if (typeof D == "number") {
-          let Oe = D + fe;
+      if (i.eachChildOf(re, te, (P, x, he) => {
+        let me, We, He = P, Ne = P, Ye = P;
+        if (typeof P == "number") {
+          let Oe = P + fe;
           We = ye(Oe), Ne = Oe + de;
-          let ce = D + ee;
-          me = q(ce), o(a(We)) && (me = null), He = ce + Y, Ye = D + le, l(He >= 0, "p1PickKey is negative"), l(Ne >= 0, "p2DropKey is negative");
+          let ce = P + ee;
+          me = q(ce), o(a(We)) && (me = null), He = ce + Y, Ye = P + le, l(He >= 0, "p1PickKey is negative"), l(Ne >= 0, "p2DropKey is negative");
           const ke = o(a(x)), Ge = O(a(he));
           (ke || Ge && !$e) && le--, ke && ee--, Ge && fe--;
-        } else me = q(D), We = ye(D);
+        } else me = q(P), We = ye(P);
         _e.descend(He), be.descend(Ne);
         const ze = k && !o(a(x)) ? U[Ye] : void 0, Se = g(me, x, he, We, ze, $e, be, _e);
         var je, S, ie;
         k && !$e ? ze !== Se && (X || (U = Array.isArray(U) ? U.slice() : Object.assign({}, U), X = !0), je = U, ie = Se, typeof (S = Ye) == "number" ? (l(Array.isArray(je)), l(S < je.length)) : (l(!Array.isArray(je)), l(je[S] !== void 0)), ie === void 0 ? typeof S == "number" ? je.splice(S, 1) : delete je[S] : je[S] = ie) : l(Se === void 0), be.ascend(), _e.ascend();
       }), q.end(), ye.end(), B != null) B.i = U;
       else if (!Te && !Me && Ee == null) return U;
-    }(A, A.clone(), b, b.clone(), void 0, !1, C, G), C.reset(), C.mergeTree(G.get()), C.reset(), C.get(), $.map((g) => g.get()), j.map((g) => g.get()), A.traverse(C, (g, N) => {
+    }(D, D.clone(), b, b.clone(), void 0, !1, C, G), C.reset(), C.mergeTree(G.get()), C.reset(), C.get(), $.map((g) => g.get()), j.map((g) => g.get()), D.traverse(C, (g, N) => {
       const re = g.p;
       if (re != null) {
         const te = m[re];
@@ -994,7 +994,7 @@ function Lt() {
   function ae(r) {
     if (r == null) return null;
     const u = new i.ReadCursor(r), y = new i.WriteCursor();
-    let A;
+    let D;
     const b = [], C = [];
     return function $(j, p, v) {
       const m = j.getComponent();
@@ -1002,7 +1002,7 @@ function Lt() {
       if (m) {
         m.p != null && (p.write("d", m.p), b[m.p] = j.clone()), m.r !== void 0 && p.write("i", m.r), m.d != null && (p.write("p", m.d), v = void 0), m.i !== void 0 && (v = I = m.i);
         const g = ve(m);
-        g && (v === void 0 ? (A || (A = /* @__PURE__ */ new Set()), A.add(m)) : (f(m), v = g.apply(v, f(m)), T = !0));
+        g && (v === void 0 ? (D || (D = /* @__PURE__ */ new Set()), D.add(m)) : (f(m), v = g.apply(v, f(m)), T = !0));
       }
       let G = 0;
       for (const g of j) {
@@ -1018,11 +1018,11 @@ function Lt() {
       }
       if (I === void 0) return T ? v : void 0;
       p.write("r", v);
-    }(u, y, void 0), A && (y.reset(), function $(j, p, v) {
+    }(u, y, void 0), D && (y.reset(), function $(j, p, v) {
       const m = p.getComponent();
       if (m) {
         const g = m.d;
-        if (g != null && (j = b[g], v = C[g] = i.writeCursor()), A.has(m)) {
+        if (g != null && (j = b[g], v = C[g] = i.writeCursor()), D.has(m)) {
           const N = ve(m);
           if (!N.invert) throw Error(`Cannot invert subtype ${N.name}`);
           _(v, N, N.invert(f(m)));
@@ -1046,12 +1046,12 @@ function Lt() {
     }))), y.get();
   }
   const ge = (r, u) => r.some((y) => typeof y == "object" && (Array.isArray(y) ? ge(y, u) : u(y)));
-  function Pe(r, u) {
+  function Ae(r, u) {
     if (r == null || !ge(r, (p) => {
       var v;
       return p.r !== void 0 || ((v = ve(p)) === null || v === void 0 ? void 0 : v.makeInvertible) != null;
     })) return r;
-    const y = new i.ReadCursor(r), A = new i.WriteCursor();
+    const y = new i.ReadCursor(r), D = new i.WriteCursor();
     let b = !1;
     const C = [], $ = [], j = (p, v, m) => {
       const I = p.getComponent();
@@ -1071,7 +1071,7 @@ function Lt() {
       }
       return I && (I.r !== void 0 ? (v.write("r", s.default(m)), m = void 0) : I.p != null && (m = void 0)), m;
     };
-    return j(y, A, u), A.get(), b && (A.reset(), function p(v, m, I, T, G) {
+    return j(y, D, u), D.get(), b && (D.reset(), function p(v, m, I, T, G) {
       const g = m.getComponent();
       if (g) {
         g.i !== void 0 ? (T = g.i, G = !0) : g.d != null && (T = $[g.d], v = C[g.d], G = !1, g.d);
@@ -1093,23 +1093,23 @@ function Lt() {
         I.descend(K), p(te(K), m, I, se, G), I.ascend();
       }
       te.end();
-    }(y.clone(), y, A, u, !1)), A.get();
+    }(y.clone(), y, D, u, !1)), D.get();
   }
   function Et(r, u) {
-    return ae(Pe(r, u));
+    return ae(Ae(r, u));
   }
   const tt = (r) => {
     if (r == null) return null;
     const u = r.slice();
     for (let y = 0; y < r.length; y++) {
-      const A = u[y];
-      Array.isArray(A) && (u[y] = tt(A));
+      const D = u[y];
+      Array.isArray(D) && (u[y] = tt(D));
     }
     return u;
   };
   function nt(r, u, y) {
     l(y === "left" || y === "right", "Direction must be left or right");
-    const A = y === "left" ? 0 : 1;
+    const D = y === "left" ? 0 : 1;
     if (u == null) return {
       ok: !0,
       result: r
@@ -1120,121 +1120,121 @@ function Lt() {
     let Te = 0;
     const be = i.readCursor(r), _e = i.readCursor(u), oe = i.writeCursor();
     if (function Q(U, B = null, M) {
-      const P = a(B);
-      P && (P.r !== void 0 ? M = B.clone() : P.p != null && (M = null, m[P.p] = U.clone()));
+      const A = a(B);
+      A && (A.r !== void 0 ? M = B.clone() : A.p != null && (M = null, m[A.p] = U.clone()));
       const k = U.getComponent();
       let X;
-      k && (X = k.p) != null && (v[X] = B ? B.clone() : null, j[X] = U.clone(), M && (g[X] = !0, G[X] = M), P && P.p != null && (K[X] = P.p));
+      k && (X = k.p) != null && (v[X] = B ? B.clone() : null, j[X] = U.clone(), M && (g[X] = !0, G[X] = M), A && A.p != null && (K[X] = A.p));
       const Y = i.advancer(B);
       for (const ee of U) Q(U, Y(ee), M);
       Y.end();
-    }(_e, be, null), function Q(U, B, M, P, k) {
+    }(_e, be, null), function Q(U, B, M, A, k) {
       const X = M.getComponent();
       let Y, ee = !1;
-      X && ((Y = X.d) != null ? (p[Y] = M.clone(), P != null && (se[P] == null && (se[P] = []), se[P].push(Y)), U = v[Y] || null, B = j[Y] || null, g[Y] ? (k && (N[Y] = !0), k = G[Y] || null) : !k || A !== 1 && K[Y] != null || b == null && (b = {
+      X && ((Y = X.d) != null ? (p[Y] = M.clone(), A != null && (se[A] == null && (se[A] = []), se[A].push(Y)), U = v[Y] || null, B = j[Y] || null, g[Y] ? (k && (N[Y] = !0), k = G[Y] || null) : !k || D !== 1 && K[Y] != null || b == null && (b = {
         type: d.ConflictType.RM_UNEXPECTED_CONTENT,
-        op1: t.removeOp(k.getPath()),
-        op2: t.moveOp(B.getPath(), M.getPath())
+        op1: n.removeOp(k.getPath()),
+        op2: n.moveOp(B.getPath(), M.getPath())
       }), ee = !0) : X.i !== void 0 && (U = B = null, ee = !0, k && b == null && (b = {
         type: d.ConflictType.RM_UNEXPECTED_CONTENT,
-        op1: t.removeOp(k.getPath()),
-        op2: t.insertOp(M.getPath(), X.i)
+        op1: n.removeOp(k.getPath()),
+        op2: n.insertOp(M.getPath(), X.i)
       })));
       const fe = a(U);
-      fe && (fe.r !== void 0 ? k = U.clone() : fe.p != null && (fe.p, P = fe.p, k = null));
+      fe && (fe.r !== void 0 ? k = U.clone() : fe.p != null && (fe.p, A = fe.p, k = null));
       const de = ve(X);
       de && k && b == null && (b = {
         type: d.ConflictType.RM_UNEXPECTED_CONTENT,
-        op1: t.removeOp(k.getPath()),
-        op2: t.editOp(M.getPath(), de, f(X), !0)
+        op1: n.removeOp(k.getPath()),
+        op2: n.editOp(M.getPath(), de, f(X), !0)
       });
       let le = 0, ye = 0;
       const q = i.advancer(B, (x, he) => O(he) ? le - x - 1 : x - le, (x, he) => {
         O(he) && le++;
-      }), D = i.advancer(U);
+      }), P = i.advancer(U);
       for (const x of M) if (typeof x == "number") {
         const he = x - ye, me = q(he);
-        ye += +Q(D(he + le), me, M, P, k);
+        ye += +Q(P(he + le), me, M, A, k);
       } else {
         const he = q(x);
-        Q(D(x), he, M, P, k);
+        Q(P(x), he, M, A, k);
       }
-      return q.end(), D.end(), ee;
+      return q.end(), P.end(), ee;
     }(be, _e, _e.clone(), null, null), p.map((Q) => Q && Q.get()), b) return {
       ok: !1,
       conflict: b
     };
     N.map((Q) => !!Q);
-    const De = [];
+    const Pe = [];
     let Me = null;
-    (function Q(U, B, M, P, k) {
+    (function Q(U, B, M, A, k) {
       let X = !1;
       const Y = a(B);
       if (O(Y)) {
         const q = Y.p;
-        q != null ? (M = p[q], P = re[q] = i.writeCursor(), X = !0, k = null) : (M = null, k = B.clone());
+        q != null ? (M = p[q], A = re[q] = i.writeCursor(), X = !0, k = null) : (M = null, k = B.clone());
       } else o(a(M)) && (M = null);
       const ee = U.getComponent();
       if (ee) {
         const q = ee.p;
-        q != null ? (k && (T[q] = k), De[q] = k || A === 1 && X ? null : P.getComponent(), C[q] = U.clone(), M && (I[q] = M.clone())) : ee.r !== void 0 && (k || P.write("r", !0), (k || X) && (Me == null && (Me = /* @__PURE__ */ new Set()), Me.add(ee)));
+        q != null ? (k && (T[q] = k), Pe[q] = k || D === 1 && X ? null : A.getComponent(), C[q] = U.clone(), M && (I[q] = M.clone())) : ee.r !== void 0 && (k || A.write("r", !0), (k || X) && (Me == null && (Me = /* @__PURE__ */ new Set()), Me.add(ee)));
       }
       let fe = 0, de = 0;
-      const le = i.advancer(B, void 0, (q, D) => {
-        O(D) && fe++;
-      }), ye = i.advancer(M, (q, D) => o(D) ? ~(q - de) : q - de, (q, D) => {
-        o(D) && de++;
+      const le = i.advancer(B, void 0, (q, P) => {
+        O(P) && fe++;
+      }), ye = i.advancer(M, (q, P) => o(P) ? ~(q - de) : q - de, (q, P) => {
+        o(P) && de++;
       });
       if (U) for (const q of U) if (typeof q == "string") {
-        const D = le(q), x = ye(q);
-        P.descend(q), Q(U, D, x, P, k), P.ascend();
+        const P = le(q), x = ye(q);
+        A.descend(q), Q(U, P, x, A, k), A.ascend();
       } else {
-        const D = le(q), x = q - fe, he = O(a(D)) ? null : ye(x), me = x + de;
-        l(me >= 0), P.descend(me), Q(U, D, he, P, k), P.ascend();
+        const P = le(q), x = q - fe, he = O(a(P)) ? null : ye(x), me = x + de;
+        l(me >= 0), A.descend(me), Q(U, P, he, A, k), A.ascend();
       }
       le.end(), ye.end();
     })(be, _e, _e.clone(), oe, null), oe.reset();
     let Le = [];
-    if (function Q(U, B, M, P, k, X) {
+    if (function Q(U, B, M, A, k, X) {
       l(B);
       const Y = B.getComponent();
-      let ee = a(P), fe = !1;
-      const de = (S, ie, Oe) => S ? t.moveOp(S.getPath(), ie.getPath()) : t.insertOp(ie.getPath(), Oe.i);
+      let ee = a(A), fe = !1;
+      const de = (S, ie, Oe) => S ? n.moveOp(S.getPath(), ie.getPath()) : n.insertOp(ie.getPath(), Oe.i);
       if (o(Y)) {
         const S = Y.d;
         S != null && ($[S] = B.clone());
-        const ie = S != null ? De[S] : null;
+        const ie = S != null ? Pe[S] : null;
         let Oe = !1;
         if (Y.i !== void 0 || S != null && ie) {
           let ce;
-          ee && (ee.i !== void 0 || (ce = ee.d) != null && !g[ce]) && (Oe = ce != null ? S != null && S === K[ce] : n.default(ee.i, Y.i), Oe || ce != null && A !== 1 && K[ce] != null || b == null && (b = {
+          ee && (ee.i !== void 0 || (ce = ee.d) != null && !g[ce]) && (Oe = ce != null ? S != null && S === K[ce] : t.default(ee.i, Y.i), Oe || ce != null && D !== 1 && K[ce] != null || b == null && (b = {
             type: d.ConflictType.DROP_COLLISION,
             op1: de(S != null ? C[S] : null, B, Y),
-            op2: de(ce != null ? j[ce] : null, P, ee)
+            op2: de(ce != null ? j[ce] : null, A, ee)
           })), Oe || (X ? b == null && (b = {
             type: d.ConflictType.RM_UNEXPECTED_CONTENT,
             op1: de(S != null ? C[S] : null, B, Y),
-            op2: t.removeOp(X.getPath())
+            op2: n.removeOp(X.getPath())
           }) : (S != null ? (Le[Te] = S, k.write("d", ie.p = Te++)) : k.write("i", s.default(Y.i)), fe = !0));
         } else if (S != null && !ie) {
           const ce = T[S];
           ce && (X = ce.clone());
         }
-        S != null ? (U = C[S], M = m[S], P = I[S]) : Y.i !== void 0 && (U = M = null, Oe || (P = null));
-      } else O(a(U)) && (U = M = P = null);
+        S != null ? (U = C[S], M = m[S], A = I[S]) : Y.i !== void 0 && (U = M = null, Oe || (A = null));
+      } else O(a(U)) && (U = M = A = null);
       const le = a(U), ye = a(M);
       if (O(ye)) {
         const S = ye.p;
-        ye.r !== void 0 && (!le || le.r === void 0) || g[S] ? (P = null, X = M.clone()) : S != null && (P = p[S], A !== 1 && K[S] != null || ((k = te[S]) || (k = te[S] = i.writeCursor()), k.reset(), X = null));
-      } else !o(Y) && o(ee) && (P = null);
-      ee = P != null ? P.getComponent() : null;
+        ye.r !== void 0 && (!le || le.r === void 0) || g[S] ? (A = null, X = M.clone()) : S != null && (A = p[S], D !== 1 && K[S] != null || ((k = te[S]) || (k = te[S] = i.writeCursor()), k.reset(), X = null));
+      } else !o(Y) && o(ee) && (A = null);
+      ee = A != null ? A.getComponent() : null;
       const q = ve(Y);
       if (q) {
         const S = f(Y);
         if (X) b == null && (b = {
           type: d.ConflictType.RM_UNEXPECTED_CONTENT,
-          op1: t.editOp(B.getPath(), q, S, !0),
-          op2: t.removeOp(X.getPath())
+          op1: n.editOp(B.getPath(), q, S, !0),
+          op2: n.removeOp(X.getPath())
         });
         else {
           const ie = ve(ee);
@@ -1247,58 +1247,58 @@ function Lt() {
           _(k, q, Oe);
         }
       }
-      let D = 0, x = 0, he = 0, me = 0, We = 0, He = 0, Ne = U != null && U.descendFirst(), Ye = Ne;
+      let P = 0, x = 0, he = 0, me = 0, We = 0, He = 0, Ne = U != null && U.descendFirst(), Ye = Ne;
       const ze = i.advancer(M, void 0, (S, ie) => {
         O(ie) && he++;
       });
-      let Se = P != null && P.descendFirst(), je = Se;
+      let Se = A != null && A.descendFirst(), je = Se;
       for (const S of B) if (typeof S == "number") {
         let ie;
         const Oe = o(B.getComponent()), ce = S - x;
         {
           let Be;
           for (; Ne && typeof (Be = U.getKey()) == "number"; ) {
-            Be += D;
+            Be += P;
             const Re = U.getComponent(), Xe = O(Re);
-            if (Be > ce || Be === ce && (!Xe || A === 0 && Oe)) break;
+            if (Be > ce || Be === ce && (!Xe || D === 0 && Oe)) break;
             if (Xe) {
-              D--;
+              P--;
               const Ke = Re.p;
-              K.includes(Ke), Re.d, a(te[Re.d]), O(a(te[Re.d])), (Re.r === void 0 || Me && Me.has(Re)) && (Ke == null || !De[Ke] || A !== 1 && K.includes(Ke)) || We--;
+              K.includes(Ke), Re.d, a(te[Re.d]), O(a(te[Re.d])), (Re.r === void 0 || Me && Me.has(Re)) && (Ke == null || !Pe[Ke] || D !== 1 && K.includes(Ke)) || We--;
             }
             Ne = U.nextSibling();
           }
           ie = Ne && Be === ce ? U : null;
         }
-        const ke = ce - D;
+        const ke = ce - P;
         let Ge = ze(ke);
         const rt = ke - he;
         let Je = null;
         {
           let Be, Re;
-          for (; Se && typeof (Be = P.getKey()) == "number"; ) {
+          for (; Se && typeof (Be = A.getKey()) == "number"; ) {
             Re = Be - me;
-            const Xe = P.getComponent(), Ke = o(Xe);
+            const Xe = A.getComponent(), Ke = o(Xe);
             if (Re > rt) break;
             if (Re === rt) {
               if (!Ke) {
-                Je = P;
+                Je = A;
                 break;
               }
               {
-                if (A === 0 && Oe) {
-                  Je = P;
+                if (D === 0 && Oe) {
+                  Je = A;
                   break;
                 }
                 const Ve = Ge && O(Ge.getComponent());
-                if (A === 0 && Ve) break;
+                if (D === 0 && Ve) break;
               }
             }
             if (Ke) {
               const Ve = Xe.d;
-              K[Ve], Xe.i === void 0 && (g[Ve] || K[Ve] != null && A !== 1) ? (g[Ve] || K[Ve] != null && A === 0) && (me++, He--) : me++;
+              K[Ve], Xe.i === void 0 && (g[Ve] || K[Ve] != null && D !== 1) ? (g[Ve] || K[Ve] != null && D === 0) && (me++, He--) : me++;
             }
-            Se = P.nextSibling();
+            Se = A.nextSibling();
           }
         }
         const Ot = rt + me + We + He;
@@ -1308,18 +1308,18 @@ function Lt() {
         for (; Ne && (ie = U.getKey(), typeof ie != "string" || !(ie > S || ie === S)); ) Ne = U.nextSibling();
         const Oe = Ne && ie === S ? U : null, ce = ze(S);
         let ke;
-        for (; Se && (ke = P.getKey(), typeof ke != "string" || !(ke > S || ke === S)); ) Se = P.nextSibling();
-        const Ge = Se && ke === S ? P : null;
+        for (; Se && (ke = A.getKey(), typeof ke != "string" || !(ke > S || ke === S)); ) Se = A.nextSibling();
+        const Ge = Se && ke === S ? A : null;
         k.descend(S), Q(Oe, B, ce, Ge, k, X), k.ascend();
       }
-      return ze.end(), Ye && U.ascend(), je && P.ascend(), fe;
+      return ze.end(), Ye && U.ascend(), je && A.ascend(), fe;
     }(be, be.clone(), _e, _e.clone(), oe, null), b) return {
       ok: !1,
       conflict: b
     };
     oe.reset();
-    const Ue = (Q, U, B) => Q.traverse(U, (M, P) => {
-      M.d != null && B(M.d, Q, P);
+    const Ue = (Q, U, B) => Q.traverse(U, (M, A) => {
+      M.d != null && B(M.d, Q, A);
     });
     (g.length || re.length) && (Ue(_e, oe, (Q, U, B) => {
       g[Q] && !N[Q] && B.write("r", !0), re[Q] && B.mergeTree(re[Q].get());
@@ -1333,31 +1333,31 @@ function Lt() {
         U && Ue(i.readCursor(U.get()), null, (B, M) => {
           Ee[B] = M.clone();
         });
-      }), function U(B, M, P, k, X, Y) {
+      }), function U(B, M, A, k, X, Y) {
         const ee = a(M);
         if (ee && O(ee)) if (ee.p != null) {
-          const D = ee.p;
-          Ee[D].getPath(), P = Ee[D], k = $e[D] = i.writeCursor();
-        } else ee.r !== void 0 && (P = null);
-        else o(a(P)) && (P = null);
+          const P = ee.p;
+          Ee[P].getPath(), A = Ee[P], k = $e[P] = i.writeCursor();
+        } else ee.r !== void 0 && (A = null);
+        else o(a(A)) && (A = null);
         const fe = B.getComponent();
         if (fe) {
-          let D;
-          if ((D = fe.d) != null) {
-            const x = te[D];
-            x && (x.get(), k.mergeTree(x.get()), P = i.readCursor(x.get()));
+          let P;
+          if ((P = fe.d) != null) {
+            const x = te[P];
+            x && (x.get(), k.mergeTree(x.get()), A = i.readCursor(x.get()));
           }
         }
         let de = 0, le = 0;
-        const ye = i.advancer(M, void 0, (D, x) => {
+        const ye = i.advancer(M, void 0, (P, x) => {
           O(x) && de--;
-        }), q = i.advancer(P, (D, x) => o(x) ? -(D - le) - 1 : D - le, (D, x) => {
+        }), q = i.advancer(A, (P, x) => o(x) ? -(P - le) - 1 : P - le, (P, x) => {
           o(x) && le++;
         });
-        for (const D of B) if (typeof D == "number") {
-          const x = ye(D), he = D + de, me = q(he), We = he + le;
+        for (const P of B) if (typeof P == "number") {
+          const x = ye(P), he = P + de, me = q(he), We = he + le;
           k.descend(We), U(B, x, me, k), k.ascend();
-        } else k.descend(D), U(B, ye(D), q(D), k), k.ascend();
+        } else k.descend(P), U(B, ye(P), q(P), k), k.ascend();
         ye.end(), q.end();
       }(_e, Q, Q.clone(), oe), oe.reset(), b) return {
         ok: !1,
@@ -1365,11 +1365,11 @@ function Lt() {
       };
       if (oe.get(), $e.length) {
         const U = $e.map((M) => M ? M.get() : null), B = i.readCursor(tt(oe.get()));
-        if (Ue(B, oe, (M, P, k) => {
+        if (Ue(B, oe, (M, A, k) => {
           const X = U[M];
           X && (k.mergeTree(X), U[M] = null);
         }), U.find((M) => M)) {
-          const M = i.writeCursor(), P = i.writeCursor();
+          const M = i.writeCursor(), A = i.writeCursor();
           let k = 0, X = 0;
           U.forEach((Y) => {
             Y != null && Ue(i.readCursor(Y), null, (ee) => {
@@ -1377,13 +1377,13 @@ function Lt() {
               M.writeMove(C[fe].getPath(), $[fe].getPath(), k++);
               const de = se[fe];
               de && de.forEach((le) => {
-                g[le] || A !== 1 && K[le] != null || P.writeMove(j[le].getPath(), p[le].getPath(), X++);
+                g[le] || D !== 1 && K[le] != null || A.writeMove(j[le].getPath(), p[le].getPath(), X++);
               });
             });
           }), b = {
             type: d.ConflictType.BLACKHOLE,
             op1: M.get(),
-            op2: P.get()
+            op2: A.get()
           };
         }
       }
@@ -1400,65 +1400,65 @@ function Lt() {
     const u = new Error("Transform detected write conflict");
     throw u.conflict = r, u.type = u.name = "writeConflict", u;
   };
-  function At(r, u, y) {
-    const A = nt(r, u, y);
-    if (A.ok) return A.result;
-    gt(A.conflict);
+  function Dt(r, u, y) {
+    const D = nt(r, u, y);
+    if (D.ok) return D.result;
+    gt(D.conflict);
   }
   const qe = (r) => {
     const u = i.writeCursor();
-    return i.readCursor(r).traverse(u, (y, A) => {
-      (o(y) || ve(y)) && A.write("r", !0);
+    return i.readCursor(r).traverse(u, (y, D) => {
+      (o(y) || ve(y)) && D.write("r", !0);
     }), u.get();
-  }, Pt = (r, u) => {
-    const { type: y, op1: A, op2: b } = r;
+  }, At = (r, u) => {
+    const { type: y, op1: D, op2: b } = r;
     switch (y) {
       case d.ConflictType.DROP_COLLISION:
-        return u === "left" ? [null, qe(b)] : [qe(A), null];
+        return u === "left" ? [null, qe(b)] : [qe(D), null];
       case d.ConflictType.RM_UNEXPECTED_CONTENT:
         let C = !1;
-        return i.readCursor(A).traverse(null, ($) => {
+        return i.readCursor(D).traverse(null, ($) => {
           $.r !== void 0 && (C = !0);
-        }), C ? [null, qe(b)] : [qe(A), null];
+        }), C ? [null, qe(b)] : [qe(D), null];
       case d.ConflictType.BLACKHOLE:
-        return [qe(A), qe(b)];
+        return [qe(D), qe(b)];
       default:
         throw Error("Unrecognised conflict: " + y);
     }
   };
-  function _t(r, u, y, A) {
+  function _t(r, u, y, D) {
     let b = null;
     for (; ; ) {
-      const C = nt(u, y, A);
+      const C = nt(u, y, D);
       if (C.ok) return ne(b, C.result);
       {
         const { conflict: $ } = C;
         r($) || gt($);
-        const [j, p] = Pt($, A);
+        const [j, p] = At($, D);
         u = ne(H(u), j), y = ne(H(y), p), b = ne(b, p);
       }
     }
   }
 })(Ct);
-(function(t) {
+(function(n) {
   var e = Ce && Ce.__createBinding || (Object.create ? function(d, l, a, E) {
     E === void 0 && (E = a), Object.defineProperty(d, E, { enumerable: !0, get: function() {
       return l[a];
     } });
   } : function(d, l, a, E) {
     E === void 0 && (E = a), d[E] = l[a];
-  }), n = Ce && Ce.__exportStar || function(d, l) {
+  }), t = Ce && Ce.__exportStar || function(d, l) {
     for (var a in d) a !== "default" && !l.hasOwnProperty(a) && e(l, d, a);
   };
-  Object.defineProperty(t, "__esModule", { value: !0 }), n(Ct, t);
+  Object.defineProperty(n, "__esModule", { value: !0 }), t(Ct, n);
   var s = ft;
-  Object.defineProperty(t, "ReadCursor", { enumerable: !0, get: function() {
+  Object.defineProperty(n, "ReadCursor", { enumerable: !0, get: function() {
     return s.ReadCursor;
-  } }), Object.defineProperty(t, "WriteCursor", { enumerable: !0, get: function() {
+  } }), Object.defineProperty(n, "WriteCursor", { enumerable: !0, get: function() {
     return s.WriteCursor;
   } });
   var i = ht;
-  Object.defineProperty(t, "ConflictType", { enumerable: !0, get: function() {
+  Object.defineProperty(n, "ConflictType", { enumerable: !0, get: function() {
     return i.ConflictType;
   } });
 })(F);
@@ -1509,72 +1509,76 @@ class Ht {
     this._visible$.next(e);
   }
   refreshTransform(e) {
-    e.forEach((n) => {
-      if (this.getDrawingByParam(n) == null)
+    e.forEach((t) => {
+      if (this.getDrawingByParam(t) == null)
         return;
-      const i = this._getCurrentBySearch(n);
-      i != null && (i.transform = n.transform);
+      const i = this._getCurrentBySearch(t);
+      i != null && (i.transform = t.transform);
     }), this.refreshTransformNotification(e);
   }
   getDrawingDataForUnit(e) {
     return this.drawingManagerData[e];
   }
   removeDrawingDataForUnit(e) {
-    const n = this.drawingManagerData[e];
-    if (n == null)
+    const t = this.drawingManagerData[e];
+    if (t == null)
       return;
     delete this.drawingManagerData[e];
     const s = [];
-    Object.keys(n).forEach((i) => {
-      const d = n[i];
+    Object.keys(t).forEach((i) => {
+      const d = t[i];
       (d == null ? void 0 : d.data) != null && Object.keys(d.data).forEach((l) => {
         s.push({ unitId: e, subUnitId: i, drawingId: l });
       });
     }), s.length > 0 && this.removeNotification(s);
   }
-  registerDrawingData(e, n) {
-    this.drawingManagerData[e] = n;
+  registerDrawingData(e, t) {
+    this.drawingManagerData[e] = t;
   }
   initializeNotification(e) {
-    const n = [], s = this.drawingManagerData[e];
+    const t = [], s = this.drawingManagerData[e];
     s != null && (Object.keys(s).forEach((i) => {
       this._establishDrawingMap(e, i);
       const d = s[i];
       Object.keys(d.data).forEach((l) => {
         const a = d.data[l];
-        a.unitId = e, a.subUnitId = i, n.push(a);
+        a.unitId = e, a.subUnitId = i, t.push(a);
       });
-    }), n.length > 0 && this.addNotification(n));
+    }), t.length > 0 && this.addNotification(t));
   }
-  getDrawingData(e, n) {
-    return this._getDrawingData(e, n);
+  getDrawingData(e, t) {
+    return this._getDrawingData(e, t);
+  }
+  // Use in doc only.
+  setDrawingData(e, t, s) {
+    this.drawingManagerData[e][t].data = s;
   }
   getBatchAddOp(e) {
-    const n = [], s = [], i = [];
+    const t = [], s = [], i = [];
     e.forEach((W) => {
       const { op: O, invertOp: o } = this._addByParam(W);
-      n.push({ unitId: W.unitId, subUnitId: W.subUnitId, drawingId: W.drawingId }), s.push(O), i.push(o);
+      t.push({ unitId: W.unitId, subUnitId: W.subUnitId, drawingId: W.drawingId }), s.push(O), i.push(o);
     });
     const d = s.reduce(F.type.compose, null), l = i.reduce(F.type.compose, null), { unitId: a, subUnitId: E } = e[0];
-    return { undo: l, redo: d, unitId: a, subUnitId: E, objects: n };
+    return { undo: l, redo: d, unitId: a, subUnitId: E, objects: t };
   }
   getBatchRemoveOp(e) {
-    const n = [], s = [];
+    const t = [], s = [];
     e.forEach((E) => {
       const { op: W, invertOp: O } = this._removeByParam(E);
-      n.push(W), s.push(O);
+      t.push(W), s.push(O);
     });
-    const i = n.reduce(F.type.compose, null), d = s.reduce(F.type.compose, null), { unitId: l, subUnitId: a } = e[0];
+    const i = t.reduce(F.type.compose, null), d = s.reduce(F.type.compose, null), { unitId: l, subUnitId: a } = e[0];
     return { undo: d, redo: i, unitId: l, subUnitId: a, objects: e };
   }
   getBatchUpdateOp(e) {
-    const n = [], s = [], i = [];
+    const t = [], s = [], i = [];
     e.forEach((W) => {
       const { op: O, invertOp: o } = this._updateByParam(W);
-      n.push({ unitId: W.unitId, subUnitId: W.subUnitId, drawingId: W.drawingId }), s.push(O), i.push(o);
+      t.push({ unitId: W.unitId, subUnitId: W.subUnitId, drawingId: W.drawingId }), s.push(O), i.push(o);
     });
     const d = s.reduce(F.type.compose, null), l = i.reduce(F.type.compose, null), { unitId: a, subUnitId: E } = e[0];
-    return { undo: l, redo: d, unitId: a, subUnitId: E, objects: n };
+    return { undo: l, redo: d, unitId: a, subUnitId: E, objects: t };
   }
   removeNotification(e) {
     this._remove$.next(e);
@@ -1598,35 +1602,35 @@ class Ht {
     this._refreshTransform$.next(e);
   }
   getGroupDrawingOp(e) {
-    const n = [], { unitId: s, subUnitId: i } = e[0].parent;
+    const t = [], { unitId: s, subUnitId: i } = e[0].parent;
     e.forEach((a) => {
-      n.push(this._getGroupDrawingOp(a));
+      t.push(this._getGroupDrawingOp(a));
     });
-    const d = n.reduce(F.type.compose, null);
+    const d = t.reduce(F.type.compose, null);
     return { undo: F.type.invertWithDoc(d, this.drawingManagerData), redo: d, unitId: s, subUnitId: i, objects: e };
   }
   getUngroupDrawingOp(e) {
-    const n = [], { unitId: s, subUnitId: i } = e[0].parent;
+    const t = [], { unitId: s, subUnitId: i } = e[0].parent;
     e.forEach((a) => {
-      n.push(this._getUngroupDrawingOp(a));
+      t.push(this._getUngroupDrawingOp(a));
     });
-    const d = n.reduce(F.type.compose, null);
+    const d = t.reduce(F.type.compose, null);
     return { undo: F.type.invertWithDoc(d, this.drawingManagerData), redo: d, unitId: s, subUnitId: i, objects: e };
   }
   getDrawingsByGroup(e) {
-    const { unitId: n, subUnitId: s, drawingId: i } = e;
-    if (this.getDrawingByParam({ unitId: n, subUnitId: s, drawingId: i }) == null)
+    const { unitId: t, subUnitId: s, drawingId: i } = e;
+    if (this.getDrawingByParam({ unitId: t, subUnitId: s, drawingId: i }) == null)
       return [];
-    const l = this._getDrawingData(n, s), a = [];
+    const l = this._getDrawingData(t, s), a = [];
     return Object.keys(l).forEach((E) => {
       const W = l[E];
       W.groupId === i && a.push(W);
     }), a;
   }
   _getGroupDrawingOp(e) {
-    const { parent: n, children: s } = e, { unitId: i, subUnitId: d, drawingId: l } = n, a = [];
+    const { parent: t, children: s } = e, { unitId: i, subUnitId: d, drawingId: l } = t, a = [];
     a.push(
-      F.insertOp([i, d, "data", l], n)
+      F.insertOp([i, d, "data", l], t)
     );
     let E = Number.NEGATIVE_INFINITY;
     return s.forEach((W) => {
@@ -1639,7 +1643,7 @@ class Ht {
     ), a.reduce(F.type.compose, null);
   }
   _getUngroupDrawingOp(e) {
-    const { parent: n, children: s } = e, { unitId: i, subUnitId: d, drawingId: l } = n, a = [];
+    const { parent: t, children: s } = e, { unitId: i, subUnitId: d, drawingId: l } = t, a = [];
     return s.forEach((E) => {
       const { unitId: W, subUnitId: O, drawingId: o } = E;
       a.push(
@@ -1651,8 +1655,8 @@ class Ht {
       F.removeOp([i, d, "order", this._getDrawingOrder(i, d).indexOf(l)], !0)
     ), a.reduce(F.type.compose, null);
   }
-  applyJson1(e, n, s) {
-    this._establishDrawingMap(e, n), this._oldDrawingManagerData = { ...this.drawingManagerData }, this.drawingManagerData = F.type.apply(this.drawingManagerData, s);
+  applyJson1(e, t, s) {
+    this._establishDrawingMap(e, t), this._oldDrawingManagerData = { ...this.drawingManagerData }, this.drawingManagerData = F.type.apply(this.drawingManagerData, s);
   }
   // private _fillMissingFields(jsonOp: JSONOp) {
   //     if (jsonOp == null) {
@@ -1699,130 +1703,134 @@ class Ht {
     return this._getOldBySearch(e);
   }
   getDrawingOKey(e) {
-    const [n, s, i] = e.split("#-#");
-    return this._getCurrentBySearch({ unitId: n, subUnitId: s, drawingId: i });
+    const [t, s, i] = e.split("#-#");
+    return this._getCurrentBySearch({ unitId: t, subUnitId: s, drawingId: i });
   }
   focusDrawing(e) {
     if (e == null) {
       this._focusDrawings = [], this._focus$.next([]);
       return;
     }
-    const n = [];
+    const t = [];
     e.forEach((s) => {
       var E;
       const { unitId: i, subUnitId: d, drawingId: l } = s, a = (E = this._getDrawingData(i, d)) == null ? void 0 : E[l];
-      a != null && n.push(a);
-    }), n.length > 0 && (this._focusDrawings = n, this._focus$.next(n));
+      a != null && t.push(a);
+    }), t.length > 0 && (this._focusDrawings = t, this._focus$.next(t));
   }
   getFocusDrawings() {
     const e = [];
-    return this._focusDrawings.forEach((n) => {
+    return this._focusDrawings.forEach((t) => {
       var a;
-      const { unitId: s, subUnitId: i, drawingId: d } = n, l = (a = this._getDrawingData(s, i)) == null ? void 0 : a[d];
+      const { unitId: s, subUnitId: i, drawingId: d } = t, l = (a = this._getDrawingData(s, i)) == null ? void 0 : a[d];
       l != null && e.push(l);
     }), e;
   }
-  getDrawingOrder(e, n) {
-    return this._getDrawingOrder(e, n);
+  getDrawingOrder(e, t) {
+    return this._getDrawingOrder(e, t);
+  }
+  // Use in doc only.
+  setDrawingOrder(e, t, s) {
+    this.drawingManagerData[e][t].order = s;
   }
   orderUpdateNotification(e) {
     this._order$.next(e);
   }
   getForwardDrawingsOp(e) {
-    const { unitId: n, subUnitId: s, drawingIds: i } = e, d = [], l = this.getDrawingOrder(n, s), a = [...i];
+    const { unitId: t, subUnitId: s, drawingIds: i } = e, d = [], l = this.getDrawingOrder(t, s), a = [...i];
     i.forEach((O) => {
-      const o = this._hasDrawingOrder({ unitId: n, subUnitId: s, drawingId: O });
+      const o = this._hasDrawingOrder({ unitId: t, subUnitId: s, drawingId: O });
       if (o === -1 || o === l.length - 1)
         return;
-      const c = F.moveOp([n, s, "order", o], [n, s, "order", o + 1]);
+      const c = F.moveOp([t, s, "order", o], [t, s, "order", o + 1]);
       d.push(c), a.includes(l[o + 1]) || a.push(l[o + 1]);
     });
     const E = d.reduce(F.type.compose, null);
-    return { undo: F.type.invertWithDoc(E, this.drawingManagerData), redo: E, unitId: n, subUnitId: s, objects: { ...e, drawingIds: a } };
+    return { undo: F.type.invertWithDoc(E, this.drawingManagerData), redo: E, unitId: t, subUnitId: s, objects: { ...e, drawingIds: a } };
   }
   getBackwardDrawingOp(e) {
-    const { unitId: n, subUnitId: s, drawingIds: i } = e, d = [], l = this.getDrawingOrder(n, s), a = [...i];
+    const { unitId: t, subUnitId: s, drawingIds: i } = e, d = [], l = this.getDrawingOrder(t, s), a = [...i];
     i.forEach((O) => {
-      const o = this._hasDrawingOrder({ unitId: n, subUnitId: s, drawingId: O });
+      const o = this._hasDrawingOrder({ unitId: t, subUnitId: s, drawingId: O });
       if (o === -1 || o === 0)
         return;
-      const c = F.moveOp([n, s, "order", o], [n, s, "order", o - 1]);
+      const c = F.moveOp([t, s, "order", o], [t, s, "order", o - 1]);
       d.push(c), a.includes(l[o - 1]) || a.push(l[o - 1]);
     });
     const E = d.reduce(F.type.compose, null);
-    return { undo: F.type.invertWithDoc(E, this.drawingManagerData), redo: E, unitId: n, subUnitId: s, objects: { ...e, drawingIds: a } };
+    return { undo: F.type.invertWithDoc(E, this.drawingManagerData), redo: E, unitId: t, subUnitId: s, objects: { ...e, drawingIds: a } };
   }
   getFrontDrawingsOp(e) {
-    const { unitId: n, subUnitId: s, drawingIds: i } = e, d = this._getOrderFromSearchParams(n, s, i), l = [...i], a = this.getDrawingOrder(n, s), E = [];
+    const { unitId: t, subUnitId: s, drawingIds: i } = e, d = this._getOrderFromSearchParams(t, s, i), l = [...i], a = this.getDrawingOrder(t, s), E = [];
     d.forEach((o) => {
-      const { drawingId: c } = o, h = this._getDrawingCount(n, s) - 1, R = F.moveOp([n, s, "order", this._getDrawingOrder(n, s).indexOf(c)], [n, s, "order", h]);
+      const { drawingId: c } = o, h = this._getDrawingCount(t, s) - 1, R = F.moveOp([t, s, "order", this._getDrawingOrder(t, s).indexOf(c)], [t, s, "order", h]);
       E.push(R), l.includes(a[h]) || l.push(a[h]);
     });
     const W = E.reduce(F.type.compose, null);
-    return { undo: F.type.invertWithDoc(W, this.drawingManagerData), redo: W, unitId: n, subUnitId: s, objects: { ...e, drawingIds: l } };
+    return { undo: F.type.invertWithDoc(W, this.drawingManagerData), redo: W, unitId: t, subUnitId: s, objects: { ...e, drawingIds: l } };
   }
   getBackDrawingsOp(e) {
-    const { unitId: n, subUnitId: s, drawingIds: i } = e, d = this._getOrderFromSearchParams(n, s, i, !0), l = [...i], a = this.getDrawingOrder(n, s), E = [];
+    const { unitId: t, subUnitId: s, drawingIds: i } = e, d = this._getOrderFromSearchParams(t, s, i, !0), l = [...i], a = this.getDrawingOrder(t, s), E = [];
     d.forEach((o) => {
-      const { drawingId: c } = o, h = F.moveOp([n, s, "order", this._getDrawingOrder(n, s).indexOf(c)], [n, s, "order", 0]);
+      const { drawingId: c } = o, h = F.moveOp([t, s, "order", this._getDrawingOrder(t, s).indexOf(c)], [t, s, "order", 0]);
       E.push(h), l.includes(a[0]) || l.push(a[0]);
     });
     const W = E.reduce(F.type.compose, null);
-    return { undo: F.type.invertWithDoc(W, this.drawingManagerData), redo: W, unitId: n, subUnitId: s, objects: { ...e, drawingIds: l } };
+    return { undo: F.type.invertWithDoc(W, this.drawingManagerData), redo: W, unitId: t, subUnitId: s, objects: { ...e, drawingIds: l } };
   }
-  _getDrawingCount(e, n) {
-    return this.getDrawingOrder(e, n).length || 0;
+  _getDrawingCount(e, t) {
+    return this.getDrawingOrder(e, t).length || 0;
   }
-  _getOrderFromSearchParams(e, n, s, i = !1) {
+  _getOrderFromSearchParams(e, t, s, i = !1) {
     return s.map((d) => {
-      const l = this._hasDrawingOrder({ unitId: e, subUnitId: n, drawingId: d });
+      const l = this._hasDrawingOrder({ unitId: e, subUnitId: t, drawingId: d });
       return { drawingId: d, zIndex: l };
     }).sort(i === !1 ? Mt : Nt);
   }
   _hasDrawingOrder(e) {
     if (e == null)
       return -1;
-    const { unitId: n, subUnitId: s, drawingId: i } = e;
-    return this._establishDrawingMap(n, s), this._getDrawingOrder(n, s).indexOf(i);
+    const { unitId: t, subUnitId: s, drawingId: i } = e;
+    return this._establishDrawingMap(t, s), this._getDrawingOrder(t, s).indexOf(i);
   }
   _getCurrentBySearch(e) {
     var d, l, a;
     if (e == null)
       return;
-    const { unitId: n, subUnitId: s, drawingId: i } = e;
-    return (a = (l = (d = this.drawingManagerData[n]) == null ? void 0 : d[s]) == null ? void 0 : l.data) == null ? void 0 : a[i];
+    const { unitId: t, subUnitId: s, drawingId: i } = e;
+    return (a = (l = (d = this.drawingManagerData[t]) == null ? void 0 : d[s]) == null ? void 0 : l.data) == null ? void 0 : a[i];
   }
   _getOldBySearch(e) {
     var d, l, a;
     if (e == null)
       return;
-    const { unitId: n, subUnitId: s, drawingId: i } = e;
-    return (a = (l = (d = this._oldDrawingManagerData[n]) == null ? void 0 : d[s]) == null ? void 0 : l.data) == null ? void 0 : a[i];
+    const { unitId: t, subUnitId: s, drawingId: i } = e;
+    return (a = (l = (d = this._oldDrawingManagerData[t]) == null ? void 0 : d[s]) == null ? void 0 : l.data) == null ? void 0 : a[i];
   }
-  _establishDrawingMap(e, n, s) {
+  _establishDrawingMap(e, t, s) {
     var i;
-    return this.drawingManagerData[e] || (this.drawingManagerData[e] = {}), this.drawingManagerData[e][n] || (this.drawingManagerData[e][n] = {
+    return this.drawingManagerData[e] || (this.drawingManagerData[e] = {}), this.drawingManagerData[e][t] || (this.drawingManagerData[e][t] = {
       data: {},
       order: []
-    }), s == null ? null : (i = this.drawingManagerData[e][n].data) == null ? void 0 : i[s];
+    }), s == null ? null : (i = this.drawingManagerData[e][t].data) == null ? void 0 : i[s];
   }
   _addByParam(e) {
-    const { unitId: n, subUnitId: s, drawingId: i } = e;
-    this._establishDrawingMap(n, s, i);
-    const d = F.insertOp([n, s, "data", i], e), l = F.insertOp([n, s, "order", this._getDrawingOrder(n, s).length], i), a = [d, l].reduce(F.type.compose, null), E = F.type.invertWithDoc(a, this.drawingManagerData);
+    const { unitId: t, subUnitId: s, drawingId: i } = e;
+    this._establishDrawingMap(t, s, i);
+    const d = F.insertOp([t, s, "data", i], e), l = F.insertOp([t, s, "order", this._getDrawingOrder(t, s).length], i), a = [d, l].reduce(F.type.compose, null), E = F.type.invertWithDoc(a, this.drawingManagerData);
     return { op: a, invertOp: E };
   }
   _removeByParam(e) {
     if (e == null)
       return { op: [], invertOp: [] };
-    const { unitId: n, subUnitId: s, drawingId: i } = e;
-    if (this._establishDrawingMap(n, s, i) == null)
+    const { unitId: t, subUnitId: s, drawingId: i } = e;
+    if (this._establishDrawingMap(t, s, i) == null)
       return { op: [], invertOp: [] };
-    const l = F.removeOp([n, s, "data", i], !0), a = F.removeOp([n, s, "order", this._getDrawingOrder(n, s).indexOf(i)], !0), E = [l, a].reduce(F.type.compose, null), W = F.type.invertWithDoc(E, this.drawingManagerData);
+    const l = F.removeOp([t, s, "data", i], !0), a = F.removeOp([t, s, "order", this._getDrawingOrder(t, s).indexOf(i)], !0), E = [l, a].reduce(F.type.compose, null), W = F.type.invertWithDoc(E, this.drawingManagerData);
     return { op: E, invertOp: W };
   }
   _updateByParam(e) {
-    const { unitId: n, subUnitId: s, drawingId: i } = e, d = this._establishDrawingMap(n, s, i);
+    const { unitId: t, subUnitId: s, drawingId: i } = e, d = this._establishDrawingMap(t, s, i);
     if (d == null)
       return { op: [], invertOp: [] };
     const a = this._getUpdateParamCompareOp(e, d).reduce(F.type.compose, null), E = F.type.invertWithDoc(a, this.drawingManagerData);
@@ -1835,22 +1843,22 @@ class Ht {
   //         }
   //     });
   // }
-  _getUpdateParamCompareOp(e, n) {
+  _getUpdateParamCompareOp(e, t) {
     const { unitId: s, subUnitId: i, drawingId: d } = e, l = [];
     return Object.keys(e).forEach((a) => {
-      const E = e[a], W = n[a];
+      const E = e[a], W = t[a];
       W !== E && l.push(
         F.replaceOp([s, i, "data", d, a], W, E)
       );
     }), l;
   }
-  _getDrawingData(e, n) {
+  _getDrawingData(e, t) {
     var s, i;
-    return ((i = (s = this.drawingManagerData[e]) == null ? void 0 : s[n]) == null ? void 0 : i.data) || {};
+    return ((i = (s = this.drawingManagerData[e]) == null ? void 0 : s[t]) == null ? void 0 : i.data) || {};
   }
-  _getDrawingOrder(e, n) {
+  _getDrawingOrder(e, t) {
     var s, i;
-    return ((i = (s = this.drawingManagerData[e]) == null ? void 0 : s[n]) == null ? void 0 : i.order) || [];
+    return ((i = (s = this.drawingManagerData[e]) == null ? void 0 : s[t]) == null ? void 0 : i.order) || [];
   }
   getDrawingVisible() {
     return this._visible;
@@ -1867,23 +1875,23 @@ class Ht {
 }
 class Kt extends Ht {
 }
-function cn(t) {
-  const { unitId: e, subUnitId: n, drawingId: s } = t;
-  return `${e}#-#${n}#-#${s}`;
+function cn(n) {
+  const { unitId: e, subUnitId: t, drawingId: s } = n;
+  return `${e}#-#${t}#-#${s}`;
 }
-const un = async (t) => new Promise((e, n) => {
+const un = async (n) => new Promise((e, t) => {
   const s = new Image();
-  s.src = t, s.onload = () => {
+  s.src = n, s.onload = () => {
     e({
       width: s.width,
       height: s.height,
       image: s
     });
   }, s.onerror = (i) => {
-    n(i);
+    t(i);
   };
 });
-var et = /* @__PURE__ */ ((t) => (t.URL = "URL", t.UUID = "UUID", t.BASE64 = "BASE64", t))(et || {}), Ze = /* @__PURE__ */ ((t) => (t.SUCCUSS = "0", t.ERROR_EXCEED_SIZE = "1", t.ERROR_IMAGE_TYPE = "2", t.ERROR_UPLOAD_COUNT_LIMIT = "3", t.ERROR_IMAGE = "4", t))(Ze || {});
+var et = /* @__PURE__ */ ((n) => (n.URL = "URL", n.UUID = "UUID", n.BASE64 = "BASE64", n))(et || {}), Ze = /* @__PURE__ */ ((n) => (n.SUCCUSS = "0", n.ERROR_EXCEED_SIZE = "1", n.ERROR_IMAGE_TYPE = "2", n.ERROR_UPLOAD_COUNT_LIMIT = "3", n.ERROR_IMAGE = "4", n))(Ze || {});
 const Vt = It("core.image-io.service");
 class Ft {
   constructor() {
@@ -1895,21 +1903,21 @@ class Ft {
   setWaitCount(e) {
     this._waitCount = e, this._change$.next(e);
   }
-  getImageSourceCache(e, n) {
-    if (n === et.BASE64) {
+  getImageSourceCache(e, t) {
+    if (t === et.BASE64) {
       const s = new Image();
       return s.src = e, s;
     }
     return this._imageSourceCache.get(e);
   }
-  addImageSourceCache(e, n, s) {
-    n === et.BASE64 || s == null || this._imageSourceCache.set(e, s);
+  addImageSourceCache(e, t, s) {
+    t === et.BASE64 || s == null || this._imageSourceCache.set(e, s);
   }
   async getImage(e) {
     return Promise.resolve(e);
   }
   async saveImage(e) {
-    return new Promise((n, s) => {
+    return new Promise((t, s) => {
       if (!Wt.includes(e.type)) {
         s(new Error(Ze.ERROR_IMAGE_TYPE)), this._decreaseWaiting();
         return;
@@ -1927,7 +1935,7 @@ class Ft {
           return;
         }
         const a = kt.generateRandomId(6);
-        n({
+        t({
           imageId: a,
           imageSourceType: et.BASE64,
           source: l,
@@ -1942,28 +1950,28 @@ class Ft {
   }
 }
 const dn = "__default_document_sub_component_id20231101__";
-var qt = /* @__PURE__ */ ((t) => (t[t.forward = 0] = "forward", t[t.backward = 1] = "backward", t[t.front = 2] = "front", t[t.back = 3] = "back", t))(qt || {}), zt = /* @__PURE__ */ ((t) => (t[t.UNRECOGNIZED = -1] = "UNRECOGNIZED", t[t.DRAWING_IMAGE = 0] = "DRAWING_IMAGE", t[t.DRAWING_SHAPE = 1] = "DRAWING_SHAPE", t[t.DRAWING_CHART = 2] = "DRAWING_CHART", t[t.DRAWING_TABLE = 3] = "DRAWING_TABLE", t[t.DRAWING_SMART_ART = 4] = "DRAWING_SMART_ART", t[t.DRAWING_VIDEO = 5] = "DRAWING_VIDEO", t[t.DRAWING_GROUP = 6] = "DRAWING_GROUP", t[t.DRAWING_UNIT = 7] = "DRAWING_UNIT", t[t.DRAWING_DOM = 8] = "DRAWING_DOM", t))(zt || {});
+var qt = /* @__PURE__ */ ((n) => (n[n.forward = 0] = "forward", n[n.backward = 1] = "backward", n[n.front = 2] = "front", n[n.back = 3] = "back", n))(qt || {}), zt = /* @__PURE__ */ ((n) => (n[n.UNRECOGNIZED = -1] = "UNRECOGNIZED", n[n.DRAWING_IMAGE = 0] = "DRAWING_IMAGE", n[n.DRAWING_SHAPE = 1] = "DRAWING_SHAPE", n[n.DRAWING_CHART = 2] = "DRAWING_CHART", n[n.DRAWING_TABLE = 3] = "DRAWING_TABLE", n[n.DRAWING_SMART_ART = 4] = "DRAWING_SMART_ART", n[n.DRAWING_VIDEO = 5] = "DRAWING_VIDEO", n[n.DRAWING_GROUP = 6] = "DRAWING_GROUP", n[n.DRAWING_UNIT = 7] = "DRAWING_UNIT", n[n.DRAWING_DOM = 8] = "DRAWING_DOM", n))(zt || {});
 const Xt = It("univer.drawing-manager.service");
-var Yt = Object.defineProperty, Zt = Object.getOwnPropertyDescriptor, Jt = (t, e, n, s) => {
-  for (var i = s > 1 ? void 0 : s ? Zt(e, n) : e, d = t.length - 1, l; d >= 0; d--)
-    (l = t[d]) && (i = (s ? l(e, n, i) : l(i)) || i);
-  return s && i && Yt(e, n, i), i;
-}, Qt = (t, e) => (n, s) => e(n, s, t);
+var Yt = Object.defineProperty, Zt = Object.getOwnPropertyDescriptor, Jt = (n, e, t, s) => {
+  for (var i = s > 1 ? void 0 : s ? Zt(e, t) : e, d = n.length - 1, l; d >= 0; d--)
+    (l = n[d]) && (i = (s ? l(e, t, i) : l(i)) || i);
+  return s && i && Yt(e, t, i), i;
+}, Qt = (n, e) => (t, s) => e(t, s, n);
 const en = "DRAWING_PLUGIN";
 var ot;
 let wt = (ot = class extends Rt {
-  constructor(t, e) {
-    super(), this._config = t, this._injector = e;
+  constructor(n, e) {
+    super(), this._config = n, this._injector = e;
   }
-  onStarting(t) {
-    this._initDependencies(t);
+  onStarting(n) {
+    this._initDependencies(n);
   }
-  _initDependencies(t) {
+  _initDependencies(n) {
     var s;
     St([
       [Vt, { useClass: Ft }],
       [Xt, { useClass: Kt }]
-    ], (s = this._config) == null ? void 0 : s.override).forEach((i) => t.add(i));
+    ], (s = this._config) == null ? void 0 : s.override).forEach((i) => n.add(i));
   }
 }, V(ot, "pluginName", en), ot);
 wt = Jt([