day 5 done (for now)

so the dumb method of actually trying everything works.
example is fast enough, let's call it here.

need to go back later to optimize a bit for sure.

README.md

@@ -11,7 +11,7 @@ Solutions, scripting, and templates - all in one repo.
 
 | `<++++++++>` | `<++++++++>` | `<++++++++>` | `<++++++++>` | `<++++++++>` |
 | :-: | :-: | :-: | :-: | :-: |
-| ☑ [Day 1](src/Javran/AdventOfCode/Y2023/Day1.hs) | ☑ [Day 2](src/Javran/AdventOfCode/Y2023/Day2.hs) | ☑ [Day 3](src/Javran/AdventOfCode/Y2023/Day3.hs) | ☑ [Day 4](src/Javran/AdventOfCode/Y2023/Day4.hs) | ☐ [Day 5](src/Javran/AdventOfCode/Y2023/Day5.hs) |
+| ☑ [Day 1](src/Javran/AdventOfCode/Y2023/Day1.hs) | ☑ [Day 2](src/Javran/AdventOfCode/Y2023/Day2.hs) | ☑ [Day 3](src/Javran/AdventOfCode/Y2023/Day3.hs) | ☑ [Day 4](src/Javran/AdventOfCode/Y2023/Day4.hs) | ☑ [Day 5](src/Javran/AdventOfCode/Y2023/Day5.hs) |
 
 ### 2022
 

data/testdata/2023/day/5/example.expect.txt

@@ -0,0 +1,2 @@
+35
+46

src/Javran/AdventOfCode/Y2023/Day5.hs

@@ -65,8 +65,10 @@ mkMapper xs = auxLookup
       where
         (lm, cur, _) = IM.splitLookup i m
 
+-- TODO: may want to go back and figure out how to do this faster.
+-- TODO: I feel IntMap might have added too much overhead to our liking. need to try a linear version.
 instance Solution Day5 where
-  solutionSolved _ = False
+  solutionSolved _ = True
   solutionRun _ SolutionContext {getInputS, answerShow} = do
     (seeds, maps) <- consumeOrDie almanacP <$> getInputS
     let ff = foldl' (\r m -> mkMapper m . r) id maps