add day-09 + benchmarks

day-09/internal/one/benchmark

@@ -0,0 +1,6 @@
+goos: linux
+goarch: amd64
+pkg: github.com/onyx-and-iris/aoc2024/day-09/internal/one
+cpu: Intel(R) Core(TM) i7-8700K CPU @ 3.70GHz
+BenchmarkSolve-12    	1000000000	         0.1535 ns/op
+ok  	github.com/onyx-and-iris/aoc2024/day-09/internal/one	1.893s

day-09/internal/one/block.go

@@ -0,0 +1,8 @@
+package one
+
+const empty = -1
+
+type block struct {
+	used int
+	free int
+}

day-09/internal/one/disk.go

@@ -0,0 +1,59 @@
+package one
+
+import (
+	"fmt"
+	"slices"
+	"strings"
+)
+
+type disk struct {
+	data      []int
+	totalUsed int
+}
+
+func newDisk(blocks []block) disk {
+	var totalUsed int
+	data := []int{}
+	for id, block := range blocks {
+		for range block.used {
+			data = append(data, id)
+		}
+		for range block.free {
+			data = append(data, empty)
+		}
+		totalUsed += block.used
+	}
+
+	return disk{
+		data:      data,
+		totalUsed: totalUsed,
+	}
+}
+
+func (d *disk) len() int {
+	return d.totalUsed
+}
+
+func (d *disk) sort() {
+	for i := len(d.data) - 1; i >= 0; i-- {
+		if d.data[i] != empty {
+			indx := slices.Index(d.data, empty)
+			if indx == d.len() {
+				break
+			}
+			d.data[i], d.data[indx] = d.data[indx], d.data[i]
+		}
+	}
+}
+
+func (d *disk) debug() string {
+	var sb strings.Builder
+	for _, n := range d.data {
+		if n == empty {
+			sb.WriteRune('.')
+		} else {
+			sb.WriteString(fmt.Sprintf("%d", n))
+		}
+	}
+	return sb.String()
+}

day-09/internal/one/solve.go

@@ -0,0 +1,27 @@
+package one
+
+import (
+	"bytes"
+
+	log "github.com/sirupsen/logrus"
+)
+
+func Solve(buf []byte) (int, error) {
+	r := bytes.NewReader(buf)
+	blocks, err := parseLines(r)
+	if err != nil {
+		return 0, err
+	}
+
+	disk := newDisk(blocks)
+	disk.sort()
+	log.Debug(disk.debug())
+
+	var i, checksum int
+	for range disk.len() {
+		checksum += i * disk.data[i]
+		i++
+	}
+
+	return checksum, nil
+}

day-09/internal/one/solve_internal_test.go

@@ -0,0 +1,15 @@
+package one
+
+import (
+	_ "embed"
+	"os"
+	"testing"
+)
+
+//go:embed testdata/input.txt
+var data []byte
+
+func BenchmarkSolve(b *testing.B) {
+	os.Stdout, _ = os.Open(os.DevNull)
+	Solve(data)
+}

day-09/internal/one/util.go

@@ -0,0 +1,38 @@
+package one
+
+import (
+	"bufio"
+	"io"
+	"strconv"
+)
+
+func parseLines(r io.Reader) ([]block, error) {
+	var blocks []block
+
+	scanner := bufio.NewScanner(r)
+	for scanner.Scan() {
+		line := scanner.Text()
+
+		for i := 0; i < len(line); i += 2 {
+			var free int
+			if i < len(line)-1 {
+				free = mustConv(string(line[i+1]))
+			}
+			blocks = append(blocks, block{mustConv(string(line[i])), free})
+		}
+	}
+
+	if err := scanner.Err(); err != nil {
+		return []block{}, err
+	}
+
+	return blocks, nil
+}
+
+func mustConv(s string) int {
+	n, err := strconv.Atoi(s)
+	if err != nil {
+		panic(err)
+	}
+	return n
+}

day-09/internal/two/benchmark

@@ -0,0 +1,6 @@
+goos: linux
+goarch: amd64
+pkg: github.com/onyx-and-iris/aoc2024/day-09/internal/two
+cpu: Intel(R) Core(TM) i7-8700K CPU @ 3.70GHz
+BenchmarkSolve-12    	       1	22722704246 ns/op
+ok  	github.com/onyx-and-iris/aoc2024/day-09/internal/two	22.726s

day-09/internal/two/block.go

@@ -0,0 +1,21 @@
+package two
+
+const empty = -1
+
+type block struct {
+	used   int
+	free   []int
+	offset int
+}
+
+func newBlock(used, start, end int) block {
+	return block{
+		used:   used,
+		free:   []int{start, start + end},
+		offset: 0,
+	}
+}
+
+func (b *block) available() int {
+	return b.free[1] - b.free[0]
+}

day-09/internal/two/disk.go

@@ -0,0 +1,98 @@
+package two
+
+import (
+	"fmt"
+	"strings"
+
+	log "github.com/sirupsen/logrus"
+)
+
+type disk struct {
+	blocks []block
+	data   []int
+}
+
+func newDisk(blocks []block) disk {
+	offset := 0
+	data := []int{}
+	for id, block := range blocks {
+		blocks[id].offset = offset
+		for range block.used {
+			data = append(data, id)
+		}
+		for range block.available() {
+			data = append(data, empty)
+		}
+		offset += block.used + block.available()
+	}
+
+	return disk{
+		blocks: blocks,
+		data:   data,
+	}
+}
+
+func (d *disk) sort() {
+	for i := len(d.blocks) - 1; i >= 0; i-- {
+		log.Debugf("searching for space for block %d of size %d\n", i, d.blocks[i].used)
+
+		for j := 0; j < len(d.data); j++ {
+			if j >= d.blocks[i].offset+d.blocks[i].used {
+				break
+			}
+
+			if d.data[j] != empty {
+				continue
+			}
+
+			var sz int
+			if d.data[j] == empty {
+				sz = d.sizeOfEmptyBlock(j)
+			}
+
+			if d.blocks[i].used <= sz {
+				d.writeBlockToDisk(j, d.blocks[i])
+				// don't attempt to write block again
+				break
+			}
+
+			// skip to end of empty block
+			j += sz
+		}
+	}
+}
+
+func (d *disk) sizeOfEmptyBlock(j int) int {
+	var sz int
+	for k := j; k < len(d.data) && d.data[k] == empty; k++ {
+		sz++
+	}
+	log.Debugf("found empty space of size %d\n", sz)
+	return sz
+}
+
+func (d *disk) writeBlockToDisk(start int, b block) {
+	for i := b.offset; i < b.offset+b.used; i, start = i+1, start+1 {
+		d.data[start] = d.data[i]
+		log.Debugf("writing %d to disk at pos %d\n", d.data[i], start)
+	}
+
+	for i := b.offset; i < len(d.data) && i < b.offset+b.used; i++ {
+		d.data[i] = empty
+		log.Debugf("truncating space on disk at pos %d", i)
+	}
+
+	log.Debug(d.debug())
+}
+
+func (d *disk) debug() string {
+	var sb strings.Builder
+	for _, n := range d.data {
+		if n == empty {
+			sb.WriteRune('.')
+		} else {
+			sb.WriteString(fmt.Sprintf("%d", n))
+		}
+	}
+	return sb.String()
+}

day-09/internal/two/solve.go

@@ -0,0 +1,31 @@
+package two
+
+import (
+	"bytes"
+
+	log "github.com/sirupsen/logrus"
+)
+
+func Solve(buf []byte) (int, error) {
+	r := bytes.NewReader(buf)
+	blocks, err := parseLines(r)
+	if err != nil {
+		return 0, err
+	}
+
+	disk := newDisk(blocks)
+	log.Debug(disk.debug())
+	disk.sort()
+	log.Debug(disk.debug())
+
+	var checksum int
+	for i := 0; i < len(disk.data); i++ {
+		if disk.data[i] == empty {
+			continue
+		}
+
+		checksum += i * disk.data[i]
+	}
+
+	return checksum, nil
+}

day-09/internal/two/solve_internal_test.go

@@ -0,0 +1,15 @@
+package two
+
+import (
+	_ "embed"
+	"os"
+	"testing"
+)
+
+//go:embed testdata/input.txt
+var data []byte
+
+func BenchmarkSolve(b *testing.B) {
+	os.Stdout, _ = os.Open(os.DevNull)
+	Solve(data)
+}

day-09/internal/two/util.go

@@ -0,0 +1,41 @@
+package two
+
+import (
+	"bufio"
+	"io"
+	"strconv"
+)
+
+func parseLines(r io.Reader) ([]block, error) {
+	var blocks []block
+	var start int
+
+	scanner := bufio.NewScanner(r)
+	for scanner.Scan() {
+		line := scanner.Text()
+
+		for i := 0; i < len(line); i += 2 {
+			used := mustConv(string(line[i]))
+			start += used
+			var end int
+			if i < len(line)-1 {
+				end = mustConv(string(line[i+1]))
+			}
+			blocks = append(blocks, newBlock(used, start, end))
+		}
+	}
+
+	if err := scanner.Err(); err != nil {
+		return []block{}, err
+	}
+
+	return blocks, nil
+}
+
+func mustConv(s string) int {
+	n, err := strconv.Atoi(s)
+	if err != nil {
+		panic(err)
+	}
+	return n
+}