@code0-tech/pictor 0.0.0-mvp.42 → 0.0.0-mvp.43

package/dist/assets/components/avatar/Avatar.style.css

@@ -1 +1 @@
-.avatar{aspect-ratio:1/1;padding:.35rem;display:flex;width:38px;align-items:center;justify-content:center;overflow:hidden}.avatar{background:#191825;box-shadow:inset 0 1px 1px #bfbfbf1a;border:none;color:#ffffffbf;position:relative;box-sizing:border-box;border-radius:1rem;background:transparent;box-shadow:none}.avatar--image{padding:0}
+.avatar{aspect-ratio:1/1;display:flex;align-items:center;justify-content:center;overflow:hidden}.avatar{background:#191825;box-shadow:inset 0 1px 1px #bfbfbf1a;border:none;color:#ffffffbf;position:relative;box-sizing:border-box;background:transparent;box-shadow:none}.avatar--image{padding:0}

package/dist/components/avatar/Avatar.d.ts

@@ -4,5 +4,6 @@ export interface AvatarProps extends Code0Component<HTMLDivElement> {
     identifier?: string;
     src?: string;
     size?: number;
+    color?: string;
 }
 export declare const Avatar: React.FC<AvatarProps>;

package/dist/components/avatar/Avatar.js

@@ -1,56 +1,58 @@
-import { jsx as m } from "react/jsx-runtime";
-import { c as p } from "../../_virtual/compiler-runtime.js";
-import d from "react";
-import { md5 as v } from "js-md5";
+import { jsx as u } from "react/jsx-runtime";
+import { c as v } from "../../_virtual/compiler-runtime.js";
+import g from "react";
+import { md5 as R } from "js-md5";
 import '../../assets/components/avatar/Avatar.style.css';/* empty css                  */
-import { mergeCode0Props as R } from "../../utils/utils.js";
-import { hashToColor as x } from "../d-flow/DFlow.util.js";
-const C = (s) => {
-  const t = p.c(3), {
-    src: e,
-    size: o
-  } = s;
-  let i;
-  return t[0] !== o || t[1] !== e ? (i = /* @__PURE__ */ m("img", { src: e, width: o, height: o, alt: "Avatar image" }), t[0] = o, t[1] = e, t[2] = i) : i = t[2], i;
-}, E = ({
-  identifier: s,
-  size: t
+import { mergeCode0Props as x } from "../../utils/utils.js";
+import { hashToColor as C } from "../d-flow/DFlow.util.js";
+const E = (l) => {
+  const t = v.c(3), {
+    src: c,
+    size: e
+  } = l;
+  let o;
+  return t[0] !== e || t[1] !== c ? (o = /* @__PURE__ */ u("img", { src: c, width: e, height: e, alt: "Avatar image" }), t[0] = e, t[1] = c, t[2] = o) : o = t[2], o;
+}, z = ({
+  identifier: l,
+  size: t,
+  color: c
 }) => {
-  const e = d.useRef(null);
-  d.useEffect(() => {
+  const e = g.useRef(null);
+  g.useEffect(() => {
     o();
   });
   const o = () => {
-    const i = v(s), r = Math.floor(t / 5), a = x(s);
+    const i = R(l), r = Math.floor(t / 5), s = c ?? C(l);
     e.current.width = r * 5, e.current.height = r * 5;
-    let c = i.split("").map((f) => (f = parseInt(f, 16), f < 8 ? 0 : 1)), l = [];
-    l[0] = l[4] = c.slice(0, 5), l[1] = l[3] = c.slice(5, 10), l[2] = c.slice(10, 15);
-    const n = e.current.getContext("2d");
-    n.imageSmoothingEnabled = !1, n.clearRect(0, 0, e.current.width, e.current.height), l.forEach((f, h) => {
-      f.forEach((g, u) => {
-        g ? (n.fillStyle = a, n.fillRect(r * h, r * u, r, r)) : (n.fillStyle = "transparent", n.fillRect(r * h, r * u, r, r));
+    let a = i.split("").map((m) => (m = parseInt(m, 16), m < 8 ? 0 : 1)), n = [];
+    n[0] = n[4] = a.slice(0, 5), n[1] = n[3] = a.slice(5, 10), n[2] = a.slice(10, 15);
+    const f = e.current.getContext("2d");
+    f.imageSmoothingEnabled = !1, f.clearRect(0, 0, e.current.width, e.current.height), n.forEach((m, h) => {
+      m.forEach((d, p) => {
+        d ? (f.fillStyle = s, f.fillRect(r * h, r * p, r, r)) : (f.fillStyle = "transparent", f.fillRect(r * h, r * p, r, r));
       });
     });
   };
-  return /* @__PURE__ */ m("canvas", { ref: e });
-}, y = (s) => {
-  const t = p.c(12);
-  let e, o, i, r;
-  if (t[0] !== s) {
+  return /* @__PURE__ */ u("canvas", { ref: e });
+}, k = (l) => {
+  const t = v.c(14);
+  let c, e, o, i, r;
+  if (t[0] !== l) {
     const {
-      identifier: l,
-      src: n,
-      size: f,
-      ...h
-    } = s;
-    e = l, i = n, o = f === void 0 ? 25 : f, r = R(`avatar ${!e && i ? "avatar--image" : ""}`, h), t[0] = s, t[1] = e, t[2] = o, t[3] = i, t[4] = r;
+      identifier: n,
+      color: f,
+      src: m,
+      size: h,
+      ...d
+    } = l;
+    e = n, c = f, i = m, o = h === void 0 ? 25 : h, r = x(`avatar ${!e && i ? "avatar--image" : ""}`, d), t[0] = l, t[1] = c, t[2] = e, t[3] = o, t[4] = i, t[5] = r;
   } else
-    e = t[1], o = t[2], i = t[3], r = t[4];
+    c = t[1], e = t[2], o = t[3], i = t[4], r = t[5];
+  let s;
+  t[6] !== c || t[7] !== e || t[8] !== o || t[9] !== i ? (s = e ? /* @__PURE__ */ u(z, { color: c, identifier: e, size: o }) : i ? /* @__PURE__ */ u(E, { src: i, size: o + 13 }) : null, t[6] = c, t[7] = e, t[8] = o, t[9] = i, t[10] = s) : s = t[10];
   let a;
-  t[5] !== e || t[6] !== o || t[7] !== i ? (a = e ? /* @__PURE__ */ m(E, { identifier: e, size: o }) : i ? /* @__PURE__ */ m(C, { src: i, size: o + 13 }) : null, t[5] = e, t[6] = o, t[7] = i, t[8] = a) : a = t[8];
-  let c;
-  return t[9] !== r || t[10] !== a ? (c = /* @__PURE__ */ m("div", { ...r, children: a }), t[9] = r, t[10] = a, t[11] = c) : c = t[11], c;
+  return t[11] !== r || t[12] !== s ? (a = /* @__PURE__ */ u("div", { ...r, children: s }), t[11] = r, t[12] = s, t[13] = a) : a = t[13], a;
 };
 export {
-  y as Avatar
+  k as Avatar
 };

package/dist/components/d-flow-suggestion/DFlowReferenceSuggestions.hook.js

@@ -10,7 +10,7 @@ import "../d-flow/DFlow.js";
 import { DFlowReactiveService as R } from "../d-flow/DFlow.service.js";
 import { useReturnTypes as j } from "../d-flow-node/DFlowNode.return.hook.js";
 const re = (n, t, o, u = []) => {
-  const f = I(x), r = N(x), v = I(R), T = N(R), M = $(n), S = g.useMemo(() => t ? M?.find((i) => i.nodeFunctionId === t) : void 0, [M, t]), B = g.useMemo(() => t ? v.getNodeById(n, t)?.parameters?.nodes?.map((a) => a?.value).filter((a) => a?.__typename === "NodeFunctionIdWrapper") ?? [] : [], [n, t, v, T]), c = g.useMemo(() => o ? C(P(o, f), u) : void 0, [o, f, r, u]), p = U(n), m = j(n);
+  const m = I(x), r = N(x), v = I(R), T = N(R), M = $(n), S = g.useMemo(() => t ? M?.find((i) => i.nodeFunctionId === t) : void 0, [M, t]), B = g.useMemo(() => t ? v.getNodeById(n, t)?.parameters?.nodes?.map((a) => a?.value).filter((a) => a?.__typename === "NodeFunctionIdWrapper") ?? [] : [], [n, t, v, T]), c = g.useMemo(() => o ? C(P(o, m), u) : void 0, [o, m, r, u]), p = U(n), f = j(n);
   return g.useMemo(() => {
     if (!c || !S) return [];
     const {
@@ -28,7 +28,7 @@ const re = (n, t, o, u = []) => {
       if (!d && e.node >= l) return [];
       if (e.depth > i) return [];
       if (e.scope.some((s) => !a.includes(s))) return [];
-      const h = m.get(e.nodeFunctionId), E = C(P(h, f), []);
+      const h = f.get(e.nodeFunctionId), E = C(P(h, m), []);
       return V(c, E) ? [{
         path: [],
         type: A.REF_OBJECT,
@@ -36,13 +36,13 @@ const re = (n, t, o, u = []) => {
         value: e
       }] : [];
     });
-  }, [f, S, B, p, c]);
+  }, [m, S, B, p, c, f]);
 }, U = (n) => {
   const t = I(x);
   N(x);
-  const o = I(O), u = I(R), f = N(R), r = g.useMemo(() => u.getById(n), [n, f]), v = $(n), T = j(n), M = g.useMemo(() => r?.nodes?.nodes?.map((c) => {
-    const p = T.get(c?.id), m = v?.find((i) => i.nodeFunctionId === c?.id);
-    return p && m ? G(m, p, t) : {};
+  const o = I(O), u = I(R), m = N(R), r = g.useMemo(() => u.getById(n), [n, m]), v = $(n), T = j(n), M = g.useMemo(() => r?.nodes?.nodes?.map((c) => {
+    const p = T.get(c?.id), f = v?.find((i) => i.nodeFunctionId === c?.id);
+    return p && f ? G(f, p, t) : {};
   }) ?? [], [r]), S = g.useMemo(() => G({
     node: 0,
     depth: 0,
@@ -54,7 +54,7 @@ const re = (n, t, o, u = []) => {
   return [...g.useMemo(() => r?.nodes?.nodes?.length ? r.nodes.nodes.flatMap((c) => {
     const p = o.getById(c?.functionDefinition?.id);
     if (!p) return [];
-    const m = c?.parameters?.nodes?.map((i) => i?.value).filter(Boolean) ?? [];
+    const f = c?.parameters?.nodes?.map((i) => i?.value).filter(Boolean) ?? [];
     return (p.parameterDefinitions ?? []).flatMap((i, a) => {
       const l = i?.dataTypeIdentifier;
       if (!l) return [];
@@ -64,7 +64,7 @@ const re = (n, t, o, u = []) => {
       if (!d?.value || d.value.__typename !== "NodeFunctionIdWrapper") return [];
       const D = v?.find((y) => d?.value?.__typename === "NodeFunctionIdWrapper" && y.nodeFunctionId === d.value?.id);
       if (!D) return [];
-      const h = e.rules?.nodes?.filter((y) => y?.variant === "INPUT_TYPES") ?? [], E = Y(p, m, t, o), s = k(p, l), F = new Map([...E].map(([y, b]) => [s.get(y) ?? y, b]));
+      const h = e.rules?.nodes?.filter((y) => y?.variant === "INPUT_TYPES") ?? [], E = Y(p, f, t, o), s = k(p, l), F = new Map([...E].map(([y, b]) => [s.get(y) ?? y, b]));
       return h.flatMap((y) => (y?.config?.inputTypes ?? []).flatMap((W, K) => {
         const w = J(W.dataTypeIdentifier, F);
         return w ? G({
@@ -93,13 +93,13 @@ const re = (n, t, o, u = []) => {
     ...n
   }] : [];
 }, $ = (n) => {
-  const t = I(x), o = I(R), u = I(O), f = N(R), r = N(O), v = N(x), T = g.useMemo(() => o.getById(n), [n, f]);
+  const t = I(x), o = I(R), u = I(O), m = N(R), r = N(O), v = N(x), T = g.useMemo(() => o.getById(n), [n, m]);
   return g.useMemo(() => {
     if (!t || !o || !u || !T?.startingNodeId) return;
     let M = 0;
     const S = () => ++M;
     let B = 0;
-    const c = () => ++B, p = [], m = (i, a, l) => {
+    const c = () => ++B, p = [], f = (i, a, l) => {
       if (!i) return;
       let e = i.__typename === "NodeFunctionIdWrapper" ? o.getNodeById(n, i.id) : i;
       for (; e; ) {
@@ -111,9 +111,9 @@ const re = (n, t, o, u = []) => {
             if (E?.variant === "NODE") {
               if (s?.value && s.value.__typename === "NodeFunctionIdWrapper") {
                 const F = [...l, S()];
-                m(s.value, a + 1, F);
+                f(s.value, a + 1, F);
               }
-            } else s?.value && s.value.__typename === "NodeFunctionIdWrapper" && m(s.value, a, l);
+            } else s?.value && s.value.__typename === "NodeFunctionIdWrapper" && f(s.value, a, l);
           }
         const D = c();
         p.push({
@@ -124,8 +124,8 @@ const re = (n, t, o, u = []) => {
         }), e = o.getNodeById(T.id, e.nextNodeId);
       }
     };
-    return m(o.getNodeById(T.id, T.startingNodeId), 0, [0]), p;
-  }, [t, T, n, o, u, v, f, r]) ?? [];
+    return f(o.getNodeById(T.id, T.startingNodeId), 0, [0]), p;
+  }, [t, T, n, o, u, v, m, r]) ?? [];
 };
 export {
   re as useReferenceSuggestions

package/dist/components/data-table/DataTableFilterSuggestionMenu.js

@@ -5,8 +5,8 @@ import { MenuTrigger as y, MenuContent as _, Menu as g } from "../menu/Menu.js";
 const T = (t) => {
   const e = v.c(11), {
     children: l,
-    context: u
-  } = t, [m, p] = w.useState(!0), h = _;
+    context: m
+  } = t, [u, p] = w.useState(!0), h = _;
   let r;
   e[0] === /* @__PURE__ */ Symbol.for("react.memo_cache_sentinel") ? (r = (a) => p(a), e[0] = r) : r = e[0];
   let i;
@@ -18,9 +18,9 @@ const T = (t) => {
     height: 0
   } }) }), e[1] = i) : i = e[1];
   let n;
-  e[2] !== u?.view ? (n = (a) => {
-    ["Escape", "ArrowUp", "ArrowDown"].includes(a.key) || u?.view?.focus();
-  }, e[2] = u?.view, e[3] = n) : n = e[3];
+  e[2] !== m?.view ? (n = (a) => {
+    ["Escape", "ArrowUp", "ArrowDown"].includes(a.key) || m?.view?.focus();
+  }, e[2] = m?.view, e[3] = n) : n = e[3];
   let s;
   e[4] === /* @__PURE__ */ Symbol.for("react.memo_cache_sentinel") ? (s = {
     position: "fixed",
@@ -29,12 +29,12 @@ const T = (t) => {
     pointerEvents: "auto"
   }, e[4] = s) : s = e[4];
   let o;
-  e[5] !== l || e[6] !== n ? (o = /* @__PURE__ */ f(h, { w: "200px", onInteractOutside: b, onOpenAutoFocus: D, onKeyDown: n, style: s, children: l }), e[5] = l, e[6] = n, e[7] = o) : o = e[7];
+  e[5] !== l || e[6] !== n ? (o = /* @__PURE__ */ f(h, { miw: "200px", onInteractOutside: b, onOpenAutoFocus: D, onKeyDown: n, style: s, children: l }), e[5] = l, e[6] = n, e[7] = o) : o = e[7];
   let c;
-  return e[8] !== m || e[9] !== o ? (c = /* @__PURE__ */ d(g, { open: m, onOpenChange: r, modal: !1, children: [
+  return e[8] !== u || e[9] !== o ? (c = /* @__PURE__ */ d(g, { open: u, onOpenChange: r, modal: !1, children: [
     i,
     o
-  ] }), e[8] = m, e[9] = o, e[10] = c) : c = e[10], c;
+  ] }), e[8] = u, e[9] = o, e[10] = c) : c = e[10], c;
 };
 function x(t) {
   return t;

package/dist/node_modules/@lezer/common/dist/index.js

@@ -0,0 +1,146 @@
+let a = 0;
+class t {
+  /**
+  Create a new node prop type.
+  */
+  constructor(e = {}) {
+    this.id = a++, this.perNode = !!e.perNode, this.deserialize = e.deserialize || (() => {
+      throw new Error("This node type doesn't define a deserialize function");
+    }), this.combine = e.combine || null;
+  }
+  /**
+  This is meant to be used with
+  [`NodeSet.extend`](#common.NodeSet.extend) or
+  [`LRParser.configure`](#lr.ParserConfig.props) to compute
+  prop values for each node type in the set. Takes a [match
+  object](#common.NodeType^match) or function that returns undefined
+  if the node type doesn't get this prop, and the prop's value if
+  it does.
+  */
+  add(e) {
+    if (this.perNode)
+      throw new RangeError("Can't add per-node props to node types");
+    return typeof e != "function" && (e = l.match(e)), (n) => {
+      let o = e(n);
+      return o === void 0 ? null : [this, o];
+    };
+  }
+}
+t.closedBy = new t({ deserialize: (r) => r.split(" ") });
+t.openedBy = new t({ deserialize: (r) => r.split(" ") });
+t.group = new t({ deserialize: (r) => r.split(" ") });
+t.isolate = new t({ deserialize: (r) => {
+  if (r && r != "rtl" && r != "ltr" && r != "auto")
+    throw new RangeError("Invalid value for isolate: " + r);
+  return r || "auto";
+} });
+t.contextHash = new t({ perNode: !0 });
+t.lookAhead = new t({ perNode: !0 });
+t.mounted = new t({ perNode: !0 });
+const d = /* @__PURE__ */ Object.create(null);
+class l {
+  /**
+  @internal
+  */
+  constructor(e, n, o, s = 0) {
+    this.name = e, this.props = n, this.id = o, this.flags = s;
+  }
+  /**
+  Define a node type.
+  */
+  static define(e) {
+    let n = e.props && e.props.length ? /* @__PURE__ */ Object.create(null) : d, o = (e.top ? 1 : 0) | (e.skipped ? 2 : 0) | (e.error ? 4 : 0) | (e.name == null ? 8 : 0), s = new l(e.name || "", n, e.id, o);
+    if (e.props) {
+      for (let i of e.props)
+        if (Array.isArray(i) || (i = i(s)), i) {
+          if (i[0].perNode)
+            throw new RangeError("Can't store a per-node prop on a node type");
+          n[i[0].id] = i[1];
+        }
+    }
+    return s;
+  }
+  /**
+  Retrieves a node prop for this type. Will return `undefined` if
+  the prop isn't present on this node.
+  */
+  prop(e) {
+    return this.props[e.id];
+  }
+  /**
+  True when this is the top node of a grammar.
+  */
+  get isTop() {
+    return (this.flags & 1) > 0;
+  }
+  /**
+  True when this node is produced by a skip rule.
+  */
+  get isSkipped() {
+    return (this.flags & 2) > 0;
+  }
+  /**
+  Indicates whether this is an error node.
+  */
+  get isError() {
+    return (this.flags & 4) > 0;
+  }
+  /**
+  When true, this node type doesn't correspond to a user-declared
+  named node, for example because it is used to cache repetition.
+  */
+  get isAnonymous() {
+    return (this.flags & 8) > 0;
+  }
+  /**
+  Returns true when this node's name or one of its
+  [groups](#common.NodeProp^group) matches the given string.
+  */
+  is(e) {
+    if (typeof e == "string") {
+      if (this.name == e)
+        return !0;
+      let n = this.prop(t.group);
+      return n ? n.indexOf(e) > -1 : !1;
+    }
+    return this.id == e;
+  }
+  /**
+  Create a function from node types to arbitrary values by
+  specifying an object whose property names are node or
+  [group](#common.NodeProp^group) names. Often useful with
+  [`NodeProp.add`](#common.NodeProp.add). You can put multiple
+  names, separated by spaces, in a single property name to map
+  multiple node names to a single value.
+  */
+  static match(e) {
+    let n = /* @__PURE__ */ Object.create(null);
+    for (let o in e)
+      for (let s of o.split(" "))
+        n[s] = e[o];
+    return (o) => {
+      for (let s = o.prop(t.group), i = -1; i < (s ? s.length : 0); i++) {
+        let p = n[i < 0 ? o.name : s[i]];
+        if (p)
+          return p;
+      }
+    };
+  }
+}
+l.none = new l(
+  "",
+  /* @__PURE__ */ Object.create(null),
+  0,
+  8
+  /* NodeFlag.Anonymous */
+);
+var u;
+(function(r) {
+  r[r.ExcludeBuffers = 1] = "ExcludeBuffers", r[r.IncludeAnonymous = 2] = "IncludeAnonymous", r[r.IgnoreMounts = 4] = "IgnoreMounts", r[r.IgnoreOverlays = 8] = "IgnoreOverlays", r[r.EnterBracketed = 16] = "EnterBracketed";
+})(u || (u = {}));
+new t({ perNode: !0 });
+export {
+  u as IterMode,
+  t as NodeProp,
+  l as NodeType
+};

package/dist/node_modules/@lezer/highlight/dist/index.js

@@ -1,4 +1,4 @@
-import { NodeProp as q } from "@lezer/common";
+import { NodeProp as q } from "../../common/dist/index.js";
 let A = 0;
 class l {
   /**

package/dist/utils/generics.js

@@ -17,7 +17,7 @@ const _ = "GENERIC", y = (e) => typeof e == "object" && e !== null && !Array.isA
   if (y(e)) {
     const t = {};
     return Object.entries(e).forEach(([r, s]) => {
-      r === "__typename" || r === "id" || r === "createdAt" || r === "updatedAt" || (t[r] = C(s));
+      s != null && (r === "__typename" || r === "id" || r === "createdAt" || r === "updatedAt" || (t[r] = C(s)));
     }), t;
   }
   return e;

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@code0-tech/pictor",
-  "version": "0.0.0-mvp.42",
+  "version": "0.0.0-mvp.43",
   "type": "module",
   "description": "A simple template for a custom React component library",
   "scripts": {
@@ -119,7 +119,6 @@
     "@codemirror/language": "^6.12.1",
     "@monaco-editor/react": "^4.7.0",
     "@radix-ui/react-checkbox": "^1.3.3",
-    "@lezer/common": "^1.5.1",
     "@radix-ui/react-context-menu": "^2.2.16",
     "@radix-ui/react-dialog": "^1.1.15",
     "@radix-ui/react-dropdown-menu": "^2.1.16",