@likec4/core 1.20.1 → 1.20.3

package/dist/index.cjs

@@ -1,515 +1,13 @@
 'use strict';
 
-const model_index = require('./shared/core.BGus30EM.cjs');
-const object_hash = require('./shared/core.C9DCnJh8.cjs');
-const chunkRAAYCPUM = require('./shared/core.DsoCu540.cjs');
-const view = require('./shared/core.B2QYWlYe.cjs');
-const compute = require('./shared/core.gv1bMwCC.cjs');
+const chunkRAAYCPUM = require('./shared/core.CKYxnFEl.cjs');
+const view = require('./shared/core.uxHtIZaH.cjs');
+const model_index = require('./shared/core.DRfrKNT6.cjs');
+const compute = require('./shared/core.Db_OTRdC.cjs');
 const types_index = require('./types/index.cjs');
+const object_hash = require('./shared/core.FACQZmma.cjs');
 const utils_index = require('./utils/index.cjs');
 
-/**
- * Mnemonist Linked List
- * ======================
- *
- * Singly linked list implementation. Uses raw JavaScript objects as nodes
- * as benchmarks proved it was the fastest thing to do.
- */
-
-var linkedList$1;
-var hasRequiredLinkedList;
-
-function requireLinkedList () {
-	if (hasRequiredLinkedList) return linkedList$1;
-	hasRequiredLinkedList = 1;
-	var Iterator = model_index.requireIterator(),
-	    forEach = model_index.requireForeach();
-
-	/**
-	 * Linked List.
-	 *
-	 * @constructor
-	 */
-	function LinkedList() {
-	  this.clear();
-	}
-
-	/**
-	 * Method used to clear the list.
-	 *
-	 * @return {undefined}
-	 */
-	LinkedList.prototype.clear = function() {
-
-	  // Properties
-	  this.head = null;
-	  this.tail = null;
-	  this.size = 0;
-	};
-
-	/**
-	 * Method used to get the first item of the list.
-	 *
-	 * @return {any}
-	 */
-	LinkedList.prototype.first = function() {
-	  return this.head ? this.head.item : undefined;
-	};
-	LinkedList.prototype.peek = LinkedList.prototype.first;
-
-	/**
-	 * Method used to get the last item of the list.
-	 *
-	 * @return {any}
-	 */
-	LinkedList.prototype.last = function() {
-	  return this.tail ? this.tail.item : undefined;
-	};
-
-	/**
-	 * Method used to add an item at the end of the list.
-	 *
-	 * @param  {any}    item - The item to add.
-	 * @return {number}
-	 */
-	LinkedList.prototype.push = function(item) {
-	  var node = {item: item, next: null};
-
-	  if (!this.head) {
-	    this.head = node;
-	    this.tail = node;
-	  }
-	  else {
-	    this.tail.next = node;
-	    this.tail = node;
-	  }
-
-	  this.size++;
-
-	  return this.size;
-	};
-
-	/**
-	 * Method used to add an item at the beginning of the list.
-	 *
-	 * @param  {any}    item - The item to add.
-	 * @return {number}
-	 */
-	LinkedList.prototype.unshift = function(item) {
-	  var node = {item: item, next: null};
-
-	  if (!this.head) {
-	    this.head = node;
-	    this.tail = node;
-	  }
-	  else {
-	    if (!this.head.next)
-	      this.tail = this.head;
-	    node.next = this.head;
-	    this.head = node;
-	  }
-
-	  this.size++;
-
-	  return this.size;
-	};
-
-	/**
-	 * Method used to retrieve & remove the first item of the list.
-	 *
-	 * @return {any}
-	 */
-	LinkedList.prototype.shift = function() {
-	  if (!this.size)
-	    return undefined;
-
-	  var node = this.head;
-
-	  this.head = node.next;
-	  this.size--;
-
-	  return node.item;
-	};
-
-	/**
-	 * Method used to iterate over the list.
-	 *
-	 * @param  {function}  callback - Function to call for each item.
-	 * @param  {object}    scope    - Optional scope.
-	 * @return {undefined}
-	 */
-	LinkedList.prototype.forEach = function(callback, scope) {
-	  if (!this.size)
-	    return;
-
-	  scope = arguments.length > 1 ? scope : this;
-
-	  var n = this.head,
-	      i = 0;
-
-	  while (n) {
-	    callback.call(scope, n.item, i, this);
-	    n = n.next;
-	    i++;
-	  }
-	};
-
-	/**
-	 * Method used to convert the list into an array.
-	 *
-	 * @return {array}
-	 */
-	LinkedList.prototype.toArray = function() {
-	  if (!this.size)
-	    return [];
-
-	  var array = new Array(this.size);
-
-	  for (var i = 0, l = this.size, n = this.head; i < l; i++) {
-	    array[i] = n.item;
-	    n = n.next;
-	  }
-
-	  return array;
-	};
-
-	/**
-	 * Method used to create an iterator over a list's values.
-	 *
-	 * @return {Iterator}
-	 */
-	LinkedList.prototype.values = function() {
-	  var n = this.head;
-
-	  return new Iterator(function() {
-	    if (!n)
-	      return {
-	        done: true
-	      };
-
-	    var value = n.item;
-	    n = n.next;
-
-	    return {
-	      value: value,
-	      done: false
-	    };
-	  });
-	};
-
-	/**
-	 * Method used to create an iterator over a list's entries.
-	 *
-	 * @return {Iterator}
-	 */
-	LinkedList.prototype.entries = function() {
-	  var n = this.head,
-	      i = 0;
-
-	  return new Iterator(function() {
-	    if (!n)
-	      return {
-	        done: true
-	      };
-
-	    var value = n.item;
-	    n = n.next;
-	    i++;
-
-	    return {
-	      value: [i - 1, value],
-	      done: false
-	    };
-	  });
-	};
-
-	/**
-	 * Attaching the #.values method to Symbol.iterator if possible.
-	 */
-	if (typeof Symbol !== 'undefined')
-	  LinkedList.prototype[Symbol.iterator] = LinkedList.prototype.values;
-
-	/**
-	 * Convenience known methods.
-	 */
-	LinkedList.prototype.toString = function() {
-	  return this.toArray().join(',');
-	};
-
-	LinkedList.prototype.toJSON = function() {
-	  return this.toArray();
-	};
-
-	LinkedList.prototype.inspect = function() {
-	  var array = this.toArray();
-
-	  // Trick so that node displays the name of the constructor
-	  Object.defineProperty(array, 'constructor', {
-	    value: LinkedList,
-	    enumerable: false
-	  });
-
-	  return array;
-	};
-
-	if (typeof Symbol !== 'undefined')
-	  LinkedList.prototype[Symbol.for('nodejs.util.inspect.custom')] = LinkedList.prototype.inspect;
-
-	/**
-	 * Static @.from function taking an arbitrary iterable & converting it into
-	 * a list.
-	 *
-	 * @param  {Iterable} iterable   - Target iterable.
-	 * @return {LinkedList}
-	 */
-	LinkedList.from = function(iterable) {
-	  var list = new LinkedList();
-
-	  forEach(iterable, function(value) {
-	    list.push(value);
-	  });
-
-	  return list;
-	};
-
-	/**
-	 * Exporting.
-	 */
-	linkedList$1 = LinkedList;
-	return linkedList$1;
-}
-
-var linkedListExports = requireLinkedList();
-const linkedList = /*@__PURE__*/object_hash.getDefaultExportFromCjs(linkedListExports);
-
-/**
- * Mnemonist Queue
- * ================
- *
- * Queue implementation based on the ideas of Queue.js that seems to beat
- * a LinkedList one in performance.
- */
-
-var queue$1;
-var hasRequiredQueue;
-
-function requireQueue () {
-	if (hasRequiredQueue) return queue$1;
-	hasRequiredQueue = 1;
-	var Iterator = model_index.requireIterator(),
-	    forEach = model_index.requireForeach();
-
-	/**
-	 * Queue
-	 *
-	 * @constructor
-	 */
-	function Queue() {
-	  this.clear();
-	}
-
-	/**
-	 * Method used to clear the queue.
-	 *
-	 * @return {undefined}
-	 */
-	Queue.prototype.clear = function() {
-
-	  // Properties
-	  this.items = [];
-	  this.offset = 0;
-	  this.size = 0;
-	};
-
-	/**
-	 * Method used to add an item to the queue.
-	 *
-	 * @param  {any}    item - Item to enqueue.
-	 * @return {number}
-	 */
-	Queue.prototype.enqueue = function(item) {
-
-	  this.items.push(item);
-	  return ++this.size;
-	};
-
-	/**
-	 * Method used to retrieve & remove the first item of the queue.
-	 *
-	 * @return {any}
-	 */
-	Queue.prototype.dequeue = function() {
-	  if (!this.size)
-	    return;
-
-	  var item = this.items[this.offset];
-
-	  if (++this.offset * 2 >= this.items.length) {
-	    this.items = this.items.slice(this.offset);
-	    this.offset = 0;
-	  }
-
-	  this.size--;
-
-	  return item;
-	};
-
-	/**
-	 * Method used to retrieve the first item of the queue.
-	 *
-	 * @return {any}
-	 */
-	Queue.prototype.peek = function() {
-	  if (!this.size)
-	    return;
-
-	  return this.items[this.offset];
-	};
-
-	/**
-	 * Method used to iterate over the queue.
-	 *
-	 * @param  {function}  callback - Function to call for each item.
-	 * @param  {object}    scope    - Optional scope.
-	 * @return {undefined}
-	 */
-	Queue.prototype.forEach = function(callback, scope) {
-	  scope = arguments.length > 1 ? scope : this;
-
-	  for (var i = this.offset, j = 0, l = this.items.length; i < l; i++, j++)
-	    callback.call(scope, this.items[i], j, this);
-	};
-
-	/*
-	 * Method used to convert the queue to a JavaScript array.
-	 *
-	 * @return {array}
-	 */
-	Queue.prototype.toArray = function() {
-	  return this.items.slice(this.offset);
-	};
-
-	/**
-	 * Method used to create an iterator over a queue's values.
-	 *
-	 * @return {Iterator}
-	 */
-	Queue.prototype.values = function() {
-	  var items = this.items,
-	      i = this.offset;
-
-	  return new Iterator(function() {
-	    if (i >= items.length)
-	      return {
-	        done: true
-	      };
-
-	    var value = items[i];
-	    i++;
-
-	    return {
-	      value: value,
-	      done: false
-	    };
-	  });
-	};
-
-	/**
-	 * Method used to create an iterator over a queue's entries.
-	 *
-	 * @return {Iterator}
-	 */
-	Queue.prototype.entries = function() {
-	  var items = this.items,
-	      i = this.offset,
-	      j = 0;
-
-	  return new Iterator(function() {
-	    if (i >= items.length)
-	      return {
-	        done: true
-	      };
-
-	    var value = items[i];
-	    i++;
-
-	    return {
-	      value: [j++, value],
-	      done: false
-	    };
-	  });
-	};
-
-	/**
-	 * Attaching the #.values method to Symbol.iterator if possible.
-	 */
-	if (typeof Symbol !== 'undefined')
-	  Queue.prototype[Symbol.iterator] = Queue.prototype.values;
-
-	/**
-	 * Convenience known methods.
-	 */
-	Queue.prototype.toString = function() {
-	  return this.toArray().join(',');
-	};
-
-	Queue.prototype.toJSON = function() {
-	  return this.toArray();
-	};
-
-	Queue.prototype.inspect = function() {
-	  var array = this.toArray();
-
-	  // Trick so that node displays the name of the constructor
-	  Object.defineProperty(array, 'constructor', {
-	    value: Queue,
-	    enumerable: false
-	  });
-
-	  return array;
-	};
-
-	if (typeof Symbol !== 'undefined')
-	  Queue.prototype[Symbol.for('nodejs.util.inspect.custom')] = Queue.prototype.inspect;
-
-	/**
-	 * Static @.from function taking an arbitrary iterable & converting it into
-	 * a queue.
-	 *
-	 * @param  {Iterable} iterable   - Target iterable.
-	 * @return {Queue}
-	 */
-	Queue.from = function(iterable) {
-	  var queue = new Queue();
-
-	  forEach(iterable, function(value) {
-	    queue.enqueue(value);
-	  });
-
-	  return queue;
-	};
-
-	/**
-	 * Static @.of function taking an arbitrary number of arguments & converting it
-	 * into a queue.
-	 *
-	 * @param  {...any} args
-	 * @return {Queue}
-	 */
-	Queue.of = function() {
-	  return Queue.from(arguments);
-	};
-
-	/**
-	 * Exporting.
-	 */
-	queue$1 = Queue;
-	return queue$1;
-}
-
-var queueExports = requireQueue();
-const queue = /*@__PURE__*/object_hash.getDefaultExportFromCjs(queueExports);
-
 const { min: min$4, max: max$4 } = Math;
 
 const limit = (x, low = 0, high = 1) => {
@@ -2119,7 +1617,7 @@ function XYZ_to_OKLab(XYZ) {
     ];
     const LMStoOKLab = [
         [0.210454268309314, 0.7936177747023054, -0.0040720430116193],
-        [1.9779985324311684, -2.4285922420485799, 0.450593709617411],
+        [1.9779985324311684, -2.42859224204858, 0.450593709617411],
         [0.0259040424655478, 0.7827717124575296, -0.8086757549230774]
     ];
 
@@ -2856,7 +2354,7 @@ function cubehelix (
         const sin_a = sin$1(a);
         const r = l + amp * (-0.14861 * cos_a + 1.78277 * sin_a);
         const g = l + amp * (-0.29227 * cos_a - 0.90649 * sin_a);
-        const b = l + amp * (+1.97294 * cos_a);
+        const b = l + amp * (1.97294 * cos_a);
         return chroma(clip_rgb([r * 255, g * 255, b * 255, 1]));
     };
     f.start = function (s) {
@@ -4174,62 +3672,18 @@ function computeColorValues(color) {
   }
 }
 
-exports.DefaultMap = model_index.DefaultMap;
-exports.LikeC4DeploymentModel = model_index.LikeC4DeploymentModel;
-exports.LikeC4Model = model_index.LikeC4Model;
-exports.LikeC4ViewModel = model_index.LikeC4ViewModel;
-exports.Stack = model_index.Stack;
-exports.computeView = model_index.computeView;
-exports.computeViews = model_index.computeViews;
-exports.unsafeComputeView = model_index.unsafeComputeView;
-exports.ancestorsFqn = object_hash.ancestorsFqn;
-exports.commonAncestor = object_hash.commonAncestor;
-exports.commonHead = object_hash.commonHead;
-exports.compareByFqnHierarchically = object_hash.compareByFqnHierarchically;
-exports.compareFqnHierarchically = object_hash.compareFqnHierarchically;
-exports.compareNatural = object_hash.compareNatural;
-exports.difference = object_hash.difference;
-exports.equalsSet = object_hash.equals;
-exports.getOrCreate = object_hash.getOrCreate;
-exports.hasAtLeast = object_hash.i;
-exports.hierarchyDistance = object_hash.hierarchyDistance;
-exports.hierarchyLevel = object_hash.hierarchyLevel;
-exports.ifilter = object_hash.ifilter;
-exports.ifind = object_hash.ifind;
-exports.iflat = object_hash.iflat;
-exports.imap = object_hash.imap;
-exports.intersection = object_hash.intersection;
-exports.isAncestor = object_hash.isAncestor;
-exports.isDescendantOf = object_hash.isDescendantOf;
-exports.isIterable = object_hash.isIterable;
-exports.isNonEmptyArray = object_hash.isNonEmptyArray;
-exports.isSameHierarchy = object_hash.isSameHierarchy;
-exports.isString = object_hash.isString;
-exports.isome = object_hash.isome;
-exports.iunique = object_hash.iunique;
-exports.nameFromFqn = object_hash.nameFromFqn;
-exports.objectHash = object_hash.objectHash;
-exports.parentFqn = object_hash.parentFqn;
-exports.sortByFqnHierarchically = object_hash.sortByFqnHierarchically;
-exports.sortNaturalByFqn = object_hash.sortNaturalByFqn;
-exports.sortParentsFirst = object_hash.sortParentsFirst;
-exports.stringHash = object_hash.stringHash;
-exports.symmetricDifference = object_hash.symmetricDifference;
-exports.toArray = object_hash.toArray;
-exports.toSet = object_hash.toSet;
-exports.union = object_hash.union;
 exports.invariant = chunkRAAYCPUM.invariant;
 exports.nonNullable = chunkRAAYCPUM.nonNullable;
 exports.nonexhaustive = chunkRAAYCPUM.nonexhaustive;
 exports.AsFqn = view.AsFqn;
 exports.BorderStyles = view.BorderStyles;
 Object.defineProperty(exports, "ComputedNode", {
-  enumerable: true,
-  get: function () { return view.ComputedNode; }
+    enumerable: true,
+    get: function () { return view.ComputedNode; }
 });
 Object.defineProperty(exports, "ComputedView", {
-  enumerable: true,
-  get: function () { return view.ComputedView; }
+    enumerable: true,
+    get: function () { return view.ComputedView; }
 });
 exports.DefaultArrowType = view.DefaultArrowType;
 exports.DefaultElementShape = view.DefaultElementShape;
@@ -4237,34 +3691,34 @@ exports.DefaultLineStyle = view.DefaultLineStyle;
 exports.DefaultRelationshipColor = view.DefaultRelationshipColor;
 exports.DefaultThemeColor = view.DefaultThemeColor;
 Object.defineProperty(exports, "DeploymentElement", {
-  enumerable: true,
-  get: function () { return view.DeploymentElement; }
+    enumerable: true,
+    get: function () { return view.DeploymentElement; }
 });
 Object.defineProperty(exports, "DiagramNode", {
-  enumerable: true,
-  get: function () { return view.DiagramNode; }
+    enumerable: true,
+    get: function () { return view.DiagramNode; }
 });
 Object.defineProperty(exports, "ElementKind", {
-  enumerable: true,
-  get: function () { return view.ElementKind; }
+    enumerable: true,
+    get: function () { return view.ElementKind; }
 });
 exports.ElementShapes = view.ElementShapes;
 exports.Expr = view.expression;
 Object.defineProperty(exports, "ExpressionV2", {
-  enumerable: true,
-  get: function () { return view.ExpressionV2; }
+    enumerable: true,
+    get: function () { return view.ExpressionV2; }
 });
 Object.defineProperty(exports, "FqnExpr", {
-  enumerable: true,
-  get: function () { return view.FqnExpr; }
+    enumerable: true,
+    get: function () { return view.FqnExpr; }
 });
 Object.defineProperty(exports, "FqnRef", {
-  enumerable: true,
-  get: function () { return view.FqnRef; }
+    enumerable: true,
+    get: function () { return view.FqnRef; }
 });
 Object.defineProperty(exports, "RelationExpr", {
-  enumerable: true,
-  get: function () { return view.RelationExpr; }
+    enumerable: true,
+    get: function () { return view.RelationExpr; }
 });
 exports.extractStep = view.extractStep;
 exports.getBBoxCenter = view.getBBoxCenter;
@@ -4307,14 +3761,58 @@ exports.isViewRuleStyle = view.isViewRuleStyle;
 exports.isWildcard = view.isWildcard;
 exports.stepEdgeId = view.stepEdgeId;
 exports.whereOperatorAsPredicate = view.whereOperatorAsPredicate;
+exports.LikeC4DeploymentModel = model_index.LikeC4DeploymentModel;
+exports.LikeC4Model = model_index.LikeC4Model;
+exports.LikeC4ViewModel = model_index.LikeC4ViewModel;
+exports.computeView = model_index.computeView;
+exports.computeViews = model_index.computeViews;
+exports.unsafeComputeView = model_index.unsafeComputeView;
 exports.computeRelationshipsView = compute.computeRelationshipsView;
 exports.isThemeColor = types_index.isThemeColor;
+exports.DefaultMap = object_hash.DefaultMap;
+exports.LinkedList = object_hash.linkedList;
+exports.Queue = object_hash.queue;
+exports.Stack = object_hash.Stack;
+exports.ancestorsFqn = object_hash.ancestorsFqn;
+exports.commonAncestor = object_hash.commonAncestor;
+exports.commonHead = object_hash.commonHead;
+exports.compareByFqnHierarchically = object_hash.compareByFqnHierarchically;
+exports.compareFqnHierarchically = object_hash.compareFqnHierarchically;
+exports.compareNatural = object_hash.compareNatural;
+exports.difference = object_hash.difference;
+exports.equalsSet = object_hash.equals;
+exports.getOrCreate = object_hash.getOrCreate;
+exports.hasAtLeast = object_hash.i;
+exports.hierarchyDistance = object_hash.hierarchyDistance;
+exports.hierarchyLevel = object_hash.hierarchyLevel;
+exports.ifilter = object_hash.ifilter;
+exports.ifind = object_hash.ifind;
+exports.iflat = object_hash.iflat;
+exports.imap = object_hash.imap;
+exports.intersection = object_hash.intersection;
+exports.isAncestor = object_hash.isAncestor;
+exports.isDescendantOf = object_hash.isDescendantOf;
+exports.isIterable = object_hash.isIterable;
+exports.isNonEmptyArray = object_hash.isNonEmptyArray;
+exports.isSameHierarchy = object_hash.isSameHierarchy;
+exports.isString = object_hash.isString;
+exports.isome = object_hash.isome;
+exports.iunique = object_hash.iunique;
+exports.nameFromFqn = object_hash.nameFromFqn;
+exports.objectHash = object_hash.objectHash;
+exports.parentFqn = object_hash.parentFqn;
+exports.sortByFqnHierarchically = object_hash.sortByFqnHierarchically;
+exports.sortNaturalByFqn = object_hash.sortNaturalByFqn;
+exports.sortParentsFirst = object_hash.sortParentsFirst;
+exports.stringHash = object_hash.stringHash;
+exports.symmetricDifference = object_hash.symmetricDifference;
+exports.toArray = object_hash.toArray;
+exports.toSet = object_hash.toSet;
+exports.union = object_hash.union;
 exports.compareRelations = utils_index.compareRelations;
 exports.delay = utils_index.delay;
 exports.ireduce = utils_index.ireduce;
 exports.ElementColors = ElementColors;
-exports.LinkedList = linkedList;
-exports.Queue = queue;
 exports.RelationshipColors = RelationshipColors;
 exports.computeColorValues = computeColorValues;
 exports.defaultTheme = defaultTheme;