compression in scala #20
Merged
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
See build error: TailRec optimisation not applicable, method attackLoop contains no recursive calls
|
recovered the performance lost on clock tests. so this one appears to be faster all around. |
ornicar
added a commit
to lichess-org/lila
that referenced
this pull request
Jan 20, 2025
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
a low effort port to scala 3 syntax. somehow it is roughly 8-10% faster than the java version on
sbt test. maybe because of tailrec? i haven't the faintest cluedid this while investigating lichess-org/lila#16317 and it's fine if we just want to stick with java. it's doubtful the apparent speedup running test cases would have any measurable effect on lila