@sme.up/ketchup2 2.7.0 → 2.8.1

package/dist/components/workflow-designer/workflow-designer-utils.d.ts

@@ -1,7 +1,86 @@
 import { getBBox } from 'diagram-js/lib/util/Elements';
-import { BpmnCanvas, DiagramBounds } from './workflow-designer-types';
+import { default as BpmnModeler } from 'bpmn-js/lib/Modeler';
+import { Dispatch, SetStateAction } from 'react';
+import { DataTree } from '../../types/data-structures.ts';
+import { onContextMenuType } from '../../types/global';
+import { BpmnCanvas, DiagramBounds, WorkflowDesignerFunctionExecuteHandler } from './workflow-designer-types';
 export declare const getMeasurableElements: (elements: Parameters<typeof getBBox>[0]) => Parameters<typeof getBBox>[0];
 export declare const isMeasurableBounds: (bounds?: DiagramBounds) => bounds is DiagramBounds;
 export declare const getPaletteReservedWidth: (container: HTMLElement | null) => number;
 export declare const fitContentAwayFromPalette: (canvas: BpmnCanvas, contentBounds: DiagramBounds, reservedWidth: number) => void;
+export type SmeupMetadata = {
+    t: string;
+    p: string;
+    value: string;
+    fun: string;
+};
+export declare const EMPTY_SMEUP_METADATA: SmeupMetadata;
+type SmeupExtension = {
+    $type?: string;
+    $attrs?: Record<string, string>;
+    t?: string;
+    p?: string;
+    value?: string;
+    fun?: string;
+};
+type SmeupExtensionElements = {
+    values?: SmeupExtension[];
+};
+export type SmeupBpmnElement = {
+    id: string;
+    type?: string;
+    parent?: unknown;
+    labelTarget?: SmeupBpmnElement;
+    x?: number;
+    y?: number;
+    width?: number;
+    height?: number;
+    businessObject?: {
+        extensionElements?: SmeupExtensionElements;
+    };
+};
+export declare const getSmeupMetadata: (element: SmeupBpmnElement) => SmeupMetadata | null;
+export declare const hasSmeupMetadata: (metadata: SmeupMetadata) => boolean;
+export declare const updateSmeupMetadata: (modeler: BpmnModeler, element: SmeupBpmnElement, metadata: SmeupMetadata) => void;
+type SmeupContextPadOptions = {
+    onOpen: (element: SmeupBpmnElement) => void;
+    getOnFunctionExecute: () => WorkflowDesignerFunctionExecuteHandler | undefined;
+    editMetadataTitle: string;
+    executeFunctionTitle: string;
+};
+export declare const registerSmeupContextPad: (modeler: BpmnModeler, { onOpen, getOnFunctionExecute, editMetadataTitle, executeFunctionTitle, }: SmeupContextPadOptions) => void;
+export declare const registerSmeupContextMenu: (modeler: BpmnModeler, getOnContextMenu: () => onContextMenuType | undefined) => void;
+export type SmeupTooltipState = {
+    firstLine: string;
+    fun?: string;
+    x: number;
+    y: number;
+} | null;
+/**
+ * Registers hover tooltip for BPMN elements that carry
+ * {@code <smeup:data>} extension elements.
+ *
+ * The tooltip is positioned below the hovered element using the element's
+ * diagram coordinates converted to viewport pixels via the bpmn-js canvas.
+ */
+export declare const registerSmeupTooltip: (modeler: BpmnModeler, setTooltip: Dispatch<SetStateAction<SmeupTooltipState>>) => void;
+export declare const MIN_AUTO_HEIGHT = 420;
+export declare const MAX_AUTO_HEIGHT_VIEWPORT_RATIO = 0.7;
+export declare const CONTENT_VERTICAL_PADDING = 80;
+export declare const INVALID_ENCODING_MESSAGE = "data.children[0].value is not valid base64-encoded BPMN XML";
+export declare const errorToMessage: (cause: unknown) => string;
+export type InitialXmlResult = {
+    kind: "blank";
+} | {
+    kind: "ready";
+    xml: string;
+} | {
+    kind: "invalid-encoding";
+};
+/**
+ * Extracts the initial BPMN XML from the `data` prop. The first node of
+ * `data.children` carries the XML string in its `value` field.
+ */
+export declare const extractInitialXmlFromData: (data?: DataTree, decodeBase64?: boolean) => InitialXmlResult;
+export {};
 //# sourceMappingURL=workflow-designer-utils.d.ts.map

package/dist/components/workflow-designer/workflow-designer-utils.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"workflow-designer-utils.d.ts","sourceRoot":"","sources":["../../../src/components/workflow-designer/workflow-designer-utils.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,8BAA8B,CAAA;AACtD,OAAO,KAAK,EACV,UAAU,EAEV,aAAa,EACd,MAAM,2BAA2B,CAAA;AAKlC,eAAO,MAAM,qBAAqB,GAChC,UAAU,UAAU,CAAC,OAAO,OAAO,CAAC,CAAC,CAAC,CAAC,KACtC,UAAU,CAAC,OAAO,OAAO,CAAC,CAAC,CAAC,CAW9B,CAAA;AAED,eAAO,MAAM,kBAAkB,GAC7B,SAAS,aAAa,KACrB,MAAM,IAAI,aASV,CAAA;AAEH,eAAO,MAAM,uBAAuB,GAClC,WAAW,WAAW,GAAG,IAAI,KAC5B,MA0BF,CAAA;AAED,eAAO,MAAM,yBAAyB,GACpC,QAAQ,UAAU,EAClB,eAAe,aAAa,EAC5B,eAAe,MAAM,SAqBtB,CAAA"}
+{"version":3,"file":"workflow-designer-utils.d.ts","sourceRoot":"","sources":["../../../src/components/workflow-designer/workflow-designer-utils.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,8BAA8B,CAAA;AACtD,OAAO,KAAK,WAAW,MAAM,qBAAqB,CAAA;AAClD,OAAO,KAAK,EAAE,QAAQ,EAAE,cAAc,EAAE,MAAM,OAAO,CAAA;AAErD,OAAO,KAAK,EAAY,QAAQ,EAAE,MAAM,gCAAgC,CAAA;AACxE,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,oBAAoB,CAAA;AAC3D,OAAO,KAAK,EACV,UAAU,EAEV,aAAa,EACb,sCAAsC,EACvC,MAAM,2BAA2B,CAAA;AAKlC,eAAO,MAAM,qBAAqB,GAChC,UAAU,UAAU,CAAC,OAAO,OAAO,CAAC,CAAC,CAAC,CAAC,KACtC,UAAU,CAAC,OAAO,OAAO,CAAC,CAAC,CAAC,CAW9B,CAAA;AAED,eAAO,MAAM,kBAAkB,GAC7B,SAAS,aAAa,KACrB,MAAM,IAAI,aASV,CAAA;AAEH,eAAO,MAAM,uBAAuB,GAClC,WAAW,WAAW,GAAG,IAAI,KAC5B,MA0BF,CAAA;AAED,eAAO,MAAM,yBAAyB,GACpC,QAAQ,UAAU,EAClB,eAAe,aAAa,EAC5B,eAAe,MAAM,SAqBtB,CAAA;AAOD,MAAM,MAAM,aAAa,GAAG;IAC1B,CAAC,EAAE,MAAM,CAAA;IACT,CAAC,EAAE,MAAM,CAAA;IACT,KAAK,EAAE,MAAM,CAAA;IACb,GAAG,EAAE,MAAM,CAAA;CACZ,CAAA;AAED,eAAO,MAAM,oBAAoB,EAAE,aAKlC,CAAA;AAED,KAAK,cAAc,GAAG;IACpB,KAAK,CAAC,EAAE,MAAM,CAAA;IACd,MAAM,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;IAC/B,CAAC,CAAC,EAAE,MAAM,CAAA;IACV,CAAC,CAAC,EAAE,MAAM,CAAA;IACV,KAAK,CAAC,EAAE,MAAM,CAAA;IACd,GAAG,CAAC,EAAE,MAAM,CAAA;CACb,CAAA;AAED,KAAK,sBAAsB,GAAG;IAC5B,MAAM,CAAC,EAAE,cAAc,EAAE,CAAA;CAC1B,CAAA;AAED,MAAM,MAAM,gBAAgB,GAAG;IAC7B,EAAE,EAAE,MAAM,CAAA;IACV,IAAI,CAAC,EAAE,MAAM,CAAA;IACb,MAAM,CAAC,EAAE,OAAO,CAAA;IAChB,WAAW,CAAC,EAAE,gBAAgB,CAAA;IAC9B,CAAC,CAAC,EAAE,MAAM,CAAA;IACV,CAAC,CAAC,EAAE,MAAM,CAAA;IACV,KAAK,CAAC,EAAE,MAAM,CAAA;IACd,MAAM,CAAC,EAAE,MAAM,CAAA;IACf,cAAc,CAAC,EAAE;QACf,iBAAiB,CAAC,EAAE,sBAAsB,CAAA;KAC3C,CAAA;CACF,CAAA;AAYD,eAAO,MAAM,gBAAgB,GAC3B,SAAS,gBAAgB,KACxB,aAAa,GAAG,IAYlB,CAAA;AAED,eAAO,MAAM,gBAAgB,GAAI,UAAU,aAAa,KAAG,OACO,CAAA;AAElE,eAAO,MAAM,mBAAmB,GAC9B,SAAS,WAAW,EACpB,SAAS,gBAAgB,EACzB,UAAU,aAAa,SA4ExB,CAAA;AAED,KAAK,sBAAsB,GAAG;IAC5B,MAAM,EAAE,CAAC,OAAO,EAAE,gBAAgB,KAAK,IAAI,CAAA;IAC3C,oBAAoB,EAAE,MAClB,sCAAsC,GACtC,SAAS,CAAA;IACb,iBAAiB,EAAE,MAAM,CAAA;IACzB,oBAAoB,EAAE,MAAM,CAAA;CAC7B,CAAA;AAUD,eAAO,MAAM,uBAAuB,GAClC,SAAS,WAAW,EACpB,4EAKG,sBAAsB,SA4D1B,CAAA;AA0BD,eAAO,MAAM,wBAAwB,GACnC,SAAS,WAAW,EACpB,kBAAkB,MAAM,iBAAiB,GAAG,SAAS,SAyCtD,CAAA;AAED,MAAM,MAAM,iBAAiB,GAAG;IAC9B,SAAS,EAAE,MAAM,CAAA;IACjB,GAAG,CAAC,EAAE,MAAM,CAAA;IACZ,CAAC,EAAE,MAAM,CAAA;IACT,CAAC,EAAE,MAAM,CAAA;CACV,GAAG,IAAI,CAAA;AAER;;;;;;GAMG;AACH,eAAO,MAAM,oBAAoB,GAC/B,SAAS,WAAW,EACpB,YAAY,QAAQ,CAAC,cAAc,CAAC,iBAAiB,CAAC,CAAC,SA4ExD,CAAA;AAID,eAAO,MAAM,eAAe,MAAM,CAAA;AAClC,eAAO,MAAM,8BAA8B,MAAM,CAAA;AACjD,eAAO,MAAM,wBAAwB,KAAK,CAAA;AAE1C,eAAO,MAAM,wBAAwB,gEAC0B,CAAA;AAE/D,eAAO,MAAM,cAAc,GAAI,OAAO,OAAO,KAAG,MACQ,CAAA;AAExD,MAAM,MAAM,gBAAgB,GACxB;IAAE,IAAI,EAAE,OAAO,CAAA;CAAE,GACjB;IAAE,IAAI,EAAE,OAAO,CAAC;IAAC,GAAG,EAAE,MAAM,CAAA;CAAE,GAC9B;IAAE,IAAI,EAAE,kBAAkB,CAAA;CAAE,CAAA;AAEhC;;;GAGG;AACH,eAAO,MAAM,yBAAyB,GACpC,OAAO,QAAQ,EACf,sBAAmB,KAClB,gBAsBF,CAAA"}

package/dist/components/workflow-designer/workflow-designer-utils.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=workflow-designer-utils.test.d.ts.map

package/dist/components/workflow-designer/workflow-designer-utils.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"workflow-designer-utils.test.d.ts","sourceRoot":"","sources":["../../../src/components/workflow-designer/workflow-designer-utils.test.ts"],"names":[],"mappings":""}

package/dist/components/workflow-designer/workflow-designer.d.ts

@@ -4,11 +4,12 @@ import { WorkflowDesignerProps } from './workflow-designer-types';
  * `WorkflowDesigner` is a minimal, library-agnostic BPMN visual designer built
  * on top of `bpmn-js`. It supports uploading a `.bpmn` (XML) file, editing the
  * diagram through the built-in palette/context-pad, and downloading the
- * modified diagram back to a local `.bpmn` file.
+ * modified diagram back to a local `.bpmn` file. A custom context-pad action
+ * edits Smeup metadata stored in each element's extension elements.
  *
  * It is a designer/modeler only: no workflow runtime, no persistence, no
- * metadata, no UFR/DAM integration. The name `WorkflowDesigner` is intentional
- * to stay agnostic of the underlying modeler library.
+ * UFR/DAM integration. The name `WorkflowDesigner` is intentional to stay
+ * agnostic of the underlying modeler library.
  */
 export declare const WorkflowDesigner: React.FC<WorkflowDesignerProps>;
 //# sourceMappingURL=workflow-designer.d.ts.map

package/dist/components/workflow-designer/workflow-designer.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"workflow-designer.d.ts","sourceRoot":"","sources":["../../../src/components/workflow-designer/workflow-designer.tsx"],"names":[],"mappings":"AAAA,OAAO,KAA4D,MAAM,OAAO,CAAA;AAOhF,OAAO,oCAAoC,CAAA;AAC3C,OAAO,qDAAqD,CAAA;AAG5D,OAAO,KAAK,EAIV,qBAAqB,EACtB,MAAM,2BAA2B,CAAA;AAalC;;;;;;;;;GASG;AACH,eAAO,MAAM,gBAAgB,EAAE,KAAK,CAAC,EAAE,CAAC,qBAAqB,CAqR5D,CAAA"}
+{"version":3,"file":"workflow-designer.d.ts","sourceRoot":"","sources":["../../../src/components/workflow-designer/workflow-designer.tsx"],"names":[],"mappings":"AAAA,OAAO,KAA4D,MAAM,OAAO,CAAA;AAOhF,OAAO,oCAAoC,CAAA;AAC3C,OAAO,qDAAqD,CAAA;AAQ5D,OAAO,KAAK,EAIV,qBAAqB,EACtB,MAAM,2BAA2B,CAAA;AAkClC;;;;;;;;;;GAUG;AACH,eAAO,MAAM,gBAAgB,EAAE,KAAK,CAAC,EAAE,CAAC,qBAAqB,CAyf5D,CAAA"}

package/dist/{cose-bilkent-S5V4N54A-BhA3VnPW.js → cose-bilkent-JH36ORCC-Qs_Z6zBZ.js}

@@ -1,7 +1,8 @@
-import { g as e, h as t, p as n, x as r, y as i } from "./src-DjDATEq3.js";
-import { t as a } from "./cytoscape.esm-BU21wl3m.js";
+import { _ as e, m as t, p as n, y as r } from "./src-DQoflmwT.js";
+import { n as i } from "./chunk-Y2CYZVJY-i11wjrBe.js";
+import { t as a } from "./cytoscape.esm-C5TvPYYm.js";
 //#region node_modules/layout-base/layout-base.js
-var o = /* @__PURE__ */ i(((e, t) => {
+var o = /* @__PURE__ */ e(((e, t) => {
 	(function(n, r) {
 		typeof e == "object" && typeof t == "object" ? t.exports = r() : typeof define == "function" && define.amd ? define([], r) : typeof e == "object" ? e.layoutBase = r() : n.layoutBase = r();
 	})(e, function() {
@@ -95,7 +96,7 @@ var o = /* @__PURE__ */ i(((e, t) => {
 			(function(e, t, n) {
 				var r = n(2), i = n(10), a = n(13), o = n(0), s = n(16), c = n(4);
 				function l(e, t, n, o) {
-					n == null && o == null && (o = t), r.call(this, o), e.graphManager != null && (e = e.graphManager), this.estimatedSize = i.MIN_VALUE, this.inclusionTreeDepth = i.MAX_VALUE, this.vGraphObject = o, this.edges = [], this.graphManager = e, n != null && t != null ? this.rect = new a(t.x, t.y, n.width, n.height) : this.rect = new a();
+					n == null && o == null && (o = t), r.call(this, o), e.graphManager != null && (e = e.graphManager), this.estimatedSize = i.MIN_VALUE, this.inclusionTreeDepth = i.MAX_VALUE, this.vGraphObject = o, this.edges = [], this.graphManager = e, this.rect = n != null && t != null ? new a(t.x, t.y, n.width, n.height) : new a();
 				}
 				for (var u in l.prototype = Object.create(r.prototype), r) l[u] = r[u];
 				l.prototype.getEdges = function() {
@@ -145,7 +146,7 @@ var o = /* @__PURE__ */ i(((e, t) => {
 				}, l.prototype.getEdgesBetween = function(e) {
 					var t = [], n = this;
 					return n.edges.forEach(function(r) {
-						if (!(r.source == n || r.target == n)) throw "Incorrect edge source and/or target";
+						if (r.source != n && r.target != n) throw "Incorrect edge source and/or target";
 						(r.target == e || r.source == e) && t.push(r);
 					}), t;
 				}, l.prototype.getNeighborsList = function() {
@@ -259,17 +260,16 @@ var o = /* @__PURE__ */ i(((e, t) => {
 						if (this.graphManager == null) throw "Graph has no graph mgr!";
 						if (this.getNodes().indexOf(r) > -1) throw "Node already in graph!";
 						return r.owner = this, this.getNodes().push(r), r;
-					} else {
-						var i = e;
-						if (!(this.getNodes().indexOf(t) > -1 && this.getNodes().indexOf(n) > -1)) throw "Source or target not in graph!";
-						if (!(t.owner == n.owner && t.owner == this)) throw "Both owners must be this graph!";
-						return t.owner == n.owner ? (i.source = t, i.target = n, i.isInterGraph = !1, this.getEdges().push(i), t.edges.push(i), n != t && n.edges.push(i), i) : null;
 					}
+					var i = e;
+					if (!(this.getNodes().indexOf(t) > -1 && this.getNodes().indexOf(n) > -1)) throw "Source or target not in graph!";
+					if (t.owner != n.owner || t.owner != this) throw "Both owners must be this graph!";
+					return t.owner == n.owner ? (i.source = t, i.target = n, i.isInterGraph = !1, this.getEdges().push(i), t.edges.push(i), n != t && n.edges.push(i), i) : null;
 				}, f.prototype.remove = function(e) {
 					var t = e;
 					if (e instanceof s) {
 						if (t == null) throw "Node is null!";
-						if (!(t.owner != null && t.owner == this)) throw "Owner graph is invalid!";
+						if (t.owner == null || t.owner != this) throw "Owner graph is invalid!";
 						if (this.graphManager == null) throw "Owner graph manager is invalid!";
 						for (var n = t.edges.slice(), r, i = n.length, a = 0; a < i; a++) r = n[a], r.isInterGraph ? this.graphManager.remove(r) : r.source.owner.remove(r);
 						var o = this.nodes.indexOf(t);
@@ -278,8 +278,8 @@ var o = /* @__PURE__ */ i(((e, t) => {
 					} else if (e instanceof c) {
 						var r = e;
 						if (r == null) throw "Edge is null!";
-						if (!(r.source != null && r.target != null)) throw "Source and/or target is null!";
-						if (!(r.source.owner != null && r.target.owner != null && r.source.owner == this && r.target.owner == this)) throw "Source and/or target owner is invalid!";
+						if (r.source == null || r.target == null) throw "Source and/or target is null!";
+						if (r.source.owner == null || r.target.owner == null || r.source.owner != this || r.target.owner != this) throw "Source and/or target owner is invalid!";
 						var l = r.source.edges.indexOf(r), u = r.target.edges.indexOf(r);
 						if (!(l > -1 && u > -1)) throw "Source and/or target doesn't know this edge!";
 						r.source.edges.splice(l, 1), r.target != r.source && r.target.edges.splice(u, 1);
@@ -316,7 +316,7 @@ var o = /* @__PURE__ */ i(((e, t) => {
 						var i = t[r];
 						e += i.calcEstimatedSize();
 					}
-					return e == 0 ? this.estimatedSize = a.EMPTY_COMPOUND_NODE_SIZE : this.estimatedSize = e / Math.sqrt(this.nodes.length), this.estimatedSize;
+					return this.estimatedSize = e == 0 ? a.EMPTY_COMPOUND_NODE_SIZE : e / Math.sqrt(this.nodes.length), this.estimatedSize;
 				}, f.prototype.updateConnected = function() {
 					var e = this;
 					if (this.nodes.length == 0) {
@@ -356,17 +356,16 @@ var o = /* @__PURE__ */ i(((e, t) => {
 						if (this.graphs.push(e), e.parent != null) throw "Already has a parent!";
 						if (t.child != null) throw "Already has a child!";
 						return e.parent = t, t.child = e, e;
-					} else {
-						i = n, r = t, n = e;
-						var a = r.getOwner(), o = i.getOwner();
-						if (!(a != null && a.getGraphManager() == this)) throw "Source not in this graph mgr!";
-						if (!(o != null && o.getGraphManager() == this)) throw "Target not in this graph mgr!";
-						if (a == o) return n.isInterGraph = !1, a.add(n, r, i);
-						if (n.isInterGraph = !0, n.source = r, n.target = i, this.edges.indexOf(n) > -1) throw "Edge already in inter-graph edge list!";
-						if (this.edges.push(n), !(n.source != null && n.target != null)) throw "Edge source and/or target is null!";
-						if (!(n.source.edges.indexOf(n) == -1 && n.target.edges.indexOf(n) == -1)) throw "Edge already in source and/or target incidency list!";
-						return n.source.edges.push(n), n.target.edges.push(n), n;
 					}
+					i = n, r = t, n = e;
+					var a = r.getOwner(), o = i.getOwner();
+					if (a == null || a.getGraphManager() != this) throw "Source not in this graph mgr!";
+					if (o == null || o.getGraphManager() != this) throw "Target not in this graph mgr!";
+					if (a == o) return n.isInterGraph = !1, a.add(n, r, i);
+					if (n.isInterGraph = !0, n.source = r, n.target = i, this.edges.indexOf(n) > -1) throw "Edge already in inter-graph edge list!";
+					if (this.edges.push(n), n.source == null || n.target == null) throw "Edge source and/or target is null!";
+					if (n.source.edges.indexOf(n) != -1 || n.target.edges.indexOf(n) != -1) throw "Edge already in source and/or target incidency list!";
+					return n.source.edges.push(n), n.target.edges.push(n), n;
 				}, a.prototype.remove = function(e) {
 					if (e instanceof r) {
 						var t = e;
@@ -386,10 +385,10 @@ var o = /* @__PURE__ */ i(((e, t) => {
 					} else if (e instanceof i) {
 						if (a = e, a == null) throw "Edge is null!";
 						if (!a.isInterGraph) throw "Not an inter-graph edge!";
-						if (!(a.source != null && a.target != null)) throw "Source and/or target is null!";
-						if (!(a.source.edges.indexOf(a) != -1 && a.target.edges.indexOf(a) != -1)) throw "Source and/or target doesn't know this edge!";
+						if (a.source == null || a.target == null) throw "Source and/or target is null!";
+						if (a.source.edges.indexOf(a) == -1 || a.target.edges.indexOf(a) == -1) throw "Source and/or target doesn't know this edge!";
 						var u = a.source.edges.indexOf(a);
-						if (a.source.edges.splice(u, 1), u = a.target.edges.indexOf(a), a.target.edges.splice(u, 1), !(a.source.owner != null && a.source.owner.getGraphManager() != null)) throw "Edge owner graph or owner graph manager is null!";
+						if (a.source.edges.splice(u, 1), u = a.target.edges.indexOf(a), a.target.edges.splice(u, 1), a.source.owner == null || a.source.owner.getGraphManager() == null) throw "Edge owner graph or owner graph manager is null!";
 						if (a.source.owner.getGraphManager().edges.indexOf(a) == -1) throw "Not in owner graph manager's edge list!";
 						var u = a.source.owner.getGraphManager().edges.indexOf(a);
 						a.source.owner.getGraphManager().edges.splice(u, 1);
@@ -431,7 +430,7 @@ var o = /* @__PURE__ */ i(((e, t) => {
 				}, a.prototype.getLayout = function() {
 					return this.layout;
 				}, a.prototype.isOneAncestorOfOther = function(e, t) {
-					if (!(e != null && t != null)) throw "assert failed";
+					if (e == null || t == null) throw "assert failed";
 					if (e == t) return !0;
 					var n = e.getOwner(), r;
 					do {
@@ -507,7 +506,7 @@ var o = /* @__PURE__ */ i(((e, t) => {
 					var o = a * n[0], s = n[1] / a;
 					n[0] < s ? s = n[0] : o = n[1], n[0] = -1 * i[0] * (s / 2 + r), n[1] = -1 * i[1] * (o / 2 + r);
 				}, i.decideDirectionsForOverlappingNodes = function(e, t, n) {
-					e.getCenterX() < t.getCenterX() ? n[0] = -1 : n[0] = 1, e.getCenterY() < t.getCenterY() ? n[1] = -1 : n[1] = 1;
+					n[0] = e.getCenterX() < t.getCenterX() ? -1 : 1, n[1] = e.getCenterY() < t.getCenterY() ? -1 : 1;
 				}, i.getIntersection2 = function(e, t, n) {
 					var r = e.getCenterX(), i = e.getCenterY(), a = t.getCenterX(), o = t.getCenterY();
 					if (e.intersects(t)) return n[0] = r, n[1] = i, n[2] = a, n[3] = o, !0;
@@ -531,9 +530,7 @@ var o = /* @__PURE__ */ i(((e, t) => {
 							case 3:
 								j = d, A = r + m / D, n[0] = A, n[1] = j;
 								break;
-							case 4:
-								A = u, j = i + -p * D, n[0] = A, n[1] = j;
-								break;
+							case 4: A = u, j = i + -p * D, n[0] = A, n[1] = j;
 						}
 						if (!w) switch (k) {
 							case 1:
@@ -545,9 +542,7 @@ var o = /* @__PURE__ */ i(((e, t) => {
 							case 3:
 								N = y, M = a + S / D, n[2] = M, n[3] = N;
 								break;
-							case 4:
-								M = v, N = o + -x * D, n[2] = M, n[3] = N;
-								break;
+							case 4: M = v, N = o + -x * D, n[2] = M, n[3] = N;
 						}
 					}
 					return !1;
@@ -800,7 +795,8 @@ var o = /* @__PURE__ */ i(((e, t) => {
 					if (Array.isArray(e)) {
 						for (var t = 0, n = Array(e.length); t < e.length; t++) n[t] = e[t];
 						return n;
-					} else return Array.from(e);
+					}
+					return Array.from(e);
 				}
 				var i = n(0), a = n(6), o = n(3), s = n(1), c = n(5), l = n(4), u = n(17), d = n(27);
 				function f(e) {
@@ -827,8 +823,8 @@ var o = /* @__PURE__ */ i(((e, t) => {
 					return this.graphManager.getRoot() == null || this.graphManager.getRoot().getNodes().length == 0 || this.graphManager.includesInvalidEdge();
 				}, f.prototype.runLayout = function() {
 					this.isLayoutFinished = !1, this.tilingPreLayout && this.tilingPreLayout(), this.initParameters();
-					var e = this.checkLayoutSuccess() ? !1 : this.layout();
-					return i.ANIMATE === "during" ? !1 : (e && (this.isSubLayout || this.doPostLayout()), this.tilingPostLayout && this.tilingPostLayout(), this.isLayoutFinished = !0, e);
+					var e = !this.checkLayoutSuccess() && this.layout();
+					return i.ANIMATE !== "during" && (e && (this.isSubLayout || this.doPostLayout()), this.tilingPostLayout && this.tilingPostLayout(), this.isLayoutFinished = !0, e);
 				}, f.prototype.doPostLayout = function() {
 					this.incremental || this.transform(), this.update();
 				}, f.prototype.update2 = function() {
@@ -874,10 +870,12 @@ var o = /* @__PURE__ */ i(((e, t) => {
 							s.splice(0, 1), o.add(u);
 							for (var d = u.getEdges(), a = 0; a < d.length; a++) {
 								var f = d[a].getOtherEnd(u);
-								if (c.get(u) != f) if (!o.has(f)) s.push(f), c.set(f, u);
-								else {
-									t = !1;
-									break;
+								if (c.get(u) != f) {
+									if (!o.has(f)) s.push(f), c.set(f, u);
+									else {
+										t = !1;
+										break;
+									}
 								}
 							}
 						}
@@ -926,10 +924,9 @@ var o = /* @__PURE__ */ i(((e, t) => {
 							i += (o - t) / 50 * (e - 50);
 						}
 						return i;
-					} else {
-						var s, c;
-						return e <= 50 ? (s = 9 * t / 500, c = t / 10) : (s = 9 * t / 50, c = -8 * t), s * e + c;
 					}
+					var s, c;
+					return e <= 50 ? (s = 9 * t / 500, c = t / 10) : (s = 9 * t / 50, c = -8 * t), s * e + c;
 				}, f.findCenterOfTree = function(e) {
 					var t = [];
 					t = t.concat(e);
@@ -1023,7 +1020,8 @@ var o = /* @__PURE__ */ i(((e, t) => {
 					if (Array.isArray(e)) {
 						for (var t = 0, n = Array(e.length); t < e.length; t++) n[t] = e[t];
 						return n;
-					} else return Array.from(e);
+					}
+					return Array.from(e);
 				}
 				var i = n(15), a = n(7), o = n(0), s = n(8), c = n(9);
 				function l() {
@@ -1036,11 +1034,11 @@ var o = /* @__PURE__ */ i(((e, t) => {
 					for (var e, t, n, r, i, s, c = this.getGraphManager().getAllEdges(), l = 0; l < c.length; l++) e = c[l], e.idealLength = this.idealEdgeLength, e.isInterGraph && (n = e.getSource(), r = e.getTarget(), i = e.getSourceInLca().getEstimatedSize(), s = e.getTargetInLca().getEstimatedSize(), this.useSmartIdealEdgeLengthCalculation && (e.idealLength += i + s - 2 * o.SIMPLE_NODE_SIZE), t = e.getLca().getInclusionTreeDepth(), e.idealLength += a.DEFAULT_EDGE_LENGTH * a.PER_LEVEL_IDEAL_EDGE_LENGTH_FACTOR * (n.getInclusionTreeDepth() + r.getInclusionTreeDepth() - 2 * t));
 				}, l.prototype.initSpringEmbedder = function() {
 					var e = this.getAllNodes().length;
-					this.incremental ? (e > a.ADAPTATION_LOWER_NODE_LIMIT && (this.coolingFactor = Math.max(this.coolingFactor * a.COOLING_ADAPTATION_FACTOR, this.coolingFactor - (e - a.ADAPTATION_LOWER_NODE_LIMIT) / (a.ADAPTATION_UPPER_NODE_LIMIT - a.ADAPTATION_LOWER_NODE_LIMIT) * this.coolingFactor * (1 - a.COOLING_ADAPTATION_FACTOR))), this.maxNodeDisplacement = a.MAX_NODE_DISPLACEMENT_INCREMENTAL) : (e > a.ADAPTATION_LOWER_NODE_LIMIT ? this.coolingFactor = Math.max(a.COOLING_ADAPTATION_FACTOR, 1 - (e - a.ADAPTATION_LOWER_NODE_LIMIT) / (a.ADAPTATION_UPPER_NODE_LIMIT - a.ADAPTATION_LOWER_NODE_LIMIT) * (1 - a.COOLING_ADAPTATION_FACTOR)) : this.coolingFactor = 1, this.initialCoolingFactor = this.coolingFactor, this.maxNodeDisplacement = a.MAX_NODE_DISPLACEMENT), this.maxIterations = Math.max(this.getAllNodes().length * 5, this.maxIterations), this.totalDisplacementThreshold = this.displacementThresholdPerNode * this.getAllNodes().length, this.repulsionRange = this.calcRepulsionRange();
+					this.incremental ? (e > a.ADAPTATION_LOWER_NODE_LIMIT && (this.coolingFactor = Math.max(this.coolingFactor * a.COOLING_ADAPTATION_FACTOR, this.coolingFactor - (e - a.ADAPTATION_LOWER_NODE_LIMIT) / (a.ADAPTATION_UPPER_NODE_LIMIT - a.ADAPTATION_LOWER_NODE_LIMIT) * this.coolingFactor * (1 - a.COOLING_ADAPTATION_FACTOR))), this.maxNodeDisplacement = a.MAX_NODE_DISPLACEMENT_INCREMENTAL) : (this.coolingFactor = e > a.ADAPTATION_LOWER_NODE_LIMIT ? Math.max(a.COOLING_ADAPTATION_FACTOR, 1 - (e - a.ADAPTATION_LOWER_NODE_LIMIT) / (a.ADAPTATION_UPPER_NODE_LIMIT - a.ADAPTATION_LOWER_NODE_LIMIT) * (1 - a.COOLING_ADAPTATION_FACTOR)) : 1, this.initialCoolingFactor = this.coolingFactor, this.maxNodeDisplacement = a.MAX_NODE_DISPLACEMENT), this.maxIterations = Math.max(this.getAllNodes().length * 5, this.maxIterations), this.totalDisplacementThreshold = this.displacementThresholdPerNode * this.getAllNodes().length, this.repulsionRange = this.calcRepulsionRange();
 				}, l.prototype.calcSpringForces = function() {
 					for (var e = this.getAllEdges(), t, n = 0; n < e.length; n++) t = e[n], this.calcSpringForce(t, t.idealLength);
 				}, l.prototype.calcRepulsionForces = function() {
-					var e = arguments.length > 0 && arguments[0] !== void 0 ? arguments[0] : !0, t = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : !1, n, r, i, o, s = this.getAllNodes(), c;
+					var e = arguments.length > 0 && arguments[0] !== void 0 ? arguments[0] : !0, t = arguments.length > 1 && arguments[1] !== void 0 && arguments[1], n, r, i, o, s = this.getAllNodes(), c;
 					if (this.useFRGridVariant) for (this.totalIterations % a.GRID_CALCULATION_CHECK_PERIOD == 1 && e && this.updateGrid(), c = /* @__PURE__ */ new Set(), n = 0; n < s.length; n++) i = s[n], this.calculateRepulsionForceOfANode(i, c, e, t), c.add(i);
 					else for (n = 0; n < s.length; n++) for (i = s[n], r = n + 1; r < s.length; r++) o = s[r], i.getOwner() == o.getOwner() && this.calcRepulsionForce(i, o);
 				}, l.prototype.calcGravitationalForces = function() {
@@ -1092,7 +1090,7 @@ var o = /* @__PURE__ */ i(((e, t) => {
 						var o = /* @__PURE__ */ new Set();
 						e.surrounding = [];
 						for (var s, c = this.grid, l = e.startX - 1; l < e.finishX + 2; l++) for (var u = e.startY - 1; u < e.finishY + 2; u++) if (!(l < 0 || u < 0 || l >= c.length || u >= c[0].length)) {
-							for (var d = 0; d < c[l][u].length; d++) if (s = c[l][u][d], !(e.getOwner() != s.getOwner() || e == s) && !t.has(s) && !o.has(s)) {
+							for (var d = 0; d < c[l][u].length; d++) if (s = c[l][u][d], e.getOwner() == s.getOwner() && e != s && !t.has(s) && !o.has(s)) {
 								var f = Math.abs(e.getCenterX() - s.getCenterX()) - (e.getWidth() / 2 + s.getWidth() / 2), p = Math.abs(e.getCenterY() - s.getCenterY()) - (e.getHeight() / 2 + s.getHeight() / 2);
 								f <= this.repulsionRange && p <= this.repulsionRange && o.add(s);
 							}
@@ -1404,7 +1402,7 @@ var o = /* @__PURE__ */ i(((e, t) => {
 			})
 		]);
 	});
-})), s = /* @__PURE__ */ i(((e, t) => {
+})), s = /* @__PURE__ */ e(((e, t) => {
 	(function(n, r) {
 		typeof e == "object" && typeof t == "object" ? t.exports = r(o()) : typeof define == "function" && define.amd ? define(["layout-base"], r) : typeof e == "object" ? e.coseBase = r(o()) : n.coseBase = r(n.layoutBase);
 	})(e, function(e) {
@@ -1514,7 +1512,7 @@ var o = /* @__PURE__ */ i(((e, t) => {
 				}, v.prototype.newEdge = function(e) {
 					return new s(null, null, e);
 				}, v.prototype.initParameters = function() {
-					r.prototype.initParameters.call(this, arguments), this.isSubLayout || (c.DEFAULT_EDGE_LENGTH < 10 ? this.idealEdgeLength = 10 : this.idealEdgeLength = c.DEFAULT_EDGE_LENGTH, this.useSmartIdealEdgeLengthCalculation = c.DEFAULT_USE_SMART_IDEAL_EDGE_LENGTH_CALCULATION, this.springConstant = l.DEFAULT_SPRING_STRENGTH, this.repulsionConstant = l.DEFAULT_REPULSION_STRENGTH, this.gravityConstant = l.DEFAULT_GRAVITY_STRENGTH, this.compoundGravityConstant = l.DEFAULT_COMPOUND_GRAVITY_STRENGTH, this.gravityRangeFactor = l.DEFAULT_GRAVITY_RANGE_FACTOR, this.compoundGravityRangeFactor = l.DEFAULT_COMPOUND_GRAVITY_RANGE_FACTOR, this.prunedNodesAll = [], this.growTreeIterations = 0, this.afterGrowthIterations = 0, this.isTreeGrowing = !1, this.isGrowthFinished = !1, this.coolingCycle = 0, this.maxCoolingCycle = this.maxIterations / l.CONVERGENCE_CHECK_PERIOD, this.finalTemperature = l.CONVERGENCE_CHECK_PERIOD / this.maxIterations, this.coolingAdjuster = 1);
+					r.prototype.initParameters.call(this, arguments), this.isSubLayout || (this.idealEdgeLength = c.DEFAULT_EDGE_LENGTH < 10 ? 10 : c.DEFAULT_EDGE_LENGTH, this.useSmartIdealEdgeLengthCalculation = c.DEFAULT_USE_SMART_IDEAL_EDGE_LENGTH_CALCULATION, this.springConstant = l.DEFAULT_SPRING_STRENGTH, this.repulsionConstant = l.DEFAULT_REPULSION_STRENGTH, this.gravityConstant = l.DEFAULT_GRAVITY_STRENGTH, this.compoundGravityConstant = l.DEFAULT_COMPOUND_GRAVITY_STRENGTH, this.gravityRangeFactor = l.DEFAULT_GRAVITY_RANGE_FACTOR, this.compoundGravityRangeFactor = l.DEFAULT_COMPOUND_GRAVITY_RANGE_FACTOR, this.prunedNodesAll = [], this.growTreeIterations = 0, this.afterGrowthIterations = 0, this.isTreeGrowing = !1, this.isGrowthFinished = !1, this.coolingCycle = 0, this.maxCoolingCycle = this.maxIterations / l.CONVERGENCE_CHECK_PERIOD, this.finalTemperature = l.CONVERGENCE_CHECK_PERIOD / this.maxIterations, this.coolingAdjuster = 1);
 				}, v.prototype.layout = function() {
 					return u.DEFAULT_CREATE_BENDS_AS_NEEDED && (this.createBendpoints(), this.graphManager.resetAllEdges()), this.level = 0, this.classicLayout();
 				}, v.prototype.classicLayout = function() {
@@ -1537,21 +1535,27 @@ var o = /* @__PURE__ */ i(((e, t) => {
 					}
 					return this.initSpringEmbedder(), this.runSpringEmbedder(), !0;
 				}, v.prototype.tick = function() {
-					if (this.totalIterations++, this.totalIterations === this.maxIterations && !this.isTreeGrowing && !this.isGrowthFinished) if (this.prunedNodesAll.length > 0) this.isTreeGrowing = !0;
-					else return !0;
-					if (this.totalIterations % l.CONVERGENCE_CHECK_PERIOD == 0 && !this.isTreeGrowing && !this.isGrowthFinished) {
-						if (this.isConverged()) if (this.prunedNodesAll.length > 0) this.isTreeGrowing = !0;
+					if (this.totalIterations++, this.totalIterations === this.maxIterations && !this.isTreeGrowing && !this.isGrowthFinished) {
+						if (this.prunedNodesAll.length > 0) this.isTreeGrowing = !0;
 						else return !0;
+					}
+					if (this.totalIterations % l.CONVERGENCE_CHECK_PERIOD == 0 && !this.isTreeGrowing && !this.isGrowthFinished) {
+						if (this.isConverged()) {
+							if (this.prunedNodesAll.length > 0) this.isTreeGrowing = !0;
+							else return !0;
+						}
 						this.coolingCycle++, this.layoutQuality == 0 ? this.coolingAdjuster = this.coolingCycle : this.layoutQuality == 1 && (this.coolingAdjuster = this.coolingCycle / 3), this.coolingFactor = Math.max(this.initialCoolingFactor - this.coolingCycle ** +(Math.log(100 * (this.initialCoolingFactor - this.finalTemperature)) / Math.log(this.maxCoolingCycle)) / 100 * this.coolingAdjuster, this.finalTemperature), this.animationPeriod = Math.ceil(this.initialAnimationPeriod * Math.sqrt(this.coolingFactor));
 					}
 					if (this.isTreeGrowing) {
-						if (this.growTreeIterations % 10 == 0) if (this.prunedNodesAll.length > 0) {
-							this.graphManager.updateBounds(), this.updateGrid(), this.growTree(this.prunedNodesAll), this.graphManager.resetAllNodesToApplyGravitation();
-							var e = new Set(this.getAllNodes()), t = this.nodesWithGravity.filter(function(t) {
-								return e.has(t);
-							});
-							this.graphManager.setAllNodesToApplyGravitation(t), this.graphManager.updateBounds(), this.updateGrid(), this.coolingFactor = l.DEFAULT_COOLING_FACTOR_INCREMENTAL;
-						} else this.isTreeGrowing = !1, this.isGrowthFinished = !0;
+						if (this.growTreeIterations % 10 == 0) {
+							if (this.prunedNodesAll.length > 0) {
+								this.graphManager.updateBounds(), this.updateGrid(), this.growTree(this.prunedNodesAll), this.graphManager.resetAllNodesToApplyGravitation();
+								var e = new Set(this.getAllNodes()), t = this.nodesWithGravity.filter(function(t) {
+									return e.has(t);
+								});
+								this.graphManager.setAllNodesToApplyGravitation(t), this.graphManager.updateBounds(), this.updateGrid(), this.coolingFactor = l.DEFAULT_COOLING_FACTOR_INCREMENTAL;
+							} else this.isTreeGrowing = !1, this.isGrowthFinished = !0;
+						}
 						this.growTreeIterations++;
 					}
 					if (this.isGrowthFinished) {
@@ -1866,7 +1870,7 @@ var o = /* @__PURE__ */ i(((e, t) => {
 			})
 		]);
 	});
-})), c = /* @__PURE__ */ r((/* @__PURE__ */ i(((e, t) => {
+})), c = /* @__PURE__ */ r((/* @__PURE__ */ e(((e, t) => {
 	(function(n, r) {
 		typeof e == "object" && typeof t == "object" ? t.exports = r(s()) : typeof define == "function" && define.amd ? define(["cose-base"], r) : typeof e == "object" ? e.cytoscapeCoseBilkent = r(s()) : n.cytoscapeCoseBilkent = r(n.coseBase);
 	})(e, function(e) {
@@ -1937,7 +1941,7 @@ var o = /* @__PURE__ */ i(((e, t) => {
 				this.options = d(u, e), p(this.options);
 			}
 			var p = function(e) {
-				e.nodeRepulsion != null && (a.DEFAULT_REPULSION_STRENGTH = i.DEFAULT_REPULSION_STRENGTH = e.nodeRepulsion), e.idealEdgeLength != null && (a.DEFAULT_EDGE_LENGTH = i.DEFAULT_EDGE_LENGTH = e.idealEdgeLength), e.edgeElasticity != null && (a.DEFAULT_SPRING_STRENGTH = i.DEFAULT_SPRING_STRENGTH = e.edgeElasticity), e.nestingFactor != null && (a.PER_LEVEL_IDEAL_EDGE_LENGTH_FACTOR = i.PER_LEVEL_IDEAL_EDGE_LENGTH_FACTOR = e.nestingFactor), e.gravity != null && (a.DEFAULT_GRAVITY_STRENGTH = i.DEFAULT_GRAVITY_STRENGTH = e.gravity), e.numIter != null && (a.MAX_ITERATIONS = i.MAX_ITERATIONS = e.numIter), e.gravityRange != null && (a.DEFAULT_GRAVITY_RANGE_FACTOR = i.DEFAULT_GRAVITY_RANGE_FACTOR = e.gravityRange), e.gravityCompound != null && (a.DEFAULT_COMPOUND_GRAVITY_STRENGTH = i.DEFAULT_COMPOUND_GRAVITY_STRENGTH = e.gravityCompound), e.gravityRangeCompound != null && (a.DEFAULT_COMPOUND_GRAVITY_RANGE_FACTOR = i.DEFAULT_COMPOUND_GRAVITY_RANGE_FACTOR = e.gravityRangeCompound), e.initialEnergyOnIncremental != null && (a.DEFAULT_COOLING_FACTOR_INCREMENTAL = i.DEFAULT_COOLING_FACTOR_INCREMENTAL = e.initialEnergyOnIncremental), e.quality == "draft" ? r.QUALITY = 0 : e.quality == "proof" ? r.QUALITY = 2 : r.QUALITY = 1, a.NODE_DIMENSIONS_INCLUDE_LABELS = i.NODE_DIMENSIONS_INCLUDE_LABELS = r.NODE_DIMENSIONS_INCLUDE_LABELS = e.nodeDimensionsIncludeLabels, a.DEFAULT_INCREMENTAL = i.DEFAULT_INCREMENTAL = r.DEFAULT_INCREMENTAL = !e.randomize, a.ANIMATE = i.ANIMATE = r.ANIMATE = e.animate, a.TILE = e.tile, a.TILING_PADDING_VERTICAL = typeof e.tilingPaddingVertical == "function" ? e.tilingPaddingVertical.call() : e.tilingPaddingVertical, a.TILING_PADDING_HORIZONTAL = typeof e.tilingPaddingHorizontal == "function" ? e.tilingPaddingHorizontal.call() : e.tilingPaddingHorizontal;
+				e.nodeRepulsion != null && (a.DEFAULT_REPULSION_STRENGTH = i.DEFAULT_REPULSION_STRENGTH = e.nodeRepulsion), e.idealEdgeLength != null && (a.DEFAULT_EDGE_LENGTH = i.DEFAULT_EDGE_LENGTH = e.idealEdgeLength), e.edgeElasticity != null && (a.DEFAULT_SPRING_STRENGTH = i.DEFAULT_SPRING_STRENGTH = e.edgeElasticity), e.nestingFactor != null && (a.PER_LEVEL_IDEAL_EDGE_LENGTH_FACTOR = i.PER_LEVEL_IDEAL_EDGE_LENGTH_FACTOR = e.nestingFactor), e.gravity != null && (a.DEFAULT_GRAVITY_STRENGTH = i.DEFAULT_GRAVITY_STRENGTH = e.gravity), e.numIter != null && (a.MAX_ITERATIONS = i.MAX_ITERATIONS = e.numIter), e.gravityRange != null && (a.DEFAULT_GRAVITY_RANGE_FACTOR = i.DEFAULT_GRAVITY_RANGE_FACTOR = e.gravityRange), e.gravityCompound != null && (a.DEFAULT_COMPOUND_GRAVITY_STRENGTH = i.DEFAULT_COMPOUND_GRAVITY_STRENGTH = e.gravityCompound), e.gravityRangeCompound != null && (a.DEFAULT_COMPOUND_GRAVITY_RANGE_FACTOR = i.DEFAULT_COMPOUND_GRAVITY_RANGE_FACTOR = e.gravityRangeCompound), e.initialEnergyOnIncremental != null && (a.DEFAULT_COOLING_FACTOR_INCREMENTAL = i.DEFAULT_COOLING_FACTOR_INCREMENTAL = e.initialEnergyOnIncremental), r.QUALITY = e.quality == "draft" ? 0 : e.quality == "proof" ? 2 : 1, a.NODE_DIMENSIONS_INCLUDE_LABELS = i.NODE_DIMENSIONS_INCLUDE_LABELS = r.NODE_DIMENSIONS_INCLUDE_LABELS = e.nodeDimensionsIncludeLabels, a.DEFAULT_INCREMENTAL = i.DEFAULT_INCREMENTAL = r.DEFAULT_INCREMENTAL = !e.randomize, a.ANIMATE = i.ANIMATE = r.ANIMATE = e.animate, a.TILE = e.tile, a.TILING_PADDING_VERTICAL = typeof e.tilingPaddingVertical == "function" ? e.tilingPaddingVertical.call() : e.tilingPaddingVertical, a.TILING_PADDING_HORIZONTAL = typeof e.tilingPaddingHorizontal == "function" ? e.tilingPaddingHorizontal.call() : e.tilingPaddingHorizontal;
 			};
 			f.prototype.run = function() {
 				var e, t, n = this.options;
@@ -2064,7 +2068,7 @@ function l(e, t) {
 		});
 	});
 }
-t(l, "addNodes");
+i(l, "addNodes");
 function u(e, t) {
 	e.forEach((e) => {
 		let n = {
@@ -2084,8 +2088,8 @@ function u(e, t) {
 		});
 	});
 }
-t(u, "addEdges");
-function d(t) {
+i(u, "addEdges");
+function d(e) {
 	return new Promise((r) => {
 		let i = n("body").append("div").attr("id", "cy").attr("style", "display:none"), o = a({
 			container: document.getElementById("cy"),
@@ -2094,7 +2098,7 @@ function d(t) {
 				style: { "curve-style": "bezier" }
 			}]
 		});
-		i.remove(), l(t.nodes, o), u(t.edges, o), o.nodes().forEach(function(e) {
+		i.remove(), l(e.nodes, o), u(e.edges, o), o.nodes().forEach(function(e) {
 			e.layoutDimensions = () => {
 				let t = e.data();
 				return {
@@ -2107,12 +2111,12 @@ function d(t) {
 			quality: "proof",
 			styleEnabled: !1,
 			animate: !1
-		}).run(), o.ready((t) => {
-			e.info("Cytoscape ready", t), r(o);
+		}).run(), o.ready((e) => {
+			t.info("Cytoscape ready", e), r(o);
 		});
 	});
 }
-t(d, "createCytoscapeInstance");
+i(d, "createCytoscapeInstance");
 function f(e) {
 	return e.nodes().map((e) => {
 		let t = e.data(), n = e.position(), r = {
@@ -2125,7 +2129,7 @@ function f(e) {
 		}), r;
 	});
 }
-t(f, "extractPositionedNodes");
+i(f, "extractPositionedNodes");
 function p(e) {
 	return e.edges().map((e) => {
 		let t = e.data(), n = e._private.rscratch, r = {
@@ -2148,21 +2152,21 @@ function p(e) {
 		}), r;
 	});
 }
-t(p, "extractPositionedEdges");
-async function m(t, n) {
-	e.debug("Starting cose-bilkent layout algorithm");
+i(p, "extractPositionedEdges");
+async function m(e, n) {
+	t.debug("Starting cose-bilkent layout algorithm");
 	try {
-		h(t);
-		let n = await d(t), r = f(n), i = p(n);
-		return e.debug(`Layout completed: ${r.length} nodes, ${i.length} edges`), {
+		h(e);
+		let n = await d(e), r = f(n), i = p(n);
+		return t.debug(`Layout completed: ${r.length} nodes, ${i.length} edges`), {
 			nodes: r,
 			edges: i
 		};
-	} catch (t) {
-		throw e.error("Error in cose-bilkent layout algorithm:", t), t;
+	} catch (e) {
+		throw t.error("Error in cose-bilkent layout algorithm:", e), e;
 	}
 }
-t(m, "executeCoseBilkentLayout");
+i(m, "executeCoseBilkentLayout");
 function h(e) {
 	if (!e) throw Error("Layout data is required");
 	if (!e.config) throw Error("Configuration is required in layout data");
@@ -2171,8 +2175,8 @@ function h(e) {
 	if (!Array.isArray(e.edges)) throw Error("Edges array is required in layout data");
 	return !0;
 }
-t(h, "validateLayoutData");
-var g = /* @__PURE__ */ t(async (e, t, { insertCluster: n, insertEdge: r, insertEdgeLabel: i, insertMarkers: a, insertNode: o, log: s, positionEdgeLabel: c }, { algorithm: l }) => {
+i(h, "validateLayoutData");
+var g = /* @__PURE__ */ i(async (e, t, { insertCluster: n, insertEdge: r, insertEdgeLabel: i, insertMarkers: a, insertNode: o, log: s, positionEdgeLabel: c }, { algorithm: l }) => {
 	let u = {}, d = {}, f = t.select("g");
 	a(f, e.markers, e.type, e.diagramId);
 	let p = f.insert("g").attr("class", "subgraphs"), h = f.insert("g").attr("class", "edgePaths"), g = f.insert("g").attr("class", "edgeLabels"), _ = f.insert("g").attr("class", "nodes");

package/dist/cynefin-OW5HDTMX-BJXlKro0.js

@@ -0,0 +1,3 @@
+import "./chunk-FOHPRMQF-LRqOLsSw.js";
+import { A as e } from "./mermaid-parser.core-BwVmI_Rq.js";
+export { e as createCynefinServices };