Remove redundant type conversions

Author: marco-nicola

cmd/huggingfaceimporter/internal/interactive.go

@@ -8,7 +8,6 @@ import (
 	"fmt"
 	"github.com/lithammer/fuzzysearch/fuzzy"
 	"github.com/manifoldco/promptui"
-	"github.com/manifoldco/promptui/list"
 	"os"
 	"path"
 )
@@ -85,9 +84,9 @@ func (a *ImporterArgs) ConfigureInteractive(repo string) error {
 			Items:             ids,
 			// Called on each items of the select and should return a
 			// boolean for whether or not the item fits the searched term.
-			Searcher: list.Searcher(func(input string, index int) bool {
+			Searcher: func(input string, index int) bool {
 				return fuzzy.Match(input, ids[index])
-			}),
+			},
 		}).Run()
 		if err != nil {
 			return err

pkg/mat32/internal/asm/f32/ge_noasm.go

@@ -31,7 +31,7 @@ func Ger(m, n uintptr, alpha float32, x []float32, incX uintptr, y []float32, in
 
 	ix := kx
 	for i := 0; i < int(m); i++ {
-		AxpyInc(alpha*x[ix], y, a[uintptr(i)*lda:uintptr(i)*lda+n], uintptr(n), uintptr(incY), 1, uintptr(ky), 0)
+		AxpyInc(alpha*x[ix], y, a[uintptr(i)*lda:uintptr(i)*lda+n], n, incY, 1, ky, 0)
 		ix += incX
 	}
 }

pkg/mat32/internal/math32/const.go

@@ -12,9 +12,9 @@ const (
 	SqrtPhi = float32(1.27201964951406896425242246173749149171560804184009624861664038) // http://oeis.org/A139339
 
 	Ln2    = float32(0.693147180559945309417232121458176568075500134360255254120680009) // http://oeis.org/A002162
-	Log2E  = float32(1 / Ln2)
+	Log2E  = 1 / Ln2
 	Ln10   = float32(2.30258509299404568401799145468436420760110148862877297603332790) // http://oeis.org/A002392
-	Log10E = float32(1 / Ln10)
+	Log10E = 1 / Ln10
 )
 
 // Floating-point limit values.

pkg/mat64/internal/asm/f64/benchAxpy_test.go

@@ -120,7 +120,7 @@ func BenchmarkAxpyInc(t *testing.B) {
 						idx = uintptr((-int(tt.len) + 1) * inc)
 					}
 					for i := 0; i < b.N; i++ {
-						test.f(a, x, y, uintptr(tt.len), tstInc, tstInc, idx, idx)
+						test.f(a, x, y, tt.len, tstInc, tstInc, idx, idx)
 					}
 				})
 			}
@@ -154,7 +154,7 @@ func BenchmarkAxpyIncTo(t *testing.B) {
 						idx = uintptr((-int(tt.len) + 1) * inc)
 					}
 					for i := 0; i < b.N; i++ {
-						test.f(z, tstInc, idx, a, x, y, uintptr(tt.len),
+						test.f(z, tstInc, idx, a, x, y, tt.len,
 							tstInc, tstInc, idx, idx)
 					}
 				})

pkg/mat64/internal/asm/f64/benchScal_test.go

@@ -63,7 +63,7 @@ func BenchmarkScalInc(t *testing.B) {
 				b.SetBytes(int64(64 * tt.len))
 				tstInc := uintptr(inc)
 				for i := 0; i < b.N; i++ {
-					ScalInc(a, x, uintptr(tt.len), tstInc)
+					ScalInc(a, x, tt.len, tstInc)
 				}
 			})
 		}
@@ -78,7 +78,7 @@ func BenchmarkScalIncTo(t *testing.B) {
 				b.SetBytes(int64(64 * tt.len))
 				tstInc := uintptr(inc)
 				for i := 0; i < b.N; i++ {
-					ScalIncTo(z, tstInc, a, x, uintptr(tt.len), tstInc)
+					ScalIncTo(z, tstInc, a, x, tt.len, tstInc)
 				}
 			})
 		}

pkg/ml/ag/graph.go

@@ -506,7 +506,7 @@ func (g *Graph) IncTimeStep() {
 // to perform truncated back propagation. This value is 0 for a new Graph, and
 // can be incremented calling IncTimeStep.
 func (g *Graph) TimeStep() int {
-	return int(g.curTimeStep)
+	return g.curTimeStep
 }
 
 // Nodes returns the nodes of the graph.

pkg/ml/optimizers/gd/decay/exponential/exponential.go

@@ -31,7 +31,7 @@ func New(init, final mat.Float, iter int) *Exponential {
 // Decay calculates the decay of the learning rate lr at time t.
 func (d *Exponential) Decay(lr mat.Float, t int) mat.Float {
 	if t > 1 && lr > d.final {
-		return mat.Exp((mat.Float(d.times-t)*mat.Log(lr) + mat.Log(mat.Float(d.final))) / mat.Float(d.times-t+1))
+		return mat.Exp((mat.Float(d.times-t)*mat.Log(lr) + mat.Log(d.final)) / mat.Float(d.times-t+1))
 	}
 	return lr
 }