Skip to content

Update scala3-library to 3.7.3 #49

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 2 commits into from
Sep 12, 2025
Merged

Update scala3-library to 3.7.3 #49

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
397d45c
Update scala3-library to 3.7.3
horothesun-scala-steward[bot] Sep 9, 2025
017c115
if/then/else fix
horothesun Sep 12, 2025
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion build.sbt
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -27,7 +27,7 @@ lazy val root = project
.settings(
organization := "com.horothesun",
name := "advent-of-code-2024",
scalaVersion := "3.7.2",
scalaVersion := "3.7.3",
libraryDependencies ++= Seq(
"org.typelevel" %% "cats-core" % catsVersion,
"org.typelevel" %% "kittens" % kittensVersion,
Expand Down
4 changes: 2 additions & 2 deletions src/main/scala/Day02.scala
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -42,12 +42,12 @@ object Day02:
case _ :: tail => ls.zip(tail).forall((l, r) => l.differsFrom(min = 1, max = 3)(r))

def safety(ls: List[Level]): Safety =
if ((isAllIncreasing(ls) || isAllDecreasing(ls)) && areAllDeltasBetween1And3(ls)) Safe else Unsafe
if (isAllIncreasing(ls) || isAllDecreasing(ls)) && areAllDeltasBetween1And3(ls) then Safe else Unsafe

extension [A](nel: NonEmptyList[A])
def removed(elementAt: Int): List[A] =
val as = nel.toList
if (elementAt < 0 || nel.length <= elementAt) as
if elementAt < 0 || nel.length <= elementAt then as
else // 0 <= idx && idx < nel.length
as.take(elementAt) ++ as.drop(1 + elementAt)

Expand Down