fix docs

Author: Icxolu

src/dynamic/drain.rs

@@ -14,7 +14,7 @@ use core::ptr::NonNull;
 /// A draining [iterator](std::iter::Iterator) that removes and returns elements from a
 /// `CircularBuffer`.
 ///
-/// This struct is created by [`CircularBuffer::drain()`]. See its documentation for more details.
+/// This struct is created by [`CircularBufferAlloc::drain()`]. See its documentation for more details.
 pub struct Drain<'a, T> {
     /// This is a pointer and not a reference (`&'a mut CircularBuffer`) because using a reference
     /// would make `Drain` an invariant over `CircularBuffer`, but instead we want `Drain` to be

src/iter.rs

@@ -160,6 +160,9 @@ fn slice_take_last_mut<'a, T>(slice: &mut &'a mut [T]) -> Option<&'a mut T> {
 ///
 /// This struct is created by [`CircularBuffer::iter()`] and [`CircularBuffer::range()`]. See
 /// their documentation for more details.
+///
+/// [`CircularBuffer::iter()`]: crate::CircularBuffer::iter
+/// [`CircularBuffer::range()`]: crate::CircularBuffer::range
 pub struct Iter<'a, T> {
     pub(crate) right: &'a [T],
     pub(crate) left: &'a [T],
@@ -294,6 +297,9 @@ where
 ///
 /// This struct is created by [`CircularBuffer::iter_mut()`] and [`CircularBuffer::range_mut()`].
 /// See their documentation for more details.
+///
+/// [`CircularBuffer::iter_mut()`]: crate::CircularBuffer::iter_mut
+/// [`CircularBuffer::range_mut()`]: crate::CircularBuffer::range_mut
 pub struct IterMut<'a, T> {
     right: &'a mut [T],
     left: &'a mut [T],

src/lib.rs

@@ -322,8 +322,8 @@ macro_rules! impl_buffer {
         /// Because it returns a mutable slice, any [slice methods](slice) may be called on the
         /// elements of the buffer, such as sorting methods.
         ///
-        /// Once the internal storage is contiguous, the [`as_slices()`](CircularBuffer::as_slices) and
-        /// [`as_mut_slices()`](CircularBuffer::as_mut_slices) methods will return the entire contents
+        /// Once the internal storage is contiguous, the [`as_slices()`](Self::as_slices) and
+        /// [`as_mut_slices()`](Self::as_mut_slices) methods will return the entire contents
         /// of the deque in a single slice. Adding new elements to the buffer may make the buffer
         /// disjoint (not contiguous).
         ///
@@ -796,7 +796,7 @@ macro_rules! impl_buffer {
         /// If the buffer is full, the element at the front of the buffer is automatically dropped and
         /// overwritten.
         ///
-        /// See also [`try_push_back()`](CircularBuffer::try_push_back) for a non-overwriting version
+        /// See also [`try_push_back()`](Self::try_push_back) for a non-overwriting version
         /// of this method.
         ///
         /// # Examples
@@ -1390,7 +1390,7 @@ macro_rules! impl_buffer {
 
         /// Clones and appends all the elements from the slice to the back of the buffer.
         ///
-        /// This is an optimized version of [`extend()`](CircularBufferAlloc::extend) for slices.
+        /// This is an optimized version of [`extend()`](Self::extend) for slices.
         ///
         /// If slice contains more values than the available capacity, the elements at the front of the
         /// buffer are dropped.