@likec4/core 1.24.0 → 1.24.1

package/dist/builder/index.mjs

@@ -1,5 +1,5 @@
-import { i, l, d, L as LikeC4Model } from '../shared/core.gWObeLn9.mjs';
-import { b as t, m, n as nameFromFqn, l as l$1, c as isSameHierarchy, p as parentFqn, a as i$1, d as t$1 } from '../shared/core.FFJhmauw.mjs';
+import { i, l, d, L as LikeC4Model } from '../shared/core.Mz23ea8u.mjs';
+import { b as t, m, n as nameFromFqn, l as l$1, c as isSameHierarchy, p as parentFqn, a as i$1, d as t$1 } from '../shared/core.CHsHWcLq.mjs';
 import { o, b as isElementPredicateExpr, D as DefaultElementShape, c as DefaultThemeColor, n as n$1, d as DeploymentElement, e as isScopedElementView } from '../shared/core.BNaXALvz.mjs';
 import { u, i as invariant } from '../shared/core.Btj1m6H6.mjs';
 

package/dist/compute-view/index.mjs

@@ -1,8 +1,8 @@
-import { G as Graph, r, w as willCreateCycle, t as topologicalSortExports, i as i$1, l } from '../shared/core.gWObeLn9.mjs';
-export { c as computeView, a as computeViews, u as unsafeComputeView } from '../shared/core.gWObeLn9.mjs';
-export { c as computeRelationshipsView } from '../shared/core.C92OYZca.mjs';
+import { G as Graph, r, w as willCreateCycle, t as topologicalSortExports, i as i$1, l } from '../shared/core.Mz23ea8u.mjs';
+export { c as computeView, a as computeViews, u as unsafeComputeView } from '../shared/core.Mz23ea8u.mjs';
+export { c as computeRelationshipsView } from '../shared/core.DT2JT2Cd.mjs';
 import { i as isExtendsElementView, a as isElementView } from '../shared/core.BNaXALvz.mjs';
-import { a as i, m } from '../shared/core.FFJhmauw.mjs';
+import { a as i, m } from '../shared/core.CHsHWcLq.mjs';
 import { u } from '../shared/core.Btj1m6H6.mjs';
 
 function y(...t){return u(f,t)}function f(t,e){if(!i(e,1))return {...t};if(!i(e,2)){let{[e[0]]:r,...m}=t;return m}let o={...t};for(let r of e)delete o[r];return o}

package/dist/index.d.mts

@@ -1,7 +1,7 @@
 import { H as HexColorLiteral, T as ThemeColorValues, L as LikeC4Theme } from './shared/core.Bhx0OGK8.mjs';
 export { A as AsFqn, k as BorderStyle, B as BorderStyles, w as Color, x as ColorLiteral, C as CustomColor, D as DefaultElementShape, e as DefaultPaddingSize, f as DefaultShapeSize, g as DefaultTextSize, h as DefaultThemeColor, l as Element, i as ElementKind, m as ElementKindSpecification, n as ElementKindSpecificationStyle, o as ElementShape, j as ElementShapes, p as ElementStyle, z as ElementThemeColorValues, y as ElementThemeColors, E as ExclusiveUnion, F as Fqn, I as IconUrl, a as IteratorLike, K as KeysOf, q as Link, c as NTuple, N as NonEmptyArray, b as NonEmptyReadonlyArray, P as Point, d as Predicate, G as RelationshipThemeColorValues, R as RelationshipThemeColors, S as ShapeSize, J as SpacingSize, r as Tag, s as TagSpec, M as TextSize, O as ThemeColor, v as ThemeColors, t as TypedElement, X as XYPoint, u as isThemeColor } from './shared/core.Bhx0OGK8.mjs';
 export { as as AbstractRelation, ag as AndOperator, a5 as AnyParsedLikeC4Model, aT as AutoLayoutDirection, aW as BBox, aU as BasicElementView, aV as BasicView, aX as ComputedDeploymentView, aY as ComputedDynamicView, aZ as ComputedEdge, a_ as ComputedElementView, C as ComputedLikeC4Model, az as ComputedNode, a as ComputedView, a$ as CustomColorDefinitions, A as CustomElementExpr, B as CustomRelationExpr, ap as DefaultArrowType, aq as DefaultLineStyle, ar as DefaultRelationshipColor, b as DeployedInstance, D as DeploymentElement, c as DeploymentElementStyle, d as DeploymentNode, f as DeploymentNodeKind, g as DeploymentNodeKindSpecification, h as DeploymentRef, i as DeploymentRelation, b0 as DeploymentView, b1 as DeploymentViewRule, b2 as DeploymentViewRulePredicate, b3 as DeploymentViewRuleStyle, b4 as DiagramEdge, aA as DiagramNode, b5 as DiagramView, E as DirectRelationExpr, b6 as DynamicView, b7 as DynamicViewIncludeRule, b8 as DynamicViewParallelSteps, b9 as DynamicViewRule, ba as DynamicViewStep, bb as DynamicViewStepOrParallel, bc as EdgeId, F as ElementExpression, G as ElementKindExpr, bw as ElementNotation, H as ElementPredicateExpression, I as ElementRefExpr, J as ElementTagExpr, bd as ElementView, K as ElementWhereExpr, ah as EqualOperator, M as ExpandedElementExpr, e as Expr, N as Expression, X as ExpressionV2, be as ExtendsElementView, ai as Filterable, Y as FqnExpr, Z as FqnRef, a6 as GenericLikeC4Model, $ as GlobalDynamicPredicates, a0 as GlobalPredicateId, a1 as GlobalPredicates, a2 as GlobalStyleID, a3 as GlobalStyles, Q as InOutExpr, O as IncomingExpr, aj as KindEqual, a7 as LayoutedLikeC4Model, a8 as LikeC4ModelDump, L as LikeC4View, a4 as ModelGlobals, at as ModelRelation, bf as NodeId, R as NonWilcard, ak as NotOperator, al as OperatorPredicate, am as OrOperator, S as OutgoingExpr, a9 as ParsedLikeC4Model, P as PredicateSelector, _ as RelationExpr, T as RelationExpression, au as RelationId, U as RelationPredicateExpression, V as RelationWhereExpr, av as RelationshipArrowType, aw as RelationshipKind, ax as RelationshipKindSpecification, ay as RelationshipLineType, bg as ScopedElementView, bh as StepEdgeId, bi as StepEdgeIdLiteral, an as TagEqual, bj as ViewAutoLayout, bk as ViewId, bl as ViewManualLayout, bm as ViewRule, bn as ViewRuleAutoLayout, bo as ViewRuleGlobalPredicateRef, bp as ViewRuleGlobalStyle, bq as ViewRuleGroup, br as ViewRulePredicate, bs as ViewRuleStyle, bt as ViewRuleStyleOrGlobalRef, bu as ViewWithHash, bv as ViewWithNotation, ao as WhereOperator, W as WildcardExpr, aB as extractStep, aC as getBBoxCenter, aD as getParallelStepsPrefix, aa as isAndOperator, aE as isAutoLayoutDirection, j as isCustomElement, k as isCustomRelationExpr, aF as isDeploymentView, aG as isDynamicView, aH as isDynamicViewParallelSteps, l as isElement, m as isElementKindExpr, n as isElementPredicateExpr, o as isElementRef, p as isElementTagExpr, aI as isElementView, q as isElementWhere, r as isExpandedElementExpr, aJ as isExtendsElementView, t as isInOut, s as isIncoming, ab as isKindEqual, ac as isNotOperator, ad as isOrOperator, u as isOutgoing, v as isRelation, w as isRelationExpression, x as isRelationPredicateExpr, y as isRelationWhere, aK as isScopedElementView, aL as isStepEdgeId, ae as isTagEqual, aM as isViewRuleAutoLayout, aN as isViewRuleGlobalPredicateRef, aO as isViewRuleGlobalStyle, aP as isViewRuleGroup, aQ as isViewRulePredicate, aR as isViewRuleStyle, z as isWildcard, aS as stepEdgeId, af as whereOperatorAsPredicate } from './shared/core.BreLKHbT.mjs';
-export { DefaultMap, DefaultWeakMap, LinkedList, Queue, Stack, commonHead, compareNatural, compareRelations, delay, difference, equalsSet, getOrCreate, hasAtLeast, ifilter, ifind, iflat, imap, intersection, ireduce, isIterable, isNonEmptyArray, isString, isome, iunique, objectHash, stringHash, symmetricDifference, toArray, toSet, union } from './utils/index.mjs';
+export { DefaultMap, DefaultWeakMap, LinkedList, MultiMap, Queue, Stack, commonHead, compareNatural, compareRelations, delay, difference, equalsSet, getOrCreate, hasAtLeast, ifilter, ifind, iflat, imap, intersection, ireduce, isIterable, isNonEmptyArray, isString, isome, iunique, objectHash, stringHash, symmetricDifference, toArray, toSet, union } from './utils/index.mjs';
 export { A as AnyAux, b as Aux, C as ComputeViewResult, d as LikeC4DeploymentModel, L as LikeC4Model, e as LikeC4ViewModel, c as computeView, a as computeViews, u as unsafeComputeView } from './shared/core.DbfQeUKm.mjs';
 export { c as computeRelationshipsView } from './shared/core.3L0y_SNW.mjs';
 export { OverviewGraph, ViewChange } from './types/index.mjs';

package/dist/index.d.ts

@@ -1,7 +1,7 @@
 import { H as HexColorLiteral, T as ThemeColorValues, L as LikeC4Theme } from './shared/core.Bhx0OGK8.js';
 export { A as AsFqn, k as BorderStyle, B as BorderStyles, w as Color, x as ColorLiteral, C as CustomColor, D as DefaultElementShape, e as DefaultPaddingSize, f as DefaultShapeSize, g as DefaultTextSize, h as DefaultThemeColor, l as Element, i as ElementKind, m as ElementKindSpecification, n as ElementKindSpecificationStyle, o as ElementShape, j as ElementShapes, p as ElementStyle, z as ElementThemeColorValues, y as ElementThemeColors, E as ExclusiveUnion, F as Fqn, I as IconUrl, a as IteratorLike, K as KeysOf, q as Link, c as NTuple, N as NonEmptyArray, b as NonEmptyReadonlyArray, P as Point, d as Predicate, G as RelationshipThemeColorValues, R as RelationshipThemeColors, S as ShapeSize, J as SpacingSize, r as Tag, s as TagSpec, M as TextSize, O as ThemeColor, v as ThemeColors, t as TypedElement, X as XYPoint, u as isThemeColor } from './shared/core.Bhx0OGK8.js';
 export { as as AbstractRelation, ag as AndOperator, a5 as AnyParsedLikeC4Model, aT as AutoLayoutDirection, aW as BBox, aU as BasicElementView, aV as BasicView, aX as ComputedDeploymentView, aY as ComputedDynamicView, aZ as ComputedEdge, a_ as ComputedElementView, C as ComputedLikeC4Model, az as ComputedNode, a as ComputedView, a$ as CustomColorDefinitions, A as CustomElementExpr, B as CustomRelationExpr, ap as DefaultArrowType, aq as DefaultLineStyle, ar as DefaultRelationshipColor, b as DeployedInstance, D as DeploymentElement, c as DeploymentElementStyle, d as DeploymentNode, f as DeploymentNodeKind, g as DeploymentNodeKindSpecification, h as DeploymentRef, i as DeploymentRelation, b0 as DeploymentView, b1 as DeploymentViewRule, b2 as DeploymentViewRulePredicate, b3 as DeploymentViewRuleStyle, b4 as DiagramEdge, aA as DiagramNode, b5 as DiagramView, E as DirectRelationExpr, b6 as DynamicView, b7 as DynamicViewIncludeRule, b8 as DynamicViewParallelSteps, b9 as DynamicViewRule, ba as DynamicViewStep, bb as DynamicViewStepOrParallel, bc as EdgeId, F as ElementExpression, G as ElementKindExpr, bw as ElementNotation, H as ElementPredicateExpression, I as ElementRefExpr, J as ElementTagExpr, bd as ElementView, K as ElementWhereExpr, ah as EqualOperator, M as ExpandedElementExpr, e as Expr, N as Expression, X as ExpressionV2, be as ExtendsElementView, ai as Filterable, Y as FqnExpr, Z as FqnRef, a6 as GenericLikeC4Model, $ as GlobalDynamicPredicates, a0 as GlobalPredicateId, a1 as GlobalPredicates, a2 as GlobalStyleID, a3 as GlobalStyles, Q as InOutExpr, O as IncomingExpr, aj as KindEqual, a7 as LayoutedLikeC4Model, a8 as LikeC4ModelDump, L as LikeC4View, a4 as ModelGlobals, at as ModelRelation, bf as NodeId, R as NonWilcard, ak as NotOperator, al as OperatorPredicate, am as OrOperator, S as OutgoingExpr, a9 as ParsedLikeC4Model, P as PredicateSelector, _ as RelationExpr, T as RelationExpression, au as RelationId, U as RelationPredicateExpression, V as RelationWhereExpr, av as RelationshipArrowType, aw as RelationshipKind, ax as RelationshipKindSpecification, ay as RelationshipLineType, bg as ScopedElementView, bh as StepEdgeId, bi as StepEdgeIdLiteral, an as TagEqual, bj as ViewAutoLayout, bk as ViewId, bl as ViewManualLayout, bm as ViewRule, bn as ViewRuleAutoLayout, bo as ViewRuleGlobalPredicateRef, bp as ViewRuleGlobalStyle, bq as ViewRuleGroup, br as ViewRulePredicate, bs as ViewRuleStyle, bt as ViewRuleStyleOrGlobalRef, bu as ViewWithHash, bv as ViewWithNotation, ao as WhereOperator, W as WildcardExpr, aB as extractStep, aC as getBBoxCenter, aD as getParallelStepsPrefix, aa as isAndOperator, aE as isAutoLayoutDirection, j as isCustomElement, k as isCustomRelationExpr, aF as isDeploymentView, aG as isDynamicView, aH as isDynamicViewParallelSteps, l as isElement, m as isElementKindExpr, n as isElementPredicateExpr, o as isElementRef, p as isElementTagExpr, aI as isElementView, q as isElementWhere, r as isExpandedElementExpr, aJ as isExtendsElementView, t as isInOut, s as isIncoming, ab as isKindEqual, ac as isNotOperator, ad as isOrOperator, u as isOutgoing, v as isRelation, w as isRelationExpression, x as isRelationPredicateExpr, y as isRelationWhere, aK as isScopedElementView, aL as isStepEdgeId, ae as isTagEqual, aM as isViewRuleAutoLayout, aN as isViewRuleGlobalPredicateRef, aO as isViewRuleGlobalStyle, aP as isViewRuleGroup, aQ as isViewRulePredicate, aR as isViewRuleStyle, z as isWildcard, aS as stepEdgeId, af as whereOperatorAsPredicate } from './shared/core.C9UbC1nX.js';
-export { DefaultMap, DefaultWeakMap, LinkedList, Queue, Stack, commonHead, compareNatural, compareRelations, delay, difference, equalsSet, getOrCreate, hasAtLeast, ifilter, ifind, iflat, imap, intersection, ireduce, isIterable, isNonEmptyArray, isString, isome, iunique, objectHash, stringHash, symmetricDifference, toArray, toSet, union } from './utils/index.js';
+export { DefaultMap, DefaultWeakMap, LinkedList, MultiMap, Queue, Stack, commonHead, compareNatural, compareRelations, delay, difference, equalsSet, getOrCreate, hasAtLeast, ifilter, ifind, iflat, imap, intersection, ireduce, isIterable, isNonEmptyArray, isString, isome, iunique, objectHash, stringHash, symmetricDifference, toArray, toSet, union } from './utils/index.js';
 export { A as AnyAux, b as Aux, C as ComputeViewResult, d as LikeC4DeploymentModel, L as LikeC4Model, e as LikeC4ViewModel, c as computeView, a as computeViews, u as unsafeComputeView } from './shared/core.k4jahJ8j.js';
 export { c as computeRelationshipsView } from './shared/core.DBToPQ3n.js';
 export { OverviewGraph, ViewChange } from './types/index.js';

package/dist/index.mjs

@@ -1,9 +1,9 @@
 export { i as invariant, a as nonNullable, n as nonexhaustive } from './shared/core.Btj1m6H6.mjs';
 export { A as AsFqn, B as BorderStyles, U as ComputedNode, V as ComputedView, Q as DefaultArrowType, D as DefaultElementShape, S as DefaultLineStyle, g as DefaultPaddingSize, T as DefaultRelationshipColor, h as DefaultShapeSize, j as DefaultTextSize, c as DefaultThemeColor, d as DeploymentElement, W as DiagramNode, E as ElementKind, k as ElementShapes, f as Expr, H as ExpressionV2, I as FqnExpr, J as FqnRef, R as RelationExpr, X as extractStep, Y as getBBoxCenter, Z as getParallelStepsPrefix, K as isAndOperator, _ as isAutoLayoutDirection, l as isCustomElement, m as isCustomRelationExpr, $ as isDeploymentView, a0 as isDynamicView, a1 as isDynamicViewParallelSteps, p as isElement, q as isElementKindExpr, b as isElementPredicateExpr, r as isElementRef, s as isElementTagExpr, a as isElementView, t as isElementWhere, u as isExpandedElementExpr, i as isExtendsElementView, w as isInOut, v as isIncoming, L as isKindEqual, M as isNotOperator, N as isOrOperator, x as isOutgoing, y as isRelation, z as isRelationExpression, C as isRelationPredicateExpr, F as isRelationWhere, e as isScopedElementView, a2 as isStepEdgeId, O as isTagEqual, a3 as isViewRuleAutoLayout, a4 as isViewRuleGlobalPredicateRef, a5 as isViewRuleGlobalStyle, a6 as isViewRuleGroup, a7 as isViewRulePredicate, a8 as isViewRuleStyle, G as isWildcard, a9 as stepEdgeId, P as whereOperatorAsPredicate } from './shared/core.BNaXALvz.mjs';
-export { b as LikeC4DeploymentModel, L as LikeC4Model, e as LikeC4ViewModel, c as computeView, a as computeViews, u as unsafeComputeView } from './shared/core.gWObeLn9.mjs';
-export { c as computeRelationshipsView } from './shared/core.C92OYZca.mjs';
+export { b as LikeC4DeploymentModel, L as LikeC4Model, e as LikeC4ViewModel, c as computeView, a as computeViews, u as unsafeComputeView } from './shared/core.Mz23ea8u.mjs';
+export { c as computeRelationshipsView } from './shared/core.DT2JT2Cd.mjs';
 export { ThemeColors, isThemeColor } from './types/index.mjs';
-export { D as DefaultMap, e as DefaultWeakMap, f as LinkedList, q as Queue, S as Stack, j as ancestorsFqn, k as commonAncestor, g as commonHead, o as compareByFqnHierarchically, r as compareFqnHierarchically, h as compareNatural, L as difference, M as equalsSet, A as getOrCreate, a as hasAtLeast, s as hierarchyDistance, u as hierarchyLevel, E as ifilter, i as ifind, F as iflat, G as imap, N as intersection, v as isAncestor, w as isDescendantOf, H as isIterable, B as isNonEmptyArray, c as isSameHierarchy, C as isString, I as isome, J as iunique, n as nameFromFqn, R as objectHash, p as parentFqn, x as sortByFqnHierarchically, y as sortNaturalByFqn, z as sortParentsFirst, Q as stringHash, O as symmetricDifference, K as toArray, t as toSet, P as union } from './shared/core.FFJhmauw.mjs';
+export { D as DefaultMap, e as DefaultWeakMap, f as LinkedList, g as MultiMap, q as Queue, S as Stack, k as ancestorsFqn, o as commonAncestor, h as commonHead, r as compareByFqnHierarchically, s as compareFqnHierarchically, j as compareNatural, M as difference, N as equalsSet, B as getOrCreate, a as hasAtLeast, u as hierarchyDistance, v as hierarchyLevel, F as ifilter, i as ifind, G as iflat, H as imap, O as intersection, w as isAncestor, x as isDescendantOf, I as isIterable, C as isNonEmptyArray, c as isSameHierarchy, E as isString, J as isome, K as iunique, n as nameFromFqn, T as objectHash, p as parentFqn, y as sortByFqnHierarchically, z as sortNaturalByFqn, A as sortParentsFirst, R as stringHash, P as symmetricDifference, L as toArray, t as toSet, Q as union } from './shared/core.CHsHWcLq.mjs';
 export { compareRelations, delay, ireduce } from './utils/index.mjs';
 
 const { min: min$4, max: max$4 } = Math;

package/dist/model/index.mjs

@@ -1 +1 @@
-export { C as Connection, f as ConnectionModel, F as DeployedInstanceModel, D as DeploymentConnectionModel, H as DeploymentNodeModel, I as DeploymentRelationModel, J as EdgeModel, E as ElementModel, b as LikeC4DeploymentModel, L as LikeC4Model, e as LikeC4ViewModel, N as NodeModel, R as RelationshipModel, g as deploymentConnection, h as differenceConnections, j as findAscendingConnections, k as findDeepestNestedConnection, m as findDescendantConnections, n as hasSameSource, o as hasSameSourceTarget, p as hasSameTarget, q as isAnyInOut, K as isDeployedInstance, M as isDeploymentNode, s as isIncoming, v as isNestedConnection, x as isOutgoing, y as mergeConnections, z as modelConnection, A as sortConnectionsByBoundaryHierarchy, B as sortDeepestFirst } from '../shared/core.gWObeLn9.mjs';
+export { C as Connection, f as ConnectionModel, F as DeployedInstanceModel, D as DeploymentConnectionModel, H as DeploymentNodeModel, I as DeploymentRelationModel, J as EdgeModel, E as ElementModel, b as LikeC4DeploymentModel, L as LikeC4Model, e as LikeC4ViewModel, N as NodeModel, R as RelationshipModel, g as deploymentConnection, h as differenceConnections, j as findAscendingConnections, k as findDeepestNestedConnection, m as findDescendantConnections, n as hasSameSource, o as hasSameSourceTarget, p as hasSameTarget, q as isAnyInOut, K as isDeployedInstance, M as isDeploymentNode, s as isIncoming, v as isNestedConnection, x as isOutgoing, y as mergeConnections, z as modelConnection, A as sortConnectionsByBoundaryHierarchy, B as sortDeepestFirst } from '../shared/core.Mz23ea8u.mjs';

package/dist/shared/{core.FFJhmauw.mjs → core.CHsHWcLq.mjs}

@@ -1020,6 +1020,427 @@ function requireQueue () {
 var queueExports = requireQueue();
 const queue = /*@__PURE__*/getDefaultExportFromCjs(queueExports);
 
+/**
+ * Mnemonist MultiMap
+ * ===================
+ *
+ * Implementation of a MultiMap with custom container.
+ */
+
+var multiMap$1;
+var hasRequiredMultiMap;
+
+function requireMultiMap () {
+	if (hasRequiredMultiMap) return multiMap$1;
+	hasRequiredMultiMap = 1;
+	var Iterator = requireIterator(),
+	    forEach = requireForeach();
+
+	/**
+	 * MultiMap.
+	 *
+	 * @constructor
+	 */
+	function MultiMap(Container) {
+
+	  this.Container = Container || Array;
+	  this.items = new Map();
+	  this.clear();
+
+	  Object.defineProperty(this.items, 'constructor', {
+	    value: MultiMap,
+	    enumerable: false
+	  });
+	}
+
+	/**
+	 * Method used to clear the structure.
+	 *
+	 * @return {undefined}
+	 */
+	MultiMap.prototype.clear = function() {
+
+	  // Properties
+	  this.size = 0;
+	  this.dimension = 0;
+	  this.items.clear();
+	};
+
+	/**
+	 * Method used to set a value.
+	 *
+	 * @param  {any}      key   - Key.
+	 * @param  {any}      value - Value to add.
+	 * @return {MultiMap}
+	 */
+	MultiMap.prototype.set = function(key, value) {
+	  var container = this.items.get(key),
+	      sizeBefore;
+
+	  if (!container) {
+	    this.dimension++;
+	    container = new this.Container();
+	    this.items.set(key, container);
+	  }
+
+	  if (this.Container === Set) {
+	    sizeBefore = container.size;
+	    container.add(value);
+
+	    if (sizeBefore < container.size)
+	      this.size++;
+	  }
+	  else {
+	    container.push(value);
+	    this.size++;
+	  }
+
+	  return this;
+	};
+
+	/**
+	 * Method used to delete the given key.
+	 *
+	 * @param  {any}     key - Key to delete.
+	 * @return {boolean}
+	 */
+	MultiMap.prototype.delete = function(key) {
+	  var container = this.items.get(key);
+
+	  if (!container)
+	    return false;
+
+	  this.size -= (this.Container === Set ? container.size : container.length);
+	  this.dimension--;
+	  this.items.delete(key);
+
+	  return true;
+	};
+
+	/**
+	 * Method used to delete the remove an item in the container stored at the
+	 * given key.
+	 *
+	 * @param  {any}     key - Key to delete.
+	 * @return {boolean}
+	 */
+	MultiMap.prototype.remove = function(key, value) {
+	  var container = this.items.get(key),
+	      wasDeleted,
+	      index;
+
+	  if (!container)
+	    return false;
+
+	  if (this.Container === Set) {
+	    wasDeleted = container.delete(value);
+
+	    if (wasDeleted)
+	      this.size--;
+
+	    if (container.size === 0) {
+	      this.items.delete(key);
+	      this.dimension--;
+	    }
+
+	    return wasDeleted;
+	  }
+	  else {
+	    index = container.indexOf(value);
+
+	    if (index === -1)
+	      return false;
+
+	    this.size--;
+
+	    if (container.length === 1) {
+	      this.items.delete(key);
+	      this.dimension--;
+
+	      return true;
+	    }
+
+	    container.splice(index, 1);
+
+	    return true;
+	  }
+	};
+
+	/**
+	 * Method used to return whether the given keys exists in the map.
+	 *
+	 * @param  {any}     key - Key to check.
+	 * @return {boolean}
+	 */
+	MultiMap.prototype.has = function(key) {
+	  return this.items.has(key);
+	};
+
+	/**
+	 * Method used to return the container stored at the given key or `undefined`.
+	 *
+	 * @param  {any}     key - Key to get.
+	 * @return {boolean}
+	 */
+	MultiMap.prototype.get = function(key) {
+	  return this.items.get(key);
+	};
+
+	/**
+	 * Method used to return the multiplicity of the given key, meaning the number
+	 * of times it is set, or, more trivially, the size of the attached container.
+	 *
+	 * @param  {any}     key - Key to check.
+	 * @return {number}
+	 */
+	MultiMap.prototype.multiplicity = function(key) {
+	  var container = this.items.get(key);
+
+	  if (typeof container === 'undefined')
+	    return 0;
+
+	  return this.Container === Set ? container.size : container.length;
+	};
+	MultiMap.prototype.count = MultiMap.prototype.multiplicity;
+
+	/**
+	 * 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}
+	 */
+	MultiMap.prototype.forEach = function(callback, scope) {
+	  scope = arguments.length > 1 ? scope : this;
+
+	  // Inner iteration function is created here to avoid creating it in the loop
+	  var key;
+	  function inner(value) {
+	    callback.call(scope, value, key);
+	  }
+
+	  this.items.forEach(function(container, k) {
+	    key = k;
+	    container.forEach(inner);
+	  });
+	};
+
+	/**
+	 * Method used to iterate over each of the associations.
+	 *
+	 * @param  {function}  callback - Function to call for each item.
+	 * @param  {object}    scope    - Optional scope.
+	 * @return {undefined}
+	 */
+	MultiMap.prototype.forEachAssociation = function(callback, scope) {
+	  scope = arguments.length > 1 ? scope : this;
+
+	  this.items.forEach(callback, scope);
+	};
+
+	/**
+	 * Method returning an iterator over the map's keys.
+	 *
+	 * @return {Iterator}
+	 */
+	MultiMap.prototype.keys = function() {
+	  return this.items.keys();
+	};
+
+	/**
+	 * Method returning an iterator over the map's keys.
+	 *
+	 * @return {Iterator}
+	 */
+	MultiMap.prototype.values = function() {
+	  var iterator = this.items.values(),
+	      inContainer = false,
+	      countainer,
+	      step,
+	      i,
+	      l;
+
+	  if (this.Container === Set)
+	    return new Iterator(function next() {
+	      if (!inContainer) {
+	        step = iterator.next();
+
+	        if (step.done)
+	          return {done: true};
+
+	        inContainer = true;
+	        countainer = step.value.values();
+	      }
+
+	      step = countainer.next();
+
+	      if (step.done) {
+	        inContainer = false;
+	        return next();
+	      }
+
+	      return {
+	        done: false,
+	        value: step.value
+	      };
+	    });
+
+	  return new Iterator(function next() {
+	    if (!inContainer) {
+	      step = iterator.next();
+
+	      if (step.done)
+	        return {done: true};
+
+	      inContainer = true;
+	      countainer = step.value;
+	      i = 0;
+	      l = countainer.length;
+	    }
+
+	    if (i >= l) {
+	      inContainer = false;
+	      return next();
+	    }
+
+	    return {
+	      done: false,
+	      value: countainer[i++]
+	    };
+	  });
+	};
+
+	/**
+	 * Method returning an iterator over the map's entries.
+	 *
+	 * @return {Iterator}
+	 */
+	MultiMap.prototype.entries = function() {
+	  var iterator = this.items.entries(),
+	      inContainer = false,
+	      countainer,
+	      step,
+	      key,
+	      i,
+	      l;
+
+	  if (this.Container === Set)
+	    return new Iterator(function next() {
+	      if (!inContainer) {
+	        step = iterator.next();
+
+	        if (step.done)
+	          return {done: true};
+
+	        inContainer = true;
+	        key = step.value[0];
+	        countainer = step.value[1].values();
+	      }
+
+	      step = countainer.next();
+
+	      if (step.done) {
+	        inContainer = false;
+	        return next();
+	      }
+
+	      return {
+	        done: false,
+	        value: [key, step.value]
+	      };
+	    });
+
+	  return new Iterator(function next() {
+	    if (!inContainer) {
+	      step = iterator.next();
+
+	      if (step.done)
+	        return {done: true};
+
+	      inContainer = true;
+	      key = step.value[0];
+	      countainer = step.value[1];
+	      i = 0;
+	      l = countainer.length;
+	    }
+
+	    if (i >= l) {
+	      inContainer = false;
+	      return next();
+	    }
+
+	    return {
+	      done: false,
+	      value: [key, countainer[i++]]
+	    };
+	  });
+	};
+
+	/**
+	 * Method returning an iterator over the map's containers.
+	 *
+	 * @return {Iterator}
+	 */
+	MultiMap.prototype.containers = function() {
+	  return this.items.values();
+	};
+
+	/**
+	 * Method returning an iterator over the map's associations.
+	 *
+	 * @return {Iterator}
+	 */
+	MultiMap.prototype.associations = function() {
+	  return this.items.entries();
+	};
+
+	/**
+	 * Attaching the #.entries method to Symbol.iterator if possible.
+	 */
+	if (typeof Symbol !== 'undefined')
+	  MultiMap.prototype[Symbol.iterator] = MultiMap.prototype.entries;
+
+	/**
+	 * Convenience known methods.
+	 */
+	MultiMap.prototype.inspect = function() {
+	  return this.items;
+	};
+
+	if (typeof Symbol !== 'undefined')
+	  MultiMap.prototype[Symbol.for('nodejs.util.inspect.custom')] = MultiMap.prototype.inspect;
+	MultiMap.prototype.toJSON = function() {
+	  return this.items;
+	};
+
+	/**
+	 * Static @.from function taking an arbitrary iterable & converting it into
+	 * a structure.
+	 *
+	 * @param  {Iterable} iterable  - Target iterable.
+	 * @param  {Class}    Container - Container.
+	 * @return {MultiMap}
+	 */
+	MultiMap.from = function(iterable, Container) {
+	  var map = new MultiMap(Container);
+
+	  forEach(iterable, function(value, key) {
+	    map.set(key, value);
+	  });
+
+	  return map;
+	};
+
+	/**
+	 * Exporting.
+	 */
+	multiMap$1 = MultiMap;
+	return multiMap$1;
+}
+
+var multiMapExports = requireMultiMap();
+const multiMap = /*@__PURE__*/getDefaultExportFromCjs(multiMapExports);
+
 var set = {};
 
 /**
@@ -2075,4 +2496,4 @@ function requireObject_hash () {
 var object_hashExports = requireObject_hash();
 const objectHash = /*@__PURE__*/getDefaultExportFromCjs(object_hashExports);
 
-export { n as $, getOrCreate as A, isNonEmptyArray as B, isString as C, DefaultMap as D, ifilter as E, iflat as F, imap as G, isIterable as H, isome as I, iunique as J, toArray as K, difference as L, equals as M, intersection as N, symmetricDifference as O, union as P, stringHash as Q, objectHash as R, Stack as S, C as T, s as U, a as V, getDefaultExportFromCjs as W, requireForeach as X, requireIterator as Y, u as Z, d as _, i$1 as a, hasIntersection as a0, t$1 as b, isSameHierarchy as c, t as d, defaultWeakMap as e, linkedList as f, commonHead as g, compareNatural as h, ifind as i, ancestorsFqn as j, commonAncestor as k, l, m, nameFromFqn as n, compareByFqnHierarchically as o, parentFqn as p, queue as q, compareFqnHierarchically as r, hierarchyDistance as s, toSet as t, hierarchyLevel as u, isAncestor as v, isDescendantOf as w, sortByFqnHierarchically as x, sortNaturalByFqn as y, sortParentsFirst as z };
+export { d as $, sortParentsFirst as A, getOrCreate as B, isNonEmptyArray as C, DefaultMap as D, isString as E, ifilter as F, iflat as G, imap as H, isIterable as I, isome as J, iunique as K, toArray as L, difference as M, equals as N, intersection as O, symmetricDifference as P, union as Q, stringHash as R, Stack as S, objectHash as T, C as U, s as V, a as W, getDefaultExportFromCjs as X, requireForeach as Y, requireIterator as Z, u as _, i$1 as a, n as a0, hasIntersection as a1, t$1 as b, isSameHierarchy as c, t as d, defaultWeakMap as e, linkedList as f, multiMap as g, commonHead as h, ifind as i, compareNatural as j, ancestorsFqn as k, l, m, nameFromFqn as n, commonAncestor as o, parentFqn as p, queue as q, compareByFqnHierarchically as r, compareFqnHierarchically as s, toSet as t, hierarchyDistance as u, hierarchyLevel as v, isAncestor as w, isDescendantOf as x, sortByFqnHierarchically as y, sortNaturalByFqn as z };

package/dist/shared/{core.C92OYZca.mjs → core.DT2JT2Cd.mjs}

@@ -1,4 +1,4 @@
-import { t as toSet, i as ifind } from './core.FFJhmauw.mjs';
+import { t as toSet, i as ifind } from './core.CHsHWcLq.mjs';
 
 function computeRelationshipsView(subjectId, likec4model) {
   const subject = likec4model.element(subjectId);

package/dist/shared/{core.gWObeLn9.mjs → core.Mz23ea8u.mjs}

@@ -1,5 +1,5 @@
 import { D as DefaultElementShape, c as DefaultThemeColor, h as DefaultShapeSize, aa as o$8, t as isElementWhere, P as whereOperatorAsPredicate, G as isWildcard, q as isElementKindExpr, s as isElementTagExpr, n as n$4, u as isExpandedElementExpr, r as isElementRef, l as isCustomElement, a8 as isViewRuleStyle, ab as y$2, U as ComputedNode, E as ElementKind, Q as DefaultArrowType, I as FqnExpr, R as RelationExpr, o as o$9, a7 as isViewRulePredicate, a3 as isViewRuleAutoLayout, a6 as isViewRuleGroup, a4 as isViewRuleGlobalPredicateRef, a5 as isViewRuleGlobalStyle, a9 as stepEdgeId, a1 as isDynamicViewParallelSteps, S as DefaultLineStyle, T 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, a0 as isDynamicView, $ as isDeploymentView, d as DeploymentElement, X as extractStep, a2 as isStepEdgeId, e as isScopedElementView } from './core.BNaXALvz.mjs';
-import { T as C, U as s$1, V as a$5, u as hierarchyLevel, v as isAncestor, k as commonAncestor, y as sortNaturalByFqn, m as m$3, g as commonHead, W as getDefaultExportFromCjs, X as requireForeach, Y as requireIterator, Z as u$7, R as objectHash, N as intersection, L as difference, P as union, Q as stringHash, M as equals, w as isDescendantOf, C as isString, c as isSameHierarchy, I as isome, E as ifilter, H as isIterable, t as toSet, z as sortParentsFirst, K as toArray, D as DefaultMap, G as imap, a as i$9, _ as d$6, p as parentFqn, $ as n$5, o as compareByFqnHierarchically, B as isNonEmptyArray, h as compareNatural, n as nameFromFqn, b as t$6, l as l$7, a0 as hasIntersection, x as sortByFqnHierarchically, j as ancestorsFqn, S as Stack, J as iunique, F as iflat, A as getOrCreate, i as ifind } from './core.FFJhmauw.mjs';
+import { U as C, V as s$1, W as a$5, v as hierarchyLevel, w as isAncestor, o as commonAncestor, z as sortNaturalByFqn, m as m$3, h as commonHead, X as getDefaultExportFromCjs, Y as requireForeach, Z as requireIterator, _ as u$7, T as objectHash, O as intersection, M as difference, Q as union, R as stringHash, N as equals, x as isDescendantOf, E as isString, c as isSameHierarchy, J as isome, F as ifilter, I as isIterable, t as toSet, A as sortParentsFirst, L as toArray, D as DefaultMap, H as imap, a as i$9, $ as d$6, p as parentFqn, a0 as n$5, r as compareByFqnHierarchically, C as isNonEmptyArray, j as compareNatural, n as nameFromFqn, b as t$6, l as l$7, a1 as hasIntersection, y as sortByFqnHierarchically, k as ancestorsFqn, S as Stack, K as iunique, G as iflat, B as getOrCreate, i as ifind } from './core.CHsHWcLq.mjs';
 import { u as u$6, a as nonNullable, i as invariant, n as nonexhaustive } from './core.Btj1m6H6.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")}
@@ -7212,7 +7212,7 @@ class LikeC4Model {
    */
   static makeCompute(parsed) {
     let { views, ...rest } = parsed;
-    const model = new LikeC4Model(structuredClone({ ...rest, views: {} }));
+    const model = new LikeC4Model({ ...rest, views: {} });
     return (viewsource) => computeView(viewsource, model);
   }
   /**

package/dist/utils/index.d.mts

@@ -84,6 +84,52 @@ declare class LinkedList<T> implements Iterable<T> {
   static from<I>(iterable: Iterable<I> | {[key: string]: I}): LinkedList<I>;
 }
 
+interface MultiMapConstructor {
+  new <K, V>(container: SetConstructor): MultiMap<K, V, Set<V>>;
+  new <K, V>(container?: ArrayConstructor): MultiMap<K, V, V[]>;
+
+  from<K, V>(
+    iterable: Iterable<[K, V]> | {[key: string]: V},
+    Container: SetConstructor
+  ): MultiMap<K, V, Set<V>>;
+  from<K, V>(
+    iterable: Iterable<[K, V]> | {[key: string]: V},
+    Container?: ArrayConstructor
+  ): MultiMap<K, V, V[]>;
+}
+/**
+ * Mnemonist MultiMap Typings
+ * ===========================
+ */
+
+interface MultiMap<K, V, C extends V[] | Set<V> = V[]> extends Iterable<[K, V]> {
+
+  // Members
+  dimension: number;
+  size: number;
+
+  // Methods
+  clear(): void;
+  set(key: K, value: V): this;
+  delete(key: K): boolean;
+  remove(key: K, value: V): boolean;
+  has(key: K): boolean;
+  get(key: K): C | undefined;
+  multiplicity(key: K): number;
+  forEach(callback: (value: V, key: K, map: this) => void, scope?: any): void;
+  forEachAssociation(callback: (value: C, key: K, map: this) => void, scope?: any): void;
+  keys(): IterableIterator<K>;
+  values(): IterableIterator<V>;
+  entries(): IterableIterator<[K, V]>;
+  containers(): IterableIterator<C>;
+  associations(): IterableIterator<[K, C]>;
+  [Symbol.iterator](): IterableIterator<[K, V]>;
+  inspect(): any;
+  toJSON(): any;
+}
+
+declare const MultiMap: MultiMapConstructor;
+
 /**
  * Mnemonist Queue Typings
  * ========================
@@ -379,4 +425,4 @@ function requireObject_hash () {
 var object_hashExports = requireObject_hash();
 var object_hash = /*@__PURE__*/getDefaultExportFromCjs(object_hashExports);
 
-export { DefaultMap, DefaultWeakMap, LinkedList, Queue, Stack, commonHead, compareNatural, compareRelations, delay, difference, equals as equalsSet, getOrCreate, hasAtLeast, ifilter, ifind, iflat, imap, intersection, ireduce, isIterable, isNonEmptyArray, isString, isome, iunique, object_hash as objectHash, stringHash, symmetricDifference, toArray, toSet, union };
+export { DefaultMap, DefaultWeakMap, LinkedList, MultiMap, Queue, Stack, commonHead, compareNatural, compareRelations, delay, difference, equals as equalsSet, getOrCreate, hasAtLeast, ifilter, ifind, iflat, imap, intersection, ireduce, isIterable, isNonEmptyArray, isString, isome, iunique, object_hash as objectHash, stringHash, symmetricDifference, toArray, toSet, union };

package/dist/utils/index.d.ts

@@ -84,6 +84,52 @@ declare class LinkedList<T> implements Iterable<T> {
   static from<I>(iterable: Iterable<I> | {[key: string]: I}): LinkedList<I>;
 }
 
+interface MultiMapConstructor {
+  new <K, V>(container: SetConstructor): MultiMap<K, V, Set<V>>;
+  new <K, V>(container?: ArrayConstructor): MultiMap<K, V, V[]>;
+
+  from<K, V>(
+    iterable: Iterable<[K, V]> | {[key: string]: V},
+    Container: SetConstructor
+  ): MultiMap<K, V, Set<V>>;
+  from<K, V>(
+    iterable: Iterable<[K, V]> | {[key: string]: V},
+    Container?: ArrayConstructor
+  ): MultiMap<K, V, V[]>;
+}
+/**
+ * Mnemonist MultiMap Typings
+ * ===========================
+ */
+
+interface MultiMap<K, V, C extends V[] | Set<V> = V[]> extends Iterable<[K, V]> {
+
+  // Members
+  dimension: number;
+  size: number;
+
+  // Methods
+  clear(): void;
+  set(key: K, value: V): this;
+  delete(key: K): boolean;
+  remove(key: K, value: V): boolean;
+  has(key: K): boolean;
+  get(key: K): C | undefined;
+  multiplicity(key: K): number;
+  forEach(callback: (value: V, key: K, map: this) => void, scope?: any): void;
+  forEachAssociation(callback: (value: C, key: K, map: this) => void, scope?: any): void;
+  keys(): IterableIterator<K>;
+  values(): IterableIterator<V>;
+  entries(): IterableIterator<[K, V]>;
+  containers(): IterableIterator<C>;
+  associations(): IterableIterator<[K, C]>;
+  [Symbol.iterator](): IterableIterator<[K, V]>;
+  inspect(): any;
+  toJSON(): any;
+}
+
+declare const MultiMap: MultiMapConstructor;
+
 /**
  * Mnemonist Queue Typings
  * ========================
@@ -379,4 +425,4 @@ function requireObject_hash () {
 var object_hashExports = requireObject_hash();
 var object_hash = /*@__PURE__*/getDefaultExportFromCjs(object_hashExports);
 
-export { DefaultMap, DefaultWeakMap, LinkedList, Queue, Stack, commonHead, compareNatural, compareRelations, delay, difference, equals as equalsSet, getOrCreate, hasAtLeast, ifilter, ifind, iflat, imap, intersection, ireduce, isIterable, isNonEmptyArray, isString, isome, iunique, object_hash as objectHash, stringHash, symmetricDifference, toArray, toSet, union };
+export { DefaultMap, DefaultWeakMap, LinkedList, MultiMap, Queue, Stack, commonHead, compareNatural, compareRelations, delay, difference, equals as equalsSet, getOrCreate, hasAtLeast, ifilter, ifind, iflat, imap, intersection, ireduce, isIterable, isNonEmptyArray, isString, isome, iunique, object_hash as objectHash, stringHash, symmetricDifference, toArray, toSet, union };

package/dist/utils/index.mjs

@@ -1,5 +1,5 @@
-import { d as t, $ as n, k as commonAncestor, r as compareFqnHierarchically } from '../shared/core.FFJhmauw.mjs';
-export { D as DefaultMap, e as DefaultWeakMap, f as LinkedList, q as Queue, S as Stack, j as ancestorsFqn, g as commonHead, o as compareByFqnHierarchically, h as compareNatural, L as difference, M as equalsSet, A as getOrCreate, a as hasAtLeast, s as hierarchyDistance, u as hierarchyLevel, E as ifilter, i as ifind, F as iflat, G as imap, N as intersection, v as isAncestor, w as isDescendantOf, H as isIterable, B as isNonEmptyArray, c as isSameHierarchy, C as isString, I as isome, J as iunique, n as nameFromFqn, R as objectHash, p as parentFqn, x as sortByFqnHierarchically, y as sortNaturalByFqn, z as sortParentsFirst, Q as stringHash, O as symmetricDifference, K as toArray, t as toSet, P as union } from '../shared/core.FFJhmauw.mjs';
+import { d as t, a0 as n, o as commonAncestor, s as compareFqnHierarchically } from '../shared/core.CHsHWcLq.mjs';
+export { D as DefaultMap, e as DefaultWeakMap, f as LinkedList, g as MultiMap, q as Queue, S as Stack, k as ancestorsFqn, h as commonHead, r as compareByFqnHierarchically, j as compareNatural, M as difference, N as equalsSet, B as getOrCreate, a as hasAtLeast, u as hierarchyDistance, v as hierarchyLevel, F as ifilter, i as ifind, G as iflat, H as imap, O as intersection, w as isAncestor, x as isDescendantOf, I as isIterable, C as isNonEmptyArray, c as isSameHierarchy, E as isString, J as isome, K as iunique, n as nameFromFqn, T as objectHash, p as parentFqn, y as sortByFqnHierarchically, z as sortNaturalByFqn, A as sortParentsFirst, R as stringHash, P as symmetricDifference, L as toArray, t as toSet, Q as union } from '../shared/core.CHsHWcLq.mjs';
 import { i as invariant } from '../shared/core.Btj1m6H6.mjs';
 
 function o(r,n){let e=Math.ceil(r),t=Math.floor(n);if(t<e)throw new RangeError(`randomInteger: The range [${r.toString()},${n.toString()}] contains no integer`);return Math.floor(Math.random()*(t-e+1)+e)}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@likec4/core",
-  "version": "1.24.0",
+  "version": "1.24.1",
   "license": "MIT",
   "homepage": "https://likec4.dev",
   "author": "Denis Davydkov <denis@davydkov.com>",
@@ -91,12 +91,12 @@
     "natural-compare-lite": "^1.4.0",
     "object-hash": "^3.0.0",
     "obliterator": "^2.0.5",
-    "remeda": "^2.20.1",
+    "remeda": "^2.20.2",
     "turbo": "^2.4.2",
     "typescript": "5.7.3",
     "unbuild": "^3.3.1",
-    "vitest": "^3.0.4",
-    "@likec4/tsconfig": "1.24.0"
+    "vitest": "^3.0.6",
+    "@likec4/tsconfig": "1.24.1"
   },
   "scripts": {
     "typecheck": "tsc --noEmit",

package/src/model/LikeC4Model.ts

@@ -86,7 +86,7 @@ export class LikeC4Model<M extends AnyAux = LikeC4Model.Any> {
    */
   static makeCompute<M extends AnyParsedLikeC4Model>(parsed: M): (viewsource: LikeC4View) => ComputeViewResult {
     let { views, ...rest } = parsed as Omit<M, '__'>
-    const model = new LikeC4Model(structuredClone({ ...rest, views: {} }))
+    const model = new LikeC4Model({ ...rest, views: {} })
     return (viewsource) => computeView(viewsource, model)
   }
 

package/src/utils/index.ts

@@ -2,6 +2,7 @@ export {
   DefaultMap,
   DefaultWeakMap,
   LinkedList,
+  MultiMap,
   Queue,
   Stack,
 } from './mnemonist'

package/src/utils/mnemonist.ts

@@ -2,6 +2,7 @@ export {
   DefaultMap,
   DefaultWeakMap,
   LinkedList,
+  MultiMap,
   Queue,
   Stack,
 } from 'mnemonist/patch'