fix(BRIDGE-515): replace old go syntax using go:fix to match new go 1.26 syntax

Author: annatar

async/panic_handler.go

@@ -1,12 +1,12 @@
 package async
 
 type PanicHandler interface {
-	HandlePanic(interface{})
+	HandlePanic(any)
 }
 
 type NoopPanicHandler struct{}
 
-func (n NoopPanicHandler) HandlePanic(r interface{}) {}
+func (n NoopPanicHandler) HandlePanic(r any) {}
 
 func HandlePanic(panicHandler PanicHandler) {
 	if panicHandler == nil {

async/panic_handler_test.go

@@ -9,7 +9,7 @@ import (
 
 type recoverHandler struct{}
 
-func (h recoverHandler) HandlePanic(r interface{}) {
+func (h recoverHandler) HandlePanic(r any) {
 	fmt.Println("recoverHandler", r)
 }
 

benchmarks/gluon_bench/benchmark/run.go

@@ -78,7 +78,7 @@ func RunMain() {
 
 		benchmarkStats := make([]*reporter.BenchmarkStatistics, 0, numRuns)
 
-		for r := uint(0); r < numRuns; r++ {
+		for r := range numRuns {
 			if *flags.Verbose {
 				fmt.Printf("Benchmark Run: %v\n", r)
 			}

benchmarks/gluon_bench/imap_benchmarks/build_mailbox.go

@@ -35,7 +35,7 @@ func BuildMailbox(cl *client.Client, mailbox string, messageCount int) error {
 func BuildMailboxWithMessages(cl *client.Client, mailbox string, messageCount int, messages []string) error {
 	messagesLen := len(messages)
 
-	for i := 0; i < messageCount; i++ {
+	for i := range messageCount {
 		literal := fmt.Sprintf("To: %v@a.com\r\nFrom: %v@a.com\r\n", uuid.NewString(), uuid.NewString()) + messages[i%messagesLen]
 		if err := AppendToMailbox(cl, mailbox, literal, time.Now()); err != nil {
 			return err

benchmarks/gluon_bench/imap_benchmarks/client.go

@@ -34,9 +34,9 @@ func FetchMessage(cl *client.Client, sequenceSet *imap.SeqSet, items ...imap.Fet
 	return cl.Fetch(sequenceSet, items, ch)
 }
 
-func flagsToInterface(flags ...string) []interface{} {
-	return xslices.Map(flags, func(f string) interface{} {
-		return interface{}(f)
+func flagsToInterface(flags ...string) []any {
+	return xslices.Map(flags, func(f string) any {
+		return any(f)
 	})
 }
 

benchmarks/gluon_bench/imap_benchmarks/parallel_seqset.go

@@ -26,7 +26,7 @@ func NewParallelSeqSetFromFile(path string, numWorkers uint) (*ParallelSeqSet, e
 	}
 
 	seqSets := make([][]*imap.SeqSet, numWorkers)
-	for i := uint(0); i < numWorkers; i++ {
+	for i := range numWorkers {
 		seqSets[i] = list
 	}
 
@@ -43,11 +43,11 @@ func NewParallelSeqSetExpunge(count uint32, numWorkers uint, generateIntervals,
 	workerSplit := count / uint32(numWorkers)
 	available := make([]uint32, count)
 
-	for r := uint32(0); r < count; r++ {
+	for r := range count {
 		available[r] = r + 1
 	}
 
-	for i := uint(0); i < numWorkers; i++ {
+	for i := range numWorkers {
 		available := available[(uint32(i) * workerSplit):(uint32(i+1) * workerSplit)]
 		list := make([]*imap.SeqSet, 0, workerSplit)
 
@@ -80,7 +80,7 @@ func NewParallelSeqSetExpunge(count uint32, numWorkers uint, generateIntervals,
 			}
 		} else {
 			count := uint32(len(available))
-			for r := uint32(0); r < count; r++ {
+			for r := range count {
 				index := rand.Uint32() % (count - r)
 				seqSet := &imap.SeqSet{}
 				if uid {
@@ -106,12 +106,12 @@ func NewParallelSeqSetExpunge(count uint32, numWorkers uint, generateIntervals,
 func NewParallelSeqSetRandom(count uint32, numWorkers uint, generateIntervals, randomDrain, uid bool) *ParallelSeqSet {
 	lists := make([][]*imap.SeqSet, numWorkers)
 
-	for i := uint(0); i < numWorkers; i++ {
+	for i := range numWorkers {
 		list := make([]*imap.SeqSet, 0, count)
 
 		if randomDrain {
 			available := make([]uint32, count)
-			for r := uint32(0); r < count; r++ {
+			for r := range count {
 				available[r] = r + 1
 			}
 
@@ -134,11 +134,7 @@ func NewParallelSeqSetRandom(count uint32, numWorkers uint, generateIntervals, r
 					if uid {
 						seqSet.AddRange(available[index], available[index+intervalRange-1])
 					} else {
-						endSeq := index + intervalRange + 1
-
-						if endSeq > itemsLeft {
-							endSeq = itemsLeft
-						}
+						endSeq := min(index+intervalRange+1, itemsLeft)
 
 						seqSet.AddRange(index+1, endSeq)
 					}
@@ -153,7 +149,7 @@ func NewParallelSeqSetRandom(count uint32, numWorkers uint, generateIntervals, r
 					available = append(available[:cutIndex], available[index+intervalRange:]...)
 				}
 			} else {
-				for r := uint32(0); r < count; r++ {
+				for r := range count {
 					index := rand.Uint32() % (count - r)
 					seqSet := &imap.SeqSet{}
 					if uid {
@@ -167,7 +163,7 @@ func NewParallelSeqSetRandom(count uint32, numWorkers uint, generateIntervals, r
 				}
 			}
 		} else {
-			for r := uint32(0); r < count; r++ {
+			for range count {
 				var seqSet *imap.SeqSet
 				if !generateIntervals {
 					seqSet = RandomSequenceSetNum(count)
@@ -188,7 +184,7 @@ func NewParallelSeqSetRandom(count uint32, numWorkers uint, generateIntervals, r
 // NewParallelSeqSetAll generates once sequence set for each worker which covers everything (1:*).
 func NewParallelSeqSetAll(numWorkers uint) *ParallelSeqSet {
 	lists := make([][]*imap.SeqSet, numWorkers)
-	for i := uint(0); i < numWorkers; i++ {
+	for i := range numWorkers {
 		lists[i] = []*imap.SeqSet{NewSequenceSetAll()}
 	}
 

benchmarks/gluon_bench/imap_benchmarks/search.go

@@ -120,8 +120,8 @@ func (s *SearchTextQuery) Run(ctx context.Context, cl *client.Client, workerInde
 
 		fieldsStr := []string{"TEXT", s.queries[keywordIndex]}
 
-		fields := xslices.Map(fieldsStr, func(v string) interface{} {
-			return interface{}(v)
+		fields := xslices.Map(fieldsStr, func(v string) any {
+			return any(v)
 		})
 
 		if err := criteria.ParseWithCharset(fields, nil); err != nil {
@@ -162,7 +162,7 @@ func (s *SearchSinceQuery) Setup(ctx context.Context, cl *client.Client, searchC
 	} else {
 		s.dates = make([]string, 0, searchCount)
 
-		for i := uint32(0); i < searchCount; i++ {
+		for range searchCount {
 			t := time.Date(1980+rand.Intn(40), time.Month(rand.Intn(12)), rand.Intn(28), 0, 0, 0, 0, time.UTC)
 			s.dates = append(s.dates, t.Format("02-Jan-2006"))
 		}
@@ -181,8 +181,8 @@ func (s *SearchSinceQuery) Run(ctx context.Context, cl *client.Client, workerInd
 
 		fieldsStr := []string{"SINCE", d}
 
-		fields := xslices.Map(fieldsStr, func(v string) interface{} {
-			return interface{}(v)
+		fields := xslices.Map(fieldsStr, func(v string) any {
+			return any(v)
 		})
 
 		if err := criteria.ParseWithCharset(fields, nil); err != nil {
@@ -215,8 +215,8 @@ func (s *SearchCmdQuery) Setup(ctx context.Context, cl *client.Client, searchCou
 
 	queries := strings.Split(*searchCmdQueryFlag, " ")
 
-	fields := xslices.Map(queries, func(v string) interface{} {
-		return interface{}(v)
+	fields := xslices.Map(queries, func(v string) any {
+		return any(v)
 	})
 
 	if err := s.criteria.ParseWithCharset(fields, nil); err != nil {

benchmarks/gluon_bench/reporter/reporter.go

@@ -3,7 +3,7 @@ package reporter
 import (
 	"fmt"
 	"math"
-	"sort"
+	"slices"
 	"strings"
 	"time"
 
@@ -39,9 +39,7 @@ func (b *BenchmarkStatistics) String() string {
 
 func NewBenchmarkStatistics(extra BenchmarkExtra, durations ...time.Duration) *BenchmarkStatistics {
 	sortedDurations := durations
-	sort.Slice(sortedDurations, func(i1, i2 int) bool {
-		return sortedDurations[i1] < sortedDurations[i2]
-	})
+	slices.Sort(sortedDurations)
 
 	statistics := &BenchmarkStatistics{
 		Extra: extra,

benchmarks/gluon_bench/store_benchmarks/get.go

@@ -39,7 +39,7 @@ func (g *Get) Run(ctx context.Context, st store.Store) (*reporter.BenchmarkRun,
 	uuidLen := len(g.uuids)
 
 	return RunStoreWorkers(ctx, st, func(ctx context.Context, s store.Store, dc *timing.Collector, u uint) error {
-		for i := 0; i < uuidLen; i++ {
+		for range uuidLen {
 			index := rand.Intn(uuidLen)
 
 			dc.Start()

benchmarks/gluon_bench/store_benchmarks/utils.go

@@ -17,7 +17,7 @@ func CreateRandomState(st store.Store, count uint) ([]imap.InternalMessageID, er
 	uuids := make([]imap.InternalMessageID, 0, count)
 	data := make([]byte, *flags.StoreItemSize)
 
-	for i := uint(0); i < count; i++ {
+	for range count {
 		uuid := imap.NewInternalMessageID()
 
 		if err := st.Set(uuid, bytes.NewReader(data)); err != nil {
@@ -65,10 +65,7 @@ func RunStoreWorkersSplitRange(ctx context.Context, st store.Store, length uint,
 	workDivision := length / *flags.StoreWorkers
 
 	return RunStoreWorkers(ctx, st, func(ctx context.Context, s store.Store, collector *timing.Collector, u uint) error {
-		end := workDivision * (u + 1)
-		if end > length {
-			end = length
-		}
+		end := min(workDivision*(u+1), length)
 
 		return fn(ctx, st, collector, u*workDivision, end)
 	})