bert/adventofcode
1
0
Fork 0
mirror of https://github.com/bertptrs/adventofcode.git synced 2025-12-25 21:00:31 +01:00
Code Issues Projects Releases Wiki Activity

Remove more old intcode references.

Browse Source
This commit is contained in:
Bert Peters
2019-12-14 16:10:10 +01:00
parent a655436ac6
commit 61f499e8e9
1 changed files with 11 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

17
2019/tests/test_intcode.cpp
View File

@@ -2,34 +2,39 @@
#include "utils.hpp"
using aoc2019::run_intcode;
using aoc2019::IntCodeComputer;
auto run_program(std::vector<int> program, std::deque<int> input) {
return run_intcode(program, std::move(input));
auto run_program(std::vector<int64_t> program, std::deque<int64_t> input) {
std::deque<std::int64_t> output;
IntCodeComputer computer(std::move(program), std::move(input));
computer.connectOutput(output);
computer.run();
return output;
}
TEST(Intcode, TestPositionEquality) {
const std::vector<int> program = {3, 9, 8, 9, 10, 9, 4, 9, 99, -1, 8};
const std::vector<int64_t> program = {3, 9, 8, 9, 10, 9, 4, 9, 99, -1, 8};
ASSERT_EQ(1, run_program(program, {8}).front());
ASSERT_EQ(0, run_program(program, {9}).front());
}
TEST(Intcode, TestPositionLess) {
const std::vector<int> program = {3, 9, 7, 9, 10, 9, 4, 9, 99, -1, 8};
const std::vector<int64_t> program = {3, 9, 7, 9, 10, 9, 4, 9, 99, -1, 8};
ASSERT_EQ(1, run_program(program, {7}).front());
ASSERT_EQ(0, run_program(program, {9}).front());
}
TEST(Intcode, TestImmediateEquality) {
const std::vector<int> program = {3, 3, 1108, -1, 8, 3, 4, 3, 99};
const std::vector<int64_t> program = {3, 3, 1108, -1, 8, 3, 4, 3, 99};
ASSERT_EQ(1, run_program(program, {8}).front());
ASSERT_EQ(0, run_program(program, {9}).front());
}
TEST(Intcode, TestImmediateLess) {
const std::vector<int> program = {3, 3, 1107, -1, 8, 3, 4, 3, 99};
const std::vector<int64_t> program = {3, 3, 1107, -1, 8, 3, 4, 3, 99};
ASSERT_EQ(1, run_program(program, {7}).front());
ASSERT_EQ(0, run_program(program, {9}).front());