std: generic diff and levenshtein algorithms #166
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
- Add implementation of the *generic* myers diff and levenshtein edit distance algorihtms to be used in `testament` and `spellSuggest`.
haxscramper
force-pushed
the
generic-diff-algorithms
branch
from
cc35156 to
89faafa
Compare
4 tasks
saem
reviewed
Jan 17, 2022
|
Build succeeded: |
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.
distance algorihtms to be used in
testamentandspellSuggest.Existing implementation of the diff algorithm is not generic and can be hardly made into one, due to heavily hardcoded types and unclear API, so I added new one - it might not be as optimized, but it would be much easier to reuse for writing custom diff formatters (e.g. colored)