@algorisys/yappydraw 0.8.253

package/chunks/drawings-store-C-PoHakg.js

@@ -0,0 +1,109 @@
+import { A as I, B as u, C as l, D as m, E as S, G as U, H as w, I as y, J as E, K as p, L as N, M as O, N as C } from "./index-Bm3Inzn8.js";
+const f = "yappy:drawings:index", c = (t) => `yappy:drawing:${t}`;
+function G() {
+  return `d-${typeof crypto < "u" && crypto.randomUUID ? crypto.randomUUID() : `${Date.now()}-${Math.floor(Math.random() * 1e9)}`}`;
+}
+function T(t) {
+  const n = t;
+  return !!n.gameScript?.trim() || n.gameAuthoringMode === "code" || (n.sceneBehaviors?.length ?? 0) > 0 || n.blueprints && Object.keys(n.blueprints).length > 0 || Array.isArray(t.elements) && t.elements.some((a) => (a.behaviors?.length ?? 0) > 0);
+}
+class $ extends Error {
+  constructor() {
+    super("Local storage is unavailable — the drawing was not saved to disk."), this.name = "StorageUnavailableError";
+  }
+}
+async function M() {
+  return await m(f), S() === null;
+}
+async function o() {
+  return (await m(f) ?? []).slice().sort((n, a) => (a.updatedAt || "").localeCompare(n.updatedAt || ""));
+}
+async function g(t) {
+  await y(f, t);
+}
+async function b(t, n = {}) {
+  C();
+  const a = JSON.stringify(t), i = (/* @__PURE__ */ new Date()).toISOString(), r = await o(), e = n.id ? r.find((d) => d.id === n.id) : void 0, s = e?.id ?? n.id ?? G(), A = (n.name ?? t.metadata?.name ?? e?.name ?? "Untitled").trim() || "Untitled", h = {
+    id: s,
+    name: A,
+    createdAt: e?.createdAt ?? i,
+    updatedAt: i,
+    docType: t.metadata?.docType ?? e?.docType,
+    elementCount: Array.isArray(t.elements) ? t.elements.length : 0,
+    pageCount: Array.isArray(t.slides) ? t.slides.length : 0,
+    sizeBytes: a.length,
+    thumb: n.thumb ?? e?.thumb,
+    isGame: T(t)
+  }, x = await y(c(s), a), v = [h, ...r.filter((d) => d.id !== s)];
+  if (await g(v), !x) throw new $();
+  return h;
+}
+async function j(t = {}) {
+  const n = E(), a = t.name ?? p();
+  a && a !== p() && w(a);
+  let i;
+  try {
+    i = N();
+  } catch {
+  }
+  const r = t.forceNew ? void 0 : u() ?? void 0, e = await b(n, { id: r, name: a, thumb: i });
+  return l(e.id), O(), e;
+}
+async function k() {
+  return o();
+}
+async function D(t) {
+  const n = await m(c(t));
+  if (!n) return null;
+  try {
+    return JSON.parse(n);
+  } catch {
+    return null;
+  }
+}
+async function B(t) {
+  const n = await D(t);
+  if (!n) return !1;
+  try {
+    U(n);
+    const i = (await o()).find((r) => r.id === t);
+    return w(n.metadata?.name || i?.name || "Untitled"), l(t), !0;
+  } catch (a) {
+    return console.error("[drawings-store] open failed:", a), !1;
+  }
+}
+async function K(t, n) {
+  const a = n.trim() || "Untitled", i = await o(), r = i.find((s) => s.id === t);
+  if (!r) return;
+  r.name = a, r.updatedAt = (/* @__PURE__ */ new Date()).toISOString(), await g(i);
+  const e = await D(t);
+  e && (e.metadata = { ...e.metadata, name: a }, await y(c(t), JSON.stringify(e))), u() === t && w(a);
+}
+async function L(t) {
+  const n = await D(t);
+  if (!n) return null;
+  const i = (await o()).find((s) => s.id === t), r = `${i?.name ?? n.metadata?.name ?? "Untitled"} copy`, e = { ...n, metadata: { ...n.metadata, name: r } };
+  return b(e, { name: r, thumb: i?.thumb });
+}
+async function R(t) {
+  const n = await o();
+  await g(n.filter((a) => a.id !== t)), await I(c(t)), u() === t && l(null);
+}
+async function Y() {
+  return (await o()).length;
+}
+export {
+  $ as StorageUnavailableError,
+  u as activeDrawingId,
+  Y as countDrawings,
+  R as deleteDrawing,
+  L as duplicateDrawing,
+  M as galleryReadable,
+  D as getDrawingDoc,
+  k as listDrawings,
+  B as openDrawing,
+  K as renameDrawing,
+  j as saveCurrentToGallery,
+  b as saveDrawingDoc,
+  l as setActiveDrawingId
+};

package/chunks/ds-operations-D5B9Z5vO.js

@@ -0,0 +1,253 @@
+import { s as p, u as d, a as g } from "./index-Bm3Inzn8.js";
+function x(n) {
+  return n ? n.split(",").map((r) => r.trim()).filter((r) => r.length > 0) : [];
+}
+function k(n, r) {
+  const e = [...n];
+  if (e.length === 0 || e.length === 1 && e[0] === "_")
+    return e.length === 0 ? e.push(r) : e[0] = r, { newValues: e, insertIndex: 0 };
+  const s = parseFloat(r);
+  let t = 0;
+  for (; t < e.length && e[t] !== "_"; ) {
+    const i = parseFloat(e[t]);
+    !isNaN(s) && !isNaN(i) ? t = s < i ? 2 * t + 1 : 2 * t + 2 : t = r < e[t] ? 2 * t + 1 : 2 * t + 2;
+  }
+  for (; e.length <= t; ) e.push("_");
+  return e[t] = r, { newValues: e, insertIndex: t };
+}
+function w(n, r) {
+  const e = [...n], s = e.findIndex((t) => t === r);
+  if (s === -1) return { newValues: e, removeIndex: -1 };
+  for (b(e, s); e.length > 0 && e[e.length - 1] === "_"; )
+    e.pop();
+  return { newValues: e, removeIndex: s };
+}
+function f(n, r) {
+  return r < n.length && n[r] !== void 0 && n[r] !== "_";
+}
+function b(n, r) {
+  const e = 2 * r + 1, s = 2 * r + 2, t = f(n, e), i = f(n, s);
+  if (!t && !i) {
+    n[r] = "_";
+    return;
+  }
+  if (t && i) {
+    let u = s;
+    for (; f(n, 2 * u + 1); )
+      u = 2 * u + 1;
+    n[r] = n[u], b(n, u);
+    return;
+  }
+  y(n, t ? e : s, r);
+}
+function y(n, r, e) {
+  const s = /* @__PURE__ */ new Map();
+  h(n, r, 0, s), a(n, r), n[e] = "_";
+  for (const [t, i] of s) {
+    const c = A(e, t);
+    for (; n.length <= c; ) n.push("_");
+    n[c] = i;
+  }
+}
+function h(n, r, e, s) {
+  f(n, r) && (s.set(e, n[r]), h(n, 2 * r + 1, 2 * e + 1, s), h(n, 2 * r + 2, 2 * e + 2, s));
+}
+function a(n, r) {
+  r >= n.length || n[r] === "_" || n[r] === void 0 || (n[r] = "_", a(n, 2 * r + 1), a(n, 2 * r + 2));
+}
+function A(n, r) {
+  if (r === 0) return n;
+  const e = [];
+  let s = r;
+  for (; s > 0; )
+    e.push(s % 2 === 0), s = Math.floor((s - 1) / 2);
+  let t = n;
+  for (let i = e.length - 1; i >= 0; i--)
+    t = e[i] ? 2 * t + 2 : 2 * t + 1;
+  return t;
+}
+function m(n, r) {
+  let e = 0;
+  for (let s = 0; s < n.length; s++)
+    e = e * 31 + n.charCodeAt(s) | 0;
+  return Math.abs(e) % r;
+}
+function I(n, r, e) {
+  return [...n.filter((t) => {
+    const i = t.indexOf(":");
+    return (i > 0 ? t.substring(0, i).trim() : t.trim()) !== r;
+  }), e ? `${r}:${e}` : r];
+}
+function v(n, r) {
+  return n.filter((e) => {
+    const s = e.indexOf(":");
+    return (s > 0 ? e.substring(0, s).trim() : e.trim()) !== r;
+  });
+}
+function _(n, r, e, s, t) {
+  return new Promise((i) => {
+    if (!p.elements.find((u) => u.id === n)) {
+      i();
+      return;
+    }
+    e === "dsOpRemove" ? (d(n, {
+      dsHighlightIndex: r,
+      dsAnimStyle: e,
+      dsAnimProgress: 0
+    }, !1), g(n, { dsAnimProgress: 100 }, {
+      duration: 400,
+      easing: "easeOutCubic",
+      onComplete: () => {
+        d(n, {
+          text: t.join(", "),
+          dsHighlightIndex: -1,
+          dsAnimProgress: void 0,
+          dsAnimStyle: void 0
+        }, !1), i();
+      }
+    })) : (d(n, {
+      text: t.join(", "),
+      dsHighlightIndex: r,
+      dsAnimStyle: e,
+      dsAnimProgress: 0
+    }, !1), g(n, { dsAnimProgress: 100 }, {
+      duration: 400,
+      easing: "easeOutCubic",
+      onComplete: () => {
+        d(n, {
+          dsHighlightIndex: -1,
+          dsAnimProgress: void 0,
+          dsAnimStyle: void 0
+        }, !1), i();
+      }
+    }));
+  });
+}
+async function P(n, r, e) {
+  const s = p.elements.find((l) => l.id === n);
+  if (!s) return;
+  const t = x(s.text);
+  let i, c = -1, u = "dsOpInsert";
+  switch (r) {
+    // ── Array / Stack: push ──
+    case "push": {
+      if (!e.value?.trim()) return;
+      i = [...t, e.value.trim()], c = i.length - 1, u = "dsOpInsert";
+      break;
+    }
+    // ── Array / Stack: pop ──
+    case "pop": {
+      if (t.length === 0) return;
+      c = t.length - 1, u = "dsOpRemove", i = t.slice(0, -1);
+      break;
+    }
+    // ── Queue: enqueue (add to back) ──
+    case "enqueue": {
+      if (!e.value?.trim()) return;
+      i = [...t, e.value.trim()], c = i.length - 1, u = "dsOpInsert";
+      break;
+    }
+    // ── Queue: dequeue (remove from front) ──
+    case "dequeue": {
+      if (t.length === 0) return;
+      c = 0, u = "dsOpRemove", i = t.slice(1);
+      break;
+    }
+    // ── LinkedList: append (add to end) ──
+    case "append": {
+      if (!e.value?.trim()) return;
+      i = [...t, e.value.trim()], c = i.length - 1, u = "dsOpInsert";
+      break;
+    }
+    // ── LinkedList: prepend (add to start) ──
+    case "prepend": {
+      if (!e.value?.trim()) return;
+      i = [e.value.trim(), ...t], c = 0, u = "dsOpInsert";
+      break;
+    }
+    // ── LinkedList: removeFirst ──
+    case "removeFirst": {
+      if (t.length === 0) return;
+      c = 0, u = "dsOpRemove", i = t.slice(1);
+      break;
+    }
+    // ── LinkedList: removeLast ──
+    case "removeLast": {
+      if (t.length === 0) return;
+      c = t.length - 1, u = "dsOpRemove", i = t.slice(0, -1);
+      break;
+    }
+    // ── Array: insertAt ──
+    case "insertAt": {
+      if (!e.value?.trim()) return;
+      const l = Math.max(0, Math.min(e.index ?? 0, t.length));
+      i = [...t.slice(0, l), e.value.trim(), ...t.slice(l)], c = l, u = "dsOpInsert";
+      break;
+    }
+    // ── Array: removeAt ──
+    case "removeAt": {
+      const l = e.index ?? 0;
+      if (l < 0 || l >= t.length) return;
+      c = l, u = "dsOpRemove", i = [...t.slice(0, l), ...t.slice(l + 1)];
+      break;
+    }
+    // ── Array: shuffle (Fisher-Yates) ──
+    case "shuffle": {
+      if (t.length <= 1) return;
+      i = [...t];
+      for (let l = i.length - 1; l > 0; l--) {
+        const o = Math.floor(Math.random() * (l + 1));
+        [i[l], i[o]] = [i[o], i[l]];
+      }
+      c = -1, u = "dsOpUpdate";
+      break;
+    }
+    // ── Array: update (replace value at index) ──
+    case "update": {
+      if (!e.value?.trim()) return;
+      const l = e.index ?? 0;
+      if (l < 0 || l >= t.length) return;
+      i = [...t], i[l] = e.value.trim(), c = l, u = "dsOpUpdate";
+      break;
+    }
+    // ── BinaryTree: BST insert ──
+    case "insert": {
+      if (!e.value?.trim()) return;
+      if (s.type === "dsBinaryTree") {
+        const l = k(t, e.value.trim());
+        i = l.newValues, c = l.insertIndex, u = "dsOpInsert";
+      } else
+        return;
+      break;
+    }
+    // ── BinaryTree: BST remove / HashTable: remove by key ──
+    case "remove": {
+      if (s.type === "dsBinaryTree") {
+        if (!e.value?.trim()) return;
+        const l = w(t, e.value.trim());
+        if (l.removeIndex === -1) return;
+        i = l.newValues, c = l.removeIndex, u = "dsOpRemove";
+      } else if (s.type === "dsHashTable") {
+        if (!e.key?.trim()) return;
+        const l = e.key.trim(), o = s.dsCapacity || 5;
+        if (c = m(l, o), i = v(t, l), i.length === t.length) return;
+        u = "dsOpRemove";
+      } else
+        return;
+      break;
+    }
+    // ── HashTable: put (key:value) ──
+    case "put": {
+      if (!e.key?.trim()) return;
+      const l = e.key.trim(), o = e.value?.trim() || "", O = s.dsCapacity || 5;
+      c = m(l, O), i = I(t, l, o), u = "dsOpInsert";
+      break;
+    }
+    default:
+      return;
+  }
+  await _(n, c, u, t, i);
+}
+export {
+  P as executeDsOperation
+};