-
Notifications
You must be signed in to change notification settings - Fork 13k
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.
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
Rollup of 8 pull requests #93390
Rollup of 8 pull requests #93390
Conversation
Because it's used within both `TypedArena` and `DroplessArena`. The commit also makes `<u8>` the default parameter.
Incorporate distance limit from `find_best_match_for_name` directly into Levenshtein distance computation. Use the string size difference as a lower bound on the distance and exit early when it exceeds the specified limit. After finding a candidate within a limit, lower the limit further to restrict the search space.
I found this message confusing when I encountered it. This commit makes it clearer that you have to import the unqualified type yourself.
It's simply a binary thing to allow different behaviour for `Copy` vs `!Copy` types. The new code makes this much clearer; I was scratching my head over the old code for some time.
Define c_char using cfg_if rather than repeating 40-line cfg Libstd has a 40-line cfg that defines the targets on which `c_char` is unsigned, and then repeats the same cfg with `not(…)` for the targets on which `c_char` is signed. This PR replaces it with a `cfg_if!` in which an `else` takes care of the signed case. I confirmed that `x.py doc library/std` inlines the type alias because c_char_definition is not a publicly accessible path: ![Screenshot from 2021-12-07 13-42-07](https://user-images.githubusercontent.com/1940490/145110596-f1058406-9f32-44ff-9a81-1dfd19b4a24f.png)
Mention std::iter::zip in Iterator::zip docs Closes rust-lang#91960 I'm not sure about the wording. I think it's alright, but happy to change.
…, r=the8472 Add test for stable hash uniqueness of adjacent field values This PR adds a simple test to check that stable hash will produce a different hash if the order of two values that have the same combined bit pattern changes. r? `@the8472`
Introduce a limit to Levenshtein distance computation Incorporate distance limit from `find_best_match_for_name` directly into Levenshtein distance computation. Use the string size difference as a lower bound on the distance and exit early when it exceeds the specified limit. After finding a candidate within a limit, lower the limit further to restrict the search space.
…ulti-trait, r=GuillaumeGomez rustdoc: add test case for multiple traits and erased names rust-lang#92339 (comment)
…ied-ty, r=lcnr Clarify the `usage-of-qualified-ty` error message. I found this message confusing when I encountered it. This commit makes it clearer that you have to import the unqualified type yourself. r? `@lcnr`
`#[rustc_pass_by_value]` cleanup
…oli-obk More arena cleanups A sequel to rust-lang#90990. r? `@oli-obk`
@bors r+ rollup=never p=8 |
📌 Commit 0eb6753 has been approved by |
☀️ Test successful - checks-actions |
Finished benchmarking commit (1b41093): comparison url. Summary: This benchmark run did not return any relevant results. 1 results were found to be statistically significant but too small to be relevant. If you disagree with this performance assessment, please file an issue in rust-lang/rustc-perf. @rustbot label: -perf-regression |
Successful merges:
usage-of-qualified-ty
error message. #93357 (Clarify theusage-of-qualified-ty
error message.)#[rustc_pass_by_value]
cleanup #93363 (#[rustc_pass_by_value]
cleanup)Failed merges:
r? @ghost
@rustbot modify labels: rollup
Create a similar rollup