@likec4/core 1.47.0 → 1.49.0

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

@@ -1,79 +1,179 @@
-import { A as Any, t as toComputed, d as AnyParsed, m as _stage } from '../shared/core.D00YbOhQ.mjs';
-import { f as LikeC4Model } from '../shared/core.BfCKSW-g.mjs';
-import { P as ParsedLikeC4ModelData, C as ComputedLikeC4ModelData, p as ParsedView, r as ComputedView, J as DiagramNode, K as DiagramEdge } from '../shared/core.osFs8tU7.mjs';
-import { H as BaseViewProperties, O as ComputedNode, P as ComputedEdge, B as ViewAutoLayout } from '../shared/core.Dojz4bvg.mjs';
-import { P as ProjectId } from '../shared/core.C_3y3eqV.mjs';
-import { B as BBox } from '../shared/core.BPGOjone.mjs';
-import { N as NonEmptyArray } from '../shared/core.DB0Ue5Wx.mjs';
-import 'type-fest';
-import '../shared/core.CAgYpDtM.mjs';
-import '../shared/core.DC5IAaDT.mjs';
-import '../types/fqnRef.mjs';
-import '../shared/core.CywrQs86.mjs';
-import '../types/expression-model.mjs';
+import { Br as ElementId, Ji as _stage, On as ModelExpression, Pr as AnyParsed, S as ComputedView, Yi as _type, _ as ComputedLikeC4ModelData, at as ComputedNode, b as ParsedLikeC4ModelData, ci as ViewId, cn as AnyIncludePredicate, fn as BaseViewProperties, hn as ViewAutoLayout, ia as NonEmptyArray, ii as Unknown, jr as Any, pi as toComputed, rt as ComputedEdge, sn as AnyExcludePredicate, w as ParsedView } from "../_chunks/guards.mjs";
+import "../types/index.mjs";
+import "../_chunks/theme.mjs";
+import { C as ElementModel, T as RelationshipModel, n as LikeC4Model } from "../_chunks/LikeC4Model.mjs";
+import { B as ViewPredicate } from "../_chunks/_types.mjs";
+import "../_chunks/index.mjs";
+import "../model/index.mjs";
+import { a as LayoutedProjectNode, i as LayoutedProjectEdge, n as ComputedProjectNode, o as LayoutedProjectsView, r as ComputedProjectsView, t as ComputedProjectEdge } from "../_chunks/_types2.mjs";
 
+//#region src/compute-view/compute-view.d.ts
 type ComputeViewResult<V> = {
-    isSuccess: true;
-    error?: undefined;
-    view: V;
+  isSuccess: true;
+  error?: undefined;
+  view: V;
 } | {
-    isSuccess: false;
-    error: Error;
-    view: undefined;
+  isSuccess: false;
+  error: Error;
+  view: undefined;
 };
 declare function unsafeComputeView<A extends Any>(viewsource: ParsedView<A>, likec4model: LikeC4Model<any>): ComputedView<A>;
 declare function computeView<A extends Any>(viewsource: ParsedView<A>, likec4model: LikeC4Model<A>): ComputeViewResult<ComputedView<A>>;
 declare function computeParsedModelData<A extends AnyParsed, B extends toComputed<A> = toComputed<A>>(parsed: ParsedLikeC4ModelData<A>): ComputedLikeC4ModelData<B>;
 declare function computeLikeC4Model<A extends Any, B extends toComputed<A> = toComputed<A>>(parsed: ParsedLikeC4ModelData<A>): LikeC4Model<B>;
-
+//#endregion
+//#region src/compute-view/utils/resolve-extended-views.d.ts
 /**
  * Resolve rules of extended views
  * (Removes invalid views)
  */
 declare function resolveRulesExtendedViews<A extends Any, V extends Record<any, ParsedView<A>>>(unresolvedViews: V): V;
-
+//#endregion
+//#region src/compute-view/utils/with-readable-edges.d.ts
 /**
  * Convert hashed edge ids to human-readable
  * Mostly for testing purposes
  */
-declare function withReadableEdges<V extends ComputedView<any>>({ edges, nodes, ...view }: V, separator?: string): V & {
-    nodeIds: string[];
-    edgeIds: string[];
+declare function withReadableEdges<V extends ComputedView<any>>({
+  edges,
+  nodes,
+  ...view
+}: V, separator?: string): V & {
+  nodeIds: string[];
+  edgeIds: string[];
 };
-declare function viewsWithReadableEdges<A extends Any>({ views, ...model }: ComputedLikeC4ModelData<A>): ComputedLikeC4ModelData<A>;
-
-interface ComputedProjectNode extends ComputedNode {
-    readonly projectId: ProjectId;
-}
-interface ComputedProjectEdge extends ComputedEdge {
-    readonly projectId: ProjectId;
-}
-interface LayoutedProjectNode extends DiagramNode {
-    readonly projectId: ProjectId;
-}
-interface LayoutedProjectEdge extends DiagramEdge {
-    readonly projectId: ProjectId;
-}
+declare function viewsWithReadableEdges<A extends Any>({
+  views,
+  ...model
+}: ComputedLikeC4ModelData<A>): ComputedLikeC4ModelData<A>;
+//#endregion
+//#region src/compute-view/projects-view/compute.d.ts
 /**
- * An overview of projects and their relationships, presented as a graph with nodes and edges.
- * Even though it has same structure as other likec4 views, it is not mixed with them, as it represents a different kind.
+ * Computes an overview of projects and their relationships
  */
-interface ComputedProjectsView extends BaseViewProperties<any> {
-    readonly [_stage]: 'computed';
-    readonly nodes: ReadonlyArray<ComputedProjectNode>;
-    readonly edges: ReadonlyArray<ComputedProjectEdge>;
-    readonly autoLayout: ViewAutoLayout;
-}
-interface LayoutedProjectsView extends BaseViewProperties<any> {
-    readonly [_stage]: 'layouted';
-    readonly nodes: ReadonlyArray<LayoutedProjectNode>;
-    readonly edges: ReadonlyArray<LayoutedProjectEdge>;
-    readonly bounds: BBox;
+declare function computeProjectsView(likec4models: NonEmptyArray<LikeC4Model>): ComputedProjectsView;
+//#endregion
+//#region src/compute-view/relationships-view/_types.d.ts
+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>>;
+};
+//#endregion
+//#region src/compute-view/relationships-view/compute.d.ts
+declare function computeRelationshipsView<M extends Any>(subjectId: ElementId<M>, likec4model: LikeC4Model<M>, scopeViewId: ViewId<M> | null, scope?: 'global' | 'view'): RelationshipsViewData<M>;
+//#endregion
+//#region src/compute-view/relationships-view/utils.d.ts
+/**
+ * Builds a tree structure from a flat list of elements.
+ * @param elements - An iterable of ElementModel instances.
+ * @returns An object containing the sorted elements, a lookup by ID, root elements, parent and children accessors, and a flatten method.
+ * @example
+ * ```ts
+ * const elements = [
+ *   { id: 'A' },
+ *   { id: 'A.B' },
+ *   { id: 'A.B.C' },
+ *   { id: 'A.B.D' },
+ *   { id: 'E' },
+ * ]
+ *
+ * const tree = treeFromElements(elements)
+ *
+ * tree.sorted.map(e => e.id) // ['A', 'A.B', 'A.B.C', 'A.B.D', 'E']
+ *
+ * tree.byId('A.B').id // 'A.B'
+ *
+ * [...tree.root].map(e => e.id) // ['A', 'E']
+ *
+ * tree.parent(tree.byId('A.B.C'))?.id // 'A.B'
+ *
+ * tree.children(tree.byId('A')).map(e => e.id) // ['A.B']
+ */
+declare function treeFromElements<M extends Any>(elements: Iterable<ElementModel<M>>): Readonly<{
+  /**
+   * Elements sorted in a way that parents go before their descendants.
+   */
+  sorted: ReadonlyArray<ElementModel<M>>;
+  /**
+   * Get element by its id (FQN)
+   */
+  byId(id: ElementId<M>): ElementModel<M>;
+  /**
+   * Root elements (i.e. those without parents)
+   */
+  root: ReadonlySet<ElementModel<M>>;
+  /**
+   * Get parent element or null if it's a root
+   */
+  parent(el: ElementId<M> | ElementModel<M>): ElementModel<M> | null;
+  /**
+   * Get child elements (i.e. direct descendants)
+   */
+  children(el: ElementId<M> | 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(): ReadonlySet<ElementModel<M>>;
+}>;
+//#endregion
+//#region src/compute-view/adhoc-view/compute.d.ts
+interface AdhocViewIncludePredicate<A extends Any> extends AnyIncludePredicate<ModelExpression<A>> {}
+interface AdhocViewExcludePredicate<A extends Any> extends AnyExcludePredicate<ModelExpression<A>> {}
+type AdhocViewPredicate<A extends Any = Any> = AdhocViewIncludePredicate<A> | AdhocViewExcludePredicate<A>;
+interface ComputedAdhocView extends BaseViewProperties<Any> {
+  readonly [_type]: 'adhoc';
+  readonly [_stage]: 'computed';
+  readonly nodes: ReadonlyArray<ComputedNode>;
+  readonly edges: ReadonlyArray<ComputedEdge>;
+  readonly autoLayout: ViewAutoLayout;
 }
-
 /**
- * Computes an overview of projects and their relationships
+ * Computes an adhoc view based on the given predicates.
+ * Adhoc views are not defined in the model, but computed on demand.
+ * Available for logical model only.
+ *
+ * @param predicates accepts the same predicates as element view.
+ * @param likec4model The LikeC4 model to compute view.
+ * @returns The computed adhoc view.
  */
-declare function computeProjectsView(likec4models: NonEmptyArray<LikeC4Model>): ComputedProjectsView;
-
-export { type ComputeViewResult, type ComputedProjectEdge, type ComputedProjectNode, type ComputedProjectsView, type LayoutedProjectEdge, type LayoutedProjectNode, type LayoutedProjectsView, computeLikeC4Model, computeParsedModelData, computeProjectsView, computeView, resolveRulesExtendedViews, unsafeComputeView, viewsWithReadableEdges, withReadableEdges };
+declare function computeAdhocView<A extends Any>(likec4model: LikeC4Model<A>, predicates: AdhocViewPredicate<NoInfer<A>>[]): ComputedAdhocView;
+//#endregion
+//#region src/compute-view/adhoc-view/builder.d.ts
+/**
+ * Allows you to define type-safe adhoc views using types from the model.
+ */
+declare class AdhocView<A extends Any> {
+  #private;
+  private readonly model;
+  /**
+   * Creates a new adhoc view builder.
+   */
+  static use<A extends Any>(model: LikeC4Model<A>): AdhocView<A>;
+  private constructor();
+  /**
+   * Used to cache the type of the predicates.
+   */
+  readonly Expr: ViewPredicate.AllExpression<ViewPredicate.ElementExpr<A['ElementId']>>;
+  include(...predicates: this['Expr'][]): this;
+  exclude(...predicates: this['Expr'][]): this;
+  compute(): ComputedAdhocView;
+}
+//#endregion
+export { AdhocView, type AdhocViewExcludePredicate, type AdhocViewIncludePredicate, type AdhocViewPredicate, type ComputeViewResult, type ComputedAdhocView, ComputedProjectEdge, ComputedProjectNode, ComputedProjectsView, LayoutedProjectEdge, LayoutedProjectNode, LayoutedProjectsView, type RelationshipsViewData, computeAdhocView, computeLikeC4Model, computeParsedModelData, computeProjectsView, computeRelationshipsView, computeView, resolveRulesExtendedViews, treeFromElements, unsafeComputeView, viewsWithReadableEdges, withReadableEdges };

package/dist/compute-view/index.mjs

@@ -1,229 +1,2 @@
-import { w as willCreateCycle, t as topologicalSortExports, a as t$4, n as n$1, b as t$9, l as linkNodesWithEdges, c as topologicalSort } from '../shared/core.Dh119QSP.mjs';
-export { d as computeLikeC4Model, e as computeParsedModelData, f as computeView, u as unsafeComputeView } from '../shared/core.Dh119QSP.mjs';
-import { n } from '../shared/core.BhNcrwzK.mjs';
-import { t as t$2 } from '../shared/core.DU5SRqNF.mjs';
-import { r as isExtendsElementView, p as isElementView, _ as _stage } from '../shared/core.DH7TXqXf.mjs';
-import { G as Graph } from '../shared/core.CmGY9blO.mjs';
-import { c as isNonEmptyArray } from '../shared/core.CdNCAwq7.mjs';
-import { t as t$5 } from '../shared/core.CbT8JVYL.mjs';
-import { t as t$3, b as t$8 } from '../shared/core.DjcWextK.mjs';
-import { t as t$1, a as t$7 } from '../shared/core.BsSXS-_R.mjs';
-import { t as t$6, e as e$1 } from '../shared/core.Coi_LOUZ.mjs';
-import { e } from '../shared/core.BP_QHEXs.mjs';
-import { D as DefaultMap } from '../shared/core.BbE4y-yl.mjs';
-import { a as nonNullable, i as invariant } from '../shared/core.D4npX2q8.mjs';
-import { s as stringHash } from '../shared/core.oSV6SRfk.mjs';
-import { preferSummary } from '../types/_aux.mjs';
-import { a as GlobalFqn, P as ProjectId } from '../shared/core.D0WZutNd.mjs';
-
-function t(...t){return t$1(Object.keys,t)}
-
-function resolveRulesExtendedViews(unresolvedViews) {
-  const g = new Graph({
-    type: "directed"
-  });
-  const extendedViews = [];
-  for (const view of t$2(unresolvedViews)) {
-    g.addNode(view.id, { view });
-    if (isExtendsElementView(view)) {
-      extendedViews.push(view);
-    }
-  }
-  if (extendedViews.length === 0) {
-    return unresolvedViews;
-  }
-  for (const view of extendedViews) {
-    if (!g.hasNode(view.extends)) {
-      console.warn(`View "${view.id}" extends from "${view.extends}" which does not exist`);
-      continue;
-    }
-    if (willCreateCycle(g, view.id, view.extends)) {
-      console.warn(`View "${view.id}" extends from "${view.extends}" which creates a cycle`);
-      continue;
-    }
-    g.addDirectedEdge(view.id, view.extends);
-  }
-  const sorted = topologicalSortExports.topologicalSort(g).reverse();
-  return sorted.reduce((acc, id) => {
-    const view = g.getNodeAttribute(id, "view");
-    if (!isExtendsElementView(view)) {
-      acc[view.id] = view;
-      return acc;
-    }
-    const extendsFrom = acc[view.extends];
-    if (!extendsFrom || !isElementView(extendsFrom)) {
-      return acc;
-    }
-    const tags = n([
-      ...extendsFrom.tags ?? [],
-      ...view.tags ?? []
-    ]);
-    const links = [
-      ...extendsFrom.links ?? [],
-      ...view.links ?? []
-    ];
-    acc[view.id] = {
-      ...extendsFrom,
-      ...view,
-      title: view.title ?? extendsFrom.title ?? null,
-      description: view.description ?? extendsFrom.description ?? null,
-      tags,
-      links: isNonEmptyArray(links) ? links : null,
-      rules: [...extendsFrom.rules, ...view.rules]
-    };
-    return acc;
-  }, {});
-}
-
-function withReadableEdges({ edges, nodes, ...view }, separator = ":") {
-  const edgeids = t$4(edges, (e) => [e.id, `${e.source}${separator}${e.target}`]);
-  return {
-    ...view,
-    edges: edges.map((e) => ({
-      ...e,
-      id: edgeids[e.id]
-    })),
-    nodes: nodes.map((n) => ({
-      ...n,
-      inEdges: t$5(n.inEdges, (e) => edgeids[e]),
-      outEdges: t$5(n.outEdges, (e) => edgeids[e])
-    })),
-    nodeIds: nodes.map((n) => n.id),
-    edgeIds: edges.map((e) => edgeids[e.id])
-  };
-}
-function viewsWithReadableEdges({ views, ...model }) {
-  return {
-    ...model,
-    views: t$3(views, (v) => n$1(withReadableEdges(v), ["nodeIds", "edgeIds"]))
-  };
-}
-
-const keysCount = (object) => t(object).length;
-const nodeId = (projectId) => stringHash(projectId);
-function computeProjectsView(likec4models) {
-  const nodesMap = buildNodesForEachModel(likec4models);
-  const key = (from, to) => `${from}->${to}`;
-  const relationships = new DefaultMap((key2) => {
-    const [from, to] = key2.split("->");
-    return {
-      from,
-      to,
-      relationships: /* @__PURE__ */ new Set()
-    };
-  });
-  const relationshipsFromTo = (from, to) => relationships.get(key(from, to)).relationships;
-  const processImportedElement = (model, importedElement) => {
-    const projectId = importedElement.projectId;
-    invariant(projectId !== model.projectId, "Imported element must have a different project id");
-    const incoming = relationshipsFromTo(model.projectId, projectId);
-    for (const rel of importedElement.incoming("direct")) {
-      if (rel.source.projectId === model.projectId) {
-        incoming.add(rel);
-      }
-    }
-    const outgoing = relationshipsFromTo(projectId, model.projectId);
-    for (const rel of importedElement.outgoing("direct")) {
-      if (rel.target.projectId === model.projectId) {
-        outgoing.add(rel);
-      }
-    }
-  };
-  for (const model of likec4models) {
-    if (e(model.$data.imports)) {
-      continue;
-    }
-    for (const [projectId, imported] of t$6(model.$data.imports)) {
-      for (const importedElement of imported) {
-        const fqn = GlobalFqn(projectId, importedElement.id);
-        processImportedElement(
-          model,
-          nonNullable(
-            model.findElement(fqn),
-            `Element ${importedElement.id} from project ${projectId} not found in model ${model.projectId}`
-          )
-        );
-      }
-    }
-  }
-  const edges = Array.from(relationships.entries()).filter(([_, { relationships: relationships2 }]) => relationships2.size > 0).map(([key2, { from, to, relationships: relationshipsSet }]) => {
-    const relationships2 = [...relationshipsSet];
-    invariant(t$7(relationships2, 1), "Relationships set must have at least one relationship");
-    const edge = {
-      id: stringHash(key2),
-      source: nodeId(from),
-      target: nodeId(to),
-      projectId: from,
-      relations: t$5(relationships2, e$1("id")),
-      label: null,
-      color: "gray",
-      parent: null,
-      line: "solid",
-      tags: n(t$8(relationships2, e$1("tags")))
-    };
-    const onlyOne = t$9(relationships2);
-    if (onlyOne) {
-      edge.label = onlyOne.title;
-      edge.description = preferSummary(onlyOne.$relationship) ?? null;
-      edge.technology = onlyOne.technology;
-      edge.color = onlyOne.color;
-      edge.line = onlyOne.line;
-      if (onlyOne.kind) {
-        edge.kind = onlyOne.kind;
-      }
-      if (onlyOne.$relationship.navigateTo) {
-        edge.navigateTo = onlyOne.$relationship.navigateTo;
-      }
-    }
-    return edge;
-  });
-  linkNodesWithEdges(nodesMap, edges);
-  const sorted = topologicalSort({
-    nodes: nodesMap,
-    edges
-  });
-  return {
-    id: "projects-view",
-    [_stage]: "computed",
-    title: "Projects",
-    description: {
-      txt: "Overview of all projects and their relationships"
-    },
-    autoLayout: {
-      direction: "TB"
-    },
-    ...sorted
-  };
-}
-function buildNodesForEachModel(likec4models) {
-  const nodesMap = /* @__PURE__ */ new Map();
-  for (const model of likec4models) {
-    const projectId = ProjectId(model.projectId);
-    const node = {
-      id: nodeId(projectId),
-      kind: "@project",
-      parent: null,
-      projectId,
-      title: model.project.title ?? model.project.id,
-      description: {
-        txt: [
-          `Elements: ${keysCount(model.$data.elements)}`,
-          `Relationships: ${keysCount(model.$data.relations)}`,
-          `Views: ${keysCount(model.$data.views)}`
-        ].join("\n")
-      },
-      shape: "rectangle",
-      children: [],
-      inEdges: [],
-      outEdges: [],
-      color: "primary",
-      level: 0,
-      style: {},
-      tags: []
-    };
-    nodesMap.set(node.id, node);
-  }
-  return nodesMap;
-}
-
-export { computeProjectsView, resolveRulesExtendedViews, viewsWithReadableEdges, withReadableEdges };
+import{r as __toESM}from"../_chunks/rolldown-runtime.mjs";import"../_chunks/libs/defu.mjs";import{$ as r,C as t$3,D as t$4,K as t$7,L as e,Q as t$6,S as n$1,T as t$2,X as t$5,Y as n$2,b as e$2,d as t$10,et as t$9,i as n,m as e$1,r as t,w as t$1,y as t$8}from"../_chunks/libs/remeda.mjs";import{Q as GlobalFqn,_ as isExtendsElementView,_t as _type,bt as preferSummary,g as isElementView,gt as _stage,ot as ViewId,rt as ProjectId}from"../_chunks/RichText.mjs";import{$ as nonNullable,D as ifilter,I as isAncestor,K as isNonEmptyArray,L as isDescendantOf,Q as invariant,U as sortParentsFirst,_ as toArray,r as stringHash,v as toSet,x as imap}from"../_chunks/to-text.mjs";import{n as require_topological_sort,t as require_will_create_cycle}from"../_chunks/libs/graphology-dag.mjs";import{t as import_default_map}from"../_chunks/libs/mnemonist.mjs";import"../_chunks/libs/natural-compare-lite.mjs";import"../_chunks/libs/extend.mjs";import"../_chunks/libs/@mantine/colors-generator.mjs";import{a as unsafeComputeView,c as linkNodesWithEdges,i as computeView,n as computeLikeC4Model,o as computeElementView,r as computeParsedModelData,s as topologicalSort$1,t as $expr}from"../_chunks/Builder.view-element.mjs";import{t as Graph}from"../_chunks/libs/graphology.mjs";var import_topological_sort=require_topological_sort(),import_will_create_cycle=__toESM(require_will_create_cycle(),1);function resolveRulesExtendedViews(i){let a=new Graph({type:`directed`}),o=[];for(let s of t(i))a.addNode(s.id,{view:s}),isExtendsElementView(s)&&o.push(s);if(o.length===0)return i;for(let i of o){if(!a.hasNode(i.extends)){console.warn(`View "${i.id}" extends from "${i.extends}" which does not exist`);continue}if((0,import_will_create_cycle.default)(a,i.id,i.extends)){console.warn(`View "${i.id}" extends from "${i.extends}" which creates a cycle`);continue}a.addDirectedEdge(i.id,i.extends)}return(0,import_topological_sort.topologicalSort)(a).reverse().reduce((i,o)=>{let s=a.getNodeAttribute(o,`view`);if(!isExtendsElementView(s))return i[s.id]=s,i;let c=i[s.extends];if(!c||!isElementView(c))return i;let l=n([...c.tags??[],...s.tags??[]]),u=[...c.links??[],...s.links??[]];return i[s.id]={...c,...s,title:s.title??c.title??null,description:s.description??c.description??null,tags:l,links:isNonEmptyArray(u)?u:null,rules:[...c.rules,...s.rules]},i},{})}function withReadableEdges({edges:i,nodes:a,...o},s=`:`){let c=t$1(i,i=>[i.id,`${i.source}${s}${i.target}`]);return{...o,edges:i.map(i=>({...i,id:c[i.id]})),nodes:a.map(i=>({...i,inEdges:t$2(i.inEdges,i=>c[i]),outEdges:t$2(i.outEdges,i=>c[i])})),nodeIds:a.map(i=>i.id),edgeIds:i.map(i=>c[i.id])}}function viewsWithReadableEdges({views:i,...a}){return{...a,views:t$3(i,i=>n$1(withReadableEdges(i),[`nodeIds`,`edgeIds`]))}}const keysCount=i=>t$4(i).length,nodeId=i=>stringHash(i);function computeProjectsView(i){let a=buildNodesForEachModel(i),o=(i,a)=>`${i}->${a}`,s=new import_default_map.default(i=>{let[a,o]=i.split(`->`);return{from:a,to:o,relationships:new Set}}),d=(i,a)=>s.get(o(i,a)).relationships,p=(i,a)=>{let o=a.projectId;invariant(o!==i.projectId,`Imported element must have a different project id`);let s=d(i.projectId,o);for(let o of a.incoming(`direct`))o.source.projectId===i.projectId&&s.add(o);let c=d(o,i.projectId);for(let o of a.outgoing(`direct`))o.target.projectId===i.projectId&&c.add(o)};for(let a of i)if(!e(a.$data.imports))for(let[i,o]of t$5(a.$data.imports))for(let s of o){let o=GlobalFqn(i,s.id);p(a,nonNullable(a.findElement(o),`Element ${s.id} from project ${i} not found in model ${a.projectId}`))}let m=Array.from(s.entries()).filter(([i,{relationships:a}])=>a.size>0).map(([i,{from:a,to:o,relationships:s}])=>{let l=[...s];invariant(t$6(l,1),`Relationships set must have at least one relationship`);let d={id:stringHash(i),source:nodeId(a),target:nodeId(o),projectId:a,relations:t$2(l,e$1(`id`)),label:null,color:`gray`,parent:null,line:`solid`,tags:n(t$7(l,e$1(`tags`)))},f=t$8(l);return f&&(d.label=f.title,d.description=preferSummary(f.$relationship)??null,d.technology=f.technology,d.color=f.color,d.line=f.line,f.kind&&(d.kind=f.kind),f.$relationship.navigateTo&&(d.navigateTo=f.$relationship.navigateTo)),d});linkNodesWithEdges(a,m);let h=topologicalSort$1({nodes:a,edges:m});return{id:`projects-view`,[_type]:`projects`,[_stage]:`computed`,title:`Projects`,description:{txt:`Overview of all projects and their relationships`},autoLayout:{direction:`TB`},...h}}function buildNodesForEachModel(i){let a=new Map;for(let o of i){let i=ProjectId(o.projectId),s={id:nodeId(i),kind:`@project`,parent:null,projectId:i,title:o.project.title??o.project.id,description:{txt:[`Elements: ${keysCount(o.$data.elements)}`,`Relationships: ${keysCount(o.$data.relations)}`,`Views: ${keysCount(o.$data.views)}`].join(`
+`)},shape:`rectangle`,children:[],inEdges:[],outEdges:[],color:`primary`,level:0,style:{},tags:[]};a.set(s.id,s)}return a}function treeFromElements(i){let o=sortParentsFirst([...i]),s=new Set(o),c=new Map,l=new import_default_map.default(()=>null),u=o.reduce((i,o,u,d)=>(c.set(o.id,o),i.set(o.id,t$9(d,r(u+1),n$2(isDescendantOf(o)),t$10((i,a)=>(s.delete(a),i.some(isAncestor(a))||(i.push(a),l.set(a.id,o)),i),[]))),i),new import_default_map.default(()=>[]));return{sorted:o,byId:i=>nonNullable(c.get(i),`Element not found by id: ${i}`),root:s,parent:i=>l.get(typeof i==`string`?i:i.id),children:i=>u.get(typeof i==`string`?i:i.id),flatten:e$2(()=>new Set([...s,...o.reduce((i,a)=>{let o=u.get(a.id);return o.length===0?(i.push(a),i):(o.length>1&&i.push(...o),i)},[])]))}}const finalize=(i,a)=>i.size>2&&a.size!==i.size?new Set(sortParentsFirst([...treeFromElements(i).flatten(),...a])):i.size>1?new Set(sortParentsFirst([...i])):i;function computeRelationships(i,a,o){let s=i=>a.has(i),c=new Set([i]),l={incomers:new Set,subjects:new Set([i]),outgoers:new Set},u=new Set(o.incoming.flatMap(a=>{if(l.subjects.add(a.target),l.incomers.add(a.source),c.add(a.target),a.target!==i){let o=a.target.parent;for(;o&&o!==i;)c.add(o),o=o.parent}let o=a.source,u=[];for(;u.push(o),!(s(o)||!o.parent);)o=o.parent;return u})),d=new Set(o.outgoing.flatMap(a=>{if(l.subjects.add(a.source),l.outgoers.add(a.target),c.add(a.source),a.source!==i){let o=a.source.parent;for(;o&&o!==i;)c.add(o),o=o.parent}let o=a.target,u=[];for(;u.push(o),!(s(o)||!o.parent);)o=o.parent;return u}));return{incomers:finalize(u,l.incomers),incoming:new Set(o.incoming),subjects:finalize(c,l.subjects),outgoing:new Set(o.outgoing),outgoers:finalize(d,l.outgoers)}}function computeRelationshipsView(i,a,o,s=`global`){let c=o?a.findView(o):null;if(s===`view`)return invariant(c,`Scope view id is required when scope is "view"`),computeScopedRelationshipsView(i,c,a);let l=a.element(i);return computeRelationships(l,toSet(l.ascendingSiblings()),{incoming:[...l.incoming()],outgoing:[...l.outgoing()]})}function computeScopedRelationshipsView(i,a,o){let s=o.element(i),c={incoming:toArray(ifilter(s.incoming(),i=>a.includesRelation(i.id))),outgoing:toArray(ifilter(s.outgoing(),i=>a.includesRelation(i.id)))},l=isDescendantOf(s);return computeRelationships(s,new Set([...s.ascendingSiblings(),...t$9(a.elements(),imap(i=>i.element),ifilter(i=>i!==s&&l(i)))]),c)}function computeAdhocView(i,a){return{...computeElementView(i,{id:ViewId(`adhoc`),_stage:`parsed`,_type:`element`,rules:a,title:null,description:null}),_type:`adhoc`,_stage:`computed`}}var AdhocView=class i{static use(a){return new i(a)}#e=[];constructor(i){this.model=i}Expr;include(...i){return this.#e.push({include:i.map(i=>$expr(i))}),this}exclude(...i){return this.#e.push({exclude:i.map(i=>$expr(i))}),this}compute(){return computeAdhocView(this.model,this.#e)}};export{AdhocView,computeAdhocView,computeLikeC4Model,computeParsedModelData,computeProjectsView,computeRelationshipsView,computeView,resolveRulesExtendedViews,treeFromElements,unsafeComputeView,viewsWithReadableEdges,withReadableEdges};

package/dist/geometry/index.d.mts

@@ -1,109 +1,2 @@
-export { B as BBox, P as Point, R as RectBox, X as XYPoint } from '../shared/core.BPGOjone.mjs';
-
-interface VectorValue {
-    readonly x: number;
-    readonly y: number;
-}
-declare class Vector implements VectorValue {
-    readonly x: number;
-    readonly y: number;
-    constructor(x: number, y: number);
-    static create(position: VectorValue): Vector;
-    static create(x: number, y: number): Vector;
-    /**
-     * Adds two vectors.
-     * @param a The first vector.
-     * @param b The second vector.
-     * @returns The sum of the two vectors.
-     */
-    static add(a: VectorValue, b: VectorValue): VectorValue;
-    /**
-     * Subtracts two vectors.
-     * @param a The first vector.
-     * @param b The second vector.
-     * @returns The difference of the two vectors.
-     */
-    static subtract(a: VectorValue, b: VectorValue): VectorValue;
-    /**
-     * Multiplies a vector by a scalar.
-     * @param a The vector.
-     * @param b The scalar.
-     * @returns The scaled vector.
-     */
-    static multiply(a: VectorValue, b: number): VectorValue;
-    /**
-     * Divides a vector by a scalar.
-     * @param a The vector.
-     * @param b The scalar.
-     * @returns The scaled vector.
-     */
-    static divide(a: VectorValue, b: number): VectorValue;
-    /**
-     * Calculates the dot product of the vectors.
-     * @param a The first vector.
-     * @param b The second vector.
-     * @returns The dot product.
-     */
-    static dot(a: VectorValue, b: VectorValue): number;
-    /**
-     * Adds the given vector to this vector.
-     * @param b The vector to add.
-     * @returns A new vector that is the sum of this vector and the given vector.
-     */
-    add(b: VectorValue): Vector;
-    /**
-     * Subtracts the given vector from this vector.
-     * @param b The vector to subtract.
-     * @returns A new vector that is the difference of this vector and the given vector.
-     */
-    subtract(b: VectorValue): Vector;
-    /**
-     * Multiplies this vector by a scalar.
-     * @param b The scalar to multiply by.
-     * @returns A new vector that is the product of this vector and the given scalar.
-     */
-    multiply(b: number): Vector;
-    /**
-     * Divides this vector by a scalar.
-     * @param b The scalar to divide by.
-     * @returns A new vector that is the quotient of this vector and the given scalar.
-     */
-    divide(b: number): Vector;
-    /**
-     * Calculates the dot product of this vector and another vector.
-     * @param b The other vector.
-     * @returns The dot product.
-     */
-    dot(b: VectorValue): number;
-    /**
-     * Calculates the cross product of this vector and another vector.
-     * The cross product of two 2D vectors is a scalar value: a.x * b.y - a.y * b.x
-     * @param b The other vector.
-     * @returns The cross product as a scalar.
-     */
-    cross(b: VectorValue): number;
-    /**
-     * Calculates the length (magnitude) of this vector.
-     * @returns The length of the vector.
-     */
-    length(): number;
-    /**
-     * Normalizes the vector (makes it unit length, i.e., has a length of 1).
-     * @returns A new vector that is the normalized version of this vector.
-     */
-    normalize(): Vector;
-    /**
-     * Rounds the components of the vector to the nearest integers.
-     * @returns A new vector with rounded components.
-     */
-    round(): Vector;
-    /**
-     * Converts the vector to a plain object.
-     * @returns An object with x and y properties.
-     */
-    toObject(): VectorValue;
-}
-declare function vector(source: VectorValue | Vector): Vector;
-declare function vector(x: number, y: number): Vector;
-
-export { Vector, type VectorValue, vector };
+import { a as RectBox, c as XYPoint, i as BBox, l as convertPoint, n as VectorValue, o as Dimensions, r as vector, s as Point, t as Vector, u as isPoint } from "../_chunks/vector.mjs";
+export { BBox, Dimensions, Point, RectBox, Vector, VectorValue, XYPoint, convertPoint, isPoint, vector };