diff options
| author | Yuki Okushi <jtitor@2k36.org> | 2021-07-24 04:30:56 +0900 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2021-07-24 04:30:56 +0900 |
| commit | 249a11f93698802735f89efe5d8adf094b4b01ed (patch) | |
| tree | a1f6cc3b77dc8be53c4b3c6fee8d8d96119110f7 /tests/mir-opt/lower_array_len.array_bound_mut.NormalizeArrayLen.panic-unwind.diff | |
| parent | d4532903b05b06e25511ec929823909a157cdf2c (diff) | |
| parent | 2dd69aaafc64fe9dce74088b5371a6cfb032e01e (diff) | |
| download | rust-249a11f93698802735f89efe5d8adf094b4b01ed.tar.gz rust-249a11f93698802735f89efe5d8adf094b4b01ed.zip | |
Rollup merge of #86790 - janikrabe:retain-iter-order-doc, r=m-ou-se
Document iteration order of `retain` functions For `HashSet` and `HashMap`, this simply copies the comment from `BinaryHeap::retain`. For `BTreeSet` and `BTreeMap`, this adds an additional guarantee that wasn't previously documented. I think that because these data structures are inherently ordered and other functions guarantee ordered iteration, it makes sense to provide this guarantee for `retain` as well.
Diffstat (limited to 'tests/mir-opt/lower_array_len.array_bound_mut.NormalizeArrayLen.panic-unwind.diff')
0 files changed, 0 insertions, 0 deletions