@likec4/core 1.26.1 → 1.27.0

package/dist/shared/{core.BqezHsjR.mjs → core.Cu-UdkSl.mjs}

@@ -1,8 +1,6 @@
-import { u as u$1, i as invariant } from './core.DRxv3HIl.mjs';
-
-var e={done:true,hasNext:false},s={done:false,hasNext:false},a=()=>e;
-
-function C(t,...o){let n=t,u=o.map(e=>"lazy"in e?A(e):void 0),p=0;for(;p<o.length;){if(u[p]===void 0||!B(n)){let i=o[p];n=i(n),p+=1;continue}let r=[];for(let i=p;i<o.length;i++){let l=u[i];if(l===void 0||(r.push(l),l.isSingle))break}let a=[];for(let i of n)if(y(i,a,r))break;let{isSingle:s}=r.at(-1);n=s?a[0]:a,p+=r.length;}return n}function y(t,o,n){if(n.length===0)return o.push(t),false;let u=t,p=s,e=false;for(let[r,a]of n.entries()){let{index:s,items:i}=a;if(i.push(u),p=a(u,s,i),a.index+=1,p.hasNext){if(p.hasMany??false){for(let l of p.next)if(y(l,o,n.slice(r+1)))return  true;return e}u=p.next;}if(!p.hasNext)break;p.done&&(e=true);}return p.hasNext&&o.push(u),e}function A(t){let{lazy:o,lazyArgs:n}=t,u=o(...n);return Object.assign(u,{isSingle:o.single??false,index:0,items:[]})}function B(t){return typeof t=="string"||typeof t=="object"&&t!==null&&Symbol.iterator in t}
+import { j as getDefaultExportFromCjs, C, h as t } from './core.CQXU9DF7.mjs';
+import { u as u$1 } from './core.DbRvwARP.mjs';
+import { i as invariant } from './core.C-YXI-43.mjs';
 
 function d(...e){return u$1(i$2,e,o$1)}var i$2=(e,n)=>e.length<n.length?e.map((t,r)=>[t,n[r]]):n.map((t,r)=>[e[r],t]),o$1=e=>(n,t)=>({hasNext:true,next:[n,e[t]],done:t>=e.length-1});
 
@@ -12,18 +10,10 @@ function u(...e){return u$1(i,e)}function i(e,a){let n=[];for(let[o,r]of e.entri
 
 function m(...a){return u$1(o,a,p)}var o=(a,e)=>a.map(e),p=a=>(e,t,r)=>({done:false,hasNext:true,next:a(e,t,r)});
 
-function t$1(r){return typeof r=="string"}
-
-function t(n){return typeof n=="function"}
-
 function l(n){return n!=null}
 
 function n(e){return e!==void 0}
 
-function getDefaultExportFromCjs (x) {
-	return x && x.__esModule && Object.prototype.hasOwnProperty.call(x, 'default') ? x['default'] : x;
-}
-
 var support = {};
 
 var hasRequiredSupport;
@@ -119,180 +109,6 @@ function requireForeach () {
 	return foreach;
 }
 
-/**
- * Mnemonist DefaultMap
- * =====================
- *
- * JavaScript implementation of a default map that will return a constructed
- * value any time one tries to access an inexisting key. It's quite similar
- * to python's defaultdict.
- */
-
-var defaultMap;
-var hasRequiredDefaultMap;
-
-function requireDefaultMap () {
-	if (hasRequiredDefaultMap) return defaultMap;
-	hasRequiredDefaultMap = 1;
-	/**
-	 * DefaultMap.
-	 *
-	 * @constructor
-	 */
-	function DefaultMap(factory) {
-	  if (typeof factory !== 'function')
-	    throw new Error('mnemonist/DefaultMap.constructor: expecting a function.');
-
-	  this.items = new Map();
-	  this.factory = factory;
-	  this.size = 0;
-	}
-
-	/**
-	 * Method used to clear the structure.
-	 *
-	 * @return {undefined}
-	 */
-	DefaultMap.prototype.clear = function() {
-
-	  // Properties
-	  this.items.clear();
-	  this.size = 0;
-	};
-
-	/**
-	 * Method used to get the value set for given key. If the key does not exist,
-	 * the value will be created using the provided factory.
-	 *
-	 * @param  {any} key - Target key.
-	 * @return {any}
-	 */
-	DefaultMap.prototype.get = function(key) {
-	  var value = this.items.get(key);
-
-	  if (typeof value === 'undefined') {
-	    value = this.factory(key, this.size);
-	    this.items.set(key, value);
-	    this.size++;
-	  }
-
-	  return value;
-	};
-
-	/**
-	 * Method used to get the value set for given key. If the key does not exist,
-	 * a value won't be created.
-	 *
-	 * @param  {any} key - Target key.
-	 * @return {any}
-	 */
-	DefaultMap.prototype.peek = function(key) {
-	  return this.items.get(key);
-	};
-
-	/**
-	 * Method used to set a value for given key.
-	 *
-	 * @param  {any} key   - Target key.
-	 * @param  {any} value - Value.
-	 * @return {DefaultMap}
-	 */
-	DefaultMap.prototype.set = function(key, value) {
-	  this.items.set(key, value);
-	  this.size = this.items.size;
-
-	  return this;
-	};
-
-	/**
-	 * Method used to test the existence of a key in the map.
-	 *
-	 * @param  {any} key   - Target key.
-	 * @return {boolean}
-	 */
-	DefaultMap.prototype.has = function(key) {
-	  return this.items.has(key);
-	};
-
-	/**
-	 * Method used to delete target key.
-	 *
-	 * @param  {any} key   - Target key.
-	 * @return {boolean}
-	 */
-	DefaultMap.prototype.delete = function(key) {
-	  var deleted = this.items.delete(key);
-
-	  this.size = this.items.size;
-
-	  return deleted;
-	};
-
-	/**
-	 * Method used to iterate over each of the key/value pairs.
-	 *
-	 * @param  {function}  callback - Function to call for each item.
-	 * @param  {object}    scope    - Optional scope.
-	 * @return {undefined}
-	 */
-	DefaultMap.prototype.forEach = function(callback, scope) {
-	  scope = arguments.length > 1 ? scope : this;
-
-	  this.items.forEach(callback, scope);
-	};
-
-	/**
-	 * Iterators.
-	 */
-	DefaultMap.prototype.entries = function() {
-	  return this.items.entries();
-	};
-
-	DefaultMap.prototype.keys = function() {
-	  return this.items.keys();
-	};
-
-	DefaultMap.prototype.values = function() {
-	  return this.items.values();
-	};
-
-	/**
-	 * Attaching the #.entries method to Symbol.iterator if possible.
-	 */
-	if (typeof Symbol !== 'undefined')
-	  DefaultMap.prototype[Symbol.iterator] = DefaultMap.prototype.entries;
-
-	/**
-	 * Convenience known methods.
-	 */
-	DefaultMap.prototype.inspect = function() {
-	  return this.items;
-	};
-
-	if (typeof Symbol !== 'undefined')
-	  DefaultMap.prototype[Symbol.for('nodejs.util.inspect.custom')] = DefaultMap.prototype.inspect;
-
-	/**
-	 * Typical factories.
-	 */
-	DefaultMap.autoIncrement = function() {
-	  var i = 0;
-
-	  return function() {
-	    return i++;
-	  };
-	};
-
-	/**
-	 * Exporting.
-	 */
-	defaultMap = DefaultMap;
-	return defaultMap;
-}
-
-var defaultMapExports = /*@__PURE__*/ requireDefaultMap();
-const DefaultMap = /*@__PURE__*/getDefaultExportFromCjs(defaultMapExports);
-
 /**
  * Obliterator Iterator Class
  * ===========================
@@ -1003,249 +819,6 @@ function commonHead(sources, targets, equals) {
   );
 }
 
-var naturalCompareLite = {exports: {}};
-
-var hasRequiredNaturalCompareLite;
-
-function requireNaturalCompareLite () {
-	if (hasRequiredNaturalCompareLite) return naturalCompareLite.exports;
-	hasRequiredNaturalCompareLite = 1;
-	/*
-	 * @version    1.4.0
-	 * @date       2015-10-26
-	 * @stability  3 - Stable
-	 * @author     Lauri Rooden (https://github.com/litejs/natural-compare-lite)
-	 * @license    MIT License
-	 */
-
-
-	var naturalCompare = function(a, b) {
-		var i, codeA
-		, codeB = 1
-		, posA = 0
-		, posB = 0
-		, alphabet = String.alphabet;
-
-		function getCode(str, pos, code) {
-			if (code) {
-				for (i = pos; code = getCode(str, i), code < 76 && code > 65;) ++i;
-				return +str.slice(pos - 1, i)
-			}
-			code = alphabet && alphabet.indexOf(str.charAt(pos));
-			return code > -1 ? code + 76 : ((code = str.charCodeAt(pos) || 0), code < 45 || code > 127) ? code
-				: code < 46 ? 65               // -
-				: code < 48 ? code - 1
-				: code < 58 ? code + 18        // 0-9
-				: code < 65 ? code - 11
-				: code < 91 ? code + 11        // A-Z
-				: code < 97 ? code - 37
-				: code < 123 ? code + 5        // a-z
-				: code - 63
-		}
-
-
-		if ((a+="") != (b+="")) for (;codeB;) {
-			codeA = getCode(a, posA++);
-			codeB = getCode(b, posB++);
-
-			if (codeA < 76 && codeB < 76 && codeA > 66 && codeB > 66) {
-				codeA = getCode(a, posA, posA);
-				codeB = getCode(b, posB, posA = i);
-				posB = i;
-			}
-
-			if (codeA != codeB) return (codeA < codeB) ? -1 : 1
-		}
-		return 0
-	};
-
-	try {
-		naturalCompareLite.exports = naturalCompare;
-	} catch (e) {
-		String.naturalCompare = naturalCompare;
-	}
-	return naturalCompareLite.exports;
-}
-
-var naturalCompareLiteExports = requireNaturalCompareLite();
-const compare = /*@__PURE__*/getDefaultExportFromCjs(naturalCompareLiteExports);
-
-function compareNatural(a, b) {
-  if (a === b) return 0;
-  if (t$1(a)) {
-    if (t$1(b)) {
-      return compare(a, b);
-    }
-    return 1;
-  }
-  return t$1(b) ? -1 : 0;
-}
-
-function isString(value) {
-  return value != null && typeof value === "string";
-}
-function isNonEmptyArray(arr) {
-  return !!arr && Array.isArray(arr) && arr.length > 0;
-}
-
-function parentFqn(fqn) {
-  const lastDot = fqn.lastIndexOf(".");
-  if (lastDot > 0) {
-    return fqn.slice(0, lastDot);
-  }
-  return null;
-}
-function nameFromFqn(fqn) {
-  const lastDot = fqn.lastIndexOf(".");
-  if (lastDot > 0) {
-    return fqn.slice(lastDot + 1);
-  } else {
-    return fqn;
-  }
-}
-const asString = (e) => isString(e) ? e : e.id;
-function isAncestor(arg1, arg2) {
-  const arg1Id = asString(arg1);
-  if (arg2) {
-    const arg2Id = asString(arg2);
-    return arg2Id.startsWith(arg1Id + ".");
-  }
-  return (ancestor) => {
-    const ancestorId = asString(ancestor);
-    return arg1Id.startsWith(ancestorId + ".");
-  };
-}
-function isSameHierarchy(one, another) {
-  if (!another) {
-    return (b) => isSameHierarchy(one, b);
-  }
-  const first = asString(one);
-  const second = asString(another);
-  return first === second || second.startsWith(first + ".") || first.startsWith(second + ".");
-}
-function isDescendantOf(descedant, ancestor) {
-  if (!ancestor) {
-    return (d) => isAncestor(descedant, d);
-  }
-  return isAncestor(ancestor, descedant);
-}
-function hierarchyLevel(elementOfFqn) {
-  const first = isString(elementOfFqn) ? elementOfFqn : elementOfFqn.id;
-  return first.split(".").length;
-}
-function hierarchyDistance(one, another) {
-  const first = isString(one) ? one : one.id;
-  const second = isString(another) ? another : another.id;
-  if (first === second) {
-    return 0;
-  }
-  const firstDepth = hierarchyLevel(first);
-  const secondDepth = hierarchyLevel(second);
-  if (isSameHierarchy(first, second)) {
-    return Math.abs(firstDepth - secondDepth);
-  }
-  const ancestor = commonAncestor(first, second);
-  const ancestorDepth = ancestor ? hierarchyLevel(ancestor) : 0;
-  return firstDepth + secondDepth - (2 * ancestorDepth + 1);
-}
-function commonAncestor(first, second) {
-  const a = first.split(".");
-  if (a.length < 2) {
-    return null;
-  }
-  const b = second.split(".");
-  if (b.length < 2) {
-    return null;
-  }
-  let ancestor = [];
-  for (let i = 0; i < Math.min(a.length, b.length) - 1 && a[i] === b[i]; i++) {
-    ancestor.push(a[i]);
-  }
-  if (ancestor.length === 0) {
-    return null;
-  }
-  return ancestor.join(".");
-}
-function ancestorsFqn(fqn) {
-  const path = fqn.split(".");
-  path.pop();
-  if (path.length === 0) {
-    return [];
-  }
-  return path.reduce((acc, part, idx) => {
-    if (idx === 0) {
-      acc.push(part);
-      return acc;
-    }
-    acc.unshift(`${acc[0]}.${part}`);
-    return acc;
-  }, []);
-}
-function compareFqnHierarchically(a, b) {
-  const depthA = a.split(".").length;
-  const depthB = b.split(".").length;
-  switch (true) {
-    case depthA > depthB: {
-      return 1;
-    }
-    case depthA < depthB: {
-      return -1;
-    }
-    default: {
-      return 0;
-    }
-  }
-}
-function compareByFqnHierarchically(a, b) {
-  return compareFqnHierarchically(a.id, b.id);
-}
-function sortByFqnHierarchically(array) {
-  return array.map((item) => ({ item, fqn: item.id.split(".") })).sort((a, b) => {
-    return a.fqn.length - b.fqn.length;
-  }).map(({ item }) => item);
-}
-function findTopAncestor(items, item) {
-  let parent = item;
-  for (const e of items) {
-    if (isAncestor(e, parent)) {
-      parent = e;
-    }
-  }
-  return parent !== item ? parent : null;
-}
-function sortParentsFirst(array) {
-  const result = [];
-  const items = [...array];
-  let item;
-  while (item = items.shift()) {
-    let parent;
-    while (parent = findTopAncestor(items, item)) {
-      result.push(items.splice(items.indexOf(parent), 1)[0]);
-    }
-    result.push(item);
-  }
-  return result;
-}
-function sortNaturalByFqn(array, sort) {
-  if (!array || isString(array)) {
-    const dir2 = array ?? "asc";
-    return (arr) => sortNaturalByFqn(arr, dir2);
-  }
-  const dir = sort === "desc" ? -1 : 1;
-  return array.map((item) => ({ item, fqn: item.id.split(".") })).sort((a, b) => {
-    if (a.fqn.length !== b.fqn.length) {
-      return (a.fqn.length - b.fqn.length) * dir;
-    }
-    for (let i = 0; i < a.fqn.length; i++) {
-      const compare = compareNatural(a.fqn[i], b.fqn[i]);
-      if (compare !== 0) {
-        return compare;
-      }
-    }
-    return 0;
-  }).map(({ item }) => item);
-}
-
 function getOrCreate(map, key, create) {
   let entry = map.get(key);
   if (!entry) {
@@ -1259,23 +832,6 @@ function isIterable(something) {
   return l(something) && typeof something === "object" && Symbol.iterator in something;
 }
 
-function ifilter(arg1, arg2) {
-  const pred = arg2 ?? arg1;
-  invariant(t(pred));
-  function* _filter(iter) {
-    for (const value of iter) {
-      if (pred(value)) {
-        yield value;
-      }
-    }
-    return;
-  }
-  if (!arg2) {
-    return _filter;
-  }
-  return _filter(arg1);
-}
-
 function ifind(arg1, arg2) {
   const pred = arg2 ?? arg1;
   invariant(t(pred));
@@ -1303,21 +859,6 @@ function* _iflat(iterable) {
   return;
 }
 
-function imap(arg1, arg2) {
-  const mapper = arg2 ?? arg1;
-  invariant(t(mapper));
-  function* _map(iter) {
-    for (const value of iter) {
-      yield mapper(value);
-    }
-    return;
-  }
-  if (!arg2) {
-    return _map;
-  }
-  return _map(arg1);
-}
-
 function isome(arg1, arg2) {
   const pred = arg2 ?? arg1;
   invariant(t(pred));
@@ -1335,19 +876,6 @@ function isome(arg1, arg2) {
   return _some(arg1);
 }
 
-function toArray(iterable) {
-  if (iterable) {
-    return Array.from(iterable);
-  }
-  return (it) => Array.from(it);
-}
-function toSet(iterable) {
-  if (iterable) {
-    return new Set(iterable);
-  }
-  return (it) => new Set(it);
-}
-
 function iunique(iterable) {
   return iterable ? _iunique(iterable) : _iunique;
 }
@@ -1451,6 +979,17 @@ function requireObject_hash () {
 }
 
 var object_hashExports = requireObject_hash();
-const objectHash = /*@__PURE__*/getDefaultExportFromCjs(object_hashExports);
+const objecthash = /*@__PURE__*/getDefaultExportFromCjs(object_hashExports);
+
+function objectHash(value) {
+  invariant(
+    typeof value === "object" && l(value),
+    "objectHash: value must be an object"
+  );
+  return objecthash(value, {
+    ignoreUnknown: true,
+    respectType: false
+  });
+}
 
-export { ifilter as A, iflat as B, imap as C, DefaultMap as D, isIterable as E, isome as F, iunique as G, toArray as H, difference as I, equals as J, intersection as K, symmetricDifference as L, union as M, stringHash as N, objectHash as O, C as P, s as Q, a as R, Stack as S, getDefaultExportFromCjs as T, requireForeach as U, requireIterator as V, u as W, d as X, n as Y, hasIntersection as Z, i$1 as a, t$1 as b, isSameHierarchy as c, t as d, commonHead as e, compareNatural as f, ancestorsFqn as g, commonAncestor as h, ifind as i, compareByFqnHierarchically as j, compareFqnHierarchically as k, l, m, nameFromFqn as n, hierarchyDistance as o, parentFqn as p, hierarchyLevel as q, isAncestor as r, isDescendantOf as s, toSet as t, sortByFqnHierarchically as u, sortNaturalByFqn as v, sortParentsFirst as w, getOrCreate as x, isNonEmptyArray as y, isString as z };
+export { Stack as S, ifind as a, iflat as b, commonHead as c, isIterable as d, isome as e, iunique as f, getOrCreate as g, difference as h, i$1 as i, equals as j, intersection as k, l, m, stringHash as n, objectHash as o, requireIterator as p, u as q, requireForeach as r, symmetricDifference as s, d as t, union as u, n as v, hasIntersection as w };

package/dist/shared/core.DbRvwARP.mjs

@@ -0,0 +1,5 @@
+function u$1(o,n,a){let t=r=>o(r,...n);return a===void 0?t:Object.assign(t,{lazy:a,lazyArgs:n})}
+
+function u(r,n,o){let a=r.length-n.length;if(a===0)return r(...n);if(a===1)return u$1(r,n,o);throw new Error("Wrong number of arguments")}
+
+export { u };

package/dist/shared/{core.oI7caxVx.d.mts → core.Uz54YXx0.d.mts}

@@ -1,4 +1,4 @@
-import { E as ElementModel, d as DeploymentElementModel, A as AnyAux, e as DeploymentNodeModel, D as DeployedInstanceModel, j as RelationshipsAccum, R as RelationshipModel, f as DeploymentRelationModel } from './core.Brmu7VBL.mjs';
+import { E as ElementModel, d as DeploymentElementModel, A as AnyAux, e as DeploymentNodeModel, D as DeployedInstanceModel, j as RelationshipsAccum, R as RelationshipModel, f as DeploymentRelationModel } from './core.CtloVwbo.mjs';
 import { F as Fqn, a as IteratorLike } from './core.30yYKXcZ.mjs';
 
 interface Connection<Elem = ElementModel | DeploymentElementModel, Id = string> {

package/dist/shared/{core.CcjDE4j7.mjs → core.zj2huD5x.mjs}

@@ -1,6 +1,8 @@
-import { D as DefaultElementShape, c as DefaultThemeColor, h as DefaultShapeSize, ab as o$8, t as isElementWhere, Q as whereOperatorAsPredicate, G as isWildcard, q as isElementKindExpr, s as isElementTagExpr, n as n$4, u as isExpandedElementExpr, r as isElementRef, l as isCustomElement, a9 as isViewRuleStyle, ac as y$2, V as ComputedNode, E as ElementKind, S as DefaultArrowType, I as FqnExpr, R as RelationExpr, o as o$9, a8 as isViewRulePredicate, a4 as isViewRuleAutoLayout, a7 as isViewRuleGroup, a5 as isViewRuleGlobalPredicateRef, a6 as isViewRuleGlobalStyle, aa as stepEdgeId, a2 as isDynamicViewParallelSteps, T as DefaultLineStyle, U as DefaultRelationshipColor, x as isOutgoing$1, v as isIncoming$1, w as isInOut, y as isRelation, F as isRelationWhere, m as isCustomRelationExpr, C as isRelationPredicateExpr, b as isElementPredicateExpr, a as isElementView, a1 as isDynamicView, a0 as isDeploymentView, d as DeploymentElement, Y as extractStep, a3 as isStepEdgeId, e as isScopedElementView } from './core.yND74qFI.mjs';
-import { P as C, Q as s$1, R as a$5, q as hierarchyLevel, r as isAncestor, h as commonAncestor, v as sortNaturalByFqn, m as m$3, e as commonHead, T as getDefaultExportFromCjs, U as requireForeach, V as requireIterator, W as u$7, O as objectHash, K as intersection, I as difference, M as union, N as stringHash, J as equals, s as isDescendantOf, z as isString, c as isSameHierarchy, F as isome, A as ifilter, E as isIterable, t as toSet, w as sortParentsFirst, H as toArray, D as DefaultMap, C as imap, a as i$9, X as d$6, p as parentFqn, Y as n$5, j as compareByFqnHierarchically, y as isNonEmptyArray, f as compareNatural, n as nameFromFqn, b as t$6, l as l$7, Z as hasIntersection, u as sortByFqnHierarchically, g as ancestorsFqn, S as Stack, G as iunique, B as iflat, x as getOrCreate, i as ifind } from './core.BqezHsjR.mjs';
-import { u as u$6, a as nonNullable, i as invariant, n as nonexhaustive } from './core.DRxv3HIl.mjs';
+import { D as DefaultElementShape, c as DefaultThemeColor, h as DefaultShapeSize, ab as o$8, t as isElementWhere, Q as whereOperatorAsPredicate, G as isWildcard, q as isElementKindExpr, s as isElementTagExpr, n as n$4, u as isExpandedElementExpr, r as isElementRef, l as isCustomElement, a9 as isViewRuleStyle, ac as y$2, V as ComputedNode, E as ElementKind, S as DefaultArrowType, I as FqnExpr, R as RelationExpr, o as o$9, a8 as isViewRulePredicate, a4 as isViewRuleAutoLayout, a7 as isViewRuleGroup, a5 as isViewRuleGlobalPredicateRef, a6 as isViewRuleGlobalStyle, aa as stepEdgeId, a2 as isDynamicViewParallelSteps, T as DefaultLineStyle, U as DefaultRelationshipColor, x as isOutgoing$1, v as isIncoming$1, w as isInOut, y as isRelation, F as isRelationWhere, m as isCustomRelationExpr, C as isRelationPredicateExpr, b as isElementPredicateExpr, a as isElementView, a1 as isDynamicView, a0 as isDeploymentView, d as DeploymentElement, Y as extractStep, a3 as isStepEdgeId, e as isScopedElementView } from './core.BMep80lJ.mjs';
+import { C, y as s$1, z as a$5, u as hierarchyLevel, a as isAncestor, m as commonAncestor, w as sortNaturalByFqn, j as getDefaultExportFromCjs, i as isDescendantOf, x as isString, g as isSameHierarchy, c as ifilter, t as toSet, s as sortParentsFirst, b as toArray, D as DefaultMap, d as imap, p as parentFqn, o as compareByFqnHierarchically, e as isNonEmptyArray, k as compareNatural, n as nameFromFqn, f as t$6, v as sortByFqnHierarchically, l as ancestorsFqn } from './core.CQXU9DF7.mjs';
+import { u as u$6 } from './core.DbRvwARP.mjs';
+import { n as nonNullable, i as invariant, a as nonexhaustive } from './core.C-YXI-43.mjs';
+import { m as m$3, c as commonHead, r as requireForeach, p as requireIterator, q as u$7, o as objectHash, k as intersection, h as difference, u as union, n as stringHash, j as equals, e as isome, d as isIterable, i as i$9, t as d$6, v as n$5, l as l$7, w as hasIntersection, S as Stack, f as iunique, b as iflat, g as getOrCreate, a as ifind } from './core.Cu-UdkSl.mjs';
 
 function y$1(t,i){let a=i.length-t.length;if(a===1){let[n,...r]=i;return C(n,{lazy:t,lazyArgs:r})}if(a===0){let n={lazy:t,lazyArgs:i};return Object.assign(e=>C(e,n),n)}throw new Error("Wrong number of arguments")}
 
@@ -50,7 +52,7 @@ function n(e){return e===void 0?true:typeof e=="string"||Array.isArray(e)?e.leng
 
 function e(o){return typeof o=="boolean"}
 
-function i$2(...e){return u$6(p,e)}var p=(e,a)=>{let n={};for(let[d,t]of e.entries()){let y=a(t,d,e);if(y!==void 0){let{[y]:r}=n;r===void 0&&(r=[],n[y]=r),r.push(t);}}return n};
+function i$2(...e){return u$6(p,e)}var p=(e,a)=>{let n=new Map;for(let[d,t]of e.entries()){let y=a(t,d,e);if(y!==void 0){let r=n.get(y);r===void 0&&(r=[],n.set(y,r)),r.push(t);}}return Object.fromEntries(n)};
 
 function k(...n){return u$6(u$2,n)}function u$2(n,e){if(n===e||Object.is(n,e))return  true;if(typeof n!="object"||typeof e!="object"||n===null||e===null||Object.getPrototypeOf(n)!==Object.getPrototypeOf(e))return  false;if(Array.isArray(n))return l$2(n,e);if(n instanceof Map)return a$1(n,e);if(n instanceof Set)return c(n,e);if(n instanceof Date)return n.getTime()===e.getTime();if(n instanceof RegExp)return n.toString()===e.toString();if(Object.keys(n).length!==Object.keys(e).length)return  false;for(let[r,t]of Object.entries(n))if(!(r in e)||!u$2(t,e[r]))return  false;return  true}function l$2(n,e){if(n.length!==e.length)return  false;for(let[r,t]of n.entries())if(!u$2(t,e[r]))return  false;return  true}function a$1(n,e){if(n.size!==e.size)return  false;for(let[r,t]of n.entries())if(!e.has(r)||!u$2(t,e.get(r)))return  false;return  true}function c(n,e){if(n.size!==e.size)return  false;let r=[...e];for(let t of n){let o=false;for(let[s,f]of r.entries())if(u$2(t,f)){o=true,r.splice(s,1);break}if(!o)return  false}return  true}
 
@@ -75,9 +77,11 @@ class ElementModel {
     this.$model = $model;
     this.$element = $element;
     this.id = this.$element.id;
+    this._literalId = this.$element.id;
     this.hierarchyLevel = hierarchyLevel(this.id);
   }
   id;
+  _literalId;
   hierarchyLevel;
   get parent() {
     return this.$model.parent(this);
@@ -1470,10 +1474,7 @@ function calcViewLayoutHash(view) {
       l$3(({ source, target, ...edge }) => [`${source}:${target}`, edge])
     )
   };
-  view.hash = objectHash(tohash, {
-    ignoreUnknown: true,
-    respectType: false
-  });
+  view.hash = objectHash(tohash);
   return view;
 }
 
@@ -4653,11 +4654,8 @@ class DynamicViewCompute {
       relations,
       tags,
       navigateTo: derivedNavigateTo,
-      head,
-      tail,
       color,
-      line,
-      notation
+      line
     } = this.findRelations(source, target);
     const navigateTo = n$2(stepNavigateTo) && stepNavigateTo !== this.view.id ? stepNavigateTo : derivedNavigateTo;
     this.steps.push({
@@ -4670,11 +4668,8 @@ class DynamicViewCompute {
       isBackward: isBackward ?? false,
       ...navigateTo ? { navigateTo } : {},
       ...tags ? { tags } : {},
-      ...head ? { head } : {},
-      ...tail ? { tail } : {},
       ...color ? { color } : {},
-      ...line ? { line } : {},
-      ...notation ? { notation } : {}
+      ...line ? { line } : {}
     });
   }
   compute() {
@@ -4793,11 +4788,8 @@ class DynamicViewCompute {
         tags: null,
         relations: null,
         navigateTo: null,
-        tail: null,
-        head: null,
         color: null,
-        line: null,
-        notation: null
+        line: null
       };
     }
     const alltags = C(
@@ -4822,17 +4814,12 @@ class DynamicViewCompute {
       relationships,
       l$5((acc, { title, $relationship: r }) => {
         n$2(title) && acc.title.add(title);
-        n$2(r.tail) && acc.tail.add(r.tail);
-        n$2(r.head) && acc.head.add(r.head);
         n$2(r.color) && acc.color.add(r.color);
         n$2(r.line) && acc.line.add(r.line);
         return acc;
       }, {
-        tail: /* @__PURE__ */ new Set(),
-        head: /* @__PURE__ */ new Set(),
         color: /* @__PURE__ */ new Set(),
         line: /* @__PURE__ */ new Set(),
-        notation: /* @__PURE__ */ new Set(),
         title: /* @__PURE__ */ new Set()
       })
     );
@@ -4841,11 +4828,8 @@ class DynamicViewCompute {
       relations,
       navigateTo: navigateTo ?? null,
       title: t$2([...commonProperties.title]) ?? null,
-      tail: t$2([...commonProperties.tail]) ?? null,
-      head: t$2([...commonProperties.head]) ?? null,
       color: t$2([...commonProperties.color]) ?? null,
-      line: t$2([...commonProperties.line]) ?? null,
-      notation: t$2([...commonProperties.notation]) ?? null
+      line: t$2([...commonProperties.line]) ?? null
     };
   }
 }
@@ -6849,6 +6833,9 @@ class NodeModel {
   get navigateTo() {
     return this.$node.navigateTo ? this.$view.$model.view(this.$node.navigateTo) : null;
   }
+  get style() {
+    return this.$node.style;
+  }
   /**
    * Get all ancestor elements (i.e. parent, parent’s parent, etc.)
    * (from closest to root)
@@ -7476,4 +7463,4 @@ class LikeC4Model {
   });
 })(LikeC4Model || (LikeC4Model = {}));
 
-export { isNestedConnection as A, isOutgoing as B, Connection as C, DeployedInstanceModel as D, EdgeModel as E, mergeConnections as F, Graph as G, find$1 as H, sortConnectionsByBoundaryHierarchy as I, sortDeepestFirst as J, isDeployedInstance as K, LikeC4Model as L, isDeploymentNode as M, NodeModel as N, RelationshipModel as R, computeViews as a, ConnectionModel as b, computeView as c, d$2 as d, DeploymentConnectionModel as e, DeploymentNodeModel as f, DeploymentRelationModel as g, ElementModel as h, i$3 as i, LikeC4DeploymentModel as j, LikeC4ViewModel as k, l$3 as l, find as m, differenceConnections as n, findAscendingConnections as o, findDeepestNestedConnection as p, findDescendantConnections as q, r$3 as r, hasSameSource as s, topologicalSortExports as t, unsafeComputeView as u, hasSameSourceTarget as v, willCreateCycle as w, hasSameTarget as x, isAnyInOut as y, isIncoming as z };
+export { isIncoming as A, isNestedConnection as B, Connection as C, DeployedInstanceModel as D, EdgeModel as E, isOutgoing as F, Graph as G, mergeConnections as H, find$1 as I, sortConnectionsByBoundaryHierarchy as J, sortDeepestFirst as K, LikeC4Model as L, isDeployedInstance as M, NodeModel as N, isDeploymentNode as O, RelationshipModel as R, i$3 as a, computeViews as b, computeView as c, d$2 as d, ConnectionModel as e, DeploymentConnectionModel as f, DeploymentNodeModel as g, DeploymentRelationModel as h, i$8 as i, ElementModel as j, LikeC4DeploymentModel as k, l$3 as l, LikeC4ViewModel as m, find as n, differenceConnections as o, findAscendingConnections as p, findDeepestNestedConnection as q, r$3 as r, findDescendantConnections as s, topologicalSortExports as t, unsafeComputeView as u, hasSameSource as v, willCreateCycle as w, hasSameSourceTarget as x, hasSameTarget as y, isAnyInOut as z };