hub-ui-x 0.0.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.
Files changed (65) hide show
  1. package/README.md +5 -0
  2. package/dist/_basePickBy-C1WsytTM.js +151 -0
  3. package/dist/_baseUniq-CGQBVjq6.js +614 -0
  4. package/dist/arc-CfWEFjh8.js +84 -0
  5. package/dist/architecture-4AB2E3PP-DcT_AgQk.js +5 -0
  6. package/dist/architectureDiagram-IEHRJDOE-HOxolPJX.js +4635 -0
  7. package/dist/blockDiagram-JOT3LUYC-DOUpbN2x.js +2248 -0
  8. package/dist/c4Diagram-VJAJSXHY-BFAcC0i5.js +1582 -0
  9. package/dist/channel-Cu0z2gst.js +5 -0
  10. package/dist/chart-CJ_SRNKN.js +9241 -0
  11. package/dist/chunk-4BMEZGHF-BBaiA8MA.js +9 -0
  12. package/dist/chunk-A2AXSNBT-BWpKSYi4.js +1373 -0
  13. package/dist/chunk-AEK57VVT-doTsaHuQ.js +1415 -0
  14. package/dist/chunk-D6G4REZN-B6Iq6yid.js +64 -0
  15. package/dist/chunk-RZ5BOZE2-OspkSZtw.js +25 -0
  16. package/dist/chunk-XZIHB7SX-BTYIr8g5.js +15 -0
  17. package/dist/classDiagram-GIVACNV2-B_ES2mS7.js +17 -0
  18. package/dist/classDiagram-v2-COTLJTTW-B_ES2mS7.js +17 -0
  19. package/dist/clone-BZBtMp_G.js +8 -0
  20. package/dist/colors-BD7LS4qt.js +7 -0
  21. package/dist/cytoscape.esm-Swd9B-1A.js +18633 -0
  22. package/dist/dagre-OKDRZEBW-qXmKnSET.js +447 -0
  23. package/dist/diagram-SSKATNLV-D9zp03W0.js +221 -0
  24. package/dist/diagram-VNBRO52H-CBXg8AYQ.js +126 -0
  25. package/dist/download-B6Cbg_6N.js +39 -0
  26. package/dist/echarts-CvKQD1G1.js +44028 -0
  27. package/dist/erDiagram-Q7BY3M3F-BOJJGO7u.js +842 -0
  28. package/dist/flowDiagram-4HSFHLVR-jSArwKHg.js +1623 -0
  29. package/dist/ganttDiagram-APWFNJXF-DlkSU7D9.js +2472 -0
  30. package/dist/gitGraph-O2Q2CXLX-BKCeQqs8.js +5 -0
  31. package/dist/gitGraphDiagram-7IBYFJ6S-DUvZEq_S.js +713 -0
  32. package/dist/graph-zFu0gYaZ.js +247 -0
  33. package/dist/helper-C5NlRbA2.js +13 -0
  34. package/dist/hub-ui-x.css +1 -0
  35. package/dist/hub-ui-x.es.ts +5 -0
  36. package/dist/hub-ui-x.umd.ts +3258 -0
  37. package/dist/index-evjDGH2n.js +62533 -0
  38. package/dist/info-4N47QTOZ-BYDGL7Ae.js +5 -0
  39. package/dist/infoDiagram-PH2N3AL5-DJvDYk-t.js +22 -0
  40. package/dist/init-DjUOC4st.js +16 -0
  41. package/dist/journeyDiagram-U35MCT3I---dClVe4.js +810 -0
  42. package/dist/kanban-definition-NDS4AKOZ-DPL_aBPT.js +719 -0
  43. package/dist/katex-9tX9hjoM.js +11692 -0
  44. package/dist/layout-BqSq5ofg.js +1324 -0
  45. package/dist/linear-fJjgKrP9.js +423 -0
  46. package/dist/mermaid-CZvYCPmi.js +14243 -0
  47. package/dist/mermaid-parser.core-Bz7ADZ88.js +12835 -0
  48. package/dist/min-DLf0xQMm.js +28 -0
  49. package/dist/mindmap-definition-ALO5MXBD-CzxIzyQv.js +3222 -0
  50. package/dist/mindmap-r94UHoYv.js +21909 -0
  51. package/dist/ordinal-DfAQgscy.js +61 -0
  52. package/dist/packet-KVYON367-D4di2cz5.js +5 -0
  53. package/dist/pie-R6RNRRYF-CcxAsT3F.js +5 -0
  54. package/dist/pieDiagram-IB7DONF6-B5HBkGlO.js +162 -0
  55. package/dist/quadrantDiagram-7GDLP6J5-BS5bmqKW.js +1025 -0
  56. package/dist/radar-MK3ICKWK-CVYy5goT.js +5 -0
  57. package/dist/requirementDiagram-KVF5MWMF-Cr8GcN4Y.js +851 -0
  58. package/dist/sankeyDiagram-QLVOVGJD-Bhq9k8_q.js +806 -0
  59. package/dist/sequenceDiagram-X6HHIX6F-CCmFoYyv.js +2282 -0
  60. package/dist/stateDiagram-DGXRK772-JkIqKyGq.js +271 -0
  61. package/dist/stateDiagram-v2-YXO3MK2T-DMxAxUZ1.js +17 -0
  62. package/dist/timeline-definition-BDJGKUSR-Bi42udQn.js +805 -0
  63. package/dist/transform-Bsa6BTXX.js +1834 -0
  64. package/dist/xychartDiagram-VJFVF3MP-BI97ppBM.js +1305 -0
  65. package/package.json +55 -0
@@ -0,0 +1,247 @@
1
+ import { aw as N, ax as j, ay as f, az as b, aA as E } from "./mermaid-CZvYCPmi.js";
2
+ import { a as v, c as P, k as _, f as g, d, i as l, v as p, r as w } from "./_baseUniq-CGQBVjq6.js";
3
+ var D = 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 D(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 w(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
+ };
@@ -0,0 +1,13 @@
1
+ function i(t, n) {
2
+ const e = (c) => {
3
+ t.contains(c.target) || n();
4
+ };
5
+ return document.addEventListener("click", e, !0), {
6
+ destroy() {
7
+ document.removeEventListener("click", e, !0);
8
+ }
9
+ };
10
+ }
11
+ export {
12
+ i as o
13
+ };