@altimateai/ui-components 0.0.58 → 0.0.59
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.
- package/dist/CoachForm.js +23701 -37056
- package/dist/Stack.js +6 -6
- package/dist/Switch.js +1 -1
- package/dist/TagsInput.js +1 -1
- package/dist/_basePickBy.js +151 -0
- package/dist/_baseUniq.js +615 -0
- package/dist/arc.js +83 -0
- package/dist/architecture-U656AL7Q.js +5 -0
- package/dist/architectureDiagram-VXUJARFQ.js +4666 -0
- package/dist/blockDiagram-VD42YOAC.js +2266 -0
- package/dist/c4Diagram-YG6GDRKO.js +1582 -0
- package/dist/channel.js +5 -0
- package/dist/chunk-4BX2VUAB.js +9 -0
- package/dist/chunk-55IACEB6.js +9 -0
- package/dist/chunk-B4BG7PRW.js +1377 -0
- package/dist/chunk-DI55MBZ5.js +1382 -0
- package/dist/chunk-FMBD7UC4.js +19 -0
- package/dist/chunk-QN33PNHL.js +20 -0
- package/dist/chunk-QZHKN3VN.js +15 -0
- package/dist/chunk-TZMSLE5B.js +64 -0
- package/dist/classDiagram-2ON5EDUG.js +17 -0
- package/dist/classDiagram-v2-WZHVMYZB.js +17 -0
- package/dist/clone.js +8 -0
- package/dist/cose-bilkent-S5V4N54A.js +2606 -0
- package/dist/cytoscape.esm.js +18731 -0
- package/dist/dagre-6UL2VRFP.js +447 -0
- package/dist/dayjs.min.js +302 -0
- package/dist/defaultLocale.js +171 -0
- package/dist/diagram-PSM6KHXK.js +535 -0
- package/dist/diagram-QEK2KX5R.js +221 -0
- package/dist/diagram-S2PKOQOG.js +143 -0
- package/dist/erDiagram-Q2GNP2WA.js +843 -0
- package/dist/flowDiagram-NV44I4VS.js +1628 -0
- package/dist/ganttDiagram-LVOFAZNH.js +2500 -0
- package/dist/gitGraph-F6HP7TQM.js +5 -0
- package/dist/gitGraphDiagram-NY62KEGX.js +713 -0
- package/dist/graph.js +247 -0
- package/dist/index.js +30 -30
- package/dist/info-NVLQJR56.js +5 -0
- package/dist/infoDiagram-F6ZHWCRC.js +24 -0
- package/dist/init.js +16 -0
- package/dist/journeyDiagram-XKPGCS4Q.js +837 -0
- package/dist/kanban-definition-3W4ZIXB7.js +720 -0
- package/dist/katex.js +11691 -0
- package/dist/layout.js +1324 -0
- package/dist/lineage/index.js +12 -12
- package/dist/linear.js +259 -0
- package/dist/main.js +3 -3
- package/dist/mermaid-parser.core.js +12921 -0
- package/dist/mindmap-definition-VGOIOE7T.js +786 -0
- package/dist/ordinal.js +61 -0
- package/dist/packet-BFZMPI3H.js +5 -0
- package/dist/pie-7BOR55EZ.js +5 -0
- package/dist/pieDiagram-ADFJNKIX.js +163 -0
- package/dist/quadrantDiagram-AYHSOK5B.js +1025 -0
- package/dist/radar-NHE76QYJ.js +5 -0
- package/dist/redux-toolkit.modern.js +1138 -1420
- package/dist/requirementDiagram-UZGBJVZJ.js +852 -0
- package/dist/sankeyDiagram-TZEHDZUN.js +811 -0
- package/dist/sequenceDiagram-WL72ISMW.js +2523 -0
- package/dist/shadcn/index.js +1 -1
- package/dist/stateDiagram-FKZM4ZOC.js +264 -0
- package/dist/stateDiagram-v2-4FDKWEC3.js +17 -0
- package/dist/timeline-definition-IT6M3QCI.js +802 -0
- package/dist/treemap-KMMF4GRG.js +5 -0
- package/dist/xychartDiagram-PRI3JC2R.js +1341 -0
- package/package.json +1 -1
- package/dist/Table.js +0 -22
- package/dist/flowchart-elk-definition-170a3958.js +0 -46393
- package/dist/is_dark.js +0 -8
- package/dist/mindmap-definition-44684416.js +0 -20514
- package/dist/timeline-definition-8e5a9bc6.js +0 -825
package/dist/graph.js
ADDED
|
@@ -0,0 +1,247 @@
|
|
|
1
|
+
import { bn as N, bo as j, bp as f, bq as b, br as E } from "./CoachForm.js";
|
|
2
|
+
import { a as v, c as P, k as _, f as g, d, i as l, v as p, r as D } from "./_baseUniq.js";
|
|
3
|
+
var w = N(function(o) {
|
|
4
|
+
return v(P(o, 1, j, !0));
|
|
5
|
+
}), F = "\0", a = "\0", O = "";
|
|
6
|
+
class L {
|
|
7
|
+
constructor(e = {}) {
|
|
8
|
+
this._isDirected = Object.prototype.hasOwnProperty.call(e, "directed") ? e.directed : !0, this._isMultigraph = Object.prototype.hasOwnProperty.call(e, "multigraph") ? e.multigraph : !1, this._isCompound = Object.prototype.hasOwnProperty.call(e, "compound") ? e.compound : !1, this._label = void 0, this._defaultNodeLabelFn = f(void 0), this._defaultEdgeLabelFn = f(void 0), this._nodes = {}, this._isCompound && (this._parent = {}, this._children = {}, this._children[a] = {}), this._in = {}, this._preds = {}, this._out = {}, this._sucs = {}, this._edgeObjs = {}, this._edgeLabels = {};
|
|
9
|
+
}
|
|
10
|
+
/* === Graph functions ========= */
|
|
11
|
+
isDirected() {
|
|
12
|
+
return this._isDirected;
|
|
13
|
+
}
|
|
14
|
+
isMultigraph() {
|
|
15
|
+
return this._isMultigraph;
|
|
16
|
+
}
|
|
17
|
+
isCompound() {
|
|
18
|
+
return this._isCompound;
|
|
19
|
+
}
|
|
20
|
+
setGraph(e) {
|
|
21
|
+
return this._label = e, this;
|
|
22
|
+
}
|
|
23
|
+
graph() {
|
|
24
|
+
return this._label;
|
|
25
|
+
}
|
|
26
|
+
/* === Node functions ========== */
|
|
27
|
+
setDefaultNodeLabel(e) {
|
|
28
|
+
return b(e) || (e = f(e)), this._defaultNodeLabelFn = e, this;
|
|
29
|
+
}
|
|
30
|
+
nodeCount() {
|
|
31
|
+
return this._nodeCount;
|
|
32
|
+
}
|
|
33
|
+
nodes() {
|
|
34
|
+
return _(this._nodes);
|
|
35
|
+
}
|
|
36
|
+
sources() {
|
|
37
|
+
var e = this;
|
|
38
|
+
return g(this.nodes(), function(t) {
|
|
39
|
+
return E(e._in[t]);
|
|
40
|
+
});
|
|
41
|
+
}
|
|
42
|
+
sinks() {
|
|
43
|
+
var e = this;
|
|
44
|
+
return g(this.nodes(), function(t) {
|
|
45
|
+
return E(e._out[t]);
|
|
46
|
+
});
|
|
47
|
+
}
|
|
48
|
+
setNodes(e, t) {
|
|
49
|
+
var s = arguments, i = this;
|
|
50
|
+
return d(e, function(r) {
|
|
51
|
+
s.length > 1 ? i.setNode(r, t) : i.setNode(r);
|
|
52
|
+
}), this;
|
|
53
|
+
}
|
|
54
|
+
setNode(e, t) {
|
|
55
|
+
return Object.prototype.hasOwnProperty.call(this._nodes, e) ? (arguments.length > 1 && (this._nodes[e] = t), this) : (this._nodes[e] = arguments.length > 1 ? t : this._defaultNodeLabelFn(e), this._isCompound && (this._parent[e] = a, this._children[e] = {}, this._children[a][e] = !0), this._in[e] = {}, this._preds[e] = {}, this._out[e] = {}, this._sucs[e] = {}, ++this._nodeCount, this);
|
|
56
|
+
}
|
|
57
|
+
node(e) {
|
|
58
|
+
return this._nodes[e];
|
|
59
|
+
}
|
|
60
|
+
hasNode(e) {
|
|
61
|
+
return Object.prototype.hasOwnProperty.call(this._nodes, e);
|
|
62
|
+
}
|
|
63
|
+
removeNode(e) {
|
|
64
|
+
if (Object.prototype.hasOwnProperty.call(this._nodes, e)) {
|
|
65
|
+
var t = (s) => this.removeEdge(this._edgeObjs[s]);
|
|
66
|
+
delete this._nodes[e], this._isCompound && (this._removeFromParentsChildList(e), delete this._parent[e], d(this.children(e), (s) => {
|
|
67
|
+
this.setParent(s);
|
|
68
|
+
}), delete this._children[e]), d(_(this._in[e]), t), delete this._in[e], delete this._preds[e], d(_(this._out[e]), t), delete this._out[e], delete this._sucs[e], --this._nodeCount;
|
|
69
|
+
}
|
|
70
|
+
return this;
|
|
71
|
+
}
|
|
72
|
+
setParent(e, t) {
|
|
73
|
+
if (!this._isCompound)
|
|
74
|
+
throw new Error("Cannot set parent in a non-compound graph");
|
|
75
|
+
if (l(t))
|
|
76
|
+
t = a;
|
|
77
|
+
else {
|
|
78
|
+
t += "";
|
|
79
|
+
for (var s = t; !l(s); s = this.parent(s))
|
|
80
|
+
if (s === e)
|
|
81
|
+
throw new Error("Setting " + t + " as parent of " + e + " would create a cycle");
|
|
82
|
+
this.setNode(t);
|
|
83
|
+
}
|
|
84
|
+
return this.setNode(e), this._removeFromParentsChildList(e), this._parent[e] = t, this._children[t][e] = !0, this;
|
|
85
|
+
}
|
|
86
|
+
_removeFromParentsChildList(e) {
|
|
87
|
+
delete this._children[this._parent[e]][e];
|
|
88
|
+
}
|
|
89
|
+
parent(e) {
|
|
90
|
+
if (this._isCompound) {
|
|
91
|
+
var t = this._parent[e];
|
|
92
|
+
if (t !== a)
|
|
93
|
+
return t;
|
|
94
|
+
}
|
|
95
|
+
}
|
|
96
|
+
children(e) {
|
|
97
|
+
if (l(e) && (e = a), this._isCompound) {
|
|
98
|
+
var t = this._children[e];
|
|
99
|
+
if (t)
|
|
100
|
+
return _(t);
|
|
101
|
+
} else {
|
|
102
|
+
if (e === a)
|
|
103
|
+
return this.nodes();
|
|
104
|
+
if (this.hasNode(e))
|
|
105
|
+
return [];
|
|
106
|
+
}
|
|
107
|
+
}
|
|
108
|
+
predecessors(e) {
|
|
109
|
+
var t = this._preds[e];
|
|
110
|
+
if (t)
|
|
111
|
+
return _(t);
|
|
112
|
+
}
|
|
113
|
+
successors(e) {
|
|
114
|
+
var t = this._sucs[e];
|
|
115
|
+
if (t)
|
|
116
|
+
return _(t);
|
|
117
|
+
}
|
|
118
|
+
neighbors(e) {
|
|
119
|
+
var t = this.predecessors(e);
|
|
120
|
+
if (t)
|
|
121
|
+
return w(t, this.successors(e));
|
|
122
|
+
}
|
|
123
|
+
isLeaf(e) {
|
|
124
|
+
var t;
|
|
125
|
+
return this.isDirected() ? t = this.successors(e) : t = this.neighbors(e), t.length === 0;
|
|
126
|
+
}
|
|
127
|
+
filterNodes(e) {
|
|
128
|
+
var t = new this.constructor({
|
|
129
|
+
directed: this._isDirected,
|
|
130
|
+
multigraph: this._isMultigraph,
|
|
131
|
+
compound: this._isCompound
|
|
132
|
+
});
|
|
133
|
+
t.setGraph(this.graph());
|
|
134
|
+
var s = this;
|
|
135
|
+
d(this._nodes, function(n, h) {
|
|
136
|
+
e(h) && t.setNode(h, n);
|
|
137
|
+
}), d(this._edgeObjs, function(n) {
|
|
138
|
+
t.hasNode(n.v) && t.hasNode(n.w) && t.setEdge(n, s.edge(n));
|
|
139
|
+
});
|
|
140
|
+
var i = {};
|
|
141
|
+
function r(n) {
|
|
142
|
+
var h = s.parent(n);
|
|
143
|
+
return h === void 0 || t.hasNode(h) ? (i[n] = h, h) : h in i ? i[h] : r(h);
|
|
144
|
+
}
|
|
145
|
+
return this._isCompound && d(t.nodes(), function(n) {
|
|
146
|
+
t.setParent(n, r(n));
|
|
147
|
+
}), t;
|
|
148
|
+
}
|
|
149
|
+
/* === Edge functions ========== */
|
|
150
|
+
setDefaultEdgeLabel(e) {
|
|
151
|
+
return b(e) || (e = f(e)), this._defaultEdgeLabelFn = e, this;
|
|
152
|
+
}
|
|
153
|
+
edgeCount() {
|
|
154
|
+
return this._edgeCount;
|
|
155
|
+
}
|
|
156
|
+
edges() {
|
|
157
|
+
return p(this._edgeObjs);
|
|
158
|
+
}
|
|
159
|
+
setPath(e, t) {
|
|
160
|
+
var s = this, i = arguments;
|
|
161
|
+
return D(e, function(r, n) {
|
|
162
|
+
return i.length > 1 ? s.setEdge(r, n, t) : s.setEdge(r, n), n;
|
|
163
|
+
}), this;
|
|
164
|
+
}
|
|
165
|
+
/*
|
|
166
|
+
* setEdge(v, w, [value, [name]])
|
|
167
|
+
* setEdge({ v, w, [name] }, [value])
|
|
168
|
+
*/
|
|
169
|
+
setEdge() {
|
|
170
|
+
var e, t, s, i, r = !1, n = arguments[0];
|
|
171
|
+
typeof n == "object" && n !== null && "v" in n ? (e = n.v, t = n.w, s = n.name, arguments.length === 2 && (i = arguments[1], r = !0)) : (e = n, t = arguments[1], s = arguments[3], arguments.length > 2 && (i = arguments[2], r = !0)), e = "" + e, t = "" + t, l(s) || (s = "" + s);
|
|
172
|
+
var h = c(this._isDirected, e, t, s);
|
|
173
|
+
if (Object.prototype.hasOwnProperty.call(this._edgeLabels, h))
|
|
174
|
+
return r && (this._edgeLabels[h] = i), this;
|
|
175
|
+
if (!l(s) && !this._isMultigraph)
|
|
176
|
+
throw new Error("Cannot set a named edge when isMultigraph = false");
|
|
177
|
+
this.setNode(e), this.setNode(t), this._edgeLabels[h] = r ? i : this._defaultEdgeLabelFn(e, t, s);
|
|
178
|
+
var u = M(this._isDirected, e, t, s);
|
|
179
|
+
return e = u.v, t = u.w, Object.freeze(u), this._edgeObjs[h] = u, y(this._preds[t], e), y(this._sucs[e], t), this._in[t][h] = u, this._out[e][h] = u, this._edgeCount++, this;
|
|
180
|
+
}
|
|
181
|
+
edge(e, t, s) {
|
|
182
|
+
var i = arguments.length === 1 ? m(this._isDirected, arguments[0]) : c(this._isDirected, e, t, s);
|
|
183
|
+
return this._edgeLabels[i];
|
|
184
|
+
}
|
|
185
|
+
hasEdge(e, t, s) {
|
|
186
|
+
var i = arguments.length === 1 ? m(this._isDirected, arguments[0]) : c(this._isDirected, e, t, s);
|
|
187
|
+
return Object.prototype.hasOwnProperty.call(this._edgeLabels, i);
|
|
188
|
+
}
|
|
189
|
+
removeEdge(e, t, s) {
|
|
190
|
+
var i = arguments.length === 1 ? m(this._isDirected, arguments[0]) : c(this._isDirected, e, t, s), r = this._edgeObjs[i];
|
|
191
|
+
return r && (e = r.v, t = r.w, delete this._edgeLabels[i], delete this._edgeObjs[i], C(this._preds[t], e), C(this._sucs[e], t), delete this._in[t][i], delete this._out[e][i], this._edgeCount--), this;
|
|
192
|
+
}
|
|
193
|
+
inEdges(e, t) {
|
|
194
|
+
var s = this._in[e];
|
|
195
|
+
if (s) {
|
|
196
|
+
var i = p(s);
|
|
197
|
+
return t ? g(i, function(r) {
|
|
198
|
+
return r.v === t;
|
|
199
|
+
}) : i;
|
|
200
|
+
}
|
|
201
|
+
}
|
|
202
|
+
outEdges(e, t) {
|
|
203
|
+
var s = this._out[e];
|
|
204
|
+
if (s) {
|
|
205
|
+
var i = p(s);
|
|
206
|
+
return t ? g(i, function(r) {
|
|
207
|
+
return r.w === t;
|
|
208
|
+
}) : i;
|
|
209
|
+
}
|
|
210
|
+
}
|
|
211
|
+
nodeEdges(e, t) {
|
|
212
|
+
var s = this.inEdges(e, t);
|
|
213
|
+
if (s)
|
|
214
|
+
return s.concat(this.outEdges(e, t));
|
|
215
|
+
}
|
|
216
|
+
}
|
|
217
|
+
L.prototype._nodeCount = 0;
|
|
218
|
+
L.prototype._edgeCount = 0;
|
|
219
|
+
function y(o, e) {
|
|
220
|
+
o[e] ? o[e]++ : o[e] = 1;
|
|
221
|
+
}
|
|
222
|
+
function C(o, e) {
|
|
223
|
+
--o[e] || delete o[e];
|
|
224
|
+
}
|
|
225
|
+
function c(o, e, t, s) {
|
|
226
|
+
var i = "" + e, r = "" + t;
|
|
227
|
+
if (!o && i > r) {
|
|
228
|
+
var n = i;
|
|
229
|
+
i = r, r = n;
|
|
230
|
+
}
|
|
231
|
+
return i + O + r + O + (l(s) ? F : s);
|
|
232
|
+
}
|
|
233
|
+
function M(o, e, t, s) {
|
|
234
|
+
var i = "" + e, r = "" + t;
|
|
235
|
+
if (!o && i > r) {
|
|
236
|
+
var n = i;
|
|
237
|
+
i = r, r = n;
|
|
238
|
+
}
|
|
239
|
+
var h = { v: i, w: r };
|
|
240
|
+
return s && (h.name = s), h;
|
|
241
|
+
}
|
|
242
|
+
function m(o, e) {
|
|
243
|
+
return c(o, e.v, e.w, e.name);
|
|
244
|
+
}
|
|
245
|
+
export {
|
|
246
|
+
L as G
|
|
247
|
+
};
|
package/dist/index.js
CHANGED
|
@@ -1,40 +1,40 @@
|
|
|
1
|
-
import { j as e, i as s, h as r, C as t, D as
|
|
2
|
-
import { C as T, T as v } from "./
|
|
3
|
-
import {
|
|
4
|
-
import { A as
|
|
5
|
-
import { a6 as
|
|
1
|
+
import { j as e, i as s, h as r, C as t, D as c, L as n, T as i, m, l, k as p } from "./main.js";
|
|
2
|
+
import { C as T, T as v } from "./dayjs.min.js";
|
|
3
|
+
import { co as h, cd as k, cb as M, cn as P, cm as f, ce as g, cl as u, cc as x, cr as A, cs as S, cq as b, ck as j, cp as y, ch as B, ci as D, cj as F, cg as G } from "./CoachForm.js";
|
|
4
|
+
import { A as I, l as w, I as q } from "./redux-toolkit.modern.js";
|
|
5
|
+
import { a6 as H } from "./Stack.js";
|
|
6
6
|
export {
|
|
7
|
-
|
|
8
|
-
|
|
7
|
+
I as ApiHelper,
|
|
8
|
+
h as CoachForm,
|
|
9
9
|
e as CoachFormButton,
|
|
10
|
-
|
|
10
|
+
w as CodeBlock,
|
|
11
11
|
T as Collapse,
|
|
12
|
-
|
|
12
|
+
k as ContentCategory,
|
|
13
13
|
s as ConversationGroupProvider,
|
|
14
14
|
r as ConversationInputForm,
|
|
15
15
|
t as ConversationSources,
|
|
16
|
-
|
|
17
|
-
|
|
18
|
-
|
|
19
|
-
|
|
20
|
-
|
|
21
|
-
|
|
22
|
-
|
|
23
|
-
|
|
24
|
-
|
|
25
|
-
|
|
26
|
-
|
|
27
|
-
|
|
28
|
-
|
|
29
|
-
|
|
16
|
+
c as DbtDocs,
|
|
17
|
+
q as IconButton,
|
|
18
|
+
n as Learnings,
|
|
19
|
+
M as LoadingButton,
|
|
20
|
+
P as Markdown,
|
|
21
|
+
f as MermaidDiagram,
|
|
22
|
+
g as PersonalizationScope,
|
|
23
|
+
u as Plotly,
|
|
24
|
+
x as Popconfirm,
|
|
25
|
+
A as ProjectGovernorAllowedFiles,
|
|
26
|
+
S as ProjectGovernorCheckSchema,
|
|
27
|
+
b as ProjectGovernorCheckTypes,
|
|
28
|
+
j as Spinner,
|
|
29
|
+
H as Stack,
|
|
30
30
|
v as Table,
|
|
31
|
-
|
|
32
|
-
|
|
33
|
-
|
|
34
|
-
|
|
35
|
-
|
|
31
|
+
y as TaskLabels,
|
|
32
|
+
B as TeamMateActionType,
|
|
33
|
+
D as TeamMateAvailability,
|
|
34
|
+
i as TeamMateProvider,
|
|
35
|
+
m as TeamMates,
|
|
36
36
|
F as TeamMatesConfig,
|
|
37
|
-
|
|
37
|
+
l as TeammateActions,
|
|
38
38
|
G as learningSchema,
|
|
39
|
-
|
|
39
|
+
p as useTeamMateContext
|
|
40
40
|
};
|
|
@@ -0,0 +1,24 @@
|
|
|
1
|
+
import { _ as e, aa as s, aw as o, ab as i, ax as g } from "./CoachForm.js";
|
|
2
|
+
import { p } from "./mermaid-parser.core.js";
|
|
3
|
+
var v = {
|
|
4
|
+
parse: /* @__PURE__ */ e(async (a) => {
|
|
5
|
+
const r = await p("info", a);
|
|
6
|
+
s.debug(r);
|
|
7
|
+
}, "parse")
|
|
8
|
+
}, d = {
|
|
9
|
+
version: g.version + ""
|
|
10
|
+
}, c = /* @__PURE__ */ e(() => d.version, "getVersion"), m = {
|
|
11
|
+
getVersion: c
|
|
12
|
+
}, f = /* @__PURE__ */ e((a, r, n) => {
|
|
13
|
+
s.debug(`rendering info diagram
|
|
14
|
+
` + a);
|
|
15
|
+
const t = o(r);
|
|
16
|
+
i(t, 100, 400, !0), t.append("g").append("text").attr("x", 100).attr("y", 40).attr("class", "version").attr("font-size", 32).style("text-anchor", "middle").text(`v${n}`);
|
|
17
|
+
}, "draw"), l = { draw: f }, b = {
|
|
18
|
+
parser: v,
|
|
19
|
+
db: m,
|
|
20
|
+
renderer: l
|
|
21
|
+
};
|
|
22
|
+
export {
|
|
23
|
+
b as diagram
|
|
24
|
+
};
|