@likec4/core 1.44.0 → 1.46.0

package/dist/shared/{core.CHwVhuc9.mjs → core.DbQpDoJS.mjs}

@@ -1,22 +1,19 @@
-import { c as customInspectSymbol } from './core.C0Ye2OCr.mjs';
-import { i as intersection, d as difference, u as union, a as stringHash, e as equals } from './core.CbsSAn1j.mjs';
-import { t as t$3 } from './core.BsSXS-_R.mjs';
+import { c as customInspectSymbol } from './core.DqlrMlsf.mjs';
+import { i as intersection, d as difference, u as union, e as equals } from './core.DbfO90vF.mjs';
+import { t as t$1 } from './core.BsSXS-_R.mjs';
 import { e as e$1 } from './core.BKlholso.mjs';
-import { t as t$2, a as t$4 } from './core.OHD4KXm9.mjs';
-import { m as hierarchyLevel, g as commonAncestor, n as nameFromFqn, d as isSameHierarchy } from './core.6VsRBhGY.mjs';
+import { n as n$1 } from './core.BhNcrwzK.mjs';
+import { m as hierarchyLevel, g as commonAncestor, n as nameFromFqn, d as isSameHierarchy } from './core.CdNCAwq7.mjs';
 import { a as nonNullable, i as invariant } from './core.D4npX2q8.mjs';
-import { m as memoizeProp } from './core.BR4zXDH-.mjs';
-import { e as exact, R as RichText } from './core.M9ayqQZa.mjs';
+import { m as memoizeProp } from './core.CLSZtnFh.mjs';
+import { e as exact, R as RichText } from './core.BK-tI3Q3.mjs';
 import { preferSummary, preferDescription } from '../types/_aux.mjs';
 import { i as ihead } from './core.uFk_o9X6.mjs';
-
-function t$1(t,n){let r=n.length-t.length;if(r===1){let[r,...i]=n;return t$2(r,{lazy:t,lazyArgs:i})}if(r===0){let r={lazy:t,lazyArgs:n};return Object.assign(t=>t$2(t,r),r)}throw Error(`Wrong number of arguments`)}
+import { s as stringHash } from './core.oSV6SRfk.mjs';
 
 function e(e){return e===``||e===void 0?true:Array.isArray(e)?e.length===0:Object.keys(e).length===0}
 
-function t(...t){return t$3(n$1,t)}function n$1(e,t){if(e===t||Object.is(e,t))return  true;if(typeof e!=`object`||!e||typeof t!=`object`||!t)return  false;if(e instanceof Map&&t instanceof Map)return r$1(e,t);if(e instanceof Set&&t instanceof Set)return i(e,t);let n=Object.keys(e);if(n.length!==Object.keys(t).length)return  false;for(let r of n){if(!Object.hasOwn(t,r))return  false;let{[r]:n}=e,{[r]:i}=t;if(n!==i||!Object.is(n,i))return  false}return  true}function r$1(e,t){if(e.size!==t.size)return  false;for(let[n,r]of e){let e=t.get(n);if(r!==e||!Object.is(r,e))return  false}return  true}function i(e,t){if(e.size!==t.size)return  false;for(let n of e)if(!t.has(n))return  false;return  true}
-
-function n(...e){return t$1(r,e)}function r(){let t=new Set;return n=>t.has(n)?t$4:(t.add(n),{done:false,hasNext:true,next:n})}
+function t(...t){return t$1(n,t)}function n(e,t){if(e===t||Object.is(e,t))return  true;if(typeof e!=`object`||!e||typeof t!=`object`||!t)return  false;if(e instanceof Map&&t instanceof Map)return r(e,t);if(e instanceof Set&&t instanceof Set)return i(e,t);let n=Object.keys(e);if(n.length!==Object.keys(t).length)return  false;for(let r of n){if(!Object.hasOwn(t,r))return  false;let{[r]:n}=e,{[r]:i}=t;if(n!==i||!Object.is(n,i))return  false}return  true}function r(e,t){if(e.size!==t.size)return  false;for(let[n,r]of e){let e=t.get(n);if(r!==e||!Object.is(r,e))return  false}return  true}function i(e,t){if(e.size!==t.size)return  false;for(let n of e)if(!t.has(n))return  false;return  true}
 
 class AbstractDeploymentElementModel {
   /**
@@ -211,7 +208,7 @@ class DeploymentNodeModel extends AbstractDeploymentElementModel {
   }
   get tags() {
     return memoizeProp(this, Symbol.for("tags"), () => {
-      return n([
+      return n$1([
         ...this.$node.tags ?? [],
         ...this.$model.$model.specification.deployments[this.kind]?.tags ?? []
       ]);
@@ -336,7 +333,7 @@ class DeployedInstanceModel extends AbstractDeploymentElementModel {
   }
   get tags() {
     return memoizeProp(this, Symbol.for("tags"), () => {
-      return n([
+      return n$1([
         ...this.$instance.tags ?? [],
         ...this.element.tags
       ]);
@@ -782,4 +779,4 @@ const deploymentConnection = {
   findConnectionsWithin: findConnectionsWithin
 };
 
-export { DeploymentConnectionModel as D, NestedElementOfDeployedInstanceModel as N, RelationshipsAccum as R, DeploymentNodeModel as a, DeployedInstanceModel as b, DeploymentRelationModel as c, deploymentConnection as d, e, findConnection as f, findConnectionsBetween as g, findConnectionsWithin as h, n, t };
+export { DeploymentConnectionModel as D, NestedElementOfDeployedInstanceModel as N, RelationshipsAccum as R, DeploymentNodeModel as a, DeployedInstanceModel as b, DeploymentRelationModel as c, deploymentConnection as d, e, findConnection as f, findConnectionsBetween as g, findConnectionsWithin as h, t };

package/dist/shared/{core.CbsSAn1j.mjs → core.DbfO90vF.mjs}

@@ -1,5 +1,4 @@
 import { a as t } from './core.BsSXS-_R.mjs';
-import { i as invariant } from './core.D4npX2q8.mjs';
 
 var set = {};
 
@@ -432,14 +431,4 @@ function hasIntersection(a, b) {
   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);
-}
-
-export { stringHash as a, difference as d, equals as e, hasIntersection as h, intersection as i, symmetricDifference as s, union as u };
+export { difference as d, equals as e, hasIntersection as h, intersection as i, symmetricDifference as s, union as u };

package/dist/shared/{core.C0Ye2OCr.mjs → core.DqlrMlsf.mjs}

@@ -1,4 +1,4 @@
-import { i as isAncestor } from './core.6VsRBhGY.mjs';
+import { i as isAncestor } from './core.CdNCAwq7.mjs';
 
 var Connection;
 ((Connection2) => {