@@ -275,7 +275,6 @@ impl<'a, K: Ord, V, A: Allocator + Clone> Entry<'a, K, V, A> {
275
275
/// # Examples
276
276
///
277
277
/// ```
278
- /// #![feature(btree_entry_insert)]
279
278
/// use std::collections::BTreeMap;
280
279
///
281
280
/// let mut map: BTreeMap<&str, String> = BTreeMap::new();
@@ -284,7 +283,7 @@ impl<'a, K: Ord, V, A: Allocator + Clone> Entry<'a, K, V, A> {
284
283
/// assert_eq!(entry.key(), &"poneyland");
285
284
/// ```
286
285
#[ inline]
287
- #[ unstable ( feature = "btree_entry_insert" , issue = "65225 " ) ]
286
+ #[ stable ( feature = "btree_entry_insert" , since = "CURRENT_RUSTC_VERSION " ) ]
288
287
pub fn insert_entry ( self , value : V ) -> OccupiedEntry < ' a , K , V , A > {
289
288
match self {
290
289
Occupied ( mut entry) => {
@@ -383,7 +382,6 @@ impl<'a, K: Ord, V, A: Allocator + Clone> VacantEntry<'a, K, V, A> {
383
382
/// # Examples
384
383
///
385
384
/// ```
386
- /// #![feature(btree_entry_insert)]
387
385
/// use std::collections::BTreeMap;
388
386
/// use std::collections::btree_map::Entry;
389
387
///
@@ -395,7 +393,7 @@ impl<'a, K: Ord, V, A: Allocator + Clone> VacantEntry<'a, K, V, A> {
395
393
/// }
396
394
/// assert_eq!(map["poneyland"], 37);
397
395
/// ```
398
- #[ unstable ( feature = "btree_entry_insert" , issue = "65225 " ) ]
396
+ #[ stable ( feature = "btree_entry_insert" , since = "CURRENT_RUSTC_VERSION " ) ]
399
397
pub fn insert_entry ( mut self , value : V ) -> OccupiedEntry < ' a , K , V , A > {
400
398
let handle = match self . handle {
401
399
None => {
0 commit comments