@schukai/monster 3.73.7 → 3.73.9

package/source/text/generate-range-comparison-expression.mjs

@@ -25,7 +25,7 @@ export { generateRangeComparisonExpression };
  * The generateRangeComparisonExpression() function returns a string representation of the comparison expression.
  *
  * ## Options
- * The options parameter is an object that can have the following properties:
+ * The option parameter is an object that can have the following properties:
  *
  * urlEncode (boolean, default: false): if set to true, URL encodes the comparison operators.
  * andOp (string, default: '&&'): the logical AND operator to use in the expression.

package/source/types/base.mjs

@@ -22,7 +22,7 @@ export { Base };
  * This class has besides a `toString` which returns the json representation of the object
  * also a functionality to check if an object is an instance of a class.
  *
- * Therefor the class has a static method ` [Symbol.hasInstance](that)` which returns true if the object
+ * Therefore, the class has a static method ` [Symbol.hasInstance](that)` which returns true if the object
  * is an instance of the class.
  *
  * @see [https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Symbol/hasInstance](developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Symbol/hasInstance)

package/source/types/id.mjs

@@ -28,7 +28,7 @@ const internalCounter = new Map();
  * thus, the first id with the prefix `myid` will be `myid1` and the second id `myid2`.
  * The ids are the same for every call, for example on a web page.
  *
- * So the ids can also be used for navigation. you just have to take care that the order stays the same.
+ * So the ids can also be used for navigation. you have to take care that the order stays the same.
  *
  * As of version 1.6.0 there is the new RandomID. this ID class is continuous from now on.
  *

package/source/types/node.mjs

@@ -12,13 +12,13 @@
  * SPDX-License-Identifier: AGPL-3.0
  */
 
-import {Base} from "./base.mjs";
-import {isPrimitive} from "./is.mjs";
-import {NodeList} from "./nodelist.mjs";
-import {validateInstance} from "./validate.mjs";
-import {instanceSymbol} from "../constants.mjs";
+import { Base } from "./base.mjs";
+import { isPrimitive } from "./is.mjs";
+import { NodeList } from "./nodelist.mjs";
+import { validateInstance } from "./validate.mjs";
+import { instanceSymbol } from "../constants.mjs";
 
-export {Node};
+export { Node };
 
 /**
  * @private
@@ -43,120 +43,120 @@ const treeStructureSymbol = Symbol("treeStructure");
  * @see https://developer.mozilla.org/de/docs/Web/JavaScript/Reference/Iteration_protocols
  */
 class Node extends Base {
-    /**
-     * @param {*} [value]
-     */
-    constructor(value) {
-        super();
-        this[internalValueSymbol] = value;
-
-        this[treeStructureSymbol] = {
-            parent: null,
-            childNodes: new NodeList(),
-            level: 0,
-        };
-    }
-
-    /**
-     * This method is called by the `instanceof` operator.
-     * @returns {symbol}
-     * @since 2.1.0
-     */
-    static get [instanceSymbol]() {
-        return Symbol.for("@schukai/monster/types/node");
-    }
-
-    /**
-     * @property {*}
-     */
-    get value() {
-        return this[internalValueSymbol];
-    }
-
-    /**
-     * @property {*}
-     */
-    set value(value) {
-        this[internalValueSymbol] = value;
-    }
-
-    /**
-     * @property {Monster.Types.Node|null}
-     */
-    get parent() {
-        return this[treeStructureSymbol].parent;
-    }
-
-    /**
-     * @property {integer}
-     */
-    get level() {
-        return this[treeStructureSymbol].level;
-    }
-
-    /**
-     *
-     * @property {NodeList}
-     */
-    get childNodes() {
-        return this[treeStructureSymbol].childNodes;
-    }
-
-    /**
-     *
-     * @property {NodeList}
-     */
-    set childNodes(childNodes) {
-        this[treeStructureSymbol].childNodes = validateInstance(
-            childNodes,
-            NodeList,
-        );
-        setChildLevelAndParent.call(this, this, 1, new Set());
-    }
-
-    /**
-     * @return {Monster.Types.Node}
-     * @param {Node} node
-     */
-    appendChild(node) {
-        this[treeStructureSymbol].childNodes.add(validateInstance(node, Node));
-        node[treeStructureSymbol].parent = this;
-
-        node[treeStructureSymbol].level = this.level + 1;
-        setChildLevelAndParent.call(this, node, 1, new Set());
-        return this;
-    }
-
-    /**
-     * @return {Monster.Types.Node}
-     * @param {Node} node
-     */
-    removeChild(node) {
-        this[treeStructureSymbol].childNodes.remove(validateInstance(node, Node));
-        node[treeStructureSymbol].parent = null;
-
-        node[treeStructureSymbol].level = 0;
-        setChildLevelAndParent.call(this, node, -1, new Set());
-        return this;
-    }
-
-    /**
-     *
-     * @return {boolean}
-     */
-    hasChildNodes() {
-        return this[treeStructureSymbol].childNodes.length > 0;
-    }
-
-    /**
-     * @return {Monster.Types.Node}
-     * @param {Node} node
-     */
-    hasChild(node) {
-        return this[treeStructureSymbol].childNodes.has(
-            validateInstance(node, Node),
-        );
-    }
+	/**
+	 * @param {*} [value]
+	 */
+	constructor(value) {
+		super();
+		this[internalValueSymbol] = value;
+
+		this[treeStructureSymbol] = {
+			parent: null,
+			childNodes: new NodeList(),
+			level: 0,
+		};
+	}
+
+	/**
+	 * This method is called by the `instanceof` operator.
+	 * @returns {symbol}
+	 * @since 2.1.0
+	 */
+	static get [instanceSymbol]() {
+		return Symbol.for("@schukai/monster/types/node");
+	}
+
+	/**
+	 * @property {*}
+	 */
+	get value() {
+		return this[internalValueSymbol];
+	}
+
+	/**
+	 * @property {*}
+	 */
+	set value(value) {
+		this[internalValueSymbol] = value;
+	}
+
+	/**
+	 * @property {Monster.Types.Node|null}
+	 */
+	get parent() {
+		return this[treeStructureSymbol].parent;
+	}
+
+	/**
+	 * @property {integer}
+	 */
+	get level() {
+		return this[treeStructureSymbol].level;
+	}
+
+	/**
+	 *
+	 * @property {NodeList}
+	 */
+	get childNodes() {
+		return this[treeStructureSymbol].childNodes;
+	}
+
+	/**
+	 *
+	 * @property {NodeList}
+	 */
+	set childNodes(childNodes) {
+		this[treeStructureSymbol].childNodes = validateInstance(
+			childNodes,
+			NodeList,
+		);
+		setChildLevelAndParent.call(this, this, 1, new Set());
+	}
+
+	/**
+	 * @return {Monster.Types.Node}
+	 * @param {Node} node
+	 */
+	appendChild(node) {
+		this[treeStructureSymbol].childNodes.add(validateInstance(node, Node));
+		node[treeStructureSymbol].parent = this;
+
+		node[treeStructureSymbol].level = this.level + 1;
+		setChildLevelAndParent.call(this, node, 1, new Set());
+		return this;
+	}
+
+	/**
+	 * @return {Monster.Types.Node}
+	 * @param {Node} node
+	 */
+	removeChild(node) {
+		this[treeStructureSymbol].childNodes.remove(validateInstance(node, Node));
+		node[treeStructureSymbol].parent = null;
+
+		node[treeStructureSymbol].level = 0;
+		setChildLevelAndParent.call(this, node, -1, new Set());
+		return this;
+	}
+
+	/**
+	 *
+	 * @return {boolean}
+	 */
+	hasChildNodes() {
+		return this[treeStructureSymbol].childNodes.length > 0;
+	}
+
+	/**
+	 * @return {Monster.Types.Node}
+	 * @param {Node} node
+	 */
+	hasChild(node) {
+		return this[treeStructureSymbol].childNodes.has(
+			validateInstance(node, Node),
+		);
+	}
 
 	/**
 	 * @since 1.28.0
@@ -192,7 +192,6 @@ class Node extends Base {
 	}
 }
 
-
 /**
  * @private
  * @param {Node} node
@@ -201,25 +200,25 @@ class Node extends Base {
  * @return {setChildLevelAndParent}
  */
 function setChildLevelAndParent(node, operand, visitedNodes) {
-    const self = this;
-
-    if (visitedNodes.has(node)) {
-        throw new Error(
-            "the node has already been visited and cannot be traversed again",
-        )
-    }
-
-    visitedNodes.add(node);
-
-    if (node !== this) {
-        node[treeStructureSymbol].parent = this;
-    }
-
-    node[treeStructureSymbol].childNodes.forEach(function (child) {
-        child[treeStructureSymbol].parent = node;
-        child[treeStructureSymbol].level =
-            node[treeStructureSymbol].level + operand;
-        setChildLevelAndParent.call(self, child, operand, visitedNodes);
-    });
-    return this;
+	const self = this;
+
+	if (visitedNodes.has(node)) {
+		throw new Error(
+			"the node has already been visited and cannot be traversed again",
+		);
+	}
+
+	visitedNodes.add(node);
+
+	if (node !== this) {
+		node[treeStructureSymbol].parent = this;
+	}
+
+	node[treeStructureSymbol].childNodes.forEach(function (child) {
+		child[treeStructureSymbol].parent = node;
+		child[treeStructureSymbol].level =
+			node[treeStructureSymbol].level + operand;
+		setChildLevelAndParent.call(self, child, operand, visitedNodes);
+	});
+	return this;
 }

package/test/cases/data/buildmap.mjs

@@ -335,6 +335,5 @@ describe('buildMap', function () {
             });
         });
 
-
     });
 });

package/test/cases/data/pathfinder.mjs

@@ -69,11 +69,12 @@ describe('Pathfinder', function () {
 
 
             it('.setVia(' + a + ') should result in ' + b, function () {
+
                 let r = pf.getVia(a);
                 let i = convertMapResult(r);
                 expect(JSON.stringify(i)).is.equal(b);
-            });
 
+            });
 
         });