refactor: use the built-in max/min to simplify the code [skip changelog]

bitswap/benchmarks_test.go

@@ -598,10 +598,7 @@ func unixfsFileFetchLarge(b *testing.B, bs *bitswap.Bitswap, ks []cid.Cid) {
 	for len(rest) > 0 {
 		var batch [][]cid.Cid
 		for i := 0; i < 5 && len(rest) > 0; i++ {
-			cnt := 10
-			if len(rest) < 10 {
-				cnt = len(rest)
-			}
+			cnt := min(len(rest), 10)
 			group := rest[:cnt]
 			rest = rest[cnt:]
 			batch = append(batch, group)

gateway/backend_blocks.go

@@ -503,10 +503,7 @@
 				if err != nil {
 					return err
 				}
-				from = fileLength + entityRange.From
-				if from < 0 {
-					from = 0
-				}
+				from = max(fileLength+entityRange.From, 0)
 				foundFileLength = true
 			}
 

ipld/merkledag/coding.go

@@ -81,10 +81,8 @@ func (n *ProtoNode) marshalImmutable() (*immutableProtoNode, error) {
 					qp.ListEntry(la, qp.Map(3, func(ma ipld.MapAssembler) {
 						qp.MapEntry(ma, "Hash", qp.Link(cidlink.Link{Cid: link.Cid}))
 						qp.MapEntry(ma, "Name", qp.String(link.Name))
-						sz := int64(link.Size)
-						if sz < 0 { // overflow, >MaxInt64 is almost certainly an error
-							sz = 0
-						}
+						// overflow, >MaxInt64 is almost certainly an error
+						sz := max(int64(link.Size), 0)
 						qp.MapEntry(ma, "Tsize", qp.Int(sz))
 					}))
 				}