@dynamix-layout/core 1.1.1 → 1.2.0

package/dist/core.es.js

@@ -1,4 +1,4 @@
-class b {
+class g {
   buffer;
   head = 0;
   tail = 0;
@@ -50,14 +50,14 @@ class b {
       return !0;
     const n = e.size();
     if (t === 0) {
-      const c = e.toArray();
-      for (let d = c.length - 1; d >= 0; d--)
-        this.enqueueFront(c[d]);
+      const h = e.toArray();
+      for (let u = h.length - 1; u >= 0; u--)
+        this.enqueueFront(h[u]);
       return !0;
     }
     if (t === this.count) {
-      for (const c of e)
-        this.enqueue(c);
+      for (const h of e)
+        this.enqueue(h);
       return !0;
     }
     for (; this.count + n > this.capacity; )
@@ -286,34 +286,34 @@ class b {
     this.tail = (this.tail + n) % this.capacity;
   }
 }
-function x(o, t = (e, n) => e === n) {
+function T(o, t = (e, n) => e === n) {
   let e = o;
   const n = /* @__PURE__ */ new Set();
   let i = [];
-  const s = () => e, r = (f, m = !1) => {
+  const s = () => e, r = (l, m = !1) => {
     if (m) {
-      e = f;
+      e = l;
       return;
     }
-    t(e, f) || (e = f, n.forEach((p) => p(e)), i.forEach((p) => p(e)), i = []);
-  }, c = () => {
-    n.forEach((f) => f(e)), i.forEach((f) => f(e)), i = [];
-  }, d = (f) => (n.add(f), () => n.delete(f)), l = () => new Promise((f) => {
-    i.push(f);
+    t(e, l) || (e = l, n.forEach((p) => p(e)), i.forEach((p) => p(e)), i = []);
+  }, h = () => {
+    n.forEach((l) => l(e)), i.forEach((l) => l(e)), i = [];
+  }, u = (l) => (n.add(l), () => n.delete(l)), f = () => new Promise((l) => {
+    i.push(l);
   });
   return {
     get: s,
     set: r,
-    onChange: d,
-    nextChange: l,
-    triggerChange: c,
-    onChangePromise: (f) => {
+    onChange: u,
+    nextChange: f,
+    triggerChange: h,
+    onChangePromise: (l) => {
       let m = !0;
       return (async () => {
         for (; m; ) {
-          const I = await l();
+          const I = await f();
           if (!m) break;
-          f(I);
+          l(I);
         }
       })(), () => {
         m = !1;
@@ -325,28 +325,31 @@ function E(o, t) {
   if (o.size !== t.size) return !1;
   for (const [e, n] of o.entries()) {
     const i = t.get(e);
-    if (!i || !A(n, i))
+    if (!i || !C(n, i))
       return !1;
   }
   return !0;
 }
-function A(o, t) {
-  if (o.typNode !== t.typNode || o.nodName !== t.nodName || o.uidNode !== t.uidNode || o.nodPart !== t.nodPart) return !1;
+function C(o, t) {
+  if (o.typNode !== t.typNode || o.nodName !== t.nodName || o.uidNode !== t.uidNode || o.nodPart !== t.nodPart || o.nodFold !== t.nodFold || o.nodMaxd !== t.nodMaxd || o.nodHidden !== t.nodHidden || o.nodLocked !== t.nodLocked) return !1;
   const e = o.nodDims, n = t.nodDims;
   return e.x === n.x && e.y === n.y && e.w === n.w && e.h === n.h;
 }
-const v = () => crypto.randomUUID(), T = {
+const D = () => crypto.randomUUID(), O = {
   set: (o, t) => setTimeout(o, t),
   clear: (o) => clearTimeout(o)
-}, u = {
-  createId: v,
-  timer: T,
+}, c = {
+  createId: D,
+  timer: O,
   root: void 0,
   tree: null,
   minW: 40,
   minH: 40,
   bond: 10,
-  inst: null
+  inst: null,
+  maximized: null,
+  collapsedSize: 40,
+  foldSeq: 0
 };
 class a {
   static cache = {
@@ -354,20 +357,20 @@ class a {
     mapDirs: /* @__PURE__ */ new Map(),
     tabCnts: /* @__PURE__ */ new Map(),
     mapElem: /* @__PURE__ */ new Map(),
-    tabOpts: x(
+    tabOpts: T(
       /* @__PURE__ */ new Map(),
       E
     ),
-    nodOpts: x(
+    nodOpts: T(
       /* @__PURE__ */ new Map(),
       E
     ),
-    bndOpts: x(
+    bndOpts: T(
       /* @__PURE__ */ new Map(),
       E
     )
   };
-  kids = new b();
+  kids = new g();
   dims = { w: 0, h: 0, x: 0, y: 0 };
   unId;
   next = null;
@@ -377,6 +380,8 @@ class a {
   part = 0;
   host = null;
   open = "";
+  collapsed = !1;
+  foldedAt = 0;
   constructor(t = {}) {
     const e = {
       type: "row",
@@ -384,23 +389,23 @@ class a {
       name: "",
       part: 100,
       dims: { w: 0, h: 0, x: 0, y: 0 },
-      unId: u.createId(),
+      unId: c.createId(),
       open: ""
     };
     this.type = t.type ?? e.type, this.host = t.host ?? e.host, this.name = t.name ?? e.name, this.part = t.part ?? e.part, this.dims = t.dims ?? e.dims, this.open = t.open ?? e.open, this.unId = t.unId || e.unId;
   }
   addBond(t, e = null) {
     if (!e) return;
-    const n = new O(t, this, e);
+    const n = new A(t, this, e);
     a.cache.mapElem.set(n.unId, n);
   }
   getReqDimension() {
     const t = a.cache.dimMins.get(this.unId), e = a.cache.tabCnts.get(this.unId), n = Math.max(
       t.minWidth,
-      e.horizontal * u.minW + Math.max(0, e.horizontal - 1) * u.bond
+      e.horizontal * c.minW + Math.max(0, e.horizontal - 1) * c.bond
     ), i = Math.max(
       t.minHeight,
-      e.vertical * u.minH + Math.max(0, e.vertical - 1) * u.bond
+      e.vertical * c.minH + Math.max(0, e.vertical - 1) * c.bond
     );
     return {
       width: n,
@@ -415,35 +420,35 @@ class a {
       minWidth: 0,
       minHeight: 0
     };
-    let i = 0;
-    for (const h of this.kids)
-      e += h.part;
+    let i = 0, s;
+    for (const d of this.kids)
+      d.collapsed || (e += d.part, s = d);
     if (e === 0) return;
-    let s;
-    t ? s = this.dims.w - n.minWidth : s = this.dims.h - n.minHeight;
-    const r = s < 0, c = this.kids.peekBack();
-    let d = 0, l = 0;
-    for (const h of this.kids) {
-      const f = a.cache.dimMins.get(h.unId) || {
+    let r;
+    t ? r = this.dims.w - n.minWidth : r = this.dims.h - n.minHeight;
+    const h = r < 0;
+    let u = 0, f = 0;
+    for (const d of this.kids) {
+      const l = a.cache.dimMins.get(d.unId) || {
         minWidth: 0,
         minHeight: 0
       };
       let m = 0;
-      if (!r) {
-        d += h.part;
-        const p = h === c ? s : Math.round(s * d / e);
-        m = p - l, l = p;
+      if (!h && !d.collapsed) {
+        u += d.part;
+        const p = d === s ? r : Math.round(r * u / e);
+        m = p - f, f = p;
       }
-      t ? (h.dims.w = f.minWidth + m, h.dims.h = this.dims.h, h.dims.x = this.dims.x + i, h.dims.y = this.dims.y, i += h.dims.w + u.bond) : (h.dims.h = f.minHeight + m, h.dims.w = this.dims.w, h.dims.y = this.dims.y + i, h.dims.x = this.dims.x, i += h.dims.h + u.bond), h.next && (t ? h.next.dims = {
-        w: u.bond,
-        h: h.dims.h,
-        x: h.dims.x + h.dims.w,
-        y: h.dims.y
-      } : h.next.dims = {
-        w: h.dims.w,
-        h: u.bond,
-        x: h.dims.x,
-        y: h.dims.y + h.dims.h
+      t ? (d.dims.w = l.minWidth + m, d.dims.h = this.dims.h, d.dims.x = this.dims.x + i, d.dims.y = this.dims.y, i += d.dims.w + c.bond) : (d.dims.h = l.minHeight + m, d.dims.w = this.dims.w, d.dims.y = this.dims.y + i, d.dims.x = this.dims.x, i += d.dims.h + c.bond), d.next && (t ? d.next.dims = {
+        w: c.bond,
+        h: d.dims.h,
+        x: d.dims.x + d.dims.w,
+        y: d.dims.y
+      } : d.next.dims = {
+        w: d.dims.w,
+        h: c.bond,
+        x: d.dims.x,
+        y: d.dims.y + d.dims.h
       });
     }
   }
@@ -457,12 +462,12 @@ class a {
       nodName: this.name,
       uidNode: this.unId
     };
-    return this.open && (e.nodOpen = this.open), t.length > 0 && (e.nodKids = t), e;
+    return this.open && (e.nodOpen = this.open), this.collapsed && (e.nodFold = !0), this === c.root && c.maximized && (e.nodMaxd = c.maximized), t.length > 0 && (e.nodKids = t), e;
   }
 }
-class O {
+class A {
   dims = { w: 0, h: 0, x: 0, y: 0 };
-  unId = u.createId();
+  unId = c.createId();
   next = null;
   prev = null;
   host = null;
@@ -480,8 +485,8 @@ class O {
     };
   }
 }
-function* S(o) {
-  const t = new b();
+function* W(o) {
+  const t = new g();
   for (t.enqueue(o); !t.isEmpty(); ) {
     const e = t.dequeue();
     if (e && (yield e, e.nodKids && e.nodKids.length > 0))
@@ -489,8 +494,8 @@ function* S(o) {
         t.enqueue(n);
   }
 }
-function* R(o) {
-  const t = new b();
+function* L(o) {
+  const t = new g();
   for (t.enqueue(o); !t.isEmpty(); ) {
     const e = t.dequeue();
     if (e && (a.cache.mapElem.set(e.unId, e), yield e, e.kids.size() > 0))
@@ -498,12 +503,12 @@ function* R(o) {
         t.enqueue(n);
   }
 }
-function* H(o, t) {
+function* P(o, t) {
   for (const e of t.kids)
     yield* o.NodeLayoutRecursiveIterator(e);
   yield t;
 }
-function q(o, t) {
+function K(o, t) {
   const e = a.cache.mapDirs.get(t.unId);
   if (e === void 0) {
     console.warn(
@@ -514,19 +519,19 @@ function q(o, t) {
   for (const n of t.kids)
     a.cache.mapDirs.set(n.unId, !e), n.kids.size() > 0 && (n.host = t, o.updateChildDirections(n), n.next && a.cache.mapDirs.set(n.next.unId, !e));
 }
-function B(o, t = u.tree) {
+function U(o, t = c.tree) {
   if (!t) return;
-  const e = o.JSONLayoutIterator(t), n = o.NodeLayoutIterator(u.root);
-  for (a.cache.mapDirs.set(u.root.unId, !0); ; ) {
+  const e = o.JSONLayoutIterator(t), n = o.NodeLayoutIterator(c.root);
+  for (a.cache.mapDirs.set(c.root.unId, !0); ; ) {
     const i = e.next(), s = n.next();
     if (i.done || s.done)
       break;
-    const r = i.value, c = s.value;
-    !r || !c || o.createNodeTreeFromJSONTree(r, c);
+    const r = i.value, h = s.value;
+    !r || !h || o.createNodeTreeFromJSONTree(r, h);
   }
   o.calcTabsetCountAndMinDim();
 }
-function M(o, t, e) {
+function $(o, t, e) {
   const n = a.cache.mapDirs.get(e.unId);
   for (const i of t.nodKids || []) {
     const s = o.createNodeFromJSON(i), r = e.kids.peekBack();
@@ -534,39 +539,49 @@ function M(o, t, e) {
   }
   e.type === "tabset" && a.cache.mapElem.set(e.unId, e), e.type === "tab" && a.cache.mapElem.set(e.unId, e);
 }
-function C(o, t, e = u.root) {
-  const n = new b();
-  for (n.enqueue(e), a.cache.mapDirs.set(u.root.unId, !0); !t.isEmpty(); ) {
+function _(o, t, e = c.root) {
+  const n = new g();
+  for (n.enqueue(e), a.cache.mapDirs.set(c.root.unId, !0); !t.isEmpty(); ) {
     const i = n.dequeue();
     if (!i)
       break;
     const s = a.cache.mapDirs.get(i.unId);
+    if (t.size() === 1) {
+      const d = t.dequeue(), l = new a({ type: "tabset", host: i }), m = new a({
+        type: "tab",
+        host: l,
+        name: d,
+        unId: o.tabsIds.get(d ?? "") ?? c.createId()
+      });
+      l.open = m.name, l.kids.enqueue(m), i.kids.enqueue(l), a.cache.mapDirs.set(l.unId, !s), a.cache.mapDirs.set(m.unId, s), a.cache.mapElem.set(l.unId, l), a.cache.mapElem.set(m.unId, m);
+      break;
+    }
     if (t.size() == 2) {
-      const h = t.dequeue(), f = t.dequeue(), m = new a({ type: "tabset", host: i }), p = new a({ type: "tabset", host: i }), I = new a({
+      const d = t.dequeue(), l = t.dequeue(), m = new a({ type: "tabset", host: i }), p = new a({ type: "tabset", host: i }), I = new a({
         type: "tab",
         host: m,
-        name: h,
-        unId: o.tabsIds.get(h ?? "") ?? u.createId()
+        name: d,
+        unId: o.tabsIds.get(d ?? "") ?? c.createId()
       }), y = new a({
         type: "tab",
         host: p,
-        name: f,
-        unId: o.tabsIds.get(f ?? "") ?? u.createId()
+        name: l,
+        unId: o.tabsIds.get(l ?? "") ?? c.createId()
       });
       m.open = I.name, p.open = y.name, m.kids.enqueue(I), p.kids.enqueue(y), i.kids.enqueue(m), i.kids.enqueue(p), p.addBond(i, m), a.cache.mapDirs.set(m.unId, !s), a.cache.mapDirs.set(p.unId, !s), a.cache.mapElem.set(m.unId, m), a.cache.mapElem.set(p.unId, p), a.cache.mapDirs.set(I.unId, s), a.cache.mapDirs.set(y.unId, s), a.cache.mapElem.set(I.unId, I), a.cache.mapElem.set(y.unId, y);
       break;
     }
-    const r = t.dequeue(), c = new a({ type: "tabset", host: i }), d = new a({ type: "row", host: i }), l = new a({
+    const r = t.dequeue(), h = new a({ type: "tabset", host: i }), u = new a({ type: "row", host: i }), f = new a({
       type: "tab",
-      host: c,
+      host: h,
       name: r,
-      unId: o.tabsIds.get(r ?? "") ?? u.createId()
+      unId: o.tabsIds.get(r ?? "") ?? c.createId()
     });
-    c.open = l.name, c.kids.enqueue(l), i.kids.enqueue(c), i.kids.enqueue(d), d.addBond(i, c), a.cache.mapDirs.set(c.unId, !s), a.cache.mapDirs.set(d.unId, !s), a.cache.mapElem.set(c.unId, c), a.cache.mapDirs.set(l.unId, s), a.cache.mapElem.set(l.unId, l), n.enqueue(d);
+    h.open = f.name, h.kids.enqueue(f), i.kids.enqueue(h), i.kids.enqueue(u), u.addBond(i, h), a.cache.mapDirs.set(h.unId, !s), a.cache.mapDirs.set(u.unId, !s), a.cache.mapElem.set(h.unId, h), a.cache.mapDirs.set(f.unId, s), a.cache.mapElem.set(f.unId, f), n.enqueue(u);
   }
   o.calcTabsetCountAndMinDim();
 }
-function F(o, t) {
+function Y(o, t) {
   const e = new a({
     type: t.typNode,
     name: t.nodName,
@@ -575,178 +590,252 @@ function F(o, t) {
     dims: { w: 0, h: 0, x: 0, y: 0 },
     open: typeof t.nodOpen == "string" ? t.nodOpen : ""
   });
-  return t.typNode === "tab" && (e.unId = o.tabsIds.get(t.nodName) || t.uidNode), e;
+  return e.collapsed = t.typNode === "tabset" && t.nodFold === !0, t.typNode === "tab" && (e.unId = o.tabsIds.get(t.nodName) || t.uidNode), e;
+}
+function N(o) {
+  const t = a.cache.mapElem.get(o);
+  return t instanceof a && t.type === "tabset" ? t : null;
+}
+function G(o = c.root) {
+  let t = 0;
+  const e = (n) => {
+    n.type === "tabset" && t++;
+    for (const i of n.kids) e(i);
+  };
+  return e(o), t;
+}
+function v(o) {
+  return o.type === "tabset" && !!o.host && o.host.kids.size() > 1;
+}
+function S() {
+  return G() > 1;
+}
+function R() {
+  const o = c.maximized;
+  return o ? N(o) : null;
+}
+function H(o, t) {
+  let e = null;
+  for (const n of o.kids)
+    n === t || !n.collapsed || (!e || n.foldedAt > e.foldedAt) && (e = n);
+  e && (e.collapsed = !1);
+}
+function J(o = c.root) {
+  let t = !1;
+  const e = (n) => {
+    n.type === "tabset" && (n.unId === c.maximized && (t = !0), n.collapsed && !v(n) && (n.collapsed = !1)), n.type !== "tab" && n.kids.size() > 0 && [...n.kids].every((s) => s.collapsed) && H(n);
+    for (const i of n.kids) e(i);
+  };
+  e(o), t || (c.maximized = null);
+}
+function M(o, t) {
+  return !N(t) || !S() || c.maximized === t ? !1 : (c.maximized = t, o.calcDimensions(), !0);
+}
+function z(o) {
+  return c.maximized ? (c.maximized = null, o.calcDimensions(), !0) : !1;
+}
+function Q(o, t) {
+  return c.maximized === t ? z(o) : M(o, t);
+}
+function q(o, t) {
+  const e = N(t);
+  if (!e || e.collapsed || !v(e)) return !1;
+  c.maximized = null, e.collapsed = !0, e.foldedAt = ++c.foldSeq;
+  const n = e.host;
+  return [...n.kids].every((i) => i.collapsed) && H(n, e), o.calcTabsetCountAndMinDim(), o.calcDimensions(), !0;
+}
+function F(o, t) {
+  const e = N(t);
+  return !e || !e.collapsed ? !1 : (e.collapsed = !1, o.calcTabsetCountAndMinDim(), o.calcDimensions(), !0);
 }
-function W(o, t = u.root, e = !0) {
-  t === u.root && e && (a.cache.tabCnts.clear(), a.cache.dimMins.clear(), a.cache.mapElem.clear(), a.cache.nodOpts.get().clear(), a.cache.bndOpts.get().clear());
+function j(o, t) {
+  const e = N(t);
+  return e ? e.collapsed ? F(o, t) : q(o, t) : !1;
+}
+function V(o, t = c.root, e = !0) {
+  t === c.root && e && (J(t), a.cache.tabCnts.clear(), a.cache.dimMins.clear(), a.cache.mapElem.clear(), a.cache.nodOpts.get().clear(), a.cache.bndOpts.get().clear());
   for (const n of o.NodeLayoutRecursiveIterator(t)) {
     const i = a.cache.tabCnts, s = a.cache.dimMins;
     a.cache.mapElem.set(n.unId, n);
     const r = i.set(n.unId, {
       horizontal: 0,
       vertical: 0
-    }).get(n.unId), c = s.set(n.unId, {
+    }).get(n.unId), h = s.set(n.unId, {
       minWidth: 0,
       minHeight: 0
-    }).get(n.unId), d = a.cache.mapDirs.get(n.unId);
+    }).get(n.unId), u = a.cache.mapDirs.get(n.unId);
     if (n.type === "tab" && (a.cache.mapElem.set(n.unId, n), s.set(n.unId, {
       minWidth: 0,
       minHeight: 0
     })), n.next && a.cache.mapElem.set(n.next.unId, n.next), n.type === "tabset" && (a.cache.mapElem.set(n.unId, n), s.set(n.unId, {
-      minWidth: u.minW,
-      minHeight: u.minH
-    }), d ? i.set(n.unId, {
+      minWidth: c.minW,
+      minHeight: c.minH
+    }), u ? i.set(n.unId, {
       horizontal: 0,
       vertical: 1
     }) : i.set(n.unId, {
       horizontal: 1,
       vertical: 0
-    })), n.type === "row") {
-      for (const l of n.kids) {
-        const h = i.get(l.unId), f = s.get(l.unId);
-        h && (r.horizontal += h.horizontal, r.vertical += h.vertical, d ? (c.minHeight = Math.max(
-          c.minHeight,
-          f.minHeight
-        ), c.minWidth += f.minWidth) : (c.minHeight += f.minHeight, c.minWidth = Math.max(
-          c.minWidth,
-          f.minWidth
+    }), n.collapsed && n.host && (a.cache.mapDirs.get(n.host.unId) ? (s.set(n.unId, {
+      minWidth: c.collapsedSize,
+      minHeight: c.minH
+    }), i.get(n.unId).horizontal = 0) : (s.set(n.unId, {
+      minWidth: c.minW,
+      minHeight: c.collapsedSize
+    }), i.get(n.unId).vertical = 0))), n.type === "row") {
+      for (const f of n.kids) {
+        const d = i.get(f.unId), l = s.get(f.unId);
+        d && (r.horizontal += d.horizontal, r.vertical += d.vertical, u ? (h.minHeight = Math.max(
+          h.minHeight,
+          l.minHeight
+        ), h.minWidth += l.minWidth) : (h.minHeight += l.minHeight, h.minWidth = Math.max(
+          h.minWidth,
+          l.minWidth
         )));
       }
-      d ? c.minWidth += (n.kids.size() - 1) * u.bond : c.minHeight += (n.kids.size() - 1) * u.bond;
+      u ? h.minWidth += (n.kids.size() - 1) * c.bond : h.minHeight += (n.kids.size() - 1) * c.bond;
     }
   }
-  t === u.root && e && o.pruneStaleDirections();
+  t === c.root && e && o.pruneStaleDirections();
 }
-function L() {
+function X() {
   for (const o of a.cache.mapDirs.keys())
     a.cache.mapElem.has(o) || a.cache.mapDirs.delete(o);
 }
-function P() {
-  const o = u.root.getReqDimension();
-  let t = !1, e = u.root.dims.w, n = u.root.dims.h;
-  return u.root.dims.w < o.width && (e = o.width, t = !0), u.root.dims.h < o.height && (n = o.height, t = !0), t && (u.root.dims.w = e, u.root.dims.h = n), {
+function Z() {
+  const o = c.root.getReqDimension();
+  let t = !1, e = c.root.dims.w, n = c.root.dims.h;
+  return c.root.dims.w < o.width && (e = o.width, t = !0), c.root.dims.h < o.height && (n = o.height, t = !0), t && (c.root.dims.w = e, c.root.dims.h = n), {
     adjustedW: e,
     adjustedH: n,
     wasAdjusted: t
   };
 }
-function z(o, t = u.root, e = !1) {
-  const n = t === u.root, i = (d) => n ? /* @__PURE__ */ new Map() : new Map(d.get()), s = i(a.cache.nodOpts), r = i(a.cache.bndOpts), c = i(a.cache.tabOpts);
+function tt(o, t = c.root, e = !1) {
+  const n = t === c.root, i = (d) => n ? /* @__PURE__ */ new Map() : new Map(d.get()), s = i(a.cache.nodOpts), r = i(a.cache.bndOpts), h = i(a.cache.tabOpts);
   n && o.calculateRootAdjustment();
+  const u = R(), f = S();
   for (const d of o.NodeLayoutIterator(t)) {
     d.calcDimensions();
     const l = a.cache.mapDirs.get(d.unId);
     if (d.type === "tabset") {
-      const h = {
+      const m = d === u, p = !!u && !m, I = m ? { ...c.root.dims } : { ...d.dims }, y = {
         typNode: d.type,
         nodName: d.name,
         uidNode: d.unId,
         nodPart: d.part,
         nodOpen: d.open,
         nodeDir: l,
-        nodKids: Array.from(d.kids).map((f) => {
-          const m = {
-            typNode: f.type,
-            nodName: f.name,
-            uidNode: f.unId,
-            nodPart: f.part,
-            nodOpen: d.open === f.name,
+        nodFold: d.collapsed && !m,
+        nodMaxd: m,
+        nodHidden: p,
+        nodFoldable: v(d),
+        nodMaximizable: f,
+        nodKids: Array.from(d.kids).map((b) => {
+          const k = {
+            typNode: b.type,
+            nodName: b.name,
+            uidNode: b.unId,
+            nodPart: b.part,
+            nodOpen: d.open === b.name,
             nodeDir: !l,
-            nodDims: {
-              ...d.dims
-            }
+            nodHidden: p,
+            nodFold: d.collapsed && !m,
+            nodDims: { ...I }
           };
-          return c.set(f.unId, m), m;
+          return h.set(b.unId, k), k;
         }),
-        nodDims: {
-          ...d.dims
-        }
+        nodDims: I
       };
-      s.set(d.unId, h);
+      s.set(d.unId, y);
     }
     if (d.next && d.type !== "tab") {
-      const h = {
+      const m = {
         typNode: "bond",
         nodName: d.name,
         uidNode: d.next.unId,
         nodeDir: l,
         nodPart: 0,
+        nodHidden: !!u,
+        nodLocked: d.collapsed || !!d.next.next?.collapsed,
         nodDims: {
           ...d.next.dims
         }
       };
-      r.set(d.next.unId, h);
+      r.set(d.next.unId, m);
     }
   }
-  a.cache.nodOpts.set(s, e), a.cache.bndOpts.set(r, e), a.cache.tabOpts.set(c, e);
+  a.cache.nodOpts.set(s, e), a.cache.bndOpts.set(r, e), a.cache.tabOpts.set(h, e);
 }
-function K(o, t, e = !1, n = 2) {
-  if (u.root.dims = t, e) {
-    o.calcDimensions(u.root);
+function et(o, t, e = !1, n = 2) {
+  if (c.root.dims = t, e) {
+    o.calcDimensions(c.root);
     return;
   }
-  o.cntdown && (u.timer.clear(o.cntdown), o.cntdown = null), o.cntdown = u.timer.set(() => {
+  o.cntdown && (c.timer.clear(o.cntdown), o.cntdown = null), o.cntdown = c.timer.set(() => {
     o.cntdown = null, o.calcDimensions();
   }, n);
 }
-function U(o, t, e, n = !1, i = 2) {
+function nt(o, t, e, n = !1, i = 2) {
   if (n) {
     o.updateSliderDimension(t, e);
     return;
   }
-  o.cntdown && (u.timer.clear(o.cntdown), o.cntdown = null), o.cntdown = u.timer.set(() => {
+  o.cntdown && (c.timer.clear(o.cntdown), o.cntdown = null), o.cntdown = c.timer.set(() => {
     o.cntdown = null, o.updateSliderDimension(t, e);
   }, i);
 }
-function $(o, t, e) {
+function it(o, t, e) {
   const n = a.cache.mapElem.get(t);
-  if (!n || !(n instanceof O)) {
+  if (!n || !(n instanceof A)) {
     console.warn(`Bond with id ${t} not found or is not a Bond instance`);
     return;
   }
-  const i = a.cache.mapDirs.get(n.host.unId), s = n.prev, r = n.next, c = n.host;
-  if (!s || !r || !c) {
-    console.warn("Missing prev, next, or host node", s, r, c);
+  const i = a.cache.mapDirs.get(n.host.unId), s = n.prev, r = n.next, h = n.host;
+  if (!s || !r || !h) {
+    console.warn("Missing prev, next, or host node", s, r, h);
     return;
   }
-  const d = a.cache.dimMins.get(s.unId) || {
+  if (s.collapsed || r.collapsed || c.maximized)
+    return;
+  const u = a.cache.dimMins.get(s.unId) || {
     minWidth: 0,
     minHeight: 0
-  }, l = a.cache.dimMins.get(r.unId) || {
+  }, f = a.cache.dimMins.get(r.unId) || {
     minWidth: 0,
     minHeight: 0
-  }, h = u.bond / 2;
+  }, d = c.bond / 2;
   if (i) {
-    const f = r.dims.x + r.dims.w, m = s.dims.x + d.minWidth + h, p = f - l.minWidth - h, I = Math.max(m, Math.min(p, e.x));
-    n.dims.x = I - h, s.dims.w = n.dims.x - s.dims.x, r.dims.x = I + h, r.dims.w = f - r.dims.x;
-    const y = Math.max(0, s.dims.w - d.minWidth), g = Math.max(0, r.dims.w - l.minWidth), k = y + g, N = s.part + r.part;
-    k > 0 ? (s.part = y / k * N, r.part = g / k * N) : (s.part = N / 2, r.part = N / 2);
+    const l = r.dims.x + r.dims.w, m = s.dims.x + u.minWidth + d, p = l - f.minWidth - d, I = Math.max(m, Math.min(p, e.x));
+    n.dims.x = I - d, s.dims.w = n.dims.x - s.dims.x, r.dims.x = I + d, r.dims.w = l - r.dims.x;
+    const y = Math.max(0, s.dims.w - u.minWidth), b = Math.max(0, r.dims.w - f.minWidth), k = y + b, x = s.part + r.part;
+    k > 0 ? (s.part = y / k * x, r.part = b / k * x) : (s.part = x / 2, r.part = x / 2);
   } else {
-    const f = r.dims.y + r.dims.h, m = s.dims.y + d.minHeight + h, p = f - l.minHeight - h, I = Math.max(m, Math.min(p, e.y));
-    n.dims.y = I - h, s.dims.h = n.dims.y - s.dims.y, r.dims.y = I + h, r.dims.h = f - r.dims.y;
-    const y = Math.max(0, s.dims.h - d.minHeight), g = Math.max(0, r.dims.h - l.minHeight), k = y + g, N = s.part + r.part;
-    k > 0 ? (s.part = y / k * N, r.part = g / k * N) : (s.part = N / 2, r.part = N / 2);
+    const l = r.dims.y + r.dims.h, m = s.dims.y + u.minHeight + d, p = l - f.minHeight - d, I = Math.max(m, Math.min(p, e.y));
+    n.dims.y = I - d, s.dims.h = n.dims.y - s.dims.y, r.dims.y = I + d, r.dims.h = l - r.dims.y;
+    const y = Math.max(0, s.dims.h - u.minHeight), b = Math.max(0, r.dims.h - f.minHeight), k = y + b, x = s.part + r.part;
+    k > 0 ? (s.part = y / k * x, r.part = b / k * x) : (s.part = x / 2, r.part = x / 2);
   }
-  o.calcDimensions(c);
+  o.calcDimensions(h);
 }
-function _(o, t, e, n) {
+function ot(o, t, e, n) {
   const i = a.cache.mapElem.get(t);
   let s = a.cache.mapElem.get(e);
   return !i || !(i instanceof a) || !s || !(s instanceof a) ? (console.warn(`Source node ${t} not found or is not a Node instance`), !1) : i?.type == "tab" && i.host === s && s.kids.size() < 2 ? (console.warn("Cannot move to self as it has only one tab"), !1) : i?.type == "tabset" && s?.host === i ? (console.warn("Cannot move tabset to self as it is already a child"), !1) : !i || !s ? (console.warn(`Source or destination node not found: ${t}, ${e}`), !1) : i === s ? (console.warn(
     "Source and destination nodes are the same, no action taken."
   ), !1) : !i.host || !s.host && s.type !== "row" ? (console.warn(
     `Source node or destination node's host is null: ${i.unId}, ${s.unId}`
-  ), !1) : s.type === "row" && s !== u.root ? (console.warn(`Cannot move relative to a nested row: ${s.unId}`), !1) : s.type === "row" && n === "contain" ? (console.warn(
+  ), !1) : s.type === "row" && s !== c.root ? (console.warn(`Cannot move relative to a nested row: ${s.unId}`), !1) : s.type === "row" && n === "contain" ? (console.warn(
     `Cannot move to a row with 'contain' layout: ${s.unId}`
-  ), !1) : i.type === "row" || (s.type === "tabset" && n === "contain" && (s = s.kids.peekBack() || s), i === s) ? !1 : o.isOnlyContent(i) ? (console.warn("Cannot move the only tabset or tab in the layout"), !1) : (s.type === "tab" && (n === "contain" || n === "left" || n === "right") ? o.moveNodeAsTab(i, s, n) : s.type === "row" && n !== "contain" ? o.moveRelativeToRoot(i, s, n) : s.type === "tabset" && n !== "contain" && o.moveRelativeToTabset(i, s, n), o.calcTabsetCountAndMinDim(), o.calcDimensions(u.root, !0), !0);
+  ), !1) : i.type === "row" || (s.type === "tabset" && n === "contain" && (s = s.kids.peekBack() || s), i === s) ? !1 : o.isOnlyContent(i) ? (console.warn("Cannot move the only tabset or tab in the layout"), !1) : (c.maximized = null, i.collapsed = !1, s.type === "tab" && (n === "contain" || n === "left" || n === "right") ? o.moveNodeAsTab(i, s, n) : s.type === "row" && n !== "contain" ? o.moveRelativeToRoot(i, s, n) : s.type === "tabset" && n !== "contain" && o.moveRelativeToTabset(i, s, n), o.calcTabsetCountAndMinDim(), o.calcDimensions(c.root, !0), !0);
 }
-function Y(o, t) {
+function st(o, t) {
   let e = 0;
-  for (const n of o.NodeLayoutRecursiveIterator(u.root))
+  for (const n of o.NodeLayoutRecursiveIterator(c.root))
     n.type === "tabset" && e++;
   return e !== 1 ? !1 : t.type === "tabset" || t.type === "tab" && t.host?.kids.size() === 1;
 }
-function G(o, t, e, n) {
+function at(o, t, e, n) {
   if (!e || !e.host) {
     console.warn(`Destination node ${e.unId} has no host, cannot move.`);
     return;
@@ -755,39 +844,39 @@ function G(o, t, e, n) {
   const i = e.host, s = i.kids.indexOf(e);
   if (s === void 0 || s === -1)
     return;
-  const r = n === "contain" || n === "left", c = r ? s : s + 1, d = i.kids.get(c + 1), l = i.kids.get(c - 1), h = e.next, f = e.prev;
-  if (!r && h ? a.cache.mapElem.delete(h.unId) : r && f && a.cache.mapElem.delete(f.unId), t.type == "tab")
-    r ? (l && t.addBond(i, l), e.addBond(i, t)) : (t.addBond(i, e), d && d.addBond(i, t)), i.kids.insert(c, t), t.host = i, i.open = t.name;
+  const r = n === "contain" || n === "left", h = r ? s : s + 1, u = i.kids.get(h + 1), f = i.kids.get(h - 1), d = e.next, l = e.prev;
+  if (!r && d ? a.cache.mapElem.delete(d.unId) : r && l && a.cache.mapElem.delete(l.unId), t.type == "tab")
+    r ? (f && t.addBond(i, f), e.addBond(i, t)) : (t.addBond(i, e), u && u.addBond(i, t)), i.kids.insert(h, t), t.host = i, i.open = t.name, i.collapsed = !1;
   else if (t.type == "tabset") {
     const m = t.kids.peek(), p = t.kids.peekBack();
-    r ? (m && l && m.addBond(i, l), p && e && e.addBond(i, p)) : (m && e && m.addBond(i, e), p && d && d.addBond(i, p)), i.kids.insertQueue(c, t.kids);
+    r ? (m && f && m.addBond(i, f), p && e && e.addBond(i, p)) : (m && e && m.addBond(i, e), p && u && u.addBond(i, p)), i.kids.insertQueue(h, t.kids);
     for (const I of t.kids)
       I.host = i, I.next && (I.next.host = i);
-    i.open = p ? p.name : "";
+    i.open = p ? p.name : "", i.collapsed = !1;
   }
   o.updateChildDirections(i);
 }
-const J = {
+const rt = {
   root: (o, t) => o === t,
   tabset: (o, t) => o !== t
 };
-function D(o, t, e, n, i) {
+function B(o, t, e, n, i) {
   if (o.removeNode(t), t.type !== "tab" && t.type !== "tabset") return;
-  const s = a.cache.mapDirs.get(e.unId) === !1, r = n === "left" || n === "right", c = n === "top" || n === "left";
-  let d = t;
-  t.type === "tab" && (d = new a({ type: "tabset", host: e.host }), d.kids.enqueue(t), d.open = t.name, t.host = d), J[i](s, r) ? o.insertNodeWithNewParent(d, e, c) : o.insertNode(e, d, c);
+  const s = a.cache.mapDirs.get(e.unId) === !1, r = n === "left" || n === "right", h = n === "top" || n === "left";
+  let u = t;
+  t.type === "tab" && (u = new a({ type: "tabset", host: e.host }), u.kids.enqueue(t), u.open = t.name, t.host = u), rt[i](s, r) ? o.insertNodeWithNewParent(u, e, h) : o.insertNode(e, u, h);
 }
-function Q(o, t, e, n) {
-  D(o, t, e, n, "root");
+function dt(o, t, e, n) {
+  B(o, t, e, n, "root");
 }
-function j(o, t, e, n) {
-  D(o, t, e, n, "tabset");
+function ct(o, t, e, n) {
+  B(o, t, e, n, "tabset");
 }
-function X(o, t, e, n) {
+function ht(o, t, e, n) {
   const i = t.host;
-  if (t == u.root) {
-    const f = u.root.kids.peek(), m = u.root.kids.peekBack();
-    n ? (u.root.kids.enqueueFront(e), f && f.addBond(u.root, e)) : (u.root.kids.enqueue(e), m && e.addBond(u.root, m)), e.host = u.root, o.updateChildDirections(u.root);
+  if (t == c.root) {
+    const l = c.root.kids.peek(), m = c.root.kids.peekBack();
+    n ? (c.root.kids.enqueueFront(e), l && l.addBond(c.root, e)) : (c.root.kids.enqueue(e), m && e.addBond(c.root, m)), e.host = c.root, o.updateChildDirections(c.root);
     return;
   }
   if (!i) {
@@ -803,79 +892,79 @@ function X(o, t, e, n) {
   }
   const r = a.cache.mapDirs.get(i.unId);
   r && a.cache.mapDirs.set(e.unId, !r);
-  const c = i.kids.get(s + 1), d = i.kids.get(s - 1), l = t.next, h = t.prev;
-  e.host = i, n ? (i.kids.insert(s, e), t.addBond(i, e), d && e.addBond(i, d), h && a.cache.mapElem.delete(h.unId)) : (i.kids.insert(s + 1, e), e.addBond(i, t), c && c.addBond(i, e), l && a.cache.mapElem.delete(l.unId)), o.updateChildDirections(i);
+  const h = i.kids.get(s + 1), u = i.kids.get(s - 1), f = t.next, d = t.prev;
+  e.host = i, n ? (i.kids.insert(s, e), t.addBond(i, e), u && e.addBond(i, u), d && a.cache.mapElem.delete(d.unId)) : (i.kids.insert(s + 1, e), e.addBond(i, t), h && h.addBond(i, e), f && a.cache.mapElem.delete(f.unId)), o.updateChildDirections(i);
 }
-function V(o, t, e, n) {
-  const i = new b(), s = new a({ type: "tabset", host: e.host });
+function ut(o, t, e, n) {
+  const i = new g(), s = new a({ type: "tabset", host: e.host });
   if (!e || !t) {
     console.warn(`Destination node ${e.unId} has no host, cannot insert.`);
     return;
   }
-  if (e === u.root) {
-    const c = new a({ type: "row", host: e });
+  if (e === c.root) {
+    const h = new a({ type: "row", host: e });
     if (e.kids.size() === 0)
       e.kids.enqueue(t), t.host = e;
     else if (e.kids.size() == 1 && e.kids.peek()?.type === "tabset") {
-      const d = e.kids.dequeue();
-      if (!d) {
+      const u = e.kids.dequeue();
+      if (!u) {
         console.warn(
           `No kid found in destination node ${e.unId}, cannot insert.`
         );
         return;
       }
-      n ? (c.kids.enqueue(t), c.kids.enqueue(d), e.kids.enqueue(c), d.addBond(c, t)) : (c.kids.enqueue(d), c.kids.enqueue(t), t.addBond(c, d), e.kids.enqueue(c)), t.host = c, d.host = c;
+      n ? (h.kids.enqueue(t), h.kids.enqueue(u), e.kids.enqueue(h), u.addBond(h, t)) : (h.kids.enqueue(u), h.kids.enqueue(t), t.addBond(h, u), e.kids.enqueue(h)), t.host = h, u.host = h;
     } else if (e.kids.size() == 1 && e.kids.peek()?.type === "row") {
-      const d = e.kids.peek(), l = d?.kids.peek(), h = d?.kids.peekBack();
-      n && d ? (d.kids.enqueueFront(t), l && l.addBond(d, t)) : d && (d.kids.enqueue(t), h && t.addBond(d, h)), t.host = d;
+      const u = e.kids.peek(), f = u?.kids.peek(), d = u?.kids.peekBack();
+      n && u ? (u.kids.enqueueFront(t), f && f.addBond(u, t)) : u && (u.kids.enqueue(t), d && t.addBond(u, d)), t.host = u;
     } else if (e.kids.size() > 1) {
-      const d = new a({ type: "row", host: e }), l = new a({ type: "row", host: d });
-      for (const h of e.kids)
-        l.kids.enqueue(h), h.host = l, h.next && (h.next.host = l);
-      t.host = d, e.kids.clear(), n ? (d.kids.enqueueFront(t), d.kids.enqueue(l), l.addBond(d, t)) : (d.kids.enqueue(l), d.kids.enqueue(t), t.addBond(d, l)), e.kids.enqueue(d);
+      const u = new a({ type: "row", host: e }), f = new a({ type: "row", host: u });
+      for (const d of e.kids)
+        f.kids.enqueue(d), d.host = f, d.next && (d.next.host = f);
+      t.host = u, e.kids.clear(), n ? (u.kids.enqueueFront(t), u.kids.enqueue(f), f.addBond(u, t)) : (u.kids.enqueue(f), u.kids.enqueue(t), t.addBond(u, f)), e.kids.enqueue(u);
     }
     o.updateChildDirections(e);
     return;
   }
   t.host = e, s.host = e, s.kids = e.kids, s.open = e.open;
   const r = a.cache.mapDirs.get(e.unId);
-  for (const c of s.kids)
-    c.host = s, c.next && (c.next.host = s), a.cache.mapDirs.set(c.unId, r);
-  for (const c of t.kids)
-    c.host = t, c.next && (c.next.host = t), a.cache.mapDirs.set(c.unId, r);
+  for (const h of s.kids)
+    h.host = s, h.next && (h.next.host = s), a.cache.mapDirs.set(h.unId, r);
+  for (const h of t.kids)
+    h.host = t, h.next && (h.next.host = t), a.cache.mapDirs.set(h.unId, r);
   a.cache.mapDirs.set(s.unId, !r), a.cache.mapDirs.set(t.unId, !r), n ? (i.enqueue(t), i.enqueue(s), e.kids = i, e.type = "row", s.addBond(e, t)) : (i.enqueue(s), i.enqueue(t), e.kids = i, e.type = "row", t.addBond(e, s));
 }
-function Z(o, t) {
+function lt(o, t) {
   if (!t.host || !t.host.host) {
     console.warn(`Source node ${t.unId} has no host, cannot move.`);
     return;
   }
-  const e = t.host, n = t.host.host, i = n.kids.indexOf(e), s = n.kids.get(i - 1), r = n.kids.get(i + 1), c = t.kids.peek(), d = t.kids.peekBack();
+  const e = t.host, n = t.host.host, i = n.kids.indexOf(e), s = n.kids.get(i - 1), r = n.kids.get(i + 1), h = t.kids.peek(), u = t.kids.peekBack();
   o.removeKid(e);
-  let l = i;
+  let f = i;
   if (t.type == "row" && e) {
-    s && c && c.addBond(n, s), r && d && r.addBond(n, d);
-    for (const h of t.kids)
-      h.host = n, h.next && (h.next.host = n), n.kids.insert(l, h), a.cache.mapDirs.set(
-        h.unId,
+    s && h && h.addBond(n, s), r && u && r.addBond(n, u);
+    for (const d of t.kids)
+      d.host = n, d.next && (d.next.host = n), n.kids.insert(f, d), a.cache.mapDirs.set(
+        d.unId,
         !a.cache.mapDirs.get(n.unId)
-      ), a.cache.dimMins.delete(h.unId), l++;
+      ), a.cache.dimMins.delete(d.unId), f++;
   } else if (t.type == "tabset") {
-    s && t.addBond(n, s), r && r.addBond(n, t), n.kids.insert(l, t), t.host = n, a.cache.mapDirs.set(t.unId, !a.cache.mapDirs.get(n.unId));
-    for (const h of t.kids)
+    s && t.addBond(n, s), r && r.addBond(n, t), n.kids.insert(f, t), t.host = n, a.cache.mapDirs.set(t.unId, !a.cache.mapDirs.get(n.unId));
+    for (const d of t.kids)
       a.cache.mapDirs.set(
-        h.unId,
+        d.unId,
         a.cache.mapDirs.get(n.unId)
-      ), a.cache.dimMins.delete(h.unId);
+      ), a.cache.dimMins.delete(d.unId);
   }
 }
-function tt(o, t = !0) {
+function ft(o, t = !0) {
   const e = o.host, n = o.prev, i = o.next;
   if (o.host = null, o.next = null, o.prev = null, n && (n.next = null), i && (i.prev = null), !t)
     return o;
   n && i && n.prev && i.next ? n.prev.addBond(e, i.next) : n && n.prev ? n.prev.next = null : i && i.next && (i.next.prev = null);
 }
-function et(o, t) {
+function mt(o, t) {
   if (!t.host) {
     console.warn("Kid node has no host, cannot remove.");
     return;
@@ -895,7 +984,7 @@ function et(o, t) {
     i && (e.open = i.name);
   }
 }
-function nt(o) {
+function pt(o) {
   if (!o.host) {
     console.warn("Kid node has no host, cannot remove.");
     return;
@@ -907,45 +996,45 @@ function nt(o) {
   }
   s && a.cache.mapElem.delete(s.unId), r && a.cache.mapElem.delete(r.unId), n && i ? n.addBond(t, i) : n ? n.prev = null : i && (i.next = null), t.kids.removeAt(e), a.cache.mapElem.delete(o.unId), a.cache.dimMins.delete(o.unId), a.cache.mapDirs.delete(o.unId), a.cache.tabCnts.delete(o.unId), o.type === "tabset" && a.cache.mapElem.delete(o.unId), o.type === "tab" && a.cache.mapElem.delete(o.unId), o.host = null, o.next = null, o.prev = null;
 }
-function it() {
+function It() {
   a.cache.dimMins.clear(), a.cache.mapDirs.clear(), a.cache.tabCnts.clear(), a.cache.mapElem.clear(), a.cache.nodOpts.get().clear(), a.cache.bndOpts.get().clear();
 }
 class w {
   static get _root() {
-    return u.root;
+    return c.root;
   }
   static set _root(t) {
-    u.root = t;
+    c.root = t;
   }
   static get _tree() {
-    return u.tree;
+    return c.tree;
   }
   static set _tree(t) {
-    u.tree = t;
+    c.tree = t;
   }
   static get _minW() {
-    return u.minW;
+    return c.minW;
   }
   static set _minW(t) {
-    u.minW = t;
+    c.minW = t;
   }
   static get _minH() {
-    return u.minH;
+    return c.minH;
   }
   static set _minH(t) {
-    u.minH = t;
+    c.minH = t;
   }
   static get _bond() {
-    return u.bond;
+    return c.bond;
   }
   static set _bond(t) {
-    u.bond = t;
+    c.bond = t;
   }
   static get _inst() {
-    return u.inst;
+    return c.inst;
   }
   static set _inst(t) {
-    u.inst = t;
+    c.inst = t;
   }
   nodeOps;
   cntdown = null;
@@ -961,109 +1050,130 @@ class w {
       tabsIds: /* @__PURE__ */ new Map(),
       ...t
     };
-    this.tabsIds = e.tabsIds, u.createId = e.createId ?? v, u.timer = e.timer ?? T, w._tree = e.tree ?? null, w._root = new a({
+    this.tabsIds = e.tabsIds, c.createId = e.createId ?? D, c.timer = e.timer ?? O, c.collapsedSize = e.collapsedSize ?? e.minH, w._tree = e.tree ?? null, c.maximized = e.tree?.nodMaxd ?? null, w._root = new a({
       unId: e.uqid,
       name: e.uqid,
       type: "row"
-    }), this.nodeOps = x(
+    }), this.nodeOps = T(
       /* @__PURE__ */ new Map(),
       E
     ), w._minW = e.minW, w._minH = e.minH, w._bond = e.bond;
-    const n = new b(e.tabs.length, e.tabs);
+    const n = new g(e.tabs.length, e.tabs);
     w._tree ? this.createNodeLayout() : this.createBinaryNodeTreeFromQueue(n), w._inst = this;
   }
   *JSONLayoutIterator(t) {
-    yield* S(t);
+    yield* W(t);
   }
   *NodeLayoutIterator(t) {
-    yield* R(t);
+    yield* L(t);
   }
   *NodeLayoutRecursiveIterator(t) {
-    yield* H(this, t);
+    yield* P(this, t);
   }
   updateChildDirections(t) {
-    return q(this, t);
+    return K(this, t);
   }
   createNodeLayout(t = w._tree) {
-    return B(this, t);
+    return U(this, t);
   }
   createNodeTreeFromJSONTree(t, e) {
-    return M(this, t, e);
+    return $(this, t, e);
   }
   createBinaryNodeTreeFromQueue(t, e = w._root) {
-    return C(this, t, e);
+    return _(this, t, e);
   }
   createNodeFromJSON(t) {
-    return F(this, t);
+    return Y(this, t);
   }
   calcTabsetCountAndMinDim(t = w._root, e = !0) {
-    return W(this, t, e);
+    return V(this, t, e);
   }
   pruneStaleDirections() {
-    return L();
+    return X();
   }
   calculateRootAdjustment() {
-    return P();
+    return Z();
   }
   calcDimensions(t = w._root, e = !1) {
-    return z(this, t, e);
+    return tt(this, t, e);
   }
   updateDimension(t, e = !1, n = 2) {
-    return K(this, t, e, n);
+    return et(this, t, e, n);
   }
   updateSlider(t, e, n = !1, i = 2) {
-    return U(this, t, e, n, i);
+    return nt(this, t, e, n, i);
   }
   updateSliderDimension(t, e) {
-    return $(this, t, e);
+    return it(this, t, e);
   }
   updateTree(t, e, n) {
-    return _(this, t, e, n);
+    return ot(this, t, e, n);
   }
   isOnlyContent(t) {
-    return Y(this, t);
+    return st(this, t);
   }
   moveNodeAsTab(t, e, n) {
-    return G(this, t, e, n);
+    return at(this, t, e, n);
   }
   moveRelativeToRoot(t, e, n) {
-    return Q(this, t, e, n);
+    return dt(this, t, e, n);
   }
   moveRelativeToTabset(t, e, n) {
-    return j(this, t, e, n);
+    return ct(this, t, e, n);
   }
   insertNode(t, e, n) {
-    return X(this, t, e, n);
+    return ht(this, t, e, n);
   }
   insertNodeWithNewParent(t, e, n) {
-    return V(this, t, e, n);
+    return ut(this, t, e, n);
   }
   moveAdjacentNodeToGrandParent(t) {
-    return Z(this, t);
+    return lt(this, t);
   }
   removeRelation(t, e = !0) {
-    return tt(t, e);
+    return ft(t, e);
   }
   removeNode(t) {
-    return et(this, t);
+    return mt(this, t);
   }
   removeKid(t) {
-    return nt(t);
+    return pt(t);
   }
   clearAllCache() {
-    return it();
+    return It();
+  }
+  get maximizedId() {
+    return R()?.unId ?? null;
+  }
+  maximize(t) {
+    return M(this, t);
+  }
+  restore() {
+    return z(this);
+  }
+  toggleMaximize(t) {
+    return Q(this, t);
+  }
+  collapse(t) {
+    return q(this, t);
+  }
+  expand(t) {
+    return F(this, t);
+  }
+  toggleCollapse(t) {
+    return j(this, t);
   }
 }
-const ot = 6;
-function st(o, t, e) {
-  const { left: n, top: i, width: s, height: r } = o, c = t - n, d = e - i;
-  return c < s / 3 ? { area: "left", left: n, top: i, width: s / 2, height: r } : c > 2 * s / 3 ? {
+const yt = 6;
+function bt(o, t, e) {
+  const { left: n, top: i, width: s, height: r } = o, h = t - n, u = e - i;
+  return h < s / 3 ? { area: "left", left: n, top: i, width: s / 2, height: r } : h > 2 * s / 3 ? {
     area: "right",
     left: n + s / 2,
     top: i,
     width: s / 2,
     height: r
-  } : d < r / 3 ? { area: "top", left: n, top: i, width: s, height: r / 2 } : d > 2 * r / 3 ? {
+  } : u < r / 3 ? { area: "top", left: n, top: i, width: s, height: r / 2 } : u > 2 * r / 3 ? {
     area: "bottom",
     left: n,
     top: i + r / 2,
@@ -1077,7 +1187,7 @@ function st(o, t, e) {
     height: r * 0.8
   };
 }
-function at(o, t) {
+function kt(o, t) {
   const { x: e, y: n, w: i, h: s } = o;
   switch (t) {
     case "left":
@@ -1102,10 +1212,10 @@ function at(o, t) {
       };
   }
 }
-function rt(o, t, e, n) {
+function xt(o, t, e, n) {
   if (t.length === 0 || n < o.top || n > o.bottom) return null;
   const i = t[0], s = t[t.length - 1];
-  let r = ot;
+  let r = yt;
   if (e > s.right)
     return {
       index: t.length - 1,
@@ -1124,30 +1234,30 @@ function rt(o, t, e, n) {
       width: r - 2,
       height: i.height
     };
-  let c = 0, d = 1 / 0, l = !1;
+  let h = 0, u = 1 / 0, f = !1;
   t.forEach((m, p) => {
     const I = m.left + m.width / 2, y = Math.abs(e - I);
-    y < d && (d = y, c = p, l = e < I);
+    y < u && (u = y, h = p, f = e < I);
   });
-  const h = l ? c > 0 : c < t.length - 1;
-  t.length > 1 && h && (r = t[1].left - i.right);
-  const f = t[c];
+  const d = f ? h > 0 : h < t.length - 1;
+  t.length > 1 && d && (r = t[1].left - i.right);
+  const l = t[h];
   return {
-    index: c,
-    area: l ? "left" : "right",
-    left: l ? f.left - r + 1 : f.right + 1,
-    top: f.top,
+    index: h,
+    area: f ? "left" : "right",
+    left: f ? l.left - r + 1 : l.right + 1,
+    top: l.top,
     width: r - 2,
-    height: f.height
+    height: l.height
   };
 }
-function dt(o, t) {
+function gt(o, t) {
   return o.area === t.area && o.left === t.left && o.top === t.top && o.width === t.width && o.height === t.height;
 }
-function ct(o, { x: t, y: e, w: n, h: i }) {
+function wt(o, { x: t, y: e, w: n, h: i }) {
   o.style.left = `${t}px`, o.style.top = `${e}px`, o.style.width = `${n}px`, o.style.height = `${i}px`;
 }
-function ht(o, t) {
+function Nt(o, t) {
   return {
     x: o.x,
     y: o.y + t,
@@ -1155,7 +1265,14 @@ function ht(o, t) {
     h: Math.max(0, o.h - t)
   };
 }
-function ut(o) {
+function Tt(o, t) {
+  const { x: e, y: n, w: i, h: s } = o.nodDims, r = o.nodeDir === !1;
+  return o.nodFold && r ? { rect: { x: e + i, y: n, w: s, h: i }, rotated: !0 } : { rect: { x: e, y: n, w: i, h: t }, rotated: !1 };
+}
+function Et(o, t) {
+  wt(o, t.rect), o.style.transformOrigin = "0 0", o.style.transform = t.rotated ? "rotate(90deg)" : "";
+}
+function vt(o) {
   let t = null, e = null;
   const n = () => {
     e = null;
@@ -1245,18 +1362,20 @@ SOFTWARE.
   });
 })();
 export {
-  O as Bond,
+  A as Bond,
   w as DynamixLayoutCore,
   a as Node,
-  b as Queue,
-  A as areNodeOptionsEqual,
+  g as Queue,
+  C as areNodeOptionsEqual,
   E as areNodeOptionsMapEqual,
-  ut as createFrameScheduler,
-  x as createReactiveState,
-  rt as getNavbarDropPreview,
-  at as getRootSplitPreview,
-  ht as getTabBodyRect,
-  st as getTabsetDropPreview,
-  dt as isSameDropPreview,
-  ct as setElementRect
+  vt as createFrameScheduler,
+  T as createReactiveState,
+  xt as getNavbarDropPreview,
+  kt as getRootSplitPreview,
+  Nt as getTabBodyRect,
+  Tt as getTabbarPlacement,
+  bt as getTabsetDropPreview,
+  gt as isSameDropPreview,
+  Et as placeTabbar,
+  wt as setElementRect
 };