@likec4/core 1.47.0 → 1.48.0

package/dist/utils/graphology/index.mjs

@@ -1 +1,3 @@
-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,11 @@
-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 "../_chunks/_aux.mjs";
+import "../_chunks/scalar.mjs";
+import "../_chunks/expression.mjs";
+import "../_chunks/fqnRef.mjs";
+import "../_chunks/expression-model.mjs";
+import "../_chunks/index2.mjs";
+import "../_chunks/RichText.mjs";
+import { a as Queue, c as DefaultMap, i as MultiMap, n as BiMap, o as LinkedList, r as Stack, s as DefaultWeakMap } from "../_chunks/libs/mnemonist.mjs";
+import { A as parentFqn, C as compareFqnHierarchically, D as isDescendantOf, E as isAncestor, F as compareNaturalHierarchically, I as commonHead, L as invariant, M as sortNaturalByFqn, N as sortParentsFirst, O as isSameHierarchy, P as compareNatural, R as nonNullable, S as compareByFqnHierarchically, T as hierarchyLevel, _ as isNonEmptyArray, a as difference, b as ancestorsFqn, c as symmetricDifference, d as delay, f as onNextTick, g as isAnyOf, h as hasProp, i as objectHash, j as sortByFqnHierarchically, k as nameFromFqn, l as union, m as memoizeProp, n as markdownToHtml, o as equals, p as promiseNextTick, r as stringHash, s as intersection, t as markdownToText, u as compareRelations, v as isString, w as hierarchyDistance, x as commonAncestor, y as getOrCreate, z as nonexhaustive } from "../_chunks/index7.mjs";
+import { a as ireduce, c as iflatMap, d as ifind, f as ifilter, i as isome, l as iflat, n as toArray, o as imap, p as isIterable, r as toSet, s as ihead, t as iunique, u as ifirst } from "../_chunks/index8.mjs";
+export { BiMap, DefaultMap, DefaultWeakMap, LinkedList, MultiMap, Queue, Stack, ancestorsFqn, commonAncestor, commonHead, compareByFqnHierarchically, compareFqnHierarchically, compareNatural, compareNaturalHierarchically, compareRelations, delay, difference, equals as equalsSet, getOrCreate, hasProp, hierarchyDistance, hierarchyLevel, ifilter, ifind, ifirst, iflat, iflatMap, ihead, imap, intersection, invariant, ireduce, isAncestor, isAnyOf, isDescendantOf, isIterable, isNonEmptyArray, isSameHierarchy, isString, isome, iunique, markdownToHtml, markdownToText, memoizeProp, nameFromFqn, nonNullable, nonexhaustive, objectHash, onNextTick, parentFqn, promiseNextTick, sortByFqnHierarchically, sortNaturalByFqn, sortParentsFirst, stringHash, symmetricDifference, toArray, toSet, union };

package/dist/utils/index.mjs

@@ -1,44 +1,17 @@
-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';
+import "../_chunks/libs/natural-compare-lite.mjs";
+import { A as sortParentsFirst, C as isAncestor, D as parentFqn, E as nameFromFqn, F as commonHead, I as compareNatural, L as compareNaturalHierarchically, M as isAnyOf, N as isNonEmptyArray, O as sortByFqnHierarchically, P as isString, S as hierarchyLevel, T as isSameHierarchy, _ as ancestorsFqn, a as difference, b as compareFqnHierarchically, c as intersection, d as compareRelations, f as delay, g as getOrCreate, h as memoizeProp, i as objectHash, j as hasProp, k as sortNaturalByFqn, l as symmetricDifference, m as promiseNextTick, n as markdownToHtml, o as equals, p as onNextTick, r as stringHash, t as markdownToText, u as union, v as commonAncestor, w as isDescendantOf, x as hierarchyDistance, y as compareByFqnHierarchically } from "../_chunks/utils.mjs";
+import { n as nonNullable, r as nonexhaustive, t as invariant } from "../_chunks/invariant.mjs";
+import "../_chunks/libs/graphology-dag.mjs";
+import { i as import_linked_list, l as import_stack, n as import_default_map, o as import_multi_map, r as import_default_weak_map, s as import_queue, t as import_bi_map } from "../_chunks/libs/mnemonist.mjs";
+import { a as ireduce, c as iflatMap, d as ifind, f as ifilter, i as isome, l as iflat, n as toArray, o as imap, p as isIterable, r as toSet, s as ihead, t as iunique, u as ifirst } from "../_chunks/iterable.mjs";
+import "../_chunks/libs/defu.mjs";
+import "../_chunks/libs/extend.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 };
+var BiMap = import_bi_map.default;
+var DefaultMap = import_default_map.default;
+var DefaultWeakMap = import_default_weak_map.default;
+var LinkedList = import_linked_list.default;
+var MultiMap = import_multi_map.default;
+var Queue = import_queue.default;
+var Stack = import_stack.default;
+export { BiMap, DefaultMap, DefaultWeakMap, LinkedList, MultiMap, Queue, Stack, ancestorsFqn, commonAncestor, commonHead, compareByFqnHierarchically, compareFqnHierarchically, compareNatural, compareNaturalHierarchically, compareRelations, delay, difference, equals as equalsSet, getOrCreate, hasProp, hierarchyDistance, hierarchyLevel, ifilter, ifind, ifirst, iflat, iflatMap, ihead, imap, intersection, invariant, ireduce, isAncestor, isAnyOf, isDescendantOf, isIterable, isNonEmptyArray, isSameHierarchy, isString, isome, iunique, markdownToHtml, markdownToText, memoizeProp, nameFromFqn, nonNullable, nonexhaustive, objectHash, onNextTick, parentFqn, promiseNextTick, sortByFqnHierarchically, sortNaturalByFqn, sortParentsFirst, stringHash, symmetricDifference, toArray, toSet, union };

package/dist/utils/iterable/index.d.mts

@@ -1,132 +1,9 @@
-export { i as isIterable } from '../../shared/core.DXhDWKFZ.mjs';
-import { c as IteratorLike } from '../../shared/core.DB0Ue5Wx.mjs';
-import 'type-fest';
-
-/**
- * Filters an iterable based on a predicate.
- * Composabel first version of `ifilter`.
- * @signature
- *    ifilter(predicate)(data)
- */
-declare function ifilter<T, S extends T>(predicate: (v: T) => v is S): (iterable: Iterable<T>) => IteratorLike<S>;
-declare function ifilter<T>(predicate: (v: T) => boolean): (iterable: Iterable<T>) => IteratorLike<T>;
-/**
- * Filters an iterable based on a predicate.
- * Data first version of `ifilter`.
- * @signature
- *    ifilter(data, predicate)
- * @example
- *    ifilter(new Set([1, 2, 3]), x => x % 2 === 1) // => Iterable<[1, 3]>
- */
-declare function ifilter<T, S extends T>(iterable: Iterable<T>, predicate: (v: T) => v is S): IteratorLike<S>;
-declare function ifilter<T>(iterable: Iterable<T>, predicate: (v: T) => boolean): IteratorLike<T>;
-
-/**
- * Finds the first element in the iterable that satisfies the predicate.
- * Composable first version of `find`.
- * @signature
- *   ifind(predicate)(data)
- */
-declare function ifind<T, S extends T>(predicate: (item: T) => item is S): (iterable: Iterable<T>) => S | undefined;
-declare function ifind<T>(predicate: (item: T) => boolean): (iterable: Iterable<T>) => T | undefined;
-/**
- * Finds the first element in the iterable that satisfies the predicate.
- * Data first version of `find`.
- * @signature
- *  ifind(data, predicate)
- */
-declare function ifind<T, S extends T>(iterable: Iterable<T>, predicate: (item: T) => item is S): S | undefined;
-declare function ifind<T>(iterable: Iterable<T>, predicate: (item: T) => boolean): T | undefined;
-
-/**
- * Takes the first N elements from an iterable.
- * Composable first version of `ifirst`.
- * @signature
- *   ifirst(count)(data)
- */
-declare function ifirst<T>(count: number): (iterable: Iterable<T>) => IteratorLike<T>;
-/**
- * Takes the first N elements from an iterable.
- * Data first version of `ifirst`.
- * @signature
- *   ifirst(data, count)
- * @example
- *   ifirst([1, 2, 3, 4, 5], 3) // => Iterable<[1, 2, 3]>
- */
-declare function ifirst<T>(iterable: Iterable<T>, count: number): IteratorLike<T>;
-
-declare function iflat(): <T>(iterable: Iterable<IteratorLike<T>>) => IteratorLike<T>;
-declare function iflat<T>(iterable: Iterable<IteratorLike<T>>): IteratorLike<T>;
-
-type FlatMapFunction<T, S> = (item: T) => Iterable<S>;
-/**
- * Maps an iterable using a mapper function and flattens the result by one level.
- * Composable first version of `iflatMap`.
- * @signature
- *   iflatMap(mapper)(data)
- */
-declare function iflatMap<T, S>(mapper: FlatMapFunction<T, S>): (iterable: Iterable<T>) => IteratorLike<S>;
-/**
- * Maps an iterable using a mapper function and flattens the result by one level.
- * Data first version of `iflatMap`.
- * @signature
- *   iflatMap(data, mapper)
- */
-declare function iflatMap<T, S>(iterable: Iterable<T>, mapper: FlatMapFunction<T, S>): IteratorLike<S>;
-
-declare function ihead<T>(): (iterable: Iterable<T>) => T | undefined;
-/**
- * Finds the first element in the iterable that satisfies the predicate.
- * Data first version of `find`.
- * @signature
- *  ifind(data, predicate)
- */
-declare function ihead<T>(iterable: Iterable<T>): T | undefined;
-
-type MapFunction<T, S> = (item: T) => S;
-/**
- * Maps an iterable using a mapper function.
- * Composable first version of `imap`.
- * @signature
- *   imap(mapper)(data)
- */
-declare function imap<T, S>(mapper: MapFunction<T, S>): (iterable: Iterable<T>) => IteratorLike<S>;
-/**
- * Maps an iterable using a mapper function.
- * Data first version of `imap`.
- * @signature
- *   imap(data, mapper)
- */
-declare function imap<T, S>(iterable: Iterable<T>, mapper: MapFunction<T, S>): IteratorLike<S>;
-
-declare function ireduce<T, R>(reducer: (acc: R, item: T) => R, initialValue: R): (iterable: Iterable<T>) => R;
-declare function ireduce<T, R>(iterable: Iterable<T>, reducer: (acc: R, item: T) => R, initialValue: R): R;
-
-/**
- * Checks if at least one element in the iterable satisfies the predicate.
- * Composable first version of `some`.
- * @signature
- *   isome(predicate)(data)
- */
-declare function isome<T>(predicate: (item: T) => boolean): (iterable: Iterable<T>) => boolean;
-/**
- * Checks if at least one element in the iterable satisfies the predicate.
- * Data first version of `some`.
- * @signature
- *  isome(data, predicate)
- */
-declare function isome<T>(iterable: Iterable<T>, predicate: (item: T) => boolean): boolean;
-
-declare function toArray(): <T>(iterable: Iterable<T> | ArrayLike<T>) => T[];
-declare function toArray<T>(iterable: Iterable<T> | ArrayLike<T>): T[];
-declare function toSet(): <T>(iterable: Iterable<T>) => Set<T>;
-declare function toSet<T>(iterable: Iterable<T>): Set<T>;
-
-/**
- * Returns an iterable that yields only unique values.
- * It uses a Set to keep track of the values.
- */
-declare function iunique(): <T>(iterable: Iterable<T>) => IteratorLike<T>;
-declare function iunique<T>(iterable: Iterable<T>): IteratorLike<T>;
-
-export { ifilter, ifind, ifirst, iflat, iflatMap, ihead, imap, ireduce, isome, iunique, toArray, toSet };
+import "../../_chunks/_aux.mjs";
+import "../../_chunks/scalar.mjs";
+import "../../_chunks/expression.mjs";
+import "../../_chunks/fqnRef.mjs";
+import "../../_chunks/expression-model.mjs";
+import "../../_chunks/index2.mjs";
+import "../../_chunks/RichText.mjs";
+import { a as ireduce, c as iflatMap, d as ifind, f as ifilter, i as isome, l as iflat, n as toArray, o as imap, p as isIterable, r as toSet, s as ihead, t as iunique, u as ifirst } from "../../_chunks/index8.mjs";
+export { ifilter, ifind, ifirst, iflat, iflatMap, ihead, imap, ireduce, isIterable, isome, iunique, toArray, toSet };

package/dist/utils/iterable/index.mjs

@@ -1,62 +1,3 @@
-export { i as isIterable } from '../../shared/core.RfnaEmgA.mjs';
-import { e } from '../../shared/core.DRJma0Ol.mjs';
-export { i as ifilter } from '../../shared/core.DRJma0Ol.mjs';
-export { i as ifind } from '../../shared/core.CmPXpJ8l.mjs';
-import { i as invariant } from '../../shared/core.D4npX2q8.mjs';
-import { e as e$1 } from '../../shared/core.C4x8aaWa.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 isome } from '../../shared/core.FZ305VYd.mjs';
+import { a as ireduce, c as iflatMap, d as ifind, f as ifilter, i as isome, l as iflat, n as toArray, o as imap, p as isIterable, r as toSet, s as ihead, t as iunique, u as ifirst } from "../../_chunks/iterable.mjs";
 
-function ifirst(arg1, arg2) {
-  const count = arg2 ?? arg1;
-  invariant(typeof count === "number" && count >= 0, "Count must be a non-negative number");
-  function* _first(iter) {
-    let taken = 0;
-    for (const value of iter) {
-      if (taken >= count) {
-        break;
-      }
-      yield value;
-      taken++;
-    }
-    return;
-  }
-  if (arg2 === void 0) {
-    return (iterable) => _first(iterable);
-  }
-  return _first(arg1);
-}
-
-function iflatMap(arg1, arg2) {
-  const mapper = arg2 ?? arg1;
-  invariant(e(mapper));
-  function* _flatMap(iter) {
-    for (const value of iter) {
-      const mapped = mapper(value);
-      yield* mapped;
-    }
-    return;
-  }
-  if (!arg2) {
-    return _flatMap;
-  }
-  return _flatMap(arg1);
-}
-
-function ireduce(arg1, arg2, arg3) {
-  const reducer = e$1(arg3) ? arg2 : arg1;
-  const initialValue = arg3 ?? arg2;
-  invariant(e(reducer));
-  function _reduce(iter) {
-    let acc = initialValue;
-    for (const value of iter) {
-      acc = reducer(acc, value);
-    }
-    return acc;
-  }
-  return e$1(arg3) ? _reduce(arg1) : _reduce;
-}
-
-export { ifirst, iflatMap, ireduce };
+export { ifilter, ifind, ifirst, iflat, iflatMap, ihead, imap, ireduce, isIterable, isome, iunique, toArray, toSet };

package/dist/utils/mnemonist.d.mts

@@ -0,0 +1,2 @@
+import { a as Queue, c as DefaultMap, i as MultiMap, n as BiMap, o as LinkedList, r as Stack, s as DefaultWeakMap, t as LRUMap } from "../_chunks/libs/mnemonist.mjs";
+export { BiMap, DefaultMap, DefaultWeakMap, LRUMap, LinkedList, MultiMap, Queue, Stack };

package/dist/utils/mnemonist.mjs

@@ -0,0 +1,12 @@
+import "../_chunks/libs/graphology-dag.mjs";
+import { a as import_lru_map, i as import_linked_list, l as import_stack, n as import_default_map, o as import_multi_map, r as import_default_weak_map, s as import_queue, t as import_bi_map } from "../_chunks/libs/mnemonist.mjs";
+
+var BiMap = import_bi_map.default;
+var DefaultMap = import_default_map.default;
+var DefaultWeakMap = import_default_weak_map.default;
+var LRUMap = import_lru_map.default;
+var LinkedList = import_linked_list.default;
+var MultiMap = import_multi_map.default;
+var Queue = import_queue.default;
+var Stack = import_stack.default;
+export { BiMap, DefaultMap, DefaultWeakMap, LRUMap, LinkedList, MultiMap, Queue, Stack };

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@likec4/core",
-  "version": "1.47.0",
+  "version": "1.48.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,18 +102,21 @@
     "access": "public"
   },
   "dependencies": {
-    "type-fest": "^4.41.0"
+    "immer": "^11.1.3",
+    "ohash": "^2.0.11",
+    "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.13",
+    "@rolldown/plugin-node-polyfills": "^1.0.0",
     "@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.7",
     "@types/unist": "3.0.3",
     "chroma-js": "^3.2.0",
     "defu": "^6.1.4",
@@ -129,14 +124,13 @@
     "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",
+    "obuild": "^0.4.20",
     "oxlint": "1.35.0",
     "rehype-format": "5.0.1",
     "rehype-sanitize": "^6.0.0",
@@ -146,18 +140,19 @@
     "remark-parse": "11.0.0",
     "remark-rehype": "11.1.2",
     "remeda": "^2.32.0",
-    "turbo": "2.7.2",
+    "turbo": "2.7.6",
     "typescript": "5.9.3",
-    "unbuild": "3.5.0",
     "unified": "11.0.5",
-    "vitest": "4.0.16",
+    "vitest": "4.0.18",
+    "@likec4/style-preset": "1.48.0",
     "@likec4/devops": "1.42.0",
-    "@likec4/tsconfig": "1.46.1"
+    "@likec4/styles": "1.48.0",
+    "@likec4/tsconfig": "1.48.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/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 };