Run pre-commit hooks on existing files

Author: sanderploegsma

.gitattributes

@@ -7,4 +7,4 @@
 # These are Windows script files and should use crlf
 *.bat           text eol=crlf
 
-*               text=auto
+*               text=auto

2015/.gitignore

@@ -2,4 +2,4 @@ bin/
 obj/
 out/
 
-*.DotSettings*
+*.DotSettings*

2015/fsharp/Day01/Program.fs

@@ -9,7 +9,7 @@ let partOne =
     >> Seq.sum
 
 let partTwo input =
-    let (pos, _) = 
+    let (pos, _) =
         input
         |> Seq.map parse
         |> Seq.indexed
@@ -19,7 +19,7 @@ let partTwo input =
 [<EntryPoint>]
 let main argv =
     let input = File.ReadAllText("Input.txt")
-        
+
     partOne input |> printfn "Part one: %d"
     partTwo input |> printfn "Part two: %d"
     0

2015/fsharp/Day02/Program.fs

@@ -10,7 +10,7 @@ let calcSurfaceArea (l, w, h) =
     let sides = [l*w; w*h; h*l]
     List.sumBy (fun side -> side * 2) sides + List.min sides
 
-let calcRibbonLength (l, w, h) = 
+let calcRibbonLength (l, w, h) =
     let sides = [l; w; h]
     let ribbon = List.sort sides |> List.take 2 |> List.sumBy (fun side -> side * 2)
     let bow = List.fold (*) 1 sides
@@ -21,11 +21,11 @@ let partTwo = List.sumBy calcRibbonLength
 
 [<EntryPoint>]
 let main argv =
-    let input = 
+    let input =
         File.ReadLines("Input.txt")
         |> Seq.map parse
         |> Seq.toList
-        
+
     partOne input |> printfn "Part one: %d"
     partTwo input |> printfn "Part two: %d"
     0

2015/fsharp/Day03/Program.fs

@@ -5,14 +5,14 @@ open System.IO
 type Direction = North | East | South | West
 
 let parse c =
-    match c with 
+    match c with
     | '^' -> North
     | '>' -> East
     | 'v' -> South
     | '<' -> West
 
 let nextPosition direction (x, y) =
-    match direction with 
+    match direction with
     | North -> (x, y + 1)
     | East -> (x + 1, y)
     | South -> (x, y - 1)
@@ -41,7 +41,7 @@ let partTwo directions =
 [<EntryPoint>]
 let main argv =
     let input = File.ReadAllText("Input.txt") |> Seq.map parse |> Seq.toList
-        
+
     partOne input |> printfn "Part one: %d"
     partTwo input |> printfn "Part two: %d"
     0

2015/fsharp/Day04/Program.fs

@@ -13,7 +13,7 @@ let hash (input: string): string =
 
 let findHashMatching (pred: string -> bool) (input: string) =
     let toHash num = hash (input + num.ToString())
-    
+
     Seq.initInfinite id
     |> Seq.find (fun num -> pred (toHash num))
 
@@ -23,7 +23,7 @@ let partTwo = findHashMatching (fun h -> h.StartsWith("000000"))
 [<EntryPoint>]
 let main argv =
     let input = "bgvyzdsv"
-        
+
     partOne input |> printfn "Part one: %d"
     partTwo input |> printfn "Part two: %d"
     0

2015/fsharp/Day05/Program.fs

@@ -5,13 +5,13 @@ open System.IO
 
 let isNice (input: string) =
     // It contains at least three vowels (aeiou only), like aei, xazegov, or aeiouaeiouaeiou.
-    let rule1 = 
+    let rule1 =
         let vowels = ['a';'e';'i';'o';'u']
         Seq.filter (fun c -> List.contains c vowels) input |> Seq.length >= 3
-    
+
     // It contains at least one letter that appears twice in a row, like xx, abcdde (dd), or aabbccdd (aa, bb, cc, or dd).
     let rule2 = input |> Seq.pairwise |> Seq.exists (fun (a, b) -> a = b)
-    
+
     // It does not contain the strings ab, cd, pq, or xy, even if they are part of one of the other requirements.
     let rule3 =
         ["ab";"cd";"pq";"xy"]
@@ -30,22 +30,22 @@ let isNice2 (input: string) =
         |> Seq.length > 0
 
     // It contains at least one letter which repeats with exactly one letter between them, like xyx, abcdefeghi (efe), or even aaa.
-    let rule2 = 
-        Seq.windowed 3 input 
-        |> Seq.map Seq.toArray 
+    let rule2 =
+        Seq.windowed 3 input
+        |> Seq.map Seq.toArray
         |> Seq.exists (fun chars -> chars.[0] = chars.[2])
-    
+
     [rule1; rule2] |> List.forall id
 
 let partOne = List.filter isNice >> List.length
 let partTwo = List.filter isNice2 >> List.length
 
 [<EntryPoint>]
 let main argv =
-    let input = 
-        File.ReadLines("Input.txt") 
+    let input =
+        File.ReadLines("Input.txt")
         |> Seq.toList
-        
+
     partOne input |> printfn "Part one: %d"
     partTwo input |> printfn "Part two: %d"
     0

2015/fsharp/Day06/Program.fs

@@ -17,11 +17,11 @@ let (|Regex|_|) pattern input =
 
 let parse line =
     match line with
-    | Regex @"turn on (\d+),(\d+) through (\d+),(\d+)" [x1; y1; x2; y2] -> 
+    | Regex @"turn on (\d+),(\d+) through (\d+),(\d+)" [x1; y1; x2; y2] ->
         TurnOn ((int x1, int y1), (int x2, int y2))
-    | Regex @"turn off (\d+),(\d+) through (\d+),(\d+)" [x1; y1; x2; y2] -> 
+    | Regex @"turn off (\d+),(\d+) through (\d+),(\d+)" [x1; y1; x2; y2] ->
         TurnOff ((int x1, int y1), (int x2, int y2))
-    | Regex @"toggle (\d+),(\d+) through (\d+),(\d+)" [x1; y1; x2; y2] -> 
+    | Regex @"toggle (\d+),(\d+) through (\d+),(\d+)" [x1; y1; x2; y2] ->
         Toggle ((int x1, int y1), (int x2, int y2))
 
 let solve input turnOn turnOff toggle =
@@ -57,11 +57,11 @@ let partTwo input =
 
 [<EntryPoint>]
 let main argv =
-    let input = 
-        File.ReadLines("Input.txt") 
+    let input =
+        File.ReadLines("Input.txt")
         |> Seq.map parse
         |> Seq.toList
-        
+
     partOne input |> printfn "Part one: %d"
     partTwo input |> printfn "Part two: %d"
     0

2015/fsharp/Day07/Program.fs

@@ -23,7 +23,7 @@ let (|Regex|_|) pattern input =
 
 let parse (line: string) =
     let parseGate gate =
-        match gate with 
+        match gate with
         | Regex @"^([a-z]+)$" [a] -> Signal a
         | Regex @"^(\d+)$" [a] -> SignalValue (int16 a)
         | Regex @"^([a-z]+) OR ([a-z]+)$" [a; b] -> Or (a, b)
@@ -51,21 +51,21 @@ let rec resolve identifier gates (cache: byref<Map<string, int16>>) =
             | LeftShift (a, shift) -> (resolve a gates &cache) <<< shift
             | RightShift (a, shift) -> (resolve a gates &cache) >>> shift
             | Not a -> ~~~ (resolve a gates &cache)
-        
-        cache <- cache.Add(identifier, value) 
+
+        cache <- cache.Add(identifier, value)
         value
 
-let solve input = 
+let solve input =
     let mutable cache = Map.empty
     resolve "a" input &cache
 
 [<EntryPoint>]
 let main argv =
-    let input = 
+    let input =
         File.ReadLines("Input.txt")
         |> Seq.map parse
         |> Seq.toList
-        
+
     let signalA = solve input
     signalA |> printfn "Part one: %d"
 

2015/kotlin/src/main/kotlin/nl/sanderp/aoc/aoc2015/day11/Day11.kt

@@ -40,4 +40,4 @@ fun main() {
     val next = findNextPassword(input)
     println("Part one: $next")
     println("Part two: ${findNextPassword(next)}")
-}
+}

2015/kotlin/src/main/kotlin/nl/sanderp/aoc/aoc2015/day13/Day13.kt

@@ -92,4 +92,4 @@ fun happiness(seating: List<String>) =
 fun main() {
     println("Part one: ${preferences.keys.toList().permutations().maxOf { happiness(it) }}")
     println("Part two: ${preferences.keys.toList().plus("Sander").permutations().maxOf { happiness(it) }}")
-}
+}

2015/kotlin/src/main/kotlin/nl/sanderp/aoc/aoc2015/day16/Day16.kt

@@ -48,4 +48,4 @@ fun main() {
     }
 
     println("Part two: ${secondMatch.index + 1}")
-}
+}

2015/kotlin/src/main/kotlin/nl/sanderp/aoc/common/Digits.kt

@@ -4,4 +4,4 @@ import kotlin.math.abs
 
 fun Char.asDigit(): Int = code - '0'.code
 
-fun Int.toDigits() = abs(this).toString().map { it.asDigit() }
+fun Int.toDigits() = abs(this).toString().map { it.asDigit() }

2015/kotlin/src/main/kotlin/nl/sanderp/aoc/common/Duration.kt

@@ -41,4 +41,4 @@ fun Duration.prettyPrint(): String {
     )
 
     return parts.filter { it.first > 0 }.joinToString(" ") { it.first.toString() + it.second }
-}
+}

2015/kotlin/src/main/kotlin/nl/sanderp/aoc/common/Navigation.kt

@@ -19,4 +19,4 @@ fun Point2D.move(direction: Direction, steps: Int = 1) = when (direction) {
     Direction.East -> x + steps to y
     Direction.South -> x to y - steps
     Direction.West -> x - steps to y
-}
+}

2015/kotlin/src/main/kotlin/nl/sanderp/aoc/common/Resources.kt

@@ -10,4 +10,4 @@ internal object Resources
  * @return the contents of the resource
  */
 fun readResource(fileName: String) = Resources.javaClass.getResource("/$fileName")?.readText()?.trim()
-    ?: throw IOException("File does not exist: $fileName")
+    ?: throw IOException("File does not exist: $fileName")

2015/kotlin/src/test/kotlin/nl/sanderp/aoc/aoc2015/Day11Test.kt

@@ -22,4 +22,4 @@ class Day11Test {
     fun `increment password`() = mapOf("a" to "b", "aa" to "ab", "az" to "ba").map {
         DynamicTest.dynamicTest("${it.key} -> ${it.value}") { increment(it.key) `should be equal to` it.value }
     }
-}
+}

2015/kotlin/src/test/kotlin/nl/sanderp/aoc/common/DigitsTest.kt

@@ -20,4 +20,4 @@ class DigitsTest {
     fun `Retrieving digits of a negative number`() {
         (-123).toDigits() `should be equal to` listOf(1, 2, 3)
     }
-}
+}

2015/kotlin/src/test/kotlin/nl/sanderp/aoc/common/DurationFormattingTest.kt

@@ -29,4 +29,4 @@ class DurationFormattingTest {
 
         duration.prettyPrint() `should be equal to` "4m 2s"
     }
-}
+}

2015/kotlin/src/test/kotlin/nl/sanderp/aoc/common/DurationMeasurementTest.kt

@@ -28,4 +28,4 @@ class DurationMeasurementTest {
 
         duration.toMillis() `should be in range` 1000L..2000L
     }
-}
+}

2015/kotlin/src/test/kotlin/nl/sanderp/aoc/common/ListCombinationsTest.kt

@@ -76,4 +76,4 @@ class ListCombinationsTest {
 
         allTriples(ones, twos, threes) shouldContain randomCombination
     }
-}
+}

2015/kotlin/src/test/kotlin/nl/sanderp/aoc/common/ListPermutationsTest.kt

@@ -26,4 +26,4 @@ class ListPermutationsTest {
 
         actual `should contain` items.shuffled()
     }
-}
+}

2015/kotlin/src/test/kotlin/nl/sanderp/aoc/common/NavigationTest.kt

@@ -14,4 +14,4 @@ class NavigationTest {
 
         finish `should be equal to` Point2D(2, 4)
     }
-}
+}

2015/kotlin/src/test/kotlin/nl/sanderp/aoc/common/Point2DTest.kt

@@ -62,4 +62,4 @@ class Point2DTest {
     fun `manhattan distance between points`() {
         Point2D(2, -3).manhattanTo(Point2D(-2, 8)) `should be equal to` 15
     }
-}
+}

2015/kotlin/src/test/kotlin/nl/sanderp/aoc/common/Point3DTest.kt

@@ -61,4 +61,4 @@ class Point3DTest {
     fun `manhattan distance between points`() {
         Point3D(1, 1, 1).manhattanTo(Point3D(-1, -1, -1)) `should be equal to` 6
     }
-}
+}

2015/kotlin/src/test/kotlin/nl/sanderp/aoc/common/ResourcesTest.kt

@@ -25,4 +25,4 @@ class ResourcesTest {
 
         contents.lines() `should be equal to` listOf("apples", "bananas", "coconuts")
     }
-}
+}

2016/.gitignore

@@ -1,4 +1,4 @@
 bin/
 obj/
 
-*.DotSettings*
+*.DotSettings*

2016/csharp/Day01/Solution.cs

@@ -58,4 +58,4 @@ private static (Rotation, int Steps) ParseInstruction(string instruction)
             return (rotation, steps);
         }
     }
-}
+}

2016/csharp/Day01/Tests.cs

@@ -6,7 +6,7 @@ namespace AdventOfCode2016.Day01
     public class Tests
     {
         private const string InputFile = @"Day01\Input.txt";
-        
+
         [Theory]
         [InlineData("R2, L3", 5)]
         [InlineData("R2, R2, R2", 2)]
@@ -43,4 +43,4 @@ public void PartTwo()
             Assert.Equal(answer, solution.PartTwo());
         }
     }
-}
+}

2016/csharp/Day02/Solution.cs

@@ -18,7 +18,7 @@ [new IntVector(-1, -1)] = '7',
             [new IntVector(0, -1)] = '8',
             [new IntVector(1, -1)] = '9',
         };
-        
+
         private static readonly IDictionary<IntVector, char> Keypad2 = new Dictionary<IntVector, char>
         {
             [new IntVector(0, 2)] = '1',
@@ -35,7 +35,7 @@ [new IntVector(0, -1)] = 'B',
             [new IntVector(1, -1)] = 'C',
             [new IntVector(0, -2)] = 'D',
         };
-        
+
         private readonly IReadOnlyCollection<IEnumerable<Direction>> _instructions;
 
         public Solution(IEnumerable<string> input)
@@ -78,4 +78,4 @@ private static IEnumerable<Direction> ParseInstructions(string instructions) =>
                 _ => throw new ArgumentException($"Unknown instruction {instruction}")
             });
     }
-}
+}