Fix and improve docs.

src/lib.rs

@@ -49,7 +49,7 @@
 //! - [`IndexSet`](struct.IndexSet.html) -- hash set
 //! - [`LinearMap`](struct.LinearMap.html)
 //! - [`Pool`](pool/struct.Pool.html) -- lock-free memory pool
-//! - [`String`](struct.String.html)
+//! - [`String`](crate::string::String)
 //! - [`Vec`](struct.Vec.html)
 //! - [`mpmc::Q*`](mpmc/index.html) -- multiple producer multiple consumer lock-free queue
 //! - [`spsc::Queue`](spsc/struct.Queue.html) -- single producer single consumer lock-free queue

src/vec.rs

@@ -627,10 +627,10 @@ impl<T, const N: usize> Vec<T, N> {
     /// worst-case performance of *O*(*n*). If you don't need the order of elements
     /// to be preserved, use [`swap_remove`] instead. If you'd like to remove
     /// elements from the beginning of the `Vec`, consider using
-    /// [`VecDeque::pop_front`] instead.
+    /// [`Deque::pop_front`] instead.
     ///
     /// [`swap_remove`]: Vec::swap_remove
-    /// [`VecDeque::pop_front`]: crate::VecDeque::pop_front
+    /// [`Deque::pop_front`]: crate::Deque::pop_front
     ///
     /// # Panics
     ///
@@ -853,7 +853,7 @@ impl<const N: usize> fmt::Write for Vec<u8, N> {
 
 impl<T, const N: usize> Drop for Vec<T, N> {
     fn drop(&mut self) {
-        // We drop each element used in the vector by turning into a &mut[T]
+        // We drop each element used in the vector by turning into a `&mut [T]`.
         unsafe {
             ptr::drop_in_place(self.as_mut_slice());
         }