test(lint): Fix int overflow warnings [skip ci]

gabe565 · Oct 27, 2024 · fc72f11 · fc72f11
1 parent e9f4260
commit fc72f11
Show file tree

Hide file tree

Showing 5 changed files with 7 additions and 7 deletions.
diff --git a/internal/game/conway/conway.go b/internal/game/conway/conway.go
@@ -70,9 +70,9 @@ func (c *Conway) Init() tea.Cmd {
 func (c *Conway) Update(msg tea.Msg) (tea.Model, tea.Cmd) {
 	switch msg := msg.(type) {
 	case tickMsg:
-		steps := uint(1)
+		steps := uint64(1)
 		if speeds[c.speed] < time.Second/240 {
-			steps += uint(time.Second / 240 / speeds[c.speed])
+			steps += uint64(time.Second / 240 / speeds[c.speed]) //nolint:gosec
 		}
 		c.Pattern.Step(steps)
 		if c.ctx != nil {

diff --git a/internal/pattern/pattern.go b/internal/pattern/pattern.go
@@ -28,7 +28,7 @@ type Pattern struct {
 	Rule    rule.Rule
 }
 
-func (p Pattern) Step(steps uint) {
+func (p Pattern) Step(steps uint64) {
 	p.Tree.Step(&p.Rule, steps)
 }
 

diff --git a/internal/quadtree/debug.go b/internal/quadtree/debug.go
@@ -6,7 +6,7 @@ import (
 
 type Stats struct {
 	Steps      int
-	Generation uint
+	Generation uint64
 	Level      int
 	Population int
 	memoizer.Stats

diff --git a/internal/quadtree/gosper.go b/internal/quadtree/gosper.go
@@ -18,7 +18,7 @@ func New() *Gosper {
 type Gosper struct {
 	resetCells *Node
 	cells      *Node
-	generation uint
+	generation uint64
 	steps      int
 }
 
@@ -35,7 +35,7 @@ func (g *Gosper) Set(p image.Point, v int) {
 	g.cells = g.cells.Set(p, v)
 }
 
-func (g *Gosper) Step(r *rule.Rule, steps uint) {
+func (g *Gosper) Step(r *rule.Rule, steps uint64) {
 	memoizedNew.Cleanup()
 
 	g.steps++

diff --git a/internal/quadtree/node_helpers_test.go b/internal/quadtree/node_helpers_test.go
@@ -16,7 +16,7 @@ func treeWithRandomPattern(level uint) (*Node, *big.Int) {
 		node = node.grow()
 	}
 	edgeLength := int(1) << level
-	cellsInTree := uint(edgeLength * edgeLength)
+	cellsInTree := uint(edgeLength * edgeLength) //nolint:gosec
 
 	upperBound := new(big.Int)
 	upperBound.SetInt64(1)