@likec4/core 1.24.0 → 1.25.0

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

@@ -195,129 +195,9 @@ function requireDefaultMap () {
 	return defaultMap;
 }
 
-var defaultMapExports = requireDefaultMap();
+var defaultMapExports = /*@__PURE__*/ requireDefaultMap();
 const DefaultMap = /*@__PURE__*/getDefaultExportFromCjs(defaultMapExports);
 
-/**
- * Mnemonist DefaultWeakMap
- * =========================
- *
- * JavaScript implementation of a default weak map that will return a constructed
- * value any time one tries to access an non-existing key. It is similar to
- * DefaultMap but uses ES6 WeakMap that only holds weak reference to keys.
- */
-
-var defaultWeakMap$1;
-var hasRequiredDefaultWeakMap;
-
-function requireDefaultWeakMap () {
-	if (hasRequiredDefaultWeakMap) return defaultWeakMap$1;
-	hasRequiredDefaultWeakMap = 1;
-	/**
-	 * DefaultWeakMap.
-	 *
-	 * @constructor
-	 */
-	function DefaultWeakMap(factory) {
-	  if (typeof factory !== 'function')
-	    throw new Error('mnemonist/DefaultWeakMap.constructor: expecting a function.');
-
-	  this.items = new WeakMap();
-	  this.factory = factory;
-	}
-
-	/**
-	 * Method used to clear the structure.
-	 *
-	 * @return {undefined}
-	 */
-	DefaultWeakMap.prototype.clear = function() {
-
-	  // Properties
-	  this.items = new WeakMap();
-	};
-
-	/**
-	 * 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}
-	 */
-	DefaultWeakMap.prototype.get = function(key) {
-	  var value = this.items.get(key);
-
-	  if (typeof value === 'undefined') {
-	    value = this.factory(key);
-	    this.items.set(key, value);
-	  }
-
-	  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}
-	 */
-	DefaultWeakMap.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}
-	 */
-	DefaultWeakMap.prototype.set = function(key, value) {
-	  this.items.set(key, value);
-	  return this;
-	};
-
-	/**
-	 * Method used to test the existence of a key in the map.
-	 *
-	 * @param  {any} key   - Target key.
-	 * @return {boolean}
-	 */
-	DefaultWeakMap.prototype.has = function(key) {
-	  return this.items.has(key);
-	};
-
-	/**
-	 * Method used to delete target key.
-	 *
-	 * @param  {any} key   - Target key.
-	 * @return {boolean}
-	 */
-	DefaultWeakMap.prototype.delete = function(key) {
-	  return this.items.delete(key);
-	};
-
-	/**
-	 * Convenience known methods.
-	 */
-	DefaultWeakMap.prototype.inspect = function() {
-	  return this.items;
-	};
-
-	if (typeof Symbol !== 'undefined')
-	  DefaultWeakMap.prototype[Symbol.for('nodejs.util.inspect.custom')] = DefaultWeakMap.prototype.inspect;
-
-	/**
-	 * Exporting.
-	 */
-	defaultWeakMap$1 = DefaultWeakMap;
-	return defaultWeakMap$1;
-}
-
-var defaultWeakMapExports = requireDefaultWeakMap();
-const defaultWeakMap = /*@__PURE__*/getDefaultExportFromCjs(defaultWeakMapExports);
-
 /**
  * Obliterator Iterator Class
  * ===========================
@@ -518,508 +398,6 @@ function requireForeach () {
 	return foreach;
 }
 
-/**
- * Mnemonist Linked List
- * ======================
- *
- * Singly linked list implementation. Uses raw JavaScript objects as nodes
- * as benchmarks proved it was the fastest thing to do.
- */
-
-var linkedList$1;
-var hasRequiredLinkedList;
-
-function requireLinkedList () {
-	if (hasRequiredLinkedList) return linkedList$1;
-	hasRequiredLinkedList = 1;
-	var Iterator = requireIterator(),
-	    forEach = requireForeach();
-
-	/**
-	 * Linked List.
-	 *
-	 * @constructor
-	 */
-	function LinkedList() {
-	  this.clear();
-	}
-
-	/**
-	 * Method used to clear the list.
-	 *
-	 * @return {undefined}
-	 */
-	LinkedList.prototype.clear = function() {
-
-	  // Properties
-	  this.head = null;
-	  this.tail = null;
-	  this.size = 0;
-	};
-
-	/**
-	 * Method used to get the first item of the list.
-	 *
-	 * @return {any}
-	 */
-	LinkedList.prototype.first = function() {
-	  return this.head ? this.head.item : undefined;
-	};
-	LinkedList.prototype.peek = LinkedList.prototype.first;
-
-	/**
-	 * Method used to get the last item of the list.
-	 *
-	 * @return {any}
-	 */
-	LinkedList.prototype.last = function() {
-	  return this.tail ? this.tail.item : undefined;
-	};
-
-	/**
-	 * Method used to add an item at the end of the list.
-	 *
-	 * @param  {any}    item - The item to add.
-	 * @return {number}
-	 */
-	LinkedList.prototype.push = function(item) {
-	  var node = {item: item, next: null};
-
-	  if (!this.head) {
-	    this.head = node;
-	    this.tail = node;
-	  }
-	  else {
-	    this.tail.next = node;
-	    this.tail = node;
-	  }
-
-	  this.size++;
-
-	  return this.size;
-	};
-
-	/**
-	 * Method used to add an item at the beginning of the list.
-	 *
-	 * @param  {any}    item - The item to add.
-	 * @return {number}
-	 */
-	LinkedList.prototype.unshift = function(item) {
-	  var node = {item: item, next: null};
-
-	  if (!this.head) {
-	    this.head = node;
-	    this.tail = node;
-	  }
-	  else {
-	    if (!this.head.next)
-	      this.tail = this.head;
-	    node.next = this.head;
-	    this.head = node;
-	  }
-
-	  this.size++;
-
-	  return this.size;
-	};
-
-	/**
-	 * Method used to retrieve & remove the first item of the list.
-	 *
-	 * @return {any}
-	 */
-	LinkedList.prototype.shift = function() {
-	  if (!this.size)
-	    return undefined;
-
-	  var node = this.head;
-
-	  this.head = node.next;
-	  this.size--;
-
-	  return node.item;
-	};
-
-	/**
-	 * Method used to iterate over the list.
-	 *
-	 * @param  {function}  callback - Function to call for each item.
-	 * @param  {object}    scope    - Optional scope.
-	 * @return {undefined}
-	 */
-	LinkedList.prototype.forEach = function(callback, scope) {
-	  if (!this.size)
-	    return;
-
-	  scope = arguments.length > 1 ? scope : this;
-
-	  var n = this.head,
-	      i = 0;
-
-	  while (n) {
-	    callback.call(scope, n.item, i, this);
-	    n = n.next;
-	    i++;
-	  }
-	};
-
-	/**
-	 * Method used to convert the list into an array.
-	 *
-	 * @return {array}
-	 */
-	LinkedList.prototype.toArray = function() {
-	  if (!this.size)
-	    return [];
-
-	  var array = new Array(this.size);
-
-	  for (var i = 0, l = this.size, n = this.head; i < l; i++) {
-	    array[i] = n.item;
-	    n = n.next;
-	  }
-
-	  return array;
-	};
-
-	/**
-	 * Method used to create an iterator over a list's values.
-	 *
-	 * @return {Iterator}
-	 */
-	LinkedList.prototype.values = function() {
-	  var n = this.head;
-
-	  return new Iterator(function() {
-	    if (!n)
-	      return {
-	        done: true
-	      };
-
-	    var value = n.item;
-	    n = n.next;
-
-	    return {
-	      value: value,
-	      done: false
-	    };
-	  });
-	};
-
-	/**
-	 * Method used to create an iterator over a list's entries.
-	 *
-	 * @return {Iterator}
-	 */
-	LinkedList.prototype.entries = function() {
-	  var n = this.head,
-	      i = 0;
-
-	  return new Iterator(function() {
-	    if (!n)
-	      return {
-	        done: true
-	      };
-
-	    var value = n.item;
-	    n = n.next;
-	    i++;
-
-	    return {
-	      value: [i - 1, value],
-	      done: false
-	    };
-	  });
-	};
-
-	/**
-	 * Attaching the #.values method to Symbol.iterator if possible.
-	 */
-	if (typeof Symbol !== 'undefined')
-	  LinkedList.prototype[Symbol.iterator] = LinkedList.prototype.values;
-
-	/**
-	 * Convenience known methods.
-	 */
-	LinkedList.prototype.toString = function() {
-	  return this.toArray().join(',');
-	};
-
-	LinkedList.prototype.toJSON = function() {
-	  return this.toArray();
-	};
-
-	LinkedList.prototype.inspect = function() {
-	  var array = this.toArray();
-
-	  // Trick so that node displays the name of the constructor
-	  Object.defineProperty(array, 'constructor', {
-	    value: LinkedList,
-	    enumerable: false
-	  });
-
-	  return array;
-	};
-
-	if (typeof Symbol !== 'undefined')
-	  LinkedList.prototype[Symbol.for('nodejs.util.inspect.custom')] = LinkedList.prototype.inspect;
-
-	/**
-	 * Static @.from function taking an arbitrary iterable & converting it into
-	 * a list.
-	 *
-	 * @param  {Iterable} iterable   - Target iterable.
-	 * @return {LinkedList}
-	 */
-	LinkedList.from = function(iterable) {
-	  var list = new LinkedList();
-
-	  forEach(iterable, function(value) {
-	    list.push(value);
-	  });
-
-	  return list;
-	};
-
-	/**
-	 * Exporting.
-	 */
-	linkedList$1 = LinkedList;
-	return linkedList$1;
-}
-
-var linkedListExports = requireLinkedList();
-const linkedList = /*@__PURE__*/getDefaultExportFromCjs(linkedListExports);
-
-/**
- * Mnemonist Queue
- * ================
- *
- * Queue implementation based on the ideas of Queue.js that seems to beat
- * a LinkedList one in performance.
- */
-
-var queue$1;
-var hasRequiredQueue;
-
-function requireQueue () {
-	if (hasRequiredQueue) return queue$1;
-	hasRequiredQueue = 1;
-	var Iterator = requireIterator(),
-	    forEach = requireForeach();
-
-	/**
-	 * Queue
-	 *
-	 * @constructor
-	 */
-	function Queue() {
-	  this.clear();
-	}
-
-	/**
-	 * Method used to clear the queue.
-	 *
-	 * @return {undefined}
-	 */
-	Queue.prototype.clear = function() {
-
-	  // Properties
-	  this.items = [];
-	  this.offset = 0;
-	  this.size = 0;
-	};
-
-	/**
-	 * Method used to add an item to the queue.
-	 *
-	 * @param  {any}    item - Item to enqueue.
-	 * @return {number}
-	 */
-	Queue.prototype.enqueue = function(item) {
-
-	  this.items.push(item);
-	  return ++this.size;
-	};
-
-	/**
-	 * Method used to retrieve & remove the first item of the queue.
-	 *
-	 * @return {any}
-	 */
-	Queue.prototype.dequeue = function() {
-	  if (!this.size)
-	    return;
-
-	  var item = this.items[this.offset];
-
-	  if (++this.offset * 2 >= this.items.length) {
-	    this.items = this.items.slice(this.offset);
-	    this.offset = 0;
-	  }
-
-	  this.size--;
-
-	  return item;
-	};
-
-	/**
-	 * Method used to retrieve the first item of the queue.
-	 *
-	 * @return {any}
-	 */
-	Queue.prototype.peek = function() {
-	  if (!this.size)
-	    return;
-
-	  return this.items[this.offset];
-	};
-
-	/**
-	 * Method used to iterate over the queue.
-	 *
-	 * @param  {function}  callback - Function to call for each item.
-	 * @param  {object}    scope    - Optional scope.
-	 * @return {undefined}
-	 */
-	Queue.prototype.forEach = function(callback, scope) {
-	  scope = arguments.length > 1 ? scope : this;
-
-	  for (var i = this.offset, j = 0, l = this.items.length; i < l; i++, j++)
-	    callback.call(scope, this.items[i], j, this);
-	};
-
-	/*
-	 * Method used to convert the queue to a JavaScript array.
-	 *
-	 * @return {array}
-	 */
-	Queue.prototype.toArray = function() {
-	  return this.items.slice(this.offset);
-	};
-
-	/**
-	 * Method used to create an iterator over a queue's values.
-	 *
-	 * @return {Iterator}
-	 */
-	Queue.prototype.values = function() {
-	  var items = this.items,
-	      i = this.offset;
-
-	  return new Iterator(function() {
-	    if (i >= items.length)
-	      return {
-	        done: true
-	      };
-
-	    var value = items[i];
-	    i++;
-
-	    return {
-	      value: value,
-	      done: false
-	    };
-	  });
-	};
-
-	/**
-	 * Method used to create an iterator over a queue's entries.
-	 *
-	 * @return {Iterator}
-	 */
-	Queue.prototype.entries = function() {
-	  var items = this.items,
-	      i = this.offset,
-	      j = 0;
-
-	  return new Iterator(function() {
-	    if (i >= items.length)
-	      return {
-	        done: true
-	      };
-
-	    var value = items[i];
-	    i++;
-
-	    return {
-	      value: [j++, value],
-	      done: false
-	    };
-	  });
-	};
-
-	/**
-	 * Attaching the #.values method to Symbol.iterator if possible.
-	 */
-	if (typeof Symbol !== 'undefined')
-	  Queue.prototype[Symbol.iterator] = Queue.prototype.values;
-
-	/**
-	 * Convenience known methods.
-	 */
-	Queue.prototype.toString = function() {
-	  return this.toArray().join(',');
-	};
-
-	Queue.prototype.toJSON = function() {
-	  return this.toArray();
-	};
-
-	Queue.prototype.inspect = function() {
-	  var array = this.toArray();
-
-	  // Trick so that node displays the name of the constructor
-	  Object.defineProperty(array, 'constructor', {
-	    value: Queue,
-	    enumerable: false
-	  });
-
-	  return array;
-	};
-
-	if (typeof Symbol !== 'undefined')
-	  Queue.prototype[Symbol.for('nodejs.util.inspect.custom')] = Queue.prototype.inspect;
-
-	/**
-	 * Static @.from function taking an arbitrary iterable & converting it into
-	 * a queue.
-	 *
-	 * @param  {Iterable} iterable   - Target iterable.
-	 * @return {Queue}
-	 */
-	Queue.from = function(iterable) {
-	  var queue = new Queue();
-
-	  forEach(iterable, function(value) {
-	    queue.enqueue(value);
-	  });
-
-	  return queue;
-	};
-
-	/**
-	 * Static @.of function taking an arbitrary number of arguments & converting it
-	 * into a queue.
-	 *
-	 * @param  {...any} args
-	 * @return {Queue}
-	 */
-	Queue.of = function() {
-	  return Queue.from(arguments);
-	};
-
-	/**
-	 * Exporting.
-	 */
-	queue$1 = Queue;
-	return queue$1;
-}
-
-var queueExports = requireQueue();
-const queue = /*@__PURE__*/getDefaultExportFromCjs(queueExports);
-
 var set = {};
 
 /**
@@ -1388,7 +766,7 @@ function requireSet () {
 	return set;
 }
 
-var setExports = requireSet();
+var setExports = /*@__PURE__*/ requireSet();
 
 /**
  * Mnemonist Stack
@@ -1610,7 +988,7 @@ function requireStack () {
 	return stack;
 }
 
-var stackExports = requireStack();
+var stackExports = /*@__PURE__*/ requireStack();
 const Stack = /*@__PURE__*/getDefaultExportFromCjs(stackExports);
 
 function commonHead(sources, targets, equals) {
@@ -2075,4 +1453,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 { 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 };

package/dist/shared/{core.C92OYZca.mjs → core.DmBjVt1u.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.DQMSDiu8.mjs';
 
 function computeRelationshipsView(subjectId, likec4model) {
   const subject = likec4model.element(subjectId);

package/dist/shared/{core.DBToPQ3n.d.ts → core.Dw2eQBtz.d.ts}

@@ -1,4 +1,4 @@
-import { L as LikeC4Model, E as ElementModel, R as RelationshipModel } from './core.k4jahJ8j.js';
+import { L as LikeC4Model, E as ElementModel, R as RelationshipModel } from './core.B4fHpdUJ.js';
 import { F as Fqn } from './core.Bhx0OGK8.js';
 
 declare function computeRelationshipsView(subjectId: Fqn, likec4model: LikeC4Model): {

package/dist/types/index.d.mts

@@ -1,7 +1,7 @@
 import { X as XYPoint, N as NonEmptyArray, P as Point, k as BorderStyle, o as ElementShape, O as ThemeColor, F as Fqn } from '../shared/core.Bhx0OGK8.mjs';
 export { A as AsFqn, 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, j as ElementShapes, p as ElementStyle, z as ElementThemeColorValues, y as ElementThemeColors, E as ExclusiveUnion, H as HexColorLiteral, I as IconUrl, a as IteratorLike, K as KeysOf, L as LikeC4Theme, q as Link, c as NTuple, b as NonEmptyReadonlyArray, d as Predicate, G as RelationshipThemeColorValues, R as RelationshipThemeColors, S as ShapeSize, J as SpacingSize, r as Tag, s as TagSpec, M as TextSize, T as ThemeColorValues, v as ThemeColors, t as TypedElement, u as isThemeColor } from '../shared/core.Bhx0OGK8.mjs';
-import { bk as ViewId, aW as BBox, bl as ViewManualLayout, aT as AutoLayoutDirection } from '../shared/core.BreLKHbT.mjs';
-export { as as AbstractRelation, ag as AndOperator, a5 as AnyParsedLikeC4Model, 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, 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, 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';
+import { bo as ViewId, a_ as BBox, bp as ViewManualLayout, aX as AutoLayoutDirection } from '../shared/core.B4wY1NqR.mjs';
+export { aw as AbstractRelation, ah as AllNever, ai as AndOperator, a5 as AnyParsedLikeC4Model, aY as BasicElementView, aZ as BasicView, a$ as ComputedDeploymentView, b0 as ComputedDynamicView, b1 as ComputedEdge, b2 as ComputedElementView, C as ComputedLikeC4Model, aD as ComputedNode, a as ComputedView, b3 as CustomColorDefinitions, A as CustomElementExpr, B as CustomRelationExpr, at as DefaultArrowType, au as DefaultLineStyle, av 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, b4 as DeploymentView, b5 as DeploymentViewRule, b6 as DeploymentViewRulePredicate, b7 as DeploymentViewRuleStyle, b8 as DiagramEdge, aE as DiagramNode, b9 as DiagramView, E as DirectRelationExpr, ba as DynamicView, bb as DynamicViewIncludeRule, bc as DynamicViewParallelSteps, bd as DynamicViewRule, be as DynamicViewStep, bf as DynamicViewStepOrParallel, bg as EdgeId, F as ElementExpression, G as ElementKindExpr, bA as ElementNotation, H as ElementPredicateExpression, I as ElementRefExpr, J as ElementTagExpr, bh as ElementView, K as ElementWhereExpr, aj as EqualOperator, M as ExpandedElementExpr, N as Expression, X as ExpressionV2, bi as ExtendsElementView, ak 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, al as KindEqual, a7 as LayoutedLikeC4Model, a8 as LikeC4ModelDump, L as LikeC4View, a4 as ModelGlobals, ax as ModelRelation, bj as NodeId, R as NonWilcard, am as NotOperator, an as OperatorPredicate, ao as OrOperator, S as OutgoingExpr, a9 as ParsedLikeC4Model, ap as Participant, aq as ParticipantOperator, P as PredicateSelector, _ as RelationExpr, T as RelationExpression, ay as RelationId, U as RelationPredicateExpression, V as RelationWhereExpr, az as RelationshipArrowType, aA as RelationshipKind, aB as RelationshipKindSpecification, aC as RelationshipLineType, bk as ScopedElementView, bl as StepEdgeId, bm as StepEdgeIdLiteral, ar as TagEqual, bn as ViewAutoLayout, bq as ViewRule, br as ViewRuleAutoLayout, bs as ViewRuleGlobalPredicateRef, bt as ViewRuleGlobalStyle, bu as ViewRuleGroup, bv as ViewRulePredicate, bw as ViewRuleStyle, bx as ViewRuleStyleOrGlobalRef, by as ViewWithHash, bz as ViewWithNotation, as as WhereOperator, W as WildcardExpr, aF as extractStep, aG as getBBoxCenter, aH as getParallelStepsPrefix, aa as isAndOperator, aI as isAutoLayoutDirection, j as isCustomElement, k as isCustomRelationExpr, aJ as isDeploymentView, aK as isDynamicView, aL as isDynamicViewParallelSteps, l as isElement, m as isElementKindExpr, n as isElementPredicateExpr, o as isElementRef, p as isElementTagExpr, aM as isElementView, q as isElementWhere, r as isExpandedElementExpr, aN as isExtendsElementView, t as isInOut, s as isIncoming, ab as isKindEqual, ac as isNotOperator, ad as isOrOperator, u as isOutgoing, ae as isParticipantOperator, v as isRelation, w as isRelationExpression, x as isRelationPredicateExpr, y as isRelationWhere, aO as isScopedElementView, aP as isStepEdgeId, af as isTagEqual, aQ as isViewRuleAutoLayout, aR as isViewRuleGlobalPredicateRef, aS as isViewRuleGlobalStyle, aT as isViewRuleGroup, aU as isViewRulePredicate, aV as isViewRuleStyle, z as isWildcard, aW as stepEdgeId, ag as whereOperatorAsPredicate } from '../shared/core.B4wY1NqR.mjs';
 import 'type-fest';
 
 /**