compare-deposits: Replace sort.Search with slices.BinarySearchFunc

Signed-off-by: Evgenii Baidakov <evgenii@nspcc.io>

scripts/compare-deposits/compare-deposits.go

@@ -1,13 +1,13 @@
 package main
 
 import (
+	"cmp"
 	"context"
 	"errors"
 	"fmt"
 	"math/big"
 	"os"
 	"slices"
-	"sort"
 	"time"
 
 	"github.com/nspcc-dev/neo-go/pkg/encoding/address"
@@ -154,11 +154,17 @@ func cliMain(c *cli.Context) error {
 				maxBlock = h
 			}
 		}
-		n := sort.Search(int(maxBlock-minBlock), func(i int) bool {
+		size := int64(maxBlock - minBlock)
+		blocks := make([]int64, size)
+		for i := int64(0); i < size; i++ {
+			blocks[i] = i
+		}
+
+		n, _ := slices.BinarySearchFunc(blocks, nextSupply, func(i int64, i2 int64) int {
 			var h = minBlock + uint32(i)
 			s := getSupply(cFS, balanceHash, h)
 			knownBlocks[h] = s
-			return s > nextSupply
+			return cmp.Compare(s, i2)
 		})
 		for _, s := range knownBlocks {
 			if s > nextSupply && (s < tmpSupply || tmpSupply == 0) {