Testing parseOp

Author: romellem

2019/19/intcode-computer.js

@@ -35,6 +35,8 @@ class Computer {
 		this.replenish_input = replenish_input;
 		this.outputs = [];
 
+		this.parseOpTime = 0;
+
 		this.OPS = {
 			[ADD]: {
 				name: ADD,
@@ -163,6 +165,7 @@ class Computer {
 	}
 
 	parseOp() {
+		let start = new Date();
 		let temp_op = String(this.memory[this.pointer]).padStart(2, '0');
 
 		// "The opcode is a two-digit number based only on the ones and tens digit of the value, that is, the opcode is the rightmost two digits of the first value in an instruction"
@@ -177,10 +180,13 @@ class Computer {
 			modes.push(full_op[i]);
 		}
 
-		return {
+		let rtn_obj = {
 			...op,
 			modes,
 		};
+		let end = new Date();
+		this.parseOpTime += (end - start);
+		return rtn_obj;
 	}
 
 	runOp({ modes, fn, jumps, write }) {
@@ -299,6 +305,11 @@ class Computer {
 	get _() {
 		return this.memory.slice(Math.max(0, this.pointer - 1), this.pointer + 8);
 	}
+
+	logParseOpDuration() {
+		const million = BigInt(1e6);
+		console.log(`parseOp took ${parseOpTime / million} ms`);
+	}
 }
 
 module.exports = {

2019/19/part-two.js

@@ -4,3 +4,4 @@ const { TractorBeam } = require('./tractor-beam');
 let tractor_beam = new TractorBeam(input);
 // console.log(tractor_beam.partTwo());
 console.log(tractor_beam.partTwoOptimized());
+console.log(`parseOp took ${tractor_beam.parseOpTime} ms`);

2019/19/tractor-beam.js

@@ -5,6 +5,8 @@ class TractorBeam {
 	constructor(memory, options = {}) {
 		this.memory = memory.slice(0);
 		this.grid = new InfiniteGrid({ string_map: { 1: '#', 0: '.' } });
+
+		this.parseOpTime = 0;
 	}
 
 	partOne() {
@@ -192,22 +194,14 @@ class TractorBeam {
 			// First, move down until we hit 0
 			do {
 				bottom_edge.y++;
-				let computer = new Computer({
-					memory: this.memory,
-					inputs: [bottom_edge.x, bottom_edge.y],
-				});
-				[output] = computer.run();
+				output = this.computeAt(bottom_edge.x, bottom_edge.y);
 				this.grid.set(bottom_edge.x, bottom_edge.y, output);
 			} while (output === 1);
 
 			// Then, move inward until we hit a `1`
 			do {
 				bottom_edge.x++;
-				let computer = new Computer({
-					memory: this.memory,
-					inputs: [bottom_edge.x, bottom_edge.y],
-				});
-				[output] = computer.run();
+				output = this.computeAt(bottom_edge.x, bottom_edge.y);
 				this.grid.set(bottom_edge.x, bottom_edge.y, output);
 			} while (output === 0);
 		}
@@ -220,11 +214,7 @@ class TractorBeam {
 				do {
 					// Move right until we hit a `0`
 					top_edge.x++;
-					let computer = new Computer({
-						memory: this.memory,
-						inputs: [top_edge.x, top_edge.y],
-					});
-					[output] = computer.run();
+					output = this.computeAt(top_edge.x, top_edge.y);
 					this.grid.set(top_edge.x, top_edge.y, output);
 				} while (output === 1);
 			} while (allow_for_bottom_jumps && top_edge.y !== bottom_edge.y);
@@ -242,6 +232,8 @@ class TractorBeam {
 		// The computer halts after every output, so we create a new one each time
 		let computer = new Computer({ memory: this.memory, inputs: [x, y] });
 		let [output] = computer.run();
+		this.parseOpTime += computer.parseOpTime;
+
 		return output;
 	}
 }