@likec4/diagram 1.29.1 → 1.31.0

package/dist/packages/core/src/compute-view/relationships-view/utils.js

@@ -1,68 +0,0 @@
-import { nonNullable } from '../../errors/index.js';
-import { sortParentsFirst, isDescendantOf, isAncestor } from '../../utils/fqn.js';
-import DefaultMap from '../../../../../_virtual/default-map.js';
-
-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;
-        }, [])
-      ]);
-    }
-  };
-}
-
-export { treeFromElements };

package/dist/packages/core/src/errors/index.js

@@ -1,15 +0,0 @@
-function nonNullable(value, message) {
-  if (typeof value === "undefined" || value == null) {
-    const msg = typeof message === "function" ? message() : message;
-    throw new Error(msg ?? `Expected defined value, but received ${value}`);
-  }
-  return value;
-}
-function invariant(condition, message) {
-  if (condition) {
-    return;
-  }
-  throw new Error(message ?? "Invariant failed");
-}
-
-export { invariant, nonNullable };

package/dist/packages/core/src/model/connection/model/ConnectionModel.js

@@ -1,121 +0,0 @@
-import { isNot } from 'remeda';
-import { invariant } from '../../../errors/index.js';
-import { customInspectSymbol } from '../../../utils/const.js';
-import { union, difference, intersection, equals } from '../../../utils/set.js';
-import { stringHash } from '../../../utils/string-hash.js';
-import { hasSameSourceTarget } from '../ops.js';
-import { findConnection } from './find.js';
-import { isome } from '../../../utils/iterable/some.js';
-import { ifilter } from '../../../utils/iterable/filter.js';
-
-class ConnectionModel {
-  constructor(source, target, relations = /* @__PURE__ */ new Set()) {
-    this.source = source;
-    this.target = target;
-    this.relations = relations;
-    this.id = stringHash(`model:${source.id}:${target.id}`);
-  }
-  id;
-  _boundary;
-  /**
-   * Common ancestor of the source and target elements.
-   * Represents the boundary of the connection.
-   */
-  get boundary() {
-    return this._boundary ??= this.source.commonAncestor(this.target);
-  }
-  /**
-   * Human readable expression of the connection
-   * Mostly used for testing and debugging
-   */
-  get expression() {
-    return `${this.source.id} -> ${this.target.id}`;
-  }
-  /**
-   * Returns true if only includes relations between the source and target elements.
-   */
-  get isDirect() {
-    return this.nonEmpty() && !this.isImplicit;
-  }
-  /**
-   * Returns true if includes relations between nested elements of the source and target elements.
-   */
-  get isImplicit() {
-    return this.nonEmpty() && isome(this.relations, isNot(hasSameSourceTarget(this)));
-  }
-  get directRelations() {
-    return new Set(ifilter(this.relations, hasSameSourceTarget(this)));
-  }
-  nonEmpty() {
-    return this.relations.size > 0;
-  }
-  mergeWith(other) {
-    invariant(this.source.id === other.source.id, "Cannot merge connections with different sources");
-    invariant(this.target.id === other.target.id, "Cannot merge connections with different targets");
-    return new ConnectionModel(
-      this.source,
-      this.target,
-      union(this.relations, other.relations)
-    );
-  }
-  difference(other) {
-    return new ConnectionModel(
-      this.source,
-      this.target,
-      difference(this.relations, other.relations)
-    );
-  }
-  intersect(other) {
-    invariant(other instanceof ConnectionModel, "Cannot intersect connection with different type");
-    return new ConnectionModel(
-      this.source,
-      this.target,
-      intersection(this.relations, other.relations)
-    );
-  }
-  equals(other) {
-    invariant(other instanceof ConnectionModel, "Cannot merge connection with different type");
-    return this.id === other.id && this.source.id === other.source.id && this.target.id === other.target.id && equals(this.relations, other.relations);
-  }
-  /**
-   * Returns a new instance with the updated relations.
-   *
-   * @param relations - A readonly set of `RelationshipModel` instances representing the new relations.
-   * @returns A new `ConnectionModel` instance with the updated relations.
-   */
-  update(relations) {
-    return new ConnectionModel(
-      this.source,
-      this.target,
-      relations
-    );
-  }
-  [customInspectSymbol](depth, inspectOptions, inspect) {
-    const asString = this.toString();
-    Object.defineProperty(asString, "constructor", {
-      value: ConnectionModel,
-      enumerable: false
-    });
-    return asString;
-  }
-  toString() {
-    return [
-      this.expression,
-      this.relations.size ? "  relations:" : "  relations: [ ]",
-      ...[...this.relations].map((c) => "    " + c.expression)
-    ].join("\n");
-  }
-  /**
-   * Creates a new connection with reversed direction (target becomes source and vice versa)
-   * @param search - When true, attempts to find an existing connection between the reversed nodes
-   */
-  reversed(search = false) {
-    if (!search) {
-      return new ConnectionModel(this.target, this.source);
-    }
-    const [found] = findConnection(this.target, this.source, "directed");
-    return found ?? new ConnectionModel(this.target, this.source, /* @__PURE__ */ new Set());
-  }
-}
-
-export { ConnectionModel };

package/dist/packages/core/src/model/connection/model/find.js

@@ -1,39 +0,0 @@
-import { isSameHierarchy } from '../../../utils/fqn.js';
-import { intersection } from '../../../utils/set.js';
-import { ConnectionModel } from './ConnectionModel.js';
-
-function findConnection(source, target, direction = "directed") {
-  if (source === target) {
-    return [];
-  }
-  if (isSameHierarchy(source, target)) {
-    return [];
-  }
-  const directedIntersection = intersection(source.allOutgoing, target.allIncoming);
-  const directed = directedIntersection.size > 0 ? new ConnectionModel(
-    source,
-    target,
-    directedIntersection
-  ) : null;
-  if (direction === "directed") {
-    return directed ? [directed] : [];
-  }
-  const reverseIntersection = intersection(source.allIncoming, target.allOutgoing);
-  const reverse = reverseIntersection.size > 0 ? new ConnectionModel(
-    target,
-    source,
-    reverseIntersection
-  ) : null;
-  if (directed && reverse) {
-    return [directed, reverse];
-  }
-  if (directed) {
-    return [directed];
-  }
-  if (reverse) {
-    return [reverse];
-  }
-  return [];
-}
-
-export { findConnection };

package/dist/packages/core/src/model/connection/ops.js

@@ -1,7 +0,0 @@
-import 'remeda';
-
-function hasSameSourceTarget(a, b) {
-  return (b2) => a.source === b2.source && a.target === b2.target;
-}
-
-export { hasSameSourceTarget };

package/dist/packages/core/src/utils/const.js

@@ -1,3 +0,0 @@
-const customInspectSymbol = Symbol.for("nodejs.util.inspect.custom");
-
-export { customInspectSymbol };

package/dist/packages/core/src/utils/fqn.js

@@ -1,51 +0,0 @@
-import { isString } from './guards.js';
-
-const asString = (e) => isString(e) ? e : e.id;
-function isAncestor(arg1, arg2) {
-  const arg1Id = asString(arg1);
-  if (arg2) {
-    const arg2Id = asString(arg2);
-    return arg2Id.startsWith(arg1Id + ".");
-  }
-  return (ancestor) => {
-    const ancestorId = asString(ancestor);
-    return arg1Id.startsWith(ancestorId + ".");
-  };
-}
-function isSameHierarchy(one, another) {
-  if (!another) {
-    return (b) => isSameHierarchy(one, b);
-  }
-  const first = asString(one);
-  const second = asString(another);
-  return first === second || second.startsWith(first + ".") || first.startsWith(second + ".");
-}
-function isDescendantOf(descedant, ancestor) {
-  {
-    return (d) => isAncestor(descedant, d);
-  }
-}
-function findTopAncestor(items, item) {
-  let parent = item;
-  for (const e of items) {
-    if (isAncestor(e, parent)) {
-      parent = e;
-    }
-  }
-  return parent !== item ? parent : null;
-}
-function sortParentsFirst(array) {
-  const result = [];
-  const items = [...array];
-  let item;
-  while (item = items.shift()) {
-    let parent;
-    while (parent = findTopAncestor(items, item)) {
-      result.push(items.splice(items.indexOf(parent), 1)[0]);
-    }
-    result.push(item);
-  }
-  return result;
-}
-
-export { isAncestor, isDescendantOf, isSameHierarchy, sortParentsFirst };

package/dist/packages/core/src/utils/guards.js

@@ -1,7 +0,0 @@
-export { hasAtLeast } from 'remeda';
-
-function isString(value) {
-  return value != null && typeof value === "string";
-}
-
-export { isString };

package/dist/packages/core/src/utils/iterable/filter.js

@@ -1,21 +0,0 @@
-import { isFunction } from 'remeda';
-import { invariant } from '../../errors/index.js';
-
-function ifilter(arg1, arg2) {
-  const pred = arg2 ?? arg1;
-  invariant(isFunction(pred));
-  function* _filter(iter) {
-    for (const value of iter) {
-      if (pred(value)) {
-        yield value;
-      }
-    }
-    return;
-  }
-  if (!arg2) {
-    return _filter;
-  }
-  return _filter(arg1);
-}
-
-export { ifilter };

package/dist/packages/core/src/utils/iterable/find.js

@@ -1,21 +0,0 @@
-import { isFunction } from 'remeda';
-import { invariant } from '../../errors/index.js';
-
-function ifind(arg1, arg2) {
-  const pred = arg2 ?? arg1;
-  invariant(isFunction(pred));
-  function _find(iter) {
-    for (const value of iter) {
-      if (pred(value)) {
-        return value;
-      }
-    }
-    return;
-  }
-  if (!arg2) {
-    return _find;
-  }
-  return _find(arg1);
-}
-
-export { ifind };

package/dist/packages/core/src/utils/iterable/map.js

@@ -1,18 +0,0 @@
-import { isFunction } from 'remeda';
-import { invariant } from '../../errors/index.js';
-
-function imap(arg1, arg2) {
-  const mapper = arg1;
-  invariant(isFunction(mapper));
-  function* _map(iter) {
-    for (const value of iter) {
-      yield mapper(value);
-    }
-    return;
-  }
-  {
-    return _map;
-  }
-}
-
-export { imap };

package/dist/packages/core/src/utils/iterable/some.js

@@ -1,21 +0,0 @@
-import { isFunction } from 'remeda';
-import { invariant } from '../../errors/index.js';
-
-function isome(arg1, arg2) {
-  const pred = arg2 ?? arg1;
-  invariant(isFunction(pred));
-  function _some(iter) {
-    for (const value of iter) {
-      if (pred(value)) {
-        return true;
-      }
-    }
-    return false;
-  }
-  if (!arg2) {
-    return _some;
-  }
-  return _some(arg1);
-}
-
-export { isome };

package/dist/packages/core/src/utils/iterable/to.js

@@ -1,14 +0,0 @@
-function toArray(iterable) {
-  if (iterable) {
-    return Array.from(iterable);
-  }
-  return (it) => Array.from(it);
-}
-function toSet(iterable) {
-  if (iterable) {
-    return new Set(iterable);
-  }
-  return (it) => new Set(it);
-}
-
-export { toArray, toSet };

package/dist/packages/core/src/utils/set.js

@@ -1,48 +0,0 @@
-import { hasAtLeast } from 'remeda';
-import { s as setExports } from '../../../../_virtual/set.js';
-
-function union(...sets) {
-  let result = /* @__PURE__ */ new Set();
-  for (const set of sets) {
-    for (const value of set) {
-      result.add(value);
-    }
-  }
-  return result;
-}
-function intersection(first, ...sets) {
-  let result = /* @__PURE__ */ new Set();
-  if (first.size === 0) {
-    return result;
-  }
-  let other = hasAtLeast(sets, 2) ? setExports.intersection(...sets) : sets[0];
-  if (other.size === 0) {
-    return result;
-  }
-  for (const value of first) {
-    if (other.has(value)) {
-      result.add(value);
-    }
-  }
-  return result;
-}
-function difference(a, b) {
-  if (a.size === 0) {
-    return /* @__PURE__ */ new Set();
-  }
-  if (b.size === 0) {
-    return new Set(a);
-  }
-  let result = /* @__PURE__ */ new Set();
-  for (const value of a) {
-    if (!b.has(value)) {
-      result.add(value);
-    }
-  }
-  return result;
-}
-function equals(a, b) {
-  return a.size === b.size && [...a].every((value) => b.has(value));
-}
-
-export { difference, equals, intersection, union };

package/dist/packages/core/src/utils/string-hash.js

@@ -1,13 +0,0 @@
-import { invariant } from '../errors/index.js';
-
-function stringHash(str) {
-  let hash = 5381;
-  const len = str.length;
-  invariant(len > 0, "stringHash: empty string");
-  for (let i = 0; i < len; i++) {
-    hash = hash * 33 ^ str.charCodeAt(i);
-  }
-  return (hash >>> 0).toString(36);
-}
-
-export { stringHash };