@likec4/core 1.40.0 → 1.42.0

package/dist/utils/graphology/index.mjs

@@ -0,0 +1 @@
+export { G as Graph } from '../../shared/core.CNgZvKb8.mjs';

package/dist/utils/index.d.mts

@@ -1,6 +1,6 @@
 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, k as commonAncestor, l as compareByFqnHierarchically, o as compareFqnHierarchically, q as hierarchyDistance, r as hierarchyLevel, i as invariant, b as isAncestor, c as isDescendantOf, d as isNonEmptyArray, e as isSameHierarchy, f as isString, m as memoizeProp, n as nameFromFqn, h as nonNullable, g as nonexhaustive, p as parentFqn, t as sortByFqnHierarchically, s as sortNaturalByFqn, j as sortParentsFirst } from '../shared/core.vWJTxpLV.mjs';
-import { N as NonEmptyArray } from '../shared/core.DrvfVXkh.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, 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.D_vkffV4.mjs';
+import { N as NonEmptyArray } from '../shared/core.D5fzJWbF.mjs';
 export { ifilter, ifind, ifirst, iflat, ihead, imap, ireduce, isome, iunique, toArray, toSet } from './iterable/index.mjs';
 export { i as isIterable } from '../shared/core.DXhDWKFZ.mjs';
 import '../shared/core.DX-WYEPA.mjs';
@@ -70,18 +70,19 @@ 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: {
-        model: string;
+        id: string;
     };
     target: {
-        model: string;
+        id: string;
     };
 };
 /**
  * Compares two relations hierarchically.
- * From the most general (implicit) to the most specific.
+ * From the most general (implicit) to the most specific (deepest in the tree)
  */
 declare const compareRelations: <T extends RelationshipLike>(a: T, b: T) => number;
 
@@ -95,6 +96,10 @@ declare function union<T>(...sets: ReadonlySet<T>[]): Set<T>;
  * 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>;
@@ -115,4 +120,4 @@ declare function markdownToHtml(markdown: string): string;
  */
 declare function markdownToText(markdown: string): string;
 
-export { Stack, commonHead, compareNatural, compareNaturalHierarchically, compareRelations, delay, difference, equals as equalsSet, getOrCreate, intersection, markdownToHtml, markdownToText, objectHash, promiseNextTick, stringHash, symmetricDifference, union };
+export { Stack, commonHead, compareNatural, compareNaturalHierarchically, compareRelations, delay, difference, equals as equalsSet, getOrCreate, intersection, markdownToHtml, markdownToText, objectHash, onNextTick, promiseNextTick, stringHash, symmetricDifference, union };

package/dist/utils/index.mjs

@@ -1,26 +1,27 @@
 export { i as invariant, a as nonNullable, n as nonexhaustive } from '../shared/core.D4npX2q8.mjs';
-export { S as Stack, c as commonHead, o as objectHash } from '../shared/core.BB6zA-UU.mjs';
-import { g as commonAncestor, h as compareFqnHierarchically } from '../shared/core.DgttqsJc.mjs';
-export { a as ancestorsFqn, l as compareByFqnHierarchically, j as compareNatural, k as compareNaturalHierarchically, m as hierarchyDistance, o as hierarchyLevel, i as isAncestor, b as isDescendantOf, c as isNonEmptyArray, d as isSameHierarchy, e as isString, n as nameFromFqn, p as parentFqn, q as sortByFqnHierarchically, s as sortNaturalByFqn, f as sortParentsFirst } from '../shared/core.DgttqsJc.mjs';
+export { S as Stack, c as commonHead, a as compareRelations, o as objectHash } from '../shared/core.C8YY6Uub.mjs';
+export { a as ancestorsFqn, k as commonAncestor, l as compareByFqnHierarchically, m as compareFqnHierarchically, g as compareNatural, j as compareNaturalHierarchically, h as hasProp, o as hierarchyDistance, q as hierarchyLevel, i as isAncestor, b as isDescendantOf, c as isNonEmptyArray, d as isSameHierarchy, e as isString, n as nameFromFqn, p as parentFqn, r as sortByFqnHierarchically, s as sortNaturalByFqn, f as sortParentsFirst } from '../shared/core.DRhg-gVU.mjs';
 export { g as getOrCreate } from '../shared/core.DcS-0zys.mjs';
-export { b as markdownToHtml, a as markdownToText, m as memoizeProp } from '../shared/core.CUw_2J9j.mjs';
-import { randomInteger } from 'remeda';
-export { d as difference, e as equalsSet, i as intersection, a as stringHash, s as symmetricDifference, u as union } from '../shared/core.4u1dVmfX.mjs';
-export { b as BiMap, d as DefaultWeakMap, l as LinkedList, m as MultiMap, q as Queue } from '../shared/core.DlG1xWt2.mjs';
-export { D as DefaultMap } from '../shared/core.BuoXfSMj.mjs';
-export { i as ifilter } from '../shared/core.CCD1ID81.mjs';
-export { i as ifind, a as ihead } from '../shared/core.GTgsmXS_.mjs';
-export { i as ifirst, a as ireduce } from '../shared/core.ILwny7BV.mjs';
-export { i as iflat, a as iunique } from '../shared/core.CNGyqkJh.mjs';
-export { i as imap, t as toArray, a as toSet } from '../shared/core.DLpidoWc.mjs';
-export { i as isIterable } from '../shared/core.DoM6aM9N.mjs';
-export { i as isome } from '../shared/core.Be4Jy9Qx.mjs';
+export { m as memoizeProp } from '../shared/core.BR4zXDH-.mjs';
+export { d as difference, e as equalsSet, i as intersection, a as stringHash, s as symmetricDifference, u as union } from '../shared/core.C2TiyjI6.mjs';
+export { b as BiMap, d as DefaultWeakMap, l as LinkedList, m as MultiMap, q as Queue } from '../shared/core.DMMOWQqc.mjs';
+export { D as DefaultMap } from '../shared/core.BbE4y-yl.mjs';
+export { i as ifilter } from '../shared/core.DRJma0Ol.mjs';
+export { i as ifind, a as ihead } from '../shared/core.QJD_fcrc.mjs';
+export { ifirst, ireduce } from './iterable/index.mjs';
+export { i as iflat, a as iunique } from '../shared/core.C4x8aaWa.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.DFi2dOTl.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 = randomInteger(args[0], args[1]);
+    ms = e(args[0], args[1]);
   } else if (args.length === 1) {
     ms = args[0];
   }
@@ -33,25 +34,8 @@ function delay(...args) {
 function promiseNextTick() {
   return Promise.resolve().then(() => void 0);
 }
+function onNextTick(fn) {
+  void Promise.resolve().then(fn);
+}
 
-const compareRelations = (a, b) => {
-  const parentA = commonAncestor(a.source.model, a.target.model);
-  const parentB = commonAncestor(b.source.model, b.target.model);
-  if (parentA && !parentB) {
-    return 1;
-  }
-  if (!parentA && parentB) {
-    return -1;
-  }
-  const compareParents = parentA && parentB ? compareFqnHierarchically(parentA, parentB) : 0;
-  if (compareParents !== 0) {
-    return compareParents;
-  }
-  const compareSource = compareFqnHierarchically(a.source.model, b.source.model);
-  if (compareSource !== 0) {
-    return compareSource;
-  }
-  return compareFqnHierarchically(a.target.model, b.target.model);
-};
-
-export { commonAncestor, compareFqnHierarchically, compareRelations, delay, promiseNextTick };
+export { delay, onNextTick, promiseNextTick };

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

@@ -1,5 +1,5 @@
 export { i as isIterable } from '../../shared/core.DXhDWKFZ.mjs';
-import { c as IteratorLike } from '../../shared/core.DrvfVXkh.mjs';
+import { c as IteratorLike } from '../../shared/core.D5fzJWbF.mjs';
 import 'type-fest';
 
 /**

package/dist/utils/iterable/index.mjs

@@ -1,7 +1,45 @@
-export { i as isIterable } from '../../shared/core.DoM6aM9N.mjs';
-export { i as ifilter } from '../../shared/core.CCD1ID81.mjs';
-export { i as ifind, a as ihead } from '../../shared/core.GTgsmXS_.mjs';
-export { i as ifirst, a as ireduce } from '../../shared/core.ILwny7BV.mjs';
-export { i as iflat, a as iunique } from '../../shared/core.CNGyqkJh.mjs';
-export { i as imap, t as toArray, a as toSet } from '../../shared/core.DLpidoWc.mjs';
-export { i as isome } from '../../shared/core.Be4Jy9Qx.mjs';
+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, a as ihead } from '../../shared/core.QJD_fcrc.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 imap, a as toArray, t as toSet } from '../../shared/core.C3JowhaZ.mjs';
+export { i as isome } from '../../shared/core.FZ305VYd.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 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, ireduce };

package/model/package.json

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

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@likec4/core",
-  "version": "1.40.0",
+  "version": "1.42.0",
   "license": "MIT",
   "homepage": "https://likec4.dev",
   "author": "Denis Davydkov <denis@davydkov.com>",
@@ -13,7 +13,7 @@
   "bugs": "https://github.com/likec4/likec4/issues",
   "files": [
     "dist",
-    "src",
+    "**/package.json",
     "!**/*.spec.ts",
     "!**/*.test-d.ts",
     "!**/__test__/*",
@@ -63,12 +63,12 @@
         "default": "./dist/model/index.mjs"
       }
     },
-    "./utils": {
-      "sources": "./src/utils/index.ts",
+    "./styles": {
+      "sources": "./src/styles/index.ts",
       "default": {
-        "types": "./dist/utils/index.d.mts",
-        "import": "./dist/utils/index.mjs",
-        "default": "./dist/utils/index.mjs"
+        "types": "./dist/styles/index.d.mts",
+        "import": "./dist/styles/index.mjs",
+        "default": "./dist/styles/index.mjs"
       }
     },
     "./types": {
@@ -79,8 +79,22 @@
         "default": "./dist/types/index.mjs"
       }
     },
-    "./src": "./src/index.ts",
-    "./src/*": "./src/*",
+    "./utils/graphology": {
+      "sources": "./src/utils/graphology/index.ts",
+      "default": {
+        "types": "./dist/utils/graphology/index.d.mts",
+        "import": "./dist/utils/graphology/index.mjs",
+        "default": "./dist/utils/graphology/index.mjs"
+      }
+    },
+    "./utils": {
+      "sources": "./src/utils/index.ts",
+      "default": {
+        "types": "./dist/utils/index.d.mts",
+        "import": "./dist/utils/index.mjs",
+        "default": "./dist/utils/index.mjs"
+      }
+    },
     "./package.json": "./package.json"
   },
   "publishConfig": {
@@ -88,6 +102,10 @@
     "access": "public"
   },
   "dependencies": {
+    "type-fest": "^4.41.0"
+  },
+  "devDependencies": {
+    "unified": "11.0.5",
     "mdast-util-from-markdown": "^2.0.2",
     "mdast-util-to-string": "^4.0.0",
     "rehype-format": "5.0.1",
@@ -97,23 +115,19 @@
     "remark-gfm": "4.0.1",
     "remark-parse": "11.0.0",
     "remark-rehype": "11.1.2",
-    "type-fest": "^4.41.0",
-    "unified": "11.0.5",
-    "chroma-js": "^3.1.2",
-    "remeda": "^2.30.0",
-    "defu": "^6.1.4",
-    "@mantine/colors-generator": "8.2.8"
-  },
-  "devDependencies": {
-    "@types/chroma-js": "^3.1.1",
     "@dagrejs/dagre": "1.1.5",
+    "@mantine/colors-generator": "8.3.1",
+    "@types/chroma-js": "^3.1.1",
     "@types/extend": "3.0.4",
     "@types/hast": "3.0.4",
     "@types/mdast": "4.0.4",
     "@types/natural-compare-lite": "^1.4.2",
+    "@types/node": "~20.19.11",
     "@types/object-hash": "^3.0.6",
     "@types/unist": "3.0.3",
-    "@types/node": "~20.19.11",
+    "chroma-js": "^3.1.2",
+    "defu": "^6.1.4",
+    "fdir": "6.4.0",
     "graphology": "^0.25.4",
     "graphology-dag": "^0.4.1",
     "graphology-types": "^0.24.8",
@@ -121,12 +135,14 @@
     "natural-compare-lite": "^1.4.0",
     "object-hash": "^3.0.0",
     "obliterator": "^2.0.5",
-    "fdir": "6.4.0",
-    "turbo": "2.5.6",
+    "oxlint": "1.18.0",
+    "remeda": "^2.31.1",
+    "turbo": "2.5.8",
     "typescript": "5.9.2",
     "unbuild": "3.5.0",
     "vitest": "3.2.4",
-    "@likec4/tsconfig": "1.40.0"
+    "@likec4/devops": "1.41.0",
+    "@likec4/tsconfig": "1.42.0"
   },
   "scripts": {
     "typecheck": "tsc -b --verbose",
@@ -135,7 +151,9 @@
     "lint:package": "pnpx publint ./package.tgz",
     "test": "vitest run --no-isolate",
     "test:watch": "vitest",
-    "clean": "pnpm rimraf dist lib",
+    "clean": "likec4ops clean",
     "pack": "pnpm pack"
-  }
+  },
+  "types": "dist/index.d.mts",
+  "module": "dist/index.mjs"
 }

package/styles/package.json

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

package/types/package.json

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

package/utils/graphology/package.json

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

package/utils/package.json

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

package/dist/shared/core.6_Vp2iiN.mjs

@@ -1,172 +0,0 @@
-import { hasAtLeast } from 'remeda';
-import { i as invariant } from './core.D4npX2q8.mjs';
-
-var BBox;
-((BBox2) => {
-  function center({ x, y, width, height }) {
-    return {
-      x: x + width / 2,
-      y: y + height / 2
-    };
-  }
-  BBox2.center = center;
-  function fromPoints(points) {
-    const { x1, y1, x2, y2 } = RectBox.fromPoints(points);
-    return {
-      x: x1,
-      y: y1,
-      width: x2 - x1,
-      height: y2 - y1
-    };
-  }
-  BBox2.fromPoints = fromPoints;
-  function merge(...boxes) {
-    invariant(hasAtLeast(boxes, 1), "No boxes provided");
-    if (boxes.length === 1) {
-      return boxes[0];
-    }
-    let minX = Infinity;
-    let minY = Infinity;
-    let maxX = -Infinity;
-    let maxY = -Infinity;
-    for (const box of boxes) {
-      minX = Math.min(minX, box.x);
-      minY = Math.min(minY, box.y);
-      maxX = Math.max(maxX, box.x + box.width);
-      maxY = Math.max(maxY, box.y + box.height);
-    }
-    return {
-      x: minX,
-      y: minY,
-      width: maxX - minX,
-      height: maxY - minY
-    };
-  }
-  BBox2.merge = merge;
-  function toRectBox(box) {
-    return {
-      x1: box.x,
-      y1: box.y,
-      x2: box.x + box.width,
-      y2: box.y + box.height
-    };
-  }
-  BBox2.toRectBox = toRectBox;
-  function expand(box, plus) {
-    if (plus === 0) {
-      return box;
-    }
-    return {
-      x: box.x - plus,
-      y: box.y - plus,
-      width: box.width + plus * 2,
-      height: box.height + plus * 2
-    };
-  }
-  BBox2.expand = expand;
-  function shrink(box, minus) {
-    if (minus === 0) {
-      return box;
-    }
-    return {
-      x: box.x + minus,
-      y: box.y + minus,
-      width: box.width - minus * 2,
-      height: box.height - minus * 2
-    };
-  }
-  BBox2.shrink = shrink;
-})(BBox || (BBox = {}));
-var RectBox;
-((RectBox2) => {
-  function center({ x1, y1, x2, y2 }) {
-    return {
-      x: (x1 + x2) / 2,
-      y: (y1 + y2) / 2
-    };
-  }
-  RectBox2.center = center;
-  function fromPoints(points) {
-    invariant(points.length > 0, "At least one point is required");
-    let minX = Infinity;
-    let minY = Infinity;
-    let maxX = -Infinity;
-    let maxY = -Infinity;
-    for (const [x, y] of points) {
-      minX = Math.min(minX, x);
-      minY = Math.min(minY, y);
-      maxX = Math.max(maxX, x);
-      maxY = Math.max(maxY, y);
-    }
-    return {
-      x1: minX,
-      y1: minY,
-      x2: maxX,
-      y2: maxY
-    };
-  }
-  RectBox2.fromPoints = fromPoints;
-  function merge(...boxes) {
-    invariant(boxes.length > 0, "No boxes provided");
-    let minX = Infinity;
-    let minY = Infinity;
-    let maxX = -Infinity;
-    let maxY = -Infinity;
-    for (const box of boxes) {
-      minX = Math.min(minX, box.x1);
-      minY = Math.min(minY, box.y1);
-      maxX = Math.max(maxX, box.x2);
-      maxY = Math.max(maxY, box.y2);
-    }
-    return {
-      x1: minX,
-      y1: minY,
-      x2: maxX,
-      y2: maxY
-    };
-  }
-  RectBox2.merge = merge;
-  function toBBox(box) {
-    return {
-      x: box.x1,
-      y: box.y1,
-      width: box.x2 - box.x1,
-      height: box.y2 - box.y1
-    };
-  }
-  RectBox2.toBBox = toBBox;
-})(RectBox || (RectBox = {}));
-
-function isTagColorSpecified(spec) {
-  const color = typeof spec === "string" ? spec : spec.color;
-  return color.startsWith("#") || color.startsWith("rgb");
-}
-
-const BorderStyles = ["solid", "dashed", "dotted", "none"];
-const ElementShapes = [
-  "rectangle",
-  "person",
-  "browser",
-  "mobile",
-  "cylinder",
-  "storage",
-  "queue"
-];
-const ThemeColors = [
-  "amber",
-  "blue",
-  "gray",
-  "slate",
-  "green",
-  "indigo",
-  "muted",
-  "primary",
-  "red",
-  "secondary",
-  "sky"
-];
-function isThemeColor(color) {
-  return ThemeColors.includes(color);
-}
-
-export { BBox as B, ElementShapes as E, RectBox as R, ThemeColors as T, BorderStyles as a, isThemeColor as b, isTagColorSpecified as i };