Try naive paralellism#294
Draft
letFunny wants to merge 5 commits into
Draft
Conversation
Avoid expensive calls to GlobPath by separating the string into segments and using cheaper comparisons were possible.
Collaborator
Author
|
Together with all previous fixes and this extremely naive, not optimized form of parallelism, we get: So 16 times faster than main, for a total of 700ms compared to 12s. |
letFunny
commented
Apr 28, 2026
| } | ||
| mu.Lock() | ||
| if err == nil { | ||
| err = fmt.Errorf("slices %s and %s conflict on %s and %s", old, new, oldPath, newPath) |
Collaborator
Author
There was a problem hiding this comment.
TODO: Sort the errors lexicographically by comparing strings to give out a deterministic error. Thanks Paul for the suggestion to make it better
This file contains hidden or 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
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 PR is a draft implementation of the most naive form of parallelism possible in Go to get the benchmark numbers and to share the code.