Created
December 13, 2019 13:19
-
-
Save svantelidman/a3470e35aa6f5c9b3a0ee6a2a41428f6 to your computer and use it in GitHub Desktop.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| use std::io::{BufReader, BufRead}; | |
| use std::fs::File; | |
| use std::collections::HashMap; | |
| struct Machine { | |
| prog_ptr: i64, | |
| relative_base: i64, | |
| program: Vec<i64>, | |
| input: Vec<i64>, | |
| output: Vec<i64>, | |
| state: MachineState | |
| } | |
| #[derive(PartialEq)] | |
| enum MachineState { | |
| ReadyToRun, | |
| WaitingForInput, | |
| OutputAvailable, | |
| Terminated | |
| } | |
| enum InstructionResult { | |
| Continue, | |
| WaitForInput, | |
| OutputDelivered, | |
| Invalid, | |
| Exit | |
| } | |
| enum ParameterMode { | |
| Position = 0, | |
| Direct = 1, | |
| Relative= 2 | |
| } | |
| impl Machine { | |
| fn resume(&mut self) { | |
| loop { | |
| let a = self.run_one_instruction(); | |
| match a { | |
| InstructionResult::Continue => { self.state = MachineState::ReadyToRun }, | |
| InstructionResult::WaitForInput => { self.state = MachineState::WaitingForInput; break; }, | |
| InstructionResult::OutputDelivered => { self.state = MachineState::OutputAvailable; break; }, | |
| InstructionResult::Exit => { self.state = MachineState::Terminated; break; }, | |
| _ => panic!("Unexpected action."), | |
| } | |
| } | |
| } | |
| fn grow_storage_if_required(&mut self, location: i64) { | |
| if location >= self.program.len() as i64 { | |
| self.program.resize((location + 1) as usize, 0) | |
| } | |
| } | |
| fn get(&mut self, location: i64) -> i64 { | |
| self.grow_storage_if_required(location); | |
| self.program[location as usize] | |
| } | |
| fn put(&mut self, location: i64, value: i64) { | |
| self.grow_storage_if_required(location); | |
| self.program[location as usize] = value; | |
| } | |
| fn next_cell(&mut self) -> i64 { | |
| let ind = self.prog_ptr; | |
| self.prog_ptr += 1; | |
| self.get(ind) | |
| } | |
| fn get_parameter_value(&mut self, mode: i64) -> i64 { | |
| let value = self.next_cell(); | |
| if mode == ParameterMode::Position as i64 { | |
| return self.get(value) | |
| } else if mode == ParameterMode::Direct as i64 { | |
| return value | |
| } else if mode == ParameterMode::Relative as i64 { | |
| return self.get(value + self.relative_base) | |
| } else { | |
| panic!("Unknown parameter mode: {}", mode) | |
| } | |
| } | |
| fn get_storage_location(&mut self, mode: i64) -> i64 { | |
| if mode == ParameterMode::Relative as i64 { | |
| self.next_cell() + self.relative_base | |
| } else { | |
| self.next_cell() | |
| } | |
| } | |
| const ADD: i64 = 1; | |
| const MULT: i64 = 2; | |
| const INPUT: i64 = 3; | |
| const OUTPUT: i64 = 4; | |
| const JUMP_TRUE: i64 = 5; | |
| const JUMP_FALSE: i64 = 6; | |
| const LESS_THAN: i64 = 7; | |
| const EQUALS: i64 = 8; | |
| const RELATIVE_BASE_OFFSET: i64 = 9; | |
| const EXIT: i64 = 99; | |
| fn run_one_instruction(&mut self) -> InstructionResult { | |
| let saved_prog_ptr = self.prog_ptr; | |
| let next_instruction_code = self.next_cell(); | |
| let next_op_code = next_instruction_code % 100; | |
| let mode_par_1 = (next_instruction_code / 100) % 10; | |
| let mode_par_2 = (next_instruction_code / 1000) % 10; | |
| let mode_par_3 = (next_instruction_code / 10000) % 10; | |
| match next_op_code { | |
| Machine::ADD => { | |
| let t1 = self.get_parameter_value(mode_par_1); | |
| let t2 = self.get_parameter_value(mode_par_2); | |
| let store_at = self.get_storage_location(mode_par_3); | |
| self.put(store_at, t1 + t2); | |
| InstructionResult::Continue | |
| }, | |
| Machine::MULT => { | |
| let f1 = self.get_parameter_value(mode_par_1); | |
| let f2 = self.get_parameter_value(mode_par_2); | |
| let store_at = self.get_storage_location(mode_par_3); | |
| self.put(store_at, f1 * f2); | |
| InstructionResult::Continue | |
| }, | |
| Machine::INPUT => { | |
| if !self.input.is_empty() { | |
| let store_at = self.get_storage_location(mode_par_1); | |
| let c = self.input.remove(0); | |
| self.put(store_at, c); | |
| InstructionResult::Continue | |
| } else { | |
| self.prog_ptr = saved_prog_ptr; | |
| InstructionResult::WaitForInput | |
| } | |
| }, | |
| Machine::JUMP_TRUE => { | |
| let value = self.get_parameter_value(mode_par_1); | |
| let jump_target = self.get_parameter_value(mode_par_2); | |
| if value != 0 { | |
| self.prog_ptr = jump_target | |
| } | |
| InstructionResult::Continue | |
| }, | |
| Machine::JUMP_FALSE => { | |
| let value = self.get_parameter_value(mode_par_1); | |
| let jump_target = self.get_parameter_value(mode_par_2); | |
| if value == 0 { | |
| self.prog_ptr = jump_target | |
| } | |
| InstructionResult::Continue | |
| }, | |
| Machine::LESS_THAN => { | |
| let p1 = self.get_parameter_value(mode_par_1); | |
| let p2 = self.get_parameter_value(mode_par_2); | |
| let store_at = self.get_storage_location(mode_par_3); | |
| let result = if p1 < p2 { 1 } else { 0 }; | |
| self.put(store_at, result); | |
| InstructionResult::Continue | |
| }, | |
| Machine::EQUALS => { | |
| let p1 = self.get_parameter_value(mode_par_1); | |
| let p2 = self.get_parameter_value(mode_par_2); | |
| let store_at = self.get_storage_location(mode_par_3); | |
| let result = if p1 == p2 { 1 } else { 0 }; | |
| self.put(store_at, result); | |
| InstructionResult::Continue | |
| }, | |
| Machine::OUTPUT => { | |
| let v = self.get_parameter_value(mode_par_1); | |
| self.output.push(v); | |
| InstructionResult::OutputDelivered | |
| }, | |
| Machine::RELATIVE_BASE_OFFSET => { | |
| let v = self.get_parameter_value(mode_par_1); | |
| self.relative_base += v; | |
| InstructionResult::Continue | |
| }, | |
| Machine::EXIT => InstructionResult::Exit, | |
| _ => InstructionResult::Invalid | |
| } | |
| } | |
| } | |
| fn load_program(program_file: &String) -> Vec<i64> { | |
| let mut prog: Vec<i64> = vec![]; | |
| let file = File::open(program_file).expect("Could not open program file!"); | |
| let reader = BufReader::new(file); | |
| let line = reader.lines().next().expect("Could not read from file"); | |
| let line = line.expect("No string there."); | |
| for s in line.split(",") { | |
| let c = i64::from_str_radix(&s, 10).expect("Could not parse int"); | |
| prog.push(c); | |
| } | |
| prog | |
| } | |
| fn main() { | |
| let program_file = "prog".to_string(); | |
| let program: Vec<i64> = load_program(&program_file); | |
| let mut machine = Machine { | |
| prog_ptr: 0, | |
| relative_base: 0, | |
| program: program.clone(), | |
| input: vec!(), | |
| output: vec!(), | |
| state: MachineState::ReadyToRun | |
| }; | |
| let mut screen: HashMap<(i64, i64), Tile> = HashMap::new(); | |
| loop { | |
| match machine.state { | |
| MachineState::Terminated => break, | |
| MachineState::OutputAvailable => { | |
| while machine.output.len() >= 3 { | |
| let x = machine.output.remove(0); | |
| let y = machine.output.remove(0); | |
| let tile_value = machine.output.remove(0); | |
| let t = tile_from_i64(tile_value); | |
| match t { | |
| Some(tile) => {screen.insert((x, y), tile);}, | |
| None => { | |
| if x == -1 && y == 0 { | |
| println!("New score: {}", tile_value) | |
| } else { | |
| panic!("Unexpected input combination x={} y={} t={}", x, y, tile_value) | |
| } | |
| } | |
| }; | |
| } | |
| }, | |
| MachineState::WaitingForInput => { | |
| if let Some((bx, by)) = ball_position(&screen) { | |
| if let Some((px, py)) = paddle_position(&screen) { | |
| if by >= py { | |
| machine.input.push(0); | |
| } else { | |
| if px < bx { | |
| machine.input.push(1); | |
| } else if px > bx { | |
| machine.input.push(-1); | |
| } else { | |
| machine.input.push(0); | |
| } | |
| } | |
| } else { | |
| panic!("Paddle missing ???") | |
| } | |
| } else { | |
| machine.input.push(0); | |
| } | |
| }, | |
| MachineState::ReadyToRun => {}, | |
| } | |
| machine.resume() | |
| } | |
| let n_painted = screen.values().filter(|b| **b == Tile::Block).count(); | |
| println!("Number of blocks: {}", n_painted); | |
| paint_screen(&screen); | |
| } | |
| fn ball_position(screen: &HashMap<(i64, i64), Tile>) -> Option<(i64, i64)> { | |
| let pos = screen.iter().find(|(_, v)| **v == Tile::Ball); | |
| match pos { | |
| Some(p) => Some(*p.0), | |
| None => None | |
| } | |
| } | |
| fn paddle_position(screen: &HashMap<(i64, i64), Tile>) -> Option<(i64, i64)> { | |
| let pos = screen.iter().find(|(_, v)| **v == Tile::Paddle); | |
| match pos { | |
| Some(p) => Some(*p.0), | |
| None => None | |
| } | |
| } | |
| fn paint_screen(screen: &HashMap<(i64, i64), Tile>) { | |
| let min_x = screen.keys().fold(std::i64::MAX, |acc, k| std::cmp::min(acc, k.0)); | |
| let max_x = screen.keys().fold(std::i64::MIN, |acc, k| std::cmp::max(acc, k.0)); | |
| let min_y = screen.keys().fold(std::i64::MAX, |acc, k| std::cmp::min(acc, k.1)); | |
| let max_y = screen.keys().fold(std::i64::MIN, |acc, k| std::cmp::max(acc, k.1)); | |
| for y in min_y..=max_y { | |
| for x in min_x..=max_x { | |
| let color_char = match screen.get(&(x, y)) { | |
| Some(color) => char_for_tile(color), | |
| None => char_for_tile(&Tile::Empty) | |
| }; | |
| print!("{}", color_char) | |
| } | |
| println!(); | |
| } | |
| } | |
| fn tile_from_i64(t: i64) -> Option<Tile> { | |
| match t { | |
| 0 => Some(Tile::Empty), | |
| 1 => Some(Tile::Wall), | |
| 2 => Some(Tile::Block), | |
| 3 => Some(Tile::Paddle), | |
| 4 => Some(Tile::Ball), | |
| _ => None | |
| } | |
| } | |
| fn char_for_tile(tile: &Tile) -> char { | |
| match tile { | |
| Tile::Empty => ' ', | |
| Tile::Wall => '#', | |
| Tile::Block => '+', | |
| Tile::Paddle => '-', | |
| Tile::Ball => '*' | |
| } | |
| } | |
| #[derive(Copy, Clone, PartialEq, Eq)] | |
| enum Tile { | |
| Empty = 0, | |
| Wall = 1, | |
| Block = 2, | |
| Paddle = 3, | |
| Ball = 4, | |
| } | |
| #[cfg(test)] | |
| mod test { | |
| #[test] | |
| fn basic() { | |
| assert!(true); | |
| } | |
| } |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment