@likec4/core 1.47.0 → 1.49.0

package/dist/shared/core.3ZhnKAlZ.mjs

@@ -1,106 +0,0 @@
-import { g as getDefaultExportFromCjs } from './core.B85MJLTf.mjs';
-import { e as e$1 } from './core.CqAJJpK_.mjs';
-
-const e={done:true,hasNext:false},t$1={done:false,hasNext:false},n$1=()=>e;
-
-function t(e,...t){let a=e,o=t.map(e=>`lazy`in e?r(e):void 0),s=0;for(;s<t.length;){if(o[s]===void 0||!i(a)){let e=t[s];a=e(a),s+=1;continue}let e=[];for(let n=s;n<t.length;n++){let t=o[n];if(t===void 0||(e.push(t),t.isSingle))break}let r=[];for(let t of a)if(n(t,r,e))break;let{isSingle:c}=e.at(-1);a=c?r[0]:r,s+=e.length;}return a}function n(t,r,i){if(i.length===0)return r.push(t),false;let a=t,o=t$1,s=false;for(let[e,t]of i.entries()){let{index:c,items:l}=t;if(l.push(a),o=t(a,c,l),t.index+=1,o.hasNext){if(o.hasMany??false){for(let t of o.next)if(n(t,r,i.slice(e+1)))return  true;return s}a=o.next;}if(!o.hasNext)break;o.done&&(s=true);}return o.hasNext&&r.push(a),s}function r(e){let{lazy:t,lazyArgs:n}=e,r=t(...n);return Object.assign(r,{isSingle:t.single??false,index:0,items:[]})}function i(e){return typeof e==`string`||typeof e==`object`&&!!e&&Symbol.iterator in e}
-
-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 (e$1(a)) {
-    if (e$1(b)) {
-      return compare(a, b);
-    }
-    return 1;
-  }
-  return e$1(b) ? -1 : 0;
-}
-function compareNaturalHierarchically(separator = ".", deepestFirst = false) {
-  return (a, b) => {
-    if (a === b) return 0;
-    if (!a) return -1;
-    if (!b) return 1;
-    const aParts = a.split(separator);
-    const bParts = b.split(separator);
-    const minLength = Math.min(aParts.length, bParts.length);
-    for (let i = 0; i < minLength; i++) {
-      const aPart = aParts[i];
-      const bPart = bParts[i];
-      const comparison = compare(aPart, bPart);
-      if (comparison !== 0) {
-        return comparison;
-      }
-    }
-    const diff = aParts.length - bParts.length;
-    return deepestFirst ? -1 * diff : diff;
-  };
-}
-
-export { t$1 as a, compareNaturalHierarchically as b, compareNatural as c, n$1 as n, t };

package/dist/shared/core.78IWAHAE.mjs

@@ -1,332 +0,0 @@
-import { c as customInspectSymbol } from './core.BFd1lU9R.mjs';
-import { e } from './core.BoYfZOBm.mjs';
-import { i as intersection, u as union, d as difference, e as equals } from './core.DbfO90vF.mjs';
-import { s as stringHash } from './core.oSV6SRfk.mjs';
-import { t } from './core.3ZhnKAlZ.mjs';
-import { t as t$1 } from './core.CbT8JVYL.mjs';
-import { b as isDescendantOf, i as isAncestor, e as isString, s as sortNaturalByFqn, d as isSameHierarchy } from './core.CdNCAwq7.mjs';
-import { i as isome } from './core.FZ305VYd.mjs';
-import { i as ifilter } from './core.DRJma0Ol.mjs';
-import { i as invariant } from './core.D4npX2q8.mjs';
-
-function isNestedConnection(nested, parent) {
-  if (!parent) {
-    const p = nested;
-    return (n) => isNestedConnection(n, p);
-  }
-  const isSameSource = nested.source === parent.source;
-  const isSameTarget = nested.target === parent.target;
-  if (isSameSource && isSameTarget) {
-    return false;
-  }
-  const isSourceNested = isAncestor(parent.source.id, nested.source.id);
-  const isTargetNested = isAncestor(parent.target.id, nested.target.id);
-  return isSourceNested && isTargetNested || isSameSource && isTargetNested || isSameTarget && isSourceNested;
-}
-function findDeepestNestedConnection(connections, connection) {
-  let deepest = connection;
-  for (const c of connections) {
-    if (isNestedConnection(c, deepest)) {
-      deepest = c;
-    }
-  }
-  return deepest !== connection ? deepest : null;
-}
-function sortDeepestFirst(connections) {
-  const sorted = [];
-  const unsorted = connections.slice();
-  let next;
-  while (next = unsorted.shift()) {
-    let deepest;
-    while (deepest = findDeepestNestedConnection(unsorted, next)) {
-      const index = unsorted.indexOf(deepest);
-      sorted.push(unsorted.splice(index, 1)[0]);
-    }
-    sorted.push(next);
-  }
-  return sorted;
-}
-function boundaryHierarchy(conn) {
-  return conn.boundary?.id ? `.${conn.boundary.id}` : "";
-}
-function sortConnectionsByBoundaryHierarchy(connections, sort) {
-  if (!connections || isString(connections)) {
-    const dir = connections ?? "asc";
-    return (arr) => _sortByBoundary(arr, dir);
-  }
-  return _sortByBoundary(connections, sort ?? "asc");
-}
-function _sortByBoundary(connections, order) {
-  return t(
-    connections,
-    t$1((conn) => ({
-      id: boundaryHierarchy(conn),
-      conn
-    })),
-    sortNaturalByFqn(order),
-    t$1((p) => p.conn)
-  );
-}
-function findAscendingConnections(connections, connection) {
-  return connections.filter((c) => isNestedConnection(connection, c));
-}
-function findDescendantConnections(connections, connection) {
-  return connections.filter(isNestedConnection(connection));
-}
-function mergeConnections(connections) {
-  const map2 = /* @__PURE__ */ new Map();
-  for (const conn of connections) {
-    const existing = map2.get(conn.id);
-    if (existing) {
-      map2.set(conn.id, conn.mergeWith(existing));
-    } else {
-      map2.set(conn.id, conn);
-    }
-  }
-  return [...map2.values()];
-}
-function differenceConnections(source, exclude) {
-  const minus = new Map([...exclude].map((c) => [c.id, c]));
-  return [...source].reduce((acc, c) => {
-    const other = minus.get(c.id);
-    if (!other) {
-      acc.push(c);
-      return acc;
-    }
-    const updated = c.difference(other);
-    if (updated.nonEmpty()) {
-      acc.push(updated);
-    }
-    return acc;
-  }, []);
-}
-function hasSameSourceTarget(a, b) {
-  if (b) {
-    return a.source === b.source && a.target === b.target;
-  }
-  return (b2) => a.source === b2.source && a.target === b2.target;
-}
-function hasSameSource(a, b) {
-  if (b) {
-    return a.source === b.source;
-  }
-  return (b2) => a.source === b2.source;
-}
-function hasSameTarget(a, b) {
-  if (b) {
-    return a.target === b.target;
-  }
-  return (b2) => a.target === b2.target;
-}
-function isOutgoing(a, source) {
-  if (!source) {
-    const _source = a;
-    return (b) => isOutgoing(b, _source);
-  }
-  const at = a;
-  return isDescendantOf(at.source, source) && !isDescendantOf(at.target, source);
-}
-function isIncoming(a, target) {
-  if (!target) {
-    const _target = a;
-    return (b) => isIncoming(b, _target);
-  }
-  const at = a;
-  return isDescendantOf(at.target, target) && !isDescendantOf(at.source, target);
-}
-function isAnyInOut(a, source) {
-  if (!source) {
-    const _source = a;
-    return (b) => isAnyInOut(b, _source);
-  }
-  const at = a;
-  return isDescendantOf(at.source, source) !== isDescendantOf(at.target, source);
-}
-
-function findConnection(source, target, direction = "directed") {
-  if (source === target) {
-    return [];
-  }
-  if (isSameHierarchy(source, target)) {
-    return [];
-  }
-  const directedIntersection = intersection(source.allOutgoing, target.allIncoming);
-  const directed = directedIntersection.size > 0 ? new ConnectionModel(
-    source,
-    target,
-    directedIntersection
-  ) : null;
-  if (direction === "directed") {
-    return directed ? [directed] : [];
-  }
-  const reverseIntersection = intersection(source.allIncoming, target.allOutgoing);
-  const reverse = reverseIntersection.size > 0 ? new ConnectionModel(
-    target,
-    source,
-    reverseIntersection
-  ) : null;
-  if (directed && reverse) {
-    return [directed, reverse];
-  }
-  if (directed) {
-    return [directed];
-  }
-  if (reverse) {
-    return [reverse];
-  }
-  return [];
-}
-function findConnectionsBetween(element, others, direction = "both") {
-  if (element.allIncoming.size === 0 && element.allOutgoing.size === 0) {
-    return [];
-  }
-  const outgoing = [];
-  const incoming = [];
-  for (const _other of others) {
-    if (element === _other) {
-      continue;
-    }
-    for (const found of findConnection(element, _other, direction)) {
-      if (found.source === element) {
-        outgoing.push(found);
-      } else {
-        incoming.push(found);
-      }
-    }
-  }
-  return [
-    ...outgoing,
-    ...incoming
-  ];
-}
-function findConnectionsWithin(elements) {
-  return [...elements].reduce((acc, el, index, array) => {
-    if (index === array.length - 1) {
-      return acc;
-    }
-    acc.push(
-      ...findConnectionsBetween(el, array.slice(index + 1), "both")
-    );
-    return acc;
-  }, []);
-}
-
-const modelConnection = {
-  __proto__: null,
-  findConnection: findConnection,
-  findConnectionsBetween: findConnectionsBetween,
-  findConnectionsWithin: findConnectionsWithin
-};
-
-class ConnectionModel {
-  constructor(source, target, relations = /* @__PURE__ */ new Set()) {
-    this.source = source;
-    this.target = target;
-    this.relations = relations;
-    this.id = stringHash(`model:${source.id}:${target.id}`);
-  }
-  id;
-  _boundary;
-  /**
-   * Common ancestor of the source and target elements.
-   * Represents the boundary of the connection.
-   */
-  get boundary() {
-    return this._boundary ??= this.source.commonAncestor(this.target);
-  }
-  /**
-   * Human readable expression of the connection
-   * Mostly used for testing and debugging
-   */
-  get expression() {
-    return `${this.source.id} -> ${this.target.id}`;
-  }
-  /**
-   * Returns true if only includes relations between the source and target elements.
-   */
-  get isDirect() {
-    return this.nonEmpty() && !this.isImplicit;
-  }
-  /**
-   * Returns true if includes relations between nested elements of the source and target elements.
-   */
-  get isImplicit() {
-    return this.nonEmpty() && isome(this.relations, e(hasSameSourceTarget(this)));
-  }
-  get directRelations() {
-    return new Set(ifilter(this.relations, hasSameSourceTarget(this)));
-  }
-  nonEmpty() {
-    return this.relations.size > 0;
-  }
-  mergeWith(other) {
-    invariant(this.source.id === other.source.id, "Cannot merge connections with different sources");
-    invariant(this.target.id === other.target.id, "Cannot merge connections with different targets");
-    return new ConnectionModel(
-      this.source,
-      this.target,
-      union(this.relations, other.relations)
-    );
-  }
-  difference(other) {
-    return new ConnectionModel(
-      this.source,
-      this.target,
-      difference(this.relations, other.relations)
-    );
-  }
-  intersect(other) {
-    invariant(other instanceof ConnectionModel, "Cannot intersect connection with different type");
-    return new ConnectionModel(
-      this.source,
-      this.target,
-      intersection(this.relations, other.relations)
-    );
-  }
-  equals(other) {
-    invariant(other instanceof ConnectionModel, "Cannot merge connection with different type");
-    const _other = other;
-    return this.id === _other.id && this.source.id === _other.source.id && this.target.id === _other.target.id && equals(this.relations, _other.relations);
-  }
-  /**
-   * Returns a new instance with the updated relations.
-   *
-   * @param relations - A readonly set of `RelationshipModel` instances representing the new relations.
-   * @returns A new `ConnectionModel` instance with the updated relations.
-   */
-  update(relations) {
-    return new ConnectionModel(
-      this.source,
-      this.target,
-      relations
-    );
-  }
-  [customInspectSymbol](_depth, _inspectOptions, _inspect) {
-    const asString = this.toString();
-    Object.defineProperty(asString, "constructor", {
-      value: ConnectionModel,
-      enumerable: false
-    });
-    return asString;
-  }
-  toString() {
-    return [
-      this.expression,
-      this.relations.size ? "  relations:" : "  relations: [ ]",
-      ...[...this.relations].map((c) => "    " + c.expression)
-    ].join("\n");
-  }
-  /**
-   * Creates a new connection with reversed direction (target becomes source and vice versa)
-   * @param search - When true, attempts to find an existing connection between the reversed nodes
-   */
-  reversed(search = false) {
-    if (!search) {
-      return new ConnectionModel(this.target, this.source);
-    }
-    const [found] = findConnection(this.target, this.source, "directed");
-    return found ?? new ConnectionModel(this.target, this.source, /* @__PURE__ */ new Set());
-  }
-}
-
-export { ConnectionModel as C, findDeepestNestedConnection as a, findDescendantConnections as b, hasSameSourceTarget as c, differenceConnections as d, hasSameTarget as e, findAscendingConnections as f, isIncoming as g, hasSameSource as h, isAnyInOut as i, isNestedConnection as j, isOutgoing as k, sortDeepestFirst as l, mergeConnections as m, modelConnection as n, findConnectionsBetween as o, findConnection as p, findConnectionsWithin as q, sortConnectionsByBoundaryHierarchy as s };

package/dist/shared/core.B85MJLTf.mjs

@@ -1,5 +0,0 @@
-function getDefaultExportFromCjs (x) {
-	return x && x.__esModule && Object.prototype.hasOwnProperty.call(x, 'default') ? x['default'] : x;
-}
-
-export { getDefaultExportFromCjs as g };

package/dist/shared/core.BFd1lU9R.mjs

@@ -1,29 +0,0 @@
-import { i as isAncestor } from './core.CdNCAwq7.mjs';
-
-var Connection;
-((Connection2) => {
-  Connection2.isInside = (fqn) => {
-    return (connection) => isAncestor(fqn, connection.source.id) && isAncestor(fqn, connection.target.id);
-  };
-  Connection2.isDirectedBetween = (source, target) => {
-    return (connection) => (connection.source.id === source || isAncestor(source, connection.source.id)) && (connection.target.id === target || isAncestor(target, connection.target.id));
-  };
-  Connection2.isAnyBetween = (source, target) => {
-    const forward = (0, Connection2.isDirectedBetween)(source, target), backward = (0, Connection2.isDirectedBetween)(target, source);
-    return (connection) => forward(connection) || backward(connection);
-  };
-  Connection2.isIncoming = (target) => {
-    return (connection) => (connection.target.id === target || isAncestor(target, connection.target.id)) && !isAncestor(target, connection.source.id);
-  };
-  Connection2.isOutgoing = (source) => {
-    return (connection) => (connection.source.id === source || isAncestor(source, connection.source.id)) && !isAncestor(source, connection.target.id);
-  };
-  Connection2.isAnyInOut = (source) => {
-    const isIn = (0, Connection2.isIncoming)(source), isOut = (0, Connection2.isOutgoing)(source);
-    return (connection) => isIn(connection) || isOut(connection);
-  };
-})(Connection || (Connection = {}));
-
-const customInspectSymbol = /* @__PURE__ */ Symbol.for("nodejs.util.inspect.custom");
-
-export { Connection as C, customInspectSymbol as c };

package/dist/shared/core.BKlholso.mjs

@@ -1,3 +0,0 @@
-function e(e){return !!e}
-
-export { e };