add result struct to package one

remove unnecessary assignments in util.splitNumber

day-11/benchmark

@@ -2,14 +2,14 @@ goos: linux
 goarch: amd64
 pkg: github.com/onyx-and-iris/aoc2024/day-11
 cpu: Intel(R) Core(TM) i7-8700K CPU @ 3.70GHz
-BenchmarkSolve-12    	1000000000	         0.07126 ns/op
-BenchmarkSolve-12    	1000000000	         0.07114 ns/op
-BenchmarkSolve-12    	1000000000	         0.07102 ns/op
-BenchmarkSolve-12    	1000000000	         0.07157 ns/op
-BenchmarkSolve-12    	1000000000	         0.07201 ns/op
-BenchmarkSolve-12    	1000000000	         0.07461 ns/op
-BenchmarkSolve-12    	1000000000	         0.07305 ns/op
-BenchmarkSolve-12    	1000000000	         0.07548 ns/op
-BenchmarkSolve-12    	1000000000	         0.07503 ns/op
-BenchmarkSolve-12    	1000000000	         0.07202 ns/op
-ok  	github.com/onyx-and-iris/aoc2024/day-11	6.636s
+BenchmarkSolve-12    	1000000000	         0.05353 ns/op
+BenchmarkSolve-12    	1000000000	         0.05134 ns/op
+BenchmarkSolve-12    	1000000000	         0.04984 ns/op
+BenchmarkSolve-12    	1000000000	         0.05239 ns/op
+BenchmarkSolve-12    	1000000000	         0.04956 ns/op
+BenchmarkSolve-12    	1000000000	         0.04873 ns/op
+BenchmarkSolve-12    	1000000000	         0.04943 ns/op
+BenchmarkSolve-12    	1000000000	         0.05024 ns/op
+BenchmarkSolve-12    	1000000000	         0.05187 ns/op
+BenchmarkSolve-12    	1000000000	         0.04968 ns/op
+ok  	github.com/onyx-and-iris/aoc2024/day-11	4.083s

day-11/internal/one/benchmark

@@ -2,5 +2,5 @@ goos: linux
 goarch: amd64
 pkg: github.com/onyx-and-iris/aoc2024/day-11/internal/one
 cpu: Intel(R) Core(TM) i7-8700K CPU @ 3.70GHz
-BenchmarkSolve-12    	1000000000	         0.03508 ns/op
+BenchmarkSolve-12    	1000000000	         0.03459 ns/op
 ok  	github.com/onyx-and-iris/aoc2024/day-11/internal/one	0.244s

day-11/internal/one/result.go

@@ -0,0 +1,29 @@
+package one
+
+import "fmt"
+
+const (
+	flip = iota
+	split
+	multiply
+)
+
+type result struct {
+	kind  int
+	left  int
+	right int
+}
+
+func (r result) String() string {
+	var kindStr string
+	switch r.kind {
+	case flip:
+		kindStr = "flip"
+	case split:
+		kindStr = "split"
+	case multiply:
+		kindStr = "multiply"
+	}
+
+	return fmt.Sprintf("kind: %s left: %d right: %d", kindStr, r.left, r.right)
+}

day-11/internal/one/solve.go

@@ -28,11 +28,14 @@ func Solve(buf []byte) (int, error) {
 		next := queue.New[int]()
 		for !old.IsEmpty() {
 			n := old.Dequeue()
-			left, right, ok := applyRules(n)
-			if ok {
-				next.Enqueue(left)
+			r := applyRules(n)
+			switch r.kind {
+			case flip, multiply:
+				next.Enqueue(r.right)
+			case split:
+				next.Enqueue(r.left)
+				next.Enqueue(r.right)
 			}
-			next.Enqueue(right)
 		}
 
 		old = next
@@ -42,14 +45,14 @@ func Solve(buf []byte) (int, error) {
 	return old.Len(), nil
 }
 
-func applyRules(num int) (int, int, bool) {
+func applyRules(num int) result {
 	switch num := num; {
 	case num == 0:
-		return 0, 1, false
+		return result{flip, 0, 1}
 	case lenItoa(num)%2 == 0:
 		left, right := splitNumber(num)
-		return left, right, true
+		return result{split, left, right}
 	default:
-		return 0, num * magic, false
+		return result{multiply, 0, num * magic}
 	}
 }

day-11/internal/one/util.go

@@ -44,10 +44,7 @@ func mustConv(s string) int {
 func splitNumber(n int) (int, int) {
 	factor := int(math.Pow10(lenItoa(n) / 2))
 
-	right := n % factor
-	left := int(n / factor)
-
-	return left, right
+	return int(n / factor), n % factor
 }
 
 func lenItoa(n int) int {

day-11/internal/two/benchmark

@@ -2,5 +2,5 @@ goos: linux
 goarch: amd64
 pkg: github.com/onyx-and-iris/aoc2024/day-11/internal/two
 cpu: Intel(R) Core(TM) i7-8700K CPU @ 3.70GHz
-BenchmarkSolve-12    	1000000000	         0.03833 ns/op
-ok  	github.com/onyx-and-iris/aoc2024/day-11/internal/two	0.322s
+BenchmarkSolve-12    	1000000000	         0.01475 ns/op
+ok  	github.com/onyx-and-iris/aoc2024/day-11/internal/two	0.102s

day-11/internal/two/util.go

@@ -44,10 +44,7 @@ func mustConv(s string) int {
 func splitNumber(n int) (int, int) {
 	factor := int(math.Pow10(lenItoa(n) / 2))
 
-	left := int(n / factor)
-	right := n % factor
-
-	return left, right
+	return int(n / factor), n % factor
 }
 
 func lenItoa(n int) int {