@aiderdesk/aiderdesk 0.62.0 → 0.66.0

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/out/cli.js +1 -0
  2. package/out/{open-telemetry-CcefKvbB.js → open-telemetry-baOvr6sK.js} +1 -1
  3. package/out/renderer/assets/{arc-TuVjX2tH.js → arc-BXuUWHai.js} +1 -1
  4. package/out/renderer/assets/{architectureDiagram-Q4EWVU46-CnAcyRvO.js → architectureDiagram-3BPJPVTR-Bm9oFTP_.js} +11 -9
  5. package/out/renderer/assets/{blockDiagram-DXYQGD6D-DBoJhGAM.js → blockDiagram-GPEHLZMM-DQ2DevZl.js} +218 -30
  6. package/out/renderer/assets/{c4Diagram-AHTNJAMY-BzW0gKwX.js → c4Diagram-AAUBKEIU-BdR46VbA.js} +2 -2
  7. package/out/renderer/assets/{channel-CqR4FAVX.js → channel-DUdp1NJ7.js} +1 -1
  8. package/out/renderer/assets/{chunk-EDXVE4YY-DRk838hn.js → chunk-2J33WTMH-Dzi-idRV.js} +1 -1
  9. package/out/renderer/assets/{chunk-4BX2VUAB-DQjg_Naa.js → chunk-4BX2VUAB-DEyFpixF.js} +1 -1
  10. package/out/renderer/assets/{chunk-55IACEB6-pFPEMTmI.js → chunk-55IACEB6-DyyQMIZa.js} +1 -1
  11. package/out/renderer/assets/{chunk-4TB4RGXK-DkcI1yaW.js → chunk-727SXJPM-vXEiesCP.js} +245 -149
  12. package/out/renderer/assets/{chunk-OYMX7WX6-DOGJ-XHp.js → chunk-AQP2D5EJ-B0SWmbrS.js} +92 -78
  13. package/out/renderer/assets/{chunk-FMBD7UC4-BagQdd5u.js → chunk-FMBD7UC4-CoPwvBCa.js} +1 -1
  14. package/out/renderer/assets/{chunk-YZCP3GAM-BKZRTlUj.js → chunk-ND2GUHAM-ku5t5SwP.js} +1 -1
  15. package/out/renderer/assets/{chunk-QZHKN3VN-CdzjbbBk.js → chunk-QZHKN3VN-DBGBAqit.js} +1 -1
  16. package/out/renderer/assets/{classDiagram-6PBFFD2Q-CjVhmlxb.js → classDiagram-4FO5ZUOK-DTyjsHX9.js} +6 -6
  17. package/out/renderer/assets/{classDiagram-v2-HSJHXN6E-CjVhmlxb.js → classDiagram-v2-Q7XG4LA2-DTyjsHX9.js} +6 -6
  18. package/out/renderer/assets/{cose-bilkent-S5V4N54A-CZLRecVB.js → cose-bilkent-S5V4N54A-wGfE9wIx.js} +1 -1
  19. package/out/renderer/assets/{dagre-KV5264BT-BUAzC7Um.js → dagre-BM42HDAG-cwyj1-l0.js} +17 -6
  20. package/out/renderer/assets/{diagram-MMDJMWI5-B5H49OVD.js → diagram-2AECGRRQ-BYvCxkOs.js} +3 -5
  21. package/out/renderer/assets/{diagram-5BDNPKRD-DNQEDszc.js → diagram-5GNKFQAL--ZlqvgmY.js} +4 -6
  22. package/out/renderer/assets/diagram-KO2AKTUF-CoPNrPhx.js +632 -0
  23. package/out/renderer/assets/{diagram-TYMM5635-Bw7r467p.js → diagram-LMA3HP47-wjhxYTWf.js} +3 -5
  24. package/out/renderer/assets/{diagram-G4DWMVQ6-D9YY6W2O.js → diagram-OG6HWLK6-DhYpewbd.js} +4 -6
  25. package/out/renderer/assets/{erDiagram-SMLLAGMA-Bz4ALNLp.js → erDiagram-TEJ5UH35-DolRLBng.js} +4 -4
  26. package/out/renderer/assets/{flowDiagram-DWJPFMVM-Uqg1ZeN2.js → flowDiagram-I6XJVG4X-DjAbl_XC.js} +6 -6
  27. package/out/renderer/assets/{ganttDiagram-T4ZO3ILL-Dm0tRLCH.js → ganttDiagram-6RSMTGT7-AF7-XgtX.js} +7 -1
  28. package/out/renderer/assets/{gitGraphDiagram-UUTBAWPF-R8imfIrj.js → gitGraphDiagram-PVQCEYII-BMZLakzH.js} +4 -6
  29. package/out/renderer/assets/{graph-B5YWEnt0.js → graph-B_ifajWk.js} +490 -135
  30. package/out/renderer/assets/{index-D7Xi0GX5.js → index-3bI-dJm8.js} +12818 -8179
  31. package/out/renderer/assets/{index-B6Zj03wk.css → index-B62bIfbt.css} +234 -11
  32. package/out/renderer/assets/{infoDiagram-42DDH7IO-CWPYNP1k.js → infoDiagram-5YYISTIA-0f7Qxxvp.js} +3 -5
  33. package/out/renderer/assets/{ishikawaDiagram-UXIWVN3A-CFTrc-S6.js → ishikawaDiagram-YF4QCWOH-BX_EIAMn.js} +1 -1
  34. package/out/renderer/assets/{journeyDiagram-VCZTEJTY-Dfd-piIf.js → journeyDiagram-JHISSGLW-Dmitv8wD.js} +4 -4
  35. package/out/renderer/assets/{kanban-definition-6JOO6SKY-BocrfAtb.js → kanban-definition-UN3LZRKU-By2GFUNB.js} +2 -2
  36. package/out/renderer/assets/{layout-DHzrXVin.js → layout-DAkKffy1.js} +459 -32
  37. package/out/renderer/assets/{mindmap-definition-QFDTVHPH-D9cyK1Gb.js → mindmap-definition-RKZ34NQL-yIrV1m0y.js} +3 -3
  38. package/out/renderer/assets/{pieDiagram-DEJITSTG-LUWwVJA5.js → pieDiagram-4H26LBE5-PV9y5rw_.js} +4 -6
  39. package/out/renderer/assets/{quadrantDiagram-34T5L4WZ-DdWTi9yW.js → quadrantDiagram-W4KKPZXB-DeX0zTCp.js} +22 -20
  40. package/out/renderer/assets/{requirementDiagram-MS252O5E-BoLT3tay.js → requirementDiagram-4Y6WPE33-Bzfk_KE-.js} +3 -3
  41. package/out/renderer/assets/{sankeyDiagram-XADWPNL6-B4gY_QI-.js → sankeyDiagram-5OEKKPKP-BuCv8QIY.js} +80 -11
  42. package/out/renderer/assets/{sequenceDiagram-FGHM5R23-B-JJvxQW.js → sequenceDiagram-3UESZ5HK-Zg7Ukud8.js} +21 -9
  43. package/out/renderer/assets/{stateDiagram-FHFEXIEX-BntwOBUs.js → stateDiagram-AJRCARHV-CLaqfYR8.js} +6 -8
  44. package/out/renderer/assets/{stateDiagram-v2-QKLJ7IA2-C__eWVIe.js → stateDiagram-v2-BHNVJYJU-Cmm1ljQ4.js} +4 -4
  45. package/out/renderer/assets/{timeline-definition-GMOUNBTQ-C7ch2INk.js → timeline-definition-PNZ67QCA-DQBaAVcC.js} +2 -2
  46. package/out/renderer/assets/{vennDiagram-DHZGUBPP-CQ__NSue.js → vennDiagram-CIIHVFJN-CuplbU_R.js} +1 -1
  47. package/out/renderer/assets/{wardley-RL74JXVD-Kh6mNiRV.js → wardley-L42UT6IY-BiqfHMim.js} +25605 -19118
  48. package/out/renderer/assets/{wardleyDiagram-NUSXRM2D-CfRYzJMU.js → wardleyDiagram-YWT4CUSO-BaV0FnUu.js} +112 -38
  49. package/out/renderer/assets/worker-CfJUABHG.js +12626 -0
  50. package/out/renderer/assets/{xychartDiagram-5P7HB3ND-BFq2zIne.js → xychartDiagram-2RQKCTM6-DA_Miw-n.js} +1 -1
  51. package/out/renderer/index.html +2 -2
  52. package/out/renderer/progress.html +4 -48
  53. package/out/resources/connector/connector.py +14 -6
  54. package/out/resources/mcp-server/aider-desk-mcp-server.js +1051 -501
  55. package/out/resources/skills/extension-creator/references/config-components.md +6 -6
  56. package/out/runner.js +2815 -537
  57. package/package.json +29 -21
  58. package/patches/@ai-sdk+deepseek+1.0.37.patch +150 -0
  59. package/scripts/generate-package.mjs +10 -2
  60. package/out/renderer/assets/_baseUniq-B7TxjYgy.js +0 -381
  61. package/out/renderer/assets/clone-B-kqpcr4.js +0 -8
  62. package/out/renderer/assets/min-D6g96v7R.js +0 -41
  63. package/out/resources/linux/probe +0 -0
  64. package/out/resources/linux-x64/probe +0 -0
  65. /package/patches/{ai+5.0.172.patch → ai+5.0.179.patch} +0 -0
@@ -1,7 +1,5 @@
1
- import { b as baseClone, G as Graph, i as isUndefined, v as values } from "./graph-B5YWEnt0.js";
2
- import { c as baseIteratee, i as baseFindIndex, j as castFunction, k as baseForOwn, l as hasPath, m as castPath, t as toKey, n as baseGet, d as arrayMap, o as hasIn, b as baseFlatten, p as toString, h as forEach, g as filter, r as reduce } from "./_baseUniq-B7TxjYgy.js";
3
- import { f as flatten, b as baseExtremum, a as baseLt, c as baseMap, m as map, d as min } from "./min-D6g96v7R.js";
4
- import { bV as toNumber, bW as setToString, bX as overRest, bC as baseRest, bY as isIterateeCall, bh as keysIn, bZ as eq, aK as isArrayLike, bg as keys, bP as baseFor, b_ as baseAssignValue, aN as identity, bu as isObject, bO as isIndex, bB as assignValue, aM as isSymbol, aL as isArray, bs as baseUnary, bE as constant, b$ as merge } from "./index-D7Xi0GX5.js";
1
+ import { d as defineProperty, b as baseRest, a as baseFlatten, s as setToString, o as overRest, c as arrayEach, e as isArrayLikeObject, f as baseFor, g as baseIteratee, h as baseFindIndex, j as baseEach, k as arrayMap, l as castFunction, m as baseForOwn, n as hasPath, p as identity, q as castPath, t as toKey, r as baseGet, u as hasIn, v as toString, G as Graph, w as forEach, x as constant, i as isUndefined, y as filter, z as values, A as reduce } from "./graph-B_ifajWk.js";
2
+ import { c2 as toNumber, bN as isObject, c3 as eq, bR as isArrayLike, bQ as isIndex, bX as isPrototype, c4 as arrayLikeKeys, c5 as overArg, bS as isObjectLike, c6 as baseGetTag, bO as keys, c7 as root, c8 as getSymbols, c9 as stubArray, bK as arrayPush, ca as baseGetAllKeys, cb as Uint8Array, bG as Symbol$1, bW as getTag, cc as baseUnary, cd as nodeUtil, bU as isBuffer, bL as Stack, bE as isArray, ce as getAllKeys, bV as isTypedArray, bJ as isArguments, c1 as isFunction, bF as isSymbol } from "./index-3bI-dJm8.js";
5
3
  var INFINITY = 1 / 0, MAX_INTEGER = 17976931348623157e292;
6
4
  function toFinite(value) {
7
5
  if (!value) {
@@ -18,9 +16,329 @@ function toInteger(value) {
18
16
  var result = toFinite(value), remainder = result % 1;
19
17
  return result === result ? remainder ? result - remainder : result : 0;
20
18
  }
19
+ var objectCreate = Object.create;
20
+ var baseCreate = /* @__PURE__ */ (function() {
21
+ function object() {
22
+ }
23
+ return function(proto) {
24
+ if (!isObject(proto)) {
25
+ return {};
26
+ }
27
+ if (objectCreate) {
28
+ return objectCreate(proto);
29
+ }
30
+ object.prototype = proto;
31
+ var result = new object();
32
+ object.prototype = void 0;
33
+ return result;
34
+ };
35
+ })();
36
+ function copyArray(source, array) {
37
+ var index = -1, length = source.length;
38
+ array || (array = Array(length));
39
+ while (++index < length) {
40
+ array[index] = source[index];
41
+ }
42
+ return array;
43
+ }
44
+ function baseAssignValue(object, key, value) {
45
+ if (key == "__proto__" && defineProperty) {
46
+ defineProperty(object, key, {
47
+ "configurable": true,
48
+ "enumerable": true,
49
+ "value": value,
50
+ "writable": true
51
+ });
52
+ } else {
53
+ object[key] = value;
54
+ }
55
+ }
56
+ var objectProto$5 = Object.prototype;
57
+ var hasOwnProperty$5 = objectProto$5.hasOwnProperty;
58
+ function assignValue(object, key, value) {
59
+ var objValue = object[key];
60
+ if (!(hasOwnProperty$5.call(object, key) && eq(objValue, value)) || value === void 0 && !(key in object)) {
61
+ baseAssignValue(object, key, value);
62
+ }
63
+ }
64
+ function copyObject(source, props, object, customizer) {
65
+ var isNew = !object;
66
+ object || (object = {});
67
+ var index = -1, length = props.length;
68
+ while (++index < length) {
69
+ var key = props[index];
70
+ var newValue = void 0;
71
+ if (newValue === void 0) {
72
+ newValue = source[key];
73
+ }
74
+ if (isNew) {
75
+ baseAssignValue(object, key, newValue);
76
+ } else {
77
+ assignValue(object, key, newValue);
78
+ }
79
+ }
80
+ return object;
81
+ }
82
+ function isIterateeCall(value, index, object) {
83
+ if (!isObject(object)) {
84
+ return false;
85
+ }
86
+ var type = typeof index;
87
+ if (type == "number" ? isArrayLike(object) && isIndex(index, object.length) : type == "string" && index in object) {
88
+ return eq(object[index], value);
89
+ }
90
+ return false;
91
+ }
92
+ function createAssigner(assigner) {
93
+ return baseRest(function(object, sources) {
94
+ var index = -1, length = sources.length, customizer = length > 1 ? sources[length - 1] : void 0, guard = length > 2 ? sources[2] : void 0;
95
+ customizer = assigner.length > 3 && typeof customizer == "function" ? (length--, customizer) : void 0;
96
+ if (guard && isIterateeCall(sources[0], sources[1], guard)) {
97
+ customizer = length < 3 ? void 0 : customizer;
98
+ length = 1;
99
+ }
100
+ object = Object(object);
101
+ while (++index < length) {
102
+ var source = sources[index];
103
+ if (source) {
104
+ assigner(object, source, index, customizer);
105
+ }
106
+ }
107
+ return object;
108
+ });
109
+ }
110
+ function nativeKeysIn(object) {
111
+ var result = [];
112
+ if (object != null) {
113
+ for (var key in Object(object)) {
114
+ result.push(key);
115
+ }
116
+ }
117
+ return result;
118
+ }
119
+ var objectProto$4 = Object.prototype;
120
+ var hasOwnProperty$4 = objectProto$4.hasOwnProperty;
121
+ function baseKeysIn(object) {
122
+ if (!isObject(object)) {
123
+ return nativeKeysIn(object);
124
+ }
125
+ var isProto = isPrototype(object), result = [];
126
+ for (var key in object) {
127
+ if (!(key == "constructor" && (isProto || !hasOwnProperty$4.call(object, key)))) {
128
+ result.push(key);
129
+ }
130
+ }
131
+ return result;
132
+ }
133
+ function keysIn(object) {
134
+ return isArrayLike(object) ? arrayLikeKeys(object, true) : baseKeysIn(object);
135
+ }
136
+ function flatten(array) {
137
+ var length = array == null ? 0 : array.length;
138
+ return length ? baseFlatten(array) : [];
139
+ }
21
140
  function flatRest(func) {
22
141
  return setToString(overRest(func, void 0, flatten), func + "");
23
142
  }
143
+ var getPrototype = overArg(Object.getPrototypeOf, Object);
144
+ var objectTag$1 = "[object Object]";
145
+ var funcProto = Function.prototype, objectProto$3 = Object.prototype;
146
+ var funcToString = funcProto.toString;
147
+ var hasOwnProperty$3 = objectProto$3.hasOwnProperty;
148
+ var objectCtorString = funcToString.call(Object);
149
+ function isPlainObject(value) {
150
+ if (!isObjectLike(value) || baseGetTag(value) != objectTag$1) {
151
+ return false;
152
+ }
153
+ var proto = getPrototype(value);
154
+ if (proto === null) {
155
+ return true;
156
+ }
157
+ var Ctor = hasOwnProperty$3.call(proto, "constructor") && proto.constructor;
158
+ return typeof Ctor == "function" && Ctor instanceof Ctor && funcToString.call(Ctor) == objectCtorString;
159
+ }
160
+ function baseAssign(object, source) {
161
+ return object && copyObject(source, keys(source), object);
162
+ }
163
+ function baseAssignIn(object, source) {
164
+ return object && copyObject(source, keysIn(source), object);
165
+ }
166
+ var freeExports = typeof exports == "object" && exports && !exports.nodeType && exports;
167
+ var freeModule = freeExports && typeof module == "object" && module && !module.nodeType && module;
168
+ var moduleExports = freeModule && freeModule.exports === freeExports;
169
+ var Buffer = moduleExports ? root.Buffer : void 0, allocUnsafe = Buffer ? Buffer.allocUnsafe : void 0;
170
+ function cloneBuffer(buffer, isDeep) {
171
+ if (isDeep) {
172
+ return buffer.slice();
173
+ }
174
+ var length = buffer.length, result = allocUnsafe ? allocUnsafe(length) : new buffer.constructor(length);
175
+ buffer.copy(result);
176
+ return result;
177
+ }
178
+ function copySymbols(source, object) {
179
+ return copyObject(source, getSymbols(source), object);
180
+ }
181
+ var nativeGetSymbols = Object.getOwnPropertySymbols;
182
+ var getSymbolsIn = !nativeGetSymbols ? stubArray : function(object) {
183
+ var result = [];
184
+ while (object) {
185
+ arrayPush(result, getSymbols(object));
186
+ object = getPrototype(object);
187
+ }
188
+ return result;
189
+ };
190
+ function copySymbolsIn(source, object) {
191
+ return copyObject(source, getSymbolsIn(source), object);
192
+ }
193
+ function getAllKeysIn(object) {
194
+ return baseGetAllKeys(object, keysIn, getSymbolsIn);
195
+ }
196
+ var objectProto$2 = Object.prototype;
197
+ var hasOwnProperty$2 = objectProto$2.hasOwnProperty;
198
+ function initCloneArray(array) {
199
+ var length = array.length, result = new array.constructor(length);
200
+ if (length && typeof array[0] == "string" && hasOwnProperty$2.call(array, "index")) {
201
+ result.index = array.index;
202
+ result.input = array.input;
203
+ }
204
+ return result;
205
+ }
206
+ function cloneArrayBuffer(arrayBuffer) {
207
+ var result = new arrayBuffer.constructor(arrayBuffer.byteLength);
208
+ new Uint8Array(result).set(new Uint8Array(arrayBuffer));
209
+ return result;
210
+ }
211
+ function cloneDataView(dataView, isDeep) {
212
+ var buffer = isDeep ? cloneArrayBuffer(dataView.buffer) : dataView.buffer;
213
+ return new dataView.constructor(buffer, dataView.byteOffset, dataView.byteLength);
214
+ }
215
+ var reFlags = /\w*$/;
216
+ function cloneRegExp(regexp) {
217
+ var result = new regexp.constructor(regexp.source, reFlags.exec(regexp));
218
+ result.lastIndex = regexp.lastIndex;
219
+ return result;
220
+ }
221
+ var symbolProto = Symbol$1 ? Symbol$1.prototype : void 0, symbolValueOf = symbolProto ? symbolProto.valueOf : void 0;
222
+ function cloneSymbol(symbol) {
223
+ return symbolValueOf ? Object(symbolValueOf.call(symbol)) : {};
224
+ }
225
+ function cloneTypedArray(typedArray, isDeep) {
226
+ var buffer = isDeep ? cloneArrayBuffer(typedArray.buffer) : typedArray.buffer;
227
+ return new typedArray.constructor(buffer, typedArray.byteOffset, typedArray.length);
228
+ }
229
+ var boolTag$1 = "[object Boolean]", dateTag$1 = "[object Date]", mapTag$2 = "[object Map]", numberTag$1 = "[object Number]", regexpTag$1 = "[object RegExp]", setTag$2 = "[object Set]", stringTag$1 = "[object String]", symbolTag$1 = "[object Symbol]";
230
+ var arrayBufferTag$1 = "[object ArrayBuffer]", dataViewTag$1 = "[object DataView]", float32Tag$1 = "[object Float32Array]", float64Tag$1 = "[object Float64Array]", int8Tag$1 = "[object Int8Array]", int16Tag$1 = "[object Int16Array]", int32Tag$1 = "[object Int32Array]", uint8Tag$1 = "[object Uint8Array]", uint8ClampedTag$1 = "[object Uint8ClampedArray]", uint16Tag$1 = "[object Uint16Array]", uint32Tag$1 = "[object Uint32Array]";
231
+ function initCloneByTag(object, tag, isDeep) {
232
+ var Ctor = object.constructor;
233
+ switch (tag) {
234
+ case arrayBufferTag$1:
235
+ return cloneArrayBuffer(object);
236
+ case boolTag$1:
237
+ case dateTag$1:
238
+ return new Ctor(+object);
239
+ case dataViewTag$1:
240
+ return cloneDataView(object, isDeep);
241
+ case float32Tag$1:
242
+ case float64Tag$1:
243
+ case int8Tag$1:
244
+ case int16Tag$1:
245
+ case int32Tag$1:
246
+ case uint8Tag$1:
247
+ case uint8ClampedTag$1:
248
+ case uint16Tag$1:
249
+ case uint32Tag$1:
250
+ return cloneTypedArray(object, isDeep);
251
+ case mapTag$2:
252
+ return new Ctor();
253
+ case numberTag$1:
254
+ case stringTag$1:
255
+ return new Ctor(object);
256
+ case regexpTag$1:
257
+ return cloneRegExp(object);
258
+ case setTag$2:
259
+ return new Ctor();
260
+ case symbolTag$1:
261
+ return cloneSymbol(object);
262
+ }
263
+ }
264
+ function initCloneObject(object) {
265
+ return typeof object.constructor == "function" && !isPrototype(object) ? baseCreate(getPrototype(object)) : {};
266
+ }
267
+ var mapTag$1 = "[object Map]";
268
+ function baseIsMap(value) {
269
+ return isObjectLike(value) && getTag(value) == mapTag$1;
270
+ }
271
+ var nodeIsMap = nodeUtil && nodeUtil.isMap;
272
+ var isMap = nodeIsMap ? baseUnary(nodeIsMap) : baseIsMap;
273
+ var setTag$1 = "[object Set]";
274
+ function baseIsSet(value) {
275
+ return isObjectLike(value) && getTag(value) == setTag$1;
276
+ }
277
+ var nodeIsSet = nodeUtil && nodeUtil.isSet;
278
+ var isSet = nodeIsSet ? baseUnary(nodeIsSet) : baseIsSet;
279
+ var CLONE_DEEP_FLAG$1 = 1, CLONE_FLAT_FLAG = 2, CLONE_SYMBOLS_FLAG$1 = 4;
280
+ var argsTag = "[object Arguments]", arrayTag = "[object Array]", boolTag = "[object Boolean]", dateTag = "[object Date]", errorTag = "[object Error]", funcTag = "[object Function]", genTag = "[object GeneratorFunction]", mapTag = "[object Map]", numberTag = "[object Number]", objectTag = "[object Object]", regexpTag = "[object RegExp]", setTag = "[object Set]", stringTag = "[object String]", symbolTag = "[object Symbol]", weakMapTag = "[object WeakMap]";
281
+ var arrayBufferTag = "[object ArrayBuffer]", dataViewTag = "[object DataView]", float32Tag = "[object Float32Array]", float64Tag = "[object Float64Array]", int8Tag = "[object Int8Array]", int16Tag = "[object Int16Array]", int32Tag = "[object Int32Array]", uint8Tag = "[object Uint8Array]", uint8ClampedTag = "[object Uint8ClampedArray]", uint16Tag = "[object Uint16Array]", uint32Tag = "[object Uint32Array]";
282
+ var cloneableTags = {};
283
+ cloneableTags[argsTag] = cloneableTags[arrayTag] = cloneableTags[arrayBufferTag] = cloneableTags[dataViewTag] = cloneableTags[boolTag] = cloneableTags[dateTag] = cloneableTags[float32Tag] = cloneableTags[float64Tag] = cloneableTags[int8Tag] = cloneableTags[int16Tag] = cloneableTags[int32Tag] = cloneableTags[mapTag] = cloneableTags[numberTag] = cloneableTags[objectTag] = cloneableTags[regexpTag] = cloneableTags[setTag] = cloneableTags[stringTag] = cloneableTags[symbolTag] = cloneableTags[uint8Tag] = cloneableTags[uint8ClampedTag] = cloneableTags[uint16Tag] = cloneableTags[uint32Tag] = true;
284
+ cloneableTags[errorTag] = cloneableTags[funcTag] = cloneableTags[weakMapTag] = false;
285
+ function baseClone(value, bitmask, customizer, key, object, stack) {
286
+ var result, isDeep = bitmask & CLONE_DEEP_FLAG$1, isFlat = bitmask & CLONE_FLAT_FLAG, isFull = bitmask & CLONE_SYMBOLS_FLAG$1;
287
+ if (result !== void 0) {
288
+ return result;
289
+ }
290
+ if (!isObject(value)) {
291
+ return value;
292
+ }
293
+ var isArr = isArray(value);
294
+ if (isArr) {
295
+ result = initCloneArray(value);
296
+ if (!isDeep) {
297
+ return copyArray(value, result);
298
+ }
299
+ } else {
300
+ var tag = getTag(value), isFunc = tag == funcTag || tag == genTag;
301
+ if (isBuffer(value)) {
302
+ return cloneBuffer(value, isDeep);
303
+ }
304
+ if (tag == objectTag || tag == argsTag || isFunc && !object) {
305
+ result = isFlat || isFunc ? {} : initCloneObject(value);
306
+ if (!isDeep) {
307
+ return isFlat ? copySymbolsIn(value, baseAssignIn(result, value)) : copySymbols(value, baseAssign(result, value));
308
+ }
309
+ } else {
310
+ if (!cloneableTags[tag]) {
311
+ return object ? value : {};
312
+ }
313
+ result = initCloneByTag(value, tag, isDeep);
314
+ }
315
+ }
316
+ stack || (stack = new Stack());
317
+ var stacked = stack.get(value);
318
+ if (stacked) {
319
+ return stacked;
320
+ }
321
+ stack.set(value, result);
322
+ if (isSet(value)) {
323
+ value.forEach(function(subValue) {
324
+ result.add(baseClone(subValue, bitmask, customizer, subValue, value, stack));
325
+ });
326
+ } else if (isMap(value)) {
327
+ value.forEach(function(subValue, key2) {
328
+ result.set(key2, baseClone(subValue, bitmask, customizer, key2, value, stack));
329
+ });
330
+ }
331
+ var keysFunc = isFull ? isFlat ? getAllKeysIn : getAllKeys : isFlat ? keysIn : keys;
332
+ var props = isArr ? void 0 : keysFunc(value);
333
+ arrayEach(props || value, function(subValue, key2) {
334
+ if (props) {
335
+ key2 = subValue;
336
+ subValue = value[key2];
337
+ }
338
+ assignValue(result, key2, baseClone(subValue, bitmask, customizer, key2, value, stack));
339
+ });
340
+ return result;
341
+ }
24
342
  var CLONE_DEEP_FLAG = 1, CLONE_SYMBOLS_FLAG = 4;
25
343
  function cloneDeep(value) {
26
344
  return baseClone(value, CLONE_DEEP_FLAG | CLONE_SYMBOLS_FLAG);
@@ -50,6 +368,83 @@ var defaults = baseRest(function(object, sources) {
50
368
  }
51
369
  return object;
52
370
  });
371
+ function assignMergeValue(object, key, value) {
372
+ if (value !== void 0 && !eq(object[key], value) || value === void 0 && !(key in object)) {
373
+ baseAssignValue(object, key, value);
374
+ }
375
+ }
376
+ function safeGet(object, key) {
377
+ if (key === "constructor" && typeof object[key] === "function") {
378
+ return;
379
+ }
380
+ if (key == "__proto__") {
381
+ return;
382
+ }
383
+ return object[key];
384
+ }
385
+ function toPlainObject(value) {
386
+ return copyObject(value, keysIn(value));
387
+ }
388
+ function baseMergeDeep(object, source, key, srcIndex, mergeFunc, customizer, stack) {
389
+ var objValue = safeGet(object, key), srcValue = safeGet(source, key), stacked = stack.get(srcValue);
390
+ if (stacked) {
391
+ assignMergeValue(object, key, stacked);
392
+ return;
393
+ }
394
+ var newValue = customizer ? customizer(objValue, srcValue, key + "", object, source, stack) : void 0;
395
+ var isCommon = newValue === void 0;
396
+ if (isCommon) {
397
+ var isArr = isArray(srcValue), isBuff = !isArr && isBuffer(srcValue), isTyped = !isArr && !isBuff && isTypedArray(srcValue);
398
+ newValue = srcValue;
399
+ if (isArr || isBuff || isTyped) {
400
+ if (isArray(objValue)) {
401
+ newValue = objValue;
402
+ } else if (isArrayLikeObject(objValue)) {
403
+ newValue = copyArray(objValue);
404
+ } else if (isBuff) {
405
+ isCommon = false;
406
+ newValue = cloneBuffer(srcValue, true);
407
+ } else if (isTyped) {
408
+ isCommon = false;
409
+ newValue = cloneTypedArray(srcValue, true);
410
+ } else {
411
+ newValue = [];
412
+ }
413
+ } else if (isPlainObject(srcValue) || isArguments(srcValue)) {
414
+ newValue = objValue;
415
+ if (isArguments(objValue)) {
416
+ newValue = toPlainObject(objValue);
417
+ } else if (!isObject(objValue) || isFunction(objValue)) {
418
+ newValue = initCloneObject(srcValue);
419
+ }
420
+ } else {
421
+ isCommon = false;
422
+ }
423
+ }
424
+ if (isCommon) {
425
+ stack.set(srcValue, newValue);
426
+ mergeFunc(newValue, srcValue, srcIndex, customizer, stack);
427
+ stack["delete"](srcValue);
428
+ }
429
+ assignMergeValue(object, key, newValue);
430
+ }
431
+ function baseMerge(object, source, srcIndex, customizer, stack) {
432
+ if (object === source) {
433
+ return;
434
+ }
435
+ baseFor(source, function(srcValue, key) {
436
+ stack || (stack = new Stack());
437
+ if (isObject(srcValue)) {
438
+ baseMergeDeep(object, source, key, srcIndex, baseMerge, customizer, stack);
439
+ } else {
440
+ var newValue = customizer ? customizer(safeGet(object, key), srcValue, key + "", object, source, stack) : void 0;
441
+ if (newValue === void 0) {
442
+ newValue = srcValue;
443
+ }
444
+ assignMergeValue(object, key, newValue);
445
+ }
446
+ }, keysIn);
447
+ }
53
448
  function last(array) {
54
449
  var length = array == null ? 0 : array.length;
55
450
  return length ? array[length - 1] : void 0;
@@ -81,6 +476,17 @@ function findIndex(array, predicate, fromIndex) {
81
476
  return baseFindIndex(array, baseIteratee(predicate), index);
82
477
  }
83
478
  var find = createFind(findIndex);
479
+ function baseMap(collection, iteratee) {
480
+ var index = -1, result = isArrayLike(collection) ? Array(collection.length) : [];
481
+ baseEach(collection, function(value, key, collection2) {
482
+ result[++index] = iteratee(value, key, collection2);
483
+ });
484
+ return result;
485
+ }
486
+ function map(collection, iteratee) {
487
+ var func = isArray(collection) ? arrayMap : baseMap;
488
+ return func(collection, baseIteratee(iteratee));
489
+ }
84
490
  function forIn(object, iteratee) {
85
491
  return object == null ? object : baseFor(object, castFunction(iteratee), keysIn);
86
492
  }
@@ -98,6 +504,9 @@ function baseHas(object, key) {
98
504
  function has(object, path) {
99
505
  return object != null && hasPath(object, path, baseHas);
100
506
  }
507
+ function baseLt(value, other) {
508
+ return value < other;
509
+ }
101
510
  function mapValues(object, iteratee) {
102
511
  var result = {};
103
512
  iteratee = baseIteratee(iteratee);
@@ -106,9 +515,25 @@ function mapValues(object, iteratee) {
106
515
  });
107
516
  return result;
108
517
  }
518
+ function baseExtremum(array, iteratee, comparator) {
519
+ var index = -1, length = array.length;
520
+ while (++index < length) {
521
+ var value = array[index], current = iteratee(value);
522
+ if (current != null && (computed === void 0 ? current === current && !isSymbol(current) : comparator(current, computed))) {
523
+ var computed = current, result = value;
524
+ }
525
+ }
526
+ return result;
527
+ }
109
528
  function max(array) {
110
529
  return array && array.length ? baseExtremum(array, identity, baseGt) : void 0;
111
530
  }
531
+ var merge = createAssigner(function(object, source, srcIndex) {
532
+ baseMerge(object, source, srcIndex);
533
+ });
534
+ function min(array) {
535
+ return array && array.length ? baseExtremum(array, identity, baseLt) : void 0;
536
+ }
112
537
  function minBy(array, iteratee) {
113
538
  return array && array.length ? baseExtremum(array, baseIteratee(iteratee), baseLt) : void 0;
114
539
  }
@@ -910,11 +1335,11 @@ function calcCutValue(t, g, child) {
910
1335
  });
911
1336
  return cutValue;
912
1337
  }
913
- function initLowLimValues(tree, root) {
1338
+ function initLowLimValues(tree, root2) {
914
1339
  if (arguments.length < 2) {
915
- root = tree.nodes()[0];
1340
+ root2 = tree.nodes()[0];
916
1341
  }
917
- dfsAssignLowLim(tree, {}, 1, root);
1342
+ dfsAssignLowLim(tree, {}, 1, root2);
918
1343
  }
919
1344
  function dfsAssignLowLim(tree, visited, nextLim, v, parent) {
920
1345
  var low = nextLim;
@@ -971,10 +1396,10 @@ function exchangeEdges(t, g, e, f) {
971
1396
  updateRanks(t, g);
972
1397
  }
973
1398
  function updateRanks(t, g) {
974
- var root = find(t.nodes(), function(v) {
1399
+ var root2 = find(t.nodes(), function(v) {
975
1400
  return !g.node(v).parent;
976
1401
  });
977
- var vs = preorder(t, root);
1402
+ var vs = preorder(t, root2);
978
1403
  vs = vs.slice(1);
979
1404
  forEach(vs, function(v) {
980
1405
  var parent = t.node(v).parent, edge = g.edge(v, parent), flipped = false;
@@ -1015,25 +1440,25 @@ function networkSimplexRanker(g) {
1015
1440
  networkSimplex(g);
1016
1441
  }
1017
1442
  function run(g) {
1018
- var root = addDummyNode(g, "root", {}, "_root");
1443
+ var root2 = addDummyNode(g, "root", {}, "_root");
1019
1444
  var depths = treeDepths(g);
1020
1445
  var height = max(values(depths)) - 1;
1021
1446
  var nodeSep = 2 * height + 1;
1022
- g.graph().nestingRoot = root;
1447
+ g.graph().nestingRoot = root2;
1023
1448
  forEach(g.edges(), function(e) {
1024
1449
  g.edge(e).minlen *= nodeSep;
1025
1450
  });
1026
1451
  var weight = sumWeights(g) + 1;
1027
1452
  forEach(g.children(), function(child) {
1028
- dfs(g, root, nodeSep, weight, height, depths, child);
1453
+ dfs(g, root2, nodeSep, weight, height, depths, child);
1029
1454
  });
1030
1455
  g.graph().nodeRankFactor = nodeSep;
1031
1456
  }
1032
- function dfs(g, root, nodeSep, weight, height, depths, v) {
1457
+ function dfs(g, root2, nodeSep, weight, height, depths, v) {
1033
1458
  var children = g.children(v);
1034
1459
  if (!children.length) {
1035
- if (v !== root) {
1036
- g.setEdge(root, v, { weight: 0, minlen: nodeSep });
1460
+ if (v !== root2) {
1461
+ g.setEdge(root2, v, { weight: 0, minlen: nodeSep });
1037
1462
  }
1038
1463
  return;
1039
1464
  }
@@ -1045,7 +1470,7 @@ function dfs(g, root, nodeSep, weight, height, depths, v) {
1045
1470
  g.setParent(bottom, v);
1046
1471
  label.borderBottom = bottom;
1047
1472
  forEach(children, function(child) {
1048
- dfs(g, root, nodeSep, weight, height, depths, child);
1473
+ dfs(g, root2, nodeSep, weight, height, depths, child);
1049
1474
  var childNode = g.node(child);
1050
1475
  var childTop = childNode.borderTop ? childNode.borderTop : child;
1051
1476
  var childBottom = childNode.borderBottom ? childNode.borderBottom : child;
@@ -1063,7 +1488,7 @@ function dfs(g, root, nodeSep, weight, height, depths, v) {
1063
1488
  });
1064
1489
  });
1065
1490
  if (!g.parent(v)) {
1066
- g.setEdge(root, top, { weight: 0, minlen: height + depths[v] });
1491
+ g.setEdge(root2, top, { weight: 0, minlen: height + depths[v] });
1067
1492
  }
1068
1493
  }
1069
1494
  function treeDepths(g) {
@@ -1124,14 +1549,14 @@ function addSubgraphConstraints(g, cg, vs) {
1124
1549
  });
1125
1550
  }
1126
1551
  function buildLayerGraph(g, rank2, relationship) {
1127
- var root = createRootNode(g), result = new Graph({ compound: true }).setGraph({ root }).setDefaultNodeLabel(function(v) {
1552
+ var root2 = createRootNode(g), result = new Graph({ compound: true }).setGraph({ root: root2 }).setDefaultNodeLabel(function(v) {
1128
1553
  return g.node(v);
1129
1554
  });
1130
1555
  forEach(g.nodes(), function(v) {
1131
1556
  var node = g.node(v), parent = g.parent(v);
1132
1557
  if (node.rank === rank2 || node.minRank <= rank2 && rank2 <= node.maxRank) {
1133
1558
  result.setNode(v);
1134
- result.setParent(v, parent || root);
1559
+ result.setParent(v, parent || root2);
1135
1560
  forEach(g[relationship](v), function(e) {
1136
1561
  var u = e.v === v ? e.w : e.v, edge = result.edge(u, v), weight = !isUndefined(edge) ? edge.weight : 0;
1137
1562
  result.setEdge(u, v, { weight: g.edge(e).weight + weight });
@@ -1458,8 +1883,8 @@ function buildLayerGraphs(g, ranks, relationship) {
1458
1883
  function sweepLayerGraphs(layerGraphs, biasRight) {
1459
1884
  var cg = new Graph();
1460
1885
  forEach(layerGraphs, function(lg) {
1461
- var root = lg.graph().root;
1462
- var sorted = sortSubgraph(lg, root, cg, biasRight);
1886
+ var root2 = lg.graph().root;
1887
+ var sorted = sortSubgraph(lg, root2, cg, biasRight);
1463
1888
  forEach(sorted.vs, function(v, i) {
1464
1889
  lg.node(v).order = i;
1465
1890
  });
@@ -1632,10 +2057,10 @@ function hasConflict(conflicts, v, w) {
1632
2057
  return !!conflicts[v] && Object.prototype.hasOwnProperty.call(conflicts[v], w);
1633
2058
  }
1634
2059
  function verticalAlignment(g, layering, conflicts, neighborFn) {
1635
- var root = {}, align = {}, pos = {};
2060
+ var root2 = {}, align = {}, pos = {};
1636
2061
  forEach(layering, function(layer) {
1637
2062
  forEach(layer, function(v, order2) {
1638
- root[v] = v;
2063
+ root2[v] = v;
1639
2064
  align[v] = v;
1640
2065
  pos[v] = order2;
1641
2066
  });
@@ -1653,17 +2078,17 @@ function verticalAlignment(g, layering, conflicts, neighborFn) {
1653
2078
  var w = ws[i];
1654
2079
  if (align[v] === v && prevIdx < pos[w] && !hasConflict(conflicts, v, w)) {
1655
2080
  align[w] = v;
1656
- align[v] = root[v] = root[w];
2081
+ align[v] = root2[v] = root2[w];
1657
2082
  prevIdx = pos[w];
1658
2083
  }
1659
2084
  }
1660
2085
  }
1661
2086
  });
1662
2087
  });
1663
- return { root, align };
2088
+ return { root: root2, align };
1664
2089
  }
1665
- function horizontalCompaction(g, layering, root, align, reverseSep) {
1666
- var xs = {}, blockG = buildBlockGraph(g, layering, root, reverseSep), borderType = reverseSep ? "borderLeft" : "borderRight";
2090
+ function horizontalCompaction(g, layering, root2, align, reverseSep) {
2091
+ var xs = {}, blockG = buildBlockGraph(g, layering, root2, reverseSep), borderType = reverseSep ? "borderLeft" : "borderRight";
1667
2092
  function iterate(setXsFunc, nextNodesFunc) {
1668
2093
  var stack = blockG.nodes();
1669
2094
  var elem = stack.pop();
@@ -1696,19 +2121,19 @@ function horizontalCompaction(g, layering, root, align, reverseSep) {
1696
2121
  iterate(pass1, blockG.predecessors.bind(blockG));
1697
2122
  iterate(pass2, blockG.successors.bind(blockG));
1698
2123
  forEach(align, function(v) {
1699
- xs[v] = xs[root[v]];
2124
+ xs[v] = xs[root2[v]];
1700
2125
  });
1701
2126
  return xs;
1702
2127
  }
1703
- function buildBlockGraph(g, layering, root, reverseSep) {
2128
+ function buildBlockGraph(g, layering, root2, reverseSep) {
1704
2129
  var blockGraph = new Graph(), graphLabel = g.graph(), sepFn = sep(graphLabel.nodesep, graphLabel.edgesep, reverseSep);
1705
2130
  forEach(layering, function(layer) {
1706
2131
  var u;
1707
2132
  forEach(layer, function(v) {
1708
- var vRoot = root[v];
2133
+ var vRoot = root2[v];
1709
2134
  blockGraph.setNode(vRoot);
1710
2135
  if (u) {
1711
- var uRoot = root[u], prevMax = blockGraph.edge(uRoot, vRoot);
2136
+ var uRoot = root2[u], prevMax = blockGraph.edge(uRoot, vRoot);
1712
2137
  blockGraph.setEdge(uRoot, vRoot, Math.max(sepFn(g, v, u), prevMax || 0));
1713
2138
  }
1714
2139
  u = v;
@@ -2179,5 +2604,7 @@ function canonicalize(attrs) {
2179
2604
  return newAttrs;
2180
2605
  }
2181
2606
  export {
2182
- layout as l
2607
+ baseClone as b,
2608
+ layout as l,
2609
+ map as m
2183
2610
  };
@@ -1,6 +1,6 @@
1
- import { g as getDiagramElement } from "./chunk-55IACEB6-pFPEMTmI.js";
2
- import { s as setupViewPortForSVG } from "./chunk-EDXVE4YY-DRk838hn.js";
3
- import { _ as __name, l as log, o as getRegisteredLayoutAlgorithm, r as render, D as getConfig, G as defaultConfig_default, c as getConfig2, i as sanitizeText, ai as getUserDefinedConfig, aj as v4, Y as isDark, $ as lighten, a0 as darken } from "./index-D7Xi0GX5.js";
1
+ import { g as getDiagramElement } from "./chunk-55IACEB6-DyyQMIZa.js";
2
+ import { s as setupViewPortForSVG } from "./chunk-2J33WTMH-Dzi-idRV.js";
3
+ import { _ as __name, l as log, o as getRegisteredLayoutAlgorithm, r as render, D as getConfig, G as defaultConfig_default, c as getConfig2, i as sanitizeText, ai as getUserDefinedConfig, aj as v4, Y as isDark, $ as lighten, a0 as darken } from "./index-3bI-dJm8.js";
4
4
  var parser = (function() {
5
5
  var o = /* @__PURE__ */ __name(function(k, v, o2, l) {
6
6
  for (o2 = o2 || {}, l = k.length; l--; o2[k[l]] = v) ;
@@ -1,9 +1,7 @@
1
- import { ae as constant, a6 as tau, aI as array, g as getAccDescription, s as setAccDescription, a as getAccTitle, b as setAccTitle, q as getDiagramTitle, p as setDiagramTitle, _ as __name, l as log, c as getConfig2$1, F as cleanAndMerge, I as selectSvgElement, R as parseFontSize, aJ as ordinal, e as configureSvgSize, z as clear, G as defaultConfig_default } from "./index-D7Xi0GX5.js";
2
- import { p as populateCommonDb } from "./chunk-4BX2VUAB-DQjg_Naa.js";
3
- import { p as parse } from "./wardley-RL74JXVD-Kh6mNiRV.js";
4
- import { d as d3arc } from "./arc-TuVjX2tH.js";
5
- import "./min-D6g96v7R.js";
6
- import "./_baseUniq-B7TxjYgy.js";
1
+ import { ae as constant, a6 as tau, b6 as array, g as getAccDescription, s as setAccDescription, a as getAccTitle, b as setAccTitle, q as getDiagramTitle, p as setDiagramTitle, _ as __name, l as log, c as getConfig2$1, F as cleanAndMerge, I as selectSvgElement, R as parseFontSize, b7 as ordinal, e as configureSvgSize, z as clear, G as defaultConfig_default } from "./index-3bI-dJm8.js";
2
+ import { p as populateCommonDb } from "./chunk-4BX2VUAB-DEyFpixF.js";
3
+ import { p as parse } from "./wardley-L42UT6IY-BiqfHMim.js";
4
+ import { d as d3arc } from "./arc-BXuUWHai.js";
7
5
  function descending(a, b) {
8
6
  return b < a ? -1 : b > a ? 1 : b >= a ? 0 : NaN;
9
7
  }