about summary refs log tree commit diff
path: root/src/liballoc/tests/lib.rs
diff options
context:
space:
mode:
authorbors <bors@rust-lang.org>2019-11-13 03:48:42 +0000
committerbors <bors@rust-lang.org>2019-11-13 03:48:42 +0000
commit374ad1b0063963060a00a3110e44d76e7105d059 (patch)
treed3822ca1549a4b80df6ee68dbaef92862c8609a8 /src/liballoc/tests/lib.rs
parent0f12bad718bb8b1fb2b1b7267a02fffaef6e1e3c (diff)
parentffeac1f71fe8d8206c9c83747cdd7816ad9aafc2 (diff)
downloadrust-374ad1b0063963060a00a3110e44d76e7105d059.tar.gz
rust-374ad1b0063963060a00a3110e44d76e7105d059.zip
Auto merge of #65637 - ssomers:master, r=scottmcm
proposal for BTreeMap/Set min/max, #62924

- Which pair of names: #62924 lists the existing possibilities min/max, first/last, (EDIT) front/back, peek(/peek_back?). Iterators have next/next_back or next/last. I'm slightly in favour of first/last because min/max might suggest they search over the entire map, and front/back pretends they are only about position.
- Return key only instead of pair like iterator does?
- If not, then keep the _key_value suffix? ~~Also provide variant with mutable value? But there is no such variant for get_key_value.~~
- Look for and upgrade more usages of `.iter().next()` and such in the libraries? I only upgraded the ones I contributed myself, all very recently.
Diffstat (limited to 'src/liballoc/tests/lib.rs')
-rw-r--r--src/liballoc/tests/lib.rs1
1 files changed, 1 insertions, 0 deletions
diff --git a/src/liballoc/tests/lib.rs b/src/liballoc/tests/lib.rs
index 3273feb7b5d..605e0ef55d7 100644
--- a/src/liballoc/tests/lib.rs
+++ b/src/liballoc/tests/lib.rs
@@ -2,6 +2,7 @@
 #![feature(box_syntax)]
 #![feature(drain_filter)]
 #![feature(exact_size_is_empty)]
+#![feature(map_first_last)]
 #![feature(new_uninit)]
 #![feature(pattern)]
 #![feature(trusted_len)]