@likec4/core 1.20.2 → 1.21.0

package/dist/shared/{core.CCyhaU-4.mjs → core.CeefT_JU.mjs}

@@ -1,4 +1,4 @@
-import { u as u$1, i as invariant } from './core.Bezy7K65.mjs';
+import { u as u$1, i as invariant } from './core.BfZZXtur.mjs';
 
 function _mergeNamespaces(n, m) {
 	for (var i = 0; i < m.length; i++) {
@@ -12,11 +12,11 @@ function _mergeNamespaces(n, m) {
 	return n;
 }
 
-var e={done:true,hasNext:false},s={done:false,hasNext:false},a$1=()=>e;
+var e={done:true,hasNext:false},s={done:false,hasNext:false},a=()=>e;
 
-function x(t,...o){let n=t,u=o.map(e=>"lazy"in e?f(e):undefined),p=0;for(;p<o.length;){if(u[p]===undefined||!B(n)){let i=o[p];n=i(n),p+=1;continue}let r=[];for(let i=p;i<o.length;i++){let l=u[i];if(l===undefined||(r.push(l),l.isSingle))break}let a=[];for(let i of n)if(A(i,a,r))break;let{isSingle:y}=r.at(-1);n=y?a[0]:a,p+=r.length;}return n}function A(t,o,n){if(n.length===0)return o.push(t),false;let u=t,p=s,e=false;for(let[r,a]of n.entries()){let{index:y,items:i}=a;if(i.push(u),p=a(u,y,i),a.index+=1,p.hasNext){if(p.hasMany??false){for(let l of p.next)if(A(l,o,n.slice(r+1)))return  true;return e}u=p.next;}if(!p.hasNext)break;p.done&&(e=true);}return p.hasNext&&o.push(u),e}function f(t){let{lazy:o,lazyArgs:n}=t,u=o(...n);return Object.assign(u,{isSingle:o.single??false,index:0,items:[]})}function B(t){return typeof t=="string"||typeof t=="object"&&t!==null&&Symbol.iterator in t}
+function C(t,...o){let n=t,u=o.map(e=>"lazy"in e?A(e):undefined),p=0;for(;p<o.length;){if(u[p]===undefined||!B(n)){let i=o[p];n=i(n),p+=1;continue}let r=[];for(let i=p;i<o.length;i++){let l=u[i];if(l===undefined||(r.push(l),l.isSingle))break}let a=[];for(let i of n)if(y(i,a,r))break;let{isSingle:s}=r.at(-1);n=s?a[0]:a,p+=r.length;}return n}function y(t,o,n){if(n.length===0)return o.push(t),false;let u=t,p=s,e=false;for(let[r,a]of n.entries()){let{index:s,items:i}=a;if(i.push(u),p=a(u,s,i),a.index+=1,p.hasNext){if(p.hasMany??false){for(let l of p.next)if(y(l,o,n.slice(r+1)))return  true;return e}u=p.next;}if(!p.hasNext)break;p.done&&(e=true);}return p.hasNext&&o.push(u),e}function A(t){let{lazy:o,lazyArgs:n}=t,u=o(...n);return Object.assign(u,{isSingle:o.single??false,index:0,items:[]})}function B(t){return typeof t=="string"||typeof t=="object"&&t!==null&&Symbol.iterator in t}
 
-function d(...e){return u$1(a,e,o$1)}var a=(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$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 i$1(...e){return u$1(r,e)}var r=(e,t)=>e.length>=t;
 
@@ -14358,7 +14358,7 @@ function commonHead(sources, targets, equals) {
     return [];
   }
   equals ??= Object.is;
-  return x(
+  return C(
     d(sources, targets),
     u(([source, target]) => equals(source, target)),
     m(([source, _]) => source)
@@ -14816,4 +14816,4 @@ function requireObject_hash () {
 var object_hashExports = requireObject_hash();
 const objectHash = /*@__PURE__*/getDefaultExportFromCjs(object_hashExports);
 
-export { hasIntersection as $, isNonEmptyArray as A, isString as B, ifilter as C, DefaultMap as D, iflat as E, imap as F, isIterable as G, isome as H, iunique as I, toArray as J, difference as K, equals as L, intersection as M, symmetricDifference as N, union as O, stringHash as P, objectHash as Q, x as R, Stack as S, s as T, a$1 as U, getDefaultExportFromCjs as V, requireForeach as W, requireIterator as X, u as Y, d as Z, n as _, i$1 as a, t$1 as b, isSameHierarchy as c, t as d, linkedList as e, commonHead as f, compareNatural as g, ancestorsFqn as h, ifind as i, commonAncestor as j, compareByFqnHierarchically as k, l, m, nameFromFqn as n, compareFqnHierarchically as o, parentFqn as p, queue as q, hierarchyDistance as r, hierarchyLevel as s, toSet as t, isAncestor as u, isDescendantOf as v, sortByFqnHierarchically as w, sortNaturalByFqn as x, sortParentsFirst as y, getOrCreate as z };
+export { hasIntersection as $, isNonEmptyArray as A, isString as B, ifilter as C, DefaultMap as D, iflat as E, imap as F, isIterable as G, isome as H, iunique as I, toArray as J, difference as K, equals as L, intersection as M, symmetricDifference as N, union as O, stringHash as P, objectHash as Q, C as R, Stack as S, s as T, a as U, getDefaultExportFromCjs as V, requireForeach as W, requireIterator as X, u as Y, d as Z, n as _, i$1 as a, t$1 as b, isSameHierarchy as c, t as d, linkedList as e, commonHead as f, compareNatural as g, ancestorsFqn as h, ifind as i, commonAncestor as j, compareByFqnHierarchically as k, l, m, nameFromFqn as n, compareFqnHierarchically as o, parentFqn as p, queue as q, hierarchyDistance as r, hierarchyLevel as s, toSet as t, isAncestor as u, isDescendantOf as v, sortByFqnHierarchically as w, sortNaturalByFqn as x, sortParentsFirst as y, getOrCreate as z };