vintage-frames 0.16.1 → 0.16.2

package/dist/shell/catalog.d.ts

@@ -32,13 +32,15 @@ export declare const TRASH = "trash";
 export declare const DISK = "disk";
 /** A folder's kind. */
 export declare const FOLDER = "folder";
+/** An application's icon: the kind the shell registers, whose data names the application it opens. */
+export declare const APP_KIND = "app";
 /** The name a new folder takes, counted up where it is taken. */
 export declare const UNTITLED_FOLDER = "untitled folder";
 /** One item of the catalog. */
 export interface Item {
     id: string;
     name: string;
-    /** `folder`, a volume's (`trash`, `disk`), or a kind an application registers. */
+    /** `folder`, a volume's (`trash`, `disk`), the shell's `app`, or a kind an application registers. */
     kind: string;
     /** A folder's id, a volume's, or null for the desktop. */
     parent: string | null;
@@ -107,6 +109,8 @@ export interface CatalogArchive {
 export declare const isContainerKind: (kind: string) => boolean;
 /** Whether `id` names a volume. */
 export declare const isVolume: (id: string | null | undefined) => boolean;
+/** The application an `app` item stands for: its `data.app`, or null. */
+export declare function appIdOf(item: Item): string | null;
 /** The item with `id`, or null. */
 export declare function itemOf(state: CatalogState, id: string | null | undefined): Item | null;
 /** The container `parent` resolves to: that container while it is listed, else the desktop (null). */

package/dist/shell/catalog.js

@@ -1,78 +1,82 @@
 //#region src/shell/catalog.ts
-var e = "trash", t = "disk", n = "folder", r = "untitled folder", i = "#seeded", a = (e) => e === "folder" || e === "trash" || e === "disk", o = (e) => e === "trash" || e === "disk";
-function s(e, t) {
-	return t == null ? null : e.items.find((e) => e.id === t) ?? null;
-}
-function c(e, t) {
-	let n = s(e, t);
-	return n && a(n.kind) ? n.id : null;
+var e = "trash", t = "disk", n = "folder", r = "app", i = "untitled folder", a = "#seeded", o = (e) => e === "folder" || e === "trash" || e === "disk", s = (e) => e === "trash" || e === "disk";
+function c(e) {
+	let t = e.data;
+	return typeof t?.app == "string" ? t.app : null;
 }
 function l(e, t) {
-	let n = c(e, t);
-	return e.items.filter((t) => t.id !== n && c(e, t.parent) === n);
+	return t == null ? null : e.items.find((e) => e.id === t) ?? null;
 }
 function u(e, t) {
-	return l(e, t).length;
+	let n = l(e, t);
+	return n && o(n.kind) ? n.id : null;
+}
+function d(e, t) {
+	let n = u(e, t);
+	return e.items.filter((t) => t.id !== n && u(e, t.parent) === n);
+}
+function f(e, t) {
+	return d(e, t).length;
 }
-var d = (e, t) => c(e, s(e, t)?.parent ?? null);
-function f(e, t, n) {
-	let r = /* @__PURE__ */ new Set(), i = d(e, t);
+var p = (e, t) => u(e, l(e, t)?.parent ?? null);
+function m(e, t, n) {
+	let r = /* @__PURE__ */ new Set(), i = p(e, t);
 	for (; i != null && !r.has(i);) {
 		if (i === n) return !0;
-		r.add(i), i = d(e, i);
+		r.add(i), i = p(e, i);
 	}
 	return !1;
 }
-function p(e, t) {
-	let n = [], r = /* @__PURE__ */ new Set(), i = c(e, t ?? null);
-	for (; i != null && !r.has(i);) n.push(i), r.add(i), i = d(e, i);
+function h(e, t) {
+	let n = [], r = /* @__PURE__ */ new Set(), i = u(e, t ?? null);
+	for (; i != null && !r.has(i);) n.push(i), r.add(i), i = p(e, i);
 	return n;
 }
-function m(e, t) {
-	return t == null ? !1 : t === "trash" || f(e, t, "trash");
+function g(e, t) {
+	return t == null ? !1 : t === "trash" || m(e, t, "trash");
 }
-function h(e, t) {
+function _(e, t) {
 	let n = [], r = /* @__PURE__ */ new Set(), i = (t) => {
-		for (let o of l(e, t)) r.has(o.id) || (r.add(o.id), n.push(o), a(o.kind) && i(o.id));
+		for (let a of d(e, t)) r.has(a.id) || (r.add(a.id), n.push(a), o(a.kind) && i(a.id));
 	};
-	return i(c(e, t)), n;
+	return i(u(e, t)), n;
 }
-function g(e, t) {
-	let i = new Set(l(e, t).filter((e) => e.kind === n).map((e) => e.name));
-	if (!i.has("untitled folder")) return r;
+function v(e, t) {
+	let r = new Set(d(e, t).filter((e) => e.kind === n).map((e) => e.name));
+	if (!r.has("untitled folder")) return i;
 	for (let e = 2;; e++) {
-		let t = `${r} ${e}`;
-		if (!i.has(t)) return t;
+		let t = `${i} ${e}`;
+		if (!r.has(t)) return t;
 	}
 }
-var _ = (e) => e.replace(/ copy( \d+)?$/, "");
-function v(e, t, n, r) {
-	let i = new Set(l(e, t).filter((e) => e.kind === r).map((e) => e.name));
+var y = (e) => e.replace(/ copy( \d+)?$/, "");
+function b(e, t, n, r) {
+	let i = new Set(d(e, t).filter((e) => e.kind === r).map((e) => e.name));
 	if (!i.has(n)) return n;
-	let a = _(n);
+	let a = y(n);
 	if (!i.has(`${a} copy`)) return `${a} copy`;
 	for (let e = 2;; e++) {
 		let t = `${a} copy ${e}`;
 		if (!i.has(t)) return t;
 	}
 }
-var y = (e, t) => e.createdAt - t.createdAt || (e.id < t.id ? -1 : 1);
-function b(e, t) {
+var x = (e, t) => e.createdAt - t.createdAt || (e.id < t.id ? -1 : 1);
+function S(e, t) {
 	let n = { ...e };
 	return t ? (n.left = t.left, n.top = t.top) : (delete n.left, delete n.top), n;
 }
-function x(n) {
-	let { storage: r, volumes: l = {}, listed: u = () => !0, hooks: d = () => void 0, placeDelay: p = 400 } = n, _ = () => (n.now ?? Date.now)(), x = () => n.newId ? n.newId() : crypto.randomUUID(), S = [];
-	l.disk && S.push({
+function C(n) {
+	let { storage: r, volumes: i = {}, listed: c = () => !0, hooks: d = () => void 0, placeDelay: f = 400 } = n, p = () => (n.now ?? Date.now)(), h = () => n.newId ? n.newId() : crypto.randomUUID(), y = [];
+	i.disk && y.push({
 		id: t,
-		name: l.disk,
+		name: i.disk,
 		kind: t,
 		parent: null,
 		createdAt: 0,
 		modifiedAt: 0
-	}), l.trash !== !1 && S.push({
+	}), i.trash !== !1 && y.push({
 		id: e,
-		name: l.trash ?? "Trash",
+		name: i.trash ?? "Trash",
 		kind: e,
 		parent: null,
 		createdAt: 0,
@@ -80,14 +84,14 @@ function x(n) {
 	});
 	let C = /* @__PURE__ */ new Map(), w = !1, T = !1, E = O(), D = /* @__PURE__ */ new Set();
 	function O() {
-		let e = S.map((e) => {
+		let e = y.map((e) => {
 			let t = C.get(e.id);
 			return t?.left != null && t.top != null ? {
 				...e,
 				left: t.left,
 				top: t.top
 			} : e;
-		}), t = [...C.values()].filter((e) => !o(e.id) && (e.kind === "folder" || u(e.kind))).sort(y);
+		}), t = [...C.values()].filter((e) => !s(e.id) && (e.kind === "folder" || c(e.kind))).sort(x);
 		return {
 			available: w,
 			items: [...e, ...t]
@@ -114,7 +118,7 @@ function x(n) {
 		}
 	}
 	let F = (e) => {
-		let t = S.find((t) => t.id === e);
+		let t = y.find((t) => t.id === e);
 		return C.get(e) ?? {
 			...t,
 			name: ""
@@ -122,7 +126,7 @@ function x(n) {
 	};
 	async function I() {
 		M.clear();
-		for (let e of await A().list()) e.id !== i && (await A().remove(e.id), C.delete(e.id));
+		for (let e of await A().list()) e.id !== a && (await A().remove(e.id), C.delete(e.id));
 		C = /* @__PURE__ */ new Map();
 	}
 	let L = {
@@ -132,7 +136,7 @@ function x(n) {
 				D.delete(e);
 			};
 		},
-		item: (e) => s(E, e),
+		item: (e) => l(E, e),
 		async refresh() {
 			if (!r) {
 				C = /* @__PURE__ */ new Map(), w = !1, k();
@@ -141,7 +145,7 @@ function x(n) {
 			try {
 				let e = await r.list();
 				C = /* @__PURE__ */ new Map(), T = !1;
-				for (let t of e) t.id === i ? T = !0 : C.set(t.id, t);
+				for (let t of e) t.id === a ? T = !0 : C.set(t.id, t);
 				w = !0;
 			} catch (e) {
 				console.warn("vintage-frames/shell: the catalog could not be read —", e), C = /* @__PURE__ */ new Map(), w = !1;
@@ -150,51 +154,51 @@ function x(n) {
 		},
 		async seed(e) {
 			return !r || !w || T ? !1 : (await e(L), await r.put({
-				id: i,
+				id: a,
 				name: "",
-				kind: i,
+				kind: a,
 				parent: null,
-				createdAt: _(),
-				modifiedAt: _()
+				createdAt: p(),
+				modifiedAt: p()
 			}), T = !0, !0);
 		},
 		async create(e = {}) {
-			let t = c(E, e.parent ?? null);
-			if (m(E, t)) return null;
-			let n = e.kind ?? "folder", r = e.at ?? _(), i = {
-				id: x(),
-				name: e.name ?? (n === "folder" ? g(E, t) : "untitled"),
+			let t = u(E, e.parent ?? null);
+			if (g(E, t)) return null;
+			let n = e.kind ?? "folder", r = e.at ?? p(), i = {
+				id: h(),
+				name: e.name ?? (n === "folder" ? v(E, t) : "untitled"),
 				kind: n,
 				parent: t,
 				createdAt: r,
 				modifiedAt: r
 			};
-			return e.data !== void 0 && (i.data = e.data), e.left != null && e.top != null && (i = b(i, {
+			return e.data !== void 0 && (i.data = e.data), e.left != null && e.top != null && (i = S(i, {
 				left: e.left,
 				top: e.top
 			})), await j(i), k(), i;
 		},
 		async rename(e, t) {
 			let n = C.get(e);
-			return !n || o(e) || n.name === t ? !1 : (await j({
+			return !n || s(e) || n.name === t ? !1 : (await j({
 				...n,
 				name: t,
-				modifiedAt: _()
+				modifiedAt: p()
 			}), k(), !0);
 		},
 		async update(e, t) {
 			let n = C.get(e);
-			return !n || o(e) ? !1 : (await j({
+			return !n || s(e) ? !1 : (await j({
 				...n,
 				data: t,
-				modifiedAt: _()
+				modifiedAt: p()
 			}), k(), !0);
 		},
 		async move(e, t, n) {
-			let r = c(E, t), i = [];
+			let r = u(E, t), i = [];
 			for (let t of e) {
 				let e = C.get(t);
-				!e || o(t) || r === t || r != null && a(e.kind) && f(E, r, t) || c(E, e.parent) !== r && (M.delete(t), await j(b({
+				!e || s(t) || r === t || r != null && o(e.kind) && m(E, r, t) || u(E, e.parent) !== r && (M.delete(t), await j(S({
 					...e,
 					parent: r
 				}, n?.get(t) ?? null)), i.push(t));
@@ -204,43 +208,43 @@ function x(n) {
 		place(e) {
 			let t = !1;
 			for (let [n, r] of e) {
-				let e = o(n) ? S.some((e) => e.id === n) ? F(n) : null : C.get(n);
-				!e || e.left === r.left && e.top === r.top || (C.set(n, b(e, r)), M.add(n), t = !0);
+				let e = s(n) ? y.some((e) => e.id === n) ? F(n) : null : C.get(n);
+				!e || e.left === r.left && e.top === r.top || (C.set(n, S(e, r)), M.add(n), t = !0);
 			}
-			t && (k(), N && clearTimeout(N), N = setTimeout(() => void P(), p));
+			t && (k(), N && clearTimeout(N), N = setTimeout(() => void P(), f));
 		},
 		flush: P,
 		async copy(e, t) {
-			let n = c(E, t);
-			if (m(E, n)) return [];
+			let n = u(E, t);
+			if (g(E, n)) return [];
 			let r = [];
 			for (let t of e) {
-				let e = s(E, t);
-				if (!e || o(t)) continue;
-				let i = a(e.kind) ? h(E, t) : [], l = /* @__PURE__ */ new Map(), u = async (e, t, n) => {
-					let r = _(), i = {
+				let e = l(E, t);
+				if (!e || s(t)) continue;
+				let i = o(e.kind) ? _(E, t) : [], a = /* @__PURE__ */ new Map(), c = async (e, t, n) => {
+					let r = p(), i = {
 						...e,
-						id: x(),
-						name: n ? v(E, t, e.name, e.kind) : e.name,
+						id: h(),
+						name: n ? b(E, t, e.name, e.kind) : e.name,
 						parent: t,
 						createdAt: r,
 						modifiedAt: r
 					};
-					return n && (i = b(i, null)), l.set(e.id, i.id), await j(i), await d(e.kind)?.copy?.(e, i), i;
+					return n && (i = S(i, null)), a.set(e.id, i.id), await j(i), await d(e.kind)?.copy?.(e, i), i;
 				};
-				r.push(await u(e, n, !0));
-				for (let e of i) await u(e, l.get(c(E, e.parent) ?? "") ?? null, !1);
+				r.push(await c(e, n, !0));
+				for (let e of i) await c(e, a.get(u(E, e.parent) ?? "") ?? null, !1);
 				k();
 			}
 			return r;
 		},
 		async emptyTrash() {
-			let t = h(E, e);
+			let t = _(E, e);
 			for (let e of t) await A().remove(e.id), C.delete(e.id), M.delete(e.id), await d(e.kind)?.onRemove?.(e);
 			return t.length && k(), t;
 		},
 		trashSize() {
-			return h(E, e).reduce((e, t) => e + (d(t.kind)?.size?.(t) ?? 0), 0);
+			return _(E, e).reduce((e, t) => e + (d(t.kind)?.size?.(t) ?? 0), 0);
 		},
 		dump() {
 			return { items: [...C.values()] };
@@ -253,14 +257,14 @@ function x(n) {
 			}
 		},
 		async import(e, { mode: t = "merge" } = {}) {
-			let n = /* @__PURE__ */ new Map(), a = e.items.filter((e) => e.id !== i && !o(e.id));
-			if (!a.length || !r) return n;
-			let s = t === "replace", c = /* @__PURE__ */ new Map();
-			for (let e of a) c.set(e.id, s ? e.id : x());
-			let l = (e) => e == null || o(e) ? e : c.get(e) ?? null;
+			let n = /* @__PURE__ */ new Map(), i = e.items.filter((e) => e.id !== a && !s(e.id));
+			if (!i.length || !r) return n;
+			let o = t === "replace", c = /* @__PURE__ */ new Map();
+			for (let e of i) c.set(e.id, o ? e.id : h());
+			let l = (e) => e == null || s(e) ? e : c.get(e) ?? null;
 			try {
-				s && await I();
-				for (let e of a) {
+				o && await I();
+				for (let e of i) {
 					let t = {
 						...e,
 						id: c.get(e.id),
@@ -279,7 +283,7 @@ function x(n) {
 	};
 	return L;
 }
-function S(e = []) {
+function w(e = []) {
 	let t = new Map(e.map((e) => [e.id, e]));
 	return {
 		records: t,
@@ -289,4 +293,4 @@ function S(e = []) {
 	};
 }
 //#endregion
-export { t as DISK, n as FOLDER, e as TRASH, r as UNTITLED_FOLDER, l as childrenOf, c as containerOf, v as copyName, x as createCatalog, h as descendantsOf, p as enclosingFolders, a as isContainerKind, f as isInside, m as isTrashed, o as isVolume, u as itemCount, s as itemOf, S as memoryStorage, g as nextFolderName };
+export { r as APP_KIND, t as DISK, n as FOLDER, e as TRASH, i as UNTITLED_FOLDER, c as appIdOf, d as childrenOf, u as containerOf, b as copyName, C as createCatalog, _ as descendantsOf, h as enclosingFolders, o as isContainerKind, m as isInside, g as isTrashed, s as isVolume, f as itemCount, l as itemOf, w as memoryStorage, v as nextFolderName };