@schukai/monster 3.55.0 → 3.55.1

package/source/dom/util.mjs

@@ -212,7 +212,7 @@ function findElementWithIdUpwards(element, targetId) {
  * Recursively searches upwards from a given element to find an ancestor element
  * with a specified selector, considering both normal DOM and shadow DOM.
  * This method is useful for finding a parent element with a specific class.
- * 
+ *
  * @param {HTMLElement|ShadowRoot} element - The starting element or shadow root to search from.
  * @param {string} selector - The selector of the target element to find.
  * @returns {HTMLElement|null} - The ancestor element with the specified selector, or null if not found.
@@ -220,7 +220,7 @@ function findElementWithIdUpwards(element, targetId) {
  * @since 3.55.0
  */
 function findElementWithSelectorUpwards(element, selector) {
-	if (!element) {
+	if (!element || !selector) {
 		return null;
 	}
 

package/source/monster.mjs

@@ -1,4 +1,3 @@
-
 /**
  * Copyright schukai GmbH and contributors 2023. All Rights Reserved.
  * Node module: @schukai/monster

package/source/types/noderecursiveiterator.mjs

@@ -22,7 +22,7 @@ export { NodeRecursiveIterator };
 const isNodeListSymbol = Symbol("isNodeList");
 
 /**
- * You can create the instance via the monster namespace `new Monster.Types.NodeRecursiveIterator()`.
+ * Represents a recursive iterator for traversing nodes in a DOM tree.
  *
  * @externalExample ../../example/types/noderecursiveiterator.mjs
  * @license AGPLv3
@@ -30,22 +30,25 @@ const isNodeListSymbol = Symbol("isNodeList");
  * @copyright schukai GmbH
  * @memberOf Monster.Types
  * @summary An iterator to run recursively through a tree of nodes
+ * @extends Base
  */
 class NodeRecursiveIterator extends Base {
 	/**
-	 * @param {Node} [data]
+	 * @param node
 	 */
 	constructor(node) {
 		super();
 
 		this[isNodeListSymbol] = false;
 
-		// iterator is a nodelist
+		// iterator is a NodeList
 		if (isInstance(node, NodeList)) {
 			const children = node;
-			node = new Node();
-			node.childNodes = children;
+			let n = new Node();
+			n.childNodes = children;
 			this[isNodeListSymbol] = true;
+			this[internalSymbol]  = n;
+			return;
 		}
 
 		this[internalSymbol] = validateInstance(node, Node);
@@ -77,8 +80,7 @@ class NodeRecursiveIterator extends Base {
 				yield* new NodeRecursiveIterator(node);
 			}
 		}
-
-		return;
+		
 	};
 
 	/**

package/source/types/version.mjs

@@ -152,7 +152,7 @@ function getMonsterVersion() {
 	}
 
 	/** don't touch, replaced by make with package.json version */
-	monsterVersion = new Version("3.55.0");
+	monsterVersion = new Version("3.55.1");
 
 	return monsterVersion;
 }

package/source/util/sleep.mjs

@@ -5,14 +5,13 @@
  * License text available at https://www.gnu.org/licenses/agpl-3.0.en.html
  */
 
-
 /**
- * 
+ *
  * @param milliseconds
  * @returns {Promise<unknown>}
  * @since 3.55.0
  * @memberOf Monster.Util
  */
 export function Sleep(milliseconds) {
-    return new Promise(resolve => setTimeout(resolve, milliseconds));
-}
+	return new Promise((resolve) => setTimeout(resolve, milliseconds));
+}

package/test/cases/monster.mjs

@@ -7,7 +7,7 @@ describe('Monster', function () {
         let monsterVersion
 
         /** don´t touch, replaced by make with package.json version */
-        monsterVersion = new Version("3.55.0")
+        monsterVersion = new Version("3.55.1")
 
         let m = getMonsterVersion();