Format using shortest path search. #1
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
This commit adds: - Formatter implementation based on Dijkstra's shortest path search algorithm. This way, we reduce the formatting problem to assigning a weight to each formatting option between any two non-whitespace tokens. - dartfmt inspired testing via FormatTest, see https://github.com/dart-lang/dart_style/tree/2fdfe08b92b0ee90492832df60d1eee9e47afcb5/test/splitting - logging using logback + scala-logging via ScalaFmtLogger.
olafurpg
added a commit
that referenced
this pull request
Jan 13, 2016
Format using shortest path search.
poslegm
pushed a commit
that referenced
this pull request
Oct 28, 2019
…d_of_blocks Address feedback on editions
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.
This commit adds:
algorithm. This way, we reduce the formatting problem to assigning a
weight to each formatting option between any two non-whitespace
tokens.
https://github.com/dart-lang/dart_style/tree/2fdfe08b92b0ee90492832df60d1eee9e47afcb5/test/splitting