@likec4/core 1.31.0 → 1.32.1

package/dist/shared/{core.CQXU9DF7.mjs → core.rmvsy0n3.mjs}

@@ -1,11 +1,9 @@
-import { i as invariant } from './core.C-YXI-43.mjs';
+import { t as t$1, i as invariant } from './core.Cy9smucx.mjs';
 
 var e={done:true,hasNext:false},s={done:false,hasNext:false},a=()=>e;
 
 function C(t,...o){let n=t,u=o.map(e=>"lazy"in e?y(e):void 0),p=0;for(;p<o.length;){if(u[p]===void 0||!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===void 0||(r.push(l),l.isSingle))break}let a=[];for(let i of n)if(f(i,a,r))break;let{isSingle:s}=r.at(-1);n=s?a[0]:a,p+=r.length;}return n}function f(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(f(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 y(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 t$1(r){return typeof r=="string"}
-
 function t(n){return typeof n=="function"}
 
 function getDefaultExportFromCjs (x) {
@@ -263,6 +261,27 @@ function compareNatural(a, b) {
   }
   return t$1(b) ? -1 : 0;
 }
+function compareNaturalHierarchically(separator = ".") {
+  return (a, b) => {
+    if (a === b) return 0;
+    if (!a) return -1;
+    if (!b) return 1;
+    const aParts = a.split(separator);
+    const bParts = b.split(separator);
+    if (aParts.length !== bParts.length) {
+      return aParts.length - bParts.length;
+    }
+    for (let i = 0; i < aParts.length; i++) {
+      const aPart = aParts[i];
+      const bPart = bParts[i];
+      const comparison = compare(aPart, bPart);
+      if (comparison !== 0) {
+        return comparison;
+      }
+    }
+    return 0;
+  };
+}
 
 function isString(value) {
   return value != null && typeof value === "string";
@@ -446,32 +465,4 @@ function ifilter(arg1, arg2) {
   return _filter(arg1);
 }
 
-function imap(arg1, arg2) {
-  const mapper = arg2 ?? arg1;
-  invariant(t(mapper));
-  function* _map(iter) {
-    for (const value of iter) {
-      yield mapper(value);
-    }
-    return;
-  }
-  if (!arg2) {
-    return _map;
-  }
-  return _map(arg1);
-}
-
-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 { C, DefaultMap as D, isAncestor as a, toArray as b, ifilter as c, imap as d, isNonEmptyArray as e, t$1 as f, isSameHierarchy as g, t as h, isDescendantOf as i, getDefaultExportFromCjs as j, compareNatural as k, ancestorsFqn as l, commonAncestor as m, nameFromFqn as n, compareByFqnHierarchically as o, parentFqn as p, compareFqnHierarchically as q, hierarchyDistance as r, sortParentsFirst as s, toSet as t, hierarchyLevel as u, sortByFqnHierarchically as v, sortNaturalByFqn as w, isString as x, s as y, a as z };
+export { C, DefaultMap as D, isAncestor as a, ifilter as b, isNonEmptyArray as c, isSameHierarchy as d, a as e, s as f, getDefaultExportFromCjs as g, compareByFqnHierarchically as h, isDescendantOf as i, sortByFqnHierarchically as j, commonAncestor as k, ancestorsFqn as l, compareNatural as m, nameFromFqn as n, compareNaturalHierarchically as o, parentFqn as p, compareFqnHierarchically as q, hierarchyDistance as r, sortParentsFirst as s, t, hierarchyLevel as u, sortNaturalByFqn as v, isString as w };