@@ -2439,7 +2439,7 @@ impl<T> VecDeque<T> {
2439
2439
/// deque.insert(idx, num);
2440
2440
/// assert_eq!(deque, &[0, 1, 1, 1, 1, 2, 3, 5, 8, 13, 21, 34, 42, 55]);
2441
2441
/// ```
2442
- #[ stable( feature = "vecdeque_binary_search" , since = "1.53 .0" ) ]
2442
+ #[ stable( feature = "vecdeque_binary_search" , since = "1.54 .0" ) ]
2443
2443
#[ inline]
2444
2444
pub fn binary_search ( & self , x : & T ) -> Result < usize , usize >
2445
2445
where
@@ -2484,7 +2484,7 @@ impl<T> VecDeque<T> {
2484
2484
/// let r = deque.binary_search_by(|x| x.cmp(&1));
2485
2485
/// assert!(matches!(r, Ok(1..=4)));
2486
2486
/// ```
2487
- #[ stable( feature = "vecdeque_binary_search" , since = "1.53 .0" ) ]
2487
+ #[ stable( feature = "vecdeque_binary_search" , since = "1.54 .0" ) ]
2488
2488
pub fn binary_search_by < ' a , F > ( & ' a self , mut f : F ) -> Result < usize , usize >
2489
2489
where
2490
2490
F : FnMut ( & ' a T ) -> Ordering ,
@@ -2539,7 +2539,7 @@ impl<T> VecDeque<T> {
2539
2539
/// let r = deque.binary_search_by_key(&1, |&(a, b)| b);
2540
2540
/// assert!(matches!(r, Ok(1..=4)));
2541
2541
/// ```
2542
- #[ stable( feature = "vecdeque_binary_search" , since = "1.53 .0" ) ]
2542
+ #[ stable( feature = "vecdeque_binary_search" , since = "1.54 .0" ) ]
2543
2543
#[ inline]
2544
2544
pub fn binary_search_by_key < ' a , B , F > ( & ' a self , b : & B , mut f : F ) -> Result < usize , usize >
2545
2545
where
0 commit comments