fmt: remove redundant parenthesis in the complex infix expr (vlang#17873)

Author: yuyi98

cmd/tools/vdoc/html.v

@@ -169,7 +169,7 @@ fn (vd VDoc) write_content(cn &doc.DocNode, d &doc.Doc, mut hw strings.Builder)
 		os.file_name(cn.file_path)
 	}
 	src_link := get_src_link(vd.manifest.repo_url, file_path_name, cn.pos.line_nr + 1)
-	if cn.content.len != 0 || (cn.name == 'Constants') {
+	if cn.content.len != 0 || cn.name == 'Constants' {
 		hw.write_string(doc_node_html(cn, src_link, false, cfg.include_examples, d.table))
 	}
 	for child in cn.children {

cmd/tools/vtest-parser.v

@@ -260,7 +260,7 @@ fn (mut context Context) print_status() {
 	if context.is_silent {
 		return
 	}
-	if (context.cut_index == 1) && (context.max_index == 0) {
+	if context.cut_index == 1 && context.max_index == 0 {
 		return
 	}
 	msg := '>   ${context.path:-30} | index: ${context.cut_index:5}/${context.max_index - 1:5}'

examples/game_of_life/life.v

@@ -37,7 +37,7 @@ fn (mut g Game) evolve() {
 		temp_grid << []string{}
 		for y in 0 .. g.grid[x].len {
 			count := g.get_surrounding_alive_count(x, y)
-			if count == 3 || ((g.grid[x][y] == cell) && count == 2) {
+			if count == 3 || (g.grid[x][y] == cell && count == 2) {
 				temp_grid[x] << cell
 			} else {
 				temp_grid[x] << nothing

examples/graphs/bellman-ford.v

@@ -74,7 +74,7 @@ fn bellman_ford[T](graph [][]T, src int) {
 			mut u := edges[j].src
 			mut v := edges[j].dest
 			mut weight := edges[j].weight
-			if (dist[u] != large) && (dist[u] + weight < dist[v]) {
+			if dist[u] != large && dist[u] + weight < dist[v] {
 				dist[v] = dist[u] + weight
 			}
 		}
@@ -88,7 +88,7 @@ fn bellman_ford[T](graph [][]T, src int) {
 		mut u := edges[j].src
 		mut v := edges[j].dest
 		mut weight := edges[j].weight
-		if (dist[u] != large) && (dist[u] + weight < dist[v]) {
+		if dist[u] != large && dist[u] + weight < dist[v] {
 			print('\n Graph contains negative weight cycle')
 			// If negative cycle is detected, simply
 			// return or an exit(1)

examples/graphs/bfs2.v

@@ -77,7 +77,7 @@ fn build_path_reverse(graph map[string][]string, start string, final string, vis
 
 	for (current != start) {
 		for i in array_of_nodes {
-			if (current in graph[i]) && (visited[i] == true) {
+			if current in graph[i] && visited[i] == true {
 				current = i
 				break // the first ocurrence is enough
 			}

examples/graphs/dfs.v

@@ -91,7 +91,7 @@ fn build_path_reverse(graph map[string][]string, start string, final string, vis
 
 	for current != start {
 		for i in array_of_nodes {
-			if (current in graph[i]) && (visited[i] == true) {
+			if current in graph[i] && visited[i] == true {
 				current = i
 				break // the first ocurrence is enough
 			}

examples/graphs/dijkstra.v

@@ -41,7 +41,7 @@ fn push_pq[T](mut prior_queue []T, data int, priority int) {
 	lenght_pq := prior_queue.len
 
 	mut i := 0
-	for (i < lenght_pq) && (priority > prior_queue[i].priority) {
+	for i < lenght_pq && priority > prior_queue[i].priority {
 		temp << prior_queue[i]
 		i++
 	}

examples/graphs/minimal_spann_tree_prim.v

@@ -35,7 +35,7 @@ fn push_pq[T](mut prior_queue []T, data int, priority int) {
 	lenght_pq := prior_queue.len
 
 	mut i := 0
-	for (i < lenght_pq) && (priority > prior_queue[i].priority) {
+	for i < lenght_pq && priority > prior_queue[i].priority {
 		temp << prior_queue[i]
 		i++
 	}

vlib/builtin/js/string_test.js.v

@@ -831,7 +831,7 @@ fn test_split_into_lines() {
 
 	assert lines_mixed_trailers.len == 9
 	for line in lines_mixed_trailers {
-		assert (line == line_content) || (line == '')
+		assert line == line_content || line == ''
 	}
 }
 

vlib/builtin/string.v

@@ -1019,7 +1019,7 @@ pub fn (s string) split_into_lines() []string {
 				line_start = i + 1
 			} else if s[i] == cr {
 				res << if line_start == i { '' } else { s[line_start..i] }
-				if ((i + 1) < s.len) && (s[i + 1] == lf) {
+				if (i + 1) < s.len && s[i + 1] == lf {
 					line_start = i + 2
 				} else {
 					line_start = i + 1
@@ -1796,7 +1796,7 @@ fn (s string) at_with_check(idx int) ?u8 {
 pub fn (c u8) is_space() bool {
 	// 0x85 is NEXT LINE (NEL)
 	// 0xa0 is NO-BREAK SPACE
-	return c == 32 || (c > 8 && c < 14) || (c == 0x85) || (c == 0xa0)
+	return c == 32 || (c > 8 && c < 14) || c == 0x85 || c == 0xa0
 }
 
 // is_digit returns `true` if the byte is in range 0-9 and `false` otherwise.