extract utils

2022/03/solution.ts

@@ -1,9 +1,10 @@
+import { intersection } from '@magiczne/advent-of-code-ts-core/array'
+import { isUpperCase } from '@magiczne/advent-of-code-ts-core/string'
 import { readFileSync } from 'node:fs'
 import { resolve } from 'node:path'
 import { fileURLToPath } from 'node:url'
 import { cluster, unique } from 'radash'
-import { intersection, solutionExample, solutionPart1, solutionPart2 } from '../util'
-import { isUpperCase } from '@magiczne/advent-of-code-ts-core/string'
+import { solutionExample, solutionPart1, solutionPart2 } from '../util'
 
 type Rucksack = [Array<string>, Array<string>]
 
@@ -13,7 +14,7 @@ const getRucksacks = (file: string): Array<string> => {
   return readFileSync(resolve(__dirname, file)).toString().trim().split('\n')
 }
 
-const calculatePriorities = (itemTypes: Array<Array<string>>): number => {
+const calculatePriorities = (itemTypes: ReadonlyArray<ReadonlyArray<string>>): number => {
   return itemTypes
     .map((intersection, index) => {
       const noDuplicates = unique(intersection)

2022/05/solution.ts

@@ -1,10 +1,10 @@
+import { isUpperCaseLetter } from '@magiczne/advent-of-code-ts-core/string'
 import { readFileSync } from 'node:fs'
 import { resolve } from 'node:path'
 import { fileURLToPath } from 'node:url'
 import { cluster, last } from 'radash'
 import { transpose } from 'ramda'
 import { solutionExample, solutionPart1, solutionPart2 } from '../util'
-import { isUpperCaseLetter } from '@magiczne/advent-of-code-ts-core/string'
 
 type Stack = Array<Uppercase<string>>
 type Stacks = Record<number, Stack>

2022/14/solution.ts

@@ -1,8 +1,9 @@
+import { windows } from '@magiczne/advent-of-code-ts-core/array'
 import { readFileSync } from 'node:fs'
 import { resolve } from 'node:path'
 import { fileURLToPath } from 'node:url'
 import { range, xprod } from 'ramda'
-import { solutionExample, solutionPart1, solutionPart2, windows } from '../util'
+import { solutionExample, solutionPart1, solutionPart2 } from '../util'
 
 type Point = { x: number; y: number }
 type Cell = '.' | '#' | 'o'

2022/20/solution.ts

@@ -1,7 +1,8 @@
+import { CircularLinkedList, LinkedListNode } from '@magiczne/advent-of-code-ts-core/structures'
 import { readFileSync } from 'node:fs'
 import { resolve } from 'node:path'
 import { fileURLToPath } from 'node:url'
-import { CircularLinkedList, LinkedListNode, solutionExample, solutionPart1, solutionPart2 } from '../util'
+import { solutionExample, solutionPart1, solutionPart2 } from '../util'
 
 const __dirname = fileURLToPath(new URL('.', import.meta.url))
 const part2DecryptionKey = 811589153

2022/21/solution.ts

@@ -107,7 +107,7 @@ const getHumanValue = (file: string): number => {
   delete monkeys['humn']
 
   const dependent = Object.values(monkeys).find(monkey => monkey.dependsOn.includes('humn'))!
-  
+
   // @ts-expect-error
   const operation = getInverseOperation(dependent.dependsOn, dependent.operator!)
 

2022/util/index.ts

@@ -1,3 +1 @@
-export * from './array'
-export * from './linked-list'
-export * from './output'
+export * from './output'

2023/01/solution.ts

@@ -1,9 +1,9 @@
+import { isNumeric } from '@magiczne/advent-of-code-ts-core/string'
 import { readFileSync } from 'node:fs'
 import { resolve } from 'node:path'
 import { fileURLToPath } from 'node:url'
 import { first, last } from 'radash'
 import { solutionExample, solutionPart1, solutionPart2 } from '../util/index.ts'
-import { isNumeric } from '@magiczne/advent-of-code-ts-core/string'
 
 const __dirname = fileURLToPath(new URL('.', import.meta.url))
 

2023/03/schematic.ts

@@ -1,5 +1,5 @@
-import { range } from 'radash'
 import { isNumeric } from '@magiczne/advent-of-code-ts-core/string'
+import { range } from 'radash'
 
 interface Point {
   x: number

2023/04/card.ts

@@ -1,5 +1,5 @@
+import { intersection } from '@magiczne/advent-of-code-ts-core/array'
 import { range } from 'ramda'
-import { intersection } from '../util/index.ts'
 
 class Card {
   private readonly matchedNumbers: ReadonlyArray<number>

2023/05/almanac.ts

@@ -1,5 +1,5 @@
+import { Range } from '@magiczne/advent-of-code-ts-core/structures'
 import { first, last, unique } from 'radash'
-import { Range } from '../util/range.ts'
 
 const enum Category {
   Seed = 'seed',

2023/05/solution.ts

@@ -1,8 +1,8 @@
+import { Range } from '@magiczne/advent-of-code-ts-core/structures'
 import { readFileSync } from 'node:fs'
 import { resolve } from 'node:path'
 import { fileURLToPath } from 'node:url'
 import { solutionExample, solutionPart1, solutionPart2 } from '../util/index.ts'
-import { Range } from '../util/range.ts'
 import { Almanac, AlmanacMap, AlmanacMapRange, Category } from './almanac.ts'
 
 const __dirname = fileURLToPath(new URL('.', import.meta.url))

2023/08/solution.ts

@@ -1,9 +1,9 @@
+import { leastCommonMultiple } from '@magiczne/advent-of-code-ts-core/number'
+import { Tree, TreeNode } from '@magiczne/advent-of-code-ts-core/structures'
 import { readFileSync } from 'node:fs'
 import { resolve } from 'node:path'
 import { fileURLToPath } from 'node:url'
 import { solutionExample, solutionPart1, solutionPart2 } from '../util/index.ts'
-import { leastCommonMultiple } from '../util/number.ts'
-import { Tree, TreeNode } from '../util/tree.ts'
 
 const __dirname = fileURLToPath(new URL('.', import.meta.url))
 

2023/util/index.ts

@@ -1,3 +1 @@
-export * from './array.ts'
-export * from './linked-list.ts'
 export * from './output.ts'

ts-core/array/adjacent-diff.ts

@@ -1,7 +1,7 @@
 /**
- * Use with Array.map to get difference between adjacent items
+ * Difference between adjacent array items
  *
- * e.g:    [7, 6, 4, 2, 1].map(adjacentDiff)
+ * e.g:    adjacentDiff([7, 6, 4, 2, 1])
  * returns [1, 2, 2, 1]
  */
 const adjacentDiff = (line: ReadonlyArray<number>): ReadonlyArray<number> => {

ts-core/array/cycle.ts

@@ -0,0 +1,7 @@
+function* cycle<T>(array: ReadonlyArray<T>): Generator<T, void, undefined> {
+  while (true) {
+    yield* array
+  }
+}
+
+export { cycle }

ts-core/array/index.ts

@@ -1 +1,4 @@
-export * from './adjacent-diff'
+export { adjacentDiff } from './adjacent-diff'
+export { cycle } from './cycle'
+export { intersection } from './intersection'
+export { windows } from './windows'

ts-core/array/intersection.ts

@@ -0,0 +1,7 @@
+const intersection = <T>(array1: ReadonlyArray<T>, array2: ReadonlyArray<T>): ReadonlyArray<T> => {
+  return array1.filter(value => {
+    return array2.includes(value)
+  })
+}
+
+export { intersection }

ts-core/array/windows.ts

@@ -0,0 +1,13 @@
+const windows = <T>(array: ReadonlyArray<T>, windowLength: number): ReadonlyArray<ReadonlyArray<T>> => {
+  return array
+    .map((_, index) => {
+      if (index <= array.length - windowLength) {
+        return array.slice(index, index + windowLength)
+      }
+
+      return []
+    })
+    .filter(window => window.length > 0)
+}
+
+export { windows }

ts-core/number/greatest-common-denominator.ts

@@ -0,0 +1,5 @@
+const greatestCommonDenominator = (a: number, b: number): number => {
+  return a % b === 0 ? b : greatestCommonDenominator(b, a % b)
+}
+
+export { greatestCommonDenominator }

ts-core/number/index.ts

@@ -0,0 +1,2 @@
+export { greatestCommonDenominator } from './greatest-common-denominator'
+export { leastCommonMultiple } from './least-common-multiple'

ts-core/number/least-common-multiple.ts

@@ -0,0 +1,9 @@
+import { greatestCommonDenominator } from './greatest-common-denominator'
+
+const leastCommonMultiple = (numbers: ReadonlyArray<number>): number => {
+  return numbers.reduce((lhs, rhs) => {
+    return (lhs * rhs) / greatestCommonDenominator(lhs, rhs)
+  })
+}
+
+export { leastCommonMultiple } 

ts-core/structures/index.ts

@@ -0,0 +1,4 @@
+export { DirectedGraph } from './directed-graph'
+export { CircularLinkedList, LinkedList, LinkedListNode } from './linked-list'
+export { Range } from './range'
+export { Tree, TreeNode } from './tree'

2023/util/tree.ts → ts-core/structures/tree.ts

@@ -1,4 +1,4 @@
-import { cycle } from './array.ts'
+import { cycle } from '../array/cycle'
 
 class TreeNode<T> {
   constructor(