Refactor cleanPath switch cases

path.go

@@ -48,20 +48,26 @@ func cleanPath(p string) string {
 	// loop has no expensive function calls (except 1x make)
 
 	for r < n {
-		switch {
+		switch p[r] {
-		case p[r] == '/':
+		case '/':
 			// empty path element, trailing slash is added after the end
 			r++
 
-		case p[r] == '.' && r+1 == n:
+		case '.':
+			// . element
+			if r+1 == n {
 				trailing = true
 				r++
+				continue
 
-		case p[r] == '.' && p[r+1] == '/':
+			} else {
-			// . element
+				switch p[r+1] {
+				case '/':
 					r += 2
+					continue
 
-		case p[r] == '.' && p[r+1] == '.' && (r+2 == n || p[r+2] == '/'):
+				case '.':
+					if r+2 == n || p[r+2] == '/' {
 						// .. element: remove to last /
 						r += 3
 
@@ -79,6 +85,10 @@ func cleanPath(p string) string {
 								}
 							}
 						}
+						continue
+					}
+				}
+			}
 
 		default:
 			// real path element.