From 9effeb8abfe90df4103216dcb771868e1e5a424c Mon Sep 17 00:00:00 2001
From: Jujumba <far77578@gmail.com>
Date: Tue, 16 Jul 2024 13:21:40 +0200
Subject: [PATCH] Fix requests for changes

---
 src/lib.rs | 8 +++++---
 1 file changed, 5 insertions(+), 3 deletions(-)

diff --git a/src/lib.rs b/src/lib.rs
index 5038422..33e14e1 100644
--- a/src/lib.rs
+++ b/src/lib.rs
@@ -1623,7 +1623,7 @@ impl<B: BitBlock> BitVec<B> {
     /// Inserts a given bit at index `at`, shifting all bits after by one
     ///
     /// # Panics
-    /// Panics if `at > nbits`
+    /// Panics if `at` is out of bounds for `BitVec`'s length (that is, if `at > BitVec::len()`)
     ///
     /// # Examples
     ///```
@@ -1635,7 +1635,6 @@ impl<B: BitBlock> BitVec<B> {
     /// b.push(true);
     /// b.insert(1, false);
     ///
-    /// assert_eq!(b.len(), 3);
     /// assert!(b.eq_vec(&[true, false, true]));
     ///```
     ///
@@ -1643,7 +1642,8 @@ impl<B: BitBlock> BitVec<B> {
     /// Takes O([`BitVec::len`]) time. All items after the insertion index must be
     /// shifted to the right. In the worst case, all elements are shifted when
     /// the insertion index is 0.
-
+    ///
+    /// [`BitVec::len`]: Self::len
     pub fn insert(&mut self, at: usize, bit: bool) {
         assert!(
             at <= self.nbits,
@@ -3180,5 +3180,7 @@ mod tests {
             false, false, false, false, false, false, false, false, false, false, false, false,
             false, false, false, true, false
         ]));
+
+        assert_eq!(v.storage().len(), 3);
     }
 }