@likec4/core 1.41.0 → 1.42.1

package/dist/shared/{core.CXy1NLUG.mjs → core.BYNkXQ8A.mjs}

@@ -1,6 +1,15 @@
-import { isTruthy, anyPass, allPass, isNot, isString, isNullish } from 'remeda';
+import { e as e$1 } from './core.BKlholso.mjs';
+import { t as t$2 } from './core.BsSXS-_R.mjs';
+import { e as e$2 } from './core.BoYfZOBm.mjs';
+import { e as e$3 } from './core.CqAJJpK_.mjs';
 import { n as nonexhaustive } from './core.D4npX2q8.mjs';
 
+function t$1(...t){return t$2(n$1,t)}const n$1=(e,t)=>t.every(t=>t(e));
+
+function t(...t){return t$2(n,t)}const n=(e,t)=>t.some(t=>t(e));
+
+function e(e){return e==null}
+
 function isOnStage(value, stage) {
   return value[_stage] === stage;
 }
@@ -8,10 +17,10 @@ const _stage = "_stage";
 const _type = "_type";
 
 function isDeploymentNode(el) {
-  return isTruthy(el.kind) && !isTruthy(el.element);
+  return e$1(el.kind) && !e$1(el.element);
 }
 function isDeployedInstance(el) {
-  return isTruthy(el.element) && !isTruthy(el.kind);
+  return e$1(el.element) && !e$1(el.kind);
 }
 
 function isTagEqual(operator) {
@@ -40,8 +49,8 @@ function whereOperatorAsPredicate(operator) {
       return participantIs(participant, participantPredicate);
     }
     case isTagEqual(operator): {
-      if (isString(operator.tag) || "eq" in operator.tag) {
-        const tag2 = isString(operator.tag) ? operator.tag : operator.tag.eq;
+      if (e$3(operator.tag) || "eq" in operator.tag) {
+        const tag2 = e$3(operator.tag) ? operator.tag : operator.tag.eq;
         return (value) => {
           return Array.isArray(value.tags) && value.tags.includes(tag2);
         };
@@ -52,28 +61,28 @@ function whereOperatorAsPredicate(operator) {
       };
     }
     case isKindEqual(operator): {
-      if (isString(operator.kind) || "eq" in operator.kind) {
-        const kind2 = isString(operator.kind) ? operator.kind : operator.kind.eq;
+      if (e$3(operator.kind) || "eq" in operator.kind) {
+        const kind2 = e$3(operator.kind) ? operator.kind : operator.kind.eq;
         return (value) => {
           return value.kind === kind2;
         };
       }
       const kind = operator.kind.neq;
       return (value) => {
-        return isNullish(value.kind) || value.kind !== kind;
+        return e(value.kind) || value.kind !== kind;
       };
     }
     case isNotOperator(operator): {
       const predicate = whereOperatorAsPredicate(operator.not);
-      return isNot(predicate);
+      return e$2(predicate);
     }
     case isAndOperator(operator): {
       const predicates = operator.and.map(whereOperatorAsPredicate);
-      return allPass(predicates);
+      return t$1(predicates);
     }
     case isOrOperator(operator): {
       const predicates = operator.or.map(whereOperatorAsPredicate);
-      return anyPass(predicates);
+      return t(predicates);
     }
     default:
       nonexhaustive(operator);
@@ -95,4 +104,4 @@ function participantIs(participant, predicate) {
   };
 }
 
-export { _stage as _, _type as a, isDeploymentNode as b, isDeployedInstance as c, isTagEqual as d, isKindEqual as e, isParticipantOperator as f, isNotOperator as g, isAndOperator as h, isOnStage as i, isOrOperator as j, whereOperatorAsPredicate as w };
+export { _stage as _, _type as a, isDeploymentNode as b, isDeployedInstance as c, isTagEqual as d, isKindEqual as e, isParticipantOperator as f, isNotOperator as g, isAndOperator as h, isOnStage as i, isOrOperator as j, e as k, t, whereOperatorAsPredicate as w };

package/dist/shared/{core.BuoXfSMj.mjs → core.BbE4y-yl.mjs}

@@ -1,4 +1,4 @@
-import { r as getDefaultExportFromCjs } from './core.DgttqsJc.mjs';
+import { g as getDefaultExportFromCjs } from './core.B85MJLTf.mjs';
 
 /**
  * Mnemonist DefaultMap

package/dist/shared/core.BoYfZOBm.mjs

@@ -0,0 +1,3 @@
+function e(e){return t=>!e(t)}
+
+export { e };

package/dist/shared/core.BsSXS-_R.mjs

@@ -0,0 +1,7 @@
+function e(e,t,n){let r=n=>e(n,...t);return n===void 0?r:Object.assign(r,{lazy:n,lazyArgs:t})}
+
+function t$1(t,n,r){let i=t.length-n.length;if(i===0)return t(...n);if(i===1)return e(t,n,r);throw Error(`Wrong number of arguments`)}
+
+function t(...t){return t$1(n,t)}const n=(e,t)=>e.length>=t;
+
+export { t as a, t$1 as t };

package/dist/shared/{core.DJp8fgok.mjs → core.BzTakU3I.mjs}

@@ -1,9 +1,7 @@
-import { omitBy, isTruthy, isArray } from 'remeda';
-import { e as isStepEdgeId } from './core.Be1n9a0i.mjs';
+import { e as e$1 } from './core.BKlholso.mjs';
+import { e as isStepEdgeId } from './core.C_Ni6yHl.mjs';
 
-function omitUndefined(a) {
-  return omitBy(a, (v) => v === void 0);
-}
+function e(e){return Array.isArray(e)}
 
 function isViewRulePredicate(rule) {
   return "include" in rule || "exclude" in rule;
@@ -21,10 +19,10 @@ function isElementView(view) {
   return view._type === "element";
 }
 function isScopedElementView(view) {
-  return isElementView(view) && isTruthy(view.viewOf);
+  return isElementView(view) && e$1(view.viewOf);
 }
 function isExtendsElementView(view) {
-  return isElementView(view) && isTruthy(view.extends);
+  return isElementView(view) && e$1(view.extends);
 }
 function isDeploymentView(view) {
   return view._type === "deployment";
@@ -52,12 +50,18 @@ function getParallelStepsPrefix(id) {
   }
   return null;
 }
-function isDynamicViewParallelSteps(step) {
-  return "__parallel" in step && isArray(step.__parallel);
+function isDynamicStep(step) {
+  return !!step && !("__series" in step || "__parallel" in step);
+}
+function isDynamicStepsParallel(step) {
+  return !!step && "__parallel" in step && e(step.__parallel);
+}
+function isDynamicStepsSeries(step) {
+  return !!step && "__series" in step && e(step.__series);
 }
 
 function isViewRuleGroup(rule) {
   return "title" in rule && "groupRules" in rule && Array.isArray(rule.groupRules);
 }
 
-export { isViewRuleStyle as a, isComputedView as b, isDiagramView as c, isElementView as d, isScopedElementView as e, isExtendsElementView as f, isDeploymentView as g, isDynamicView as h, isViewRulePredicate as i, isViewRuleGlobalStyle as j, isViewRuleGlobalPredicateRef as k, isAutoLayoutDirection as l, isViewRuleAutoLayout as m, getParallelStepsPrefix as n, omitUndefined as o, isDynamicViewParallelSteps as p, isViewRuleGroup as q };
+export { isViewRuleStyle as a, isComputedView as b, isDiagramView as c, isElementView as d, isScopedElementView as e, isExtendsElementView as f, isDeploymentView as g, isDynamicView as h, isViewRulePredicate as i, isViewRuleGlobalStyle as j, isViewRuleGlobalPredicateRef as k, isAutoLayoutDirection as l, isViewRuleAutoLayout as m, getParallelStepsPrefix as n, isDynamicStep as o, isDynamicStepsParallel as p, isDynamicStepsSeries as q, isViewRuleGroup as r, e as s };

package/dist/shared/{core.4u1dVmfX.mjs → core.C2TiyjI6.mjs}

@@ -1,4 +1,4 @@
-import { hasAtLeast } from 'remeda';
+import { a as t } from './core.BsSXS-_R.mjs';
 import { i as invariant } from './core.D4npX2q8.mjs';
 
 var set = {};
@@ -385,7 +385,7 @@ function intersection(first, ...sets) {
   if (first.size === 0) {
     return result;
   }
-  let other = hasAtLeast(sets, 2) ? setExports.intersection(...sets) : sets[0];
+  let other = t(sets, 2) ? setExports.intersection(...sets) : sets[0];
   if (other.size === 0) {
     return result;
   }

package/dist/shared/{core.DLpidoWc.mjs → core.C3JowhaZ.mjs}

@@ -1,9 +1,9 @@
-import { isFunction } from 'remeda';
+import { e } from './core.DRJma0Ol.mjs';
 import { i as invariant } from './core.D4npX2q8.mjs';
 
 function imap(arg1, arg2) {
   const mapper = arg2 ?? arg1;
-  invariant(isFunction(mapper));
+  invariant(e(mapper));
   function* _map(iter) {
     for (const value of iter) {
       yield mapper(value);
@@ -29,4 +29,4 @@ function toSet(iterable) {
   return (it) => new Set(it);
 }
 
-export { toSet as a, imap as i, toArray as t };
+export { toArray as a, imap as i, toSet as t };

package/dist/shared/{core.CNGyqkJh.mjs → core.C4x8aaWa.mjs}

@@ -1,3 +1,5 @@
+function e(e){return e!==void 0}
+
 function iflat(iterable) {
   return iterable ? _iflat(iterable) : _iflat;
 }
@@ -22,4 +24,4 @@ function* _iunique(iterable) {
   return;
 }
 
-export { iunique as a, iflat as i };
+export { iunique as a, e, iflat as i };

package/dist/shared/{core.BB6zA-UU.mjs → core.C8YY6Uub.mjs}

@@ -1,8 +1,17 @@
-import { r as getDefaultExportFromCjs } from './core.DgttqsJc.mjs';
-import { r as requireIterator, a as requireForeach } from './core.CaT0SUUK.mjs';
-import { pipe, zip, takeWhile, map, isNonNullish } from 'remeda';
+import { g as getDefaultExportFromCjs } from './core.B85MJLTf.mjs';
+import { a as requireIterator } from './core.rCeaAqgW.mjs';
+import { r as requireForeach } from './core.1vX5a9AY.mjs';
+import { t as t$3 } from './core.OHD4KXm9.mjs';
+import { t as t$4 } from './core.CbT8JVYL.mjs';
+import { t as t$2 } from './core.BsSXS-_R.mjs';
+import { k as commonAncestor, m as compareFqnHierarchically } from './core.DRhg-gVU.mjs';
+import { e } from './core.RfnaEmgA.mjs';
 import { i as invariant } from './core.D4npX2q8.mjs';
 
+function t$1(...t){return t$2(n$1,t)}function n$1(e,t){let n=[];for(let[r,i]of e.entries()){if(!t(i,r,e))break;n.push(i);}return n}
+
+function t(...t){return t$2(n,t,r)}const n=(e,t)=>e.length<t.length?e.map((e,n)=>[e,t[n]]):t.map((t,n)=>[e[n],t]),r=e=>(t,n)=>({hasNext:true,next:[t,e[n]],done:n>=e.length-1});
+
 /**
  * Mnemonist Stack
  * ================
@@ -231,13 +240,33 @@ function commonHead(sources, targets, equals) {
     return [];
   }
   equals ??= Object.is;
-  return pipe(
-    zip(sources, targets),
-    takeWhile(([source, target]) => equals(source, target)),
-    map(([source, _]) => source)
+  return t$3(
+    t(sources, targets),
+    t$1(([source, target]) => equals(source, target)),
+    t$4(([source, _]) => source)
   );
 }
 
+const compareRelations = (a, b) => {
+  const parentA = commonAncestor(a.source.id, a.target.id);
+  const parentB = commonAncestor(b.source.id, b.target.id);
+  if (parentA && !parentB) {
+    return 1;
+  }
+  if (!parentA && parentB) {
+    return -1;
+  }
+  const compareParents = parentA && parentB ? compareFqnHierarchically(parentA, parentB) : 0;
+  if (compareParents !== 0) {
+    return compareParents;
+  }
+  const compareSource = compareFqnHierarchically(a.source.id, b.source.id);
+  if (compareSource !== 0) {
+    return compareSource;
+  }
+  return compareFqnHierarchically(a.target.id, b.target.id);
+};
+
 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.');
 }
@@ -260,7 +289,7 @@ const objecthash = /*@__PURE__*/getDefaultExportFromCjs(object_hashExports);
 
 function objectHash(value) {
   invariant(
-    typeof value === "object" && isNonNullish(value),
+    typeof value === "object" && e(value),
     "objectHash: value must be an object"
   );
   return objecthash(value, {
@@ -269,4 +298,4 @@ function objectHash(value) {
   });
 }
 
-export { Stack as S, commonHead as c, objectHash as o };
+export { Stack as S, compareRelations as a, t as b, commonHead as c, objectHash as o, t$1 as t };