A Series of Tubes — Rust — #adventofcode Day 19
Series
This post is part of the series Advent of Code 2017
- Reflections on #aoc2017
- The Halting Problem — Python — #adventofcode Day 25
- Electromagnetic Moat — Rust — #adventofcode Day 24
- Coprocessor Conflagration — Haskell — #adventofcode Day 23
- Sporifica Virus — Rust — #adventofcode Day 22
- Fractal Art — Python — #adventofcode Day 21
- Particle Swarm — Python — #adventofcode Day 20
- > A Series of Tubes — Rust — #adventofcode Day 19 <
- Duet — Haskell — #adventofcode Day 18
- Spinlock — Rust/Python — #adventofcode Day 17
- Permutation Promenade — Julia — #adventofcode Day 16
- Dueling Generators — Rust — #adventofcode Day 15
- Disk Defragmentation — Haskell — #adventofcode Day 14
- Packet Scanners — Haskell — #adventofcode Day 13
- Digital Plumber — Python — #adventofcode Day 12
- Hex Ed — Python — #adventofcode Day 11
- Knot Hash — Haskell — #adventofcode Day 10
- Stream Processing — Haskell — #adventofcode Day 9
- I Heard You Like Registers — Python — #adventofcode Day 8
- Recursive Circus — Ruby — #adventofcode Day 7
- Memory Reallocation — Python — #adventofcode Day 6
- A Maze of Twisty Trampolines — C++ — #adventofcode Day 5
- High Entropy Passphrases — Python — #adventofcode Day 4
- Spiral Memory — Go — #adventofcode Day 3
- Corruption Checksum — Python — #adventofcode Day 2
- Inverse Captcha — Coconut — #adventofcode Day 1
- Advent of Code 2017: introduction
Today’s challenge asks us to help a network packet find its way.
!!! commentary
Today’s challenge was fairly straightforward, following an ASCII art path, so I thought I’d give Rust another try. I’m a bit behind on the blog posts, so I’m presenting the code below without any further commentary. I’m not really convinced this is good idiomatic Rust, and it was interesting turning a set of strings into a 2D array of characters because there are both u8 (byte) and char types to deal with.
use std::io;
use std::io::BufRead;
const ALPHA: &'static str = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
fn change_direction(dia: &Vec<Vec<u8>>, x: usize, y: usize, dx: &mut i32, dy: &mut i32) {
assert_eq!(dia[x][y], b'+');
if dx.abs() == 1 {
*dx = 0;
if y + 1 < dia[x].len() && (dia[x][y + 1] == b'-' || ALPHA.contains(dia[x][y + 1] as char)) {
*dy = 1;
} else if dia[x][y - 1] == b'-' || ALPHA.contains(dia[x][y - 1] as char) {
*dy = -1;
} else {
panic!("Huh? {} {}", dia[x][y+1] as char, dia[x][y-1] as char);
}
} else {
*dy = 0;
if x + 1 < dia.len() && (dia[x + 1][y] == b'|' || ALPHA.contains(dia[x + 1][y] as char)) {
*dx = 1;
} else if dia[x - 1][y] == b'|' || ALPHA.contains(dia[x - 1][y] as char) {
*dx = -1;
} else {
panic!("Huh?");
}
}
}
fn follow_route(dia: Vec<Vec<u8>>) -> (String, i32) {
let mut x: i32 = 0;
let mut y: i32;
let mut dx: i32 = 1;
let mut dy: i32 = 0;
let mut result = String::new();
let mut steps = 1;
match dia[0].iter().position(|x| *x == b'|') {
Some(i) => y = i as i32,
None => panic!("Could not find '|' in first row"),
}
loop {
x += dx;
y += dy;
match dia[x as usize][y as usize] {
b'A'...b'Z' => result.push(dia[x as usize][y as usize] as char),
b'+' => change_direction(&dia, x as usize, y as usize, &mut dx, &mut dy),
b' ' => return (result, steps),
_ => (),
}
steps += 1;
}
}
fn main() {
let stdin = io::stdin();
let lines: Vec<Vec<u8>> = stdin.lock().lines()
.map(|l| l.unwrap().into_bytes())
.collect();
let result = follow_route(lines);
println!("Route: {}", result.0);
println!("Steps: {}", result.1);
}
Webmentions
You can respond to this post, "A Series of Tubes — Rust — #adventofcode Day 19", by:
liking, boosting or replying to a tweet or toot that mentions it; or
sending a webmention from your own site to https://erambler.co.uk/blog/day-19/
Comments
Powered by Cactus Comments 🌵