diff options
| author | Martin Kagamino Lehoux <martin@lehoux.net> | 2024-12-30 11:06:18 +0100 |
|---|---|---|
| committer | Martin Kagamino Lehoux <martin@lehoux.net> | 2024-12-30 11:06:18 +0100 |
| commit | 72032ded336192c27d53c07f018081d767f78a49 (patch) | |
| tree | 5e7dc44a9389abd540159d4bab602d092a6f5470 /ride/climb.go | |
| parent | 76f13c2c07ccb187d7b8376322cd973fd2d54be4 (diff) | |
chore: Add test & cleanup logs
Diffstat (limited to 'ride/climb.go')
| -rw-r--r-- | ride/climb.go | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/ride/climb.go b/ride/climb.go index 7720fa8..190225e 100644 --- a/ride/climb.go +++ b/ride/climb.go @@ -1,7 +1,7 @@ package ride import ( - "fmt" + "log/slog" "math" "slices" @@ -97,7 +97,7 @@ func climbsBetween(points []Point, start int, end int) []Climb { if points[end].distance-points[start].distance < ClimbDistanceMinimum { return climbs } - fmt.Printf("Searching climbs between %.1fkm and %.1fkm\n", points[start].distance/1000, points[end].distance/1000) + slog.Debug("Searching climbs between", slog.Int("start", int(points[start].distance)), slog.Int("end", int(points[end].distance))) highest := start for i := start; i <= end; i++ { if points[i].elevation > points[highest].elevation { @@ -110,7 +110,7 @@ func climbsBetween(points []Point, start int, end int) []Climb { } climb := bestClimbBetween(points, start, highest) if Score(points, climb.start, climb.end) >= 35 && points[climb.end].distance-points[climb.start].distance >= ClimbDistanceMinimum { - fmt.Printf("Found climb between %.1fkm and %.1fkm\n", points[climb.start].distance/1000, points[climb.end].distance/1000) + slog.Debug("Found climb between", slog.Int("start", int(points[climb.start].distance)), slog.Int("end", int(points[climb.end].distance))) climbs = append(climbs, climb) } climbs = append(climbs, climbsBetween(points, start, climb.start)...) |