diff --git a/src/bits.rs b/src/bits.rs
index e7b25b9..2e93345 100644
--- a/src/bits.rs
+++ b/src/bits.rs
@@ -835,7 +835,7 @@ pub fn encode_auto(data: &[u8], ec_level: ErrorCorrectionLevel) -> QrResult<Bits
             let min_version = find_min_version(total_len, ec_level);
             let mut bits = Bits::new(min_version);
             bits.reserve_additional(total_len);
-            try!(bits.push_segments(data, opt_segments.move_iter()));
+            try!(bits.push_segments(data, opt_segments.into_iter()));
             try!(bits.push_terminator(ec_level));
             return Ok(bits);
         }
diff --git a/src/ec.rs b/src/ec.rs
index 05f5dbb..ca72e48 100644
--- a/src/ec.rs
+++ b/src/ec.rs
@@ -15,8 +15,8 @@ use types::{QrResult, QrVersion, ErrorCorrectionLevel};
 /// GF(256), and then computes the polynomial modulus with a generator
 /// polynomial of degree N.
 pub fn create_error_correction_code(data: &[u8], ec_code_size: uint) -> Vec<u8> {
-    let mut res = Vec::from_slice(data);
-    res.grow(ec_code_size, &0);
+    let mut res = data.to_vec();
+    res.grow(ec_code_size, 0);
 
     let data_len = data.len();
     let log_den = GENERATOR_POLYNOMIALS[ec_code_size];