Format files with Prettier

Author: knutkirkhorn

.github/workflows/main.yml

@@ -10,3 +10,4 @@ jobs:
       - uses: oven-sh/setup-bun@v2
       - run: bun install
       - run: bun lint
+      - run: bun format:check

index.js

@@ -1,14 +1,14 @@
 /* eslint-disable unicorn/no-process-exit */
-import zeroFill from 'zero-fill';
-import path from 'node:path';
-import {fileURLToPath} from 'node:url';
 import {fork} from 'node:child_process';
 import fs from 'node:fs/promises';
-import logSymbols from 'log-symbols';
+import path from 'node:path';
+import {fileURLToPath} from 'node:url';
 // eslint-disable-next-line import/no-unresolved
 import got from 'got';
-import {CookieJar} from 'tough-cookie';
+import logSymbols from 'log-symbols';
 import makeDir from 'make-dir';
+import {CookieJar} from 'tough-cookie';
+import zeroFill from 'zero-fill';
 import config from './config.js';
 
 async function fileExists(filePath) {
@@ -24,7 +24,10 @@ async function downloadInputFile(year, dayNumber, inputFilePath) {
 	const unpaddedDayNumber = Number(dayNumber);
 	const inputUrl = `https://adventofcode.com/${year}/day/${unpaddedDayNumber}/input`;
 	const cookieJar = new CookieJar();
-	await cookieJar.setCookie(`session=${config.cookieSession}`, 'https://adventofcode.com');
+	await cookieJar.setCookie(
+		`session=${config.cookieSession}`,
+		'https://adventofcode.com',
+	);
 	const {body: inputContent} = await got(inputUrl, {cookieJar});
 
 	// Save input file
@@ -50,12 +53,10 @@ async function checkAndCreateDayDirectories(dayDirectoryPath) {
 	console.log(logSymbols.success, 'Created day directory');
 }
 
-const yearInput = process.argv.length > 3
-	? process.argv[2]
-	: new Date().getFullYear();
-let dayNumberInput = process.argv.length > 3
-	? process.argv[3]
-	: process.argv[2];
+const yearInput =
+	process.argv.length > 3 ? process.argv[2] : new Date().getFullYear();
+let dayNumberInput =
+	process.argv.length > 3 ? process.argv[3] : process.argv[2];
 const today = new Date();
 const isWithinDecember = today.getMonth() === 11 && today.getDate() <= 25;
 
@@ -91,11 +92,20 @@ await checkAndCreateDayDirectories(dayDirectoryPath);
 const dayFileExists = await fileExists(dayFilePath);
 
 if (!dayFileExists) {
-	console.error(logSymbols.error, `File \`./solutions/${yearInput}/${dayNumber}/${dayNumber}.js\` does not exist`);
+	console.error(
+		logSymbols.error,
+		`File \`./solutions/${yearInput}/${dayNumber}/${dayNumber}.js\` does not exist`,
+	);
 	console.log('Creating day file...');
-	const dayTemplateContent = await fs.readFile(path.join(directoryPath, 'template.js'), 'utf8');
+	const dayTemplateContent = await fs.readFile(
+		path.join(directoryPath, 'template.js'),
+		'utf8',
+	);
 	await fs.writeFile(dayFilePath, dayTemplateContent);
-	console.log(logSymbols.success, `Created day file (\`./solutions/${yearInput}/${dayNumber}/${dayNumber}.js\`)`);
+	console.log(
+		logSymbols.success,
+		`Created day file (\`./solutions/${yearInput}/${dayNumber}/${dayNumber}.js\`)`,
+	);
 }
 
 const inputFileExists = await fileExists(dayInputFilePath);

package.json

@@ -7,6 +7,7 @@
 	"scripts": {
 		"test": "echo \"Error: no test specified\" && exit 1",
 		"lint": "eslint .",
+		"format:check": "prettier . --check",
 		"dev": "nodemon -e js,txt index.js"
 	},
 	"repository": {

prettier.config.js

@@ -0,0 +1,21 @@
+/** @type {import("prettier").Config} */
+export default {
+	arrowParens: 'avoid',
+	bracketSpacing: false,
+	semi: true,
+	singleQuote: true,
+	quoteProps: 'as-needed',
+	trailingComma: 'all',
+	printWidth: 80,
+	useTabs: true,
+	overrides: [
+		{
+			files: '*.yaml',
+			options: {
+				useTabs: false,
+				tabWidth: 2,
+			},
+		},
+	],
+	plugins: ['@ianvs/prettier-plugin-sort-imports'],
+};

solutions/2021/01/01.js

@@ -5,10 +5,7 @@ import {readInput, sum} from '../../../util.js';
 const directoryPath = path.dirname(fileURLToPath(import.meta.url));
 const input = await readInput(directoryPath);
 
-const measurements = input
-	.trim()
-	.split('\n')
-	.map(Number);
+const measurements = input.trim().split('\n').map(Number);
 
 let measurementIncreases = 0;
 
@@ -20,7 +17,10 @@ for (const [index, measurement] of measurements.entries()) {
 	}
 }
 
-console.log('Measurements larger than the previous measurement:', measurementIncreases);
+console.log(
+	'Measurements larger than the previous measurement:',
+	measurementIncreases,
+);
 
 let slidingMeasurementIncreases = 0;
 
@@ -35,4 +35,7 @@ for (let index = 1; index < measurements.length; index++) {
 	}
 }
 
-console.log('Sliding measurements larger than previous measurement:', slidingMeasurementIncreases);
+console.log(
+	'Sliding measurements larger than previous measurement:',
+	slidingMeasurementIncreases,
+);

solutions/2022/02/02.js

@@ -41,9 +41,12 @@ function calculateScoreRoundOne(round) {
 	return outcomeScore + shapeScore;
 }
 
-const scoreOne = sum(fileContent.split('\n')
-	.filter(line => line !== '')
-	.map(round => calculateScoreRoundOne(round)));
+const scoreOne = sum(
+	fileContent
+		.split('\n')
+		.filter(line => line !== '')
+		.map(round => calculateScoreRoundOne(round)),
+);
 console.log('Score round 1:', scoreOne);
 
 const outcomeDifference = {
@@ -67,7 +70,10 @@ function calculateScoreRoundTwo(round) {
 	return outcomeScore + shapeScore;
 }
 
-const scoreTwo = sum(fileContent.split('\n')
-	.filter(line => line !== '')
-	.map(round => calculateScoreRoundTwo(round)));
+const scoreTwo = sum(
+	fileContent
+		.split('\n')
+		.filter(line => line !== '')
+		.map(round => calculateScoreRoundTwo(round)),
+);
 console.log('Score round 2:', scoreTwo);

solutions/2022/03/03.js

@@ -14,9 +14,15 @@ function convertCharToPriority(char) {
 }
 
 const priorities = rucksackContents.map(rucksackContent => {
-	const firstHalf = rucksackContent.slice(0, rucksackContent.length / 2).split('');
-	const secondHalf = rucksackContent.slice(rucksackContent.length / 2, rucksackContent.length).split('');
-	const commonItemType = firstHalf.find(itemType => secondHalf.includes(itemType));
+	const firstHalf = rucksackContent
+		.slice(0, rucksackContent.length / 2)
+		.split('');
+	const secondHalf = rucksackContent
+		.slice(rucksackContent.length / 2, rucksackContent.length)
+		.split('');
+	const commonItemType = firstHalf.find(itemType =>
+		secondHalf.includes(itemType),
+	);
 	const itemPriority = convertCharToPriority(commonItemType);
 	return itemPriority;
 });

solutions/2022/04/04.js

@@ -8,13 +8,19 @@ const fileContent = await readInput(directoryPath);
 const pairs = fileContent
 	.split('\n')
 	.filter(line => line !== '')
-	.map(pair => pair.split(',').map(sections => sections.split('-').map(Number)));
-const fullyContainingAssignmentPairs = pairs.filter(pair => (
-	(pair[0][0] >= pair[1][0] && pair[0][1] <= pair[1][1])
-	|| (pair[0][0] <= pair[1][0] && pair[0][1] >= pair[1][1])
-)).length;
+	.map(pair =>
+		pair.split(',').map(sections => sections.split('-').map(Number)),
+	);
+const fullyContainingAssignmentPairs = pairs.filter(
+	pair =>
+		(pair[0][0] >= pair[1][0] && pair[0][1] <= pair[1][1]) ||
+		(pair[0][0] <= pair[1][0] && pair[0][1] >= pair[1][1]),
+).length;
 
-console.log('Fully containing assignment pairs:', fullyContainingAssignmentPairs);
+console.log(
+	'Fully containing assignment pairs:',
+	fullyContainingAssignmentPairs,
+);
 
 function rangeToArray(range) {
 	const array = [];
@@ -29,6 +35,12 @@ function rangeToArray(range) {
 const partlyContainingAssignmentPairs = pairs.filter(pair => {
 	const firstRange = rangeToArray(pair[0]);
 	const secondRange = rangeToArray(pair[1]);
-	return firstRange.find(item => secondRange.includes(item)) || secondRange.find(item => firstRange.includes(item));
+	return (
+		firstRange.find(item => secondRange.includes(item)) ||
+		secondRange.find(item => firstRange.includes(item))
+	);
 }).length;
-console.log('Partly containing assignment pairs:', partlyContainingAssignmentPairs);
+console.log(
+	'Partly containing assignment pairs:',
+	partlyContainingAssignmentPairs,
+);

solutions/2022/05/05.js

@@ -37,7 +37,9 @@ for (const rearrangement of rearrangements) {
 	}
 }
 
-const rearrangedTopCrates = Object.values(arrangedStacks).map(stack => stack.at(-1)).join('');
+const rearrangedTopCrates = Object.values(arrangedStacks)
+	.map(stack => stack.at(-1))
+	.join('');
 console.log('Rearranged top crates:', rearrangedTopCrates);
 
 const multipleArrangedStacks = {};
@@ -47,7 +49,8 @@ for (const stack of stacks.slice(1)) {
 		if (stack[i] === ' ') continue;
 
 		// Create array if not set already
-		if (multipleArrangedStacks[counter] === undefined) multipleArrangedStacks[counter] = [];
+		if (multipleArrangedStacks[counter] === undefined)
+			multipleArrangedStacks[counter] = [];
 
 		multipleArrangedStacks[counter].push(stack[i]);
 	}
@@ -58,10 +61,18 @@ for (const rearrangement of rearrangements) {
 	const from = rearrangement.split('from ')[1].split(' ')[0];
 	const to = rearrangement.split('to ')[1].split(' ')[0];
 
-	const movingElements = multipleArrangedStacks[from].slice(multipleArrangedStacks[from].length - amount, multipleArrangedStacks[from].length);
+	const movingElements = multipleArrangedStacks[from].slice(
+		multipleArrangedStacks[from].length - amount,
+		multipleArrangedStacks[from].length,
+	);
 	multipleArrangedStacks[to].push(...movingElements);
-	multipleArrangedStacks[from].splice(multipleArrangedStacks[from].length - amount, multipleArrangedStacks[from].length);
+	multipleArrangedStacks[from].splice(
+		multipleArrangedStacks[from].length - amount,
+		multipleArrangedStacks[from].length,
+	);
 }
 
-const multipleRearrangedTopCrates = Object.values(multipleArrangedStacks).map(stack => stack.at(-1)).join('');
+const multipleRearrangedTopCrates = Object.values(multipleArrangedStacks)
+	.map(stack => stack.at(-1))
+	.join('');
 console.log('Multiple rearranged top crates:', multipleRearrangedTopCrates);

solutions/2022/06/06.js

@@ -14,7 +14,9 @@ function findDistinctCharactersPosition(numberOfDistinctCharacters) {
 		const currentCharacter = input[index];
 
 		if (distinctCharacters.includes(currentCharacter)) {
-			distinctCharacters = distinctCharacters.slice(distinctCharacters.indexOf(currentCharacter) + 1);
+			distinctCharacters = distinctCharacters.slice(
+				distinctCharacters.indexOf(currentCharacter) + 1,
+			);
 		}
 
 		distinctCharacters.push(currentCharacter);

solutions/2022/07/07.js

@@ -6,9 +6,7 @@ import {readInput, sum} from '../../../util.js';
 const directoryPath = path.dirname(fileURLToPath(import.meta.url));
 const input = await readInput(directoryPath);
 
-const lines = input
-	.split('\n')
-	.filter(line => line !== '');
+const lines = input.split('\n').filter(line => line !== '');
 
 function updateDeep(currentObject, line, currentDirectoryPath) {
 	if (currentDirectoryPath.length === 1) {
@@ -78,14 +76,21 @@ function sumDirectory(directory, parent) {
 }
 
 const usedSpace = sumDirectory(fileSystem['/'], '/');
-console.log('Sum of directories below 100k size:', sum(directoriesMost100k.map(directory => directory.size)));
+console.log(
+	'Sum of directories below 100k size:',
+	sum(directoriesMost100k.map(directory => directory.size)),
+);
 
 const totalSpace = 70_000_000;
 const minimumAvailableSpace = 30_000_000;
 const availableSpace = totalSpace - usedSpace;
 const neededSpace = minimumAvailableSpace - availableSpace;
-const sortedSummedDirectories = directoriesWithSummedSizes.sort((a, b) => b.size - a.size);
+const sortedSummedDirectories = directoriesWithSummedSizes.sort(
+	(a, b) => b.size - a.size,
+);
 
 // Smallest directory with needed space
-const directoryToDelete = sortedSummedDirectories.reverse().find(directory => directory.size >= neededSpace);
+const directoryToDelete = sortedSummedDirectories
+	.reverse()
+	.find(directory => directory.size >= neededSpace);
 console.log('Directory to delete:', directoryToDelete);

solutions/2022/08/08.js

@@ -12,7 +12,7 @@ const treeGrid = input
 	.map(line => [...line]);
 
 // Set initial to all trees at the edge
-let visibleTrees = (treeGrid.length * 2) + ((treeGrid[0].length * 2) - 4);
+let visibleTrees = treeGrid.length * 2 + (treeGrid[0].length * 2 - 4);
 
 function isVisibleOnLeftSide(treeHeight, xPosition, yPosition) {
 	for (let x = xPosition - 1; x >= 0; x--) {
@@ -49,10 +49,11 @@ function isVisibleOnBottom(treeHeight, xPosition, yPosition) {
 for (let i = 1; i < treeGrid.length - 1; i++) {
 	for (let j = 1; j < treeGrid[i].length - 1; j++) {
 		const currentTree = Number(treeGrid[i][j]);
-		const isCurrentTreeVisible = isVisibleOnLeftSide(currentTree, j, i)
-			|| isVisibleOnRightSide(currentTree, j, i)
-			|| isVisibleOnTop(currentTree, j, i)
-			|| isVisibleOnBottom(currentTree, j, i);
+		const isCurrentTreeVisible =
+			isVisibleOnLeftSide(currentTree, j, i) ||
+			isVisibleOnRightSide(currentTree, j, i) ||
+			isVisibleOnTop(currentTree, j, i) ||
+			isVisibleOnBottom(currentTree, j, i);
 
 		if (isCurrentTreeVisible) visibleTrees++;
 	}
@@ -114,14 +115,17 @@ for (let i = 1; i < treeGrid.length - 1; i++) {
 	for (let j = 1; j < treeGrid[i].length - 1; j++) {
 		const currentTree = Number(treeGrid[i][j]);
 
-		const scenicScore = findLeftScenicScore(currentTree, j, i)
-			* findRightScenicScore(currentTree, j, i)
-			* findTopScenicScore(currentTree, j, i)
-			* findBottomScenicScore(currentTree, j, i);
+		const scenicScore =
+			findLeftScenicScore(currentTree, j, i) *
+			findRightScenicScore(currentTree, j, i) *
+			findTopScenicScore(currentTree, j, i) *
+			findBottomScenicScore(currentTree, j, i);
 
 		scenicScores.push({currentTree, scenicScore});
 	}
 }
 
-const sortedScenicScores = scenicScores.sort((a, b) => b.scenicScore - a.scenicScore);
+const sortedScenicScores = scenicScores.sort(
+	(a, b) => b.scenicScore - a.scenicScore,
+);
 console.log('Highest scenic score:', sortedScenicScores[0]);

solutions/2022/09/09.js

@@ -110,7 +110,10 @@ function simulateMovements() {
 
 simulateMovements();
 
-console.log('Distinct positions tail visited:', tailVisitedPositions.at(-1).size);
+console.log(
+	'Distinct positions tail visited:',
+	tailVisitedPositions.at(-1).size,
+);
 
 // Reset tails and visited positions
 head.x = 0;
@@ -126,4 +129,7 @@ for (let index = 0; index < 9; index++) {
 
 simulateMovements();
 
-console.log('Distinct positions tail #9 visited:', tailVisitedPositions.at(-1).size);
+console.log(
+	'Distinct positions tail #9 visited:',
+	tailVisitedPositions.at(-1).size,
+);