diff options
| author | Yuki Okushi <jtitor@2k36.org> | 2023-03-30 21:06:59 +0900 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2023-03-30 21:06:59 +0900 |
| commit | d6f27401f12f02876aa6fe53139b030033f37e5e (patch) | |
| tree | 63144eade568434d6310ac9068fee7c871e43d76 /compiler/rustc_codegen_gcc | |
| parent | f2d9a3d0771504f1ae776226a5799dcb4408a91a (diff) | |
| parent | b0850073133c548a53afee29400d3873fabb7985 (diff) | |
| download | rust-d6f27401f12f02876aa6fe53139b030033f37e5e.tar.gz rust-d6f27401f12f02876aa6fe53139b030033f37e5e.zip | |
Rollup merge of #106985 - jofas:106746-fix, r=ChrisDenton
Enhanced doucmentation of binary search methods for `slice` and `VecDeque` for unsorted instances
Fixes #106746. Issue #106746 raises the concern that the binary search methods for slices and deques aren't explicit enough about the fact that they are only applicable to sorted slices/deques. I changed the explanation for these methods. I took the relatively harsh description of the behaviour of binary search on unsorted collections ("unspecified and meaningless") from the description of the [`partition_point`](https://doc.rust-lang.org/std/primitive.slice.html#method.partition_point) method:
> If this slice is not partitioned, the returned result is unspecified and meaningless, as this method performs a kind of binary search.
Diffstat (limited to 'compiler/rustc_codegen_gcc')
0 files changed, 0 insertions, 0 deletions