Fix deprecated implicit parameters without using from Scala 3.7.0

Author: sim642

src/main/scala/eu/sim642/adventofcode2017/Day2.scala

@@ -19,7 +19,7 @@ object Day2 {
 
   object Part2 extends Part {
     override def rowChecksum(row: Seq[Int]): Int = {
-      val descRow = row.sorted(Ordering[Int].reverse)
+      val descRow = row.sorted(using Ordering[Int].reverse)
       val dividePairs = for {
         i <- descRow.indices
         j <- (i + 1) until descRow.size

src/main/scala/eu/sim642/adventofcode2018/Day23.scala

@@ -143,7 +143,7 @@ object Day23 {
 
     def closestMostNanobots(nanobots: Seq[Nanobot]): Int = {
       val queue: mutable.PriorityQueue[(Nanobot, (Int, Int), Int)] =
-        mutable.PriorityQueue.empty(Ordering.by({ case (octahedron, (lower, upper), originDist) =>
+        mutable.PriorityQueue.empty(using Ordering.by({ case (octahedron, (lower, upper), originDist) =>
           (upper, lower, -originDist)
           //(upper, -octahedron.radius, -originDist) // much faster but possibly incorrect?
         }))
@@ -241,7 +241,7 @@ object Day23 {
 
     def closestMostNanobots(nanobots: Seq[Nanobot]): Int = {
       val queue: mutable.PriorityQueue[(Box3, (Int, Int), Int)] =
-        mutable.PriorityQueue.empty(Ordering.by({ case (octahedron, (lower, upper), originDist) =>
+        mutable.PriorityQueue.empty(using Ordering.by({ case (octahedron, (lower, upper), originDist) =>
           (upper, lower, -originDist)
           //(upper, -octahedron.radius, -originDist) // much faster but possibly incorrect?
         }))

src/main/scala/eu/sim642/adventofcode2019/Day10.scala

@@ -65,7 +65,7 @@ object Day10 {
       Seq.empty
     else {
       val visible = filterVisible(monitoring, asteroids)
-      val vaporizeRotation = visible.toSeq.sortBy(laserAngle(monitoring, _))(Ordering.Double.TotalOrdering)
+      val vaporizeRotation = visible.toSeq.sortBy(laserAngle(monitoring, _))(using Ordering.Double.TotalOrdering)
       vaporizeRotation ++ vaporizeSeq(monitoring, asteroids -- visible)
     }
   }

src/main/scala/eu/sim642/adventofcode2023/Day7.scala

@@ -17,10 +17,10 @@ object Day7 {
     case HighCard
   }
 
-  val handTypeOrdering: Ordering[HandType] = Ordering.by[HandType, Int](_.ordinal)(Ordering[Int]).reverse
+  val handTypeOrdering: Ordering[HandType] = Ordering.by[HandType, Int](_.ordinal)(using Ordering[Int]).reverse
 
   def handFrequency(hand: Hand): Seq[Int] =
-    hand.groupCount(identity).values.toSeq.sorted(Ordering[Int].reverse)
+    hand.groupCount(identity).values.toSeq.sorted(using Ordering[Int].reverse)
 
   def frequencyHandType(freq: Seq[Int]): HandType = freq match {
     case Seq(5) => HandType.FiveOfAKind
@@ -40,11 +40,11 @@ object Day7 {
 
     def handType(hand: Hand): HandType
 
-    val handOrdering: Ordering[Hand] = Ordering.by(handType)(handTypeOrdering).orElse(Ordering.Implicits.seqOrdering(cardOrdering))
+    val handOrdering: Ordering[Hand] = Ordering.by(handType)(using handTypeOrdering).orElse(Ordering.Implicits.seqOrdering(using cardOrdering))
 
     def totalWinnings(hands: Seq[(Hand, Int)]): Int = {
       hands
-        .sortBy(_._1)(handOrdering)
+        .sortBy(_._1)(using handOrdering)
         .zipWithIndex
         .map({ case ((hand, bid), i) => (i + 1) * bid })
         .sum

src/main/scala/eu/sim642/adventofcode2024/Day21.scala

@@ -87,8 +87,10 @@ object Day21 {
         override val startNode: State =
           State(List.fill(directionalKeypads)(directionalKeypad.posOf('A')), numericKeypad.posOf('A'), "")
 
-        override def unitNeighbors(state: State): IterableOnce[State] =
-          "<v>^A".iterator.flatten(state.userPress).filter(newState => code.startsWith(newState.input))
+        override def unitNeighbors(state: State): IterableOnce[State] = {
+          // TODO: why not flatMap?
+          "<v>^A".iterator.flatten(using state.userPress).filter(newState => code.startsWith(newState.input))
+        }
 
         override def isTargetNode(state: State, dist: Int): Boolean = state.input == code
       }

src/main/scala/eu/sim642/adventofcodelib/NumberTheory.scala

@@ -70,7 +70,7 @@ object NumberTheory {
   }
 
   def sieveCrt[A](ans: Seq[(A, A)])(using aIntegral: Integral[A]): (A, A) = {
-    ans.sortBy(_._2)(aIntegral.reverse)
+    ans.sortBy(_._2)(using aIntegral.reverse)
       .reduceLeft(sieveCrt2(_, _))
   }
 }

src/main/scala/eu/sim642/adventofcodelib/graph/AStar.scala

@@ -6,7 +6,7 @@ object AStar {
   // moved from 2018 Day 22
   def search[A](graphSearch: GraphSearch[A] & Heuristic[A]): Distances[A] & Target[A] = {
     val visitedDistance: mutable.Map[A, Int] = mutable.Map.empty
-    val toVisit: mutable.PriorityQueue[(Int, Int, A)] = mutable.PriorityQueue.empty(Ordering.by(-_._1))
+    val toVisit: mutable.PriorityQueue[(Int, Int, A)] = mutable.PriorityQueue.empty(using Ordering.by(-_._1))
 
     def enqueueHeuristically(node: A, dist: Int): Unit = {
       toVisit.enqueue((dist + graphSearch.heuristic(node), dist, node))

src/main/scala/eu/sim642/adventofcodelib/graph/Dijkstra.scala

@@ -8,7 +8,7 @@ object Dijkstra {
   // copied from AStar
   def traverse[A](graphTraversal: GraphTraversal[A]): Distances[A] = {
     val visitedDistance: mutable.Map[A, Int] = mutable.Map.empty
-    val toVisit: mutable.PriorityQueue[(Int, A)] = mutable.PriorityQueue.empty(Ordering.by(-_._1))
+    val toVisit: mutable.PriorityQueue[(Int, A)] = mutable.PriorityQueue.empty(using Ordering.by(-_._1))
 
     def enqueue(node: A, dist: Int): Unit = {
       toVisit.enqueue((dist, node))
@@ -40,7 +40,7 @@ object Dijkstra {
   // copied from AStar
   def search[A](graphSearch: GraphSearch[A]): Distances[A] & Target[A] = {
     val visitedDistance: mutable.Map[A, Int] = mutable.Map.empty
-    val toVisit: mutable.PriorityQueue[(Int, A)] = mutable.PriorityQueue.empty(Ordering.by(-_._1))
+    val toVisit: mutable.PriorityQueue[(Int, A)] = mutable.PriorityQueue.empty(using Ordering.by(-_._1))
 
     def enqueue(node: A, dist: Int): Unit = {
       toVisit.enqueue((dist, node))

src/main/scala/eu/sim642/adventofcodelib/graph/NaiveTSP.scala

@@ -19,7 +19,7 @@ object NaiveTSP {
       .permutations
       .map({ path =>
         totalPathLength(distanceMatrix, path)
-      }).min(lengthOrdering)
+      }).min(using lengthOrdering)
   }
 
   // moved from 2016 Day 24
@@ -29,7 +29,7 @@ object NaiveTSP {
       .map({ path =>
         distanceMatrix(start)(path.head) +
           totalPathLength(distanceMatrix, path)
-      }).min(lengthOrdering)
+      }).min(using lengthOrdering)
   }
 
   // moved from 2016 Day 24
@@ -40,7 +40,7 @@ object NaiveTSP {
         distanceMatrix(start)(path.head) +
           totalPathLength(distanceMatrix, path) +
           distanceMatrix(path.last)(start)
-      }).min(lengthOrdering)
+      }).min(using lengthOrdering)
   }
 
   def cycleLength[A](distanceMatrix: DistanceMatrix[A])(using lengthOrdering: Ordering[Int]): Int = {