@likec4/core 1.30.0 → 1.32.0

package/dist/shared/{core.Cu-UdkSl.mjs → core.CpXlRyE5.mjs}

@@ -1,19 +1,16 @@
-import { j as getDefaultExportFromCjs, C, h as t } from './core.CQXU9DF7.mjs';
+import { g as getDefaultExportFromCjs, C } from './core.rmvsy0n3.mjs';
 import { u as u$1 } from './core.DbRvwARP.mjs';
-import { i as invariant } from './core.C-YXI-43.mjs';
+import { m } from './core.DoK86JEe.mjs';
+import { i as invariant } from './core.Cy9smucx.mjs';
 
-function d(...e){return u$1(i$2,e,o$1)}var i$2=(e,n)=>e.length<n.length?e.map((t,r)=>[t,n[r]]):n.map((t,r)=>[e[r],t]),o$1=e=>(n,t)=>({hasNext:true,next:[n,e[t]],done:t>=e.length-1});
+function d(...e){return u$1(i,e,o$1)}var i=(e,n)=>e.length<n.length?e.map((t,r)=>[t,n[r]]):n.map((t,r)=>[e[r],t]),o$1=e=>(n,t)=>({hasNext:true,next:[n,e[t]],done:t>=e.length-1});
 
-function i$1(...e){return u$1(r,e)}var r=(e,t)=>e.length>=t;
+function u(...e){return u$1(o,e)}function o(e,a){let n=[];for(let[i,r]of e.entries()){if(!a(r,i,e))break;n.push(r);}return n}
 
-function u(...e){return u$1(i,e)}function i(e,a){let n=[];for(let[o,r]of e.entries()){if(!a(r,o,e))break;n.push(r);}return n}
-
-function m(...a){return u$1(o,a,p)}var o=(a,e)=>a.map(e),p=a=>(e,t,r)=>({done:false,hasNext:true,next:a(e,t,r)});
+function n(e){return e!==void 0}
 
 function l(n){return n!=null}
 
-function n(e){return e!==void 0}
-
 var support = {};
 
 var hasRequiredSupport;
@@ -214,376 +211,6 @@ function requireIterator () {
 	return iterator;
 }
 
-var set = {};
-
-/**
- * Mnemonist Set
- * ==============
- *
- * Useful function related to sets such as union, intersection and so on...
- */
-
-var hasRequiredSet;
-
-function requireSet () {
-	if (hasRequiredSet) return set;
-	hasRequiredSet = 1;
-	(function (exports) {
-		// TODO: optimize versions for less variadicities
-
-		/**
-		 * Variadic function computing the intersection of multiple sets.
-		 *
-		 * @param  {...Set} sets - Sets to intersect.
-		 * @return {Set}         - The intesection.
-		 */
-		exports.intersection = function() {
-		  if (arguments.length < 2)
-		    throw new Error('mnemonist/Set.intersection: needs at least two arguments.');
-
-		  var I = new Set();
-
-		  // First we need to find the smallest set
-		  var smallestSize = Infinity,
-		      smallestSet = null;
-
-		  var s, i, l = arguments.length;
-
-		  for (i = 0; i < l; i++) {
-		    s = arguments[i];
-
-		    // If one of the set has no items, we can stop right there
-		    if (s.size === 0)
-		      return I;
-
-		    if (s.size < smallestSize) {
-		      smallestSize = s.size;
-		      smallestSet = s;
-		    }
-		  }
-
-		  // Now we need to intersect this set with the others
-		  var iterator = smallestSet.values(),
-		      step,
-		      item,
-		      add,
-		      set;
-
-		  // TODO: we can optimize by iterating each next time over the current intersection
-		  // but this probably means more RAM to consume since we'll create n-1 sets rather than
-		  // only the one.
-		  while ((step = iterator.next(), !step.done)) {
-		    item = step.value;
-		    add = true;
-
-		    for (i = 0; i < l; i++) {
-		      set = arguments[i];
-
-		      if (set === smallestSet)
-		        continue;
-
-		      if (!set.has(item)) {
-		        add = false;
-		        break;
-		      }
-		    }
-
-		    if (add)
-		      I.add(item);
-		  }
-
-		  return I;
-		};
-
-		/**
-		 * Variadic function computing the union of multiple sets.
-		 *
-		 * @param  {...Set} sets - Sets to unite.
-		 * @return {Set}         - The union.
-		 */
-		exports.union = function() {
-		  if (arguments.length < 2)
-		    throw new Error('mnemonist/Set.union: needs at least two arguments.');
-
-		  var U = new Set();
-
-		  var i, l = arguments.length;
-
-		  var iterator,
-		      step;
-
-		  for (i = 0; i < l; i++) {
-		    iterator = arguments[i].values();
-
-		    while ((step = iterator.next(), !step.done))
-		      U.add(step.value);
-		  }
-
-		  return U;
-		};
-
-		/**
-		 * Function computing the difference between two sets.
-		 *
-		 * @param  {Set} A - First set.
-		 * @param  {Set} B - Second set.
-		 * @return {Set}   - The difference.
-		 */
-		exports.difference = function(A, B) {
-
-		  // If first set is empty
-		  if (!A.size)
-		    return new Set();
-
-		  if (!B.size)
-		    return new Set(A);
-
-		  var D = new Set();
-
-		  var iterator = A.values(),
-		      step;
-
-		  while ((step = iterator.next(), !step.done)) {
-		    if (!B.has(step.value))
-		      D.add(step.value);
-		  }
-
-		  return D;
-		};
-
-		/**
-		 * Function computing the symmetric difference between two sets.
-		 *
-		 * @param  {Set} A - First set.
-		 * @param  {Set} B - Second set.
-		 * @return {Set}   - The symmetric difference.
-		 */
-		exports.symmetricDifference = function(A, B) {
-		  var S = new Set();
-
-		  var iterator = A.values(),
-		      step;
-
-		  while ((step = iterator.next(), !step.done)) {
-		    if (!B.has(step.value))
-		      S.add(step.value);
-		  }
-
-		  iterator = B.values();
-
-		  while ((step = iterator.next(), !step.done)) {
-		    if (!A.has(step.value))
-		      S.add(step.value);
-		  }
-
-		  return S;
-		};
-
-		/**
-		 * Function returning whether A is a subset of B.
-		 *
-		 * @param  {Set} A - First set.
-		 * @param  {Set} B - Second set.
-		 * @return {boolean}
-		 */
-		exports.isSubset = function(A, B) {
-		  var iterator = A.values(),
-		      step;
-
-		  // Shortcuts
-		  if (A === B)
-		    return true;
-
-		  if (A.size > B.size)
-		    return false;
-
-		  while ((step = iterator.next(), !step.done)) {
-		    if (!B.has(step.value))
-		      return false;
-		  }
-
-		  return true;
-		};
-
-		/**
-		 * Function returning whether A is a superset of B.
-		 *
-		 * @param  {Set} A - First set.
-		 * @param  {Set} B - Second set.
-		 * @return {boolean}
-		 */
-		exports.isSuperset = function(A, B) {
-		  return exports.isSubset(B, A);
-		};
-
-		/**
-		 * Function adding the items of set B to the set A.
-		 *
-		 * @param  {Set} A - First set.
-		 * @param  {Set} B - Second set.
-		 */
-		exports.add = function(A, B) {
-		  var iterator = B.values(),
-		      step;
-
-		  while ((step = iterator.next(), !step.done))
-		    A.add(step.value);
-
-		  return;
-		};
-
-		/**
-		 * Function subtracting the items of set B from the set A.
-		 *
-		 * @param  {Set} A - First set.
-		 * @param  {Set} B - Second set.
-		 */
-		exports.subtract = function(A, B) {
-		  var iterator = B.values(),
-		      step;
-
-		  while ((step = iterator.next(), !step.done))
-		    A.delete(step.value);
-
-		  return;
-		};
-
-		/**
-		 * Function intersecting the items of A & B.
-		 *
-		 * @param  {Set} A - First set.
-		 * @param  {Set} B - Second set.
-		 */
-		exports.intersect = function(A, B) {
-		  var iterator = A.values(),
-		      step;
-
-		  while ((step = iterator.next(), !step.done)) {
-		    if (!B.has(step.value))
-		      A.delete(step.value);
-		  }
-
-		  return;
-		};
-
-		/**
-		 * Function disjuncting the items of A & B.
-		 *
-		 * @param  {Set} A - First set.
-		 * @param  {Set} B - Second set.
-		 */
-		exports.disjunct = function(A, B) {
-		  var iterator = A.values(),
-		      step;
-
-		  var toRemove = [];
-
-		  while ((step = iterator.next(), !step.done)) {
-		    if (B.has(step.value))
-		      toRemove.push(step.value);
-		  }
-
-		  iterator = B.values();
-
-		  while ((step = iterator.next(), !step.done)) {
-		    if (!A.has(step.value))
-		      A.add(step.value);
-		  }
-
-		  for (var i = 0, l = toRemove.length; i < l; i++)
-		    A.delete(toRemove[i]);
-
-		  return;
-		};
-
-		/**
-		 * Function returning the size of the intersection of A & B.
-		 *
-		 * @param  {Set} A - First set.
-		 * @param  {Set} B - Second set.
-		 * @return {number}
-		 */
-		exports.intersectionSize = function(A, B) {
-		  var tmp;
-
-		  // We need to know the smallest set
-		  if (A.size > B.size) {
-		    tmp = A;
-		    A = B;
-		    B = tmp;
-		  }
-
-		  if (A.size === 0)
-		    return 0;
-
-		  if (A === B)
-		    return A.size;
-
-		  var iterator = A.values(),
-		      step;
-
-		  var I = 0;
-
-		  while ((step = iterator.next(), !step.done)) {
-		    if (B.has(step.value))
-		      I++;
-		  }
-
-		  return I;
-		};
-
-		/**
-		 * Function returning the size of the union of A & B.
-		 *
-		 * @param  {Set} A - First set.
-		 * @param  {Set} B - Second set.
-		 * @return {number}
-		 */
-		exports.unionSize = function(A, B) {
-		  var I = exports.intersectionSize(A, B);
-
-		  return A.size + B.size - I;
-		};
-
-		/**
-		 * Function returning the Jaccard similarity between A & B.
-		 *
-		 * @param  {Set} A - First set.
-		 * @param  {Set} B - Second set.
-		 * @return {number}
-		 */
-		exports.jaccard = function(A, B) {
-		  var I = exports.intersectionSize(A, B);
-
-		  if (I === 0)
-		    return 0;
-
-		  var U = A.size + B.size - I;
-
-		  return I / U;
-		};
-
-		/**
-		 * Function returning the overlap coefficient between A & B.
-		 *
-		 * @param  {Set} A - First set.
-		 * @param  {Set} B - Second set.
-		 * @return {number}
-		 */
-		exports.overlap = function(A, B) {
-		  var I = exports.intersectionSize(A, B);
-
-		  if (I === 0)
-		    return 0;
-
-		  return I / Math.min(A.size, B.size);
-		}; 
-	} (set));
-	return set;
-}
-
-var setExports = /*@__PURE__*/ requireSet();
-
 /**
  * Mnemonist Stack
  * ================
@@ -819,36 +446,10 @@ function commonHead(sources, targets, equals) {
   );
 }
 
-function getOrCreate(map, key, create) {
-  let entry = map.get(key);
-  if (!entry) {
-    entry = create(key);
-    map.set(key, entry);
-  }
-  return entry;
-}
-
 function isIterable(something) {
   return l(something) && typeof something === "object" && Symbol.iterator in something;
 }
 
-function ifind(arg1, arg2) {
-  const pred = arg2 ?? arg1;
-  invariant(t(pred));
-  function _find(iter) {
-    for (const value of iter) {
-      if (pred(value)) {
-        return value;
-      }
-    }
-    return;
-  }
-  if (!arg2) {
-    return _find;
-  }
-  return _find(arg1);
-}
-
 function iflat(iterable) {
   return iterable ? _iflat(iterable) : _iflat;
 }
@@ -859,23 +460,6 @@ function* _iflat(iterable) {
   return;
 }
 
-function isome(arg1, arg2) {
-  const pred = arg2 ?? arg1;
-  invariant(t(pred));
-  function _some(iter) {
-    for (const value of iter) {
-      if (pred(value)) {
-        return true;
-      }
-    }
-    return false;
-  }
-  if (!arg2) {
-    return _some;
-  }
-  return _some(arg1);
-}
-
 function iunique(iterable) {
   return iterable ? _iunique(iterable) : _iunique;
 }
@@ -890,77 +474,6 @@ function* _iunique(iterable) {
   return;
 }
 
-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 = i$1(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));
-}
-function symmetricDifference(a, b) {
-  return setExports.symmetricDifference(a, b);
-}
-function hasIntersection(a, b) {
-  if (a.size === 0 || b.size === 0) {
-    return false;
-  }
-  if (b.size < a.size) {
-    [a, b] = [b, a];
-  }
-  for (const value of a) {
-    if (b.has(value)) {
-      return true;
-    }
-  }
-  return false;
-}
-
-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);
-}
-
 function commonjsRequire(path) {
 	throw new Error('Could not dynamically require "' + path + '". Please configure the dynamicRequireTargets or/and ignoreDynamicRequires option of @rollup/plugin-commonjs appropriately for this require call to work.');
 }
@@ -992,4 +505,4 @@ function objectHash(value) {
   });
 }
 
-export { Stack as S, ifind as a, iflat as b, commonHead as c, isIterable as d, isome as e, iunique as f, getOrCreate as g, difference as h, i$1 as i, equals as j, intersection as k, l, m, stringHash as n, objectHash as o, requireIterator as p, u as q, requireForeach as r, symmetricDifference as s, d as t, union as u, n as v, hasIntersection as w };
+export { Stack as S, requireIterator as a, iunique as b, commonHead as c, d, iflat as e, isIterable as i, l, n, objectHash as o, requireForeach as r, u };

package/dist/shared/{core.C-YXI-43.mjs → core.Cy9smucx.mjs}

@@ -1,3 +1,5 @@
+function t(r){return typeof r=="string"}
+
 function nonNullable(value, message) {
   if (typeof value === "undefined" || value == null) {
     const msg = typeof message === "function" ? message() : message;
@@ -15,4 +17,4 @@ function nonexhaustive(value) {
   throw new Error(`NonExhaustive value: ${value}`);
 }
 
-export { nonexhaustive as a, invariant as i, nonNullable as n };
+export { nonexhaustive as a, invariant as i, nonNullable as n, t };

package/dist/shared/core.CywrQs86.d.mts

@@ -0,0 +1,31 @@
+/**
+ * Mnemonist DefaultMap Typings
+ * =============================
+ */
+declare class DefaultMap<K, V> implements Iterable<[K, V]> {
+
+  // Members
+  size: number;
+
+  // Constructor
+  constructor(factory: (key: K, index: number) => V);
+
+  // Methods
+  clear(): void;
+  set(key: K, value: V): this;
+  delete(key: K): boolean;
+  has(key: K): boolean;
+  get(key: K): V;
+  peek(key: K): V | undefined;
+  forEach(callback: (value: V, key: K, map: this) => void, scope?: any): void;
+  keys(): IterableIterator<K>;
+  values(): IterableIterator<V>;
+  entries(): IterableIterator<[K, V]>;
+  [Symbol.iterator](): IterableIterator<[K, V]>;
+  inspect(): any;
+
+  // Statics
+  static autoIncrement(): number;
+}
+
+export { DefaultMap as D };