refactor: use the built-in max/min to simplify the code (#4632)

studystill · envestcc · CoderZhi · web-flow · commit 5b193c07770d · 2025-05-29T08:47:16.000+08:00
Signed-off-by: studystill &lt;chenghuiyue@outlook.com&gt;
Co-authored-by: Chen Chen &lt;chen1233216@hotmail.com&gt;
Co-authored-by: CoderZhi &lt;thecoderzhi@gmail.com&gt;
diff --git a/actsync/actionsync.go b/actsync/actionsync.go
@@ -191,10 +191,7 @@ func (as *ActionSync) selectPeers() ([]peer.AddrInfo, error) {
 	if err != nil {
 		return nil, err
 	}
-	repeat := batchPeerSize
-	if repeat > len(neighbors) {
-		repeat = len(neighbors)
-	}
+	repeat := min(batchPeerSize, len(neighbors))
 	if repeat == 0 {
 		return nil, errors.New("no peers")
 	}

Original file line number	Diff line number	Diff line change
`@@ -191,10 +191,7 @@ func (as *ActionSync) selectPeers() ([]peer.AddrInfo, error) {`
`191`	`191`	`if err != nil {`
`192`	`192`	`return nil, err`
`193`	`193`	`}`
`194`		`- repeat := batchPeerSize`
`195`		`- if repeat > len(neighbors) {`
`196`		`- repeat = len(neighbors)`
`197`		`- }`
	`194`	`+ repeat := min(batchPeerSize, len(neighbors))`
`198`	`195`	`if repeat == 0 {`
`199`	`196`	`return nil, errors.New("no peers")`
`200`	`197`	`}`