Skip to content

Commit 708b6e7

Browse files
committed
Fix broken links
1 parent f4badde commit 708b6e7

File tree

3 files changed

+6
-0
lines changed

3 files changed

+6
-0
lines changed

src/map.rs

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -944,6 +944,8 @@ impl<K, V, S, A: Allocator> HashMap<K, V, S, A> {
944944
///
945945
/// Keeps the allocated memory for reuse.
946946
///
947+
/// [`retain()`]: HashMap::retain
948+
///
947949
/// # Examples
948950
///
949951
/// ```

src/raw/mod.rs

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -910,6 +910,8 @@ impl<T, A: Allocator> RawTable<T, A> {
910910
///
911911
/// The caller must ensure that the `RawTable` outlives the returned [`NonNull<T>`],
912912
/// otherwise using it may result in [`undefined behavior`].
913+
///
914+
/// [`undefined behavior`]: https://doc.rust-lang.org/reference/behavior-considered-undefined.html
913915
#[inline]
914916
pub fn data_end(&self) -> NonNull<T> {
915917
// SAFETY: `self.table.ctrl` is `NonNull`, so casting it is safe

src/set.rs

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -383,6 +383,8 @@ impl<T, S, A: Allocator> HashSet<T, S, A> {
383383
/// or the iteration short-circuits, then the remaining elements will be retained.
384384
/// Use [`retain()`] with a negated predicate if you do not need the returned iterator.
385385
///
386+
/// [`retain()`]: HashSet::retain
387+
///
386388
/// # Examples
387389
///
388390
/// ```

0 commit comments

Comments
 (0)