From 01b45be8d112267ee2b94c86e2c57f02d1c4219e Mon Sep 17 00:00:00 2001 From: criciss Date: Sun, 3 May 2026 00:12:04 +0800 Subject: [PATCH] refactor: use the built-in max/min to simplify the code Signed-off-by: criciss --- middleware/body_dump.go | 5 +---- router.go | 10 ++-------- 2 files changed, 3 insertions(+), 12 deletions(-) diff --git a/middleware/body_dump.go b/middleware/body_dump.go index d5c823c9b..0443a67ab 100644 --- a/middleware/body_dump.go +++ b/middleware/body_dump.go @@ -189,10 +189,7 @@ func (w *limitedWriter) Write(b []byte) (n int, err error) { // Write to dump buffer only up to limit if w.dumped < w.limit { remaining := w.limit - w.dumped - toDump := int64(n) - if toDump > remaining { - toDump = remaining - } + toDump := min(int64(n), remaining) w.dumpBuf.Write(b[:toDump]) w.dumped += toDump } diff --git a/router.go b/router.go index 48341cb1b..68802e062 100644 --- a/router.go +++ b/router.go @@ -558,10 +558,7 @@ func (r *DefaultRouter) insert(t kind, path string, method string, ri routeMetho lcpLen := 0 // LCP - Longest Common Prefix (https://en.wikipedia.org/wiki/LCP_array) - maxL := prefixLen - if searchLen < maxL { - maxL = searchLen - } + maxL := min(searchLen, prefixLen) for ; lcpLen < maxL && search[lcpLen] == currentNode.prefix[lcpLen]; lcpLen++ { } @@ -867,10 +864,7 @@ func (r *DefaultRouter) Route(c *Context) HandlerFunc { prefixLen = len(currentNode.prefix) // LCP - Longest Common Prefix (https://en.wikipedia.org/wiki/LCP_array) - lMax := prefixLen - if searchLen < lMax { - lMax = searchLen - } + lMax := min(searchLen, prefixLen) for ; lcpLen < lMax && search[lcpLen] == currentNode.prefix[lcpLen]; lcpLen++ { } }