@popcorn245/cornfield-components 0.52.0 → 0.52.1

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
@@ -1,11 +1,11 @@
1
- import { D as e, Gt as t, M as n, St as r, T as i, ct as a, dt as o, et as s, it as c, l, mt as u, o as d, pt as f, st as p, ut as m } from "./engine-HIgX35hE.js";
1
+ import { E as e, N as t, O as n, ft as r, gt as i, ht as a, l as o, lt as s, o as c, ot as l, pt as u, qt as d, tt as f, ut as p, wt as m } from "./engine-BmXtSISH.js";
2
2
  // ../explorer/engine/layers.js
3
3
  var h = (e) => e.match && e.match.type ? [].concat(e.match.type) : [], g = {
4
4
  flow: "#fb923c",
5
5
  runs: "#5eead4"
6
6
  }, _ = (e) => {
7
7
  let t = h(e)[0];
8
- return t && r[t] ? r[t].color : g[e.key];
8
+ return t && m[t] ? m[t].color : g[e.key];
9
9
  }, v = /* @__PURE__ */ new Set([
10
10
  "stack",
11
11
  "machine",
@@ -13,7 +13,7 @@ var h = (e) => e.match && e.match.type ? [].concat(e.match.type) : [], g = {
13
13
  "device",
14
14
  "house",
15
15
  "persona"
16
- ]), y = m.map((e) => ({
16
+ ]), y = r.map((e) => ({
17
17
  ...e,
18
18
  color: _(e)
19
19
  })), b = "cornfield:layers", x = /^[a-z][a-z0-9-]{0,40}$/, S = (e) => e.slot("layers", () => ({
@@ -23,51 +23,51 @@ var h = (e) => e.match && e.match.type ? [].concat(e.match.type) : [], g = {
23
23
  function C(e, t) {
24
24
  S(e).storeKey = t;
25
25
  }
26
- var w = (e, t) => Object.hasOwn(e.state.layerDefaults, t) ? e.state.layerDefaults[t] : !v.has(t), T = (e, t) => c(e.state, t), E = "#94a3b8", D = "\\d{1,3}(?:\\.\\d+)?%?", O = RegExp(`^(?:#(?:[0-9a-f]{3,4}|[0-9a-f]{6}|[0-9a-f]{8})|rgba?\\(\\s*${D}(?:\\s*,\\s*|\\s+)${D}(?:\\s*,\\s*|\\s+)${D}(?:\\s*[,/]\\s*(?:\\d*\\.)?\\d+%?)?\\s*\\))$`, "i"), k = (e) => typeof e == "string" && e.length <= 64 && O.test(e.trim()) ? e.trim() : E;
27
- function A(e, t, r) {
28
- return k(d(l(e).get().values, t) || n(s(r, e.state.theme)));
26
+ var w = (e, t) => Object.hasOwn(e.state.layerDefaults, t) ? e.state.layerDefaults[t] : !v.has(t), T = (e, t) => l(e.state, t), E = "#94a3b8", D = "\\d{1,3}(?:\\.\\d+)?%?", O = RegExp(`^(?:#(?:[0-9a-f]{3,4}|[0-9a-f]{6}|[0-9a-f]{8})|rgba?\\(\\s*${D}(?:\\s*,\\s*|\\s+)${D}(?:\\s*,\\s*|\\s+)${D}(?:\\s*[,/]\\s*(?:\\d*\\.)?\\d+%?)?\\s*\\))$`, "i"), k = (e) => typeof e == "string" && e.length <= 64 && O.test(e.trim()) ? e.trim() : E;
27
+ function A(e, n, r) {
28
+ return k(c(o(e).get().values, n) || t(f(r, e.state.theme)));
29
29
  }
30
30
  var j = (e, t) => {
31
31
  let n = h(t);
32
32
  return n.length > 1 && n.find((t) => e.state.nodes.some((e) => e.type === t)) || n[0] || t.key;
33
33
  };
34
34
  function M(t) {
35
- let { state: n } = t, o = (e) => {
35
+ let { state: r } = t, o = (e) => {
36
36
  let n = j(t, e);
37
37
  return {
38
38
  ...e,
39
39
  color: A(t, {
40
40
  type: n,
41
41
  group: e.key
42
- }, r[n] ? r[n].color : e.color)
42
+ }, m[n] ? m[n].color : e.color)
43
43
  };
44
44
  }, s = /* @__PURE__ */ new Set(), c = /* @__PURE__ */ new Set();
45
- n.nodes.forEach((e) => {
46
- let t = a(n, e);
45
+ r.nodes.forEach((e) => {
46
+ let t = p(r, e);
47
47
  if (!t) return;
48
48
  s.add(t);
49
- let r = u(e);
50
- r !== t && c.add(r);
49
+ let n = i(e);
50
+ n !== t && c.add(n);
51
51
  });
52
- let l = (r) => {
53
- let o = n.nodes.find((e) => a(n, e) === r.key);
54
- return { color: A(t, o ? {
55
- type: o.type,
56
- layer: r.key,
57
- group: e(o)
52
+ let l = (i) => {
53
+ let a = r.nodes.find((e) => p(r, e) === i.key);
54
+ return { color: A(t, a ? {
55
+ type: a.type,
56
+ layer: i.key,
57
+ group: n(a)
58
58
  } : {
59
- type: r.key,
60
- layer: r.key
61
- }, o ? i(o) : E) };
62
- }, d = n.projectLayers.filter((e) => s.has(e.key)).map((e) => ({
59
+ type: i.key,
60
+ layer: i.key
61
+ }, a ? e(a) : E) };
62
+ }, u = r.projectLayers.filter((e) => s.has(e.key)).map((e) => ({
63
63
  key: e.key,
64
64
  label: e.label,
65
65
  desc: e.desc || "",
66
66
  project: !0,
67
67
  ...l(e)
68
- })), p = y.filter((e) => !e.overlay && (s.has(e.key) || !c.has(e.key))).map(o), m = /* @__PURE__ */ new Set([...y.map((e) => e.key), ...n.projectLayers.map((e) => e.key)]), h = [];
68
+ })), d = y.filter((e) => !e.overlay && (s.has(e.key) || !c.has(e.key))).map(o), f = /* @__PURE__ */ new Set([...y.map((e) => e.key), ...r.projectLayers.map((e) => e.key)]), h = [];
69
69
  return s.forEach((e) => {
70
- m.has(e) || (m.add(e), h.push({
70
+ f.has(e) || (f.add(e), h.push({
71
71
  key: e,
72
72
  label: e.charAt(0).toUpperCase() + e.slice(1),
73
73
  color: A(t, {
@@ -77,7 +77,7 @@ function M(t) {
77
77
  desc: `Nodes of the type ${e}`
78
78
  }));
79
79
  }), {
80
- layers: [...f(d, p, n.layerOrder), ...h],
80
+ layers: [...a(u, d, r.layerOrder), ...h],
81
81
  overlays: y.filter((e) => e.overlay).map(o)
82
82
  };
83
83
  }
@@ -100,7 +100,7 @@ function F(e, t, n) {
100
100
  n === w(e, t) ? delete r[t] : r[t] = n;
101
101
  }
102
102
  function I(e, t) {
103
- let { state: n } = e, r = o(t);
103
+ let { state: n } = e, r = u(t);
104
104
  n.projectLayers = r.add, n.layerOrder = r.order;
105
105
  let i = {};
106
106
  for (let e of y) i[e.key] = !v.has(e.key);
@@ -119,7 +119,7 @@ function L(e) {
119
119
  if (typeof e.kind != "string" || !e.kind) return;
120
120
  let t = `${e.type}\u0000${e.kind}`;
121
121
  n.has(t) || (n.add(t), r.push([e.type, e.kind]));
122
- }), l(e).setSubjects({
122
+ }), o(e).setSubjects({
123
123
  kinds: r,
124
124
  layers: t.projectLayers.map((e) => e.key)
125
125
  });
@@ -138,29 +138,29 @@ var z = (e) => e.slot("layers-draw", () => ({ drawing: !1 })).drawing, B = (e, t
138
138
  function V(e) {
139
139
  e.touchScene(), e.emit("layers"), R(e), e.map && (e.map.render(), e.map.ensureFlowLoop());
140
140
  }
141
- function H(e, n, r, { viewer: i = !1, scenario: a = !1 } = {}) {
142
- let { state: o } = e, s = o.review && o.proposal ? o.review : null;
143
- if (s ? ((a ? s.step : s.manual)[n] = r, s.rev++) : (o.activeLayers[n] = r, i && (F(e, n, r), P(e))), V(e), i) {
144
- let { layers: i, overlays: a } = M(e), c = [...i, ...a].find((e) => e.key === n), l = o.nodes.filter((t) => e.map.isNodeVisible(t)).length;
145
- t(e, `${c ? c.label : n} ${r ? "on" : "off"}${s ? " for this review" : ""}. ${l} ${l === 1 ? "node" : "nodes"} shown.`);
141
+ function H(e, t, n, { viewer: r = !1, scenario: i = !1 } = {}) {
142
+ let { state: a } = e, o = a.review && a.proposal ? a.review : null;
143
+ if (o ? ((i ? o.step : o.manual)[t] = n, o.rev++) : (a.activeLayers[t] = n, r && (F(e, t, n), P(e))), V(e), r) {
144
+ let { layers: r, overlays: i } = M(e), s = [...r, ...i].find((e) => e.key === t), c = a.nodes.filter((t) => e.map.isNodeVisible(t)).length;
145
+ d(e, `${s ? s.label : t} ${n ? "on" : "off"}${o ? " for this review" : ""}. ${c} ${c === 1 ? "node" : "nodes"} shown.`);
146
146
  }
147
147
  }
148
148
  function U(e, t, n = {}) {
149
- H(e, t, !c(e.state, t), n);
149
+ H(e, t, !l(e.state, t), n);
150
150
  }
151
- function W(e, n, { viewer: r = !1 } = {}) {
152
- let { state: i } = e, { layers: a } = M(e), o = /* @__PURE__ */ new Set([
151
+ function W(e, t, { viewer: n = !1 } = {}) {
152
+ let { state: r } = e, { layers: i } = M(e), a = /* @__PURE__ */ new Set([
153
153
  ...y.filter((e) => !e.overlay).map((e) => e.key),
154
- ...i.projectLayers.map((e) => e.key),
155
- ...a.map((e) => e.key)
156
- ]), s = i.review && i.proposal ? i.review : null;
157
- if (s ? (o.forEach((e) => {
158
- s.manual[e] = n;
159
- }), s.rev++) : (o.forEach((t) => {
160
- i.activeLayers[t] = n, r && F(e, t, n);
161
- }), r && P(e)), V(e), r) {
162
- let r = i.nodes.filter((t) => e.map.isNodeVisible(t)).length;
163
- t(e, `${n ? "All" : "No"} layers on${s ? " for this review" : ""}. ${r} ${r === 1 ? "node" : "nodes"} shown.`);
154
+ ...r.projectLayers.map((e) => e.key),
155
+ ...i.map((e) => e.key)
156
+ ]), o = r.review && r.proposal ? r.review : null;
157
+ if (o ? (a.forEach((e) => {
158
+ o.manual[e] = t;
159
+ }), o.rev++) : (a.forEach((i) => {
160
+ r.activeLayers[i] = t, n && F(e, i, t);
161
+ }), n && P(e)), V(e), n) {
162
+ let n = r.nodes.filter((t) => e.map.isNodeVisible(t)).length;
163
+ d(e, `${t ? "All" : "No"} layers on${o ? " for this review" : ""}. ${n} ${n === 1 ? "node" : "nodes"} shown.`);
164
164
  }
165
165
  }
166
166
  function G(e) {
@@ -177,12 +177,12 @@ function K(e) {
177
177
  function q(e) {
178
178
  let { state: t } = e;
179
179
  if (!t.review || !t.proposal || t.review.whole) return "";
180
- let { layers: n } = M(e), r = new Set(t.nodes.map((e) => a(t, e)));
181
- return n.some((e) => r.has(e.key) && p(t, e.key)) ? `Showing ${n.filter((t) => T(e, t.key)).length} of ${n.length} layers: the ones this proposal changes.` : "";
180
+ let { layers: n } = M(e), r = new Set(t.nodes.map((e) => p(t, e)));
181
+ return n.some((e) => r.has(e.key) && s(t, e.key)) ? `Showing ${n.filter((t) => T(e, t.key)).length} of ${n.length} layers: the ones this proposal changes.` : "";
182
182
  }
183
- function J(e, n) {
184
- let { state: r } = e, i = r.review && r.proposal ? r.review : null;
185
- i && i.whole !== n && (i.whole = n, i.rev++, V(e), t(e, n ? "Showing the whole map." : q(e) || "Showing the change: the rest of the map is greyed."));
183
+ function J(e, t) {
184
+ let { state: n } = e, r = n.review && n.proposal ? n.review : null;
185
+ r && r.whole !== t && (r.whole = t, r.rev++, V(e), d(e, t ? "Showing the whole map." : q(e) || "Showing the change: the rest of the map is greyed."));
186
186
  }
187
187
  function Y(e) {
188
188
  let { review: t } = e.state;