@altimateai/ui-components 0.0.77-beta.6 → 0.0.77-beta.7

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,4 +1,4 @@
1
- import { aG as b, bN as F, bO as Y, bP as H, bQ as _, aS as i, aM as V, bR as U, bS as q, bq as Q, bv as $, br as P, bp as z, bT as K, bU as W, bV as Z } from "./CoachForm.js";
1
+ import { aG as X, cD as j, cE as H, cF as Y, cG as _, aS as i, aM as V, cH as q, cI as K, bq as U, bv as $, br as P, bp as z, cJ as Q, cK as W, cL as Z } from "./CoachForm.js";
2
2
  import { G as B } from "./graph2.js";
3
3
  import { l as I } from "./layout2.js";
4
4
  import { i as x } from "./_baseUniq.js";
@@ -18,8 +18,8 @@ function p(e) {
18
18
  }
19
19
  function ee(e) {
20
20
  return A(e.nodes(), function(t) {
21
- var n = e.node(t), o = e.parent(t), c = { v: t };
22
- return x(n) || (c.value = n), x(o) || (c.parent = o), c;
21
+ var n = e.node(t), o = e.parent(t), a = { v: t };
22
+ return x(n) || (a.value = n), x(o) || (a.parent = o), a;
23
23
  });
24
24
  }
25
25
  function ne(e) {
@@ -28,15 +28,15 @@ function ne(e) {
28
28
  return x(t.name) || (o.name = t.name), x(n) || (o.value = n), o;
29
29
  });
30
30
  }
31
- var f = /* @__PURE__ */ new Map(), N = /* @__PURE__ */ new Map(), G = /* @__PURE__ */ new Map(), te = /* @__PURE__ */ b(() => {
31
+ var f = /* @__PURE__ */ new Map(), N = /* @__PURE__ */ new Map(), G = /* @__PURE__ */ new Map(), te = /* @__PURE__ */ X(() => {
32
32
  N.clear(), G.clear(), f.clear();
33
- }, "clear"), O = /* @__PURE__ */ b((e, t) => {
33
+ }, "clear"), O = /* @__PURE__ */ X((e, t) => {
34
34
  const n = N.get(t) || [];
35
35
  return i.trace("In isDescendant", t, " ", e, " = ", n.includes(e)), n.includes(e);
36
- }, "isDescendant"), se = /* @__PURE__ */ b((e, t) => {
36
+ }, "isDescendant"), se = /* @__PURE__ */ X((e, t) => {
37
37
  const n = N.get(t) || [];
38
38
  return i.info("Descendants of ", t, " is ", n), i.info("Edge is ", e), e.v === t || e.w === t ? !1 : n ? n.includes(e.v) || O(e.v, t) || O(e.w, t) || n.includes(e.w) : (i.debug("Tilt, ", t, ",not in descendants"), !1);
39
- }, "edgeInCluster"), J = /* @__PURE__ */ b((e, t, n, o) => {
39
+ }, "edgeInCluster"), J = /* @__PURE__ */ X((e, t, n, o) => {
40
40
  i.warn(
41
41
  "Copying children of ",
42
42
  e,
@@ -46,21 +46,21 @@ var f = /* @__PURE__ */ new Map(), N = /* @__PURE__ */ new Map(), G = /* @__PURE
46
46
  t.node(e),
47
47
  o
48
48
  );
49
- const c = t.children(e) || [];
50
- e !== o && c.push(e), i.warn("Copying (nodes) clusterId", e, "nodes", c), c.forEach((a) => {
51
- if (t.children(a).length > 0)
52
- J(a, t, n, o);
49
+ const a = t.children(e) || [];
50
+ e !== o && a.push(e), i.warn("Copying (nodes) clusterId", e, "nodes", a), a.forEach((c) => {
51
+ if (t.children(c).length > 0)
52
+ J(c, t, n, o);
53
53
  else {
54
- const r = t.node(a);
55
- i.info("cp ", a, " to ", o, " with parent ", e), n.setNode(a, r), o !== t.parent(a) && (i.warn("Setting parent", a, t.parent(a)), n.setParent(a, t.parent(a))), e !== o && a !== e ? (i.debug("Setting parent", a, e), n.setParent(a, e)) : (i.info("In copy ", e, "root", o, "data", t.node(e), o), i.debug(
54
+ const r = t.node(c);
55
+ i.info("cp ", c, " to ", o, " with parent ", e), n.setNode(c, r), o !== t.parent(c) && (i.warn("Setting parent", c, t.parent(c)), n.setParent(c, t.parent(c))), e !== o && c !== e ? (i.debug("Setting parent", c, e), n.setParent(c, e)) : (i.info("In copy ", e, "root", o, "data", t.node(e), o), i.debug(
56
56
  "Not Setting parent for node=",
57
- a,
57
+ c,
58
58
  "cluster!==rootId",
59
59
  e !== o,
60
60
  "node!==clusterId",
61
- a !== e
61
+ c !== e
62
62
  ));
63
- const u = t.edges(a);
63
+ const u = t.edges(c);
64
64
  i.debug("Copying Edges", u), u.forEach((l) => {
65
65
  i.info("Edge", l);
66
66
  const h = t.edge(l.v, l.w, l.name);
@@ -81,32 +81,32 @@ var f = /* @__PURE__ */ new Map(), N = /* @__PURE__ */ new Map(), G = /* @__PURE
81
81
  }
82
82
  });
83
83
  }
84
- i.debug("Removing node", a), t.removeNode(a);
84
+ i.debug("Removing node", c), t.removeNode(c);
85
85
  });
86
- }, "copy"), R = /* @__PURE__ */ b((e, t) => {
86
+ }, "copy"), R = /* @__PURE__ */ X((e, t) => {
87
87
  const n = t.children(e);
88
88
  let o = [...n];
89
- for (const c of n)
90
- G.set(c, e), o = [...o, ...R(c, t)];
89
+ for (const a of n)
90
+ G.set(a, e), o = [...o, ...R(a, t)];
91
91
  return o;
92
- }, "extractDescendants"), ie = /* @__PURE__ */ b((e, t, n) => {
93
- const o = e.edges().filter((l) => l.v === t || l.w === t), c = e.edges().filter((l) => l.v === n || l.w === n), a = o.map((l) => ({ v: l.v === t ? n : l.v, w: l.w === t ? t : l.w })), r = c.map((l) => ({ v: l.v, w: l.w }));
94
- return a.filter((l) => r.some((h) => l.v === h.v && l.w === h.w));
95
- }, "findCommonEdges"), D = /* @__PURE__ */ b((e, t, n) => {
92
+ }, "extractDescendants"), ie = /* @__PURE__ */ X((e, t, n) => {
93
+ const o = e.edges().filter((l) => l.v === t || l.w === t), a = e.edges().filter((l) => l.v === n || l.w === n), c = o.map((l) => ({ v: l.v === t ? n : l.v, w: l.w === t ? t : l.w })), r = a.map((l) => ({ v: l.v, w: l.w }));
94
+ return c.filter((l) => r.some((h) => l.v === h.v && l.w === h.w));
95
+ }, "findCommonEdges"), D = /* @__PURE__ */ X((e, t, n) => {
96
96
  const o = t.children(e);
97
97
  if (i.trace("Searching children of id ", e, o), o.length < 1)
98
98
  return e;
99
- let c;
100
- for (const a of o) {
101
- const r = D(a, t, n), u = ie(t, n, r);
99
+ let a;
100
+ for (const c of o) {
101
+ const r = D(c, t, n), u = ie(t, n, r);
102
102
  if (r)
103
103
  if (u.length > 0)
104
- c = r;
104
+ a = r;
105
105
  else
106
106
  return r;
107
107
  }
108
- return c;
109
- }, "findNonClusterChild"), k = /* @__PURE__ */ b((e) => !f.has(e) || !f.get(e).externalConnections ? e : f.has(e) ? f.get(e).id : e, "getAnchorId"), re = /* @__PURE__ */ b((e, t) => {
108
+ return a;
109
+ }, "findNonClusterChild"), k = /* @__PURE__ */ X((e) => !f.has(e) || !f.get(e).externalConnections ? e : f.has(e) ? f.get(e).id : e, "getAnchorId"), re = /* @__PURE__ */ X((e, t) => {
110
110
  if (!e || t > 10) {
111
111
  i.debug("Opting out, no graph ");
112
112
  return;
@@ -120,20 +120,20 @@ var f = /* @__PURE__ */ new Map(), N = /* @__PURE__ */ new Map(), G = /* @__PURE
120
120
  D(n, e, n)
121
121
  ), N.set(n, R(n, e)), f.set(n, { id: D(n, e, n), clusterData: e.node(n) }));
122
122
  }), e.nodes().forEach(function(n) {
123
- const o = e.children(n), c = e.edges();
124
- o.length > 0 ? (i.debug("Cluster identified", n, N), c.forEach((a) => {
125
- const r = O(a.v, n), u = O(a.w, n);
126
- r ^ u && (i.warn("Edge: ", a, " leaves cluster ", n), i.warn("Descendants of XXX ", n, ": ", N.get(n)), f.get(n).externalConnections = !0);
123
+ const o = e.children(n), a = e.edges();
124
+ o.length > 0 ? (i.debug("Cluster identified", n, N), a.forEach((c) => {
125
+ const r = O(c.v, n), u = O(c.w, n);
126
+ r ^ u && (i.warn("Edge: ", c, " leaves cluster ", n), i.warn("Descendants of XXX ", n, ": ", N.get(n)), f.get(n).externalConnections = !0);
127
127
  })) : i.debug("Not a cluster ", n, N);
128
128
  });
129
129
  for (let n of f.keys()) {
130
- const o = f.get(n).id, c = e.parent(o);
131
- c !== n && f.has(c) && !f.get(c).externalConnections && (f.get(n).id = c);
130
+ const o = f.get(n).id, a = e.parent(o);
131
+ a !== n && f.has(a) && !f.get(a).externalConnections && (f.get(n).id = a);
132
132
  }
133
133
  e.edges().forEach(function(n) {
134
134
  const o = e.edge(n);
135
135
  i.warn("Edge " + n.v + " -> " + n.w + ": " + JSON.stringify(n)), i.warn("Edge " + n.v + " -> " + n.w + ": " + JSON.stringify(e.edge(n)));
136
- let c = n.v, a = n.w;
136
+ let a = n.v, c = n.w;
137
137
  if (i.warn(
138
138
  "Fix XXX",
139
139
  f,
@@ -145,19 +145,19 @@ var f = /* @__PURE__ */ new Map(), N = /* @__PURE__ */ new Map(), G = /* @__PURE
145
145
  " --- ",
146
146
  f.get(n.w)
147
147
  ), f.get(n.v) || f.get(n.w)) {
148
- if (i.warn("Fixing and trying - removing XXX", n.v, n.w, n.name), c = k(n.v), a = k(n.w), e.removeEdge(n.v, n.w, n.name), c !== n.v) {
149
- const r = e.parent(c);
148
+ if (i.warn("Fixing and trying - removing XXX", n.v, n.w, n.name), a = k(n.v), c = k(n.w), e.removeEdge(n.v, n.w, n.name), a !== n.v) {
149
+ const r = e.parent(a);
150
150
  f.get(r).externalConnections = !0, o.fromCluster = n.v;
151
151
  }
152
- if (a !== n.w) {
153
- const r = e.parent(a);
152
+ if (c !== n.w) {
153
+ const r = e.parent(c);
154
154
  f.get(r).externalConnections = !0, o.toCluster = n.w;
155
155
  }
156
- i.warn("Fix Replacing with XXX", c, a, n.name), e.setEdge(c, a, o, n.name);
156
+ i.warn("Fix Replacing with XXX", a, c, n.name), e.setEdge(a, c, o, n.name);
157
157
  }
158
158
  }), i.warn("Adjusted Graph", p(e)), T(e, 0), i.trace(f);
159
- }, "adjustClustersAndEdges"), T = /* @__PURE__ */ b((e, t) => {
160
- var c, a;
159
+ }, "adjustClustersAndEdges"), T = /* @__PURE__ */ X((e, t) => {
160
+ var a, c;
161
161
  if (i.warn("extractor - ", t, p(e), e.children("D")), t > 10) {
162
162
  i.error("Bailing out");
163
163
  return;
@@ -192,7 +192,7 @@ var f = /* @__PURE__ */ new Map(), N = /* @__PURE__ */ new Map(), G = /* @__PURE
192
192
  t
193
193
  );
194
194
  let l = e.graph().rankdir === "TB" ? "LR" : "TB";
195
- (a = (c = f.get(r)) == null ? void 0 : c.clusterData) != null && a.dir && (l = f.get(r).clusterData.dir, i.warn("Fixing dir", f.get(r).clusterData.dir, l));
195
+ (c = (a = f.get(r)) == null ? void 0 : a.clusterData) != null && c.dir && (l = f.get(r).clusterData.dir, i.warn("Fixing dir", f.get(r).clusterData.dir, l));
196
196
  const h = new B({
197
197
  multigraph: !0,
198
198
  compound: !0
@@ -230,16 +230,16 @@ var f = /* @__PURE__ */ new Map(), N = /* @__PURE__ */ new Map(), G = /* @__PURE
230
230
  const u = e.node(r);
231
231
  i.warn(" Now next level", r, u), u != null && u.clusterNode && T(u.graph, t + 1);
232
232
  }
233
- }, "extractor"), M = /* @__PURE__ */ b((e, t) => {
233
+ }, "extractor"), M = /* @__PURE__ */ X((e, t) => {
234
234
  if (t.length === 0)
235
235
  return [];
236
236
  let n = Object.assign([], t);
237
237
  return t.forEach((o) => {
238
- const c = e.children(o), a = M(e, c);
239
- n = [...n, ...a];
238
+ const a = e.children(o), c = M(e, a);
239
+ n = [...n, ...c];
240
240
  }), n;
241
- }, "sorter"), oe = /* @__PURE__ */ b((e) => M(e, e.children()), "sortNodesByHierarchy"), j = /* @__PURE__ */ b(async (e, t, n, o, c, a) => {
242
- i.warn("Graph in recursive render:XAX", p(t), c);
241
+ }, "sorter"), oe = /* @__PURE__ */ X((e) => M(e, e.children()), "sortNodesByHierarchy"), F = /* @__PURE__ */ X(async (e, t, n, o, a, c) => {
242
+ i.warn("Graph in recursive render:XAX", p(t), a);
243
243
  const r = t.graph().rankdir;
244
244
  i.trace("Dir in recursive render - dir:", r);
245
245
  const u = e.insert("g").attr("class", "root");
@@ -248,8 +248,8 @@ var f = /* @__PURE__ */ new Map(), N = /* @__PURE__ */ new Map(), G = /* @__PURE
248
248
  await Promise.all(
249
249
  t.nodes().map(async function(d) {
250
250
  const s = t.node(d);
251
- if (c !== void 0) {
252
- const w = JSON.parse(JSON.stringify(c.clusterData));
251
+ if (a !== void 0) {
252
+ const w = JSON.parse(JSON.stringify(a.clusterData));
253
253
  i.trace(
254
254
  `Setting data for parent cluster XXX
255
255
  Node.id = `,
@@ -259,8 +259,8 @@ var f = /* @__PURE__ */ new Map(), N = /* @__PURE__ */ new Map(), G = /* @__PURE
259
259
  w.height,
260
260
  `
261
261
  Parent cluster`,
262
- c.height
263
- ), t.setNode(c.id, w), t.parent(d) || (i.trace("Setting parent", d, c.id), t.setParent(d, c.id, w));
262
+ a.height
263
+ ), t.setNode(a.id, w), t.parent(d) || (i.trace("Setting parent", d, a.id), t.setParent(d, a.id, w));
264
264
  }
265
265
  if (i.info("(Insert) Node XXX" + d + ": " + JSON.stringify(t.node(d))), s != null && s.clusterNode) {
266
266
  i.info("Cluster identified XBX", d, s.width, t.node(d));
@@ -270,15 +270,15 @@ Parent cluster`,
270
270
  ranksep: w + 25,
271
271
  nodesep: m
272
272
  });
273
- const E = await j(
273
+ const b = await F(
274
274
  g,
275
275
  s.graph,
276
276
  n,
277
277
  o,
278
278
  t.node(d),
279
- a
280
- ), S = E.elem;
281
- U(s, S), s.diff = E.diff || 0, i.info(
279
+ c
280
+ ), S = b.elem;
281
+ q(s, S), s.diff = b.diff || 0, i.info(
282
282
  "New compound node after recursive render XAX",
283
283
  d,
284
284
  "width",
@@ -288,7 +288,7 @@ Parent cluster`,
288
288
  s.height
289
289
  // node.x,
290
290
  // node.y
291
- ), q(S, s);
291
+ ), K(S, s);
292
292
  } else
293
293
  t.children(d).length > 0 ? (i.trace(
294
294
  "Cluster - the non recursive path XBX",
@@ -298,9 +298,9 @@ Parent cluster`,
298
298
  s.width,
299
299
  "Graph:",
300
300
  t
301
- ), i.trace(D(s.id, t)), f.set(s.id, { id: D(s.id, t), node: s })) : (i.trace("Node - the non recursive path XAX", d, g, t.node(d), r), await Q(g, t.node(d), { config: a, dir: r }));
301
+ ), i.trace(D(s.id, t)), f.set(s.id, { id: D(s.id, t), node: s })) : (i.trace("Node - the non recursive path XAX", d, g, t.node(d), r), await U(g, t.node(d), { config: c, dir: r }));
302
302
  })
303
- ), await (/* @__PURE__ */ b(async () => {
303
+ ), await (/* @__PURE__ */ X(async () => {
304
304
  const d = t.edges().map(async function(s) {
305
305
  const w = t.edge(s.v, s.w, s.name);
306
306
  i.info("Edge " + s.v + " -> " + s.w + ": " + JSON.stringify(s)), i.info("Edge " + s.v + " -> " + s.w + ": ", s, " ", JSON.stringify(t.edge(s))), i.info(
@@ -316,7 +316,7 @@ Parent cluster`,
316
316
  });
317
317
  await Promise.all(d);
318
318
  }, "processEdges"))(), i.info("Graph before layout:", JSON.stringify(p(t))), i.info("############################################# XXX"), i.info("### Layout ### XXX"), i.info("############################################# XXX"), I(t), i.info("Graph after layout:", JSON.stringify(p(t)));
319
- let y = 0, { subGraphTitleTotalMargin: X } = $(a);
319
+ let E = 0, { subGraphTitleTotalMargin: y } = $(c);
320
320
  return await Promise.all(
321
321
  oe(t).map(async function(d) {
322
322
  var w;
@@ -329,7 +329,7 @@ Parent cluster`,
329
329
  " height: ",
330
330
  s.height
331
331
  ), s != null && s.clusterNode)
332
- s.y += X, i.info(
332
+ s.y += y, i.info(
333
333
  "A tainted cluster node XBX1",
334
334
  d,
335
335
  s.id,
@@ -349,12 +349,12 @@ Parent cluster`,
349
349
  s.width,
350
350
  s.height,
351
351
  t.parent(d)
352
- ), s.height += X, t.node(s.parentId);
353
- const m = (s == null ? void 0 : s.padding) / 2 || 0, E = ((w = s == null ? void 0 : s.labelBBox) == null ? void 0 : w.height) || 0, S = E - m || 0;
354
- i.debug("OffsetY", S, "labelHeight", E, "halfPadding", m), await z(l, s), f.get(s.id).node = s;
352
+ ), s.height += y, t.node(s.parentId);
353
+ const m = (s == null ? void 0 : s.padding) / 2 || 0, b = ((w = s == null ? void 0 : s.labelBBox) == null ? void 0 : w.height) || 0, S = b - m || 0;
354
+ i.debug("OffsetY", S, "labelHeight", b, "halfPadding", m), await z(l, s), f.get(s.id).node = s;
355
355
  } else {
356
356
  const m = t.node(s.parentId);
357
- s.y += X / 2, i.info(
357
+ s.y += y / 2, i.info(
358
358
  "A regular node XBX1 - using the padding",
359
359
  s.id,
360
360
  "parent",
@@ -374,37 +374,37 @@ Parent cluster`,
374
374
  })
375
375
  ), t.edges().forEach(function(d) {
376
376
  const s = t.edge(d);
377
- i.info("Edge " + d.v + " -> " + d.w + ": " + JSON.stringify(s), s), s.points.forEach((S) => S.y += X / 2);
377
+ i.info("Edge " + d.v + " -> " + d.w + ": " + JSON.stringify(s), s), s.points.forEach((S) => S.y += y / 2);
378
378
  const w = t.node(d.v);
379
379
  var m = t.node(d.w);
380
- const E = K(h, s, f, n, w, m, o);
381
- W(s, E);
380
+ const b = Q(h, s, f, n, w, m, o);
381
+ W(s, b);
382
382
  }), t.nodes().forEach(function(d) {
383
383
  const s = t.node(d);
384
- i.info(d, s.type, s.diff), s.isGroup && (y = s.diff);
385
- }), i.warn("Returning from recursive render XAX", u, y), { elem: u, diff: y };
386
- }, "recursiveRender"), ge = /* @__PURE__ */ b(async (e, t) => {
387
- var a, r, u, l, h, C;
384
+ i.info(d, s.type, s.diff), s.isGroup && (E = s.diff);
385
+ }), i.warn("Returning from recursive render XAX", u, E), { elem: u, diff: E };
386
+ }, "recursiveRender"), ge = /* @__PURE__ */ X(async (e, t) => {
387
+ var c, r, u, l, h, C;
388
388
  const n = new B({
389
389
  multigraph: !0,
390
390
  compound: !0
391
391
  }).setGraph({
392
392
  rankdir: e.direction,
393
- nodesep: ((a = e.config) == null ? void 0 : a.nodeSpacing) || ((u = (r = e.config) == null ? void 0 : r.flowchart) == null ? void 0 : u.nodeSpacing) || e.nodeSpacing,
393
+ nodesep: ((c = e.config) == null ? void 0 : c.nodeSpacing) || ((u = (r = e.config) == null ? void 0 : r.flowchart) == null ? void 0 : u.nodeSpacing) || e.nodeSpacing,
394
394
  ranksep: ((l = e.config) == null ? void 0 : l.rankSpacing) || ((C = (h = e.config) == null ? void 0 : h.flowchart) == null ? void 0 : C.rankSpacing) || e.rankSpacing,
395
395
  marginx: 8,
396
396
  marginy: 8
397
397
  }).setDefaultEdgeLabel(function() {
398
398
  return {};
399
399
  }), o = t.select("g");
400
- F(o, e.markers, e.type, e.diagramId), Y(), H(), _(), te(), e.nodes.forEach((g) => {
400
+ j(o, e.markers, e.type, e.diagramId), H(), Y(), _(), te(), e.nodes.forEach((g) => {
401
401
  n.setNode(g.id, { ...g }), g.parentId && n.setParent(g.id, g.parentId);
402
402
  }), i.debug("Edges:", e.edges), e.edges.forEach((g) => {
403
403
  if (g.start === g.end) {
404
- const v = g.start, y = v + "---" + v + "---1", X = v + "---" + v + "---2", d = n.node(v);
405
- n.setNode(y, {
406
- domId: y,
407
- id: y,
404
+ const v = g.start, E = v + "---" + v + "---1", y = v + "---" + v + "---2", d = n.node(v);
405
+ n.setNode(E, {
406
+ domId: E,
407
+ id: E,
408
408
  parentId: d.parentId,
409
409
  labelStyle: "",
410
410
  label: "",
@@ -414,9 +414,9 @@ Parent cluster`,
414
414
  style: "",
415
415
  width: 10,
416
416
  height: 10
417
- }), n.setParent(y, d.parentId), n.setNode(X, {
418
- domId: X,
419
- id: X,
417
+ }), n.setParent(E, d.parentId), n.setNode(y, {
418
+ domId: y,
419
+ id: y,
420
420
  parentId: d.parentId,
421
421
  labelStyle: "",
422
422
  padding: 0,
@@ -426,20 +426,20 @@ Parent cluster`,
426
426
  style: "",
427
427
  width: 10,
428
428
  height: 10
429
- }), n.setParent(X, d.parentId);
429
+ }), n.setParent(y, d.parentId);
430
430
  const s = structuredClone(g), w = structuredClone(g), m = structuredClone(g);
431
- s.label = "", s.arrowTypeEnd = "none", s.id = v + "-cyclic-special-1", w.arrowTypeStart = "none", w.arrowTypeEnd = "none", w.id = v + "-cyclic-special-mid", m.label = "", d.isGroup && (s.fromCluster = v, m.toCluster = v), m.id = v + "-cyclic-special-2", m.arrowTypeStart = "none", n.setEdge(v, y, s, v + "-cyclic-special-0"), n.setEdge(y, X, w, v + "-cyclic-special-1"), n.setEdge(X, v, m, v + "-cyc<lic-special-2");
431
+ s.label = "", s.arrowTypeEnd = "none", s.id = v + "-cyclic-special-1", w.arrowTypeStart = "none", w.arrowTypeEnd = "none", w.id = v + "-cyclic-special-mid", m.label = "", d.isGroup && (s.fromCluster = v, m.toCluster = v), m.id = v + "-cyclic-special-2", m.arrowTypeStart = "none", n.setEdge(v, E, s, v + "-cyclic-special-0"), n.setEdge(E, y, w, v + "-cyclic-special-1"), n.setEdge(y, v, m, v + "-cyc<lic-special-2");
432
432
  } else
433
433
  n.setEdge(g.start, g.end, { ...g }, g.id);
434
434
  }), i.warn("Graph at first:", JSON.stringify(p(n))), re(n), i.warn("Graph after XAX:", JSON.stringify(p(n)));
435
- const c = V();
436
- await j(
435
+ const a = V();
436
+ await F(
437
437
  o,
438
438
  n,
439
439
  e.type,
440
440
  e.diagramId,
441
441
  void 0,
442
- c
442
+ a
443
443
  );
444
444
  }, "render");
445
445
  export {
package/dist/index.d.ts CHANGED
@@ -1,15 +1,15 @@
1
1
  import * as React$1 from 'react';
2
- import React__default, { HTMLAttributes, ButtonHTMLAttributes, ReactNode, FC, MouseEvent } from 'react';
2
+ import React__default, { HTMLAttributes, ButtonHTMLAttributes, ReactNode, FC, MouseEvent, Dispatch, ComponentType } from 'react';
3
3
  import { B as ButtonProps, a as Button } from './Button-42Dj_nRE.js';
4
4
  import { Components } from 'react-markdown';
5
5
  import * as react_jsx_runtime from 'react/jsx-runtime';
6
6
  import { PlotParams } from 'react-plotly.js';
7
- import { T as TaskLabels, a as TeamMateContextProps, b as TeamMateState, c as TeamMateConfig, d as TeamMateActionType, e as TeamMateAvailability } from './types-BZH4Xw79.js';
8
- export { i as Citation, f as CoachAiConfirmationResponse, C as CoachAiResponse, g as ContentCategory, L as Learning, P as PersonalizationScope, h as TeamMateComponentProps, l as learningSchema } from './types-BZH4Xw79.js';
7
+ import { C as ChatbotUrls, a as ChatSession, b as ContextOption, T as TaskLabels } from './types-UHJCpYj0.js';
8
+ export { c as Citation } from './types-UHJCpYj0.js';
9
9
  import * as _reduxjs_toolkit from '@reduxjs/toolkit';
10
- import { PayloadAction } from '@reduxjs/toolkit';
11
- import * as immer from 'immer';
10
+ import { UnknownAction, PayloadAction } from '@reduxjs/toolkit';
12
11
  import { z } from 'zod';
12
+ import * as immer from 'immer';
13
13
  import 'class-variance-authority/types';
14
14
  import 'class-variance-authority';
15
15
 
@@ -199,6 +199,101 @@ interface Props$2 {
199
199
  }
200
200
  declare const ConversationGroupProvider: ({ currentUser, conversationGroup, shareId, onSelect, isSelected, users, onResolve, onReplyAdd, source, }: Props$2) => JSX.Element | null;
201
201
 
202
+ interface TeamMateState {
203
+ showCoachingForm: boolean;
204
+ }
205
+ interface TeamMateContextProps {
206
+ state: TeamMateState;
207
+ dispatch: Dispatch<UnknownAction>;
208
+ }
209
+ interface CoachAiResponse {
210
+ ai_response: string;
211
+ category: string;
212
+ personalizationScope: string;
213
+ }
214
+ interface CoachAiConfirmationResponse {
215
+ ok: boolean;
216
+ train_doc_uid: string;
217
+ frontend_url: string;
218
+ }
219
+ declare enum ContentCategory {
220
+ TERM_CLARIFICATION = "TermClarification",
221
+ GENERAL_GUIDELINES = "GeneralGuidelines",
222
+ BUSINESS_EXPLANATION = "BusinessExplanation"
223
+ }
224
+
225
+ declare enum PersonalizationScope {
226
+ USER_SPECIFIC = "UserSpecific",
227
+ ALL_USERS = "AllUsers"
228
+ }
229
+ declare const learningSchema: z.ZodObject<{
230
+ train_doc_uid: z.ZodString;
231
+ userId: z.ZodString;
232
+ display_name: z.ZodString;
233
+ taskLabel: z.ZodString;
234
+ category: z.ZodEnum<[string, ...string[]]>;
235
+ personalizationScope: z.ZodDefault<z.ZodEnum<[string, ...string[]]>>;
236
+ createdDate: z.ZodString;
237
+ updatedDate: z.ZodString;
238
+ content: z.ZodString;
239
+ metadata: z.ZodOptional<z.ZodRecord<z.ZodString, z.ZodUnknown>>;
240
+ isActive: z.ZodDefault<z.ZodBoolean>;
241
+ }, "strip", z.ZodTypeAny, {
242
+ content: string;
243
+ isActive: boolean;
244
+ category: string;
245
+ display_name: string;
246
+ userId: string;
247
+ taskLabel: string;
248
+ train_doc_uid: string;
249
+ personalizationScope: string;
250
+ createdDate: string;
251
+ updatedDate: string;
252
+ metadata?: Record<string, unknown> | undefined;
253
+ }, {
254
+ content: string;
255
+ category: string;
256
+ display_name: string;
257
+ userId: string;
258
+ taskLabel: string;
259
+ train_doc_uid: string;
260
+ createdDate: string;
261
+ updatedDate: string;
262
+ metadata?: Record<string, unknown> | undefined;
263
+ isActive?: boolean | undefined;
264
+ personalizationScope?: string | undefined;
265
+ }>;
266
+ interface Learning extends z.infer<typeof learningSchema> {
267
+ }
268
+ declare enum TeamMateAvailability {
269
+ EXTENSION = "VSCode Extension",
270
+ SAAS = "SaaS"
271
+ }
272
+ interface TeamMateComponentProps<T = void> {
273
+ onClose?: (data?: T) => void;
274
+ frontendUrl?: string;
275
+ urls?: ChatbotUrls;
276
+ requestParams?: RequestInit;
277
+ context?: ChatSession["context"];
278
+ contextOptions?: ContextOption[];
279
+ }
280
+ interface TeamMateConfig<T = unknown> {
281
+ name: string;
282
+ avatar: string;
283
+ description: string;
284
+ availability: TeamMateAvailability[];
285
+ key: TaskLabels;
286
+ seeInAction?: boolean;
287
+ comingSoon?: boolean | (() => boolean);
288
+ displayComponent?: ComponentType<TeamMateComponentProps<T>>;
289
+ formComponent?: ComponentType<TeamMateComponentProps<T>>;
290
+ }
291
+ declare enum TeamMateActionType {
292
+ SEE_IN_ACTION = "SEE_IN_ACTION",
293
+ REQUEST_ACCESS = "REQUEST_ACCESS",
294
+ VIEW_DETAILS = "VIEW_DETAILS"
295
+ }
296
+
202
297
  declare const TeamMateProvider: ({ children }: {
203
298
  children: ReactNode;
204
299
  }) => JSX.Element;
@@ -282,4 +377,4 @@ interface ProjectGovernorCheck extends z.infer<typeof ProjectGovernorCheckSchema
282
377
  id: string;
283
378
  }
284
379
 
285
- export { ApiHelper, CoachForm, CoachFormButton, CodeBlockComponent as CodeBlock, Collapse, type Conversation, type ConversationGroup, ConversationGroupProvider, ConversationInputForm, ConversationSources, DbtDocs, type DbtDocsShareDetails, IconButton, LearningsPage as Learnings, LoadingButton, Markdown, MermaidDiagram, Plotly, Popconfirm, ProjectGovernorAllowedFiles, type ProjectGovernorCheck, type ProjectGovernorCheckConfirmationResponse, type ProjectGovernorCheckFormValues, ProjectGovernorCheckSchema, ProjectGovernorCheckTypes, type ProjectGovernorCheckValidateResponse, Spinner, Stack, Table, TaskLabels, TeamMateActionType, TeamMateAvailability, TeamMateConfig, TeamMateContextProps, TeamMateProvider, TeamMateState, TeamMates, TeamMatesConfig, TeammateActions, useTeamMateContext };
380
+ export { ApiHelper, type CoachAiConfirmationResponse, type CoachAiResponse, CoachForm, CoachFormButton, CodeBlockComponent as CodeBlock, Collapse, ContentCategory, type Conversation, type ConversationGroup, ConversationGroupProvider, ConversationInputForm, ConversationSources, DbtDocs, type DbtDocsShareDetails, IconButton, type Learning, LearningsPage as Learnings, LoadingButton, Markdown, MermaidDiagram, PersonalizationScope, Plotly, Popconfirm, ProjectGovernorAllowedFiles, type ProjectGovernorCheck, type ProjectGovernorCheckConfirmationResponse, type ProjectGovernorCheckFormValues, ProjectGovernorCheckSchema, ProjectGovernorCheckTypes, type ProjectGovernorCheckValidateResponse, Spinner, Stack, Table, TaskLabels, TeamMateActionType, TeamMateAvailability, type TeamMateComponentProps, type TeamMateConfig, type TeamMateContextProps, TeamMateProvider, type TeamMateState, TeamMates, TeamMatesConfig, TeammateActions, learningSchema, useTeamMateContext };
package/dist/index.js CHANGED
@@ -1,17 +1,17 @@
1
- import { bY as e, du as s, ds as r, dE as t, dD as n, dv as d, dC as i, dt as m, dH as c, dI as l, dG as C, dB as p, dF as T, dy as v, dz as u, dA as M, dx as P } from "./CoachForm.js";
1
+ import { dF as e, du as s, ds as r, dE as t, dD as n, dv as d, dC as i, dt as m, dI as c, dJ as l, dH as C, dB as p, dG as T, dy as v, dz as u, dA as M, dx as P } from "./CoachForm.js";
2
2
  import { C as h, T as k } from "./dayjs.min.js";
3
3
  import { A, l as S, I as g } from "./redux-toolkit.modern.js";
4
- import { S as b } from "./Stack.js";
5
- import { j as D, i as F, h as G, C as j, D as I, L, T as w, m as z, l as H, k as E } from "./main.js";
4
+ import { S as B } from "./Stack.js";
5
+ import { j as F, i as G, h as b, C as j, D as I, L, T as w, m as z, l as H, k as E } from "./main.js";
6
6
  export {
7
7
  A as ApiHelper,
8
8
  e as CoachForm,
9
- D as CoachFormButton,
9
+ F as CoachFormButton,
10
10
  S as CodeBlock,
11
11
  h as Collapse,
12
12
  s as ContentCategory,
13
- F as ConversationGroupProvider,
14
- G as ConversationInputForm,
13
+ G as ConversationGroupProvider,
14
+ b as ConversationInputForm,
15
15
  j as ConversationSources,
16
16
  I as DbtDocs,
17
17
  g as IconButton,
@@ -26,7 +26,7 @@ export {
26
26
  l as ProjectGovernorCheckSchema,
27
27
  C as ProjectGovernorCheckTypes,
28
28
  p as Spinner,
29
- b as Stack,
29
+ B as Stack,
30
30
  k as Table,
31
31
  T as TaskLabels,
32
32
  v as TeamMateActionType,
package/dist/index3.js CHANGED
@@ -651,7 +651,7 @@ export {
651
651
  X0 as P,
652
652
  C1 as Q,
653
653
  Q0 as R,
654
- k0 as S,
654
+ S0 as S,
655
655
  p1 as T,
656
656
  v0 as U,
657
657
  g0 as V,
@@ -661,26 +661,26 @@ export {
661
661
  M0 as Z,
662
662
  b0 as _,
663
663
  q0 as a,
664
- S0 as b,
665
- r1 as c,
666
- t1 as d,
667
- l1 as e,
668
- K0 as f,
669
- c1 as g,
670
- F0 as h,
671
- _0 as i,
664
+ r1 as b,
665
+ t1 as c,
666
+ l1 as d,
667
+ K0 as e,
668
+ c1 as f,
669
+ F0 as g,
670
+ _0 as h,
671
+ D0 as i,
672
672
  s as j,
673
- D0 as k,
674
- d1 as l,
675
- x0 as m,
676
- w0 as n,
677
- e1 as o,
678
- i1 as p,
679
- U0 as q,
680
- j0 as r,
681
- R0 as s,
682
- I0 as t,
683
- Z0 as u,
673
+ d1 as k,
674
+ x0 as l,
675
+ w0 as m,
676
+ e1 as n,
677
+ i1 as o,
678
+ U0 as p,
679
+ j0 as q,
680
+ R0 as r,
681
+ I0 as s,
682
+ Z0 as t,
683
+ k0 as u,
684
684
  O0 as v,
685
685
  A0 as w,
686
686
  T0 as x,