@synnaxlabs/pluto 0.53.1 → 0.54.0

package/dist/theming.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});require("./Provider-cSwm-2e_.cjs");const e=require("./external-DTi9a-iK.cjs");exports.Theming=e.external;
+Object.defineProperty(exports,Symbol.toStringTag,{value:`Module`});const e=require(`./theming-KFfFjsRJ.cjs`);Object.defineProperty(exports,`Theming`,{enumerable:!0,get:function(){return e.t}});

package/dist/theming.js

@@ -1,5 +1,2 @@
-import "./Provider-jFWpR0CX.js";
-import { e as r } from "./external-B9PnwQOL.js";
-export {
-  r as Theming
-};
+import { t as e } from "./theming-Blgv4Cvi.js";
+export { e as Theming };

package/dist/tree-B4jJAzS1.js

@@ -0,0 +1,294 @@
+import { n as e } from "./chunk-DeC0fbbY.js";
+import { h as t } from "./types-BGbd8pRh.js";
+import { B as n, Ct as r, It as i } from "./triggers-DDlalLoO.js";
+import "./theming-Blgv4Cvi.js";
+import { c as a, f as o } from "./text-Dd6wYgQM.js";
+import { n as s } from "./css-UEo6g0SR.js";
+import { f as c, g as l } from "./select-B93mFqvf.js";
+import { r as u } from "./dialog-ClQI4sHo.js";
+import { a as d } from "./list-dZDsxTzd.js";
+import { array as f, unique as p } from "@synnaxlabs/x";
+import { useCallback as m, useMemo as h } from "react";
+import { jsx as g, jsxs as _ } from "react/jsx-runtime";
+//#region src/tree/base.ts
+var v = (e, t) => t.includes(e.key), y = ({ nodes: e, expanded: t, sort: n, depth: r = 0 }) => {
+	let i = {
+		keys: [],
+		nodes: []
+	};
+	return n != null && e.sort(n), e.forEach((e) => {
+		let a = v(e, t);
+		if (i.keys.push(e.key), i.nodes.push({
+			depth: r,
+			expanded: a,
+			hasChildren: e.children != null
+		}), a && e.children != null) {
+			let { keys: a, nodes: o } = y({
+				nodes: e.children,
+				expanded: t,
+				sort: n,
+				depth: r + 1
+			});
+			i.keys.push(...a), i.nodes.push(...o);
+		}
+	}), i;
+}, b = ({ tree: e, destination: t, keys: n }) => (n = f.toArray(n), t == null ? [...E({
+	tree: e,
+	keys: n
+}), ...e.filter((e) => !n.includes(e.key))] : (n.forEach((n) => {
+	let r = T({
+		tree: e,
+		key: n
+	});
+	r != null && (x({
+		tree: e,
+		keys: n
+	}), S({
+		tree: e,
+		destination: t,
+		additions: r
+	}));
+}), e)), x = ({ tree: e, keys: t, parent: n }) => {
+	if (t = f.toArray(t), n !== void 0) {
+		if (n === null) return e.filter((e) => !t.includes(e.key));
+		let r = T({
+			tree: e,
+			key: n
+		});
+		return r == null || (r.children = r.children?.filter((e) => !t.includes(e.key))), e;
+	}
+	return t.forEach((t) => {
+		let n = e.findIndex((e) => e.key === t);
+		if (n !== -1) e.splice(n, 1);
+		else {
+			let n = D({
+				tree: e,
+				key: t
+			});
+			n != null && (n.children = n.children?.filter((e) => e.key !== t));
+		}
+	}), e;
+}, S = ({ tree: e, destination: t, additions: n, throwOnMissing: r = !0 }) => {
+	n = f.toArray(n);
+	let i = p.by(n, (e) => e.key, !1), a = i.map((e) => e.key);
+	if (t == null) return [...i, ...e.filter((e) => !a.includes(e.key))];
+	let o = T({
+		tree: e,
+		key: t
+	});
+	if (o == null) {
+		if (r) throw Error(`Could not find node with key ${t}`);
+		return e;
+	}
+	return o.children ??= [], o.children = [...i, ...o.children.filter((e) => !a.includes(e.key))], e;
+}, C = ({ tree: e, key: t, updater: n, throwOnMissing: r = !0 }) => {
+	let i = T({
+		tree: e,
+		key: t
+	});
+	if (i == null) {
+		if (r) throw Error(`Could not find node with key ${t}`);
+		return e;
+	}
+	let a = D({
+		tree: e,
+		key: t
+	});
+	if (a != null) {
+		let e = a.children?.findIndex((e) => e.key === t);
+		e != null && e !== -1 && a.children?.splice(e, 1, n(i));
+	} else e.splice(e.findIndex((e) => e.key === t), 1, n(i));
+	return e;
+}, w = ({ tree: e, parent: t, updater: n, throwOnMissing: r = !0 }) => {
+	let i = T({
+		tree: e,
+		key: t
+	});
+	if (i == null) {
+		if (r) throw Error(`Could not find node with key ${t}`);
+		return e;
+	}
+	return i.children = n(i.children ?? []), e;
+}, T = ({ tree: e, key: t, depth: n = 0 }) => {
+	for (let r = 0; r < e.length; r++) {
+		let i = e[r];
+		if (i.key === t) return i;
+		if (i.children != null) {
+			let e = T({
+				tree: i.children,
+				key: t,
+				depth: n + 1
+			});
+			if (e != null) return e;
+		}
+	}
+	return null;
+}, E = ({ tree: e, keys: t }) => {
+	let n = [];
+	for (let r of t) {
+		let t = T({
+			tree: e,
+			key: r
+		});
+		t != null && n.push(t);
+	}
+	return n;
+}, D = ({ tree: e, key: t }) => {
+	for (let n of e) if (n.children != null) {
+		if (n.children.some((e) => e.key === t)) return n;
+		let e = D({
+			tree: n.children,
+			key: t
+		});
+		if (e != null) return e;
+	}
+	return null;
+}, O = (e) => e.map((e) => ({
+	...e,
+	children: e.children == null ? void 0 : O(e.children)
+})), k = (...e) => {
+	let t = [];
+	return e.forEach((e) => {
+		t.push(e), e.children != null && t.push(...k(...e.children));
+	}), t;
+}, A = (e, t) => {
+	let n = {
+		keys: [],
+		nodes: []
+	};
+	return e.keys.forEach((r, i) => {
+		t(r, e.nodes[i].depth) && (n.keys.push(r), n.nodes.push(e.nodes[i]));
+	}), n;
+}, j = (e) => {
+	let t = Math.min(...e.nodes.map((e) => e.depth));
+	return e.keys.filter((n, r) => e.nodes[r].depth === t);
+}, M = (e, t) => {
+	let n = t.keys.findIndex((t) => t === e);
+	return t.nodes[n].depth;
+}, N = (e, t) => {
+	let n = e.keys.findIndex((e) => e === t);
+	return e.nodes[n];
+}, [P, F] = i({
+	displayName: "Tree.Context",
+	providerName: "Tree.Provider"
+}), I = ({ children: e, style: t, className: r, loading: i, useMargin: a = !1, offsetMultiplier: o = 2.5, ...l }) => {
+	let { index: d } = l, { expanded: f, depth: p, hasChildren: m } = F("Tree.Item")[d];
+	return /* @__PURE__ */ _(c, {
+		className: s(s.BE("tree", "item"), p !== 0 && s.M("show-rules"), a && s.M("margin"), r),
+		style: {
+			[s.var("tree-item-offset")]: `${p * o + 1.5}rem`,
+			...t
+		},
+		gap: "small",
+		align: "center",
+		...l,
+		children: [
+			m && /* @__PURE__ */ g(u, {
+				className: s.BE("tree", "expansion-indicator"),
+				enabled: f,
+				enabledLoc: "bottom",
+				disabledLoc: "right"
+			}, "caret"),
+			e,
+			i && /* @__PURE__ */ g(n, {})
+		]
+	});
+}, L = "tree-item", R = [["Shift"]], z = ({ onExpand: e, nodes: n, initialExpanded: i = [], selected: s, onSelectedChange: c, sort: l }) => {
+	let [u, d, f] = a(i), [g, _] = t({
+		initial: [],
+		value: s,
+		onChange: c
+	}), v = h(() => y({
+		nodes: n,
+		expanded: u,
+		sort: l
+	}), [
+		n,
+		u,
+		l
+	]), b = o(n), x = o(v), S = r({ triggers: R }), C = m((t, { clicked: n }) => {
+		if (_((e) => t.length === 0 && e.length > 0 ? e.slice(0, 1) : t), n == null || S.current.held) return;
+		let r = N(x.current, n);
+		if (r == null || !r.hasChildren) return;
+		let i = f.current, a = i.some((e) => e === n) ? "contract" : "expand", o;
+		o = a === "contract" ? i.filter((e) => e !== n) : [...i, n], d(o), e?.({
+			current: o,
+			action: a,
+			clicked: n
+		});
+	}, [
+		e,
+		b,
+		d,
+		_
+	]), w = m((t) => {
+		d((e) => p.unique([...e, t])), e?.({
+			current: u,
+			action: "expand",
+			clicked: t
+		});
+	}, [d]);
+	return {
+		selected: g,
+		expanded: u,
+		contract: m((...t) => {
+			d((e) => e.filter((e) => !t.includes(e))), t.forEach((t) => {
+				e?.({
+					current: u,
+					action: "contract",
+					clicked: t
+				});
+			});
+		}, [d]),
+		expand: w,
+		clearExpanded: m(() => d([]), [d]),
+		shape: v,
+		onSelect: C
+	};
+}, B = ({ shape: e, children: t, selected: n, onSelect: r, getItem: i, subscribe: a, className: o, contract: c, expand: u, expanded: f, className: p, clearExpanded: m, showRules: h = !1, virtual: _ = !1, ...v }) => {
+	let { keys: y } = e;
+	return /* @__PURE__ */ g(P, {
+		value: e.nodes,
+		children: /* @__PURE__ */ g(l, {
+			multiple: !0,
+			value: n,
+			replaceOnSingle: !0,
+			data: y,
+			onChange: r,
+			getItem: i,
+			subscribe: a,
+			itemHeight: 27,
+			virtual: _,
+			children: /* @__PURE__ */ g(d, {
+				full: "y",
+				className: s(s.B("tree"), o, h && s.M("show-rules")),
+				...v,
+				children: t
+			})
+		})
+	});
+}, V = /* @__PURE__ */ e({
+	HAUL_TYPE: () => L,
+	Item: () => I,
+	Tree: () => B,
+	deepCopy: () => O,
+	filterShape: () => A,
+	findNode: () => T,
+	findNodeParent: () => D,
+	findNodes: () => E,
+	flatten: () => y,
+	getAllNodesOfMinDepth: () => j,
+	getDepth: () => M,
+	getDescendants: () => k,
+	getNodeShape: () => N,
+	moveNode: () => b,
+	removeNode: () => x,
+	setNode: () => S,
+	shouldExpand: () => v,
+	updateNode: () => C,
+	updateNodeChildren: () => w,
+	use: () => z,
+	useContext: () => F
+});
+//#endregion
+export { V as t };

package/dist/tree-CsgSEpgy.cjs

@@ -0,0 +1 @@
+const e=require(`./chunk-FeXHwk1_.cjs`),t=require(`./types-ByXvRm2h.cjs`),n=require(`./triggers-AqBSAR_T.cjs`);require(`./theming-KFfFjsRJ.cjs`);const r=require(`./text-n3Fetdk6.cjs`),i=require(`./css-Ce-x3HcK.cjs`),a=require(`./select-gt7wGGO4.cjs`),o=require(`./dialog-BTCrp5Yv.cjs`),s=require(`./list-DacuSBB3.cjs`);let c=require(`@synnaxlabs/x`),l=require(`react`),u=require(`react/jsx-runtime`);var d=(e,t)=>t.includes(e.key),f=({nodes:e,expanded:t,sort:n,depth:r=0})=>{let i={keys:[],nodes:[]};return n!=null&&e.sort(n),e.forEach(e=>{let a=d(e,t);if(i.keys.push(e.key),i.nodes.push({depth:r,expanded:a,hasChildren:e.children!=null}),a&&e.children!=null){let{keys:a,nodes:o}=f({nodes:e.children,expanded:t,sort:n,depth:r+1});i.keys.push(...a),i.nodes.push(...o)}}),i},p=({tree:e,destination:t,keys:n})=>(n=c.array.toArray(n),t==null?[...y({tree:e,keys:n}),...e.filter(e=>!n.includes(e.key))]:(n.forEach(n=>{let r=v({tree:e,key:n});r!=null&&(m({tree:e,keys:n}),h({tree:e,destination:t,additions:r}))}),e)),m=({tree:e,keys:t,parent:n})=>{if(t=c.array.toArray(t),n!==void 0){if(n===null)return e.filter(e=>!t.includes(e.key));let r=v({tree:e,key:n});return r==null||(r.children=r.children?.filter(e=>!t.includes(e.key))),e}return t.forEach(t=>{let n=e.findIndex(e=>e.key===t);if(n!==-1)e.splice(n,1);else{let n=b({tree:e,key:t});n!=null&&(n.children=n.children?.filter(e=>e.key!==t))}}),e},h=({tree:e,destination:t,additions:n,throwOnMissing:r=!0})=>{n=c.array.toArray(n);let i=c.unique.by(n,e=>e.key,!1),a=i.map(e=>e.key);if(t==null)return[...i,...e.filter(e=>!a.includes(e.key))];let o=v({tree:e,key:t});if(o==null){if(r)throw Error(`Could not find node with key ${t}`);return e}return o.children??=[],o.children=[...i,...o.children.filter(e=>!a.includes(e.key))],e},g=({tree:e,key:t,updater:n,throwOnMissing:r=!0})=>{let i=v({tree:e,key:t});if(i==null){if(r)throw Error(`Could not find node with key ${t}`);return e}let a=b({tree:e,key:t});if(a!=null){let e=a.children?.findIndex(e=>e.key===t);e!=null&&e!==-1&&a.children?.splice(e,1,n(i))}else e.splice(e.findIndex(e=>e.key===t),1,n(i));return e},_=({tree:e,parent:t,updater:n,throwOnMissing:r=!0})=>{let i=v({tree:e,key:t});if(i==null){if(r)throw Error(`Could not find node with key ${t}`);return e}return i.children=n(i.children??[]),e},v=({tree:e,key:t,depth:n=0})=>{for(let r=0;r<e.length;r++){let i=e[r];if(i.key===t)return i;if(i.children!=null){let e=v({tree:i.children,key:t,depth:n+1});if(e!=null)return e}}return null},y=({tree:e,keys:t})=>{let n=[];for(let r of t){let t=v({tree:e,key:r});t!=null&&n.push(t)}return n},b=({tree:e,key:t})=>{for(let n of e)if(n.children!=null){if(n.children.some(e=>e.key===t))return n;let e=b({tree:n.children,key:t});if(e!=null)return e}return null},x=e=>e.map(e=>({...e,children:e.children==null?void 0:x(e.children)})),S=(...e)=>{let t=[];return e.forEach(e=>{t.push(e),e.children!=null&&t.push(...S(...e.children))}),t},C=(e,t)=>{let n={keys:[],nodes:[]};return e.keys.forEach((r,i)=>{t(r,e.nodes[i].depth)&&(n.keys.push(r),n.nodes.push(e.nodes[i]))}),n},w=e=>{let t=Math.min(...e.nodes.map(e=>e.depth));return e.keys.filter((n,r)=>e.nodes[r].depth===t)},T=(e,t)=>{let n=t.keys.findIndex(t=>t===e);return t.nodes[n].depth},E=(e,t)=>{let n=e.keys.findIndex(e=>e===t);return e.nodes[n]},[D,O]=n.It({displayName:`Tree.Context`,providerName:`Tree.Provider`}),k=({children:e,style:t,className:r,loading:s,useMargin:c=!1,offsetMultiplier:l=2.5,...d})=>{let{index:f}=d,{expanded:p,depth:m,hasChildren:h}=O(`Tree.Item`)[f];return(0,u.jsxs)(a.f,{className:i.n(i.n.BE(`tree`,`item`),m!==0&&i.n.M(`show-rules`),c&&i.n.M(`margin`),r),style:{[i.n.var(`tree-item-offset`)]:`${m*l+1.5}rem`,...t},gap:`small`,align:`center`,...d,children:[h&&(0,u.jsx)(o.r,{className:i.n.BE(`tree`,`expansion-indicator`),enabled:p,enabledLoc:`bottom`,disabledLoc:`right`},`caret`),e,s&&(0,u.jsx)(n.B,{})]})},A=`tree-item`,j=[[`Shift`]],M=({onExpand:e,nodes:i,initialExpanded:a=[],selected:o,onSelectedChange:s,sort:u})=>{let[d,p,m]=r.c(a),[h,g]=t.h({initial:[],value:o,onChange:s}),_=(0,l.useMemo)(()=>f({nodes:i,expanded:d,sort:u}),[i,d,u]),v=r.f(i),y=r.f(_),b=n.Ct({triggers:j}),x=(0,l.useCallback)((t,{clicked:n})=>{if(g(e=>t.length===0&&e.length>0?e.slice(0,1):t),n==null||b.current.held)return;let r=E(y.current,n);if(r==null||!r.hasChildren)return;let i=m.current,a=i.some(e=>e===n)?`contract`:`expand`,o;o=a===`contract`?i.filter(e=>e!==n):[...i,n],p(o),e?.({current:o,action:a,clicked:n})},[e,v,p,g]),S=(0,l.useCallback)(t=>{p(e=>c.unique.unique([...e,t])),e?.({current:d,action:`expand`,clicked:t})},[p]);return{selected:h,expanded:d,contract:(0,l.useCallback)((...t)=>{p(e=>e.filter(e=>!t.includes(e))),t.forEach(t=>{e?.({current:d,action:`contract`,clicked:t})})},[p]),expand:S,clearExpanded:(0,l.useCallback)(()=>p([]),[p]),shape:_,onSelect:x}},N=({shape:e,children:t,selected:n,onSelect:r,getItem:o,subscribe:c,className:l,contract:d,expand:f,expanded:p,className:m,clearExpanded:h,showRules:g=!1,virtual:_=!1,...v})=>{let{keys:y}=e;return(0,u.jsx)(D,{value:e.nodes,children:(0,u.jsx)(a.g,{multiple:!0,value:n,replaceOnSingle:!0,data:y,onChange:r,getItem:o,subscribe:c,itemHeight:27,virtual:_,children:(0,u.jsx)(s.a,{full:`y`,className:i.n(i.n.B(`tree`),l,g&&i.n.M(`show-rules`)),...v,children:t})})})},P=e.n({HAUL_TYPE:()=>A,Item:()=>k,Tree:()=>N,deepCopy:()=>x,filterShape:()=>C,findNode:()=>v,findNodeParent:()=>b,findNodes:()=>y,flatten:()=>f,getAllNodesOfMinDepth:()=>w,getDepth:()=>T,getDescendants:()=>S,getNodeShape:()=>E,moveNode:()=>p,removeNode:()=>m,setNode:()=>h,shouldExpand:()=>d,updateNode:()=>g,updateNodeChildren:()=>_,use:()=>M,useContext:()=>O});Object.defineProperty(exports,`t`,{enumerable:!0,get:function(){return P}});

package/dist/tree.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./external-CovFw1fv.cjs");exports.Tree=e.external;
+Object.defineProperty(exports,Symbol.toStringTag,{value:`Module`});const e=require(`./tree-CsgSEpgy.cjs`);Object.defineProperty(exports,`Tree`,{enumerable:!0,get:function(){return e.t}});

package/dist/tree.js

@@ -1,4 +1,2 @@
-import { e as o } from "./external-DDvmnE2k.js";
-export {
-  o as Tree
-};
+import { t as e } from "./tree-B4jJAzS1.js";
+export { e as Tree };