diff options
| author | Matthias Krüger <matthias.krueger@famsik.de> | 2022-01-16 16:58:16 +0100 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2022-01-16 16:58:16 +0100 |
| commit | 039d6dc2896366b45cb71cef61dcbbd6cfc518a4 (patch) | |
| tree | abeb1fdb1dd798bdb31a098f7c805d2278b814f7 /src/test/codegen/src-hash-algorithm/src-hash-algorithm-md5.rs | |
| parent | c5041f88ea6bb48379db3539e339e175534e4352 (diff) | |
| parent | ad6408dd7a786db603c2ed323894feb7110e8dea (diff) | |
| download | rust-039d6dc2896366b45cb71cef61dcbbd6cfc518a4.tar.gz rust-039d6dc2896366b45cb71cef61dcbbd6cfc518a4.zip | |
Rollup merge of #92706 - umanwizard:btree, r=dtolnay
Clarify explicitly that BTree{Map,Set} are ordered.
One of the main reasons one would want to use a BTree{Map,Set} rather than a Hash{Map,Set} is because they maintain their keys in sorted order; but this was never explicitly stated in the top-level docs (it was only indirectly alluded to there, and stated explicitly in the docs for `iter`, `values`, etc.)
This PR states the ordering guarantee more prominently.
Diffstat (limited to 'src/test/codegen/src-hash-algorithm/src-hash-algorithm-md5.rs')
0 files changed, 0 insertions, 0 deletions