nordic-dev.net/rust
nordic-dev.net/rust
2
0
Fork 0
mirror of https://github.com/rust-lang/rust.git synced 2024-12-03 12:13:43 +00:00
Code Issues Packages Projects Releases Wiki Activity

fix intra-doc links

Browse Source
This commit is contained in:
ripytide 2024-02-11 17:15:43 +00:00
parent f415339052
commit f34d9da7db
No known key found for this signature in database
GPG Key ID: B2629F9EC7C2FE8C
1 changed files with 12 additions and 12 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

24
library/alloc/src/collections/btree/map.rs
View File

@ -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
/// 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`.
///
/// 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`.
///
/// 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.
///
/// # 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
/// 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`.
///
/// 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`.
///
/// 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.
///
/// # 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
/// 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`.
///
/// 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`.
///
/// 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.
///
/// # 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
/// 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`.
///
/// 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`.
///
/// 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.
///
/// # Examples