🎨 remove explicit summons

src/main/scala/org/lemon/advent/lib/graph/fill.scala

@@ -30,7 +30,7 @@ def fill[N](adjacency: N => Seq[N], start: N): Set[N] =
   * @tparam D the distance type
   */
 def distanceFrom[N, D: Numeric](adjacency: N => Seq[(N, D)], end: N): Map[N, D] =
-  val distances = mutable.Map(end -> summon[Numeric[D]].zero)
+  val distances = mutable.Map(end -> Numeric[D].zero)
   given Ordering[(N, D)] = Ordering.by[(N, D), D](_._2)
   val queue = mutable.PriorityQueue(distances.head)
 
@@ -67,7 +67,7 @@ def distanceFrom[N](adjacency: N => Seq[N], end: N): Map[N, Int] =
   */
 def allPaths[N, D: Numeric](adjacency: N => Seq[(N, D)], start: N, ends: N => Boolean): Set[Path[N, D]] =
   val paths = mutable.Set.empty[Path[N, D]]
-  val queue = mutable.Queue(Path(path = Vector(start), distance = summon[Numeric[D]].zero))
+  val queue = mutable.Queue(Path(path = Vector(start), distance = Numeric[D].zero))
 
   while queue.nonEmpty do
     val node @ Path(path, distance) = queue.dequeue

src/main/scala/org/lemon/advent/lib/graph/search.scala

@@ -16,7 +16,7 @@ import scala.math.Ordering.Implicits._
   */
 def pathFind[N, D: Numeric](adjacency: N => Seq[(N, D)], start: N, ends: N => Boolean): Option[Path[N, D]] =
   given Ordering[Path[N, D]] = Ordering.by[Path[N, D], D](_.distance).reverse
-  val queue = mutable.PriorityQueue(Path(path = Vector(start), distance = summon[Numeric[D]].zero))
+  val queue = mutable.PriorityQueue(Path(path = Vector(start), distance = Numeric[D].zero))
   val visited = mutable.Set(start)
 
   while !queue.isEmpty && !ends(queue.head.at) do
@@ -38,8 +38,8 @@ def pathFind[N, D: Numeric](adjacency: N => Seq[(N, D)], start: N, ends: N => Bo
   */
 def allShortestPaths[N, D: Numeric](adjacency: N => Seq[(N, D)], start: N, ends: N => Boolean): Set[Path[N, D]] =
   val paths = mutable.Set.empty[Path[N, D]]
-  val queue = mutable.Queue(Path(path = Vector(start), distance = summon[Numeric[D]].zero))
-  val costs = mutable.Map(start -> summon[Numeric[D]].zero)
+  val queue = mutable.Queue(Path(path = Vector(start), distance = Numeric[D].zero))
+  val costs = mutable.Map(start -> Numeric[D].zero)
 
   while !queue.isEmpty do
     val node @ Path(path, distance) = queue.dequeue

src/main/scala/org/lemon/advent/lib/parse/Num.scala

@@ -5,4 +5,4 @@ import scala.math.BigInt
 /** Generic extractor object for parsing numbers.
   */
 object Num:
-  def unapply[T: Numeric](s: String): Option[T] = summon[Numeric[T]].parseString(s)
+  def unapply[T: Numeric](s: String): Option[T] = Numeric[T].parseString(s)