html-minifier-next 4.16.0 → 4.16.1

package/README.md

@@ -358,35 +358,34 @@ How does HTML Minifier Next compare to other minifiers? (All minification with t
 | Site | Original Size (KB) | [HTML Minifier Next](https://github.com/j9t/html-minifier-next) ([config](https://github.com/j9t/html-minifier-next/blob/main/benchmarks/html-minifier.json))<br>[![npm last update](https://img.shields.io/npm/last-update/html-minifier-next)](https://socket.dev/npm/package/html-minifier-next) | [htmlnano](https://github.com/posthtml/htmlnano)<br>[![npm last update](https://img.shields.io/npm/last-update/htmlnano)](https://socket.dev/npm/package/htmlnano) | [@swc/html](https://github.com/swc-project/swc)<br>[![npm last update](https://img.shields.io/npm/last-update/@swc/html)](https://socket.dev/npm/package/@swc/html) | [minify-html](https://github.com/wilsonzlin/minify-html)<br>[![npm last update](https://img.shields.io/npm/last-update/@minify-html/node)](https://socket.dev/npm/package/@minify-html/node) | [minimize](https://github.com/Swaagie/minimize)<br>[![npm last update](https://img.shields.io/npm/last-update/minimize)](https://socket.dev/npm/package/minimize) | [html­com­pressor.­com](https://htmlcompressor.com/) |
 | --- | --- | --- | --- | --- | --- | --- | --- |
 | [A List Apart](https://alistapart.com/) | 59 | **50** | 51 | 52 | 51 | 54 | 52 |
-| [Apple](https://www.apple.com/) | 260 | **203** | 231 | 235 | 236 | 238 | 238 |
-| [BBC](https://www.bbc.co.uk/) | 704 | **641** | 661 | 661 | 662 | 698 | n/a |
+| [Apple](https://www.apple.com/) | 211 | **177** | 188 | 190 | 191 | 192 | 193 |
+| [BBC](https://www.bbc.co.uk/) | 675 | **614** | 633 | 634 | 635 | 669 | n/a |
 | [CERN](https://home.cern/) | 152 | **83** | 91 | 91 | 91 | 93 | 96 |
-| [CSS-Tricks](https://css-tricks.com/) | 162 | **119** | 128 | 143 | 143 | 148 | 145 |
+| [CSS-Tricks](https://css-tricks.com/) | 162 | **119** | 127 | 143 | 143 | 148 | 144 |
 | [ECMAScript](https://tc39.es/ecma262/) | 7250 | **6401** | 6573 | 6455 | 6578 | 6626 | n/a |
 | [EDRi](https://edri.org/) | 80 | **59** | 70 | 70 | 71 | 75 | 73 |
-| [EFF](https://www.eff.org/) | 54 | **45** | 48 | 47 | 48 | 49 | 49 |
+| [EFF](https://www.eff.org/) | 54 | **45** | 49 | 47 | 48 | 49 | 49 |
 | [European Alternatives](https://european-alternatives.eu/) | 48 | **30** | 32 | 32 | 32 | 32 | 32 |
-| [FAZ](https://www.faz.net/aktuell/) | 1537 | 1429 | **1378** | 1462 | 1473 | 1484 | n/a |
+| [FAZ](https://www.faz.net/aktuell/) | 1579 | 1468 | **1414** | 1503 | 1514 | 1525 | n/a |
 | [French Tech](https://lafrenchtech.gouv.fr/) | 153 | **122** | 126 | 126 | 126 | 132 | 127 |
-| [Frontend Dogma](https://frontenddogma.com/) | 225 | **217** | 238 | 224 | 225 | 244 | 225 |
+| [Frontend Dogma](https://frontenddogma.com/) | 225 | **217** | 238 | 223 | 225 | 244 | 225 |
 | [Google](https://www.google.com/) | 18 | **16** | 17 | 17 | 17 | 18 | 18 |
-| [Ground News](https://ground.news/) | 2437 | **2150** | 2246 | 2272 | 2275 | 2424 | n/a |
 | [HTML Living Standard](https://html.spec.whatwg.org/multipage/) | 149 | 148 | 153 | **147** | 149 | 155 | 149 |
 | [Igalia](https://www.igalia.com/) | 50 | **33** | 36 | 36 | 36 | 37 | 36 |
-| [Leanpub](https://leanpub.com/) | 233 | **203** | 217 | 217 | 218 | 228 | 230 |
+| [Leanpub](https://leanpub.com/) | 231 | **202** | 216 | 216 | 217 | 227 | 229 |
 | [Mastodon](https://mastodon.social/explore) | 37 | **28** | 32 | 35 | 35 | 36 | 36 |
 | [MDN](https://developer.mozilla.org/en-US/) | 106 | **60** | 62 | 63 | 63 | 66 | 66 |
 | [Middle East Eye](https://www.middleeasteye.net/) | 223 | **197** | 203 | 201 | 201 | 203 | 204 |
 | [Mistral AI](https://mistral.ai/) | 361 | **319** | 324 | 326 | 327 | 357 | n/a |
 | [Mozilla](https://www.mozilla.org/) | 45 | **31** | 34 | 34 | 34 | 35 | 35 |
 | [Nielsen Norman Group](https://www.nngroup.com/) | 86 | 68 | **55** | 74 | 75 | 77 | 76 |
-| [SitePoint](https://www.sitepoint.com/) | 482 | **351** | 422 | 456 | 460 | 478 | n/a |
 | [Startup-Verband](https://startupverband.de/) | 42 | **29** | 30 | 30 | 30 | 31 | 30 |
+| [TetraLogical](https://tetralogical.com/) | 44 | 38 | **35** | 38 | 39 | 39 | 39 |
 | [TPGi](https://www.tpgi.com/) | 175 | **159** | 160 | 164 | 166 | 172 | 172 |
 | [United Nations](https://www.un.org/en/) | 152 | **112** | 121 | 125 | 125 | 130 | 123 |
 | [Vivaldi](https://vivaldi.com/) | 92 | **74** | n/a | 79 | 81 | 83 | 81 |
 | [W3C](https://www.w3.org/) | 50 | **36** | 39 | 38 | 38 | 41 | 39 |
-| **Average processing time** |  | 132 ms (29/29) | 169 ms (28/29) | 54 ms (29/29) | **14 ms (29/29)** | 293 ms (29/29) | 1355 ms (23/29) |
+| **Average processing time** |  | 120 ms (28/28) | 138 ms (27/28) | 41 ms (28/28) | **14 ms (28/28)** | 283 ms (28/28) | 1349 ms (24/28) |
 
 (Last updated: Dec 26, 2025)
 <!-- End auto-generated -->

package/dist/htmlminifier.cjs

@@ -624,37 +624,29 @@ class Sorter {
     for (let i = 0, len = this.keys.length; i < len; i++) {
       const token = this.keys[i];
 
-      // Build position map for this token to avoid repeated `indexOf`
-      const positions = [];
+      // Single pass: Count matches and collect non-matches
+      let matchCount = 0;
+      const others = [];
+
       for (let j = fromIndex; j < tokens.length; j++) {
         if (tokens[j] === token) {
-          positions.push(j);
+          matchCount++;
+        } else {
+          others.push(tokens[j]);
         }
       }
 
-      if (positions.length > 0) {
-        // Build new array with tokens in sorted order instead of splicing
-        const result = [];
-
-        // Add all instances of the current token first
-        for (let j = 0; j < positions.length; j++) {
-          result.push(token);
-        }
-
-        // Add other tokens, skipping positions where current token was
-        const posSet = new Set(positions);
-        for (let j = fromIndex; j < tokens.length; j++) {
-          if (!posSet.has(j)) {
-            result.push(tokens[j]);
-          }
+      if (matchCount > 0) {
+        // Rebuild: `matchCount` instances of token first, then others
+        let writeIdx = fromIndex;
+        for (let j = 0; j < matchCount; j++) {
+          tokens[writeIdx++] = token;
         }
-
-        // Copy sorted portion back to tokens array
-        for (let j = 0; j < result.length; j++) {
-          tokens[fromIndex + j] = result[j];
+        for (let j = 0; j < others.length; j++) {
+          tokens[writeIdx++] = others[j];
         }
 
-        const newFromIndex = fromIndex + positions.length;
+        const newFromIndex = fromIndex + matchCount;
         return this.sorterMap.get(token).sort(tokens, newFromIndex);
       }
     }
@@ -2210,7 +2202,15 @@ async function cleanAttributeValue(tag, attrName, attrValue, options, attrs, min
   // Apply early whitespace normalization if enabled
   // Preserves special spaces (non-breaking space, hair space, etc.) for consistency with `collapseWhitespace`
   if (options.collapseAttributeWhitespace) {
-    attrValue = attrValue.replace(/[ \n\r\t\f]+/g, ' ').replace(/^[ \n\r\t\f]+|[ \n\r\t\f]+$/g, '');
+    // Single-pass: Trim leading/trailing whitespace and collapse internal whitespace to single space
+    attrValue = attrValue.replace(/^[ \n\r\t\f]+|[ \n\r\t\f]+$|[ \n\r\t\f]+/g, function(match, offset, str) {
+      // Leading whitespace (`offset === 0`)
+      if (offset === 0) return '';
+      // Trailing whitespace (match ends at string end)
+      if (offset + match.length === str.length) return '';
+      // Internal whitespace
+      return ' ';
+    });
   }
 
   if (isEventAttribute(attrName, options)) {

package/dist/htmlminifier.esm.bundle.js

@@ -3236,37 +3236,29 @@ class Sorter {
     for (let i = 0, len = this.keys.length; i < len; i++) {
       const token = this.keys[i];
 
-      // Build position map for this token to avoid repeated `indexOf`
-      const positions = [];
+      // Single pass: Count matches and collect non-matches
+      let matchCount = 0;
+      const others = [];
+
       for (let j = fromIndex; j < tokens.length; j++) {
         if (tokens[j] === token) {
-          positions.push(j);
+          matchCount++;
+        } else {
+          others.push(tokens[j]);
         }
       }
 
-      if (positions.length > 0) {
-        // Build new array with tokens in sorted order instead of splicing
-        const result = [];
-
-        // Add all instances of the current token first
-        for (let j = 0; j < positions.length; j++) {
-          result.push(token);
-        }
-
-        // Add other tokens, skipping positions where current token was
-        const posSet = new Set(positions);
-        for (let j = fromIndex; j < tokens.length; j++) {
-          if (!posSet.has(j)) {
-            result.push(tokens[j]);
-          }
+      if (matchCount > 0) {
+        // Rebuild: `matchCount` instances of token first, then others
+        let writeIdx = fromIndex;
+        for (let j = 0; j < matchCount; j++) {
+          tokens[writeIdx++] = token;
         }
-
-        // Copy sorted portion back to tokens array
-        for (let j = 0; j < result.length; j++) {
-          tokens[fromIndex + j] = result[j];
+        for (let j = 0; j < others.length; j++) {
+          tokens[writeIdx++] = others[j];
         }
 
-        const newFromIndex = fromIndex + positions.length;
+        const newFromIndex = fromIndex + matchCount;
         return this.sorterMap.get(token).sort(tokens, newFromIndex);
       }
     }
@@ -7352,7 +7344,15 @@ async function cleanAttributeValue(tag, attrName, attrValue, options, attrs, min
   // Apply early whitespace normalization if enabled
   // Preserves special spaces (non-breaking space, hair space, etc.) for consistency with `collapseWhitespace`
   if (options.collapseAttributeWhitespace) {
-    attrValue = attrValue.replace(/[ \n\r\t\f]+/g, ' ').replace(/^[ \n\r\t\f]+|[ \n\r\t\f]+$/g, '');
+    // Single-pass: Trim leading/trailing whitespace and collapse internal whitespace to single space
+    attrValue = attrValue.replace(/^[ \n\r\t\f]+|[ \n\r\t\f]+$|[ \n\r\t\f]+/g, function(match, offset, str) {
+      // Leading whitespace (`offset === 0`)
+      if (offset === 0) return '';
+      // Trailing whitespace (match ends at string end)
+      if (offset + match.length === str.length) return '';
+      // Internal whitespace
+      return ' ';
+    });
   }
 
   if (isEventAttribute(attrName, options)) {

package/dist/types/lib/attributes.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"attributes.d.ts","sourceRoot":"","sources":["../../../src/lib/attributes.js"],"names":[],"mappings":"AAuBA,yDAEC;AAED,mEAOC;AAED,uEAWC;AAED,8DAGC;AAED,4EAOC;AAED,mGAqBC;AAED,mEAGC;AAED,qEAGC;AAED,kEAWC;AAED,sEAGC;AAED,4DAWC;AAED,2EAEC;AAED,qEAaC;AAED,wEAUC;AAED,sEAUC;AAED,2EAEC;AAED,2DAEC;AAED,8DAUC;AAED,uEAUC;AAED,oGASC;AAED,4DAOC;AAID,0IA0IC;AAsBD;;;;GAwCC;AAED,6GA4EC"}
+{"version":3,"file":"attributes.d.ts","sourceRoot":"","sources":["../../../src/lib/attributes.js"],"names":[],"mappings":"AAuBA,yDAEC;AAED,mEAOC;AAED,uEAWC;AAED,8DAGC;AAED,4EAOC;AAED,mGAqBC;AAED,mEAGC;AAED,qEAGC;AAED,kEAWC;AAED,sEAGC;AAED,4DAWC;AAED,2EAEC;AAED,qEAaC;AAED,wEAUC;AAED,sEAUC;AAED,2EAEC;AAED,2DAEC;AAED,8DAUC;AAED,uEAUC;AAED,oGASC;AAED,4DAOC;AAID,0IAkJC;AAsBD;;;;GAwCC;AAED,6GA4EC"}

package/dist/types/tokenchain.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"tokenchain.d.ts","sourceRoot":"","sources":["../../src/tokenchain.js"],"names":[],"mappings":";AA2CA;IAGI,mBAAoB;IAGtB,uBAOC;IAED,uBAiDC;CACF;AA5GD;IACE,2CAuCC;CACF"}
+{"version":3,"file":"tokenchain.d.ts","sourceRoot":"","sources":["../../src/tokenchain.js"],"names":[],"mappings":";AAmCA;IAGI,mBAAoB;IAGtB,uBAOC;IAED,uBAiDC;CACF;AApGD;IACE,2CA+BC;CACF"}

package/package.json

@@ -93,5 +93,5 @@
     "test:watch": "node --test --watch tests/*.spec.js"
   },
   "type": "module",
-  "version": "4.16.0"
+  "version": "4.16.1"
 }

package/src/lib/attributes.js

@@ -226,7 +226,15 @@ async function cleanAttributeValue(tag, attrName, attrValue, options, attrs, min
   // Apply early whitespace normalization if enabled
   // Preserves special spaces (non-breaking space, hair space, etc.) for consistency with `collapseWhitespace`
   if (options.collapseAttributeWhitespace) {
-    attrValue = attrValue.replace(/[ \n\r\t\f]+/g, ' ').replace(/^[ \n\r\t\f]+|[ \n\r\t\f]+$/g, '');
+    // Single-pass: Trim leading/trailing whitespace and collapse internal whitespace to single space
+    attrValue = attrValue.replace(/^[ \n\r\t\f]+|[ \n\r\t\f]+$|[ \n\r\t\f]+/g, function(match, offset, str) {
+      // Leading whitespace (`offset === 0`)
+      if (offset === 0) return '';
+      // Trailing whitespace (match ends at string end)
+      if (offset + match.length === str.length) return '';
+      // Internal whitespace
+      return ' ';
+    });
   }
 
   if (isEventAttribute(attrName, options)) {

package/src/tokenchain.js

@@ -3,37 +3,29 @@ class Sorter {
     for (let i = 0, len = this.keys.length; i < len; i++) {
       const token = this.keys[i];
 
-      // Build position map for this token to avoid repeated `indexOf`
-      const positions = [];
+      // Single pass: Count matches and collect non-matches
+      let matchCount = 0;
+      const others = [];
+
       for (let j = fromIndex; j < tokens.length; j++) {
         if (tokens[j] === token) {
-          positions.push(j);
+          matchCount++;
+        } else {
+          others.push(tokens[j]);
         }
       }
 
-      if (positions.length > 0) {
-        // Build new array with tokens in sorted order instead of splicing
-        const result = [];
-
-        // Add all instances of the current token first
-        for (let j = 0; j < positions.length; j++) {
-          result.push(token);
-        }
-
-        // Add other tokens, skipping positions where current token was
-        const posSet = new Set(positions);
-        for (let j = fromIndex; j < tokens.length; j++) {
-          if (!posSet.has(j)) {
-            result.push(tokens[j]);
-          }
+      if (matchCount > 0) {
+        // Rebuild: `matchCount` instances of token first, then others
+        let writeIdx = fromIndex;
+        for (let j = 0; j < matchCount; j++) {
+          tokens[writeIdx++] = token;
         }
-
-        // Copy sorted portion back to tokens array
-        for (let j = 0; j < result.length; j++) {
-          tokens[fromIndex + j] = result[j];
+        for (let j = 0; j < others.length; j++) {
+          tokens[writeIdx++] = others[j];
         }
 
-        const newFromIndex = fromIndex + positions.length;
+        const newFromIndex = fromIndex + matchCount;
         return this.sorterMap.get(token).sort(tokens, newFromIndex);
       }
     }