@wavemaker/angular-app 11.14.1-21.64739 → 11.14.1-22.647453

package/dependencies/transpilation-web.cjs.js

@@ -28490,17 +28490,17 @@ var root = freeGlobal || freeSelf || Function('return this')();
 var Symbol$1 = root.Symbol;
 
 /** Used for built-in method references. */
-var objectProto$i = Object.prototype;
+var objectProto$h = Object.prototype;
 
 /** Used to check objects for own properties. */
-var hasOwnProperty$f = objectProto$i.hasOwnProperty;
+var hasOwnProperty$e = objectProto$h.hasOwnProperty;
 
 /**
  * Used to resolve the
  * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)
  * of values.
  */
-var nativeObjectToString$1 = objectProto$i.toString;
+var nativeObjectToString$1 = objectProto$h.toString;
 
 /** Built-in value references. */
 var symToStringTag$1 = Symbol$1 ? Symbol$1.toStringTag : undefined;
@@ -28513,7 +28513,7 @@ var symToStringTag$1 = Symbol$1 ? Symbol$1.toStringTag : undefined;
  * @returns {string} Returns the raw `toStringTag`.
  */
 function getRawTag(value) {
-  var isOwn = hasOwnProperty$f.call(value, symToStringTag$1),
+  var isOwn = hasOwnProperty$e.call(value, symToStringTag$1),
       tag = value[symToStringTag$1];
 
   try {
@@ -28533,14 +28533,14 @@ function getRawTag(value) {
 }
 
 /** Used for built-in method references. */
-var objectProto$h = Object.prototype;
+var objectProto$g = Object.prototype;
 
 /**
  * Used to resolve the
  * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)
  * of values.
  */
-var nativeObjectToString = objectProto$h.toString;
+var nativeObjectToString = objectProto$g.toString;
 
 /**
  * Converts `value` to a string using `Object.prototype.toString`.
@@ -29006,17 +29006,17 @@ var reIsHostCtor = /^\[object .+?Constructor\]$/;
 
 /** Used for built-in method references. */
 var funcProto$1 = Function.prototype,
-    objectProto$g = Object.prototype;
+    objectProto$f = Object.prototype;
 
 /** Used to resolve the decompiled source of functions. */
 var funcToString$1 = funcProto$1.toString;
 
 /** Used to check objects for own properties. */
-var hasOwnProperty$e = objectProto$g.hasOwnProperty;
+var hasOwnProperty$d = objectProto$f.hasOwnProperty;
 
 /** Used to detect if a method is native. */
 var reIsNative = RegExp('^' +
-  funcToString$1.call(hasOwnProperty$e).replace(reRegExpChar, '\\$&')
+  funcToString$1.call(hasOwnProperty$d).replace(reRegExpChar, '\\$&')
   .replace(/hasOwnProperty|(function).*?(?=\\\()| for .+?(?=\\\])/g, '$1.*?') + '$'
 );
 
@@ -29431,10 +29431,10 @@ function eq(value, other) {
 }
 
 /** Used for built-in method references. */
-var objectProto$f = Object.prototype;
+var objectProto$e = Object.prototype;
 
 /** Used to check objects for own properties. */
-var hasOwnProperty$d = objectProto$f.hasOwnProperty;
+var hasOwnProperty$c = objectProto$e.hasOwnProperty;
 
 /**
  * Assigns `value` to `key` of `object` if the existing value is not equivalent
@@ -29448,7 +29448,7 @@ var hasOwnProperty$d = objectProto$f.hasOwnProperty;
  */
 function assignValue(object, key, value) {
   var objValue = object[key];
-  if (!(hasOwnProperty$d.call(object, key) && eq(objValue, value)) ||
+  if (!(hasOwnProperty$c.call(object, key) && eq(objValue, value)) ||
       (value === undefined && !(key in object))) {
     baseAssignValue(object, key, value);
   }
@@ -29654,7 +29654,7 @@ function createAssigner(assigner) {
 }
 
 /** Used for built-in method references. */
-var objectProto$e = Object.prototype;
+var objectProto$d = Object.prototype;
 
 /**
  * Checks if `value` is likely a prototype object.
@@ -29665,7 +29665,7 @@ var objectProto$e = Object.prototype;
  */
 function isPrototype(value) {
   var Ctor = value && value.constructor,
-      proto = (typeof Ctor == 'function' && Ctor.prototype) || objectProto$e;
+      proto = (typeof Ctor == 'function' && Ctor.prototype) || objectProto$d;
 
   return value === proto;
 }
@@ -29704,13 +29704,13 @@ function baseIsArguments(value) {
 }
 
 /** Used for built-in method references. */
-var objectProto$d = Object.prototype;
+var objectProto$c = Object.prototype;
 
 /** Used to check objects for own properties. */
-var hasOwnProperty$c = objectProto$d.hasOwnProperty;
+var hasOwnProperty$b = objectProto$c.hasOwnProperty;
 
 /** Built-in value references. */
-var propertyIsEnumerable$1 = objectProto$d.propertyIsEnumerable;
+var propertyIsEnumerable$1 = objectProto$c.propertyIsEnumerable;
 
 /**
  * Checks if `value` is likely an `arguments` object.
@@ -29731,7 +29731,7 @@ var propertyIsEnumerable$1 = objectProto$d.propertyIsEnumerable;
  * // => false
  */
 var isArguments = baseIsArguments(function() { return arguments; }()) ? baseIsArguments : function(value) {
-  return isObjectLike(value) && hasOwnProperty$c.call(value, 'callee') &&
+  return isObjectLike(value) && hasOwnProperty$b.call(value, 'callee') &&
     !propertyIsEnumerable$1.call(value, 'callee');
 };
 
@@ -29904,10 +29904,10 @@ var nodeIsTypedArray = nodeUtil && nodeUtil.isTypedArray;
 var isTypedArray = nodeIsTypedArray ? baseUnary(nodeIsTypedArray) : baseIsTypedArray;
 
 /** Used for built-in method references. */
-var objectProto$c = Object.prototype;
+var objectProto$b = Object.prototype;
 
 /** Used to check objects for own properties. */
-var hasOwnProperty$b = objectProto$c.hasOwnProperty;
+var hasOwnProperty$a = objectProto$b.hasOwnProperty;
 
 /**
  * Creates an array of the enumerable property names of the array-like `value`.
@@ -29927,7 +29927,7 @@ function arrayLikeKeys(value, inherited) {
       length = result.length;
 
   for (var key in value) {
-    if ((inherited || hasOwnProperty$b.call(value, key)) &&
+    if ((inherited || hasOwnProperty$a.call(value, key)) &&
         !(skipIndexes && (
            // Safari 9 has enumerable `arguments.length` in strict mode.
            key == 'length' ||
@@ -29962,10 +29962,10 @@ function overArg(func, transform) {
 var nativeKeys = overArg(Object.keys, Object);
 
 /** Used for built-in method references. */
-var objectProto$b = Object.prototype;
+var objectProto$a = Object.prototype;
 
 /** Used to check objects for own properties. */
-var hasOwnProperty$a = objectProto$b.hasOwnProperty;
+var hasOwnProperty$9 = objectProto$a.hasOwnProperty;
 
 /**
  * The base implementation of `_.keys` which doesn't treat sparse arrays as dense.
@@ -29980,7 +29980,7 @@ function baseKeys(object) {
   }
   var result = [];
   for (var key in Object(object)) {
-    if (hasOwnProperty$a.call(object, key) && key != 'constructor') {
+    if (hasOwnProperty$9.call(object, key) && key != 'constructor') {
       result.push(key);
     }
   }
@@ -30020,10 +30020,10 @@ function keys(object) {
 }
 
 /** Used for built-in method references. */
-var objectProto$a = Object.prototype;
+var objectProto$9 = Object.prototype;
 
 /** Used to check objects for own properties. */
-var hasOwnProperty$9 = objectProto$a.hasOwnProperty;
+var hasOwnProperty$8 = objectProto$9.hasOwnProperty;
 
 /**
  * Assigns own enumerable string keyed properties of source objects to the
@@ -30063,7 +30063,7 @@ var assign = createAssigner(function(object, source) {
     return;
   }
   for (var key in source) {
-    if (hasOwnProperty$9.call(source, key)) {
+    if (hasOwnProperty$8.call(source, key)) {
       assignValue(object, key, source[key]);
     }
   }
@@ -30089,10 +30089,10 @@ function nativeKeysIn(object) {
 }
 
 /** Used for built-in method references. */
-var objectProto$9 = Object.prototype;
+var objectProto$8 = Object.prototype;
 
 /** Used to check objects for own properties. */
-var hasOwnProperty$8 = objectProto$9.hasOwnProperty;
+var hasOwnProperty$7 = objectProto$8.hasOwnProperty;
 
 /**
  * The base implementation of `_.keysIn` which doesn't treat sparse arrays as dense.
@@ -30109,7 +30109,7 @@ function baseKeysIn(object) {
       result = [];
 
   for (var key in object) {
-    if (!(key == 'constructor' && (isProto || !hasOwnProperty$8.call(object, key)))) {
+    if (!(key == 'constructor' && (isProto || !hasOwnProperty$7.call(object, key)))) {
       result.push(key);
     }
   }
@@ -30203,10 +30203,10 @@ function hashDelete(key) {
 var HASH_UNDEFINED$2 = '__lodash_hash_undefined__';
 
 /** Used for built-in method references. */
-var objectProto$8 = Object.prototype;
+var objectProto$7 = Object.prototype;
 
 /** Used to check objects for own properties. */
-var hasOwnProperty$7 = objectProto$8.hasOwnProperty;
+var hasOwnProperty$6 = objectProto$7.hasOwnProperty;
 
 /**
  * Gets the hash value for `key`.
@@ -30223,14 +30223,14 @@ function hashGet(key) {
     var result = data[key];
     return result === HASH_UNDEFINED$2 ? undefined : result;
   }
-  return hasOwnProperty$7.call(data, key) ? data[key] : undefined;
+  return hasOwnProperty$6.call(data, key) ? data[key] : undefined;
 }
 
 /** Used for built-in method references. */
-var objectProto$7 = Object.prototype;
+var objectProto$6 = Object.prototype;
 
 /** Used to check objects for own properties. */
-var hasOwnProperty$6 = objectProto$7.hasOwnProperty;
+var hasOwnProperty$5 = objectProto$6.hasOwnProperty;
 
 /**
  * Checks if a hash value for `key` exists.
@@ -30243,7 +30243,7 @@ var hasOwnProperty$6 = objectProto$7.hasOwnProperty;
  */
 function hashHas(key) {
   var data = this.__data__;
-  return nativeCreate ? (data[key] !== undefined) : hasOwnProperty$6.call(data, key);
+  return nativeCreate ? (data[key] !== undefined) : hasOwnProperty$5.call(data, key);
 }
 
 /** Used to stand-in for `undefined` hash values. */
@@ -30888,13 +30888,13 @@ var objectTag$3 = '[object Object]';
 
 /** Used for built-in method references. */
 var funcProto = Function.prototype,
-    objectProto$6 = Object.prototype;
+    objectProto$5 = Object.prototype;
 
 /** Used to resolve the decompiled source of functions. */
 var funcToString = funcProto.toString;
 
 /** Used to check objects for own properties. */
-var hasOwnProperty$5 = objectProto$6.hasOwnProperty;
+var hasOwnProperty$4 = objectProto$5.hasOwnProperty;
 
 /** Used to infer the `Object` constructor. */
 var objectCtorString = funcToString.call(Object);
@@ -30935,7 +30935,7 @@ function isPlainObject(value) {
   if (proto === null) {
     return true;
   }
-  var Ctor = hasOwnProperty$5.call(proto, 'constructor') && proto.constructor;
+  var Ctor = hasOwnProperty$4.call(proto, 'constructor') && proto.constructor;
   return typeof Ctor == 'function' && Ctor instanceof Ctor &&
     funcToString.call(Ctor) == objectCtorString;
 }
@@ -31740,10 +31740,10 @@ function stubArray() {
 }
 
 /** Used for built-in method references. */
-var objectProto$5 = Object.prototype;
+var objectProto$4 = Object.prototype;
 
 /** Built-in value references. */
-var propertyIsEnumerable = objectProto$5.propertyIsEnumerable;
+var propertyIsEnumerable = objectProto$4.propertyIsEnumerable;
 
 /* Built-in method references for those with the same name as other `lodash` methods. */
 var nativeGetSymbols$1 = Object.getOwnPropertySymbols;
@@ -31906,10 +31906,10 @@ if ((DataView$1 && getTag(new DataView$1(new ArrayBuffer(1))) != dataViewTag$3)
 }
 
 /** Used for built-in method references. */
-var objectProto$4 = Object.prototype;
+var objectProto$3 = Object.prototype;
 
 /** Used to check objects for own properties. */
-var hasOwnProperty$4 = objectProto$4.hasOwnProperty;
+var hasOwnProperty$3 = objectProto$3.hasOwnProperty;
 
 /**
  * Initializes an array clone.
@@ -31923,7 +31923,7 @@ function initCloneArray(array) {
       result = new array.constructor(length);
 
   // Add properties assigned by `RegExp#exec`.
-  if (length && typeof array[0] == 'string' && hasOwnProperty$4.call(array, 'index')) {
+  if (length && typeof array[0] == 'string' && hasOwnProperty$3.call(array, 'index')) {
     result.index = array.index;
     result.input = array.input;
   }
@@ -32384,7 +32384,7 @@ function setCacheAdd(value) {
  * @name has
  * @memberOf SetCache
  * @param {*} value The value to search for.
- * @returns {boolean} Returns `true` if `value` is found, else `false`.
+ * @returns {number} Returns `true` if `value` is found, else `false`.
  */
 function setCacheHas(value) {
   return this.__data__.has(value);
@@ -32667,10 +32667,10 @@ function equalByTag(object, other, tag, bitmask, customizer, equalFunc, stack) {
 var COMPARE_PARTIAL_FLAG$3 = 1;
 
 /** Used for built-in method references. */
-var objectProto$3 = Object.prototype;
+var objectProto$2 = Object.prototype;
 
 /** Used to check objects for own properties. */
-var hasOwnProperty$3 = objectProto$3.hasOwnProperty;
+var hasOwnProperty$2 = objectProto$2.hasOwnProperty;
 
 /**
  * A specialized version of `baseIsEqualDeep` for objects with support for
@@ -32698,7 +32698,7 @@ function equalObjects(object, other, bitmask, customizer, equalFunc, stack) {
   var index = objLength;
   while (index--) {
     var key = objProps[index];
-    if (!(isPartial ? key in other : hasOwnProperty$3.call(other, key))) {
+    if (!(isPartial ? key in other : hasOwnProperty$2.call(other, key))) {
       return false;
     }
   }
@@ -32759,10 +32759,10 @@ var argsTag = '[object Arguments]',
     objectTag = '[object Object]';
 
 /** Used for built-in method references. */
-var objectProto$2 = Object.prototype;
+var objectProto$1 = Object.prototype;
 
 /** Used to check objects for own properties. */
-var hasOwnProperty$2 = objectProto$2.hasOwnProperty;
+var hasOwnProperty$1 = objectProto$1.hasOwnProperty;
 
 /**
  * A specialized version of `baseIsEqual` for arrays and objects which performs
@@ -32805,8 +32805,8 @@ function baseIsEqualDeep(object, other, bitmask, customizer, equalFunc, stack) {
       : equalByTag(object, other, objTag, bitmask, customizer, equalFunc, stack);
   }
   if (!(bitmask & COMPARE_PARTIAL_FLAG$2)) {
-    var objIsWrapped = objIsObj && hasOwnProperty$2.call(object, '__wrapped__'),
-        othIsWrapped = othIsObj && hasOwnProperty$2.call(other, '__wrapped__');
+    var objIsWrapped = objIsObj && hasOwnProperty$1.call(object, '__wrapped__'),
+        othIsWrapped = othIsObj && hasOwnProperty$1.call(other, '__wrapped__');
 
     if (objIsWrapped || othIsWrapped) {
       var objUnwrapped = objIsWrapped ? object.value() : object,
@@ -34349,10 +34349,10 @@ var mapTag = '[object Map]',
     setTag = '[object Set]';
 
 /** Used for built-in method references. */
-var objectProto$1 = Object.prototype;
+var objectProto = Object.prototype;
 
 /** Used to check objects for own properties. */
-var hasOwnProperty$1 = objectProto$1.hasOwnProperty;
+var hasOwnProperty = objectProto.hasOwnProperty;
 
 /**
  * Checks if `value` is an empty object, collection, map, or set.
@@ -34404,7 +34404,7 @@ function isEmpty(value) {
     return !baseKeys(value).length;
   }
   for (var key in value) {
-    if (hasOwnProperty$1.call(value, key)) {
+    if (hasOwnProperty.call(value, key)) {
       return false;
     }
   }
@@ -34628,12 +34628,6 @@ var merge$1 = createAssigner(function(object, source, srcIndex) {
   baseMerge(object, source, srcIndex);
 });
 
-/** Used for built-in method references. */
-var objectProto = Object.prototype;
-
-/** Used to check objects for own properties. */
-var hasOwnProperty = objectProto.hasOwnProperty;
-
 /**
  * The base implementation of `_.unset`.
  *
@@ -34644,34 +34638,8 @@ var hasOwnProperty = objectProto.hasOwnProperty;
  */
 function baseUnset(object, path) {
   path = castPath(path, object);
-
-  // Prevent prototype pollution:
-  // https://github.com/lodash/lodash/security/advisories/GHSA-xxjr-mmjv-4gpg
-  // https://github.com/lodash/lodash/security/advisories/GHSA-f23m-r3pf-42rh
-  var index = -1,
-      length = path.length;
-
-  if (!length) {
-    return true;
-  }
-
-  while (++index < length) {
-    var key = toKey(path[index]);
-
-    // Always block "__proto__" anywhere in the path if it's not expected
-    if (key === '__proto__' && !hasOwnProperty.call(object, '__proto__')) {
-      return false;
-    }
-
-    // Block constructor/prototype as non-terminal traversal keys to prevent
-    // escaping the object graph into built-in constructors and prototypes.
-    if ((key === 'constructor' || key === 'prototype') && index < length - 1) {
-      return false;
-    }
-  }
-
-  var obj = parent$1(object, path);
-  return obj == null || delete obj[toKey(last$1(path))];
+  object = parent$1(object, path);
+  return object == null || delete object[toKey(last$1(path))];
 }
 
 /**
@@ -34848,7 +34816,7 @@ function baseOrderBy(collection, iteratees, orders) {
       if (isArray(iteratee)) {
         return function(value) {
           return baseGet(value, iteratee.length === 1 ? iteratee[0] : iteratee);
-        };
+        }
       }
       return iteratee;
     });
@@ -37843,14 +37811,14 @@ function requireDom () {
 	ExceptionCode.DOMSTRING_SIZE_ERR          = ((ExceptionMessage[2]="DOMString size error"),2);
 	var HIERARCHY_REQUEST_ERR       = ExceptionCode.HIERARCHY_REQUEST_ERR       = ((ExceptionMessage[3]="Hierarchy request error"),3);
 	ExceptionCode.WRONG_DOCUMENT_ERR          = ((ExceptionMessage[4]="Wrong document"),4);
-	ExceptionCode.INVALID_CHARACTER_ERR       = ((ExceptionMessage[5]="Invalid character"),5);
+	var INVALID_CHARACTER_ERR       = ExceptionCode.INVALID_CHARACTER_ERR       = ((ExceptionMessage[5]="Invalid character"),5);
 	ExceptionCode.NO_DATA_ALLOWED_ERR         = ((ExceptionMessage[6]="No data allowed"),6);
 	ExceptionCode.NO_MODIFICATION_ALLOWED_ERR = ((ExceptionMessage[7]="No modification allowed"),7);
 	var NOT_FOUND_ERR               = ExceptionCode.NOT_FOUND_ERR               = ((ExceptionMessage[8]="Not found"),8);
 	ExceptionCode.NOT_SUPPORTED_ERR           = ((ExceptionMessage[9]="Not supported"),9);
 	var INUSE_ATTRIBUTE_ERR         = ExceptionCode.INUSE_ATTRIBUTE_ERR         = ((ExceptionMessage[10]="Attribute in use"),10);
 	//level2
-	ExceptionCode.INVALID_STATE_ERR        	= ((ExceptionMessage[11]="Invalid state"),11);
+	var INVALID_STATE_ERR        	= ExceptionCode.INVALID_STATE_ERR        	= ((ExceptionMessage[11]="Invalid state"),11);
 	ExceptionCode.SYNTAX_ERR               	= ((ExceptionMessage[12]="Syntax error"),12);
 	ExceptionCode.INVALID_MODIFICATION_ERR 	= ((ExceptionMessage[13]="Invalid modification"),13);
 	ExceptionCode.NAMESPACE_ERR           	= ((ExceptionMessage[14]="Invalid namespace"),14);
@@ -37900,9 +37868,10 @@ function requireDom () {
 		item: function(index) {
 			return index >= 0 && index < this.length ? this[index] : null;
 		},
-		toString:function(isHTML,nodeFilter){
+		toString:function(isHTML,nodeFilter,options){
+			var requireWellFormed = !!options && !!options.requireWellFormed;
 			for(var buf = [], i = 0;i<this.length;i++){
-				serializeToString(this[i],buf,isHTML,nodeFilter);
+				serializeToString(this[i],buf,isHTML,nodeFilter,null,requireWellFormed);
 			}
 			return buf.join('');
 		},
@@ -38147,13 +38116,28 @@ function requireDom () {
 		/**
 		 * Returns a doctype, with the given `qualifiedName`, `publicId`, and `systemId`.
 		 *
-		 * __This behavior is slightly different from the in the specs__:
+		 * __This implementation differs from the specification:__
 		 * - this implementation is not validating names or qualified names
 		 *   (when parsing XML strings, the SAX parser takes care of that)
 		 *
+		 * Note: `internalSubset` can only be introduced via a direct property write to `node.internalSubset` after creation.
+		 * Creation-time validation of `publicId`, `systemId` is not enforced.
+		 * The serializer-level check covers all mutation vectors, including direct property writes.
+		 * `internalSubset` is only serialized as `[ ... ]` when both `publicId` and `systemId` are
+		 * absent (empty or `'.'`) — if either external identifier is present, `internalSubset` is
+		 * silently omitted from the serialized output.
+		 *
 		 * @param {string} qualifiedName
 		 * @param {string} [publicId]
+		 * The external subset public identifier. Stored verbatim including surrounding quotes.
+		 * When serialized with `requireWellFormed: true` (via the 4th-parameter options object),
+		 * throws `DOMException` with code `INVALID_STATE_ERR` if the value is non-empty and does
+		 * not match the XML `PubidLiteral` production (W3C DOM Parsing §3.2.1.3; XML 1.0 [12]).
 		 * @param {string} [systemId]
+		 * The external subset system identifier. Stored verbatim including surrounding quotes.
+		 * When serialized with `requireWellFormed: true`, throws `DOMException` with code
+		 * `INVALID_STATE_ERR` if the value is non-empty and does not match the XML `SystemLiteral`
+		 * production (W3C DOM Parsing §3.2.1.3; XML 1.0 [11]).
 		 * @returns {DocumentType} which can either be used with `DOMImplementation.createDocument` upon document creation
 		 * 				  or can be put into the document via methods like `Node.insertBefore()` or `Node.replaceChild()`
 		 *
@@ -38219,18 +38203,44 @@ function requireDom () {
 			return cloneNode(this.ownerDocument||this,this,deep);
 		},
 		// Modified in DOM Level 2:
-		normalize:function(){
-			var child = this.firstChild;
-			while(child){
-				var next = child.nextSibling;
-				if(next && next.nodeType == TEXT_NODE && child.nodeType == TEXT_NODE){
-					this.removeChild(next);
-					child.appendData(next.data);
-				}else {
-					child.normalize();
-					child = next;
-				}
-			}
+		/**
+		 * Puts the specified node and all of its subtree into a "normalized" form. In a normalized
+		 * subtree, no text nodes in the subtree are empty and there are no adjacent text nodes.
+		 *
+		 * Specifically, this method merges any adjacent text nodes (i.e., nodes for which `nodeType`
+		 * is `TEXT_NODE`) into a single node with the combined data. It also removes any empty text
+		 * nodes.
+		 *
+		 * This method iteratively traverses all child nodes to normalize all descendant nodes within
+		 * the subtree.
+		 *
+		 * @throws {DOMException}
+		 * May throw a DOMException if operations within removeChild or appendData (which are
+		 * potentially invoked in this method) do not meet their specific constraints.
+		 * @see {@link Node.removeChild}
+		 * @see {@link CharacterData.appendData}
+		 * @see ../docs/walk-dom.md.
+		 */
+		normalize: function () {
+			walkDOM(this, null, {
+				enter: function (node) {
+					// Merge adjacent text children of node before walkDOM schedules them.
+					// walkDOM reads lastChild/previousSibling after enter returns, so the
+					// surviving post-merge children are what it descends into.
+					var child = node.firstChild;
+					while (child) {
+						var next = child.nextSibling;
+						if (next !== null && next.nodeType === TEXT_NODE && child.nodeType === TEXT_NODE) {
+							node.removeChild(next);
+							child.appendData(next.data);
+							// Do not advance child: re-check new nextSibling for another text run
+						} else {
+							child = next;
+						}
+					}
+					return true; // descend into surviving children
+				},
+			});
 		},
 	  	// Introduced in DOM Level 2:
 		isSupported:function(feature, version){
@@ -38306,21 +38316,103 @@ function requireDom () {
 	copy(NodeType,Node.prototype);
 
 	/**
-	 * @param callback return true for continue,false for break
-	 * @return boolean true: break visit;
+	 * @param {Node} node
+	 * Root of the subtree to visit.
+	 * @param {function(Node): boolean} callback
+	 * Called for each node in depth-first pre-order. Return a truthy value to stop traversal early.
+	 * @return {boolean} `true` if traversal was aborted by the callback, `false` otherwise.
 	 */
-	function _visitNode(node,callback){
-		if(callback(node)){
-			return true;
-		}
-		if(node = node.firstChild){
-			do{
-				if(_visitNode(node,callback)){return true}
-	        }while(node=node.nextSibling)
-	    }
+	function _visitNode(node, callback) {
+		return walkDOM(node, null, { enter: function (n) { return callback(n) ? walkDOM.STOP : true; } }) === walkDOM.STOP;
 	}
 
+	/**
+	 * Depth-first pre/post-order DOM tree walker.
+	 *
+	 * Visits every node in the subtree rooted at `node`. For each node:
+	 *
+	 * 1. Calls `callbacks.enter(node, context)` before descending into the node's children. The
+	 * return value becomes the `context` passed to each child's `enter` call and to the matching
+	 * `exit` call.
+	 * 2. If `enter` returns `null` or `undefined`, the node's children are skipped;
+	 * sibling traversal continues normally.
+	 * 3. If `enter` returns `walkDOM.STOP`, the entire traversal is aborted immediately — no
+	 * further `enter` or `exit` calls are made.
+	 * 4. `lastChild` and `previousSibling` are read **after** `enter` returns, so `enter` may
+	 * safely modify the node's own child list before the walker descends. Modifying siblings of
+	 * the current node or any other part of the tree produces unpredictable results: nodes already
+	 * queued on the stack are visited regardless of DOM changes, and newly inserted nodes outside
+	 * the current child list are never visited.
+	 * 5. Calls `callbacks.exit(node, context)` (if provided) after all of a node's children have
+	 * been visited, passing the same `context` that `enter`
+	 * returned for that node.
+	 *
+	 * This implementation uses an explicit stack and does not recurse — it is safe on arbitrarily
+	 * deep trees.
+	 *
+	 * @param {Node} node
+	 * Root of the subtree to walk.
+	 * @param {*} context
+	 * Initial context value passed to the root node's `enter`.
+	 * @param {{ enter: function(Node, *): *, exit?: function(Node, *): void }} callbacks
+	 * @returns {void | walkDOM.STOP}
+	 * @see ../docs/walk-dom.md.
+	 */
+	function walkDOM(node, context, callbacks) {
+		// Each stack frame is {node, context, phase}:
+		//   walkDOM.ENTER — call enter, then push children
+		//   walkDOM.EXIT  — call exit
+		var stack = [{ node: node, context: context, phase: walkDOM.ENTER }];
+		while (stack.length > 0) {
+			var frame = stack.pop();
+			if (frame.phase === walkDOM.ENTER) {
+				var childContext = callbacks.enter(frame.node, frame.context);
+				if (childContext === walkDOM.STOP) {
+					return walkDOM.STOP;
+				}
+				// Push exit frame before children so it fires after all children are processed (Last In First Out)
+				stack.push({ node: frame.node, context: childContext, phase: walkDOM.EXIT });
+				if (childContext === null || childContext === undefined) {
+					continue; // skip children
+				}
+				// lastChild is read after enter returns, so enter may modify the child list.
+				var child = frame.node.lastChild;
+				// Traverse from lastChild backwards so that pushing onto the stack
+				// naturally yields firstChild on top (processed first).
+				while (child) {
+					stack.push({ node: child, context: childContext, phase: walkDOM.ENTER });
+					child = child.previousSibling;
+				}
+			} else {
+				// frame.phase === walkDOM.EXIT
+				if (callbacks.exit) {
+					callbacks.exit(frame.node, frame.context);
+				}
+			}
+		}
+	}
 
+	/**
+	 * Sentinel value returned from a `walkDOM` `enter` callback to abort the entire traversal
+	 * immediately.
+	 *
+	 * @type {symbol}
+	 */
+	walkDOM.STOP = Symbol('walkDOM.STOP');
+	/**
+	 * Phase constant for a stack frame that has not yet been visited.
+	 * The `enter` callback is called and children are scheduled.
+	 *
+	 * @type {number}
+	 */
+	walkDOM.ENTER = 0;
+	/**
+	 * Phase constant for a stack frame whose subtree has been fully visited.
+	 * The `exit` callback is called.
+	 *
+	 * @type {number}
+	 */
+	walkDOM.EXIT = 1;
 
 	function Document(){
 		this.ownerDocument = this;
@@ -38924,12 +39016,44 @@ function requireDom () {
 			node.appendData(data);
 			return node;
 		},
+		/**
+		 * Returns a new CDATASection node whose data is `data`.
+		 *
+		 * __This implementation differs from the specification:__
+		 * - calling this method on an HTML document does not throw `NotSupportedError`.
+		 *
+		 * @param {string} data
+		 * @returns {CDATASection}
+		 * @throws DOMException with code `INVALID_CHARACTER_ERR` if `data` contains `"]]>"`.
+		 * @see https://developer.mozilla.org/en-US/docs/Web/API/Document/createCDATASection
+		 * @see https://dom.spec.whatwg.org/#dom-document-createcdatasection
+		 */
 		createCDATASection :	function(data){
+			if (data.indexOf(']]>') !== -1) {
+				throw new DOMException(INVALID_CHARACTER_ERR, 'data contains "]]>"');
+			}
 			var node = new CDATASection();
 			node.ownerDocument = this;
 			node.appendData(data);
 			return node;
 		},
+		/**
+		 * Returns a ProcessingInstruction node whose target is target and data is data.
+		 *
+		 * __This implementation differs from the specification:__
+		 * - it does not do any input validation on the arguments and doesn't throw "InvalidCharacterError".
+		 *
+		 * Note: When the resulting document is serialized with `requireWellFormed: true`, the
+		 * serializer throws with code `INVALID_STATE_ERR` if `.data` contains `?>` (W3C DOM Parsing
+		 * §3.2.1.7). Without that option the data is emitted verbatim.
+		 *
+		 * @param {string} target
+		 * @param {string} data
+		 * @returns {ProcessingInstruction}
+		 * @see https://developer.mozilla.org/docs/Web/API/Document/createProcessingInstruction
+		 * @see https://dom.spec.whatwg.org/#dom-document-createprocessinginstruction
+		 * @see https://www.w3.org/TR/DOM-Parsing/#dfn-concept-serialize-xml §3.2.1.7
+		 */
 		createProcessingInstruction :	function(target,data){
 			var node = new ProcessingInstruction();
 			node.ownerDocument = this;
@@ -39155,6 +39279,19 @@ function requireDom () {
 	_extends(CDATASection,CharacterData);
 
 
+	/**
+	 * Represents a DocumentType node (the `<!DOCTYPE ...>` declaration).
+	 *
+	 * `publicId`, `systemId`, and `internalSubset` are plain own-property assignments.
+	 * xmldom does not enforce the `readonly` constraint declared by the WHATWG DOM spec —
+	 * direct property writes succeed silently. Values are serialized verbatim when
+	 * `requireWellFormed` is false (the default). When the serializer is invoked with
+	 * `requireWellFormed: true` (via the 4th-parameter options object), it validates each
+	 * field and throws `DOMException` with code `INVALID_STATE_ERR` on invalid values.
+	 *
+	 * @class
+	 * @see https://developer.mozilla.org/en-US/docs/Web/API/DocumentType MDN
+	 */
 	function DocumentType() {
 	}	DocumentType.prototype.nodeType = DOCUMENT_TYPE_NODE;
 	_extends(DocumentType,Node);
@@ -39182,11 +39319,48 @@ function requireDom () {
 	ProcessingInstruction.prototype.nodeType = PROCESSING_INSTRUCTION_NODE;
 	_extends(ProcessingInstruction,Node);
 	function XMLSerializer(){}
-	XMLSerializer.prototype.serializeToString = function(node,isHtml,nodeFilter){
-		return nodeSerializeToString.call(node,isHtml,nodeFilter);
+	/**
+	 * Returns the result of serializing `node` to XML.
+	 *
+	 * When `options.requireWellFormed` is `true`, the serializer throws for content that would
+	 * produce ill-formed XML.
+	 *
+	 * __This implementation differs from the specification:__
+	 * - CDATASection nodes whose data contains `]]>` are serialized by splitting the section
+	 *   at each `]]>` occurrence (following W3C DOM Level 3 Core `split-cdata-sections`
+	 *   default behaviour) unless `requireWellFormed` is `true`.
+	 * - when `requireWellFormed` is `true`, `DOMException` with code `INVALID_STATE_ERR`
+	 *   is only thrown to prevent injection vectors, not for all the spec mandated checks.
+	 *
+	 * @param {Node} node
+	 * @param {boolean} [isHtml]
+	 * @param {function} [nodeFilter]
+	 * @param {Object} [options]
+	 * @param {boolean} [options.requireWellFormed=false]
+	 * When `true`, throws for content that would produce ill-formed XML.
+	 * @returns {string}
+	 * @throws {DOMException}
+	 * With code `INVALID_STATE_ERR` when `requireWellFormed` is `true` and:
+	 * - a CDATASection node's data contains `"]]>"`,
+	 * - a Comment node's data contains `"-->"` (bare `"--"` does not throw on this branch),
+	 * - a ProcessingInstruction's data contains `"?>"`,
+	 * - a DocumentType's `publicId` is non-empty and does not match the XML `PubidLiteral`
+	 *   production,
+	 * - a DocumentType's `systemId` is non-empty and does not match the XML `SystemLiteral`
+	 *   production, or
+	 * - a DocumentType's `internalSubset` contains `"]>"`.
+	 * Note: xmldom does not enforce `readonly` on DocumentType fields — direct property
+	 * writes succeed and are covered by the serializer-level checks above.
+	 * @see https://html.spec.whatwg.org/#dom-xmlserializer-serializetostring
+	 * @see https://w3c.github.io/DOM-Parsing/#xml-serialization
+	 * @see https://github.com/w3c/DOM-Parsing/issues/84
+	 */
+	XMLSerializer.prototype.serializeToString = function(node,isHtml,nodeFilter,options){
+		return nodeSerializeToString.call(node,isHtml,nodeFilter,options);
 	};
 	Node.prototype.toString = nodeSerializeToString;
-	function nodeSerializeToString(isHtml,nodeFilter){
+	function nodeSerializeToString(isHtml,nodeFilter,options){
+		var requireWellFormed = !!options && !!options.requireWellFormed;
 		var buf = [];
 		var refNode = this.nodeType == 9 && this.documentElement || this;
 		var prefix = refNode.prefix;
@@ -39203,7 +39377,7 @@ function requireDom () {
 				];
 			}
 		}
-		serializeToString(this,buf,isHtml,nodeFilter,visibleNamespaces);
+		serializeToString(this,buf,isHtml,nodeFilter,visibleNamespaces,requireWellFormed);
 		//console.log('###',this.nodeType,uri,prefix,buf.join(''))
 		return buf.join('');
 	}
@@ -39252,271 +39426,323 @@ function requireDom () {
 		buf.push(' ', qualifiedName, '="', value.replace(/[<>&"\t\n\r]/g, _xmlEncoder), '"');
 	}
 
-	function serializeToString(node,buf,isHTML,nodeFilter,visibleNamespaces){
+	function serializeToString(node, buf, isHTML, nodeFilter, visibleNamespaces, requireWellFormed) {
 		if (!visibleNamespaces) {
 			visibleNamespaces = [];
 		}
-
-		if(nodeFilter){
-			node = nodeFilter(node);
-			if(node){
-				if(typeof node == 'string'){
-					buf.push(node);
-					return;
-				}
-			}else {
-				return;
-			}
-			//buf.sort.apply(attrs, attributeSorter);
-		}
-
-		switch(node.nodeType){
-		case ELEMENT_NODE:
-			var attrs = node.attributes;
-			var len = attrs.length;
-			var child = node.firstChild;
-			var nodeName = node.tagName;
-
-			isHTML = NAMESPACE.isHTML(node.namespaceURI) || isHTML;
-
-			var prefixedNodeName = nodeName;
-			if (!isHTML && !node.prefix && node.namespaceURI) {
-				var defaultNS;
-				// lookup current default ns from `xmlns` attribute
-				for (var ai = 0; ai < attrs.length; ai++) {
-					if (attrs.item(ai).name === 'xmlns') {
-						defaultNS = attrs.item(ai).value;
-						break
-					}
-				}
-				if (!defaultNS) {
-					// lookup current default ns in visibleNamespaces
-					for (var nsi = visibleNamespaces.length - 1; nsi >= 0; nsi--) {
-						var namespace = visibleNamespaces[nsi];
-						if (namespace.prefix === '' && namespace.namespace === node.namespaceURI) {
-							defaultNS = namespace.namespace;
-							break
+		walkDOM(node, { ns: visibleNamespaces, isHTML: isHTML }, {
+			enter: function (n, ctx) {
+				var ns = ctx.ns;
+				var html = ctx.isHTML;
+
+				if (nodeFilter) {
+					n = nodeFilter(n);
+					if (n) {
+						if (typeof n == 'string') {
+							buf.push(n);
+							return null;
 						}
+					} else {
+						return null;
 					}
 				}
-				if (defaultNS !== node.namespaceURI) {
-					for (var nsi = visibleNamespaces.length - 1; nsi >= 0; nsi--) {
-						var namespace = visibleNamespaces[nsi];
-						if (namespace.namespace === node.namespaceURI) {
-							if (namespace.prefix) {
-								prefixedNodeName = namespace.prefix + ':' + nodeName;
+
+				switch (n.nodeType) {
+					case ELEMENT_NODE:
+						var attrs = n.attributes;
+						var len = attrs.length;
+						var nodeName = n.tagName;
+
+						html = NAMESPACE.isHTML(n.namespaceURI) || html;
+
+						var prefixedNodeName = nodeName;
+						if (!html && !n.prefix && n.namespaceURI) {
+							var defaultNS;
+							// lookup current default ns from `xmlns` attribute
+							for (var ai = 0; ai < attrs.length; ai++) {
+								if (attrs.item(ai).name === 'xmlns') {
+									defaultNS = attrs.item(ai).value;
+									break;
+								}
+							}
+							if (!defaultNS) {
+								// lookup current default ns in visibleNamespaces
+								for (var nsi = ns.length - 1; nsi >= 0; nsi--) {
+									var nsEntry = ns[nsi];
+									if (nsEntry.prefix === '' && nsEntry.namespace === n.namespaceURI) {
+										defaultNS = nsEntry.namespace;
+										break;
+									}
+								}
+							}
+							if (defaultNS !== n.namespaceURI) {
+								for (var nsi = ns.length - 1; nsi >= 0; nsi--) {
+									var nsEntry = ns[nsi];
+									if (nsEntry.namespace === n.namespaceURI) {
+										if (nsEntry.prefix) {
+											prefixedNodeName = nsEntry.prefix + ':' + nodeName;
+										}
+										break;
+									}
+								}
 							}
-							break
 						}
-					}
-				}
-			}
 
-			buf.push('<', prefixedNodeName);
+						buf.push('<', prefixedNodeName);
+
+						// Build a fresh namespace snapshot for this element's children.
+						// The slice prevents sibling elements from inheriting each other's declarations.
+						var childNs = ns.slice();
+						for (var i = 0; i < len; i++) {
+							var attr = attrs.item(i);
+							if (attr.prefix == 'xmlns') {
+								childNs.push({ prefix: attr.localName, namespace: attr.value });
+							} else if (attr.nodeName == 'xmlns') {
+								childNs.push({ prefix: '', namespace: attr.value });
+							}
+						}
 
-			for(var i=0;i<len;i++){
-				// add namespaces for attributes
-				var attr = attrs.item(i);
-				if (attr.prefix == 'xmlns') {
-					visibleNamespaces.push({ prefix: attr.localName, namespace: attr.value });
-				}else if(attr.nodeName == 'xmlns'){
-					visibleNamespaces.push({ prefix: '', namespace: attr.value });
-				}
-			}
+						for (var i = 0; i < len; i++) {
+							var attr = attrs.item(i);
+							if (needNamespaceDefine(attr, html, childNs)) {
+								var attrPrefix = attr.prefix || '';
+								var uri = attr.namespaceURI;
+								addSerializedAttribute(buf, attrPrefix ? 'xmlns:' + attrPrefix : 'xmlns', uri);
+								childNs.push({ prefix: attrPrefix, namespace: uri });
+							}
+							// Apply nodeFilter and serialize the attribute.
+							var filteredAttr = nodeFilter ? nodeFilter(attr) : attr;
+							if (filteredAttr) {
+								if (typeof filteredAttr === 'string') {
+									buf.push(filteredAttr);
+								} else {
+									addSerializedAttribute(buf, filteredAttr.name, filteredAttr.value);
+								}
+							}
+						}
 
-			for(var i=0;i<len;i++){
-				var attr = attrs.item(i);
-				if (needNamespaceDefine(attr,isHTML, visibleNamespaces)) {
-					var prefix = attr.prefix||'';
-					var uri = attr.namespaceURI;
-					addSerializedAttribute(buf, prefix ? 'xmlns:' + prefix : "xmlns", uri);
-					visibleNamespaces.push({ prefix: prefix, namespace:uri });
-				}
-				serializeToString(attr,buf,isHTML,nodeFilter,visibleNamespaces);
-			}
+						// add namespace for current node
+						if (nodeName === prefixedNodeName && needNamespaceDefine(n, html, childNs)) {
+							var nodePrefix = n.prefix || '';
+							var uri = n.namespaceURI;
+							addSerializedAttribute(buf, nodePrefix ? 'xmlns:' + nodePrefix : 'xmlns', uri);
+							childNs.push({ prefix: nodePrefix, namespace: uri });
+						}
 
-			// add namespace for current node
-			if (nodeName === prefixedNodeName && needNamespaceDefine(node, isHTML, visibleNamespaces)) {
-				var prefix = node.prefix||'';
-				var uri = node.namespaceURI;
-				addSerializedAttribute(buf, prefix ? 'xmlns:' + prefix : "xmlns", uri);
-				visibleNamespaces.push({ prefix: prefix, namespace:uri });
-			}
+						var child = n.firstChild;
+						if (child || html && !/^(?:meta|link|img|br|hr|input)$/i.test(nodeName)) {
+							buf.push('>');
+							if (html && /^script$/i.test(nodeName)) {
+								// Inline serialization for <script> children; return null to skip walkDOM descent.
+								while (child) {
+									if (child.data) {
+										buf.push(child.data);
+									} else {
+										serializeToString(child, buf, html, nodeFilter, childNs.slice(), requireWellFormed);
+									}
+									child = child.nextSibling;
+								}
+								buf.push('</', nodeName, '>');
+								return null;
+							}
+							// Return child context; walkDOM descends and exit emits the closing tag.
+							return { ns: childNs, isHTML: html, tag: prefixedNodeName };
+						} else {
+							buf.push('/>');
+							return null;
+						}
 
-			if(child || isHTML && !/^(?:meta|link|img|br|hr|input)$/i.test(nodeName)){
-				buf.push('>');
-				//if is cdata child node
-				if(isHTML && /^script$/i.test(nodeName)){
-					while(child){
-						if(child.data){
-							buf.push(child.data);
-						}else {
-							serializeToString(child, buf, isHTML, nodeFilter, visibleNamespaces.slice());
+					case DOCUMENT_NODE:
+					case DOCUMENT_FRAGMENT_NODE:
+						// Descend into children; exit is a no-op (tag is null).
+						return { ns: ns.slice(), isHTML: html, tag: null };
+
+					case ATTRIBUTE_NODE:
+						addSerializedAttribute(buf, n.name, n.value);
+						return null;
+
+					case TEXT_NODE:
+						/**
+						 * The ampersand character (&) and the left angle bracket (<) must not appear in their literal form,
+						 * except when used as markup delimiters, or within a comment, a processing instruction, or a CDATA section.
+						 * If they are needed elsewhere, they must be escaped using either numeric character references or the strings
+						 * `&amp;` and `&lt;` respectively.
+						 * The right angle bracket (>) may be represented using the string " &gt; ", and must, for compatibility,
+						 * be escaped using either `&gt;` or a character reference when it appears in the string `]]>` in content,
+						 * when that string is not marking the end of a CDATA section.
+						 *
+						 * In the content of elements, character data is any string of characters
+						 * which does not contain the start-delimiter of any markup
+						 * and does not include the CDATA-section-close delimiter, `]]>`.
+						 *
+						 * @see https://www.w3.org/TR/xml/#NT-CharData
+						 * @see https://w3c.github.io/DOM-Parsing/#xml-serializing-a-text-node
+						 */
+						buf.push(n.data.replace(/[<&>]/g, _xmlEncoder));
+						return null;
+
+					case CDATA_SECTION_NODE:
+						if (requireWellFormed && n.data.indexOf(']]>') !== -1) {
+							throw new DOMException(INVALID_STATE_ERR, 'The CDATASection data contains "]]>"');
 						}
-						child = child.nextSibling;
-					}
-				}else
-				{
-					while(child){
-						serializeToString(child, buf, isHTML, nodeFilter, visibleNamespaces.slice());
-						child = child.nextSibling;
-					}
-				}
-				buf.push('</',prefixedNodeName,'>');
-			}else {
-				buf.push('/>');
-			}
-			// remove added visible namespaces
-			//visibleNamespaces.length = startVisibleNamespaces;
-			return;
-		case DOCUMENT_NODE:
-		case DOCUMENT_FRAGMENT_NODE:
-			var child = node.firstChild;
-			while(child){
-				serializeToString(child, buf, isHTML, nodeFilter, visibleNamespaces.slice());
-				child = child.nextSibling;
-			}
-			return;
-		case ATTRIBUTE_NODE:
-			return addSerializedAttribute(buf, node.name, node.value);
-		case TEXT_NODE:
-			/**
-			 * The ampersand character (&) and the left angle bracket (<) must not appear in their literal form,
-			 * except when used as markup delimiters, or within a comment, a processing instruction, or a CDATA section.
-			 * If they are needed elsewhere, they must be escaped using either numeric character references or the strings
-			 * `&amp;` and `&lt;` respectively.
-			 * The right angle bracket (>) may be represented using the string " &gt; ", and must, for compatibility,
-			 * be escaped using either `&gt;` or a character reference when it appears in the string `]]>` in content,
-			 * when that string is not marking the end of a CDATA section.
-			 *
-			 * In the content of elements, character data is any string of characters
-			 * which does not contain the start-delimiter of any markup
-			 * and does not include the CDATA-section-close delimiter, `]]>`.
-			 *
-			 * @see https://www.w3.org/TR/xml/#NT-CharData
-			 * @see https://w3c.github.io/DOM-Parsing/#xml-serializing-a-text-node
-			 */
-			return buf.push(node.data
-				.replace(/[<&>]/g,_xmlEncoder)
-			);
-		case CDATA_SECTION_NODE:
-			return buf.push( '<![CDATA[',node.data,']]>');
-		case COMMENT_NODE:
-			return buf.push( "<!--",node.data,"-->");
-		case DOCUMENT_TYPE_NODE:
-			var pubid = node.publicId;
-			var sysid = node.systemId;
-			buf.push('<!DOCTYPE ',node.name);
-			if(pubid){
-				buf.push(' PUBLIC ', pubid);
-				if (sysid && sysid!='.') {
-					buf.push(' ', sysid);
+						buf.push('<![CDATA[', n.data.replace(/]]>/g, ']]]]><![CDATA[>'), ']]>');
+						return null;
+
+					case COMMENT_NODE:
+						if (requireWellFormed && n.data.indexOf('-->') !== -1) {
+							throw new DOMException(INVALID_STATE_ERR, 'The comment node data contains "-->"');
+						}
+						buf.push('<!--', n.data, '-->');
+						return null;
+
+					case DOCUMENT_TYPE_NODE:
+						if (requireWellFormed) {
+							if (n.publicId && !/^("[\x20\r\na-zA-Z0-9\-()+,.\/:=?;!*#@$_%']*"|'[\x20\r\na-zA-Z0-9\-()+,.\/:=?;!*#@$_%'"]*')$/.test(n.publicId)) {
+								throw new DOMException(INVALID_STATE_ERR, 'DocumentType publicId is not a valid PubidLiteral');
+							}
+							if (n.systemId && !/^("[^"]*"|'[^']*')$/.test(n.systemId)) {
+								throw new DOMException(INVALID_STATE_ERR, 'DocumentType systemId is not a valid SystemLiteral');
+							}
+							if (n.internalSubset && n.internalSubset.indexOf(']>') !== -1) {
+								throw new DOMException(INVALID_STATE_ERR, 'DocumentType internalSubset contains "]>"');
+							}
+						}
+						var pubid = n.publicId;
+						var sysid = n.systemId;
+						buf.push('<!DOCTYPE ', n.name);
+						if (pubid) {
+							buf.push(' PUBLIC ', pubid);
+							if (sysid && sysid != '.') {
+								buf.push(' ', sysid);
+							}
+							buf.push('>');
+						} else if (sysid && sysid != '.') {
+							buf.push(' SYSTEM ', sysid, '>');
+						} else {
+							var sub = n.internalSubset;
+							if (sub) {
+								buf.push(' [', sub, ']');
+							}
+							buf.push('>');
+						}
+						return null;
+
+					case PROCESSING_INSTRUCTION_NODE:
+						if (requireWellFormed && n.data.indexOf('?>') !== -1) {
+							throw new DOMException(INVALID_STATE_ERR, 'The ProcessingInstruction data contains "?>"');
+						}
+						buf.push('<?', n.target, ' ', n.data, '?>');
+						return null;
+
+					case ENTITY_REFERENCE_NODE:
+						buf.push('&', n.nodeName, ';');
+						return null;
+
+					//case ENTITY_NODE:
+					//case NOTATION_NODE:
+					default:
+						buf.push('??', n.nodeName);
+						return null;
 				}
-				buf.push('>');
-			}else if(sysid && sysid!='.'){
-				buf.push(' SYSTEM ', sysid, '>');
-			}else {
-				var sub = node.internalSubset;
-				if(sub){
-					buf.push(" [",sub,"]");
+			},
+			exit: function (n, childCtx) {
+				if (childCtx && childCtx.tag) {
+					buf.push('</', childCtx.tag, '>');
 				}
-				buf.push(">");
-			}
-			return;
-		case PROCESSING_INSTRUCTION_NODE:
-			return buf.push( "<?",node.target," ",node.data,"?>");
-		case ENTITY_REFERENCE_NODE:
-			return buf.push( '&',node.nodeName,';');
-		//case ENTITY_NODE:
-		//case NOTATION_NODE:
-		default:
-			buf.push('??',node.nodeName);
-		}
+			},
+		});
 	}
-	function importNode(doc,node,deep){
-		var node2;
-		switch (node.nodeType) {
-		case ELEMENT_NODE:
-			node2 = node.cloneNode(false);
-			node2.ownerDocument = doc;
-			//var attrs = node2.attributes;
-			//var len = attrs.length;
-			//for(var i=0;i<len;i++){
-				//node2.setAttributeNodeNS(importNode(doc,attrs.item(i),deep));
-			//}
-		case DOCUMENT_FRAGMENT_NODE:
-			break;
-		case ATTRIBUTE_NODE:
-			deep = true;
-			break;
-		//case ENTITY_REFERENCE_NODE:
-		//case PROCESSING_INSTRUCTION_NODE:
-		////case TEXT_NODE:
-		//case CDATA_SECTION_NODE:
-		//case COMMENT_NODE:
-		//	deep = false;
-		//	break;
-		//case DOCUMENT_NODE:
-		//case DOCUMENT_TYPE_NODE:
-		//cannot be imported.
-		//case ENTITY_NODE:
-		//case NOTATION_NODE：
-		//can not hit in level3
-		//default:throw e;
-		}
-		if(!node2){
-			node2 = node.cloneNode(false);//false
-		}
-		node2.ownerDocument = doc;
-		node2.parentNode = null;
-		if(deep){
-			var child = node.firstChild;
-			while(child){
-				node2.appendChild(importNode(doc,child,deep));
-				child = child.nextSibling;
-			}
-		}
-		return node2;
+	/**
+	 * Imports a node from a different document into `doc`, creating a new copy.
+	 * Delegates to {@link walkDOM} for traversal. Each node in the subtree is shallow-cloned,
+	 * stamped with `doc` as its `ownerDocument`, and detached (`parentNode` set to `null`).
+	 * Children are imported recursively when `deep` is `true`; for {@link Attr} nodes `deep` is
+	 * always forced to `true`
+	 * because an attribute's value lives in a child text node.
+	 *
+	 * @param {Document} doc
+	 * The document that will own the imported node.
+	 * @param {Node} node
+	 * The node to import.
+	 * @param {boolean} deep
+	 * If `true`, descendants are imported recursively.
+	 * @returns {Node}
+	 * The newly imported node, now owned by `doc`.
+	 */
+	function importNode(doc, node, deep) {
+		var destRoot;
+		walkDOM(node, null, {
+			enter: function (srcNode, destParent) {
+				// Shallow-clone the node and stamp it into the target document.
+				var destNode = srcNode.cloneNode(false);
+				destNode.ownerDocument = doc;
+				destNode.parentNode = null;
+				// capture as the root of the imported subtree or attach to parent.
+				if (destParent === null) {
+					destRoot = destNode;
+				} else {
+					destParent.appendChild(destNode);
+				}
+				// ATTRIBUTE_NODE must always be imported deeply: its value lives in a child text node.
+				var shouldDeep = srcNode.nodeType === ATTRIBUTE_NODE || deep;
+				return shouldDeep ? destNode : null;
+			},
+		});
+		return destRoot;
 	}
 	//
 	//var _relationMap = {firstChild:1,lastChild:1,previousSibling:1,nextSibling:1,
 	//					attributes:1,childNodes:1,parentNode:1,documentElement:1,doctype,};
-	function cloneNode(doc,node,deep){
-		var node2 = new node.constructor();
-		for (var n in node) {
-			if (Object.prototype.hasOwnProperty.call(node, n)) {
-				var v = node[n];
-				if (typeof v != "object") {
-					if (v != node2[n]) {
-						node2[n] = v;
+	function cloneNode(doc, node, deep) {
+		var destRoot;
+		walkDOM(node, null, {
+			enter: function (srcNode, destParent) {
+				// 1. Create a blank node of the same type and copy all scalar own properties.
+				var destNode = new srcNode.constructor();
+				for (var n in srcNode) {
+					if (Object.prototype.hasOwnProperty.call(srcNode, n)) {
+						var v = srcNode[n];
+						if (typeof v != 'object') {
+							if (v != destNode[n]) {
+								destNode[n] = v;
+							}
+						}
 					}
 				}
-			}
-		}
-		if(node.childNodes){
-			node2.childNodes = new NodeList();
-		}
-		node2.ownerDocument = doc;
-		switch (node2.nodeType) {
-		case ELEMENT_NODE:
-			var attrs	= node.attributes;
-			var attrs2	= node2.attributes = new NamedNodeMap();
-			var len = attrs.length;
-			attrs2._ownerElement = node2;
-			for(var i=0;i<len;i++){
-				node2.setAttributeNode(cloneNode(doc,attrs.item(i),true));
-			}
-			break;		case ATTRIBUTE_NODE:
-			deep = true;
-		}
-		if(deep){
-			var child = node.firstChild;
-			while(child){
-				node2.appendChild(cloneNode(doc,child,deep));
-				child = child.nextSibling;
-			}
-		}
-		return node2;
+				if (srcNode.childNodes) {
+					destNode.childNodes = new NodeList();
+				}
+				destNode.ownerDocument = doc;
+				// 2. Handle node-type-specific setup.
+				//    Attributes are not DOM children, so they are cloned inline here
+				//    rather than by walkDOM descent.
+				//    ATTRIBUTE_NODE forces deep=true so its own children are walked.
+				var shouldDeep = deep;
+				switch (destNode.nodeType) {
+					case ELEMENT_NODE:
+						var attrs = srcNode.attributes;
+						var attrs2 = (destNode.attributes = new NamedNodeMap());
+						var len = attrs.length;
+						attrs2._ownerElement = destNode;
+						for (var i = 0; i < len; i++) {
+							destNode.setAttributeNode(cloneNode(doc, attrs.item(i), true));
+						}
+						break;
+					case ATTRIBUTE_NODE:
+						shouldDeep = true;
+				}
+				// 3. Attach to parent, or capture as the root of the cloned subtree.
+				if (destParent !== null) {
+					destParent.appendChild(destNode);
+				} else {
+					destRoot = destNode;
+				}
+				// 4. Return destNode as the context for children (causes walkDOM to descend),
+				//    or null to skip children (shallow clone).
+				return shouldDeep ? destNode : null;
+			},
+		});
+		return destRoot;
 	}
 
 	function __set__(object,key,value){
@@ -39532,49 +39758,55 @@ function requireDom () {
 				}
 			});
 
-			Object.defineProperty(Node.prototype,'textContent',{
-				get:function(){
-					return getTextContent(this);
+			/**
+			 * The text content of this node and its descendants.
+			 *
+			 * Setting `textContent` on an element or document fragment replaces all child nodes with a
+			 * single text node; on other nodes it sets `data`, `value`, and `nodeValue` directly.
+			 *
+			 * @type {string | null}
+			 * @see {@link https://dom.spec.whatwg.org/#dom-node-textcontent}
+			 */
+			Object.defineProperty(Node.prototype, 'textContent', {
+				get: function () {
+					if (this.nodeType === ELEMENT_NODE || this.nodeType === DOCUMENT_FRAGMENT_NODE) {
+						var buf = [];
+						walkDOM(this, null, {
+							enter: function (n) {
+								if (n.nodeType === ELEMENT_NODE || n.nodeType === DOCUMENT_FRAGMENT_NODE) {
+									return true; // enter children
+								}
+								if (n.nodeType === PROCESSING_INSTRUCTION_NODE || n.nodeType === COMMENT_NODE) {
+									return null; // excluded from text content
+								}
+								buf.push(n.nodeValue);
+							},
+						});
+						return buf.join('');
+					}
+					return this.nodeValue;
 				},
 
-				set:function(data){
-					switch(this.nodeType){
-					case ELEMENT_NODE:
-					case DOCUMENT_FRAGMENT_NODE:
-						while(this.firstChild){
-							this.removeChild(this.firstChild);
-						}
-						if(data || String(data)){
-							this.appendChild(this.ownerDocument.createTextNode(data));
-						}
-						break;
+				set: function (data) {
+					switch (this.nodeType) {
+						case ELEMENT_NODE:
+						case DOCUMENT_FRAGMENT_NODE:
+							while (this.firstChild) {
+								this.removeChild(this.firstChild);
+							}
+							if (data || String(data)) {
+								this.appendChild(this.ownerDocument.createTextNode(data));
+							}
+							break;
 
-					default:
-						this.data = data;
-						this.value = data;
-						this.nodeValue = data;
+						default:
+							this.data = data;
+							this.value = data;
+							this.nodeValue = data;
 					}
-				}
+				},
 			});
 
-			function getTextContent(node){
-				switch(node.nodeType){
-				case ELEMENT_NODE:
-				case DOCUMENT_FRAGMENT_NODE:
-					var buf = [];
-					node = node.firstChild;
-					while(node){
-						if(node.nodeType!==7 && node.nodeType !==8){
-							buf.push(getTextContent(node));
-						}
-						node = node.nextSibling;
-					}
-					return buf.join('');
-				default:
-					return node.nodeValue;
-				}
-			}
-
 			__set__ = function(object,key,value){
 				//console.log(value)
 				object['$$'+key] = value;
@@ -39590,6 +39822,7 @@ function requireDom () {
 		dom.Element = Element;
 		dom.Node = Node;
 		dom.NodeList = NodeList;
+		dom.walkDOM = walkDOM;
 		dom.XMLSerializer = XMLSerializer;
 	//}
 	return dom;
@@ -42380,7 +42613,7 @@ function requireSax () {
 	function parseInstruction(source,start,domBuilder){
 		var end = source.indexOf('?>',start);
 		if(end){
-			var match = source.substring(start,end).match(/^<\?(\S*)\s*([\s\S]*?)\s*$/);
+			var match = source.substring(start,end).match(/^<\?(\S*)\s*([\s\S]*?)$/);
 			if(match){
 				match[0].length;
 				domBuilder.processingInstruction(match[1], match[2]) ;
@@ -49267,7 +49500,7 @@ function requireMomentTimezone () {
 	hasRequiredMomentTimezone = 1;
 	(function (module) {
 		//! moment-timezone.js
-		//! version : 0.6.0
+		//! version : 0.6.2
 		//! Copyright (c) JS Foundation and other contributors
 		//! license : MIT
 		//! github.com/moment/moment-timezone
@@ -49293,7 +49526,7 @@ function requireMomentTimezone () {
 			// 	return moment;
 			// }
 
-			var VERSION = "0.6.0",
+			var VERSION = "0.6.2",
 				zones = {},
 				links = {},
 				countries = {},