adjust line wraps

encse · encse · commit 28c4e2ebae27 · 2022-12-23T16:35:47.000+01:00
diff --git a/2022/Day05/Solution.cs b/2022/Day05/Solution.cs
@@ -34,7 +34,8 @@ string MoveCrates(string input, Action<Move> crateMover)  {
         // process each line by 4 character wide columns
         // last line defines the number of stacks:
         var stacks = stackDefs.Last().Chunk(4).Select(i => new Stack<char>()).ToArray();
-        // bottom-up: push the next element to the the correspoing stack (' ' means no more elements).
+        // bottom-up: push the next element to the the correspoing stack;
+        //            ' ' means no more elements.
         foreach (var line in stackDefs.Reverse().Skip(1)) {
             foreach (var (stack, item) in stacks.Zip(line.Chunk(4))) {
                 // item is ~ "[A] "
diff --git a/2022/Day06/Solution.cs b/2022/Day06/Solution.cs
@@ -9,5 +9,6 @@ class Solution : Solver {
     public object PartOne(string input) => StartOfBlock(input, 4);
     public object PartTwo(string input) => StartOfBlock(input, 14);
     int StartOfBlock(string input, int l) =>
-         Enumerable.Range(l, input.Length).First(i => input.Substring(i-l, l).ToHashSet().Count == l);
+         Enumerable.Range(l, input.Length)
+            .First(i => input.Substring(i-l, l).ToHashSet().Count == l);
 }
diff --git a/2022/Day08/Solution.cs b/2022/Day08/Solution.cs
@@ -46,7 +46,8 @@ from icol in Enumerable.Range(0, ccol)
         select new Tree(items[irow][icol], irow, icol);
 
     public int ViewDistance(Tree tree, Direction dir) =>
-        IsTallest(tree, dir) ? TreesInDirection(tree, dir).Count() : SmallerTrees(tree, dir).Count() + 1;
+        IsTallest(tree, dir) ? TreesInDirection(tree, dir).Count() 
+                             : SmallerTrees(tree, dir).Count() + 1;
 
     public bool IsTallest(Tree tree, Direction dir) =>
         TreesInDirection(tree, dir).All(treeT => treeT.height < tree.height);
diff --git a/2022/Day15/Solution.cs b/2022/Day15/Solution.cs
@@ -36,7 +36,7 @@ public object PartTwo(string input) {
     // Parse the 4 numbers with regex from each line and return the list of pairings
     IEnumerable<Pair> Parse(string input) {
         foreach (var line in input.Split("\n")) {
-            var numbers = Regex.Matches(line, "-?[0-9]+").Select(m => int.Parse(m.Value)).ToArray();
+            var numbers = Regex.Matches(line, @"-?\d+").Select(m => int.Parse(m.Value)).ToArray();
             yield return new Pair(
                 sensor: new Pos(numbers[0], numbers[1]),
                 beacon: new Pos(numbers[2], numbers[3])
diff --git a/2022/Day16/Solution.cs b/2022/Day16/Solution.cs
@@ -80,7 +80,8 @@ int remainingTime
                     valves.Remove(valve);
                     remainingTime -= distance + 1;
 
-                    flowFromRest = Math.Max(flowFromRest, MaxFlow(cache, map, valve, valves, remainingTime));
+                    flowFromRest = Math.Max(
+                        flowFromRest, MaxFlow(cache, map, valve, valves, remainingTime));
 
                     remainingTime += distance + 1;
                     valves.Add(valve);
@@ -99,7 +100,7 @@ Map Parse(string input) {
         foreach (var line in input.Split("\n")) {
             var name = Regex.Match(line, "Valve (.*) has").Groups[1].Value;
             var flow = int.Parse(Regex.Match(line, @"\d+").Groups[0].Value);
-            var tunnels = Regex.Match(line, "to valves? (.*)").Groups[1].Value.Split(", ").ToArray();
+            var tunnels = Regex.Match(line, "to valves? (.*)").Groups[1].Value.Split(", ");
             valveList.Add(new Valve(0, name, flow, tunnels));
         }
         var valves = valveList
@@ -134,7 +135,9 @@ Map Parse(string input) {
                 for (var target = 0; target < n; target++) {
                     if (source != target) {
                         for (var through = 0; through < n; through++) {
-                            if (distances[source, through] == int.MaxValue || distances[through, target] == int.MaxValue) {
+                            if (distances[source, through] == int.MaxValue || 
+                                distances[through, target] == int.MaxValue
+                            ) {
                                 continue;
                             }
                             var cost = distances[source, through] + distances[through, target];

Original file line number	Diff line number	Diff line change
`@@ -9,5 +9,6 @@ class Solution : Solver {`
`9`	`9`	`public object PartOne(string input) => StartOfBlock(input, 4);`
`10`	`10`	`public object PartTwo(string input) => StartOfBlock(input, 14);`
`11`	`11`	`int StartOfBlock(string input, int l) =>`
`12`		`- Enumerable.Range(l, input.Length).First(i => input.Substring(i-l, l).ToHashSet().Count == l);`
	`12`	`+ Enumerable.Range(l, input.Length)`
	`13`	`+ .First(i => input.Substring(i-l, l).ToHashSet().Count == l);`
`13`	`14`	`}`