Day 15

.config/dotnet-tools.json

@@ -3,7 +3,7 @@
   "isRoot": true,
   "tools": {
     "fantomas": {
-      "version": "7.0.3",
+      "version": "6.2.3",
       "commands": [
         "fantomas"
       ]

.editorconfig

@@ -2,6 +2,7 @@ root=true
 
 [*]
 charset=utf-8
+end_of_line=crlf
 trim_trailing_whitespace=true
 insert_final_newline=true
 indent_style=space

.envrc

@@ -1 +0,0 @@
-use flake

.gitignore

@@ -8,7 +8,5 @@ _ReSharper.Caches/
 .DS_Store
 result
 .profile*
-.direnv/
 
 inputs/
-AdventOfCode2023.FSharp/Test/TestResults/

AdventOfCode2023.FSharp/AdventOfCode2023.FSharp.Bench/Inputs.fs

@@ -14,6 +14,6 @@ module Inputs =
             if isNull dir then
                 failwith "reached root of filesystem without finding inputs dir"
 
-        Array.init 16 (fun day -> Path.Combine (dir.FullName, "inputs", $"day%i{day + 1}.txt") |> File.ReadAllText)
+        Array.init 15 (fun day -> Path.Combine (dir.FullName, "inputs", $"day%i{day + 1}.txt") |> File.ReadAllText)
 
     let inline day (i : int) = days.[i - 1]

AdventOfCode2023.FSharp/AdventOfCode2023.FSharp.Bench/Program.fs

@@ -57,23 +57,6 @@ module Benchmarks =
         [<GlobalCleanup>]
         member _.Cleanup () = Run.shouldWrite <- true
 
-    type Benchmark16To20 () =
-        [<GlobalSetup>]
-        member _.Setup () = Run.shouldWrite <- false
-
-        [<Params(16)>]
-        member val Day = 0 with get, set
-
-        [<Params(false, true)>]
-        member val IsPartOne = false with get, set
-
-        [<Benchmark>]
-        member this.Benchmark () : unit =
-            Run.allRuns.[this.Day - 1] (not this.IsPartOne) (Inputs.day this.Day)
-
-        [<GlobalCleanup>]
-        member _.Cleanup () = Run.shouldWrite <- true
-
 module Program =
 
     [<EntryPoint>]

AdventOfCode2023.FSharp/AdventOfCode2023.FSharp.Bench/Run.fs

@@ -209,18 +209,6 @@ module Run =
             if shouldWrite then
                 Console.WriteLine output
 
-    let day16 (partTwo : bool) (input : string) =
-        if not partTwo then
-            let output = Day16.part1 input
-
-            if shouldWrite then
-                Console.WriteLine output
-        else
-            let output = Day16.part2 input
-
-            if shouldWrite then
-                Console.WriteLine output
-
     let allRuns =
         [|
             day1
@@ -238,5 +226,4 @@ module Run =
             day13
             day14
             day15
-            day16
         |]

AdventOfCode2023.FSharp/AdventOfCode2023.FSharp.Lib/AdventOfCode2023.FSharp.Lib.fsproj

@@ -1,9 +1,8 @@
-<Project Sdk="Microsoft.NET.Sdk">
+<Project Sdk="Microsoft.NET.Sdk">
 
   <PropertyGroup>
     <TargetFramework>net8.0</TargetFramework>
     <GenerateDocumentationFile>true</GenerateDocumentationFile>
-    <TreatWarningsAsErrors>true</TreatWarningsAsErrors>
   </PropertyGroup>
 
   <ItemGroup>
@@ -12,9 +11,6 @@
     <Compile Include="EfficientString.fs"/>
     <Compile Include="Arithmetic.fs"/>
     <Compile Include="Rational.fs"/>
-    <Compile Include="IntervalSet.fs" />
-    <Compile Include="Direction.fs" />
-    <Compile Include="List.fs" />
     <Compile Include="Day1.fs"/>
     <Compile Include="Day2.fs"/>
     <Compile Include="Day3.fs"/>
@@ -30,8 +26,6 @@
     <Compile Include="Day13.fs" />
     <Compile Include="Day14.fs" />
     <Compile Include="Day15.fs" />
-    <Compile Include="Day16.fs" />
-    <Compile Include="Day19.fs" />
   </ItemGroup>
 
 </Project>

AdventOfCode2023.FSharp/AdventOfCode2023.FSharp.Lib/Arr2D.fs

@@ -5,7 +5,6 @@
 #nowarn "9"
 #endif
 
-open System
 open Microsoft.FSharp.NativeInterop
 
 [<Struct>]
@@ -101,76 +100,3 @@ module Arr2D =
 #else
         NativePtr.initBlock a.Elements 0uy (uint32 sizeof<'a> * uint32 a.Length)
 #endif
-
-    /// Pass in a buffer of memory which we will use entirely for our own purposes (and may resize)
-    /// to maintain state.
-    /// `empty` is the value in empty cells; we will fill them with `fillWith`.
-    let floodFill
-        (stackBuf : ResizeArray<int>)
-        (s : Arr2D<'a>)
-        (empty : 'a)
-        (fillWith : 'a)
-        (currX : int)
-        (currY : int)
-        : unit
-        =
-        stackBuf.Clear ()
-        stackBuf.Add currX
-        stackBuf.Add currY
-
-        while stackBuf.Count > 0 do
-            let currY = stackBuf.[stackBuf.Count - 1]
-            stackBuf.RemoveAt (stackBuf.Count - 1)
-            let currX = stackBuf.[stackBuf.Count - 1]
-            stackBuf.RemoveAt (stackBuf.Count - 1)
-
-            if currX > 0 then
-                if get s (currX - 1) currY = empty then
-                    set s (currX - 1) currY fillWith
-                    stackBuf.Add (currX - 1)
-                    stackBuf.Add currY
-
-            if currX < s.Width - 1 then
-                if get s (currX + 1) currY = empty then
-                    set s (currX + 1) currY fillWith
-                    stackBuf.Add (currX + 1)
-                    stackBuf.Add currY
-
-            if currY > 0 then
-                if get s currX (currY - 1) = empty then
-                    set s currX (currY - 1) fillWith
-                    stackBuf.Add currX
-                    stackBuf.Add (currY - 1)
-
-            if currY < s.Height - 1 then
-                if get s currX (currY + 1) = empty then
-                    set s currX (currY + 1) fillWith
-                    stackBuf.Add currX
-                    stackBuf.Add (currY + 1)
-
-    /// SIMD go brr
-    let inline count< ^a when 'a : equality and 'a : unmanaged and 'a :> IEquatable<'a>>
-        (arr : Arr2D<'a>)
-        (x : 'a)
-        : int
-        =
-        let span =
-#if DEBUG
-            arr.Elements.AsSpan ()
-#else
-            ReadOnlySpan<'a> (NativePtr.toVoidPtr arr.Elements, arr.Length)
-#endif
-        MemoryExtensions.Count (span, x)
-
-    let print (arr : Arr2D<byte>) =
-        for row = 0 to arr.Height - 1 do
-            for col = 0 to arr.Width - 1 do
-                match get arr col row with
-                | 1uy -> printf "#"
-                | 0uy -> printf "."
-                | 2uy -> printf "O"
-                | _ -> failwith "bad"
-
-            printfn ""
-
-        printfn ""

AdventOfCode2023.FSharp/AdventOfCode2023.FSharp.Lib/Day10.fs

@@ -123,6 +123,41 @@ module Day10 =
 
         distance
 
+    let floodFill (stackBuf : ResizeArray<_>) (s : Arr2D<byte>) (currX : int) (currY : int) =
+        stackBuf.Clear ()
+        stackBuf.Add currX
+        stackBuf.Add currY
+
+        while stackBuf.Count > 0 do
+            let currY = stackBuf.[stackBuf.Count - 1]
+            stackBuf.RemoveAt (stackBuf.Count - 1)
+            let currX = stackBuf.[stackBuf.Count - 1]
+            stackBuf.RemoveAt (stackBuf.Count - 1)
+
+            if currX > 0 then
+                if Arr2D.get s (currX - 1) currY = 0uy then
+                    Arr2D.set s (currX - 1) currY 2uy
+                    stackBuf.Add (currX - 1)
+                    stackBuf.Add currY
+
+            if currX < s.Width - 1 then
+                if Arr2D.get s (currX + 1) currY = 0uy then
+                    Arr2D.set s (currX + 1) currY 2uy
+                    stackBuf.Add (currX + 1)
+                    stackBuf.Add currY
+
+            if currY > 0 then
+                if Arr2D.get s currX (currY - 1) = 0uy then
+                    Arr2D.set s currX (currY - 1) 2uy
+                    stackBuf.Add currX
+                    stackBuf.Add (currY - 1)
+
+            if currY < s.Height - 1 then
+                if Arr2D.get s currX (currY + 1) = 0uy then
+                    Arr2D.set s currX (currY + 1) 2uy
+                    stackBuf.Add currX
+                    stackBuf.Add (currY + 1)
+
     let print (s : Arr2D<byte>) =
         for y = 0 to s.Height - 1 do
             for x = 0 to s.Width - 1 do
@@ -275,12 +310,12 @@ module Day10 =
         let stackBuf = ResizeArray ()
 
         for line = 0 to system.Height - 1 do
-            Arr2D.floodFill stackBuf system 0uy 2uy 0 line
-            Arr2D.floodFill stackBuf system 0uy 2uy (system.Width - 1) line
+            floodFill stackBuf system 0 line
+            floodFill stackBuf system (system.Width - 1) line
 
         for col = 0 to system.Width - 1 do
-            Arr2D.floodFill stackBuf system 0uy 2uy col 0
-            Arr2D.floodFill stackBuf system 0uy 2uy col (system.Height - 1)
+            floodFill stackBuf system col 0
+            floodFill stackBuf system col (system.Height - 1)
 
         let mutable answer = 0
 

AdventOfCode2023.FSharp/AdventOfCode2023.FSharp.Lib/Day14.fs

@@ -137,6 +137,19 @@ module Day14 =
                 else // current = 0uy
                     pos <- pos + 1
 
+    let print (board : Arr2D<byte>) =
+        for row = 0 to board.Height - 1 do
+            for col = 0 to board.Width - 1 do
+                match Arr2D.get board col row with
+                | 0uy -> printf "."
+                | 1uy -> printf "O"
+                | 2uy -> printf "#"
+                | _ -> failwith "bad value"
+
+            printfn ""
+
+        printfn ""
+
     let score (board : Arr2D<byte>) =
         let mutable answer = 0ul
 

AdventOfCode2023.FSharp/AdventOfCode2023.FSharp.Lib/Day15.fs

@@ -25,7 +25,7 @@ module Day15 =
 
         answer
 
-    let inline removeFirst<'a> ([<InlineIfLambda>] toRemove : 'a -> bool) (arr : ResizeArray<'a>) : unit =
+    let removeFirst<'a> (toRemove : 'a -> bool) (arr : ResizeArray<'a>) : unit =
         let mutable i = 0
 
         while i < arr.Count do
@@ -38,13 +38,7 @@ module Day15 =
 
             i <- i + 1
 
-    let inline replace
-        ([<InlineIfLambda>] withKey : 'a -> 'key)
-        (key : 'key)
-        (value : 'a)
-        (arr : ResizeArray<'a>)
-        : unit
-        =
+    let replace (withKey : 'a -> 'key) (key : 'key) (value : 'a) (arr : ResizeArray<'a>) : unit =
         let mutable i = 0
 
         while i < arr.Count do
@@ -58,57 +52,35 @@ module Day15 =
             // no replacement was made
             arr.Add value
 
-    let inline getLength (labelAndLength : uint64) : uint32 =
-        (labelAndLength % uint64 UInt32.MaxValue) |> uint32
-
-    let inline getLabel (labelAndLength : uint64) : uint32 =
-        (labelAndLength / uint64 UInt32.MaxValue) |> uint32
-
-    let inline focusingPower (boxNumber : uint32) (arr : ResizeArray<_>) =
-        let mutable answer = 0ul
+    let inline focusingPower (boxNumber : int) (arr : ResizeArray<_ * _>) : int =
+        let mutable answer = 0
 
         for i = 0 to arr.Count - 1 do
-            answer <- answer + (boxNumber + 1ul) * (uint32 i + 1ul) * getLength arr.[i]
+            answer <- answer + (boxNumber + 1) * (i + 1) * snd arr.[i]
 
         answer
 
-    let inline toUint32 (s : ReadOnlySpan<char>) : uint32 =
-        let mutable answer = 0ul
-
-        for c in s do
-            answer <- answer * 26ul + uint32 (byte c - byte 'a')
-
-        answer
-
-    let inline pack (label : uint32) (focalLength : uint32) : uint64 =
-        uint64 label * uint64 UInt32.MaxValue + uint64 focalLength
-
     let part2 (s : string) =
         let s = s.AsSpan().TrimEnd ()
         use chunks = StringSplitEnumerator.make' ',' s
-        // The max length of a label turns out to be 6, which means we need 26^6 < 2^32 entries.
-        // So we'll use a uint32 instead of our string, to save hopping around memory.
-        // We'll also pack the focal length into the elements, to save tupling.
-        let lenses = Array.init 256 (fun _ -> ResizeArray<uint64> ())
+        let lenses = Array.init 256 (fun _ -> ResizeArray<string * _> ())
 
         for chunk in chunks do
             if chunk.[chunk.Length - 1] = '-' then
-                let label = chunk.Slice (0, chunk.Length - 1)
-                let labelShrunk = toUint32 label
-                removeFirst (fun labelAndLength -> getLabel labelAndLength = labelShrunk) lenses.[hash label]
+                let label = chunk.Slice(0, chunk.Length - 1).ToString ()
+                removeFirst (fun (label2, _focalLength) -> label2 = label) lenses.[hash (label.AsSpan ())]
             else
                 let equalsPos = chunk.IndexOf '='
 
                 let focalLength =
-                    UInt32.Parse (chunk.Slice (equalsPos + 1), NumberStyles.None, CultureInfo.InvariantCulture)
+                    Int32.Parse (chunk.Slice (equalsPos + 1), NumberStyles.None, CultureInfo.InvariantCulture)
 
-                let label = chunk.Slice (0, equalsPos)
-                let labelShrunk = toUint32 label
-                replace getLabel labelShrunk (pack labelShrunk focalLength) lenses.[hash label]
+                let label = chunk.Slice(0, equalsPos).ToString ()
+                replace fst label (label, focalLength) lenses.[hash (label.AsSpan ())]
 
-        let mutable answer = 0ul
+        let mutable answer = 0
 
         for i = 0 to 255 do
-            answer <- answer + focusingPower (uint32 i) lenses.[i]
+            answer <- answer + focusingPower i lenses.[i]
 
         answer

AdventOfCode2023.FSharp/AdventOfCode2023.FSharp.Lib/Day16.fs

@@ -1,283 +0,0 @@
-namespace AdventOfCode2023
-
-#if DEBUG
-#else
-#nowarn "9"
-#endif
-
-open System
-
-[<RequireQualifiedAccess>]
-module Day16 =
-
-    let inline storeDirectionAndPos (numCols : int) (col : int) (row : int) (direction : Direction) : uint16 =
-        4us * uint16 (col + numCols * row) + Direction.toUInt direction
-
-    let inline getDirection (input : uint16) =
-        match input % 4us with
-        | 0us -> Direction.Left
-        | 1us -> Direction.Right
-        | 2us -> Direction.Up
-        | 3us -> Direction.Down
-        | _ -> failwith "bad"
-
-    let inline getCol (numCols : int) (input : uint16) = (input / 4us) % uint16 numCols |> int
-
-    let inline getRow (numCols : int) (input : uint16) = (input / 4us) / uint16 numCols |> int
-
-    let inline maxEncoded (numCols : int) (numRows : int) : uint16 =
-        4us * uint16 ((numCols - 1) + numCols * (numRows - 1)) + 3us
-
-    let inline getAt (numCols : int) (s : string) (row : int) (col : int) = s.[row * (numCols + 1) + col]
-
-    let advance (arr : Arr2D<_>) (going : ResizeArray<_>) (s : string) (nextUp : uint16) =
-        let numCols = arr.Width
-        let numLines = arr.Height
-        let col = getCol numCols nextUp
-        let row = getRow numCols nextUp
-        let dir = getDirection nextUp
-        Arr2D.set arr col row true
-
-        match dir with
-        | Direction.Right ->
-            match getAt numCols s row col with
-            | '-'
-            | '.' ->
-                if col < arr.Width - 1 then
-                    going.[going.Count - 1] <- storeDirectionAndPos numCols (col + 1) row dir
-                else
-                    going.RemoveAt (going.Count - 1)
-            | '/' ->
-                if row > 0 then
-                    going.[going.Count - 1] <- storeDirectionAndPos numCols col (row - 1) Direction.Up
-                else
-                    going.RemoveAt (going.Count - 1)
-            | '\\' ->
-                if row < numLines - 1 then
-                    going.[going.Count - 1] <- storeDirectionAndPos numCols col (row + 1) Direction.Down
-                else
-                    going.RemoveAt (going.Count - 1)
-            | '|' ->
-                going.RemoveAt (going.Count - 1)
-
-                if row < numLines - 1 then
-                    going.Add (storeDirectionAndPos numCols col (row + 1) Direction.Down)
-
-                if row > 0 then
-                    going.Add (storeDirectionAndPos numCols col (row - 1) Direction.Up)
-            | c -> failwith $"Unrecognised char: %c{c}"
-        | Direction.Left ->
-            match getAt numCols s row col with
-            | '-'
-            | '.' ->
-                if col > 0 then
-                    going.[going.Count - 1] <- storeDirectionAndPos numCols (col - 1) row dir
-                else
-                    going.RemoveAt (going.Count - 1)
-            | '\\' ->
-                if row > 0 then
-                    going.[going.Count - 1] <- storeDirectionAndPos numCols col (row - 1) Direction.Up
-                else
-                    going.RemoveAt (going.Count - 1)
-            | '/' ->
-                if row < numLines - 1 then
-                    going.[going.Count - 1] <- storeDirectionAndPos numCols col (row + 1) Direction.Down
-                else
-                    going.RemoveAt (going.Count - 1)
-            | '|' ->
-                going.RemoveAt (going.Count - 1)
-
-                if row < numLines - 1 then
-                    going.Add (storeDirectionAndPos numCols col (row + 1) Direction.Down)
-
-                if row > 0 then
-                    going.Add (storeDirectionAndPos numCols col (row - 1) Direction.Up)
-            | c -> failwith $"Unrecognised char: %c{c}"
-        | Direction.Up ->
-            match getAt numCols s row col with
-            | '|'
-            | '.' ->
-                if row > 0 then
-                    going.[going.Count - 1] <- storeDirectionAndPos numCols col (row - 1) dir
-                else
-                    going.RemoveAt (going.Count - 1)
-            | '/' ->
-                if col < numCols - 1 then
-                    going.[going.Count - 1] <- storeDirectionAndPos numCols (col + 1) row Direction.Right
-                else
-                    going.RemoveAt (going.Count - 1)
-            | '\\' ->
-                if col > 0 then
-                    going.[going.Count - 1] <- storeDirectionAndPos numCols (col - 1) row Direction.Left
-                else
-                    going.RemoveAt (going.Count - 1)
-            | '-' ->
-                going.RemoveAt (going.Count - 1)
-
-                if col < numCols - 1 then
-                    going.Add (storeDirectionAndPos numCols (col + 1) row Direction.Right)
-
-                if col > 0 then
-                    going.Add (storeDirectionAndPos numCols (col - 1) row Direction.Left)
-            | c -> failwith $"Unrecognised char: %c{c}"
-        | Direction.Down ->
-            match getAt numCols s row col with
-            | '|'
-            | '.' ->
-                if row < arr.Height - 1 then
-                    going.[going.Count - 1] <- storeDirectionAndPos numCols col (row + 1) dir
-                else
-                    going.RemoveAt (going.Count - 1)
-            | '\\' ->
-                if col < numCols - 1 then
-                    going.[going.Count - 1] <- storeDirectionAndPos numCols (col + 1) row Direction.Right
-                else
-                    going.RemoveAt (going.Count - 1)
-            | '/' ->
-                if col > 0 then
-                    going.[going.Count - 1] <- storeDirectionAndPos numCols (col - 1) row Direction.Left
-                else
-                    going.RemoveAt (going.Count - 1)
-            | '-' ->
-                going.RemoveAt (going.Count - 1)
-
-                if col < numCols - 1 then
-                    going.Add (storeDirectionAndPos numCols (col + 1) row Direction.Right)
-
-                if col > 0 then
-                    going.Add (storeDirectionAndPos numCols (col - 1) row Direction.Left)
-            | c -> failwith $"Unrecognised char: %c{c}"
-        | _ -> failwith "bad"
-
-    let part1 (s : string) =
-        let numLines = s.AsSpan().Count '\n'
-        let numCols = s.IndexOf '\n'
-        let buf = Array.zeroCreate (numLines * numCols)
-#if DEBUG
-        let arr : Arr2D<bool> =
-            {
-                Elements = buf
-                Width = numCols
-            }
-#else
-        use ptr = fixed buf
-
-        let arr : Arr2D<bool> =
-            {
-                Elements = ptr
-                Width = numCols
-                Length = buf.Length
-            }
-#endif
-        let going = ResizeArray ()
-
-        going.Add (storeDirectionAndPos numCols 0 0 Direction.Right)
-
-        let seen = Array.zeroCreate (int (maxEncoded numCols numLines) + 1)
-
-        while going.Count > 0 do
-            let nextUp = going.[going.Count - 1]
-
-            match seen.[int nextUp] with
-            | true -> going.RemoveAt (going.Count - 1)
-            | false ->
-                seen.[int nextUp] <- true
-                advance arr going s nextUp
-
-        buf.AsSpan().Count true
-
-    let part2 (s : string) =
-        let numLines = s.AsSpan().Count '\n'
-        let numCols = s.IndexOf '\n'
-        let buf = Array.zeroCreate (numLines * numCols)
-#if DEBUG
-        let arr : Arr2D<bool> =
-            {
-                Elements = buf
-                Width = numCols
-            }
-#else
-        use ptr = fixed buf
-
-        let arr : Arr2D<bool> =
-            {
-                Elements = ptr
-                Width = numCols
-                Length = buf.Length
-            }
-#endif
-        let going = ResizeArray ()
-        let seen = Array.zeroCreate (int (maxEncoded numCols numLines) + 1)
-        let mutable best = 0
-
-        for start = 0 to numCols - 1 do
-            going.Clear ()
-            Array.Clear seen
-            Array.Clear buf
-            going.Add (storeDirectionAndPos numCols start 0 Direction.Down)
-
-            while going.Count > 0 do
-                let nextUp = going.[going.Count - 1]
-
-                match seen.[int nextUp] with
-                | true -> going.RemoveAt (going.Count - 1)
-                | false ->
-                    seen.[int nextUp] <- true
-                    advance arr going s nextUp
-
-            let lit = buf.AsSpan().Count true
-            best <- max best lit
-
-            going.Clear ()
-            Array.Clear seen
-            Array.Clear buf
-            going.Add (storeDirectionAndPos numCols start (numLines - 1) Direction.Up)
-
-            while going.Count > 0 do
-                let nextUp = going.[going.Count - 1]
-
-                match seen.[int nextUp] with
-                | true -> going.RemoveAt (going.Count - 1)
-                | false ->
-                    seen.[int nextUp] <- true
-                    advance arr going s nextUp
-
-            let lit = buf.AsSpan().Count true
-            best <- max best lit
-
-        for start = 0 to numLines - 1 do
-            going.Clear ()
-            Array.Clear seen
-            Array.Clear buf
-            going.Add (storeDirectionAndPos numCols 0 start Direction.Right)
-
-            while going.Count > 0 do
-                let nextUp = going.[going.Count - 1]
-
-                match seen.[int nextUp] with
-                | true -> going.RemoveAt (going.Count - 1)
-                | false ->
-                    seen.[int nextUp] <- true
-                    advance arr going s nextUp
-
-            let lit = buf.AsSpan().Count true
-            best <- max best lit
-
-            going.Clear ()
-            Array.Clear seen
-            Array.Clear buf
-            going.Add (storeDirectionAndPos numCols (numCols - 1) start Direction.Left)
-
-            while going.Count > 0 do
-                let nextUp = going.[going.Count - 1]
-
-                match seen.[int nextUp] with
-                | true -> going.RemoveAt (going.Count - 1)
-                | false ->
-                    seen.[int nextUp] <- true
-                    advance arr going s nextUp
-
-            let lit = buf.AsSpan().Count true
-            best <- max best lit
-
-        best

AdventOfCode2023.FSharp/AdventOfCode2023.FSharp.Lib/Day19.fs

@@ -1,357 +0,0 @@
-namespace AdventOfCode2023
-
-open System
-open System.Collections.Generic
-open System.Globalization
-
-[<RequireQualifiedAccess>]
-module Day19 =
-
-    type Component =
-        | X = 0
-        | M = 1
-        | A = 2
-        | S = 3
-
-    [<RequireQualifiedAccess>]
-    module Component =
-        let ofChar (c : char) : Component =
-            match c with
-            | 'x' -> Component.X
-            | 'm' -> Component.M
-            | 'a' -> Component.A
-            | 's' -> Component.S
-            | c -> failwith $"bad component: %c{c}"
-
-    type Dest =
-        | Register of string
-        | Accept
-        | Reject
-
-        static member OfString (s : EfficientString) : Dest =
-            if s.Length = 1 && s.[0] = 'A' then Dest.Accept
-            elif s.Length = 1 && s.[0] = 'R' then Dest.Reject
-            else Dest.Register (s.ToString ())
-
-    type Rule =
-        {
-            Component : Component
-            IsLess : bool
-            Operand : int
-            Target : Dest
-        }
-
-        static member OfString (s : EfficientString) : Choice<Rule, Dest> =
-            match s.IndexOf ':' with
-            | -1 -> Choice2Of2 (Dest.OfString (s.Slice (0, s.Length)))
-            | colon ->
-
-            let dest = Dest.OfString (s.Slice (colon + 1))
-            let comp = Component.ofChar s.[0]
-
-            let isLess =
-                match s.[1] with
-                | '>' -> false
-                | '<' -> true
-                | c -> failwith $"Bad comparison: %c{c}"
-
-            let operand =
-                Int32.Parse (s.Slice (2, colon - 2), NumberStyles.None, NumberFormatInfo.InvariantInfo)
-
-            {
-                Component = comp
-                IsLess = isLess
-                Target = dest
-                Operand = operand
-            }
-            |> Choice1Of2
-
-    let inline matches (rule : Rule) x m a s =
-        match rule.Component with
-        | Component.A ->
-            if (rule.IsLess && a < rule.Operand) || (not rule.IsLess && a > rule.Operand) then
-                Some rule.Target
-            else
-                None
-        | Component.X ->
-            if (rule.IsLess && x < rule.Operand) || (not rule.IsLess && x > rule.Operand) then
-                Some rule.Target
-            else
-                None
-        | Component.M ->
-            if (rule.IsLess && m < rule.Operand) || (not rule.IsLess && m > rule.Operand) then
-                Some rule.Target
-            else
-                None
-        | Component.S ->
-            if (rule.IsLess && s < rule.Operand) || (not rule.IsLess && s > rule.Operand) then
-                Some rule.Target
-            else
-                None
-        | _ -> failwith "bad component"
-
-    let rec computePart1 (components : Dictionary<string, Rule ResizeArray * Dest>) x m a s (reg : string) =
-        match components.TryGetValue reg with
-        | false, _ -> failwith $"no rule matched: %s{reg}"
-        | true, (rules, dest) ->
-            let mutable result = ValueNone
-            let mutable i = 0
-
-            while result.IsNone do
-                if i = rules.Count then
-                    result <- ValueSome dest
-                else
-
-                match matches rules.[i] x m a s with
-                | Some dest -> result <- ValueSome dest
-                | None -> i <- i + 1
-
-            match result.Value with
-            | Register reg -> computePart1 components x m a s reg
-            | Accept -> true
-            | Reject -> false
-
-    let readWorkflows (rows : byref<StringSplitEnumerator>) =
-        let workflows = Dictionary<string, Rule ResizeArray * Dest> ()
-
-        while rows.MoveNext () && not rows.Current.IsEmpty do
-            let brace = rows.Current.IndexOf '{'
-            let name = rows.Current.Slice(0, brace).ToString ()
-            let rules = ResizeArray ()
-
-            for rule in StringSplitEnumerator.make' ',' (rows.Current.Slice(brace + 1).TrimEnd '}') do
-                match Rule.OfString rule with
-                | Choice1Of2 rule -> rules.Add rule
-                | Choice2Of2 dest -> workflows.[name] <- (rules, dest)
-
-        workflows
-
-    let part1 (workflows : _) (rows : byref<StringSplitEnumerator>) =
-        let mutable answer = 0
-
-        for row in rows do
-            if not row.IsEmpty then
-                let mutable x = 0
-                let mutable m = 0
-                let mutable a = 0
-                let mutable s = 0
-
-                for comp in StringSplitEnumerator.make' ',' (row.Slice (1, row.Length - 2)) do
-                    let number =
-                        Int32.Parse (comp.Slice 2, NumberStyles.None, NumberFormatInfo.InvariantInfo)
-
-                    match comp.[0] with
-                    | 'x' -> x <- number
-                    | 'm' -> m <- number
-                    | 'a' -> a <- number
-                    | 's' -> s <- number
-                    | c -> failwith $"Bad char: %c{c}"
-
-                if computePart1 workflows x m a s "in" then
-                    answer <- answer + x + m + a + s
-
-        answer
-
-    type AcceptanceCriterion =
-        | True
-        | False
-        | Base of Component * low : int * high : int
-        | And of AcceptanceCriterion * AcceptanceCriterion
-        | Or of AcceptanceCriterion * AcceptanceCriterion
-
-    let rec acAnd a b =
-        match a, b with
-        | AcceptanceCriterion.Or (a1, a2), _ -> AcceptanceCriterion.Or (acAnd a1 b, acAnd a2 b)
-        | AcceptanceCriterion.True, _ -> b
-        | AcceptanceCriterion.False, _ -> False
-        | _, AcceptanceCriterion.Or (b1, b2) -> AcceptanceCriterion.Or (acAnd a b1, acAnd a b2)
-        | _, AcceptanceCriterion.True -> a
-        | _, AcceptanceCriterion.False -> False
-        | _, _ -> AcceptanceCriterion.And (a, b)
-
-    let inline acOr a b =
-        match a, b with
-        | AcceptanceCriterion.False, _ -> b
-        | AcceptanceCriterion.True, _ -> AcceptanceCriterion.True
-        | _, AcceptanceCriterion.False -> a
-        | _, AcceptanceCriterion.True -> AcceptanceCriterion.True
-        | _, _ -> AcceptanceCriterion.Or (a, b)
-
-    /// "low > high" means "empty interval"
-    [<Struct>]
-    type Interval =
-        {
-            Low : int
-            High : int
-        }
-
-        static member Empty =
-            {
-                Low = 1
-                High = 0
-            }
-
-    [<RequireQualifiedAccess>]
-    module Interval =
-        let size (i : Interval) =
-            if i.Low > i.High then 0 else i.High - i.Low + 1
-
-        let intersect (i1 : Interval) (i2 : Interval) =
-            if i1.Low > i1.High || i2.Low > i2.High then
-                i1
-            else if i1.High < i2.Low then
-                Interval.Empty
-            elif i2.High < i1.Low then
-                Interval.Empty
-            else
-                {
-                    Low = max i1.Low i2.Low
-                    High = min i1.High i2.High
-                }
-
-    type Conjunction =
-        {
-            X : Interval
-            M : Interval
-            A : Interval
-            S : Interval
-        }
-
-        static member All =
-            {
-                X =
-                    {
-                        Low = 1
-                        High = 4000
-                    }
-                M =
-                    {
-                        Low = 1
-                        High = 4000
-                    }
-                A =
-                    {
-                        Low = 1
-                        High = 4000
-                    }
-                S =
-                    {
-                        Low = 1
-                        High = 4000
-                    }
-            }
-
-    [<RequireQualifiedAccess>]
-    module Conjunction =
-        let conjAnd (c1 : Conjunction) (c2 : Conjunction) =
-            {
-                X = Interval.intersect c1.X c2.X
-                M = Interval.intersect c1.M c2.M
-                A = Interval.intersect c1.A c2.A
-                S = Interval.intersect c1.S c2.S
-            }
-
-        /// We rely on the intervals being disjoint by construction.
-        let size (x : Conjunction) : uint64 =
-            uint64 (Interval.size x.X)
-            * uint64 (Interval.size x.M)
-            * uint64 (Interval.size x.A)
-            * uint64 (Interval.size x.S)
-
-    type UnionOfConjunctions = Conjunction list
-
-    let rec toUnion (ac : AcceptanceCriterion) : UnionOfConjunctions =
-        match ac with
-        | Base (comp, low, high) ->
-            match comp with
-            | Component.A ->
-                { Conjunction.All with
-                    A =
-                        {
-                            Low = low
-                            High = high
-                        }
-                }
-            | Component.M ->
-                { Conjunction.All with
-                    M =
-                        {
-                            Low = low
-                            High = high
-                        }
-                }
-            | Component.S ->
-                { Conjunction.All with
-                    S =
-                        {
-                            Low = low
-                            High = high
-                        }
-                }
-            | Component.X ->
-                { Conjunction.All with
-                    X =
-                        {
-                            Low = low
-                            High = high
-                        }
-                }
-            | _ -> failwith "bad"
-            |> List.singleton
-        | And (a, b) ->
-            [
-                Conjunction.conjAnd (List.exactlyOne (toUnion a)) (List.exactlyOne (toUnion b))
-            ]
-        | Or (a, b) -> toUnion a @ toUnion b
-        | True -> failwith "already stripped out"
-        | False -> failwith "already stripped out"
-
-    let rec acceptance
-        (store : Dictionary<string, AcceptanceCriterion>)
-        (workflows : Dictionary<string, ResizeArray<Rule> * Dest>)
-        (key : string)
-        : AcceptanceCriterion
-        =
-        match store.TryGetValue key with
-        | true, v -> v
-        | false, _ ->
-
-        let rules, final = workflows.[key]
-
-        let mutable result =
-            match final with
-            | Register s -> acceptance store workflows s
-            | Accept -> AcceptanceCriterion.True
-            | Reject -> AcceptanceCriterion.False
-
-        for i = rules.Count - 1 downto 0 do
-            let rule = rules.[i]
-
-            let cond =
-                if rule.IsLess then
-                    AcceptanceCriterion.Base (rule.Component, 1, rule.Operand - 1)
-                else
-                    AcceptanceCriterion.Base (rule.Component, rule.Operand + 1, 4000)
-
-            let negCond =
-                if rule.IsLess then
-                    AcceptanceCriterion.Base (rule.Component, rule.Operand, 4000)
-                else
-                    AcceptanceCriterion.Base (rule.Component, 1, rule.Operand)
-
-            result <-
-                match rule.Target with
-                | Register target -> acOr (acAnd cond (acceptance store workflows target)) (acAnd negCond result)
-                | Accept -> acOr cond (acAnd negCond result)
-                | Reject -> acAnd negCond result
-
-        store.[key] <- result
-        result
-
-    let part2 (workflows : _) (rows : byref<StringSplitEnumerator>) : uint64 =
-        let acceptanceRanges = Dictionary<string, AcceptanceCriterion> ()
-
-        let a = acceptance acceptanceRanges workflows "in"
-        let union = toUnion a
-
-        union |> List.sumBy Conjunction.size

AdventOfCode2023.FSharp/AdventOfCode2023.FSharp.Lib/Direction.fs

@@ -1,24 +0,0 @@
-namespace AdventOfCode2023
-
-type Direction =
-    | Left = 0
-    | Right = 1
-    | Up = 2
-    | Down = 3
-
-module Direction =
-    let inline toUInt (d : Direction) =
-        match d with
-        | Direction.Left -> 0us
-        | Direction.Right -> 1us
-        | Direction.Up -> 2us
-        | Direction.Down -> 3us
-        | _ -> failwith "Bad"
-
-    let inline ofChar (c : char) : Direction =
-        match c with
-        | 'L' -> Direction.Left
-        | 'R' -> Direction.Right
-        | 'U' -> Direction.Up
-        | 'D' -> Direction.Down
-        | c -> failwith $"Bad: %c{c}"

AdventOfCode2023.FSharp/AdventOfCode2023.FSharp.Lib/IntervalSet.fs

@@ -1,70 +0,0 @@
-namespace AdventOfCode2023
-
-type IntervalSet = private | IntervalSet of (int * int) list
-
-[<RequireQualifiedAccess>]
-module IntervalSet =
-    let empty = IntervalSet []
-
-    let private add' (low : int) (high : int) intervals : _ list =
-        let rec go (low : int) (high : int) (intervals : (int * int) list) =
-            match intervals with
-            | [] -> [ low, high ]
-            | (lowExisting, highExisting) :: intervals ->
-                if low > highExisting then
-                    (lowExisting, highExisting) :: go low high intervals
-                elif high < lowExisting then
-                    (low, high) :: (lowExisting, highExisting) :: intervals
-                elif high = lowExisting then
-                    (low, highExisting) :: intervals
-                elif high <= highExisting then
-                    (min low lowExisting, highExisting) :: intervals
-                else
-                    // low <= highExisting, highExisting < high
-                    (min low lowExisting, highExisting) :: go (highExisting + 1) high intervals
-
-        go low high intervals
-
-    let add (low : int) (high : int) (IntervalSet intervals) : IntervalSet = add' low high intervals |> IntervalSet
-
-    let contains (x : int) (IntervalSet intervals) : bool =
-        let rec go (intervals : (int * int) list) =
-            match intervals with
-            | [] -> false
-            | (low, high) :: intervals ->
-                if low > x then false
-                elif x <= high then true
-                else go intervals
-
-        go intervals
-
-    let private union' i1 i2 =
-        (i2, i1) ||> List.fold (fun i (low, high) -> add' low high i)
-
-    let union (IntervalSet i1) (IntervalSet i2) : IntervalSet = union' i1 i2 |> IntervalSet
-
-    let private intersectionHelper (low : int) (high : int) (ints : (int * int) list) =
-        let rec go (low : int) (high : int) (ints : (int * int) list) =
-            match ints with
-            | [] -> []
-            | (lowExisting, highExisting) :: ints ->
-                if low > highExisting then
-                    go low high ints
-                elif high < lowExisting then
-                    []
-                elif high <= highExisting then
-                    [ max low lowExisting, high ]
-                else
-                    (max low lowExisting, highExisting) :: go (highExisting + 1) high ints
-
-        go low high ints
-
-    let private intersection' i1 i2 =
-        // a int (b U c) = (a int b) U (a int c)
-        ([], i1)
-        ||> List.fold (fun soFar (low, high) -> union' soFar (intersectionHelper low high i2))
-
-    let intersection (IntervalSet i1) (IntervalSet i2) : IntervalSet = intersection' i1 i2 |> IntervalSet
-
-    let count (IntervalSet i) =
-        i |> List.sumBy (fun (low, high) -> high - low + 1)

AdventOfCode2023.FSharp/AdventOfCode2023.FSharp.Lib/List.fs

@@ -1,38 +0,0 @@
-namespace AdventOfCode2023
-
-open System
-
-[<RequireQualifiedAccess>]
-module List =
-    let rec nTuples (n : int) (xs : 'a list) : 'a list list =
-#if DEBUG
-        if n < 0 then
-            raise (ArgumentException "n cannot be negative")
-#endif
-        match n, xs with
-        | 0, _ -> [ [] ]
-        | _, [] -> []
-        | _, x :: xs ->
-            let withX = nTuples (n - 1) xs |> List.map (fun xs -> x :: xs)
-            let withoutX = nTuples n xs
-            withX @ withoutX
-
-    let inline inclusionExclusion (sizeOf : 'a -> 'ret) (sizeOfTuple : 'a list -> 'ret) (xs : 'a list) : 'ret =
-        let mutable result = List.sumBy sizeOf xs
-        let mutable i = 2
-
-        while i <= xs.Length do
-            let nTuples = nTuples i xs
-            let sum = List.sumBy sizeOfTuple nTuples
-
-            if sum = LanguagePrimitives.GenericZero then
-                i <- Int32.MaxValue
-            else
-                if i % 2 = 0 then
-                    result <- result - sum
-                else
-                    result <- result + sum
-
-                i <- i + 1
-
-        result

AdventOfCode2023.FSharp/AdventOfCode2023.FSharp/Program.fs

@@ -300,50 +300,6 @@ module Program =
             Console.WriteLine (part2.ToString ())
             Console.Error.WriteLine ((1_000.0 * float sw.ElapsedTicks / float Stopwatch.Frequency).ToString () + "ms")
 
-        Console.WriteLine "=====Day 16====="
-
-        do
-            let input = Path.Combine (dir.FullName, "day16.txt") |> File.ReadAllText
-
-            sw.Restart ()
-            let part1 = Day16.part1 input
-            sw.Stop ()
-            Console.WriteLine (part1.ToString ())
-            Console.Error.WriteLine ((1_000.0 * float sw.ElapsedTicks / float Stopwatch.Frequency).ToString () + "ms")
-            sw.Restart ()
-            let part2 = Day16.part2 input
-            sw.Stop ()
-            Console.WriteLine (part2.ToString ())
-            Console.Error.WriteLine ((1_000.0 * float sw.ElapsedTicks / float Stopwatch.Frequency).ToString () + "ms")
-
-        Console.WriteLine "=====Day 19====="
-
-        do
-            let input = Path.Combine (dir.FullName, "day19.txt") |> File.ReadAllText
-
-            sw.Restart ()
-            use mutable s = StringSplitEnumerator.make '\n' input
-            let data = Day19.readWorkflows &s
-            sw.Stop ()
-
-            Console.Error.WriteLine (
-                (1_000.0 * float sw.ElapsedTicks / float Stopwatch.Frequency).ToString ()
-                + "ms parse"
-            )
-
-            let mutable sCopy = s
-
-            sw.Restart ()
-            let part1 = Day19.part1 data &s
-            sw.Stop ()
-            Console.WriteLine (part1.ToString ())
-            Console.Error.WriteLine ((1_000.0 * float sw.ElapsedTicks / float Stopwatch.Frequency).ToString () + "ms")
-            sw.Restart ()
-            let part2 = Day19.part2 data &sCopy
-            sw.Stop ()
-            Console.WriteLine (part2.ToString ())
-            Console.Error.WriteLine ((1_000.0 * float sw.ElapsedTicks / float Stopwatch.Frequency).ToString () + "ms")
-
         endToEnd.Stop ()
 
         Console.Error.WriteLine (

AdventOfCode2023.FSharp/Test/Test.fsproj

@@ -5,15 +5,10 @@
 
     <IsPackable>false</IsPackable>
     <IsTestProject>true</IsTestProject>
-
-    <EnableStaticNativeInstrumentation>False</EnableStaticNativeInstrumentation>
-    <EnableDynamicNativeInstrumentation>False</EnableDynamicNativeInstrumentation>
   </PropertyGroup>
 
   <ItemGroup>
     <Compile Include="Util.fs"/>
-    <Compile Include="TestIntervalSet.fs" />
-    <Compile Include="TestList.fs" />
     <Compile Include="TestDay1.fs"/>
     <Compile Include="TestDay2.fs"/>
     <Compile Include="TestDay3.fs"/>
@@ -29,8 +24,6 @@
     <Compile Include="TestDay13.fs" />
     <Compile Include="TestDay14.fs" />
     <Compile Include="TestDay15.fs" />
-    <Compile Include="TestDay16.fs" />
-    <Compile Include="TestDay19.fs" />
     <EmbeddedResource Include="samples\day1.txt"/>
     <EmbeddedResource Include="samples\day1part1.txt"/>
     <EmbeddedResource Include="samples\day2.txt"/>
@@ -49,15 +42,11 @@
     <EmbeddedResource Include="samples\day13.txt" />
     <EmbeddedResource Include="samples\day14.txt" />
     <EmbeddedResource Include="samples\day15.txt" />
-    <EmbeddedResource Include="samples\day16.txt" />
-    <EmbeddedResource Include="samples\day19.txt" />
   </ItemGroup>
 
   <ItemGroup>
-    <PackageReference Include="FsCheck" Version="2.16.6" />
     <PackageReference Include="FsUnit" Version="5.6.1"/>
-    <PackageReference Include="Microsoft.NET.Test.Sdk" Version="17.8.0"/>
-    <PackageReference Include="Microsoft.CodeCoverage" Version="17.8.0"/>
+    <PackageReference Include="Microsoft.NET.Test.Sdk" Version="17.6.0"/>
     <PackageReference Include="NUnit3TestAdapter" Version="4.2.1"/>
     <PackageReference Include="NUnit.Analyzers" Version="3.6.1"/>
     <PackageReference Include="coverlet.collector" Version="6.0.0"/>

AdventOfCode2023.FSharp/Test/TestDay15.fs

@@ -1,5 +1,7 @@
 namespace AdventOfCode2023.Test
 
+open System
+
 open AdventOfCode2023
 open NUnit.Framework
 open FsUnitTyped
@@ -17,7 +19,7 @@ module TestDay15 =
 
     [<Test>]
     let part2Sample () =
-        sample |> Day15.part2 |> shouldEqual 145ul
+        sample |> Day15.part2 |> shouldEqual 145
 
     [<Test>]
     let part1Actual () =
@@ -43,4 +45,4 @@ module TestDay15 =
                 Assert.Inconclusive ()
                 failwith "unreachable"
 
-        Day15.part2 s |> shouldEqual 248279ul
+        Day15.part2 s |> shouldEqual 248279

AdventOfCode2023.FSharp/Test/TestDay16.fs

@@ -1,44 +0,0 @@
-namespace AdventOfCode2023.Test
-
-open AdventOfCode2023
-open NUnit.Framework
-open FsUnitTyped
-open System.IO
-
-[<TestFixture>]
-module TestDay16 =
-
-    [<Test>]
-    let sample = Assembly.getEmbeddedResource typeof<Dummy>.Assembly "day16.txt"
-
-    [<Test>]
-    let part1Sample () = sample |> Day16.part1 |> shouldEqual 46
-
-    [<Test>]
-    let part2Sample () = sample |> Day16.part2 |> shouldEqual 51
-
-    [<Test>]
-    let part1Actual () =
-        let s =
-            try
-                File.ReadAllText (Path.Combine (__SOURCE_DIRECTORY__, "../../inputs/day16.txt"))
-            with
-            | :? DirectoryNotFoundException
-            | :? FileNotFoundException ->
-                Assert.Inconclusive ()
-                failwith "unreachable"
-
-        Day16.part1 s |> shouldEqual 8112
-
-    [<Test>]
-    let part2Actual () =
-        let s =
-            try
-                File.ReadAllText (Path.Combine (__SOURCE_DIRECTORY__, "../../inputs/day16.txt"))
-            with
-            | :? DirectoryNotFoundException
-            | :? FileNotFoundException ->
-                Assert.Inconclusive ()
-                failwith "unreachable"
-
-        Day16.part2 s |> shouldEqual 8314

AdventOfCode2023.FSharp/Test/TestDay19.fs

@@ -1,55 +0,0 @@
-namespace AdventOfCode2023.Test
-
-open AdventOfCode2023
-open NUnit.Framework
-open FsUnitTyped
-open System.IO
-
-[<TestFixture>]
-module TestDay19 =
-    [<Test>]
-    let sample = Assembly.getEmbeddedResource typeof<Dummy>.Assembly "day19.txt"
-
-    [<Test>]
-    let part1Sample () =
-        use mutable s = StringSplitEnumerator.make '\n' sample
-        let workflows = Day19.readWorkflows &s
-        Day19.part1 workflows &s |> shouldEqual 19114
-
-    [<Test>]
-    let part2Sample () =
-        use mutable s = StringSplitEnumerator.make '\n' sample
-        let workflows = Day19.readWorkflows &s
-        Day19.part2 workflows &s |> shouldEqual 167409079868000uL
-
-    [<Test>]
-    let part1Actual () =
-        let s =
-            try
-                File.ReadAllText (Path.Combine (__SOURCE_DIRECTORY__, "../../inputs/day19.txt"))
-            with
-            | :? DirectoryNotFoundException
-            | :? FileNotFoundException ->
-                Assert.Inconclusive ()
-                failwith "unreachable"
-
-        use mutable s = StringSplitEnumerator.make '\n' s
-        let workflows = Day19.readWorkflows &s
-
-        Day19.part1 workflows &s |> shouldEqual 368964
-
-    [<Test>]
-    let part2Actual () =
-        let s =
-            try
-                File.ReadAllText (Path.Combine (__SOURCE_DIRECTORY__, "../../inputs/day19.txt"))
-            with
-            | :? DirectoryNotFoundException
-            | :? FileNotFoundException ->
-                Assert.Inconclusive ()
-                failwith "unreachable"
-
-        use mutable s = StringSplitEnumerator.make '\n' s
-        let workflows = Day19.readWorkflows &s
-
-        Day19.part2 workflows &s |> shouldEqual 127675188176682uL

AdventOfCode2023.FSharp/Test/TestIntervalSet.fs

@@ -1,86 +0,0 @@
-namespace AdventOfCode2023.Test
-
-open System.Threading
-open AdventOfCode2023
-open NUnit.Framework
-open FsUnitTyped
-open FsCheck
-
-[<TestFixture>]
-module TestIntervalSet =
-
-    /// Normalises e.g. (5, 3) to (3, 5) too.
-    let toIntervalSet (model : (int * int) list) =
-        (IntervalSet.empty, model)
-        ||> List.fold (fun intervals (x1, x2) -> IntervalSet.add (min x1 x2) (max x1 x2) intervals)
-
-    let modelContains (x : int) (model : (int * int) list) =
-        model
-        |> List.exists (fun (x1, x2) ->
-            let x1, x2 = min x1 x2, max x1 x2
-            x1 <= x && x <= x2
-        )
-
-    [<Test>]
-    let ``IntervalSet add works`` () =
-        let property (pos : int ref) (neg : int ref) (x : int) (xs : (int * int) list) =
-            let intervals = toIntervalSet xs
-
-            let actual = IntervalSet.contains x intervals
-            let expected = modelContains x xs
-
-            if actual then
-                Interlocked.Increment pos |> ignore
-            else
-                Interlocked.Increment neg |> ignore
-
-            expected = actual
-
-        let pos = ref 0
-        let neg = ref 0
-
-        Check.One (
-            { Config.Default with
-                MaxTest = 1000
-            },
-            property pos neg
-        )
-
-        printfn "Fraction of positive cases: %f" ((float pos.Value) / (float pos.Value + float neg.Value))
-
-    [<Test>]
-    let ``Intersection works`` () =
-        let property
-            (pos : int ref)
-            (neg : int ref)
-            (trials : int list)
-            (xsModel : (int * int) list)
-            (ysModel : (int * int) list)
-            =
-            let xs = toIntervalSet xsModel
-            let ys = toIntervalSet ysModel
-
-            let intervals = IntervalSet.intersection xs ys
-
-            for x in trials do
-                let actual = IntervalSet.contains x intervals
-                let expected = modelContains x xsModel && modelContains x ysModel
-
-                expected |> shouldEqual actual
-
-                if actual then
-                    Interlocked.Increment pos |> ignore
-                else
-                    Interlocked.Increment neg |> ignore
-
-        let pos = ref 0
-        let neg = ref 0
-
-        Check.One (
-            { Config.Default with
-                MaxTest = 1000
-            },
-            property pos neg
-        )
-
-        printfn "Fraction of positive cases: %f" ((float pos.Value) / (float pos.Value + float neg.Value))

AdventOfCode2023.FSharp/Test/TestList.fs

@@ -1,20 +0,0 @@
-namespace Test
-
-open NUnit.Framework
-open FsUnitTyped
-open FsCheck
-open AdventOfCode2023
-
-[<TestFixture>]
-module TestList =
-
-    [<Test>]
-    let ``n-tuples have the right length`` () =
-        let property (n : int) (xs : char list) =
-            let n = min (abs n) 6
-            let xs = xs |> List.take (min 10 xs.Length)
-            let tuples = List.nTuples n xs
-            tuples |> List.forall (fun i -> i.Length = n)
-
-        property 1 [ 'v' ] |> shouldEqual true
-        Check.QuickThrowOnFailure property

AdventOfCode2023.FSharp/Test/Util.fs

@@ -3,7 +3,9 @@ namespace AdventOfCode2023.Test
 open System.IO
 open System.Reflection
 
-type Dummy = class end
+type Dummy =
+    class
+    end
 
 [<RequireQualifiedAccess>]
 module Assembly =

AdventOfCode2023.FSharp/Test/samples/day16.txt

@@ -1,10 +0,0 @@
-.|...\....
-|.-.\.....
-.....|-...
-........|.
-..........
-.........\
-..../.\\..
-.-.-/..|..
-.|....-|.\
-..//.|....

AdventOfCode2023.FSharp/Test/samples/day19.txt

@@ -1,17 +0,0 @@
-px{a<2006:qkq,m>2090:A,rfg}
-pv{a>1716:R,A}
-lnx{m>1548:A,A}
-rfg{s<537:gd,x>2440:R,A}
-qs{s>3448:A,lnx}
-qkq{x<1416:A,crn}
-crn{x>2662:A,R}
-in{s<1351:px,qqz}
-qqz{s>2770:qs,m<1801:hdj,R}
-gd{a>3333:R,R}
-hdj{m>838:A,pv}
-
-{x=787,m=2655,a=1222,s=2876}
-{x=1679,m=44,a=2067,s=496}
-{x=2036,m=264,a=79,s=2244}
-{x=2461,m=1339,a=466,s=291}
-{x=2127,m=1623,a=2188,s=1013}

flake.lock

@@ -5,11 +5,11 @@
         "systems": "systems"
       },
       "locked": {
-        "lastModified": 1731533236,
-        "narHash": "sha256-l0KFg5HjrsfsO/JpG+r7fRrqm12kzFHyUHqHCVpMMbI=",
+        "lastModified": 1694529238,
+        "narHash": "sha256-zsNZZGTGnMOf9YpHKJqMSsa0dXbfmxeoJ7xHlrt+xmY=",
         "owner": "numtide",
         "repo": "flake-utils",
-        "rev": "11707dc2f618dd54ca8739b309ec4fc024de578b",
+        "rev": "ff7b65b44d01cf9ba6a71320833626af21126384",
         "type": "github"
       },
       "original": {
@@ -20,11 +20,11 @@
     },
     "nixpkgs": {
       "locked": {
-        "lastModified": 1757068644,
-        "narHash": "sha256-NOrUtIhTkIIumj1E/Rsv1J37Yi3xGStISEo8tZm3KW4=",
+        "lastModified": 1701253981,
+        "narHash": "sha256-ztaDIyZ7HrTAfEEUt9AtTDNoCYxUdSd6NrRHaYOIxtk=",
         "owner": "NixOS",
         "repo": "nixpkgs",
-        "rev": "8eb28adfa3dc4de28e792e3bf49fcf9007ca8ac9",
+        "rev": "e92039b55bcd58469325ded85d4f58dd5a4eaf58",
         "type": "github"
       },
       "original": {

flake.nix

@@ -14,12 +14,15 @@
       system: let
         pkgs = nixpkgs.legacyPackages.${system};
       in
-        # Conditionally include Swift for Darwin systems
+        # Conditionally include Swift and Apple SDK for Darwin systems
         let
           darwinDeps =
             if system == "x86_64-darwin" || system == "aarch64-darwin"
             then [
               pkgs.swift
+              pkgs.darwin.apple_sdk.frameworks.Foundation
+              pkgs.darwin.apple_sdk.frameworks.CryptoKit
+              pkgs.darwin.apple_sdk.frameworks.GSS
             ]
             else [];
         in {

mathematica/day_21.m

@@ -1,30 +0,0 @@
-(* ::Package:: *)
-
-(* ::Input:: *)
-(*s="...........*)
-(*.....###.#.*)
-(*.###.##..#.*)
-(*..#.#...#..*)
-(*....#.#....*)
-(*.##..S####.*)
-(*.##..#...#.*)
-(*.......##..*)
-(*.##.#.####.*)
-(*.##..##.##.*)
-(*...........";*)
-
-
-(* ::Input:: *)
-(*reachable[grid_,{row_Integer,col_Integer}]:=reachable[grid,{row,col}]=Select[{{row+1,col},{row-1,col},{row,col+1},{row,col-1}},*)
-(*1<=#[[1]]<=Length[grid]&&1<=#[[2]]<=Length[First@grid]&&grid[[#[[1]],#[[2]]]]!="#"&*)
-(*]*)
-
-
-(* ::Input:: *)
-(*f[grid_,pos_,0]:={pos}*)
-(*f[grid_,pos_,timestepsRemaining_Integer]:=*)
-(*f[grid,pos,timestepsRemaining]=DeleteDuplicates@Flatten[f[grid,#,timestepsRemaining-1]&/@reachable[grid,pos],1]*)
-
-
-(* ::Input:: *)
-(*With[{grid=Characters/@StringSplit[s,"\n"]},f[grid,FirstPosition[grid,"S"],64]//Length]*)