pull · Jul 15, 2026 · Jul 12, 2026 · Jul 14, 2026 · Jul 14, 2026 · Jul 14, 2026
diff --git a/bindings/js/package-lock.json b/bindings/js/package-lock.json
diff --git a/bindings/js/package.json b/bindings/js/package.json
@@ -61,12 +61,12 @@
     "go"
   ],
   "devDependencies": {
-    "@types/node": "^26.1.0",
-    "tsdown": "^0.22.3",
-    "typescript": "^6.0.3",
-    "vitest": "^4.1.9"
+    "@types/node": "^26.1.1",
+    "tsdown": "^0.22.7",
+    "typescript": "^7.0.2",
+    "vitest": "^4.1.10"
   },
   "dependencies": {
-    "koffi": "^3.0.2"
+    "koffi": "^3.1.1"
   }
 }
diff --git a/common.go b/common.go
@@ -441,7 +441,7 @@ func Number(num []byte, prec int) []byte {
 					start += -d
 				}
 				num[newDot] = '.'
-				for i := 0; i < zeroes; i++ {
+				for i := range zeroes {
 					num[newDot+1+i] = '0'
 				}
 			}

diff --git a/common_test.go b/common_test.go
@@ -356,7 +356,7 @@ var numbers [][]byte
 
 func TestMain(t *testing.T) {
 	numbers = make([][]byte, 0, n)
-	for j := 0; j < n; j++ {
+	for range n {
 		numbers = append(numbers, RandNumBytes(true))
 	}
 }
@@ -389,7 +389,7 @@ func RandNumBytes(withExp bool) []byte {
 
 func BenchmarkNumber(b *testing.B) {
 	for i := 0; i < b.N; i++ {
-		for j := 0; j < n; j++ {
+		for j := range n {
 			Number(numbers[j], -1)
 		}
 	}

diff --git a/css/css.go b/css/css.go
@@ -599,7 +599,7 @@ func (c *cssMinifier) minifyTokens(prop Hash, fun Hash, values []Token) []Token
 
 				if a == 1.0 && (len(vals) == 3 || len(vals) == 4) { // only minify color if fully opaque
 					if fun == Rgb || fun == Rgba {
-						for j := 0; j < 3; j++ {
+						for j := range 3 {
 							if args[j*2].TokenType == css.NumberToken {
 								vals[j] /= 255.0
 								if vals[j] < minify.Epsilon {
@@ -628,14 +628,14 @@ func (c *cssMinifier) minifyTokens(prop Hash, fun Hash, values []Token) []Token
 				if 3 <= len(vals) && (fun == Rgb || fun == Rgba) {
 					// 0%, 20%, 40%, 60%, 80% and 100% can be represented exactly as, 51, 102, 153, 204, and 255 respectively
 					removePercentage := true
-					for j := 0; j < 3; j++ {
+					for j := range 3 {
 						if args[j*2].TokenType != css.PercentageToken || 2.0*minify.Epsilon <= math.Mod(vals[j]+minify.Epsilon, 0.2) {
 							removePercentage = false
 							break
 						}
 					}
 					if removePercentage {
-						for j := 0; j < 3; j++ {
+						for j := range 3 {
 							args[j*2].TokenType = css.NumberToken
 							if vals[j] < minify.Epsilon {
 								args[j*2].Data = zeroBytes
@@ -735,7 +735,7 @@ func (c *cssMinifier) minifyProperty(prop Hash, values []Token) []Token {
 				parse.ToLower(value.Data)
 				s := value.Data[1 : len(value.Data)-1]
 				if 0 < len(s) {
-					for _, split := range bytes.Split(s, spaceBytes) {
+					for split := range bytes.SplitSeq(s, spaceBytes) {
 						// if len is zero, it contains two consecutive spaces
 						if len(split) == 0 || !css.IsIdent(split) {
 							unquote = false
@@ -1337,7 +1337,7 @@ func (c *cssMinifier) minifyProperty(prop Hash, values []Token) []Token {
 				values = append(values, Token{css.CommaToken, commaBytes, nil, 0, None})
 			}
 			if ran[0] == ran[1] {
-				urange := []byte(fmt.Sprintf("U+%X", ran[0]))
+				urange := fmt.Appendf(nil, "U+%X", ran[0])
 				values = append(values, Token{css.UnicodeRangeToken, urange, nil, 0, None})
 			} else if ran[0] == 0 && ran[1] == 0x10FFFF {
 				values = append(values, Token{css.IdentToken, initialBytes, nil, 0, None})
@@ -1357,12 +1357,12 @@ func (c *cssMinifier) minifyProperty(prop Hash, values []Token) []Token {
 				var urange []byte
 				if wildcards != 0 {
 					if ran[0]>>(wildcards*4) == 0 {
-						urange = []byte(fmt.Sprintf("U+%s", strings.Repeat("?", wildcards)))
+						urange = fmt.Appendf(nil, "U+%s", strings.Repeat("?", wildcards))
 					} else {
-						urange = []byte(fmt.Sprintf("U+%X%s", ran[0]>>(wildcards*4), strings.Repeat("?", wildcards)))
+						urange = fmt.Appendf(nil, "U+%X%s", ran[0]>>(wildcards*4), strings.Repeat("?", wildcards))
 					}
 				} else {
-					urange = []byte(fmt.Sprintf("U+%X-%X", ran[0], ran[1]))
+					urange = fmt.Appendf(nil, "U+%X-%X", ran[0], ran[1])
 				}
 				values = append(values, Token{css.UnicodeRangeToken, urange, nil, 0, None})
 			}

diff --git a/css/hash.go b/css/hash.go
@@ -877,13 +877,13 @@ func ToHash(s []byte) Hash {
 	//	return HashMap[string(s)]
 	//}
 	h := uint32(_Hash_hash0)
-	for i := 0; i < len(s); i++ {
+	for i := range s {
 		h ^= uint32(s[i])
 		h *= 16777619
 	}
 	if i := _Hash_table[h&uint32(len(_Hash_table)-1)]; int(i&0xff) == len(s) {
 		t := _Hash_text[i>>8 : i>>8+i&0xff]
-		for i := 0; i < len(s); i++ {
+		for i := range s {
 			if t[i] != s[i] {
 				goto NEXT
 			}
@@ -893,7 +893,7 @@ func ToHash(s []byte) Hash {
 NEXT:
 	if i := _Hash_table[(h>>16)&uint32(len(_Hash_table)-1)]; int(i&0xff) == len(s) {
 		t := _Hash_text[i>>8 : i>>8+i&0xff]
-		for i := 0; i < len(s); i++ {
+		for i := range s {
 			if t[i] != s[i] {
 				return 0
 			}

diff --git a/go.mod b/go.mod
@@ -13,6 +13,6 @@ require (
 require (
 	github.com/jmoiron/sqlx v1.4.0 // indirect
 	github.com/pelletier/go-toml v1.9.5 // indirect
-	golang.org/x/sys v0.43.0 // indirect
+	golang.org/x/sys v0.47.0 // indirect
 	gopkg.in/yaml.v3 v3.0.1 // indirect
 )
diff --git a/go.sum b/go.sum
@@ -23,6 +23,8 @@ github.com/tdewolff/test v1.0.12 h1:7F21DqIajswxuche0geHdrUZRCWE4oko4b7bcmkkrxk=
 github.com/tdewolff/test v1.0.12/go.mod h1:XPuWBzvdUzhCuxWO1ojpXsyzsA5bFoS3tO/Q3kFuTG8=
 golang.org/x/sys v0.43.0 h1:Rlag2XtaFTxp19wS8MXlJwTvoh8ArU6ezoyFsMyCTNI=
 golang.org/x/sys v0.43.0/go.mod h1:4GL1E5IUh+htKOUEOaiffhrAeqysfVGipDYzABqnCmw=
+golang.org/x/sys v0.47.0 h1:o7XGOvZQCADBQQ4Y7VNq2dRWQR7JmOUW8Kxx4ZsNgWs=
+golang.org/x/sys v0.47.0/go.mod h1:4GL1E5IUh+htKOUEOaiffhrAeqysfVGipDYzABqnCmw=
 gopkg.in/check.v1 v0.0.0-20161208181325-20d25e280405 h1:yhCVgyC4o1eVCa2tZl7eS0r+SDo693bJlVdllGtEeKM=
 gopkg.in/check.v1 v0.0.0-20161208181325-20d25e280405/go.mod h1:Co6ibVJAznAaIkqp8huTwlJQCZ016jof/cbN4VW5Yz0=
 gopkg.in/yaml.v3 v3.0.1 h1:fxVm/GzAzEWqLHuvctI91KS9hhNmmWOoWu0XTYJS7CA=

diff --git a/html/hash.go b/html/hash.go
@@ -567,13 +567,13 @@ func ToHash(s []byte) Hash {
 	//	return HashMap[string(s)]
 	//}
 	h := uint32(_Hash_hash0)
-	for i := 0; i < len(s); i++ {
+	for i := range s {
 		h ^= uint32(s[i])
 		h *= 16777619
 	}
 	if i := _Hash_table[h&uint32(len(_Hash_table)-1)]; int(i&0xff) == len(s) {
 		t := _Hash_text[i>>8 : i>>8+i&0xff]
-		for i := 0; i < len(s); i++ {
+		for i := range s {
 			if t[i] != s[i] {
 				goto NEXT
 			}
@@ -583,7 +583,7 @@ func ToHash(s []byte) Hash {
 NEXT:
 	if i := _Hash_table[(h>>16)&uint32(len(_Hash_table)-1)]; int(i&0xff) == len(s) {
 		t := _Hash_text[i>>8 : i>>8+i&0xff]
-		for i := 0; i < len(s); i++ {
+		for i := range s {
 			if t[i] != s[i] {
 				return 0
 			}

diff --git a/js/js_test.go b/js/js_test.go
@@ -1014,7 +1014,7 @@ func TestRenamerIndices(t *testing.T) {
 		j := renamer.getIndex(name)
 		test.T(t, j, i, string(name))
 	}
-	for i := 0; i < 100000; i++ {
+	for i := range 100000 {
 		name := renamer.getName([]byte{' '}, i)
 		j := renamer.getIndex(name)
 		test.T(t, j, i, string(name))
@@ -1027,7 +1027,7 @@ func BenchmarkJQuery(b *testing.B) {
 	if err != nil {
 		panic(err)
 	}
-	for j := 0; j < 10; j++ {
+	for j := range 10 {
 		b.Run(fmt.Sprintf("%d", j), func(b *testing.B) {
 			b.SetBytes(int64(len(buf)))
 			for i := 0; i < b.N; i++ {

diff --git a/js/util.go b/js/util.go
@@ -3,6 +3,7 @@ package js
 import (
 	"bytes"
 	"encoding/hex"
+	"slices"
 	stdStrconv "strconv"
 	"unicode/utf8"
 
@@ -366,10 +367,8 @@ func hasSideEffects(i js.IExpr) bool {
 	case *js.CondExpr:
 		return hasSideEffects(expr.Cond) || hasSideEffects(expr.X) || hasSideEffects(expr.Y)
 	case *js.CommaExpr:
-		for _, item := range expr.List {
-			if hasSideEffects(item) {
-				return true
-			}
+		if slices.ContainsFunc(expr.List, hasSideEffects) {
+			return true
 		}
 	case *js.ArrayExpr:
 		for _, item := range expr.List {

diff --git a/js/vars.go b/js/vars.go
@@ -604,11 +604,8 @@ func (m *jsMinifier) optimizeVarOrder(decl *js.VarDecl) {
 					if item.Default != nil {
 						refs = appendExprVars(refs[:0], item.Default)
 						for _, ref := range refs {
-							for _, binding := range bindings {
-								if binding == ref {
-									interferes = true
-									break
-								}
+							if slices.Contains(bindings, ref) {
+								interferes = true
 							}
 						}
 					}

diff --git a/minify.go b/minify.go
@@ -302,14 +302,12 @@ func (z *writer) Close() error {
 func (m *M) Writer(mediatype string, w io.Writer) io.WriteCloser {
 	pr, pw := io.Pipe()
 	z := &writer{pw, sync.WaitGroup{}, false, nil}
-	z.wg.Add(1)
-	go func() {
-		defer z.wg.Done()
+	z.wg.Go(func() {
 		defer pr.Close()
 		if err := m.Minify(mediatype, w, pr); err != nil {
 			z.err = err
 		}
-	}()
+	})
 	return z
 }
 
@@ -341,14 +339,12 @@ func (w *responseWriter) Write(b []byte) (int, error) {
 		if _, params, minifier := w.m.Match(w.mediatype); minifier != nil {
 			pr, pw := io.Pipe()
 			z := &writer{pw, sync.WaitGroup{}, false, nil}
-			z.wg.Add(1)
-			go func() {
-				defer z.wg.Done()
+			z.wg.Go(func() {
 				defer pr.Close()
 				if err := minifier(w.m, w.ResponseWriter, pr, params); err != nil {
 					z.err = err
 				}
-			}()
+			})
 			w.z = z
 		} else {
 			w.z = w.ResponseWriter

diff --git a/svg/buffer_test.go b/svg/buffer_test.go
@@ -43,9 +43,9 @@ func TestAttributes(t *testing.T) {
 	l := xml.NewLexer(r)
 	tb := NewTokenBuffer(r, l)
 	tb.Shift()
-	for k := 0; k < 2; k++ { // run twice to ensure similar results
+	for range 2 { // run twice to ensure similar results
 		attrs := tb.Attributes(X, Y, Width, Height, Rx, Ry)
-		for i := 0; i < 6; i++ {
+		for i := range 6 {
 			test.That(t, attrs[i] != nil, "attr must not be nil")
 			val := string(attrs[i].AttrVal)
 			j, _ := strconv.ParseInt(val, 10, 32)

diff --git a/svg/hash.go b/svg/hash.go
@@ -261,13 +261,13 @@ func ToHash(s []byte) Hash {
 	//	return HashMap[string(s)]
 	//}
 	h := uint32(_Hash_hash0)
-	for i := 0; i < len(s); i++ {
+	for i := range s {
 		h ^= uint32(s[i])
 		h *= 16777619
 	}
 	if i := _Hash_table[h&uint32(len(_Hash_table)-1)]; int(i&0xff) == len(s) {
 		t := _Hash_text[i>>8 : i>>8+i&0xff]
-		for i := 0; i < len(s); i++ {
+		for i := range s {
 			if t[i] != s[i] {
 				goto NEXT
 			}
@@ -277,7 +277,7 @@ func ToHash(s []byte) Hash {
 NEXT:
 	if i := _Hash_table[(h>>16)&uint32(len(_Hash_table)-1)]; int(i&0xff) == len(s) {
 		t := _Hash_text[i>>8 : i>>8+i&0xff]
-		for i := 0; i < len(s); i++ {
+		for i := range s {
 			if t[i] != s[i] {
 				return 0
 			}

diff --git a/svg/svg.go b/svg/svg.go
@@ -221,7 +221,7 @@ func (o *Minifier) Minify(m *minify.M, w io.Writer, r io.Reader, params map[stri
 			} else if attr == ViewBox {
 				j := 0
 				newVal := val[:0]
-				for i := 0; i < 4; i++ {
+				for i := range 4 {
 					if i != 0 {
 						if j >= len(val) || val[j] != ' ' && val[j] != ',' {
 							newVal = append(newVal, val[j:]...)