fix intra-doc links
This commit is contained in:
parent
f415339052
commit
f34d9da7db
1 changed files with 12 additions and 12 deletions
|
@ -2525,13 +2525,13 @@ impl<K, V, A: Allocator + Clone> BTreeMap<K, V, A> {
|
||||||
/// Returns a [`Cursor`] pointing at the gap before the smallest key
|
/// Returns a [`Cursor`] pointing at the gap before the smallest key
|
||||||
/// greater than the given bound.
|
/// greater than the given bound.
|
||||||
///
|
///
|
||||||
/// Passing [`Bound::Included(x)`] will return a cursor pointing to the
|
/// Passing `Bound::Included(x)` will return a cursor pointing to the
|
||||||
/// gap before the smallest key greater than or equal to `x`.
|
/// gap before the smallest key greater than or equal to `x`.
|
||||||
///
|
///
|
||||||
/// Passing [`Bound::Excluded(x)`] will return a cursor pointing to the
|
/// Passing `Bound::Excluded(x)` will return a cursor pointing to the
|
||||||
/// gap before the smallest key greater than `x`.
|
/// gap before the smallest key greater than `x`.
|
||||||
///
|
///
|
||||||
/// Passing [`Bound::Unbounded`] will return a cursor pointing to the
|
/// Passing `Bound::Unbounded` will return a cursor pointing to the
|
||||||
/// gap before the smallest key in the map.
|
/// gap before the smallest key in the map.
|
||||||
///
|
///
|
||||||
/// # Examples
|
/// # Examples
|
||||||
|
@ -2578,13 +2578,13 @@ impl<K, V, A: Allocator + Clone> BTreeMap<K, V, A> {
|
||||||
/// Returns a [`CursorMut`] pointing at the gap before the smallest key
|
/// Returns a [`CursorMut`] pointing at the gap before the smallest key
|
||||||
/// greater than the given bound.
|
/// greater than the given bound.
|
||||||
///
|
///
|
||||||
/// Passing [`Bound::Included(x)`] will return a cursor pointing to the
|
/// Passing `Bound::Included(x)` will return a cursor pointing to the
|
||||||
/// gap before the smallest key greater than or equal to `x`.
|
/// gap before the smallest key greater than or equal to `x`.
|
||||||
///
|
///
|
||||||
/// Passing [`Bound::Excluded(x)`] will return a cursor pointing to the
|
/// Passing `Bound::Excluded(x)` will return a cursor pointing to the
|
||||||
/// gap before the smallest key greater than `x`.
|
/// gap before the smallest key greater than `x`.
|
||||||
///
|
///
|
||||||
/// Passing [`Bound::Unbounded`] will return a cursor pointing to the
|
/// Passing `Bound::Unbounded` will return a cursor pointing to the
|
||||||
/// gap before the smallest key in the map.
|
/// gap before the smallest key in the map.
|
||||||
///
|
///
|
||||||
/// # Examples
|
/// # Examples
|
||||||
|
@ -2648,13 +2648,13 @@ impl<K, V, A: Allocator + Clone> BTreeMap<K, V, A> {
|
||||||
/// Returns a [`Cursor`] pointing at the gap after the greatest key
|
/// Returns a [`Cursor`] pointing at the gap after the greatest key
|
||||||
/// smaller than the given bound.
|
/// smaller than the given bound.
|
||||||
///
|
///
|
||||||
/// Passing [`Bound::Included(x)`] will return a cursor pointing to the
|
/// Passing `Bound::Included(x)` will return a cursor pointing to the
|
||||||
/// gap after the greatest key smaller than or equal to `x`.
|
/// gap after the greatest key smaller than or equal to `x`.
|
||||||
///
|
///
|
||||||
/// Passing [`Bound::Excluded(x)`] will return a cursor pointing to the
|
/// Passing `Bound::Excluded(x)` will return a cursor pointing to the
|
||||||
/// gap after the greatest key smaller than `x`.
|
/// gap after the greatest key smaller than `x`.
|
||||||
///
|
///
|
||||||
/// Passing [`Bound::Unbounded`] will return a cursor pointing to the
|
/// Passing `Bound::Unbounded` will return a cursor pointing to the
|
||||||
/// gap after the greatest key in the map.
|
/// gap after the greatest key in the map.
|
||||||
///
|
///
|
||||||
/// # Examples
|
/// # Examples
|
||||||
|
@ -2701,13 +2701,13 @@ impl<K, V, A: Allocator + Clone> BTreeMap<K, V, A> {
|
||||||
/// Returns a [`CursorMut`] pointing at the gap after the greatest key
|
/// Returns a [`CursorMut`] pointing at the gap after the greatest key
|
||||||
/// smaller than the given bound.
|
/// smaller than the given bound.
|
||||||
///
|
///
|
||||||
/// Passing [`Bound::Included(x)`] will return a cursor pointing to the
|
/// Passing `Bound::Included(x)` will return a cursor pointing to the
|
||||||
/// gap after the greatest key smaller than or equal to `x`.
|
/// gap after the greatest key smaller than or equal to `x`.
|
||||||
///
|
///
|
||||||
/// Passing [`Bound::Excluded(x)`] will return a cursor pointing to the
|
/// Passing `Bound::Excluded(x)` will return a cursor pointing to the
|
||||||
/// gap after the greatest key smaller than `x`.
|
/// gap after the greatest key smaller than `x`.
|
||||||
///
|
///
|
||||||
/// Passing [`Bound::Unbounded`] will return a cursor pointing to the
|
/// Passing `Bound::Unbounded` will return a cursor pointing to the
|
||||||
/// gap after the greatest key in the map.
|
/// gap after the greatest key in the map.
|
||||||
///
|
///
|
||||||
/// # Examples
|
/// # Examples
|
||||||
|
|
Loading…
Add table
Reference in a new issue