@likec4/core 1.47.0 → 1.49.0

package/dist/utils/graphology/index.mjs

@@ -1 +1 @@
-export { G as Graph } from '../../shared/core.CmGY9blO.mjs';
+import{t as Graph}from"../../_chunks/libs/graphology.mjs";export{Graph};

package/dist/utils/index.d.mts

@@ -1,124 +1,4 @@
-export { D as DefaultMap } from '../shared/core.CywrQs86.mjs';
-export { B as BiMap, D as DefaultWeakMap, L as LinkedList, M as MultiMap, Q as Queue, a as ancestorsFqn, l as commonAncestor, o as compareByFqnHierarchically, q as compareFqnHierarchically, h as hasProp, r as hierarchyDistance, t as hierarchyLevel, i as invariant, b as isAncestor, v as isAnyOf, c as isDescendantOf, d as isNonEmptyArray, e as isSameHierarchy, f as isString, m as memoizeProp, n as nameFromFqn, j as nonNullable, g as nonexhaustive, p as parentFqn, u as sortByFqnHierarchically, s as sortNaturalByFqn, k as sortParentsFirst } from '../shared/core.OtRNdMxy.mjs';
-import { N as NonEmptyArray } from '../shared/core.DB0Ue5Wx.mjs';
-export { ifilter, ifind, ifirst, iflat, iflatMap, ihead, imap, ireduce, isome, iunique, toArray, toSet } from './iterable/index.mjs';
-export { i as isIterable } from '../shared/core.DXhDWKFZ.mjs';
-import '../shared/core.C_3y3eqV.mjs';
-import 'type-fest';
-
-/**
- * Mnemonist Stack Typings
- * ========================
- */
-declare class Stack<T> implements Iterable<T> {
-
-  // Members
-  size: number;
-
-  // Constructor
-  constructor();
-
-  // Methods
-  clear(): void;
-  push(item: T): number;
-  pop(): T | undefined;
-  peek(): T | undefined;
-  forEach(callback: (item: T, index: number, stack: this) => void, scope?: any): void;
-  toArray(): Array<T>;
-  values(): IterableIterator<T>;
-  entries(): IterableIterator<[number, T]>;
-  [Symbol.iterator](): IterableIterator<T>;
-  toString(): string;
-  toJSON(): Array<T>;
-  inspect(): any;
-
-  // Statics
-  static from<I>(iterable: Iterable<I> | {[key: string]: I}): Stack<I>;
-  static of<I>(...items: Array<I>): Stack<I>;
-}
-
-/**
- * Common head of two arrays
- *
- * @param equals - Equality function, defaults to `Object.is`
- */
-declare function commonHead<T>(sources: ReadonlyArray<T>, targets: ReadonlyArray<T>, equals?: (a: T, b: T) => boolean): T[];
-
-declare function compareNatural(a: string | undefined, b: string | undefined): -1 | 0 | 1;
-/**
- * Compares two strings lexicographically first, then hierarchically based on their depth.\
- * From parent nodes to leaves
- *
- * @example
- * const lines = [
- *   'b.c',
- *   'b',
- *   'a.b.c',
- * ]
- * lines.sort(compareNaturalHierarchically('.'))
- * // [
- * //   'a.b.c',
- * //   'b',
- * //   'b.c',
- * // ]
- */
-declare function compareNaturalHierarchically(separator?: string, deepestFirst?: boolean): (a: string | undefined, b: string | undefined) => number;
-
-declare function getOrCreate<K, V>(map: Map<K, V>, key: K, create: (key: K) => V): V;
-declare function getOrCreate<K extends WeakKey, V>(map: WeakMap<K, V>, key: K, create: (key: K) => V): V;
-
-declare function delay(): Promise<string>;
-declare function delay(ms: number): Promise<string>;
-declare function delay(randomFrom: number, randomTo: number): Promise<string>;
-declare function promiseNextTick(): Promise<void>;
-declare function onNextTick(fn: () => Promise<void> | void): void;
-
-type RelationshipLike = {
-    source: {
-        id: string;
-    };
-    target: {
-        id: string;
-    };
-};
-/**
- * Compares two relations hierarchically.
- * From the most general (implicit) to the most specific (deepest in the tree)
- */
-declare const compareRelations: <T extends RelationshipLike>(a: T, b: T) => number;
-
-/**
- * Returns new set as a union of given sets
- * Keeps order of elements
- */
-declare function union<T>(...sets: ReadonlySet<T>[]): Set<T>;
-/**
- * Returns new set as an intersection of all sets
- * Keeps order from the first set
- */
-declare function intersection<T>(first: ReadonlySet<T>, ...sets: NonEmptyArray<ReadonlySet<NoInfer<T>>>): Set<T>;
-/**
- * Returns new set as a difference of two sets (A-B)
- * Keeps order from the first set
- */
-declare function difference<T>(a: ReadonlySet<T>, b: ReadonlySet<NoInfer<T>>): Set<T>;
-declare function equals<T>(a: ReadonlySet<T>, b: ReadonlySet<T>): boolean;
-declare function symmetricDifference<T>(a: ReadonlySet<T>, b: ReadonlySet<T>): Set<T>;
-
-declare function objectHash(value: any): string;
-
-/**
- * @see https://gist.github.com/victor-homyakov/bcb7d7911e4a388b1c810f8c3ce17bcf
- */
-declare function stringHash(str: string): string;
-
-declare function markdownToHtml(markdown: string): string;
-
-/**
- * Converts markdown to plain text, removing any markdown formatting.
- * @param markdown - The markdown to convert.
- * @returns The plain text.
- */
-declare function markdownToText(markdown: string): string;
-
-export { Stack, commonHead, compareNatural, compareNaturalHierarchically, compareRelations, delay, difference, equals as equalsSet, getOrCreate, intersection, markdownToHtml, markdownToText, objectHash, onNextTick, promiseNextTick, stringHash, symmetricDifference, union };
+import { a as isNonEmptyArray, o as isString } from "../_chunks/guards.mjs";
+import { a as DefaultWeakMap, i as LinkedList, n as MultiMap, o as DefaultMap, r as Queue, t as Stack } from "../_chunks/libs/mnemonist.mjs";
+import { A as commonAncestor, B as sortByFqnHierarchically, C as iflat, D as isIterable, E as ifilter, F as isAncestor, G as sortNatural, H as sortParentsFirst, I as isDescendantOf, J as nonNullable, K as commonHead, L as isSameHierarchy, M as compareFqnHierarchically, N as hierarchyDistance, O as getOrCreate, P as hierarchyLevel, R as nameFromFqn, S as iflatMap, T as ifind, U as compareNatural, V as sortNaturalByFqn, W as compareNaturalHierarchically, Y as nonexhaustive, _ as toSet, a as difference, b as imap, c as symmetricDifference, d as delay, f as onNextTick, g as toArray, h as iunique, i as objectHash, j as compareByFqnHierarchically, k as ancestorsFqn, l as union, m as memoizeProp, n as markdownToHtml, o as equals, p as promiseNextTick, q as invariant, r as stringHash, s as intersection, t as markdownToText, u as compareRelations, v as isome, w as ifirst, x as ihead, y as ireduce, z as parentFqn } from "../_chunks/to-text.mjs";
+export { DefaultMap, DefaultWeakMap, LinkedList, MultiMap, Queue, Stack, ancestorsFqn, commonAncestor, commonHead, compareByFqnHierarchically, compareFqnHierarchically, compareNatural, compareNaturalHierarchically, compareRelations, delay, difference, equals as equalsSet, getOrCreate, hierarchyDistance, hierarchyLevel, ifilter, ifind, ifirst, iflat, iflatMap, ihead, imap, intersection, invariant, ireduce, isAncestor, isDescendantOf, isIterable, isNonEmptyArray, isSameHierarchy, isString, isome, iunique, markdownToHtml, markdownToText, memoizeProp, nameFromFqn, nonNullable, nonexhaustive, objectHash, onNextTick, parentFqn, promiseNextTick, sortByFqnHierarchically, sortNatural, sortNaturalByFqn, sortParentsFirst, stringHash, symmetricDifference, toArray, toSet, union };

package/dist/utils/index.mjs

@@ -1,44 +1 @@
-export { i as invariant, a as nonNullable, n as nonexhaustive } from '../shared/core.D4npX2q8.mjs';
-export { S as Stack, c as commonHead, a as compareRelations, o as objectHash } from '../shared/core.btEq3i3f.mjs';
-export { c as compareNatural, b as compareNaturalHierarchically } from '../shared/core.3ZhnKAlZ.mjs';
-export { a as ancestorsFqn, g as commonAncestor, j as compareByFqnHierarchically, k as compareFqnHierarchically, h as hasProp, l as hierarchyDistance, m as hierarchyLevel, i as isAncestor, q as isAnyOf, b as isDescendantOf, c as isNonEmptyArray, d as isSameHierarchy, e as isString, n as nameFromFqn, p as parentFqn, o as sortByFqnHierarchically, s as sortNaturalByFqn, f as sortParentsFirst } from '../shared/core.CdNCAwq7.mjs';
-export { g as getOrCreate } from '../shared/core.DcS-0zys.mjs';
-export { m as memoizeProp } from '../shared/core.CLSZtnFh.mjs';
-export { d as difference, e as equalsSet, i as intersection, s as symmetricDifference, u as union } from '../shared/core.DbfO90vF.mjs';
-export { s as stringHash } from '../shared/core.oSV6SRfk.mjs';
-export { b as BiMap, d as DefaultWeakMap, l as LinkedList, m as MultiMap, q as Queue } from '../shared/core.BNN-3vPH.mjs';
-export { D as DefaultMap } from '../shared/core.BbE4y-yl.mjs';
-export { i as ifilter } from '../shared/core.DRJma0Ol.mjs';
-export { i as ifind } from '../shared/core.CmPXpJ8l.mjs';
-export { ifirst, iflatMap, ireduce } from './iterable/index.mjs';
-export { i as iflat, a as iunique } from '../shared/core.C4x8aaWa.mjs';
-export { i as ihead } from '../shared/core.uFk_o9X6.mjs';
-export { i as imap, a as toArray, t as toSet } from '../shared/core.C3JowhaZ.mjs';
-export { i as isIterable } from '../shared/core.RfnaEmgA.mjs';
-export { i as isome } from '../shared/core.FZ305VYd.mjs';
-export { m as markdownToHtml, a as markdownToText } from '../shared/core.Bdy3hhTc.mjs';
-
-function e(e,t){let n=Math.ceil(e),r=Math.floor(t);if(r<n)throw RangeError(`randomInteger: The range [${e.toString()},${t.toString()}] contains no integer`);return Math.floor(Math.random()*(r-n+1)+n)}
-
-const DELAY = "LIKEC4_DELAY";
-function delay(...args) {
-  let ms = 100;
-  if (args.length === 2) {
-    ms = e(args[0], args[1]);
-  } else if (args.length === 1) {
-    ms = args[0];
-  }
-  return new Promise((resolve) => {
-    setTimeout(() => {
-      resolve(DELAY);
-    }, ms ?? 100);
-  });
-}
-function promiseNextTick() {
-  return Promise.resolve().then(() => void 0);
-}
-function onNextTick(fn) {
-  void Promise.resolve().then(fn);
-}
-
-export { delay, onNextTick, promiseNextTick };
+import"../_chunks/libs/defu.mjs";import{$ as nonNullable,A as ancestorsFqn,B as parentFqn,C as iflatMap,D as ifilter,E as ifind,F as hierarchyLevel,H as sortNaturalByFqn,I as isAncestor,J as compareNatural,K as isNonEmptyArray,L as isDescendantOf,M as compareByFqnHierarchically,N as compareFqnHierarchically,O as isIterable,P as hierarchyDistance,Q as invariant,R as isSameHierarchy,S as ihead,T as ifirst,U as sortParentsFirst,V as sortByFqnHierarchically,X as sortNatural,Y as compareNaturalHierarchically,Z as commonHead,_ as toArray,a as difference,b as ireduce,c as intersection,d as compareRelations,et as nonexhaustive,f as delay,g as iunique,h as memoizeProp,i as objectHash,j as commonAncestor,k as getOrCreate,l as symmetricDifference,m as promiseNextTick,n as markdownToHtml,o as equals,p as onNextTick,q as isString,r as stringHash,t as markdownToText,u as union,v as toSet,w as iflat,x as imap,y as isome,z as nameFromFqn}from"../_chunks/to-text.mjs";import"../_chunks/libs/graphology-dag.mjs";import{a as import_multi_map,c as import_stack,n as import_default_weak_map,o as import_queue,r as import_linked_list,t as import_default_map}from"../_chunks/libs/mnemonist.mjs";import"../_chunks/libs/natural-compare-lite.mjs";import"../_chunks/libs/extend.mjs";var DefaultMap=import_default_map.default,DefaultWeakMap=import_default_weak_map.default,LinkedList=import_linked_list.default,MultiMap=import_multi_map.default,Queue=import_queue.default,Stack=import_stack.default;export{DefaultMap,DefaultWeakMap,LinkedList,MultiMap,Queue,Stack,ancestorsFqn,commonAncestor,commonHead,compareByFqnHierarchically,compareFqnHierarchically,compareNatural,compareNaturalHierarchically,compareRelations,delay,difference,equals as equalsSet,getOrCreate,hierarchyDistance,hierarchyLevel,ifilter,ifind,ifirst,iflat,iflatMap,ihead,imap,intersection,invariant,ireduce,isAncestor,isDescendantOf,isIterable,isNonEmptyArray,isSameHierarchy,isString,isome,iunique,markdownToHtml,markdownToText,memoizeProp,nameFromFqn,nonNullable,nonexhaustive,objectHash,onNextTick,parentFqn,promiseNextTick,sortByFqnHierarchically,sortNatural,sortNaturalByFqn,sortParentsFirst,stringHash,symmetricDifference,toArray,toSet,union};

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@likec4/core",
-  "version": "1.47.0",
+  "version": "1.49.0",
   "license": "MIT",
   "homepage": "https://likec4.dev",
   "author": "Denis Davydkov <denis@davydkov.com>",
@@ -47,14 +47,6 @@
         "default": "./dist/geometry/index.mjs"
       }
     },
-    "./compute-view/relationships": {
-      "sources": "./src/compute-view/relationships-view/index.ts",
-      "default": {
-        "types": "./dist/compute-view/relationships-view/index.d.mts",
-        "import": "./dist/compute-view/relationships-view/index.mjs",
-        "default": "./dist/compute-view/relationships-view/index.mjs"
-      }
-    },
     "./compute-view": {
       "sources": "./src/compute-view/index.ts",
       "default": {
@@ -110,34 +102,37 @@
     "access": "public"
   },
   "dependencies": {
-    "type-fest": "^4.41.0"
+    "immer": "^11.1.3",
+    "type-fest": "^4.41.0",
+    "zod": "^3.25.76"
   },
   "devDependencies": {
     "@dagrejs/dagre": "1.1.8",
-    "@mantine/colors-generator": "8.3.10",
+    "@mantine/colors-generator": "8.3.14",
+    "@rolldown/plugin-node-polyfills": "^1.0.3",
     "@types/chroma-js": "^3.1.2",
     "@types/extend": "3.0.4",
     "@types/hast": "3.0.4",
     "@types/mdast": "4.0.4",
     "@types/natural-compare-lite": "^1.4.2",
-    "@types/node": "~22.19.3",
-    "@types/object-hash": "^3.0.6",
+    "@types/node": "~22.19.10",
     "@types/unist": "3.0.3",
+    "@typescript/native-preview": "7.0.0-dev.20260208.1",
     "chroma-js": "^3.2.0",
     "defu": "^6.1.4",
     "fdir": "6.4.0",
     "graphology": "^0.26.0",
     "graphology-dag": "^0.4.1",
     "graphology-types": "^0.24.8",
-    "immer": "^11.1.0",
     "mdast-util-from-markdown": "^2.0.2",
-    "mdast-util-to-string": "^4.0.0",
     "mdast-util-to-hast": "^13.2.1",
+    "mdast-util-to-string": "^4.0.0",
     "mnemonist": "0.40.3",
     "natural-compare-lite": "^1.4.0",
-    "object-hash": "^3.0.0",
     "obliterator": "^2.0.5",
-    "oxlint": "1.35.0",
+    "obuild": "^0.4.27",
+    "ohash": "^2.0.11",
+    "oxlint": "1.43.0",
     "rehype-format": "5.0.1",
     "rehype-sanitize": "^6.0.0",
     "rehype-stringify": "10.0.1",
@@ -145,19 +140,20 @@
     "remark-github-blockquote-alert": "^2.0.1",
     "remark-parse": "11.0.0",
     "remark-rehype": "11.1.2",
-    "remeda": "^2.32.0",
-    "turbo": "2.7.2",
+    "remeda": "^2.33.5",
+    "turbo": "2.8.3",
     "typescript": "5.9.3",
-    "unbuild": "3.5.0",
     "unified": "11.0.5",
-    "vitest": "4.0.16",
+    "vitest": "4.0.18",
+    "@likec4/styles": "1.49.0",
+    "@likec4/style-preset": "1.49.0",
     "@likec4/devops": "1.42.0",
-    "@likec4/tsconfig": "1.46.1"
+    "@likec4/tsconfig": "1.49.0"
   },
   "scripts": {
     "typecheck": "tsc -b --verbose",
-    "build": "unbuild",
-    "lint": "run -T eslint src/ --fix",
+    "build": "obuild",
+    "lint": "oxlint --type-aware",
     "lint:package": "pnpx publint ./package.tgz",
     "test": "vitest run --no-isolate",
     "test:watch": "vitest",

package/compute-view/relationships/package.json

@@ -1,4 +0,0 @@
-{
-  "types": "../../dist/compute-view/relationships-view/index.d.mts",
-  "module": "../../dist/compute-view/relationships-view/index.mjs"
-}

package/dist/compute-view/relationships-view/index.d.mts

@@ -1,51 +0,0 @@
-import { A as Any, U as Unknown, a as ElementId, V as ViewId } from '../../shared/core.D00YbOhQ.mjs';
-import { E as ElementModel, R as RelationshipModel, f as LikeC4Model } from '../../shared/core.BfCKSW-g.mjs';
-import 'type-fest';
-import '../../shared/core.DB0Ue5Wx.mjs';
-import '../../shared/core.C_3y3eqV.mjs';
-import '../../shared/core.CAgYpDtM.mjs';
-import '../../shared/core.DC5IAaDT.mjs';
-import '../../types/fqnRef.mjs';
-import '../../shared/core.Dojz4bvg.mjs';
-import '../../types/expression-model.mjs';
-import '../../shared/core.BPGOjone.mjs';
-import '../../shared/core.CywrQs86.mjs';
-import '../../shared/core.osFs8tU7.mjs';
-
-type RelationshipsViewData<M extends Any = Unknown> = {
-    incomers: ReadonlySet<ElementModel<M>>;
-    incoming: ReadonlySet<RelationshipModel<M>>;
-    subjects: ReadonlySet<ElementModel<M>>;
-    outgoing: ReadonlySet<RelationshipModel<M>>;
-    outgoers: ReadonlySet<ElementModel<M>>;
-};
-
-declare function computeRelationshipsView<M extends Any>(subjectId: ElementId<M>, likec4model: LikeC4Model<M>, scopeViewId: ViewId<M> | null, scope?: 'global' | 'view'): RelationshipsViewData<M>;
-
-declare function treeFromElements<M extends Any>(elements: Iterable<ElementModel<M>>): {
-    sorted: readonly ElementModel<M>[];
-    byId: (id: ElementId<M>) => ElementModel<M>;
-    root: ReadonlySet<ElementModel<M>>;
-    parent: (el: ElementModel<M>) => ElementModel<M> | null;
-    children: (el: ElementModel<M>) => ReadonlyArray<ElementModel<M>>;
-    /**
-     * Flattens the tree structure by removing redundant hierarchy levels.
-     * @example
-     *   A
-     *   └── B
-     *       ├── C
-     *       │   └── D
-     *       │       └── E
-     *       └── F
-     *           └── G
-     * becomes
-     *   A
-     *   ├── C
-     *   │   └── E
-     *   └── F
-     *       └── G
-     */
-    flatten: () => Set<ElementModel<M>>;
-};
-
-export { type RelationshipsViewData, computeRelationshipsView, treeFromElements };

package/dist/compute-view/relationships-view/index.mjs

@@ -1,185 +0,0 @@
-import { t } from '../../shared/core.3ZhnKAlZ.mjs';
-import { f as sortParentsFirst, b as isDescendantOf, i as isAncestor } from '../../shared/core.CdNCAwq7.mjs';
-import { D as DefaultMap } from '../../shared/core.BbE4y-yl.mjs';
-import { a as nonNullable, i as invariant } from '../../shared/core.D4npX2q8.mjs';
-import { t as toSet, a as toArray, i as imap } from '../../shared/core.C3JowhaZ.mjs';
-import { i as ifilter } from '../../shared/core.DRJma0Ol.mjs';
-
-function treeFromElements(elements) {
-  const sorted = sortParentsFirst([...elements]);
-  const root = new Set(sorted);
-  const map = new Map(sorted.map((e) => [e._literalId, e]));
-  const parents = new DefaultMap(() => null);
-  const children = sorted.reduce((acc, parent, index, all) => {
-    acc.set(
-      parent,
-      all.slice(index + 1).filter(isDescendantOf(parent)).map((e) => {
-        root.delete(e);
-        return e;
-      }).reduce((acc2, el) => {
-        if (!acc2.some(isAncestor(el))) {
-          acc2.push(el);
-          parents.set(el, parent);
-        }
-        return acc2;
-      }, [])
-    );
-    return acc;
-  }, new DefaultMap(() => []));
-  return {
-    sorted,
-    byId: (id) => nonNullable(map.get(id), `Element not found by id: ${id}`),
-    root,
-    parent: (el) => parents.get(el),
-    children: (el) => children.get(el),
-    /**
-     * Flattens the tree structure by removing redundant hierarchy levels.
-     * @example
-     *   A
-     *   └── B
-     *       ├── C
-     *       │   └── D
-     *       │       └── E
-     *       └── F
-     *           └── G
-     * becomes
-     *   A
-     *   ├── C
-     *   │   └── E
-     *   └── F
-     *       └── G
-     */
-    flatten: () => {
-      return /* @__PURE__ */ new Set([
-        ...root,
-        ...sorted.reduce((acc, el) => {
-          const _children = children.get(el);
-          if (_children.length === 0) {
-            acc.push(el);
-            return acc;
-          }
-          if (_children.length > 1) {
-            acc.push(..._children);
-          }
-          return acc;
-        }, [])
-      ]);
-    }
-  };
-}
-
-const finalize = (elements, explicits) => {
-  if (elements.size > 2 && explicits.size !== elements.size) {
-    return new Set(sortParentsFirst([
-      ...treeFromElements(elements).flatten(),
-      ...explicits
-    ]));
-  }
-  if (elements.size > 1) {
-    return new Set(sortParentsFirst([...elements]));
-  }
-  return elements;
-};
-function computeRelationships(subject, others, relationships) {
-  const isOther = (e) => others.has(e);
-  let subjects = /* @__PURE__ */ new Set([subject]);
-  const explicits = {
-    incomers: /* @__PURE__ */ new Set(),
-    subjects: /* @__PURE__ */ new Set([subject]),
-    outgoers: /* @__PURE__ */ new Set()
-  };
-  let incomers = new Set(relationships.incoming.flatMap((r) => {
-    explicits.subjects.add(r.target);
-    explicits.incomers.add(r.source);
-    subjects.add(r.target);
-    if (r.target !== subject) {
-      let target = r.target.parent;
-      while (target && target !== subject) {
-        subjects.add(target);
-        target = target.parent;
-      }
-    }
-    let source = r.source;
-    const incomerBranch = [];
-    while (true) {
-      incomerBranch.push(source);
-      if (isOther(source) || !source.parent) {
-        break;
-      }
-      source = source.parent;
-    }
-    return incomerBranch;
-  }));
-  let outgoers = new Set(relationships.outgoing.flatMap((r) => {
-    explicits.subjects.add(r.source);
-    explicits.outgoers.add(r.target);
-    subjects.add(r.source);
-    if (r.source !== subject) {
-      let source = r.source.parent;
-      while (source && source !== subject) {
-        subjects.add(source);
-        source = source.parent;
-      }
-    }
-    let target = r.target;
-    const outgoerBranch = [];
-    while (true) {
-      outgoerBranch.push(target);
-      if (isOther(target) || !target.parent) {
-        break;
-      }
-      target = target.parent;
-    }
-    return outgoerBranch;
-  }));
-  return {
-    incomers: finalize(incomers, explicits.incomers),
-    incoming: new Set(relationships.incoming),
-    subjects: finalize(subjects, explicits.subjects),
-    outgoing: new Set(relationships.outgoing),
-    outgoers: finalize(outgoers, explicits.outgoers)
-  };
-}
-function computeRelationshipsView(subjectId, likec4model, scopeViewId, scope = "global") {
-  const view = scopeViewId ? likec4model.findView(scopeViewId) : null;
-  if (scope === "view") {
-    invariant(
-      view,
-      'Scope view id is required when scope is "view"'
-    );
-    return computeScopedRelationshipsView(subjectId, view, likec4model);
-  }
-  const subject = likec4model.element(subjectId);
-  const subjectSiblings = toSet(subject.ascendingSiblings());
-  return computeRelationships(
-    subject,
-    subjectSiblings,
-    {
-      incoming: [...subject.incoming()],
-      outgoing: [...subject.outgoing()]
-    }
-  );
-}
-function computeScopedRelationshipsView(subjectId, view, likec4model) {
-  const subject = likec4model.element(subjectId);
-  let relationships = {
-    incoming: toArray(ifilter(subject.incoming(), (r) => view.includesRelation(r.id))),
-    outgoing: toArray(ifilter(subject.outgoing(), (r) => view.includesRelation(r.id)))
-  };
-  const isDescendant = isDescendantOf(subject);
-  const others = /* @__PURE__ */ new Set([
-    ...subject.ascendingSiblings(),
-    ...t(
-      view.elements(),
-      imap((e) => e.element),
-      ifilter((e) => e !== subject && isDescendant(e))
-    )
-  ]);
-  return computeRelationships(
-    subject,
-    others,
-    relationships
-  );
-}
-
-export { computeRelationshipsView, treeFromElements };

package/dist/model/connection/deployment/index.d.mts

@@ -1,15 +0,0 @@
-export { C as Connection } from '../../../shared/core.DKhRkHRN.mjs';
-export { D as DeploymentConnectionModel, a as findConnection, b as findConnectionsBetween, c as findConnectionsWithin } from '../../../shared/core.tpvDGvdC.mjs';
-import '../../../shared/core.BfCKSW-g.mjs';
-import 'type-fest';
-import '../../../shared/core.CAgYpDtM.mjs';
-import '../../../shared/core.DC5IAaDT.mjs';
-import '../../../shared/core.D00YbOhQ.mjs';
-import '../../../shared/core.DB0Ue5Wx.mjs';
-import '../../../shared/core.C_3y3eqV.mjs';
-import '../../../types/fqnRef.mjs';
-import '../../../shared/core.Dojz4bvg.mjs';
-import '../../../types/expression-model.mjs';
-import '../../../shared/core.BPGOjone.mjs';
-import '../../../shared/core.CywrQs86.mjs';
-import '../../../shared/core.osFs8tU7.mjs';

package/dist/model/connection/deployment/index.mjs

@@ -1,2 +0,0 @@
-export { C as Connection } from '../../../shared/core.BFd1lU9R.mjs';
-export { D as DeploymentConnectionModel, f as findConnection, g as findConnectionsBetween, h as findConnectionsWithin } from '../../../shared/core.BP_QHEXs.mjs';

package/dist/model/connection/index.d.mts

@@ -1,75 +0,0 @@
-import { C as Connection } from '../../shared/core.DKhRkHRN.mjs';
-export { D as DeploymentConnectionModel, f as deployment } from '../../shared/core.tpvDGvdC.mjs';
-export { C as ConnectionModel, f as model } from '../../shared/core.DE9qzhn8.mjs';
-import { I as IterableContainer, R as ReorderedArray } from '../../shared/core.DB0Ue5Wx.mjs';
-import '../../shared/core.BfCKSW-g.mjs';
-import 'type-fest';
-import '../../shared/core.CAgYpDtM.mjs';
-import '../../shared/core.DC5IAaDT.mjs';
-import '../../shared/core.D00YbOhQ.mjs';
-import '../../shared/core.C_3y3eqV.mjs';
-import '../../types/fqnRef.mjs';
-import '../../shared/core.Dojz4bvg.mjs';
-import '../../types/expression-model.mjs';
-import '../../shared/core.BPGOjone.mjs';
-import '../../shared/core.CywrQs86.mjs';
-import '../../shared/core.osFs8tU7.mjs';
-
-/**
- * Check if connection is nested inside another connection
- * (i.e. between descendants)
- */
-declare function isNestedConnection<T extends {
-    id: string;
-}>(parent: WithSourceTarget<NoInfer<T>>): (nested: WithSourceTarget<T>) => boolean;
-declare function isNestedConnection<T extends {
-    id: string;
-}>(nested: WithSourceTarget<T>, parent: WithSourceTarget<T>): boolean;
-type ConnectionElemId = Connection<{
-    readonly id: string;
-}, any>;
-declare function findDeepestNestedConnection<C extends ConnectionElemId>(connections: ReadonlyArray<C>, connection: C): C | null;
-declare function sortDeepestFirst<C extends ConnectionElemId>(connections: ReadonlyArray<C>): C[];
-type WithBoundary = {
-    id: string;
-    boundary: null | {
-        id: string;
-    };
-};
-declare function sortConnectionsByBoundaryHierarchy(sort?: 'asc' | 'desc'): <T extends WithBoundary, A extends IterableContainer<T>>(array: A) => ReorderedArray<A>;
-declare function sortConnectionsByBoundaryHierarchy<T extends WithBoundary, A extends IterableContainer<T>>(array: A, sort?: 'asc' | 'desc'): ReorderedArray<A>;
-/**
- * Find connections that includes given connection (i.e between it's ancestors)
- */
-declare function findAscendingConnections<C extends ConnectionElemId>(connections: ReadonlyArray<C>, connection: C): Array<C>;
-/**
- * Find connections that given connection includes (i.e between it's descendants)
- */
-declare function findDescendantConnections<C extends ConnectionElemId>(connections: ReadonlyArray<C>, connection: C): Array<C>;
-declare function mergeConnections<C extends IterableContainer<Connection<any, any>>>(connections: C): Array<C[number]>;
-/**
- * Excludes the values existing in `other` array.
- * The output maintains the same order as the input.
- */
-declare function differenceConnections<C extends Connection<any, any>>(source: Iterable<C>, exclude: Iterable<C>): C[];
-type WithSourceTarget<T = unknown> = {
-    source: T;
-    target: T;
-};
-declare function hasSameSourceTarget<T>(a: WithSourceTarget<NoInfer<T>>): (b: WithSourceTarget<T>) => boolean;
-declare function hasSameSourceTarget<T>(a: WithSourceTarget<T>, b: WithSourceTarget<T>): boolean;
-declare function hasSameSource<T>(a: WithSourceTarget<NoInfer<T>>): (b: WithSourceTarget<T>) => boolean;
-declare function hasSameSource<T>(a: WithSourceTarget<T>, b: WithSourceTarget<T>): boolean;
-declare function hasSameTarget<T>(a: WithSourceTarget<NoInfer<T>>): (b: WithSourceTarget<T>) => boolean;
-declare function hasSameTarget<T>(a: WithSourceTarget<T>, b: WithSourceTarget<T>): boolean;
-type WithId<T> = {
-    id: T;
-};
-declare function isOutgoing<T extends string>(source: WithId<NoInfer<T>>): (a: WithSourceTarget<WithId<T>>) => boolean;
-declare function isOutgoing<T extends string>(a: WithSourceTarget<WithId<T>>, source: WithId<T>): boolean;
-declare function isIncoming<T extends string>(target: WithId<NoInfer<T>>): (a: WithSourceTarget<WithId<T>>) => boolean;
-declare function isIncoming<T extends string>(a: WithSourceTarget<WithId<T>>, target: WithId<T>): boolean;
-declare function isAnyInOut<T extends string>(source: WithId<NoInfer<T>>): (a: WithSourceTarget<WithId<T>>) => boolean;
-declare function isAnyInOut<T extends string>(a: WithSourceTarget<WithId<T>>, source: WithId<T>): boolean;
-
-export { Connection, differenceConnections, findAscendingConnections, findDeepestNestedConnection, findDescendantConnections, hasSameSource, hasSameSourceTarget, hasSameTarget, isAnyInOut, isIncoming, isNestedConnection, isOutgoing, mergeConnections, sortConnectionsByBoundaryHierarchy, sortDeepestFirst };

package/dist/model/connection/index.mjs

@@ -1,3 +0,0 @@
-export { C as Connection } from '../../shared/core.BFd1lU9R.mjs';
-export { D as DeploymentConnectionModel, d as deployment } from '../../shared/core.BP_QHEXs.mjs';
-export { C as ConnectionModel, d as differenceConnections, f as findAscendingConnections, a as findDeepestNestedConnection, b as findDescendantConnections, h as hasSameSource, c as hasSameSourceTarget, e as hasSameTarget, i as isAnyInOut, g as isIncoming, j as isNestedConnection, k as isOutgoing, m as mergeConnections, n as model, s as sortConnectionsByBoundaryHierarchy, l as sortDeepestFirst } from '../../shared/core.78IWAHAE.mjs';

package/dist/model/connection/model/index.d.mts

@@ -1,15 +0,0 @@
-export { C as Connection } from '../../../shared/core.DKhRkHRN.mjs';
-export { C as ConnectionModel, a as findConnection, b as findConnectionsBetween, c as findConnectionsWithin } from '../../../shared/core.DE9qzhn8.mjs';
-import '../../../shared/core.BfCKSW-g.mjs';
-import 'type-fest';
-import '../../../shared/core.CAgYpDtM.mjs';
-import '../../../shared/core.DC5IAaDT.mjs';
-import '../../../shared/core.D00YbOhQ.mjs';
-import '../../../shared/core.DB0Ue5Wx.mjs';
-import '../../../shared/core.C_3y3eqV.mjs';
-import '../../../types/fqnRef.mjs';
-import '../../../shared/core.Dojz4bvg.mjs';
-import '../../../types/expression-model.mjs';
-import '../../../shared/core.BPGOjone.mjs';
-import '../../../shared/core.CywrQs86.mjs';
-import '../../../shared/core.osFs8tU7.mjs';

package/dist/model/connection/model/index.mjs

@@ -1,2 +0,0 @@
-export { C as Connection } from '../../../shared/core.BFd1lU9R.mjs';
-export { C as ConnectionModel, p as findConnection, o as findConnectionsBetween, q as findConnectionsWithin } from '../../../shared/core.78IWAHAE.mjs';