@@ -580,7 +580,7 @@ impl<K, V> BTreeMap<K, V> {
580
580
/// map.insert(1, "a");
581
581
/// ```
582
582
#[ stable( feature = "rust1" , since = "1.0.0" ) ]
583
- #[ rustc_const_stable( feature = "const_btree_new" , since = "CURRENT_RUSTC_VERSION " ) ]
583
+ #[ rustc_const_stable( feature = "const_btree_new" , since = "1.66.0 " ) ]
584
584
#[ must_use]
585
585
pub const fn new ( ) -> BTreeMap < K , V > {
586
586
BTreeMap { root : None , length : 0 , alloc : ManuallyDrop :: new ( Global ) , _marker : PhantomData }
@@ -711,7 +711,7 @@ impl<K, V, A: Allocator + Clone> BTreeMap<K, V, A> {
711
711
/// map.insert(2, "a");
712
712
/// assert_eq!(map.first_key_value(), Some((&1, &"b")));
713
713
/// ```
714
- #[ stable( feature = "map_first_last" , since = "CURRENT_RUSTC_VERSION " ) ]
714
+ #[ stable( feature = "map_first_last" , since = "1.66.0 " ) ]
715
715
pub fn first_key_value ( & self ) -> Option < ( & K , & V ) >
716
716
where
717
717
K : Ord ,
@@ -739,7 +739,7 @@ impl<K, V, A: Allocator + Clone> BTreeMap<K, V, A> {
739
739
/// assert_eq!(*map.get(&1).unwrap(), "first");
740
740
/// assert_eq!(*map.get(&2).unwrap(), "b");
741
741
/// ```
742
- #[ stable( feature = "map_first_last" , since = "CURRENT_RUSTC_VERSION " ) ]
742
+ #[ stable( feature = "map_first_last" , since = "1.66.0 " ) ]
743
743
pub fn first_entry ( & mut self ) -> Option < OccupiedEntry < ' _ , K , V , A > >
744
744
where
745
745
K : Ord ,
@@ -773,7 +773,7 @@ impl<K, V, A: Allocator + Clone> BTreeMap<K, V, A> {
773
773
/// }
774
774
/// assert!(map.is_empty());
775
775
/// ```
776
- #[ stable( feature = "map_first_last" , since = "CURRENT_RUSTC_VERSION " ) ]
776
+ #[ stable( feature = "map_first_last" , since = "1.66.0 " ) ]
777
777
pub fn pop_first ( & mut self ) -> Option < ( K , V ) >
778
778
where
779
779
K : Ord ,
@@ -796,7 +796,7 @@ impl<K, V, A: Allocator + Clone> BTreeMap<K, V, A> {
796
796
/// map.insert(2, "a");
797
797
/// assert_eq!(map.last_key_value(), Some((&2, &"a")));
798
798
/// ```
799
- #[ stable( feature = "map_first_last" , since = "CURRENT_RUSTC_VERSION " ) ]
799
+ #[ stable( feature = "map_first_last" , since = "1.66.0 " ) ]
800
800
pub fn last_key_value ( & self ) -> Option < ( & K , & V ) >
801
801
where
802
802
K : Ord ,
@@ -824,7 +824,7 @@ impl<K, V, A: Allocator + Clone> BTreeMap<K, V, A> {
824
824
/// assert_eq!(*map.get(&1).unwrap(), "a");
825
825
/// assert_eq!(*map.get(&2).unwrap(), "last");
826
826
/// ```
827
- #[ stable( feature = "map_first_last" , since = "CURRENT_RUSTC_VERSION " ) ]
827
+ #[ stable( feature = "map_first_last" , since = "1.66.0 " ) ]
828
828
pub fn last_entry ( & mut self ) -> Option < OccupiedEntry < ' _ , K , V , A > >
829
829
where
830
830
K : Ord ,
@@ -858,7 +858,7 @@ impl<K, V, A: Allocator + Clone> BTreeMap<K, V, A> {
858
858
/// }
859
859
/// assert!(map.is_empty());
860
860
/// ```
861
- #[ stable( feature = "map_first_last" , since = "CURRENT_RUSTC_VERSION " ) ]
861
+ #[ stable( feature = "map_first_last" , since = "1.66.0 " ) ]
862
862
pub fn pop_last ( & mut self ) -> Option < ( K , V ) >
863
863
where
864
864
K : Ord ,
0 commit comments