@likec4/core 1.45.0 → 1.46.0

package/dist/shared/{core.DrUt0Lbi.mjs → core.CmGY9blO.mjs}

@@ -1,176 +1,4 @@
 import { EventEmitter } from 'events';
-import { g as getDefaultExportFromCjs } from './core.B85MJLTf.mjs';
-import { r as requireIterator, a as requireSupport } from './core.BdPcbSkN.mjs';
-
-var iteratorExports = requireIterator();
-const Iterator = /*@__PURE__*/getDefaultExportFromCjs(iteratorExports);
-
-/**
- * Obliterator Iter Function
- * ==========================
- *
- * Function coercing values to an iterator. It can be quite useful when needing
- * to handle iterables and iterators the same way.
- */
-
-var iter;
-var hasRequiredIter;
-
-function requireIter () {
-	if (hasRequiredIter) return iter;
-	hasRequiredIter = 1;
-	var Iterator = requireIterator();
-	var support = requireSupport();
-
-	var ARRAY_BUFFER_SUPPORT = support.ARRAY_BUFFER_SUPPORT;
-	var SYMBOL_SUPPORT = support.SYMBOL_SUPPORT;
-
-	function iterOrNull(target) {
-	  // Indexed sequence
-	  if (
-	    typeof target === 'string' ||
-	    Array.isArray(target) ||
-	    (ARRAY_BUFFER_SUPPORT && ArrayBuffer.isView(target))
-	  )
-	    return Iterator.fromSequence(target);
-
-	  // Invalid value
-	  if (typeof target !== 'object' || target === null) return null;
-
-	  // Iterable
-	  if (SYMBOL_SUPPORT && typeof target[Symbol.iterator] === 'function')
-	    return target[Symbol.iterator]();
-
-	  // Iterator duck-typing
-	  if (typeof target.next === 'function') return target;
-
-	  // Invalid object
-	  return null;
-	}
-
-	iter = function iter(target) {
-	  var iterator = iterOrNull(target);
-
-	  if (!iterator)
-	    throw new Error(
-	      'obliterator: target is not iterable nor a valid iterator.'
-	    );
-
-	  return iterator;
-	};
-	return iter;
-}
-
-/* eslint no-constant-condition: 0 */
-
-var take$1;
-var hasRequiredTake;
-
-function requireTake () {
-	if (hasRequiredTake) return take$1;
-	hasRequiredTake = 1;
-	/**
-	 * Obliterator Take Function
-	 * ==========================
-	 *
-	 * Function taking n or every value of the given iterator and returns them
-	 * into an array.
-	 */
-	var iter = requireIter();
-
-	/**
-	 * Take.
-	 *
-	 * @param  {Iterable} iterable - Target iterable.
-	 * @param  {number}   [n]      - Optional number of items to take.
-	 * @return {array}
-	 */
-	take$1 = function take(iterable, n) {
-	  var l = arguments.length > 1 ? n : Infinity,
-	    array = l !== Infinity ? new Array(l) : [],
-	    step,
-	    i = 0;
-
-	  var iterator = iter(iterable);
-
-	  while (true) {
-	    if (i === l) return array;
-
-	    step = iterator.next();
-
-	    if (step.done) {
-	      if (i !== n) array.length = i;
-
-	      return array;
-	    }
-
-	    array[i++] = step.value;
-	  }
-	};
-	return take$1;
-}
-
-var takeExports = requireTake();
-const take = /*@__PURE__*/getDefaultExportFromCjs(takeExports);
-
-/**
- * Obliterator Chain Function
- * ===========================
- *
- * Variadic function combining the given iterables.
- */
-
-var chain$1;
-var hasRequiredChain;
-
-function requireChain () {
-	if (hasRequiredChain) return chain$1;
-	hasRequiredChain = 1;
-	var Iterator = requireIterator();
-	var iter = requireIter();
-
-	/**
-	 * Chain.
-	 *
-	 * @param  {...Iterator} iterables - Target iterables.
-	 * @return {Iterator}
-	 */
-	chain$1 = function chain() {
-	  var iterables = arguments;
-	  var current = null;
-	  var i = -1;
-
-	  /* eslint-disable no-constant-condition */
-	  return new Iterator(function next() {
-	    var step = null;
-
-	    do {
-	      if (current === null) {
-	        i++;
-
-	        if (i >= iterables.length) return {done: true};
-
-	        current = iter(iterables[i]);
-	      }
-
-	      step = current.next();
-
-	      if (step.done === true) {
-	        current = null;
-	        continue;
-	      }
-
-	      break;
-	    } while (true);
-
-	    return step;
-	  });
-	};
-	return chain$1;
-}
-
-var chainExports = requireChain();
-const chain = /*@__PURE__*/getDefaultExportFromCjs(chainExports);
 
 /**
  * Graphology Utilities
@@ -328,6 +156,55 @@ function incrementalIdStartingFromRandomByte() {
   };
 }
 
+/**
+ * Chains multiple iterators into a single iterator.
+ *
+ * @param {...Iterator} iterables
+ * @returns {Iterator}
+ */
+function chain() {
+  const iterables = arguments;
+  let current = null;
+  let i = -1;
+
+  return {
+    [Symbol.iterator]() {
+      return this;
+    },
+    next() {
+      let step = null;
+
+      do {
+        if (current === null) {
+          i++;
+          if (i >= iterables.length) return {done: true};
+          current = iterables[i][Symbol.iterator]();
+        }
+        step = current.next();
+        if (step.done) {
+          current = null;
+          continue;
+        }
+        break;
+        // eslint-disable-next-line no-constant-condition
+      } while (true);
+
+      return step;
+    }
+  };
+}
+
+function emptyIterator() {
+  return {
+    [Symbol.iterator]() {
+      return this;
+    },
+    next() {
+      return {done: true};
+    }
+  };
+}
+
 /**
  * Graphology Custom Errors
  * =========================
@@ -1847,37 +1724,42 @@ function createIterator(object, avoid) {
   let edgeData;
   let i = 0;
 
-  return new Iterator(function next() {
-    do {
-      if (!edgeData) {
-        if (i >= l) return {done: true};
+  return {
+    [Symbol.iterator]() {
+      return this;
+    },
+    next() {
+      do {
+        if (!edgeData) {
+          if (i >= l) return {done: true};
 
-        const k = keys[i++];
+          const k = keys[i++];
 
-        if (k === avoid) {
-          edgeData = undefined;
-          continue;
-        }
+          if (k === avoid) {
+            edgeData = undefined;
+            continue;
+          }
 
-        edgeData = object[k];
-      } else {
-        edgeData = edgeData.next;
-      }
-    } while (!edgeData);
+          edgeData = object[k];
+        } else {
+          edgeData = edgeData.next;
+        }
+      } while (!edgeData);
 
-    return {
-      done: false,
-      value: {
-        edge: edgeData.key,
-        attributes: edgeData.attributes,
-        source: edgeData.source.key,
-        target: edgeData.target.key,
-        sourceAttributes: edgeData.source.attributes,
-        targetAttributes: edgeData.target.attributes,
-        undirected: edgeData.undirected
-      }
-    };
-  });
+      return {
+        done: false,
+        value: {
+          edge: edgeData.key,
+          attributes: edgeData.attributes,
+          source: edgeData.source.key,
+          target: edgeData.target.key,
+          sourceAttributes: edgeData.source.attributes,
+          targetAttributes: edgeData.target.attributes,
+          undirected: edgeData.undirected
+        }
+      };
+    }
+  };
 }
 
 /**
@@ -1948,37 +1830,55 @@ function createIteratorForKey(object, k) {
   let edgeData = object[k];
 
   if (edgeData.next !== undefined) {
-    return new Iterator(function () {
-      if (!edgeData) return {done: true};
+    return {
+      [Symbol.iterator]() {
+        return this;
+      },
+      next() {
+        if (!edgeData) return {done: true};
+
+        const value = {
+          edge: edgeData.key,
+          attributes: edgeData.attributes,
+          source: edgeData.source.key,
+          target: edgeData.target.key,
+          sourceAttributes: edgeData.source.attributes,
+          targetAttributes: edgeData.target.attributes,
+          undirected: edgeData.undirected
+        };
 
-      const value = {
-        edge: edgeData.key,
-        attributes: edgeData.attributes,
-        source: edgeData.source.key,
-        target: edgeData.target.key,
-        sourceAttributes: edgeData.source.attributes,
-        targetAttributes: edgeData.target.attributes,
-        undirected: edgeData.undirected
-      };
+        edgeData = edgeData.next;
 
-      edgeData = edgeData.next;
+        return {
+          done: false,
+          value
+        };
+      }
+    };
+  }
 
+  let done = false;
+  return {
+    [Symbol.iterator]() {
+      return this;
+    },
+    next() {
+      if (done === true) return {done: true};
+      done = true;
       return {
         done: false,
-        value
+        value: {
+          edge: edgeData.key,
+          attributes: edgeData.attributes,
+          source: edgeData.source.key,
+          target: edgeData.target.key,
+          sourceAttributes: edgeData.source.attributes,
+          targetAttributes: edgeData.target.attributes,
+          undirected: edgeData.undirected
+        }
       };
-    });
-  }
-
-  return Iterator.of({
-    edge: edgeData.key,
-    attributes: edgeData.attributes,
-    source: edgeData.source.key,
-    target: edgeData.target.key,
-    sourceAttributes: edgeData.source.attributes,
-    targetAttributes: edgeData.target.attributes,
-    undirected: edgeData.undirected
-  });
+    }
+  };
 }
 
 /**
@@ -1992,10 +1892,7 @@ function createEdgeArray(graph, type) {
   if (graph.size === 0) return [];
 
   if (type === 'mixed' || type === graph.type) {
-    if (typeof Array.from === 'function')
-      return Array.from(graph._edges.keys());
-
-    return take(graph._edges.keys(), graph._edges.size);
+    return Array.from(graph._edges.keys());
   }
 
   const size =
@@ -2067,41 +1964,46 @@ function forEachEdge(breakable, graph, type, callback) {
  * @return {Iterator}
  */
 function createEdgeIterator(graph, type) {
-  if (graph.size === 0) return Iterator.empty();
+  if (graph.size === 0) return emptyIterator();
 
   const shouldFilter = type !== 'mixed' && type !== graph.type;
   const mask = type === 'undirected';
 
   const iterator = graph._edges.values();
 
-  return new Iterator(function next() {
-    let step, data;
+  return {
+    [Symbol.iterator]() {
+      return this;
+    },
+    next() {
+      let step, data;
 
-    // eslint-disable-next-line no-constant-condition
-    while (true) {
-      step = iterator.next();
+      // eslint-disable-next-line no-constant-condition
+      while (true) {
+        step = iterator.next();
 
-      if (step.done) return step;
+        if (step.done) return step;
 
-      data = step.value;
+        data = step.value;
 
-      if (shouldFilter && data.undirected !== mask) continue;
+        if (shouldFilter && data.undirected !== mask) continue;
 
-      break;
-    }
+        break;
+      }
 
-    const value = {
-      edge: data.key,
-      attributes: data.attributes,
-      source: data.source.key,
-      target: data.target.key,
-      sourceAttributes: data.source.attributes,
-      targetAttributes: data.target.attributes,
-      undirected: data.undirected
-    };
+      const value = {
+        edge: data.key,
+        attributes: data.attributes,
+        source: data.source.key,
+        target: data.target.key,
+        sourceAttributes: data.source.attributes,
+        targetAttributes: data.target.attributes,
+        undirected: data.undirected
+      };
 
-    return {value, done: false};
-  });
+      return {value, done: false};
+    }
+  };
 }
 
 /**
@@ -2180,7 +2082,7 @@ function createEdgeArrayForNode(multi, type, direction, nodeData) {
  * @return {Iterator}
  */
 function createEdgeIteratorForNode(type, direction, nodeData) {
-  let iterator = Iterator.empty();
+  let iterator = emptyIterator();
 
   if (type !== 'undirected') {
     if (direction !== 'out' && typeof nodeData.in !== 'undefined')
@@ -2290,7 +2192,7 @@ function createEdgeArrayForPath(type, multi, direction, sourceData, target) {
  * @param  {function} callback   - Function to call.
  */
 function createEdgeIteratorForPath(type, direction, sourceData, target) {
-  let iterator = Iterator.empty();
+  let iterator = emptyIterator();
 
   if (type !== 'undirected') {
     if (
@@ -2873,7 +2775,7 @@ function attachEdgeIteratorCreator(Class, description) {
   Class.prototype[name] = function (source, target) {
     // Early termination
     if (type !== 'mixed' && this.type !== 'mixed' && type !== this.type)
-      return Iterator.empty();
+      return emptyIterator();
 
     if (!arguments.length) return createEdgeIterator(this, type);
 
@@ -3135,33 +3037,38 @@ function createDedupedObjectIterator(visited, nodeData, object) {
 
   let i = 0;
 
-  return new Iterator(function next() {
-    let neighborData = null;
+  return {
+    [Symbol.iterator]() {
+      return this;
+    },
+    next() {
+      let neighborData = null;
 
-    do {
-      if (i >= l) {
-        if (visited) visited.wrap(object);
-        return {done: true};
-      }
+      do {
+        if (i >= l) {
+          if (visited) visited.wrap(object);
+          return {done: true};
+        }
 
-      const edgeData = object[keys[i++]];
+        const edgeData = object[keys[i++]];
 
-      const sourceData = edgeData.source;
-      const targetData = edgeData.target;
+        const sourceData = edgeData.source;
+        const targetData = edgeData.target;
 
-      neighborData = sourceData === nodeData ? targetData : sourceData;
+        neighborData = sourceData === nodeData ? targetData : sourceData;
 
-      if (visited && visited.has(neighborData.key)) {
-        neighborData = null;
-        continue;
-      }
-    } while (neighborData === null);
+        if (visited && visited.has(neighborData.key)) {
+          neighborData = null;
+          continue;
+        }
+      } while (neighborData === null);
 
-    return {
-      done: false,
-      value: {neighbor: neighborData.key, attributes: neighborData.attributes}
-    };
-  });
+      return {
+        done: false,
+        value: {neighbor: neighborData.key, attributes: neighborData.attributes}
+      };
+    }
+  };
 }
 
 function createNeighborIterator(type, direction, nodeData) {
@@ -3174,7 +3081,7 @@ function createNeighborIterator(type, direction, nodeData) {
       return createDedupedObjectIterator(null, nodeData, nodeData[direction]);
   }
 
-  let iterator = Iterator.empty();
+  let iterator = emptyIterator();
 
   // Else we need to keep a set of neighbors not to return duplicates
   // We cheat by querying the other adjacencies
@@ -3466,7 +3373,7 @@ function attachNeighborIteratorCreator(Class, description) {
   Class.prototype[iteratorName] = function (node) {
     // Early termination
     if (type !== 'mixed' && this.type !== 'mixed' && type !== this.type)
-      return Iterator.empty();
+      return emptyIterator();
 
     node = '' + node;
 
@@ -6035,9 +5942,7 @@ class Graph extends EventEmitter {
    * @return {array} - The nodes.
    */
   nodes() {
-    if (typeof Array.from === 'function') return Array.from(this._nodes.keys());
-
-    return take(this._nodes.keys(), this._nodes.size);
+    return Array.from(this._nodes.keys());
   }
 
   /**
@@ -6225,18 +6130,20 @@ class Graph extends EventEmitter {
   nodeEntries() {
     const iterator = this._nodes.values();
 
-    return new Iterator(() => {
-      const step = iterator.next();
-
-      if (step.done) return step;
-
-      const data = step.value;
-
-      return {
-        value: {node: data.key, attributes: data.attributes},
-        done: false
-      };
-    });
+    return {
+      [Symbol.iterator]() {
+        return this;
+      },
+      next() {
+        const step = iterator.next();
+        if (step.done) return step;
+        const data = step.value;
+        return {
+          value: {node: data.key, attributes: data.attributes},
+          done: false
+        };
+      }
+    };
   }
 
   /**---------------------------------------------------------------------------

package/dist/shared/{core.C_Ni6yHl.mjs → core.D0WZutNd.mjs}

@@ -12,6 +12,7 @@ function flattenMarkdownOrString(value) {
   const content = e(value) ? value : value.txt ?? value.md;
   return e$1(content?.trim()) ? content : null;
 }
+const NoneIcon = "none";
 function Fqn(name, parent) {
   return parent ? parent + "." + name : name;
 }
@@ -76,6 +77,7 @@ const scalar = {
   GlobalFqn: GlobalFqn,
   GroupElementKind: GroupElementKind,
   NodeId: NodeId,
+  NoneIcon: NoneIcon,
   ProjectId: ProjectId,
   RelationId: RelationId,
   StepEdgeKind: StepEdgeKind,
@@ -89,4 +91,4 @@ const scalar = {
   stepEdgeId: stepEdgeId
 };
 
-export { DeploymentFqn as D, EdgeId as E, Fqn as F, GroupElementKind as G, NodeId as N, ProjectId as P, RelationId as R, StepEdgeKind as S, ViewId as V, GlobalFqn as a, isGlobalFqn as b, splitGlobalFqn as c, stepEdgeId as d, isStepEdgeId as e, flattenMarkdownOrString as f, extractStep as g, isGroupElementKind as i, scalar as s };
+export { DeploymentFqn as D, EdgeId as E, Fqn as F, GroupElementKind as G, NoneIcon as N, ProjectId as P, RelationId as R, StepEdgeKind as S, ViewId as V, GlobalFqn as a, isGlobalFqn as b, splitGlobalFqn as c, NodeId as d, stepEdgeId as e, flattenMarkdownOrString as f, isStepEdgeId as g, extractStep as h, isGroupElementKind as i, scalar as s };

package/dist/shared/{core.BGFjN3nv.d.mts → core.D4Y4U8Lp.d.mts}

@@ -1,6 +1,6 @@
-import { C as Connection, c as customInspectSymbol } from './core.Cog93roC.mjs';
-import { E as ElementModel, R as RelationshipModel } from './core.CpURdWRM.mjs';
-import { A as Any, U as Unknown, z as EdgeId } from './core.B73yxfPi.mjs';
+import { C as Connection, c as customInspectSymbol } from './core.Byj60hH6.mjs';
+import { E as ElementModel, R as RelationshipModel } from './core.BLG-ADpi.mjs';
+import { A as Any, U as Unknown, z as EdgeId } from './core.BkSYCfRg.mjs';
 
 /**
  * Connection refers to any relationships between two elements,