Implement insert_slice for SmallVec

Add benchmark for insert_many

lib.rs

@@ -315,6 +315,16 @@ impl<A: Array> SmallVec<A> {
             self.set_len(len + 1);
         }
     }
+
+    pub fn insert_many<I: IntoIterator<Item=A::Item>>(&mut self, index: usize, iterable: I) {
+        let iter = iterable.into_iter();
+        let (lower_size_bound, _) = iter.size_hint();
+        self.reserve(lower_size_bound);
+
+        for (off, elem) in iter.enumerate() {
+            self.insert(index + off, elem);
+        }
+    }
 }
 
 impl<A: Array> ops::Deref for SmallVec<A> {
@@ -869,6 +879,17 @@ pub mod tests {
         assert_eq!(&v.iter().map(|v| **v).collect::<Vec<_>>(), &[0, 3, 2]);
     }
 
+    #[test]
+    fn test_insert_many() {
+        let mut v: SmallVec<[u8; 8]> = SmallVec::new();
+        for x in 0..4 {
+            v.push(x);
+        }
+        assert_eq!(v.len(), 4);
+        v.insert_many(1, [5, 6].iter().cloned());
+        assert_eq!(&v.iter().map(|v| *v).collect::<Vec<_>>(), &[0, 5, 6, 1, 2, 3]);
+    }
+
     #[test]
     #[should_panic]
     fn test_drop_panic_smallvec() {
@@ -1039,6 +1060,14 @@ mod bench {
         });
     }
 
+    #[bench]
+    fn bench_insert_many(b: &mut Bencher) {
+        b.iter(|| {
+            let mut vec: SmallVec<[u64; 16]> = SmallVec::new();
+            vec.insert_many(0, 0..100);
+        });
+    }
+
     #[bench]
     fn bench_extend(b: &mut Bencher) {
         b.iter(|| {