emily/advent-of-code - Change I3IUWAWDYM3GYQ636JURRPXBEX2T6IHDDSFXUZDTCBOONJXHX4DAC

Clean up code a bit

Created by emily on December 7, 2020

I3IUWAWDYM3GYQ636JURRPXBEX2T6IHDDSFXUZDTCBOONJXHX4DAC

Dependencies

In channels

main

Change contents

Replacement in 07.js at line 605 [5.8]

B:BD[4.108] → [4.108:160]

let bag_colors = ["shiny gold"];
let prev_len = -1;

[4.108]

[4.160]

let bagColors = ["shiny gold"];
let prevLen = -1;

Replacement in 07.js at line 609 [5.8]

B:BD[4.204] → [4.204:248]

        if (bag_colors.includes(rule[0])) {

[4.204]

[4.248]

        if (bagColors.includes(rule[0])) {

Replacement in 07.js at line 613 [5.8]

B:BD[4.322] → [4.322:472]

        for (let c of bag_colors) {
            if (allowed.includes(c) && !bag_colors.includes(rule[0])) {
                bag_colors.push(rule[0]);

[4.322]

[4.472]

        for (let c of bagColors) {
            if (allowed.includes(c) && !bagColors.includes(rule[0])) {
                bagColors.push(rule[0]);

Replacement in 07.js at line 619 [5.8]

B:BD[4.502] → [4.502:578]

    if (bag_colors.length == prev_len) {
        console.log(prev_len - 1);

[4.502]

[4.578]

    if (bagColors.length == prevLen) {
        console.log(prevLen - 1);

Replacement in 07.js at line 623 [5.8]
B:BD[4.599] → [4.599:633]
```
    prev_len = bag_colors.length;
```
[4.599]
[4.633]
```
    prevLen = bagColors.length;
```

Replacement in 06.js at line 2229 [3.8]

B:BD[3.23954] → [3.23954:24604]

    let questions = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z'];
    let len = 26;
    for (let person of group) {
        let questions2 = [];
        for (let q of person) {
            if (!questions2.includes(q)) {
                questions2.push(q);
            }
        }
        for (let i = 0; i < questions.length; ++i) {
            if (questions[i] == null) {
                continue;
            }
            let q = questions[i];
            if (!questions2.includes(q)) {
                questions[i] = null;
                --len;
            }

[3.23954]

[3.24604]

    for (let q of group[0]) {
        if (group.every(person => person.includes(q))) {
            ++result;

Deletion in 06.js at line 2234 [3.8]
B:BD[3.24620] → [3.24620:24639]
```
    result += len;
```

Replacement in 03.js at line 326 [2.8]

B:BD[2.11332] → [2.11332:11476]

let trees = 0;
for (let i in input) {
    let row = input[i];
    let cell = row[(i * 3) % row.length];
    if (cell == '#') {
        trees++;

[2.11332]

[2.11476]

function count(x, y) {
    let trees = 0;
    for (let i in input) {
        if (i % y != 0) {
            continue;
        }
        let row = input[i];
        let cell = row[(i / y * x) % row.length];
        if (cell == '#') {
            trees++;
        }

Insertion in 03.js at line 338 [2.8]
[2.11482]
[2.11482]
```
    return trees;
```
Replacement in 03.js at line 340 [2.8]
B:BD[2.11484] → [2.11484:11504]
```
console.log(trees);
```
[2.11484]
[2.11504]
```
console.log(count(3, 1));
```

Replacement in 03.js at line 344 [2.8]

B:BD[2.11526] → [2.11526:12486]

trees = 0;
for (let i in input) {
    let row = input[i];
    let cell = row[i % row.length];
    if (cell == '#') {
        trees++;
    }
}
treeCounts.push(trees);
trees = 0;
for (let i in input) {
    let row = input[i];
    let cell = row[(i * 3) % row.length];
    if (cell == '#') {
        trees++;
    }
}
treeCounts.push(trees);
trees = 0;
for (let i in input) {
    let row = input[i];
    let cell = row[(i * 5) % row.length];
    if (cell == '#') {
        trees++;
    }
}
treeCounts.push(trees);
trees = 0;
for (let i in input) {
    let row = input[i];
    let cell = row[(i * 7) % row.length];
    if (cell == '#') {
        trees++;
    }
}
treeCounts.push(trees);
trees = 0;
for (let i in input) {
    if (i % 2 == 1) {
        continue;
    }
    let row = input[i];
    let cell = row[(i / 2) % row.length];
    if (cell == '#') {
        trees++;
    }
}
treeCounts.push(trees);
console.log(treeCounts.reduce((acc, cur) => acc * cur, 1));

[2.11526]

treeCounts.push(count(1, 1));
treeCounts.push(count(3, 1));
treeCounts.push(count(5, 1));
treeCounts.push(count(7, 1));
treeCounts.push(count(1, 2));
console.log([
    count(1, 1),
    count(3, 1),
    count(5, 1),
    count(7, 1),
    count(1, 2)].reduce((acc, cur) => acc * cur, 1));