@@ -2561,6 +2561,8 @@ impl<K, V, A: Allocator + Clone> BTreeMap<K, V, A> {
25612561 /// assert_eq!(cursor.peek_prev(), None);
25622562 /// assert_eq!(cursor.peek_next(), Some((&1, &"a")));
25632563 /// ```
2564+ ///
2565+ /// [`Bound`]: core::ops::Bound
25642566 #[ unstable( feature = "btree_cursors" , issue = "107540" ) ]
25652567 pub fn lower_bound < Q : ?Sized > ( & self , bound : Bound < & Q > ) -> Cursor < ' _ , K , V >
25662568 where
@@ -2614,6 +2616,8 @@ impl<K, V, A: Allocator + Clone> BTreeMap<K, V, A> {
26142616 /// assert_eq!(cursor.peek_prev(), None);
26152617 /// assert_eq!(cursor.peek_next(), Some((&1, &mut "a")));
26162618 /// ```
2619+ ///
2620+ /// [`Bound`]: core::ops::Bound
26172621 #[ unstable( feature = "btree_cursors" , issue = "107540" ) ]
26182622 pub fn lower_bound_mut < Q : ?Sized > ( & mut self , bound : Bound < & Q > ) -> CursorMut < ' _ , K , V , A >
26192623 where
@@ -2684,6 +2688,8 @@ impl<K, V, A: Allocator + Clone> BTreeMap<K, V, A> {
26842688 /// assert_eq!(cursor.peek_prev(), Some((&4, &"d")));
26852689 /// assert_eq!(cursor.peek_next(), None);
26862690 /// ```
2691+ ///
2692+ /// [`Bound`]: core::ops::Bound
26872693 #[ unstable( feature = "btree_cursors" , issue = "107540" ) ]
26882694 pub fn upper_bound < Q : ?Sized > ( & self , bound : Bound < & Q > ) -> Cursor < ' _ , K , V >
26892695 where
@@ -2737,6 +2743,8 @@ impl<K, V, A: Allocator + Clone> BTreeMap<K, V, A> {
27372743 /// assert_eq!(cursor.peek_prev(), Some((&4, &mut "d")));
27382744 /// assert_eq!(cursor.peek_next(), None);
27392745 /// ```
2746+ ///
2747+ /// [`Bound`]: core::ops::Bound
27402748 #[ unstable( feature = "btree_cursors" , issue = "107540" ) ]
27412749 pub fn upper_bound_mut < Q : ?Sized > ( & mut self , bound : Bound < & Q > ) -> CursorMut < ' _ , K , V , A >
27422750 where
0 commit comments