@@ -2561,6 +2561,8 @@ impl<K, V, A: Allocator + Clone> BTreeMap<K, V, A> {
2561
2561
/// assert_eq!(cursor.peek_prev(), None);
2562
2562
/// assert_eq!(cursor.peek_next(), Some((&1, &"a")));
2563
2563
/// ```
2564
+ ///
2565
+ /// [`Bound`]: core::ops::Bound
2564
2566
#[ unstable( feature = "btree_cursors" , issue = "107540" ) ]
2565
2567
pub fn lower_bound < Q : ?Sized > ( & self , bound : Bound < & Q > ) -> Cursor < ' _ , K , V >
2566
2568
where
@@ -2614,6 +2616,8 @@ impl<K, V, A: Allocator + Clone> BTreeMap<K, V, A> {
2614
2616
/// assert_eq!(cursor.peek_prev(), None);
2615
2617
/// assert_eq!(cursor.peek_next(), Some((&1, &mut "a")));
2616
2618
/// ```
2619
+ ///
2620
+ /// [`Bound`]: core::ops::Bound
2617
2621
#[ unstable( feature = "btree_cursors" , issue = "107540" ) ]
2618
2622
pub fn lower_bound_mut < Q : ?Sized > ( & mut self , bound : Bound < & Q > ) -> CursorMut < ' _ , K , V , A >
2619
2623
where
@@ -2684,6 +2688,8 @@ impl<K, V, A: Allocator + Clone> BTreeMap<K, V, A> {
2684
2688
/// assert_eq!(cursor.peek_prev(), Some((&4, &"d")));
2685
2689
/// assert_eq!(cursor.peek_next(), None);
2686
2690
/// ```
2691
+ ///
2692
+ /// [`Bound`]: core::ops::Bound
2687
2693
#[ unstable( feature = "btree_cursors" , issue = "107540" ) ]
2688
2694
pub fn upper_bound < Q : ?Sized > ( & self , bound : Bound < & Q > ) -> Cursor < ' _ , K , V >
2689
2695
where
@@ -2737,6 +2743,8 @@ impl<K, V, A: Allocator + Clone> BTreeMap<K, V, A> {
2737
2743
/// assert_eq!(cursor.peek_prev(), Some((&4, &mut "d")));
2738
2744
/// assert_eq!(cursor.peek_next(), None);
2739
2745
/// ```
2746
+ ///
2747
+ /// [`Bound`]: core::ops::Bound
2740
2748
#[ unstable( feature = "btree_cursors" , issue = "107540" ) ]
2741
2749
pub fn upper_bound_mut < Q : ?Sized > ( & mut self , bound : Bound < & Q > ) -> CursorMut < ' _ , K , V , A >
2742
2750
where
0 commit comments