upgrade uiua version

AOC/uiua/README.md

@@ -2,4 +2,4 @@
 
 Solutions to Advent of Code 2024 written in Uiua
 
-Uses version 0.14.0-dev.2
+Uses version v0.14.0-rc.1

AOC/uiua/solutions/day06.ua

@@ -1,9 +1,7 @@
-# Experimental!
 ~ "../helpers/input.ua" ~ ReadInput
 
 Input ← (
   ReadInput "day_06"
-  ▽≠,@\r  # remove carriage return
   ⊜∘≠,@\n # split on newlines
 )
 
@@ -20,9 +18,8 @@ Neis ← (
 )
 FindPath ← (
   ⊂[¯1 0]⊢⊚⊸⌕@^ # start pos and direction
-  °□⊢ astar(
+  °□⊢ path(
     1¤⊢Neis  # neighbours with no rotation = lowest cost
-  | 0        # heuristic of 0
   | ¬Valid↘₂ # keep going until out of grid
   )
   ⊙◌  # discard the cost
@@ -34,9 +31,9 @@ IsLoop ← (
 
 # Part A
 ◴≡↘₂FindPath Input # unique path positions
-⟜(&p⧻)             # count (keep positions for part B)
+⟜⧻                 # count (keep positions for part B)
 
 # Part B
 ≡⍜⊡⋅@#⊙[Input] # put obstacles in each part A position
 ↘1             # but not starting position
-&p/+≡IsLoop    # sum up the loops
+/+≡IsLoop      # sum up the loops

AOC/uiua/solutions/day10.ua

@@ -1,5 +1,3 @@
-# Experimental!
-
 ~ "../helpers/input.ua" ~ ReadInput
 
 Input ← (
@@ -17,9 +15,8 @@ Nbrs ← (
   ▽:⊙(=1-:)     # keep moves which are 1 increase
 )
 Trails ← (
-  astar(
+  path(
     Nbrs # Neighbours have equal cost
-  | 0    # heuristic of 0
   | =9⊡  # keep going until finding a 9
   )
   ⊙◌ # discard cost

AOC/uiua/tests/test_solutions.ua

@@ -20,6 +20,7 @@ SolutionMap ← map+1⇡15 Expected
 GetSolution ← get⊙SolutionMap
 
 TestDay ← (
+  ⟜(&p $"Executing tests for day _" ↙₋₂$"0_")
   GetSolution⊙(⇌⊟) # get the actual solution
   ⍤.≍              # assert matching
 )