// option. This file may not be copied, modified, or distributed
// except according to those terms.
-//! A growable list type, written `Vec<T>` but pronounced 'vector.'
+//! A contiguous growable array type with heap-allocated contents, written
+//! `Vec<T>` but pronounced 'vector.'
//!
-//! Vectors have `O(1)` indexing, push (to the end) and pop (from the end).
+//! Vectors have `O(1)` indexing, amortized `O(1)` push (to the end) and
+//! `O(1)` pop (from the end).
//!
//! # Examples
//!
-//! Explicitly creating a `Vec<T>` with `new()`:
+//! You can explicitly create a `Vec<T>` with `new()`:
//!
//! ```
-//! let xs: Vec<i32> = Vec::new();
+//! let v: Vec<i32> = Vec::new();
//! ```
//!
-//! Using the `vec!` macro:
+//! ...or by using the `vec!` macro:
//!
//! ```
-//! let ys: Vec<i32> = vec![];
+//! let v: Vec<i32> = vec![];
//!
-//! let zs = vec![1i32, 2, 3, 4, 5];
+//! let v = vec![1, 2, 3, 4, 5];
+//!
+//! let v = vec![0; 10]; // ten zeroes
//! ```
//!
-//! Push:
+//! You can `push` values onto the end of a vector (which will grow the vector
+//! as needed):
//!
//! ```
-//! let mut xs = vec![1i32, 2];
+//! let mut v = vec![1, 2];
//!
-//! xs.push(3);
+//! v.push(3);
//! ```
//!
-//! And pop:
+//! Popping values works in much the same way:
//!
//! ```
-//! let mut xs = vec![1i32, 2];
+//! let mut v = vec![1, 2];
//!
-//! let two = xs.pop();
+//! let two = v.pop();
+//! ```
+//!
+//! Vectors also support indexing (through the `Index` and `IndexMut` traits):
+//!
+//! ```
+//! let mut v = vec![1, 2, 3];
+//! let three = v[2];
+//! v[1] = v[1] + 5;
//! ```
-#![stable]
-
-use core::prelude::*;
+#![stable(feature = "rust1", since = "1.0.0")]
use alloc::boxed::Box;
-use alloc::heap::{EMPTY, allocate, reallocate, deallocate};
-use core::borrow::{Cow, IntoCow};
-use core::cmp::max;
-use core::cmp::{Ordering};
-use core::default::Default;
+use alloc::heap::EMPTY;
+use alloc::raw_vec::RawVec;
+use borrow::ToOwned;
+use borrow::Cow;
+use core::cmp::Ordering;
use core::fmt;
use core::hash::{self, Hash};
-use core::iter::{repeat, FromIterator};
-use core::marker::{ContravariantLifetime, InvariantType};
+use core::intrinsics::{arith_offset, assume};
+use core::iter::{FromIterator, FusedIterator};
use core::mem;
-use core::nonzero::NonZero;
-use core::num::{Int, UnsignedInt};
-use core::ops::{Index, IndexMut, Deref, Add};
+use core::ops::{Index, IndexMut};
use core::ops;
use core::ptr;
-use core::raw::Slice as RawSlice;
-use core::uint;
+use core::ptr::Shared;
+use core::slice;
-/// A growable list type, written `Vec<T>` but pronounced 'vector.'
+use super::SpecExtend;
+use super::range::RangeArgument;
+
+/// A contiguous growable array type, written `Vec<T>` but pronounced 'vector.'
///
/// # Examples
///
/// ```
/// let mut vec = Vec::new();
-/// vec.push(1i);
-/// vec.push(2i);
+/// vec.push(1);
+/// vec.push(2);
///
/// assert_eq!(vec.len(), 2);
/// assert_eq!(vec[0], 1);
/// assert_eq!(vec.pop(), Some(2));
/// assert_eq!(vec.len(), 1);
///
-/// vec[0] = 7i;
+/// vec[0] = 7;
/// assert_eq!(vec[0], 7);
///
-/// vec.push_all(&[1, 2, 3]);
+/// vec.extend([1, 2, 3].iter().cloned());
///
-/// for x in vec.iter() {
+/// for x in &vec {
/// println!("{}", x);
/// }
-/// assert_eq!(vec, vec![7i, 1, 2, 3]);
+/// assert_eq!(vec, [7, 1, 2, 3]);
/// ```
///
/// The `vec!` macro is provided to make initialization more convenient:
///
/// ```
-/// let mut vec = vec![1i, 2i, 3i];
+/// let mut vec = vec![1, 2, 3];
/// vec.push(4);
-/// assert_eq!(vec, vec![1, 2, 3, 4]);
+/// assert_eq!(vec, [1, 2, 3, 4]);
+/// ```
+///
+/// It can also initialize each element of a `Vec<T>` with a given value:
+///
+/// ```
+/// let vec = vec![0; 5];
+/// assert_eq!(vec, [0, 0, 0, 0, 0]);
/// ```
///
/// Use a `Vec<T>` as an efficient stack:
/// ```
/// let mut stack = Vec::new();
///
-/// stack.push(1i);
-/// stack.push(2i);
-/// stack.push(3i);
+/// stack.push(1);
+/// stack.push(2);
+/// stack.push(3);
///
-/// loop {
-/// let top = match stack.pop() {
-/// None => break, // empty
-/// Some(x) => x,
-/// };
+/// while let Some(top) = stack.pop() {
/// // Prints 3, 2, 1
/// println!("{}", top);
/// }
/// ```
///
+/// # Indexing
+///
+/// The Vec type allows to access values by index, because it implements the
+/// `Index` trait. An example will be more explicit:
+///
+/// ```
+/// let v = vec!(0, 2, 4, 6);
+/// println!("{}", v[1]); // it will display '2'
+/// ```
+///
+/// However be careful: if you try to access an index which isn't in the Vec,
+/// your software will panic! You cannot do this:
+///
+/// ```ignore
+/// let v = vec!(0, 2, 4, 6);
+/// println!("{}", v[6]); // it will panic!
+/// ```
+///
+/// In conclusion: always check if the index you want to get really exists
+/// before doing it.
+///
+/// # Slicing
+///
+/// A Vec can be mutable. Slices, on the other hand, are read-only objects.
+/// To get a slice, use "&". Example:
+///
+/// ```
+/// fn read_slice(slice: &[usize]) {
+/// // ...
+/// }
+///
+/// let v = vec!(0, 1);
+/// read_slice(&v);
+///
+/// // ... and that's all!
+/// // you can also do it like this:
+/// let x : &[usize] = &v;
+/// ```
+///
+/// In Rust, it's more common to pass slices as arguments rather than vectors
+/// when you just want to provide a read access. The same goes for String and
+/// &str.
+///
/// # Capacity and reallocation
///
-/// The capacity of a vector is the amount of space allocated for any future elements that will be
-/// added onto the vector. This is not to be confused with the *length* of a vector, which
-/// specifies the number of actual elements within the vector. If a vector's length exceeds its
-/// capacity, its capacity will automatically be increased, but its elements will have to be
+/// The capacity of a vector is the amount of space allocated for any future
+/// elements that will be added onto the vector. This is not to be confused with
+/// the *length* of a vector, which specifies the number of actual elements
+/// within the vector. If a vector's length exceeds its capacity, its capacity
+/// will automatically be increased, but its elements will have to be
/// reallocated.
///
-/// For example, a vector with capacity 10 and length 0 would be an empty vector with space for 10
-/// more elements. Pushing 10 or fewer elements onto the vector will not change its capacity or
-/// cause reallocation to occur. However, if the vector's length is increased to 11, it will have
-/// to reallocate, which can be slow. For this reason, it is recommended to use
-/// `Vec::with_capacity` whenever possible to specify how big the vector is expected to get.
-#[unsafe_no_drop_flag]
-#[stable]
+/// For example, a vector with capacity 10 and length 0 would be an empty vector
+/// with space for 10 more elements. Pushing 10 or fewer elements onto the
+/// vector will not change its capacity or cause reallocation to occur. However,
+/// if the vector's length is increased to 11, it will have to reallocate, which
+/// can be slow. For this reason, it is recommended to use `Vec::with_capacity`
+/// whenever possible to specify how big the vector is expected to get.
+///
+/// # Guarantees
+///
+/// Due to its incredibly fundamental nature, Vec makes a lot of guarantees
+/// about its design. This ensures that it's as low-overhead as possible in
+/// the general case, and can be correctly manipulated in primitive ways
+/// by unsafe code. Note that these guarantees refer to an unqualified `Vec<T>`.
+/// If additional type parameters are added (e.g. to support custom allocators),
+/// overriding their defaults may change the behavior.
+///
+/// Most fundamentally, Vec is and always will be a (pointer, capacity, length)
+/// triplet. No more, no less. The order of these fields is completely
+/// unspecified, and you should use the appropriate methods to modify these.
+/// The pointer will never be null, so this type is null-pointer-optimized.
+///
+/// However, the pointer may not actually point to allocated memory. In particular,
+/// if you construct a Vec with capacity 0 via `Vec::new()`, `vec![]`,
+/// `Vec::with_capacity(0)`, or by calling `shrink_to_fit()` on an empty Vec, it
+/// will not allocate memory. Similarly, if you store zero-sized types inside
+/// a Vec, it will not allocate space for them. *Note that in this case the
+/// Vec may not report a `capacity()` of 0*. Vec will allocate if and only
+/// if `mem::size_of::<T>() * capacity() > 0`. In general, Vec's allocation
+/// details are subtle enough that it is strongly recommended that you only
+/// free memory allocated by a Vec by creating a new Vec and dropping it.
+///
+/// If a Vec *has* allocated memory, then the memory it points to is on the heap
+/// (as defined by the allocator Rust is configured to use by default), and its
+/// pointer points to `len()` initialized elements in order (what you would see
+/// if you coerced it to a slice), followed by `capacity() - len()` logically
+/// uninitialized elements.
+///
+/// Vec will never perform a "small optimization" where elements are actually
+/// stored on the stack for two reasons:
+///
+/// * It would make it more difficult for unsafe code to correctly manipulate
+/// a Vec. The contents of a Vec wouldn't have a stable address if it were
+/// only moved, and it would be more difficult to determine if a Vec had
+/// actually allocated memory.
+///
+/// * It would penalize the general case, incurring an additional branch
+/// on every access.
+///
+/// Vec will never automatically shrink itself, even if completely empty. This
+/// ensures no unnecessary allocations or deallocations occur. Emptying a Vec
+/// and then filling it back up to the same `len()` should incur no calls to
+/// the allocator. If you wish to free up unused memory, use `shrink_to_fit`.
+///
+/// `push` and `insert` will never (re)allocate if the reported capacity is
+/// sufficient. `push` and `insert` *will* (re)allocate if `len() == capacity()`.
+/// That is, the reported capacity is completely accurate, and can be relied on.
+/// It can even be used to manually free the memory allocated by a Vec if
+/// desired. Bulk insertion methods *may* reallocate, even when not necessary.
+///
+/// Vec does not guarantee any particular growth strategy when reallocating
+/// when full, nor when `reserve` is called. The current strategy is basic
+/// and it may prove desirable to use a non-constant growth factor. Whatever
+/// strategy is used will of course guarantee `O(1)` amortized `push`.
+///
+/// `vec![x; n]`, `vec![a, b, c, d]`, and `Vec::with_capacity(n)`, will all
+/// produce a Vec with exactly the requested capacity. If `len() == capacity()`,
+/// (as is the case for the `vec!` macro), then a `Vec<T>` can be converted
+/// to and from a `Box<[T]>` without reallocating or moving the elements.
+///
+/// Vec will not specifically overwrite any data that is removed from it,
+/// but also won't specifically preserve it. Its uninitialized memory is
+/// scratch space that it may use however it wants. It will generally just do
+/// whatever is most efficient or otherwise easy to implement. Do not rely on
+/// removed data to be erased for security purposes. Even if you drop a Vec, its
+/// buffer may simply be reused by another Vec. Even if you zero a Vec's memory
+/// first, that may not actually happen because the optimizer does not consider
+/// this a side-effect that must be preserved.
+///
+/// Vec does not currently guarantee the order in which elements are dropped
+/// (the order has changed in the past, and may change again).
+///
+#[cfg_attr(stage0, unsafe_no_drop_flag)]
+#[stable(feature = "rust1", since = "1.0.0")]
pub struct Vec<T> {
- ptr: NonZero<*mut T>,
- len: uint,
- cap: uint,
+ buf: RawVec<T>,
+ len: usize,
}
-unsafe impl<T: Send> Send for Vec<T> { }
-unsafe impl<T: Sync> Sync for Vec<T> { }
-
////////////////////////////////////////////////////////////////////////////////
// Inherent methods
////////////////////////////////////////////////////////////////////////////////
/// # Examples
///
/// ```
- /// let mut vec: Vec<int> = Vec::new();
+ /// # #![allow(unused_mut)]
+ /// let mut vec: Vec<i32> = Vec::new();
/// ```
#[inline]
- #[stable]
+ #[stable(feature = "rust1", since = "1.0.0")]
pub fn new() -> Vec<T> {
- // We want ptr to never be NULL so instead we set it to some arbitrary
- // non-null value which is fine since we never call deallocate on the ptr
- // if cap is 0. The reason for this is because the pointer of a slice
- // being NULL would break the null pointer optimization for enums.
- Vec { ptr: unsafe { NonZero::new(EMPTY as *mut T) }, len: 0, cap: 0 }
+ Vec {
+ buf: RawVec::new(),
+ len: 0,
+ }
}
/// Constructs a new, empty `Vec<T>` with the specified capacity.
///
- /// The vector will be able to hold exactly `capacity` elements without reallocating. If
- /// `capacity` is 0, the vector will not allocate.
+ /// The vector will be able to hold exactly `capacity` elements without
+ /// reallocating. If `capacity` is 0, the vector will not allocate.
///
- /// It is important to note that this function does not specify the *length* of the returned
- /// vector, but only the *capacity*. (For an explanation of the difference between length and
- /// capacity, see the main `Vec<T>` docs above, 'Capacity and reallocation'.)
+ /// It is important to note that this function does not specify the *length*
+ /// of the returned vector, but only the *capacity*. (For an explanation of
+ /// the difference between length and capacity, see the main `Vec<T>` docs
+ /// above, 'Capacity and reallocation'.)
///
/// # Examples
///
/// ```
- /// let mut vec: Vec<int> = Vec::with_capacity(10);
+ /// let mut vec = Vec::with_capacity(10);
///
/// // The vector contains no items, even though it has capacity for more
/// assert_eq!(vec.len(), 0);
///
/// // These are all done without reallocating...
- /// for i in range(0i, 10) {
+ /// for i in 0..10 {
/// vec.push(i);
/// }
///
/// vec.push(11);
/// ```
#[inline]
- #[stable]
- pub fn with_capacity(capacity: uint) -> Vec<T> {
- if mem::size_of::<T>() == 0 {
- Vec { ptr: unsafe { NonZero::new(EMPTY as *mut T) }, len: 0, cap: uint::MAX }
- } else if capacity == 0 {
- Vec::new()
- } else {
- let size = capacity.checked_mul(mem::size_of::<T>())
- .expect("capacity overflow");
- let ptr = unsafe { allocate(size, mem::min_align_of::<T>()) };
- if ptr.is_null() { ::alloc::oom() }
- Vec { ptr: unsafe { NonZero::new(ptr as *mut T) }, len: 0, cap: capacity }
+ #[stable(feature = "rust1", since = "1.0.0")]
+ pub fn with_capacity(capacity: usize) -> Vec<T> {
+ Vec {
+ buf: RawVec::with_capacity(capacity),
+ len: 0,
}
}
/// Creates a `Vec<T>` directly from the raw components of another vector.
///
- /// This is highly unsafe, due to the number of invariants that aren't checked.
+ /// # Safety
+ ///
+ /// This is highly unsafe, due to the number of invariants that aren't
+ /// checked:
+ ///
+ /// * `ptr` needs to have been previously allocated via `String`/`Vec<T>`
+ /// (at least, it's highly likely to be incorrect if it wasn't).
+ /// * `length` needs to be less than or equal to `capacity`.
+ /// * `capacity` needs to be the capacity that the pointer was allocated with.
+ ///
+ /// Violating these may cause problems like corrupting the allocator's
+ /// internal datastructures.
+ ///
+ /// The ownership of `ptr` is effectively transferred to the
+ /// `Vec<T>` which may then deallocate, reallocate or change the
+ /// contents of memory pointed to by the pointer at will. Ensure
+ /// that nothing else uses the pointer after calling this
+ /// function.
///
/// # Examples
///
/// use std::mem;
///
/// fn main() {
- /// let mut v = vec![1i, 2, 3];
+ /// let mut v = vec![1, 2, 3];
///
/// // Pull out the various important pieces of information about `v`
/// let p = v.as_mut_ptr();
/// mem::forget(v);
///
/// // Overwrite memory with 4, 5, 6
- /// for i in range(0, len as int) {
+ /// for i in 0..len as isize {
/// ptr::write(p.offset(i), 4 + i);
/// }
///
/// // Put everything back together into a Vec
/// let rebuilt = Vec::from_raw_parts(p, len, cap);
- /// assert_eq!(rebuilt, vec![4i, 5i, 6i]);
+ /// assert_eq!(rebuilt, [4, 5, 6]);
/// }
/// }
/// ```
- #[stable]
- pub unsafe fn from_raw_parts(ptr: *mut T, length: uint,
- capacity: uint) -> Vec<T> {
- Vec { ptr: NonZero::new(ptr), len: length, cap: capacity }
- }
-
- /// Creates a vector by copying the elements from a raw pointer.
- ///
- /// This function will copy `elts` contiguous elements starting at `ptr` into a new allocation
- /// owned by the returned `Vec<T>`. The elements of the buffer are copied into the vector
- /// without cloning, as if `ptr::read()` were called on them.
- #[inline]
- #[unstable = "may be better expressed via composition"]
- pub unsafe fn from_raw_buf(ptr: *const T, elts: uint) -> Vec<T> {
- let mut dst = Vec::with_capacity(elts);
- dst.set_len(elts);
- ptr::copy_nonoverlapping_memory(dst.as_mut_ptr(), ptr, elts);
- dst
+ #[stable(feature = "rust1", since = "1.0.0")]
+ pub unsafe fn from_raw_parts(ptr: *mut T, length: usize, capacity: usize) -> Vec<T> {
+ Vec {
+ buf: RawVec::from_raw_parts(ptr, capacity),
+ len: length,
+ }
}
/// Returns the number of elements the vector can hold without
/// # Examples
///
/// ```
- /// let vec: Vec<int> = Vec::with_capacity(10);
+ /// let vec: Vec<i32> = Vec::with_capacity(10);
/// assert_eq!(vec.capacity(), 10);
/// ```
#[inline]
- #[stable]
- pub fn capacity(&self) -> uint {
- self.cap
+ #[stable(feature = "rust1", since = "1.0.0")]
+ pub fn capacity(&self) -> usize {
+ self.buf.cap()
}
- /// Reserves capacity for at least `additional` more elements to be inserted in the given
- /// `Vec<T>`. The collection may reserve more space to avoid frequent reallocations.
+ /// Reserves capacity for at least `additional` more elements to be inserted
+ /// in the given `Vec<T>`. The collection may reserve more space to avoid
+ /// frequent reallocations.
///
/// # Panics
///
- /// Panics if the new capacity overflows `uint`.
+ /// Panics if the new capacity overflows `usize`.
///
/// # Examples
///
/// ```
- /// let mut vec: Vec<int> = vec![1];
+ /// let mut vec = vec![1];
/// vec.reserve(10);
/// assert!(vec.capacity() >= 11);
/// ```
- #[stable]
- pub fn reserve(&mut self, additional: uint) {
- if self.cap - self.len < additional {
- let err_msg = "Vec::reserve: `uint` overflow";
- let new_cap = self.len.checked_add(additional).expect(err_msg)
- .checked_next_power_of_two().expect(err_msg);
- self.grow_capacity(new_cap);
- }
+ #[stable(feature = "rust1", since = "1.0.0")]
+ pub fn reserve(&mut self, additional: usize) {
+ self.buf.reserve(self.len, additional);
}
/// Reserves the minimum capacity for exactly `additional` more elements to
///
/// # Panics
///
- /// Panics if the new capacity overflows `uint`.
+ /// Panics if the new capacity overflows `usize`.
///
/// # Examples
///
/// ```
- /// let mut vec: Vec<int> = vec![1];
+ /// let mut vec = vec![1];
/// vec.reserve_exact(10);
/// assert!(vec.capacity() >= 11);
/// ```
- #[stable]
- pub fn reserve_exact(&mut self, additional: uint) {
- if self.cap - self.len < additional {
- match self.len.checked_add(additional) {
- None => panic!("Vec::reserve: `uint` overflow"),
- Some(new_cap) => self.grow_capacity(new_cap)
- }
- }
+ #[stable(feature = "rust1", since = "1.0.0")]
+ pub fn reserve_exact(&mut self, additional: usize) {
+ self.buf.reserve_exact(self.len, additional);
}
/// Shrinks the capacity of the vector as much as possible.
/// # Examples
///
/// ```
- /// let mut vec: Vec<int> = Vec::with_capacity(10);
- /// vec.push_all(&[1, 2, 3]);
+ /// let mut vec = Vec::with_capacity(10);
+ /// vec.extend([1, 2, 3].iter().cloned());
/// assert_eq!(vec.capacity(), 10);
/// vec.shrink_to_fit();
/// assert!(vec.capacity() >= 3);
/// ```
- #[stable]
+ #[stable(feature = "rust1", since = "1.0.0")]
pub fn shrink_to_fit(&mut self) {
- if mem::size_of::<T>() == 0 { return }
-
- if self.len == 0 {
- if self.cap != 0 {
- unsafe {
- dealloc(*self.ptr, self.cap)
- }
- self.cap = 0;
- }
- } else {
- unsafe {
- // Overflow check is unnecessary as the vector is already at
- // least this large.
- let ptr = reallocate(*self.ptr as *mut u8,
- self.cap * mem::size_of::<T>(),
- self.len * mem::size_of::<T>(),
- mem::min_align_of::<T>()) as *mut T;
- if ptr.is_null() { ::alloc::oom() }
- self.ptr = NonZero::new(ptr);
- }
- self.cap = self.len;
- }
+ self.buf.shrink_to_fit(self.len);
}
- /// Convert the vector into Box<[T]>.
+ /// Converts the vector into Box<[T]>.
///
/// Note that this will drop any excess capacity. Calling this and
/// converting back to a vector with `into_vec()` is equivalent to calling
/// `shrink_to_fit()`.
- #[unstable]
+ ///
+ /// # Examples
+ ///
+ /// ```
+ /// let v = vec![1, 2, 3];
+ ///
+ /// let slice = v.into_boxed_slice();
+ /// ```
+ ///
+ /// Any excess capacity is removed:
+ ///
+ /// ```
+ /// let mut vec = Vec::with_capacity(10);
+ /// vec.extend([1, 2, 3].iter().cloned());
+ ///
+ /// assert_eq!(vec.capacity(), 10);
+ /// let slice = vec.into_boxed_slice();
+ /// assert_eq!(slice.into_vec().capacity(), 3);
+ /// ```
+ #[stable(feature = "rust1", since = "1.0.0")]
pub fn into_boxed_slice(mut self) -> Box<[T]> {
- self.shrink_to_fit();
unsafe {
- let xs: Box<[T]> = mem::transmute(self.as_mut_slice());
+ self.shrink_to_fit();
+ let buf = ptr::read(&self.buf);
mem::forget(self);
- xs
+ buf.into_box()
}
}
- /// Shorten a vector, dropping excess elements.
+ /// Shortens the vector, keeping the first `len` elements and dropping
+ /// the rest.
///
/// If `len` is greater than the vector's current length, this has no
/// effect.
///
+ /// The [`drain`] method can emulate `truncate`, but causes the excess
+ /// elements to be returned instead of dropped.
+ ///
/// # Examples
///
+ /// Truncating a five element vector to two elements:
+ ///
/// ```
- /// let mut vec = vec![1i, 2, 3, 4];
+ /// let mut vec = vec![1, 2, 3, 4, 5];
/// vec.truncate(2);
- /// assert_eq!(vec, vec![1, 2]);
+ /// assert_eq!(vec, [1, 2]);
+ /// ```
+ ///
+ /// No truncation occurs when `len` is greater than the vector's current
+ /// length:
+ ///
+ /// ```
+ /// let mut vec = vec![1, 2, 3];
+ /// vec.truncate(8);
+ /// assert_eq!(vec, [1, 2, 3]);
+ /// ```
+ ///
+ /// Truncating when `len == 0` is equivalent to calling the [`clear`]
+ /// method.
+ ///
+ /// ```
+ /// let mut vec = vec![1, 2, 3];
+ /// vec.truncate(0);
+ /// assert_eq!(vec, []);
/// ```
- #[stable]
- pub fn truncate(&mut self, len: uint) {
+ ///
+ /// [`clear`]: #method.clear
+ /// [`drain`]: #method.drain
+ #[stable(feature = "rust1", since = "1.0.0")]
+ pub fn truncate(&mut self, len: usize) {
unsafe {
// drop any extra elements
while len < self.len {
- // decrement len before the read(), so a panic on Drop doesn't
- // re-drop the just-failed value.
+ // decrement len before the drop_in_place(), so a panic on Drop
+ // doesn't re-drop the just-failed value.
self.len -= 1;
- ptr::read(self.get_unchecked(self.len));
+ let len = self.len;
+ ptr::drop_in_place(self.get_unchecked_mut(len));
}
}
}
- /// Returns a mutable slice of the elements of `self`.
+ /// Extracts a slice containing the entire vector.
+ ///
+ /// Equivalent to `&s[..]`.
///
/// # Examples
///
/// ```
- /// fn foo(slice: &mut [int]) {}
- ///
- /// let mut vec = vec![1i, 2];
- /// foo(vec.as_mut_slice());
+ /// use std::io::{self, Write};
+ /// let buffer = vec![1, 2, 3, 5, 8];
+ /// io::sink().write(buffer.as_slice()).unwrap();
/// ```
#[inline]
- #[stable]
- pub fn as_mut_slice<'a>(&'a mut self) -> &'a mut [T] {
- unsafe {
- mem::transmute(RawSlice {
- data: *self.ptr as *const T,
- len: self.len,
- })
- }
+ #[stable(feature = "vec_as_slice", since = "1.7.0")]
+ pub fn as_slice(&self) -> &[T] {
+ self
}
- /// Creates a consuming iterator, that is, one that moves each value out of
- /// the vector (from start to end). The vector cannot be used after calling
- /// this.
+ /// Extracts a mutable slice of the entire vector.
+ ///
+ /// Equivalent to `&mut s[..]`.
///
/// # Examples
///
/// ```
- /// let v = vec!["a".to_string(), "b".to_string()];
- /// for s in v.into_iter() {
- /// // s has type String, not &String
- /// println!("{}", s);
- /// }
+ /// use std::io::{self, Read};
+ /// let mut buffer = vec![0; 3];
+ /// io::repeat(0b101).read_exact(buffer.as_mut_slice()).unwrap();
/// ```
#[inline]
- #[stable]
- pub fn into_iter(self) -> IntoIter<T> {
- unsafe {
- let ptr = *self.ptr;
- let cap = self.cap;
- let begin = ptr as *const T;
- let end = if mem::size_of::<T>() == 0 {
- (ptr as uint + self.len()) as *const T
- } else {
- ptr.offset(self.len() as int) as *const T
- };
- mem::forget(self);
- IntoIter { allocation: ptr, cap: cap, ptr: begin, end: end }
- }
+ #[stable(feature = "vec_as_slice", since = "1.7.0")]
+ pub fn as_mut_slice(&mut self) -> &mut [T] {
+ self
}
/// Sets the length of a vector.
/// # Examples
///
/// ```
- /// let mut v = vec![1u, 2, 3, 4];
+ /// use std::ptr;
+ ///
+ /// let mut vec = vec!['r', 'u', 's', 't'];
+ ///
+ /// unsafe {
+ /// ptr::drop_in_place(&mut vec[3]);
+ /// vec.set_len(3);
+ /// }
+ /// assert_eq!(vec, ['r', 'u', 's']);
+ /// ```
+ ///
+ /// In this example, there is a memory leak since the memory locations
+ /// owned by the inner vectors were not freed prior to the `set_len` call:
+ ///
+ /// ```
+ /// let mut vec = vec![vec![1, 0, 0],
+ /// vec![0, 1, 0],
+ /// vec![0, 0, 1]];
+ /// unsafe {
+ /// vec.set_len(0);
+ /// }
+ /// ```
+ ///
+ /// In this example, the vector gets expanded from zero to four items
+ /// without any memory allocations occurring, resulting in vector
+ /// values of unallocated memory:
+ ///
+ /// ```
+ /// let mut vec: Vec<char> = Vec::new();
+ ///
/// unsafe {
- /// v.set_len(1);
+ /// vec.set_len(4);
/// }
/// ```
#[inline]
- #[stable]
- pub unsafe fn set_len(&mut self, len: uint) {
+ #[stable(feature = "rust1", since = "1.0.0")]
+ pub unsafe fn set_len(&mut self, len: usize) {
self.len = len;
}
/// let mut v = vec!["foo", "bar", "baz", "qux"];
///
/// assert_eq!(v.swap_remove(1), "bar");
- /// assert_eq!(v, vec!["foo", "qux", "baz"]);
+ /// assert_eq!(v, ["foo", "qux", "baz"]);
///
/// assert_eq!(v.swap_remove(0), "foo");
- /// assert_eq!(v, vec!["baz", "qux"]);
+ /// assert_eq!(v, ["baz", "qux"]);
/// ```
#[inline]
- #[stable]
- pub fn swap_remove(&mut self, index: uint) -> T {
+ #[stable(feature = "rust1", since = "1.0.0")]
+ pub fn swap_remove(&mut self, index: usize) -> T {
let length = self.len();
self.swap(index, length - 1);
self.pop().unwrap()
}
/// Inserts an element at position `index` within the vector, shifting all
- /// elements after position `i` one position to the right.
+ /// elements after it to the right.
///
/// # Panics
///
- /// Panics if `index` is not between `0` and the vector's length (both
- /// bounds inclusive).
+ /// Panics if `index` is greater than the vector's length.
///
/// # Examples
///
/// ```
- /// let mut vec = vec![1i, 2, 3];
+ /// let mut vec = vec![1, 2, 3];
/// vec.insert(1, 4);
- /// assert_eq!(vec, vec![1, 4, 2, 3]);
+ /// assert_eq!(vec, [1, 4, 2, 3]);
/// vec.insert(4, 5);
- /// assert_eq!(vec, vec![1, 4, 2, 3, 5]);
+ /// assert_eq!(vec, [1, 4, 2, 3, 5]);
/// ```
- #[stable]
- pub fn insert(&mut self, index: uint, element: T) {
+ #[stable(feature = "rust1", since = "1.0.0")]
+ pub fn insert(&mut self, index: usize, element: T) {
let len = self.len();
assert!(index <= len);
+
// space for the new element
- self.reserve(1);
+ if len == self.buf.cap() {
+ self.buf.double();
+ }
- unsafe { // infallible
+ unsafe {
+ // infallible
// The spot to put the new value
{
- let p = self.as_mut_ptr().offset(index as int);
+ let p = self.as_mut_ptr().offset(index as isize);
// Shift everything over to make space. (Duplicating the
// `index`th element into two consecutive places.)
- ptr::copy_memory(p.offset(1), &*p, len - index);
+ ptr::copy(p, p.offset(1), len - index);
// Write it in, overwriting the first copy of the `index`th
// element.
- ptr::write(&mut *p, element);
+ ptr::write(p, element);
}
self.set_len(len + 1);
}
}
/// Removes and returns the element at position `index` within the vector,
- /// shifting all elements after position `index` one position to the left.
+ /// shifting all elements after it to the left.
///
/// # Panics
///
- /// Panics if `i` is out of bounds.
+ /// Panics if `index` is out of bounds.
///
/// # Examples
///
/// ```
- /// let mut v = vec![1i, 2, 3];
+ /// let mut v = vec![1, 2, 3];
/// assert_eq!(v.remove(1), 2);
- /// assert_eq!(v, vec![1, 3]);
+ /// assert_eq!(v, [1, 3]);
/// ```
- #[stable]
- pub fn remove(&mut self, index: uint) -> T {
+ #[stable(feature = "rust1", since = "1.0.0")]
+ pub fn remove(&mut self, index: usize) -> T {
let len = self.len();
assert!(index < len);
- unsafe { // infallible
+ unsafe {
+ // infallible
let ret;
{
// the place we are taking from.
- let ptr = self.as_mut_ptr().offset(index as int);
+ let ptr = self.as_mut_ptr().offset(index as isize);
// copy it out, unsafely having a copy of the value on
// the stack and in the vector at the same time.
- ret = ptr::read(ptr as *const T);
+ ret = ptr::read(ptr);
// Shift everything down to fill in that spot.
- ptr::copy_memory(ptr, &*ptr.offset(1), len - index - 1);
+ ptr::copy(ptr.offset(1), ptr, len - index - 1);
}
self.set_len(len - 1);
ret
/// # Examples
///
/// ```
- /// let mut vec = vec![1i, 2, 3, 4];
+ /// let mut vec = vec![1, 2, 3, 4];
/// vec.retain(|&x| x%2 == 0);
- /// assert_eq!(vec, vec![2, 4]);
+ /// assert_eq!(vec, [2, 4]);
/// ```
- #[stable]
- pub fn retain<F>(&mut self, mut f: F) where F: FnMut(&T) -> bool {
+ #[stable(feature = "rust1", since = "1.0.0")]
+ pub fn retain<F>(&mut self, mut f: F)
+ where F: FnMut(&T) -> bool
+ {
let len = self.len();
- let mut del = 0u;
+ let mut del = 0;
{
- let v = self.as_mut_slice();
+ let v = &mut **self;
- for i in range(0u, len) {
+ for i in 0..len {
if !f(&v[i]) {
del += 1;
} else if del > 0 {
- v.swap(i-del, i);
+ v.swap(i - del, i);
}
}
}
///
/// # Panics
///
- /// Panics if the number of elements in the vector overflows a `uint`.
+ /// Panics if the number of elements in the vector overflows a `usize`.
///
/// # Examples
///
- /// ```rust
- /// let mut vec = vec!(1i, 2);
+ /// ```
+ /// let mut vec = vec![1, 2];
/// vec.push(3);
- /// assert_eq!(vec, vec!(1, 2, 3));
+ /// assert_eq!(vec, [1, 2, 3]);
/// ```
#[inline]
- #[stable]
+ #[stable(feature = "rust1", since = "1.0.0")]
pub fn push(&mut self, value: T) {
- if mem::size_of::<T>() == 0 {
- // zero-size types consume no memory, so we can't rely on the
- // address space running out
- self.len = self.len.checked_add(1).expect("length overflow");
- unsafe { mem::forget(value); }
- return
- }
- if self.len == self.cap {
- let old_size = self.cap * mem::size_of::<T>();
- let size = max(old_size, 2 * mem::size_of::<T>()) * 2;
- if old_size > size { panic!("capacity overflow") }
- unsafe {
- let ptr = alloc_or_realloc(*self.ptr, old_size, size);
- if ptr.is_null() { ::alloc::oom() }
- self.ptr = NonZero::new(ptr);
- }
- self.cap = max(self.cap, 2) * 2;
+ // This will panic or abort if we would allocate > isize::MAX bytes
+ // or if the length increment would overflow for zero-sized types.
+ if self.len == self.buf.cap() {
+ self.buf.double();
}
-
unsafe {
- let end = (*self.ptr).offset(self.len as int);
- ptr::write(&mut *end, value);
+ let end = self.as_mut_ptr().offset(self.len as isize);
+ ptr::write(end, value);
self.len += 1;
}
}
- /// Removes the last element from a vector and returns it, or `None` if it is empty.
+ /// Removes the last element from a vector and returns it, or `None` if it
+ /// is empty.
///
/// # Examples
///
- /// ```rust
- /// let mut vec = vec![1i, 2, 3];
+ /// ```
+ /// let mut vec = vec![1, 2, 3];
/// assert_eq!(vec.pop(), Some(3));
- /// assert_eq!(vec, vec![1, 2]);
+ /// assert_eq!(vec, [1, 2]);
/// ```
#[inline]
- #[stable]
+ #[stable(feature = "rust1", since = "1.0.0")]
pub fn pop(&mut self) -> Option<T> {
if self.len == 0 {
None
}
}
- /// Creates a draining iterator that clears the `Vec` and iterates over
- /// the removed items from start to end.
+ /// Moves all the elements of `other` into `Self`, leaving `other` empty.
+ ///
+ /// # Panics
+ ///
+ /// Panics if the number of elements in the vector overflows a `usize`.
///
/// # Examples
///
/// ```
- /// let mut v = vec!["a".to_string(), "b".to_string()];
- /// for s in v.drain() {
- /// // s has type String, not &String
- /// println!("{}", s);
- /// }
- /// assert!(v.is_empty());
+ /// let mut vec = vec![1, 2, 3];
+ /// let mut vec2 = vec![4, 5, 6];
+ /// vec.append(&mut vec2);
+ /// assert_eq!(vec, [1, 2, 3, 4, 5, 6]);
+ /// assert_eq!(vec2, []);
/// ```
#[inline]
- #[unstable = "matches collection reform specification, waiting for dust to settle"]
- pub fn drain<'a>(&'a mut self) -> Drain<'a, T> {
+ #[stable(feature = "append", since = "1.4.0")]
+ pub fn append(&mut self, other: &mut Self) {
+ self.reserve(other.len());
+ let len = self.len();
unsafe {
- let begin = *self.ptr as *const T;
- let end = if mem::size_of::<T>() == 0 {
- (*self.ptr as uint + self.len()) as *const T
- } else {
- (*self.ptr).offset(self.len() as int) as *const T
- };
- self.set_len(0);
+ ptr::copy_nonoverlapping(other.as_ptr(), self.get_unchecked_mut(len), other.len());
+ }
+
+ self.len += other.len();
+ unsafe {
+ other.set_len(0);
+ }
+ }
+
+ /// Create a draining iterator that removes the specified range in the vector
+ /// and yields the removed items.
+ ///
+ /// Note 1: The element range is removed even if the iterator is not
+ /// consumed until the end.
+ ///
+ /// Note 2: It is unspecified how many elements are removed from the vector,
+ /// if the `Drain` value is leaked.
+ ///
+ /// # Panics
+ ///
+ /// Panics if the starting point is greater than the end point or if
+ /// the end point is greater than the length of the vector.
+ ///
+ /// # Examples
+ ///
+ /// ```
+ /// let mut v = vec![1, 2, 3];
+ /// let u: Vec<_> = v.drain(1..).collect();
+ /// assert_eq!(v, &[1]);
+ /// assert_eq!(u, &[2, 3]);
+ ///
+ /// // A full range clears the vector
+ /// v.drain(..);
+ /// assert_eq!(v, &[]);
+ /// ```
+ #[stable(feature = "drain", since = "1.6.0")]
+ pub fn drain<R>(&mut self, range: R) -> Drain<T>
+ where R: RangeArgument<usize>
+ {
+ // Memory safety
+ //
+ // When the Drain is first created, it shortens the length of
+ // the source vector to make sure no uninitalized or moved-from elements
+ // are accessible at all if the Drain's destructor never gets to run.
+ //
+ // Drain will ptr::read out the values to remove.
+ // When finished, remaining tail of the vec is copied back to cover
+ // the hole, and the vector length is restored to the new length.
+ //
+ let len = self.len();
+ let start = *range.start().unwrap_or(&0);
+ let end = *range.end().unwrap_or(&len);
+ assert!(start <= end);
+ assert!(end <= len);
+
+ unsafe {
+ // set self.vec length's to start, to be safe in case Drain is leaked
+ self.set_len(start);
+ // Use the borrow in the IterMut to indicate borrowing behavior of the
+ // whole Drain iterator (like &mut T).
+ let range_slice = slice::from_raw_parts_mut(self.as_mut_ptr().offset(start as isize),
+ end - start);
Drain {
- ptr: begin,
- end: end,
- marker: ContravariantLifetime,
+ tail_start: end,
+ tail_len: len - end,
+ iter: range_slice.iter(),
+ vec: Shared::new(self as *mut _),
}
}
}
/// # Examples
///
/// ```
- /// let mut v = vec![1i, 2, 3];
+ /// let mut v = vec![1, 2, 3];
///
/// v.clear();
///
/// assert!(v.is_empty());
/// ```
#[inline]
- #[stable]
+ #[stable(feature = "rust1", since = "1.0.0")]
pub fn clear(&mut self) {
self.truncate(0)
}
/// # Examples
///
/// ```
- /// let a = vec![1i, 2, 3];
+ /// let a = vec![1, 2, 3];
/// assert_eq!(a.len(), 3);
/// ```
#[inline]
- #[stable]
- pub fn len(&self) -> uint { self.len }
+ #[stable(feature = "rust1", since = "1.0.0")]
+ pub fn len(&self) -> usize {
+ self.len
+ }
/// Returns `true` if the vector contains no elements.
///
/// let mut v = Vec::new();
/// assert!(v.is_empty());
///
- /// v.push(1i);
+ /// v.push(1);
/// assert!(!v.is_empty());
/// ```
- #[stable]
- pub fn is_empty(&self) -> bool { self.len() == 0 }
+ #[stable(feature = "rust1", since = "1.0.0")]
+ pub fn is_empty(&self) -> bool {
+ self.len() == 0
+ }
- /// Converts a `Vec<T>` to a `Vec<U>` where `T` and `U` have the same
- /// size and in case they are not zero-sized the same minimal alignment.
+ /// Splits the collection into two at the given index.
+ ///
+ /// Returns a newly allocated `Self`. `self` contains elements `[0, at)`,
+ /// and the returned `Self` contains elements `[at, len)`.
+ ///
+ /// Note that the capacity of `self` does not change.
///
/// # Panics
///
- /// Panics if `T` and `U` have differing sizes or are not zero-sized and
- /// have differing minimal alignments.
+ /// Panics if `at > len`.
///
/// # Examples
///
/// ```
- /// let v = vec![0u, 1, 2];
- /// let w = v.map_in_place(|i| i + 3);
- /// assert_eq!(w.as_slice(), [3, 4, 5].as_slice());
- ///
- /// #[derive(PartialEq, Show)]
- /// struct Newtype(u8);
- /// let bytes = vec![0x11, 0x22];
- /// let newtyped_bytes = bytes.map_in_place(|x| Newtype(x));
- /// assert_eq!(newtyped_bytes.as_slice(), [Newtype(0x11), Newtype(0x22)].as_slice());
+ /// let mut vec = vec![1,2,3];
+ /// let vec2 = vec.split_off(1);
+ /// assert_eq!(vec, [1]);
+ /// assert_eq!(vec2, [2, 3]);
/// ```
- #[unstable = "API may change to provide stronger guarantees"]
- pub fn map_in_place<U, F>(self, mut f: F) -> Vec<U> where F: FnMut(T) -> U {
- // FIXME: Assert statically that the types `T` and `U` have the same
- // size.
- assert!(mem::size_of::<T>() == mem::size_of::<U>());
-
- let mut vec = self;
-
- if mem::size_of::<T>() != 0 {
- // FIXME: Assert statically that the types `T` and `U` have the
- // same minimal alignment in case they are not zero-sized.
-
- // These asserts are necessary because the `min_align_of` of the
- // types are passed to the allocator by `Vec`.
- assert!(mem::min_align_of::<T>() == mem::min_align_of::<U>());
+ #[inline]
+ #[stable(feature = "split_off", since = "1.4.0")]
+ pub fn split_off(&mut self, at: usize) -> Self {
+ assert!(at <= self.len(), "`at` out of bounds");
- // This `as int` cast is safe, because the size of the elements of the
- // vector is not 0, and:
- //
- // 1) If the size of the elements in the vector is 1, the `int` may
- // overflow, but it has the correct bit pattern so that the
- // `.offset()` function will work.
- //
- // Example:
- // Address space 0x0-0xF.
- // `u8` array at: 0x1.
- // Size of `u8` array: 0x8.
- // Calculated `offset`: -0x8.
- // After `array.offset(offset)`: 0x9.
- // (0x1 + 0x8 = 0x1 - 0x8)
- //
- // 2) If the size of the elements in the vector is >1, the `uint` ->
- // `int` conversion can't overflow.
- let offset = vec.len() as int;
- let start = vec.as_mut_ptr();
-
- let mut pv = PartialVecNonZeroSized {
- vec: vec,
-
- start_t: start,
- // This points inside the vector, as the vector has length
- // `offset`.
- end_t: unsafe { start.offset(offset) },
- start_u: start as *mut U,
- end_u: start as *mut U,
- };
- // start_t
- // start_u
- // |
- // +-+-+-+-+-+-+
- // |T|T|T|...|T|
- // +-+-+-+-+-+-+
- // | |
- // end_u end_t
-
- while pv.end_u as *mut T != pv.end_t {
- unsafe {
- // start_u start_t
- // | |
- // +-+-+-+-+-+-+-+-+-+
- // |U|...|U|T|T|...|T|
- // +-+-+-+-+-+-+-+-+-+
- // | |
- // end_u end_t
-
- let t = ptr::read(pv.start_t as *const T);
- // start_u start_t
- // | |
- // +-+-+-+-+-+-+-+-+-+
- // |U|...|U|X|T|...|T|
- // +-+-+-+-+-+-+-+-+-+
- // | |
- // end_u end_t
- // We must not panic here, one cell is marked as `T`
- // although it is not `T`.
-
- pv.start_t = pv.start_t.offset(1);
- // start_u start_t
- // | |
- // +-+-+-+-+-+-+-+-+-+
- // |U|...|U|X|T|...|T|
- // +-+-+-+-+-+-+-+-+-+
- // | |
- // end_u end_t
- // We may panic again.
-
- // The function given by the user might panic.
- let u = f(t);
-
- ptr::write(pv.end_u, u);
- // start_u start_t
- // | |
- // +-+-+-+-+-+-+-+-+-+
- // |U|...|U|U|T|...|T|
- // +-+-+-+-+-+-+-+-+-+
- // | |
- // end_u end_t
- // We should not panic here, because that would leak the `U`
- // pointed to by `end_u`.
-
- pv.end_u = pv.end_u.offset(1);
- // start_u start_t
- // | |
- // +-+-+-+-+-+-+-+-+-+
- // |U|...|U|U|T|...|T|
- // +-+-+-+-+-+-+-+-+-+
- // | |
- // end_u end_t
- // We may panic again.
- }
- }
+ let other_len = self.len - at;
+ let mut other = Vec::with_capacity(other_len);
- // start_u start_t
- // | |
- // +-+-+-+-+-+-+
- // |U|...|U|U|U|
- // +-+-+-+-+-+-+
- // |
- // end_t
- // end_u
- // Extract `vec` and prevent the destructor of
- // `PartialVecNonZeroSized` from running. Note that none of the
- // function calls can panic, thus no resources can be leaked (as the
- // `vec` member of `PartialVec` is the only one which holds
- // allocations -- and it is returned from this function. None of
- // this can panic.
- unsafe {
- let vec_len = pv.vec.len();
- let vec_cap = pv.vec.capacity();
- let vec_ptr = pv.vec.as_mut_ptr() as *mut U;
- mem::forget(pv);
- Vec::from_raw_parts(vec_ptr, vec_len, vec_cap)
- }
- } else {
- // Put the `Vec` into the `PartialVecZeroSized` structure and
- // prevent the destructor of the `Vec` from running. Since the
- // `Vec` contained zero-sized objects, it did not allocate, so we
- // are not leaking memory here.
- let mut pv = PartialVecZeroSized::<T,U> {
- num_t: vec.len(),
- num_u: 0,
- marker_t: InvariantType,
- marker_u: InvariantType,
- };
- unsafe { mem::forget(vec); }
+ // Unsafely `set_len` and copy items to `other`.
+ unsafe {
+ self.set_len(at);
+ other.set_len(other_len);
- while pv.num_t != 0 {
- unsafe {
- // Create a `T` out of thin air and decrement `num_t`. This
- // must not panic between these steps, as otherwise a
- // destructor of `T` which doesn't exist runs.
- let t = mem::uninitialized();
- pv.num_t -= 1;
-
- // The function given by the user might panic.
- let u = f(t);
-
- // Forget the `U` and increment `num_u`. This increment
- // cannot overflow the `uint` as we only do this for a
- // number of times that fits into a `uint` (and start with
- // `0`). Again, we should not panic between these steps.
- mem::forget(u);
- pv.num_u += 1;
- }
- }
- // Create a `Vec` from our `PartialVecZeroSized` and make sure the
- // destructor of the latter will not run. None of this can panic.
- let mut result = Vec::new();
- unsafe {
- result.set_len(pv.num_u);
- mem::forget(pv);
- }
- result
+ ptr::copy_nonoverlapping(self.as_ptr().offset(at as isize),
+ other.as_mut_ptr(),
+ other.len());
}
+ other
}
}
impl<T: Clone> Vec<T> {
/// Resizes the `Vec` in-place so that `len()` is equal to `new_len`.
///
- /// Calls either `extend()` or `truncate()` depending on whether `new_len`
- /// is larger than the current value of `len()` or not.
+ /// If `new_len` is greater than `len()`, the `Vec` is extended by the
+ /// difference, with each additional slot filled with `value`.
+ /// If `new_len` is less than `len()`, the `Vec` is simply truncated.
///
/// # Examples
///
/// ```
/// let mut vec = vec!["hello"];
/// vec.resize(3, "world");
- /// assert_eq!(vec, vec!["hello", "world", "world"]);
+ /// assert_eq!(vec, ["hello", "world", "world"]);
///
- /// let mut vec = vec![1i, 2, 3, 4];
+ /// let mut vec = vec![1, 2, 3, 4];
/// vec.resize(2, 0);
- /// assert_eq!(vec, vec![1, 2]);
+ /// assert_eq!(vec, [1, 2]);
/// ```
- #[unstable = "matches collection reform specification; waiting for dust to settle"]
- pub fn resize(&mut self, new_len: uint, value: T) {
+ #[stable(feature = "vec_resize", since = "1.5.0")]
+ pub fn resize(&mut self, new_len: usize, value: T) {
let len = self.len();
if new_len > len {
- self.extend(repeat(value).take(new_len - len));
+ self.extend_with_element(new_len - len, value);
} else {
self.truncate(new_len);
}
}
- /// Appends all elements in a slice to the `Vec`.
+ /// Extend the vector by `n` additional clones of `value`.
+ fn extend_with_element(&mut self, n: usize, value: T) {
+ self.reserve(n);
+
+ unsafe {
+ let mut ptr = self.as_mut_ptr().offset(self.len() as isize);
+ // Use SetLenOnDrop to work around bug where compiler
+ // may not realize the store through `ptr` trough self.set_len()
+ // don't alias.
+ let mut local_len = SetLenOnDrop::new(&mut self.len);
+
+ // Write all elements except the last one
+ for _ in 1..n {
+ ptr::write(ptr, value.clone());
+ ptr = ptr.offset(1);
+ // Increment the length in every step in case clone() panics
+ local_len.increment_len(1);
+ }
+
+ if n > 0 {
+ // We can write the last element directly without cloning needlessly
+ ptr::write(ptr, value);
+ local_len.increment_len(1);
+ }
+
+ // len set by scope guard
+ }
+ }
+
+ /// Clones and appends all elements in a slice to the `Vec`.
///
/// Iterates over the slice `other`, clones each element, and then appends
/// it to this `Vec`. The `other` vector is traversed in-order.
///
+ /// Note that this function is same as `extend` except that it is
+ /// specialized to work with slices instead. If and when Rust gets
+ /// specialization this function will likely be deprecated (but still
+ /// available).
+ ///
/// # Examples
///
/// ```
- /// let mut vec = vec![1i];
- /// vec.push_all(&[2i, 3, 4]);
- /// assert_eq!(vec, vec![1, 2, 3, 4]);
+ /// let mut vec = vec![1];
+ /// vec.extend_from_slice(&[2, 3, 4]);
+ /// assert_eq!(vec, [1, 2, 3, 4]);
/// ```
- #[inline]
- #[unstable = "likely to be replaced by a more optimized extend"]
- pub fn push_all(&mut self, other: &[T]) {
+ #[stable(feature = "vec_extend_from_slice", since = "1.6.0")]
+ pub fn extend_from_slice(&mut self, other: &[T]) {
self.reserve(other.len());
- for i in range(0, other.len()) {
+ // Unsafe code so this can be optimised to a memcpy (or something
+ // similarly fast) when T is Copy. LLVM is easily confused, so any
+ // extra operations during the loop can prevent this optimisation.
+ unsafe {
let len = self.len();
-
- // Unsafe code so this can be optimised to a memcpy (or something similarly
- // fast) when T is Copy. LLVM is easily confused, so any extra operations
- // during the loop can prevent this optimisation.
- unsafe {
- ptr::write(
- self.get_unchecked_mut(len),
- other.get_unchecked(i).clone());
- self.set_len(len + 1);
+ let ptr = self.get_unchecked_mut(len) as *mut T;
+ // Use SetLenOnDrop to work around bug where compiler
+ // may not realize the store through `ptr` trough self.set_len()
+ // don't alias.
+ let mut local_len = SetLenOnDrop::new(&mut self.len);
+
+ for i in 0..other.len() {
+ ptr::write(ptr.offset(i as isize), other.get_unchecked(i).clone());
+ local_len.increment_len(1);
}
+
+ // len set by scope guard
}
}
}
+// Set the length of the vec when the `SetLenOnDrop` value goes out of scope.
+//
+// The idea is: The length field in SetLenOnDrop is a local variable
+// that the optimizer will see does not alias with any stores through the Vec's data
+// pointer. This is a workaround for alias analysis issue #32155
+struct SetLenOnDrop<'a> {
+ len: &'a mut usize,
+ local_len: usize,
+}
+
+impl<'a> SetLenOnDrop<'a> {
+ #[inline]
+ fn new(len: &'a mut usize) -> Self {
+ SetLenOnDrop { local_len: *len, len: len }
+ }
+
+ #[inline]
+ fn increment_len(&mut self, increment: usize) {
+ self.local_len += increment;
+ }
+}
+
+impl<'a> Drop for SetLenOnDrop<'a> {
+ #[inline]
+ fn drop(&mut self) {
+ *self.len = self.local_len;
+ }
+}
+
impl<T: PartialEq> Vec<T> {
/// Removes consecutive repeated elements in the vector.
///
/// # Examples
///
/// ```
- /// let mut vec = vec![1i, 2, 2, 3, 2];
+ /// let mut vec = vec![1, 2, 2, 3, 2];
///
/// vec.dedup();
///
- /// assert_eq!(vec, vec![1i, 2, 3, 2]);
+ /// assert_eq!(vec, [1, 2, 3, 2]);
/// ```
- #[stable]
+ #[stable(feature = "rust1", since = "1.0.0")]
pub fn dedup(&mut self) {
unsafe {
// Although we have a mutable reference to `self`, we cannot make
// Duplicate, advance r. End of vec. Truncate to w.
let ln = self.len();
- if ln < 1 { return; }
+ if ln <= 1 {
+ return;
+ }
- // Avoid bounds checks by using unsafe pointers.
+ // Avoid bounds checks by using raw pointers.
let p = self.as_mut_ptr();
- let mut r = 1;
- let mut w = 1;
+ let mut r: usize = 1;
+ let mut w: usize = 1;
while r < ln {
- let p_r = p.offset(r as int);
- let p_wm1 = p.offset((w - 1) as int);
+ let p_r = p.offset(r as isize);
+ let p_wm1 = p.offset((w - 1) as isize);
if *p_r != *p_wm1 {
if r != w {
let p_w = p_wm1.offset(1);
// Internal methods and functions
////////////////////////////////////////////////////////////////////////////////
-impl<T> Vec<T> {
- /// Reserves capacity for exactly `capacity` elements in the given vector.
- ///
- /// If the capacity for `self` is already equal to or greater than the
- /// requested capacity, then no action is taken.
- fn grow_capacity(&mut self, capacity: uint) {
- if mem::size_of::<T>() == 0 { return }
-
- if capacity > self.cap {
- let size = capacity.checked_mul(mem::size_of::<T>())
- .expect("capacity overflow");
- unsafe {
- let ptr = alloc_or_realloc(*self.ptr, self.cap * mem::size_of::<T>(), size);
- if ptr.is_null() { ::alloc::oom() }
- self.ptr = NonZero::new(ptr);
- }
- self.cap = capacity;
- }
- }
-}
-
-// FIXME: #13996: need a way to mark the return value as `noalias`
-#[inline(never)]
-unsafe fn alloc_or_realloc<T>(ptr: *mut T, old_size: uint, size: uint) -> *mut T {
- if old_size == 0 {
- allocate(size, mem::min_align_of::<T>()) as *mut T
- } else {
- reallocate(ptr as *mut u8, old_size, size, mem::min_align_of::<T>()) as *mut T
- }
-}
-
-#[inline]
-unsafe fn dealloc<T>(ptr: *mut T, len: uint) {
- if mem::size_of::<T>() != 0 {
- deallocate(ptr as *mut u8,
- len * mem::size_of::<T>(),
- mem::min_align_of::<T>())
- }
+#[doc(hidden)]
+#[stable(feature = "rust1", since = "1.0.0")]
+pub fn from_elem<T: Clone>(elem: T, n: usize) -> Vec<T> {
+ let mut v = Vec::with_capacity(n);
+ v.extend_with_element(n, elem);
+ v
}
////////////////////////////////////////////////////////////////////////////////
// Common trait implementations for Vec
////////////////////////////////////////////////////////////////////////////////
-#[unstable]
-impl<T:Clone> Clone for Vec<T> {
- fn clone(&self) -> Vec<T> { ::slice::SliceExt::to_vec(self.as_slice()) }
+#[stable(feature = "rust1", since = "1.0.0")]
+impl<T: Clone> Clone for Vec<T> {
+ #[cfg(not(test))]
+ fn clone(&self) -> Vec<T> {
+ <[T]>::to_vec(&**self)
+ }
+
+ // HACK(japaric): with cfg(test) the inherent `[T]::to_vec` method, which is
+ // required for this method definition, is not available. Instead use the
+ // `slice::to_vec` function which is only available with cfg(test)
+ // NB see the slice::hack module in slice.rs for more information
+ #[cfg(test)]
+ fn clone(&self) -> Vec<T> {
+ ::slice::to_vec(&**self)
+ }
fn clone_from(&mut self, other: &Vec<T>) {
// drop anything in self that will not be overwritten
- if self.len() > other.len() {
- self.truncate(other.len())
- }
+ self.truncate(other.len());
+ let len = self.len();
// reuse the contained values' allocations/resources.
- for (place, thing) in self.iter_mut().zip(other.iter()) {
- place.clone_from(thing)
- }
+ self.clone_from_slice(&other[..len]);
// self.len <= other.len due to the truncate above, so the
// slice here is always in-bounds.
- let slice = &other[self.len()..];
- self.push_all(slice);
+ self.extend_from_slice(&other[len..]);
}
}
-#[cfg(stage0)]
-impl<S: hash::Writer, T: Hash<S>> Hash<S> for Vec<T> {
- #[inline]
- fn hash(&self, state: &mut S) {
- self.as_slice().hash(state);
- }
-}
-#[cfg(not(stage0))]
-impl<S: hash::Writer + hash::Hasher, T: Hash<S>> Hash<S> for Vec<T> {
+#[stable(feature = "rust1", since = "1.0.0")]
+impl<T: Hash> Hash for Vec<T> {
#[inline]
- fn hash(&self, state: &mut S) {
- self.as_slice().hash(state);
+ fn hash<H: hash::Hasher>(&self, state: &mut H) {
+ Hash::hash(&**self, state)
}
}
-#[unstable = "waiting on Index stability"]
-impl<T> Index<uint> for Vec<T> {
+#[stable(feature = "rust1", since = "1.0.0")]
+impl<T> Index<usize> for Vec<T> {
type Output = T;
#[inline]
- fn index<'a>(&'a self, index: &uint) -> &'a T {
- &self.as_slice()[*index]
+ fn index(&self, index: usize) -> &T {
+ // NB built-in indexing via `&[T]`
+ &(**self)[index]
}
}
-impl<T> IndexMut<uint> for Vec<T> {
- type Output = T;
-
+#[stable(feature = "rust1", since = "1.0.0")]
+impl<T> IndexMut<usize> for Vec<T> {
#[inline]
- fn index_mut<'a>(&'a mut self, index: &uint) -> &'a mut T {
- &mut self.as_mut_slice()[*index]
+ fn index_mut(&mut self, index: usize) -> &mut T {
+ // NB built-in indexing via `&mut [T]`
+ &mut (**self)[index]
}
}
-impl<T> ops::Index<ops::Range<uint>> for Vec<T> {
+#[stable(feature = "rust1", since = "1.0.0")]
+impl<T> ops::Index<ops::Range<usize>> for Vec<T> {
type Output = [T];
+
#[inline]
- fn index(&self, index: &ops::Range<uint>) -> &[T] {
- self.as_slice().index(index)
+ fn index(&self, index: ops::Range<usize>) -> &[T] {
+ Index::index(&**self, index)
}
}
-impl<T> ops::Index<ops::RangeTo<uint>> for Vec<T> {
+#[stable(feature = "rust1", since = "1.0.0")]
+impl<T> ops::Index<ops::RangeTo<usize>> for Vec<T> {
type Output = [T];
+
#[inline]
- fn index(&self, index: &ops::RangeTo<uint>) -> &[T] {
- self.as_slice().index(index)
+ fn index(&self, index: ops::RangeTo<usize>) -> &[T] {
+ Index::index(&**self, index)
}
}
-impl<T> ops::Index<ops::RangeFrom<uint>> for Vec<T> {
+#[stable(feature = "rust1", since = "1.0.0")]
+impl<T> ops::Index<ops::RangeFrom<usize>> for Vec<T> {
type Output = [T];
+
#[inline]
- fn index(&self, index: &ops::RangeFrom<uint>) -> &[T] {
- self.as_slice().index(index)
+ fn index(&self, index: ops::RangeFrom<usize>) -> &[T] {
+ Index::index(&**self, index)
}
}
-impl<T> ops::Index<ops::FullRange> for Vec<T> {
+#[stable(feature = "rust1", since = "1.0.0")]
+impl<T> ops::Index<ops::RangeFull> for Vec<T> {
type Output = [T];
+
#[inline]
- fn index(&self, _index: &ops::FullRange) -> &[T] {
- self.as_slice()
+ fn index(&self, _index: ops::RangeFull) -> &[T] {
+ self
}
}
-
-impl<T> ops::IndexMut<ops::Range<uint>> for Vec<T> {
+#[unstable(feature = "inclusive_range", reason = "recently added, follows RFC", issue = "28237")]
+impl<T> ops::Index<ops::RangeInclusive<usize>> for Vec<T> {
type Output = [T];
+
#[inline]
- fn index_mut(&mut self, index: &ops::Range<uint>) -> &mut [T] {
- self.as_mut_slice().index_mut(index)
+ fn index(&self, index: ops::RangeInclusive<usize>) -> &[T] {
+ Index::index(&**self, index)
}
}
-impl<T> ops::IndexMut<ops::RangeTo<uint>> for Vec<T> {
+#[unstable(feature = "inclusive_range", reason = "recently added, follows RFC", issue = "28237")]
+impl<T> ops::Index<ops::RangeToInclusive<usize>> for Vec<T> {
type Output = [T];
+
#[inline]
- fn index_mut(&mut self, index: &ops::RangeTo<uint>) -> &mut [T] {
- self.as_mut_slice().index_mut(index)
+ fn index(&self, index: ops::RangeToInclusive<usize>) -> &[T] {
+ Index::index(&**self, index)
}
}
-impl<T> ops::IndexMut<ops::RangeFrom<uint>> for Vec<T> {
- type Output = [T];
+
+#[stable(feature = "rust1", since = "1.0.0")]
+impl<T> ops::IndexMut<ops::Range<usize>> for Vec<T> {
#[inline]
- fn index_mut(&mut self, index: &ops::RangeFrom<uint>) -> &mut [T] {
- self.as_mut_slice().index_mut(index)
+ fn index_mut(&mut self, index: ops::Range<usize>) -> &mut [T] {
+ IndexMut::index_mut(&mut **self, index)
}
}
-impl<T> ops::IndexMut<ops::FullRange> for Vec<T> {
- type Output = [T];
+#[stable(feature = "rust1", since = "1.0.0")]
+impl<T> ops::IndexMut<ops::RangeTo<usize>> for Vec<T> {
#[inline]
- fn index_mut(&mut self, _index: &ops::FullRange) -> &mut [T] {
- self.as_mut_slice()
+ fn index_mut(&mut self, index: ops::RangeTo<usize>) -> &mut [T] {
+ IndexMut::index_mut(&mut **self, index)
+ }
+}
+#[stable(feature = "rust1", since = "1.0.0")]
+impl<T> ops::IndexMut<ops::RangeFrom<usize>> for Vec<T> {
+ #[inline]
+ fn index_mut(&mut self, index: ops::RangeFrom<usize>) -> &mut [T] {
+ IndexMut::index_mut(&mut **self, index)
+ }
+}
+#[stable(feature = "rust1", since = "1.0.0")]
+impl<T> ops::IndexMut<ops::RangeFull> for Vec<T> {
+ #[inline]
+ fn index_mut(&mut self, _index: ops::RangeFull) -> &mut [T] {
+ self
+ }
+}
+#[unstable(feature = "inclusive_range", reason = "recently added, follows RFC", issue = "28237")]
+impl<T> ops::IndexMut<ops::RangeInclusive<usize>> for Vec<T> {
+ #[inline]
+ fn index_mut(&mut self, index: ops::RangeInclusive<usize>) -> &mut [T] {
+ IndexMut::index_mut(&mut **self, index)
+ }
+}
+#[unstable(feature = "inclusive_range", reason = "recently added, follows RFC", issue = "28237")]
+impl<T> ops::IndexMut<ops::RangeToInclusive<usize>> for Vec<T> {
+ #[inline]
+ fn index_mut(&mut self, index: ops::RangeToInclusive<usize>) -> &mut [T] {
+ IndexMut::index_mut(&mut **self, index)
}
}
-
-#[stable]
+#[stable(feature = "rust1", since = "1.0.0")]
impl<T> ops::Deref for Vec<T> {
type Target = [T];
- fn deref<'a>(&'a self) -> &'a [T] { self.as_slice() }
+ fn deref(&self) -> &[T] {
+ unsafe {
+ let p = self.buf.ptr();
+ assume(!p.is_null());
+ slice::from_raw_parts(p, self.len)
+ }
+ }
}
-#[stable]
+#[stable(feature = "rust1", since = "1.0.0")]
impl<T> ops::DerefMut for Vec<T> {
- fn deref_mut<'a>(&'a mut self) -> &'a mut [T] { self.as_mut_slice() }
+ fn deref_mut(&mut self) -> &mut [T] {
+ unsafe {
+ let ptr = self.buf.ptr();
+ assume(!ptr.is_null());
+ slice::from_raw_parts_mut(ptr, self.len)
+ }
+ }
}
-#[stable]
+#[stable(feature = "rust1", since = "1.0.0")]
impl<T> FromIterator<T> for Vec<T> {
#[inline]
- fn from_iter<I:Iterator<Item=T>>(mut iterator: I) -> Vec<T> {
- let (lower, _) = iterator.size_hint();
- let mut vector = Vec::with_capacity(lower);
- for element in iterator {
- vector.push(element)
- }
+ fn from_iter<I: IntoIterator<Item = T>>(iter: I) -> Vec<T> {
+ // Unroll the first iteration, as the vector is going to be
+ // expanded on this iteration in every case when the iterable is not
+ // empty, but the loop in extend_desugared() is not going to see the
+ // vector being full in the few subsequent loop iterations.
+ // So we get better branch prediction.
+ let mut iterator = iter.into_iter();
+ let mut vector = match iterator.next() {
+ None => return Vec::new(),
+ Some(element) => {
+ let (lower, _) = iterator.size_hint();
+ let mut vector = Vec::with_capacity(lower.saturating_add(1));
+ unsafe {
+ ptr::write(vector.get_unchecked_mut(0), element);
+ vector.set_len(1);
+ }
+ vector
+ }
+ };
+ vector.extend_desugared(iterator);
vector
}
}
-#[unstable = "waiting on Extend stability"]
-impl<T> Extend<T> for Vec<T> {
+#[stable(feature = "rust1", since = "1.0.0")]
+impl<T> IntoIterator for Vec<T> {
+ type Item = T;
+ type IntoIter = IntoIter<T>;
+
+ /// Creates a consuming iterator, that is, one that moves each value out of
+ /// the vector (from start to end). The vector cannot be used after calling
+ /// this.
+ ///
+ /// # Examples
+ ///
+ /// ```
+ /// let v = vec!["a".to_string(), "b".to_string()];
+ /// for s in v.into_iter() {
+ /// // s has type String, not &String
+ /// println!("{}", s);
+ /// }
+ /// ```
#[inline]
- fn extend<I: Iterator<Item=T>>(&mut self, mut iterator: I) {
- let (lower, _) = iterator.size_hint();
- self.reserve(lower);
- for element in iterator {
- self.push(element)
+ fn into_iter(mut self) -> IntoIter<T> {
+ unsafe {
+ let begin = self.as_mut_ptr();
+ assume(!begin.is_null());
+ let end = if mem::size_of::<T>() == 0 {
+ arith_offset(begin as *const i8, self.len() as isize) as *const T
+ } else {
+ begin.offset(self.len() as isize) as *const T
+ };
+ let cap = self.buf.cap();
+ mem::forget(self);
+ IntoIter {
+ buf: Shared::new(begin),
+ cap: cap,
+ ptr: begin,
+ end: end,
+ }
}
}
}
-impl<A, B> PartialEq<Vec<B>> for Vec<A> where A: PartialEq<B> {
- #[inline]
- fn eq(&self, other: &Vec<B>) -> bool { PartialEq::eq(&**self, &**other) }
- #[inline]
- fn ne(&self, other: &Vec<B>) -> bool { PartialEq::ne(&**self, &**other) }
+#[stable(feature = "rust1", since = "1.0.0")]
+impl<'a, T> IntoIterator for &'a Vec<T> {
+ type Item = &'a T;
+ type IntoIter = slice::Iter<'a, T>;
+
+ fn into_iter(self) -> slice::Iter<'a, T> {
+ self.iter()
+ }
}
-macro_rules! impl_eq {
- ($lhs:ty, $rhs:ty) => {
- impl<'b, A, B> PartialEq<$rhs> for $lhs where A: PartialEq<B> {
- #[inline]
- fn eq(&self, other: &$rhs) -> bool { PartialEq::eq(&**self, &**other) }
- #[inline]
- fn ne(&self, other: &$rhs) -> bool { PartialEq::ne(&**self, &**other) }
- }
+#[stable(feature = "rust1", since = "1.0.0")]
+impl<'a, T> IntoIterator for &'a mut Vec<T> {
+ type Item = &'a mut T;
+ type IntoIter = slice::IterMut<'a, T>;
- impl<'b, A, B> PartialEq<$lhs> for $rhs where B: PartialEq<A> {
- #[inline]
- fn eq(&self, other: &$lhs) -> bool { PartialEq::eq(&**self, &**other) }
- #[inline]
- fn ne(&self, other: &$lhs) -> bool { PartialEq::ne(&**self, &**other) }
- }
+ fn into_iter(mut self) -> slice::IterMut<'a, T> {
+ self.iter_mut()
}
}
-impl_eq! { Vec<A>, &'b [B] }
-impl_eq! { Vec<A>, &'b mut [B] }
-
-impl<'a, A, B> PartialEq<Vec<B>> for CowVec<'a, A> where A: PartialEq<B> + Clone {
- #[inline]
- fn eq(&self, other: &Vec<B>) -> bool { PartialEq::eq(&**self, &**other) }
+#[stable(feature = "rust1", since = "1.0.0")]
+impl<T> Extend<T> for Vec<T> {
#[inline]
- fn ne(&self, other: &Vec<B>) -> bool { PartialEq::ne(&**self, &**other) }
+ fn extend<I: IntoIterator<Item = T>>(&mut self, iter: I) {
+ <Self as SpecExtend<I>>::spec_extend(self, iter);
+ }
}
-impl<'a, A, B> PartialEq<CowVec<'a, A>> for Vec<B> where A: Clone, B: PartialEq<A> {
- #[inline]
- fn eq(&self, other: &CowVec<'a, A>) -> bool { PartialEq::eq(&**self, &**other) }
- #[inline]
- fn ne(&self, other: &CowVec<'a, A>) -> bool { PartialEq::ne(&**self, &**other) }
+impl<I: IntoIterator> SpecExtend<I> for Vec<I::Item> {
+ default fn spec_extend(&mut self, iter: I) {
+ self.extend_desugared(iter.into_iter())
+ }
}
-macro_rules! impl_eq_for_cowvec {
- ($rhs:ty) => {
- impl<'a, 'b, A, B> PartialEq<$rhs> for CowVec<'a, A> where A: PartialEq<B> + Clone {
- #[inline]
- fn eq(&self, other: &$rhs) -> bool { PartialEq::eq(&**self, &**other) }
- #[inline]
- fn ne(&self, other: &$rhs) -> bool { PartialEq::ne(&**self, &**other) }
+impl<T> SpecExtend<Vec<T>> for Vec<T> {
+ fn spec_extend(&mut self, ref mut other: Vec<T>) {
+ self.append(other);
+ }
+}
+
+impl<T> Vec<T> {
+ fn extend_desugared<I: Iterator<Item = T>>(&mut self, mut iterator: I) {
+ // This function should be the moral equivalent of:
+ //
+ // for item in iterator {
+ // self.push(item);
+ // }
+ while let Some(element) = iterator.next() {
+ let len = self.len();
+ if len == self.capacity() {
+ let (lower, _) = iterator.size_hint();
+ self.reserve(lower.saturating_add(1));
+ }
+ unsafe {
+ ptr::write(self.get_unchecked_mut(len), element);
+ // NB can't overflow since we would have had to alloc the address space
+ self.set_len(len + 1);
+ }
}
+ }
+}
+
+#[stable(feature = "extend_ref", since = "1.2.0")]
+impl<'a, T: 'a + Copy> Extend<&'a T> for Vec<T> {
+ fn extend<I: IntoIterator<Item = &'a T>>(&mut self, iter: I) {
+ self.extend(iter.into_iter().cloned());
+ }
+}
- impl<'a, 'b, A, B> PartialEq<CowVec<'a, A>> for $rhs where A: Clone, B: PartialEq<A> {
+macro_rules! __impl_slice_eq1 {
+ ($Lhs: ty, $Rhs: ty) => {
+ __impl_slice_eq1! { $Lhs, $Rhs, Sized }
+ };
+ ($Lhs: ty, $Rhs: ty, $Bound: ident) => {
+ #[stable(feature = "rust1", since = "1.0.0")]
+ impl<'a, 'b, A: $Bound, B> PartialEq<$Rhs> for $Lhs where A: PartialEq<B> {
#[inline]
- fn eq(&self, other: &CowVec<'a, A>) -> bool { PartialEq::eq(&**self, &**other) }
+ fn eq(&self, other: &$Rhs) -> bool { self[..] == other[..] }
#[inline]
- fn ne(&self, other: &CowVec<'a, A>) -> bool { PartialEq::ne(&**self, &**other) }
+ fn ne(&self, other: &$Rhs) -> bool { self[..] != other[..] }
}
}
}
-impl_eq_for_cowvec! { &'b [B] }
-impl_eq_for_cowvec! { &'b mut [B] }
+__impl_slice_eq1! { Vec<A>, Vec<B> }
+__impl_slice_eq1! { Vec<A>, &'b [B] }
+__impl_slice_eq1! { Vec<A>, &'b mut [B] }
+__impl_slice_eq1! { Cow<'a, [A]>, &'b [B], Clone }
+__impl_slice_eq1! { Cow<'a, [A]>, &'b mut [B], Clone }
+__impl_slice_eq1! { Cow<'a, [A]>, Vec<B>, Clone }
+
+macro_rules! array_impls {
+ ($($N: expr)+) => {
+ $(
+ // NOTE: some less important impls are omitted to reduce code bloat
+ __impl_slice_eq1! { Vec<A>, [B; $N] }
+ __impl_slice_eq1! { Vec<A>, &'b [B; $N] }
+ // __impl_slice_eq1! { Vec<A>, &'b mut [B; $N] }
+ // __impl_slice_eq1! { Cow<'a, [A]>, [B; $N], Clone }
+ // __impl_slice_eq1! { Cow<'a, [A]>, &'b [B; $N], Clone }
+ // __impl_slice_eq1! { Cow<'a, [A]>, &'b mut [B; $N], Clone }
+ )+
+ }
+}
+
+array_impls! {
+ 0 1 2 3 4 5 6 7 8 9
+ 10 11 12 13 14 15 16 17 18 19
+ 20 21 22 23 24 25 26 27 28 29
+ 30 31 32
+}
-#[unstable = "waiting on PartialOrd stability"]
+#[stable(feature = "rust1", since = "1.0.0")]
impl<T: PartialOrd> PartialOrd for Vec<T> {
#[inline]
fn partial_cmp(&self, other: &Vec<T>) -> Option<Ordering> {
- self.as_slice().partial_cmp(other.as_slice())
+ PartialOrd::partial_cmp(&**self, &**other)
}
}
-#[unstable = "waiting on Eq stability"]
+#[stable(feature = "rust1", since = "1.0.0")]
impl<T: Eq> Eq for Vec<T> {}
-#[unstable = "waiting on Ord stability"]
+#[stable(feature = "rust1", since = "1.0.0")]
impl<T: Ord> Ord for Vec<T> {
#[inline]
fn cmp(&self, other: &Vec<T>) -> Ordering {
- self.as_slice().cmp(other.as_slice())
+ Ord::cmp(&**self, &**other)
}
}
-impl<T> AsSlice<T> for Vec<T> {
- /// Returns a slice into `self`.
- ///
- /// # Examples
- ///
- /// ```
- /// fn foo(slice: &[int]) {}
- ///
- /// let vec = vec![1i, 2];
- /// foo(vec.as_slice());
- /// ```
- #[inline]
- #[stable]
- fn as_slice<'a>(&'a self) -> &'a [T] {
+#[stable(feature = "rust1", since = "1.0.0")]
+impl<T> Drop for Vec<T> {
+ #[unsafe_destructor_blind_to_params]
+ fn drop(&mut self) {
unsafe {
- mem::transmute(RawSlice {
- data: *self.ptr as *const T,
- len: self.len
- })
+ // use drop for [T]
+ ptr::drop_in_place(&mut self[..]);
}
+ // RawVec handles deallocation
}
}
-#[unstable = "recent addition, needs more experience"]
-impl<'a, T: Clone> Add<&'a [T]> for Vec<T> {
- type Output = Vec<T>;
+#[stable(feature = "rust1", since = "1.0.0")]
+impl<T> Default for Vec<T> {
+ /// Creates an empty `Vec<T>`.
+ fn default() -> Vec<T> {
+ Vec::new()
+ }
+}
- #[inline]
- fn add(mut self, rhs: &[T]) -> Vec<T> {
- self.push_all(rhs);
+#[stable(feature = "rust1", since = "1.0.0")]
+impl<T: fmt::Debug> fmt::Debug for Vec<T> {
+ fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
+ fmt::Debug::fmt(&**self, f)
+ }
+}
+
+#[stable(feature = "rust1", since = "1.0.0")]
+impl<T> AsRef<Vec<T>> for Vec<T> {
+ fn as_ref(&self) -> &Vec<T> {
self
}
}
-#[unsafe_destructor]
-#[stable]
-impl<T> Drop for Vec<T> {
- fn drop(&mut self) {
- // This is (and should always remain) a no-op if the fields are
- // zeroed (when moving out, because of #[unsafe_no_drop_flag]).
- if self.cap != 0 {
- unsafe {
- for x in self.iter() {
- ptr::read(x);
- }
- dealloc(*self.ptr, self.cap)
- }
- }
+#[stable(feature = "vec_as_mut", since = "1.5.0")]
+impl<T> AsMut<Vec<T>> for Vec<T> {
+ fn as_mut(&mut self) -> &mut Vec<T> {
+ self
}
}
-#[stable]
-impl<T> Default for Vec<T> {
- #[stable]
- fn default() -> Vec<T> {
- Vec::new()
+#[stable(feature = "rust1", since = "1.0.0")]
+impl<T> AsRef<[T]> for Vec<T> {
+ fn as_ref(&self) -> &[T] {
+ self
}
}
-#[unstable = "waiting on Show stability"]
-impl<T: fmt::Show> fmt::Show for Vec<T> {
- fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
- fmt::Show::fmt(self.as_slice(), f)
+#[stable(feature = "vec_as_mut", since = "1.5.0")]
+impl<T> AsMut<[T]> for Vec<T> {
+ fn as_mut(&mut self) -> &mut [T] {
+ self
}
}
-impl<'a> fmt::Writer for Vec<u8> {
- fn write_str(&mut self, s: &str) -> fmt::Result {
- self.push_all(s.as_bytes());
- Ok(())
+#[stable(feature = "rust1", since = "1.0.0")]
+impl<'a, T: Clone> From<&'a [T]> for Vec<T> {
+ #[cfg(not(test))]
+ fn from(s: &'a [T]) -> Vec<T> {
+ s.to_vec()
+ }
+ #[cfg(test)]
+ fn from(s: &'a [T]) -> Vec<T> {
+ ::slice::to_vec(s)
+ }
+}
+
+#[stable(feature = "rust1", since = "1.0.0")]
+impl<'a> From<&'a str> for Vec<u8> {
+ fn from(s: &'a str) -> Vec<u8> {
+ From::from(s.as_bytes())
}
}
// Clone-on-write
////////////////////////////////////////////////////////////////////////////////
-#[unstable = "unclear how valuable this alias is"]
-/// A clone-on-write vector
-pub type CowVec<'a, T> = Cow<'a, Vec<T>, [T]>;
-
-#[unstable]
-impl<'a, T> FromIterator<T> for CowVec<'a, T> where T: Clone {
- fn from_iter<I: Iterator<Item=T>>(it: I) -> CowVec<'a, T> {
- Cow::Owned(FromIterator::from_iter(it))
+#[stable(feature = "cow_from_vec", since = "1.7.0")]
+impl<'a, T: Clone> From<&'a [T]> for Cow<'a, [T]> {
+ fn from(s: &'a [T]) -> Cow<'a, [T]> {
+ Cow::Borrowed(s)
}
}
-impl<'a, T: 'a> IntoCow<'a, Vec<T>, [T]> for Vec<T> where T: Clone {
- fn into_cow(self) -> CowVec<'a, T> {
- Cow::Owned(self)
+#[stable(feature = "cow_from_vec", since = "1.7.0")]
+impl<'a, T: Clone> From<Vec<T>> for Cow<'a, [T]> {
+ fn from(v: Vec<T>) -> Cow<'a, [T]> {
+ Cow::Owned(v)
}
}
-impl<'a, T> IntoCow<'a, Vec<T>, [T]> for &'a [T] where T: Clone {
- fn into_cow(self) -> CowVec<'a, T> {
- Cow::Borrowed(self)
+#[stable(feature = "rust1", since = "1.0.0")]
+impl<'a, T> FromIterator<T> for Cow<'a, [T]> where T: Clone {
+ fn from_iter<I: IntoIterator<Item = T>>(it: I) -> Cow<'a, [T]> {
+ Cow::Owned(FromIterator::from_iter(it))
}
}
////////////////////////////////////////////////////////////////////////////////
/// An iterator that moves out of a vector.
-#[stable]
+///
+/// This `struct` is created by the `into_iter` method on [`Vec`][`Vec`] (provided
+/// by the [`IntoIterator`] trait).
+///
+/// [`Vec`]: struct.Vec.html
+/// [`IntoIterator`]: ../../std/iter/trait.IntoIterator.html
+#[stable(feature = "rust1", since = "1.0.0")]
pub struct IntoIter<T> {
- allocation: *mut T, // the block of memory allocated for the vector
- cap: uint, // the capacity of the vector
+ buf: Shared<T>,
+ cap: usize,
ptr: *const T,
- end: *const T
+ end: *const T,
+}
+
+#[stable(feature = "vec_intoiter_debug", since = "")]
+impl<T: fmt::Debug> fmt::Debug for IntoIter<T> {
+ fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
+ f.debug_tuple("IntoIter")
+ .field(&self.as_slice())
+ .finish()
+ }
}
impl<T> IntoIter<T> {
- #[inline]
- /// Drops all items that have not yet been moved and returns the empty vector.
- #[unstable]
- pub fn into_inner(mut self) -> Vec<T> {
+ /// Returns the remaining items of this iterator as a slice.
+ ///
+ /// # Examples
+ ///
+ /// ```rust
+ /// # #![feature(vec_into_iter_as_slice)]
+ /// let vec = vec!['a', 'b', 'c'];
+ /// let mut into_iter = vec.into_iter();
+ /// assert_eq!(into_iter.as_slice(), &['a', 'b', 'c']);
+ /// let _ = into_iter.next().unwrap();
+ /// assert_eq!(into_iter.as_slice(), &['b', 'c']);
+ /// ```
+ #[unstable(feature = "vec_into_iter_as_slice", issue = "35601")]
+ pub fn as_slice(&self) -> &[T] {
unsafe {
- for _x in self { }
- let IntoIter { allocation, cap, ptr: _ptr, end: _end } = self;
- mem::forget(self);
- Vec { ptr: NonZero::new(allocation), cap: cap, len: 0 }
+ slice::from_raw_parts(self.ptr, self.len())
+ }
+ }
+
+ /// Returns the remaining items of this iterator as a mutable slice.
+ ///
+ /// # Examples
+ ///
+ /// ```rust
+ /// # #![feature(vec_into_iter_as_slice)]
+ /// let vec = vec!['a', 'b', 'c'];
+ /// let mut into_iter = vec.into_iter();
+ /// assert_eq!(into_iter.as_slice(), &['a', 'b', 'c']);
+ /// into_iter.as_mut_slice()[2] = 'z';
+ /// assert_eq!(into_iter.next().unwrap(), 'a');
+ /// assert_eq!(into_iter.next().unwrap(), 'b');
+ /// assert_eq!(into_iter.next().unwrap(), 'z');
+ /// ```
+ #[unstable(feature = "vec_into_iter_as_slice", issue = "35601")]
+ pub fn as_mut_slice(&self) -> &mut [T] {
+ unsafe {
+ slice::from_raw_parts_mut(self.ptr as *mut T, self.len())
}
}
}
-#[stable]
+#[stable(feature = "rust1", since = "1.0.0")]
+unsafe impl<T: Send> Send for IntoIter<T> {}
+#[stable(feature = "rust1", since = "1.0.0")]
+unsafe impl<T: Sync> Sync for IntoIter<T> {}
+
+#[stable(feature = "rust1", since = "1.0.0")]
impl<T> Iterator for IntoIter<T> {
type Item = T;
#[inline]
- fn next<'a>(&'a mut self) -> Option<T> {
+ fn next(&mut self) -> Option<T> {
unsafe {
- if self.ptr == self.end {
+ if self.ptr as *const _ == self.end {
None
} else {
if mem::size_of::<T>() == 0 {
// purposefully don't use 'ptr.offset' because for
// vectors with 0-size elements this would return the
// same pointer.
- self.ptr = mem::transmute(self.ptr as uint + 1);
+ self.ptr = arith_offset(self.ptr as *const i8, 1) as *mut T;
// Use a non-null pointer value
- Some(ptr::read(mem::transmute(1u)))
+ Some(ptr::read(EMPTY as *mut T))
} else {
let old = self.ptr;
self.ptr = self.ptr.offset(1);
}
#[inline]
- fn size_hint(&self) -> (uint, Option<uint>) {
- let diff = (self.end as uint) - (self.ptr as uint);
+ fn size_hint(&self) -> (usize, Option<usize>) {
+ let diff = (self.end as usize) - (self.ptr as usize);
let size = mem::size_of::<T>();
- let exact = diff / (if size == 0 {1} else {size});
+ let exact = diff /
+ (if size == 0 {
+ 1
+ } else {
+ size
+ });
(exact, Some(exact))
}
+
+ #[inline]
+ fn count(self) -> usize {
+ self.len()
+ }
}
-#[stable]
+#[stable(feature = "rust1", since = "1.0.0")]
impl<T> DoubleEndedIterator for IntoIter<T> {
#[inline]
- fn next_back<'a>(&'a mut self) -> Option<T> {
+ fn next_back(&mut self) -> Option<T> {
unsafe {
if self.end == self.ptr {
None
} else {
if mem::size_of::<T>() == 0 {
// See above for why 'ptr.offset' isn't used
- self.end = mem::transmute(self.end as uint - 1);
+ self.end = arith_offset(self.end as *const i8, -1) as *mut T;
// Use a non-null pointer value
- Some(ptr::read(mem::transmute(1u)))
+ Some(ptr::read(EMPTY as *mut T))
} else {
self.end = self.end.offset(-1);
- Some(ptr::read(mem::transmute(self.end)))
+ Some(ptr::read(self.end))
}
}
}
}
}
-#[stable]
+#[stable(feature = "rust1", since = "1.0.0")]
impl<T> ExactSizeIterator for IntoIter<T> {}
-#[unsafe_destructor]
-#[stable]
+#[unstable(feature = "fused", issue = "35602")]
+impl<T> FusedIterator for IntoIter<T> {}
+
+#[stable(feature = "vec_into_iter_clone", since = "1.8.0")]
+impl<T: Clone> Clone for IntoIter<T> {
+ fn clone(&self) -> IntoIter<T> {
+ self.as_slice().to_owned().into_iter()
+ }
+}
+
+#[stable(feature = "rust1", since = "1.0.0")]
impl<T> Drop for IntoIter<T> {
+ #[unsafe_destructor_blind_to_params]
fn drop(&mut self) {
// destroy the remaining elements
- if self.cap != 0 {
- for _x in *self {}
- unsafe {
- dealloc(self.allocation, self.cap);
- }
- }
+ for _x in self.by_ref() {}
+
+ // RawVec handles deallocation
+ let _ = unsafe { RawVec::from_raw_parts(*self.buf, self.cap) };
}
}
-/// An iterator that drains a vector.
-#[unsafe_no_drop_flag]
-#[unstable = "recently added as part of collections reform 2"]
-pub struct Drain<'a, T> {
- ptr: *const T,
- end: *const T,
- marker: ContravariantLifetime<'a>,
+/// A draining iterator for `Vec<T>`.
+///
+/// This `struct` is created by the [`drain`] method on [`Vec`].
+///
+/// [`drain`]: struct.Vec.html#method.drain
+/// [`Vec`]: struct.Vec.html
+#[stable(feature = "drain", since = "1.6.0")]
+pub struct Drain<'a, T: 'a> {
+ /// Index of tail to preserve
+ tail_start: usize,
+ /// Length of tail
+ tail_len: usize,
+ /// Current remaining range to remove
+ iter: slice::Iter<'a, T>,
+ vec: Shared<Vec<T>>,
}
-#[stable]
+#[stable(feature = "drain", since = "1.6.0")]
+unsafe impl<'a, T: Sync> Sync for Drain<'a, T> {}
+#[stable(feature = "drain", since = "1.6.0")]
+unsafe impl<'a, T: Send> Send for Drain<'a, T> {}
+
+#[stable(feature = "rust1", since = "1.0.0")]
impl<'a, T> Iterator for Drain<'a, T> {
type Item = T;
#[inline]
fn next(&mut self) -> Option<T> {
- unsafe {
- if self.ptr == self.end {
- None
- } else {
- if mem::size_of::<T>() == 0 {
- // purposefully don't use 'ptr.offset' because for
- // vectors with 0-size elements this would return the
- // same pointer.
- self.ptr = mem::transmute(self.ptr as uint + 1);
-
- // Use a non-null pointer value
- Some(ptr::read(mem::transmute(1u)))
- } else {
- let old = self.ptr;
- self.ptr = self.ptr.offset(1);
-
- Some(ptr::read(old))
- }
- }
- }
+ self.iter.next().map(|elt| unsafe { ptr::read(elt as *const _) })
}
- #[inline]
- fn size_hint(&self) -> (uint, Option<uint>) {
- let diff = (self.end as uint) - (self.ptr as uint);
- let size = mem::size_of::<T>();
- let exact = diff / (if size == 0 {1} else {size});
- (exact, Some(exact))
+ fn size_hint(&self) -> (usize, Option<usize>) {
+ self.iter.size_hint()
}
}
-#[stable]
+#[stable(feature = "rust1", since = "1.0.0")]
impl<'a, T> DoubleEndedIterator for Drain<'a, T> {
#[inline]
fn next_back(&mut self) -> Option<T> {
- unsafe {
- if self.end == self.ptr {
- None
- } else {
- if mem::size_of::<T>() == 0 {
- // See above for why 'ptr.offset' isn't used
- self.end = mem::transmute(self.end as uint - 1);
-
- // Use a non-null pointer value
- Some(ptr::read(mem::transmute(1u)))
- } else {
- self.end = self.end.offset(-1);
-
- Some(ptr::read(self.end))
- }
- }
- }
+ self.iter.next_back().map(|elt| unsafe { ptr::read(elt as *const _) })
}
}
-#[stable]
-impl<'a, T> ExactSizeIterator for Drain<'a, T> {}
-
-#[unsafe_destructor]
-#[stable]
+#[stable(feature = "rust1", since = "1.0.0")]
impl<'a, T> Drop for Drain<'a, T> {
fn drop(&mut self) {
- // self.ptr == self.end == null if drop has already been called,
- // so we can use #[unsafe_no_drop_flag].
-
- // destroy the remaining elements
- for _x in *self {}
- }
-}
-
-////////////////////////////////////////////////////////////////////////////////
-// Conversion from &[T] to &Vec<T>
-////////////////////////////////////////////////////////////////////////////////
-
-/// Wrapper type providing a `&Vec<T>` reference via `Deref`.
-#[unstable]
-pub struct DerefVec<'a, T> {
- x: Vec<T>,
- l: ContravariantLifetime<'a>
-}
-
-#[unstable]
-impl<'a, T> Deref for DerefVec<'a, T> {
- type Target = Vec<T>;
-
- fn deref<'b>(&'b self) -> &'b Vec<T> {
- &self.x
- }
-}
-
-// Prevent the inner `Vec<T>` from attempting to deallocate memory.
-#[unsafe_destructor]
-#[stable]
-impl<'a, T> Drop for DerefVec<'a, T> {
- fn drop(&mut self) {
- self.x.len = 0;
- self.x.cap = 0;
- }
-}
+ // exhaust self first
+ while let Some(_) = self.next() {}
-/// Convert a slice to a wrapper type providing a `&Vec<T>` reference.
-#[unstable]
-pub fn as_vec<'a, T>(x: &'a [T]) -> DerefVec<'a, T> {
- unsafe {
- DerefVec {
- x: Vec::from_raw_parts(x.as_ptr() as *mut T, x.len(), x.len()),
- l: ContravariantLifetime::<'a>
+ if self.tail_len > 0 {
+ unsafe {
+ let source_vec = &mut **self.vec;
+ // memmove back untouched tail, update to new length
+ let start = source_vec.len();
+ let tail = self.tail_start;
+ let src = source_vec.as_ptr().offset(tail as isize);
+ let dst = source_vec.as_mut_ptr().offset(start as isize);
+ ptr::copy(src, dst, self.tail_len);
+ source_vec.set_len(start + self.tail_len);
+ }
}
}
}
-////////////////////////////////////////////////////////////////////////////////
-// Partial vec, used for map_in_place
-////////////////////////////////////////////////////////////////////////////////
-
-/// An owned, partially type-converted vector of elements with non-zero size.
-///
-/// `T` and `U` must have the same, non-zero size. They must also have the same
-/// alignment.
-///
-/// When the destructor of this struct runs, all `U`s from `start_u` (incl.) to
-/// `end_u` (excl.) and all `T`s from `start_t` (incl.) to `end_t` (excl.) are
-/// destructed. Additionally the underlying storage of `vec` will be freed.
-struct PartialVecNonZeroSized<T,U> {
- vec: Vec<T>,
-
- start_u: *mut U,
- end_u: *mut U,
- start_t: *mut T,
- end_t: *mut T,
-}
-
-/// An owned, partially type-converted vector of zero-sized elements.
-///
-/// When the destructor of this struct runs, all `num_t` `T`s and `num_u` `U`s
-/// are destructed.
-struct PartialVecZeroSized<T,U> {
- num_t: uint,
- num_u: uint,
- marker_t: InvariantType<T>,
- marker_u: InvariantType<U>,
-}
-#[unsafe_destructor]
-impl<T,U> Drop for PartialVecNonZeroSized<T,U> {
- fn drop(&mut self) {
- unsafe {
- // `vec` hasn't been modified until now. As it has a length
- // currently, this would run destructors of `T`s which might not be
- // there. So at first, set `vec`s length to `0`. This must be done
- // at first to remain memory-safe as the destructors of `U` or `T`
- // might cause unwinding where `vec`s destructor would be executed.
- self.vec.set_len(0);
-
- // We have instances of `U`s and `T`s in `vec`. Destruct them.
- while self.start_u != self.end_u {
- let _ = ptr::read(self.start_u as *const U); // Run a `U` destructor.
- self.start_u = self.start_u.offset(1);
- }
- while self.start_t != self.end_t {
- let _ = ptr::read(self.start_t as *const T); // Run a `T` destructor.
- self.start_t = self.start_t.offset(1);
- }
- // After this destructor ran, the destructor of `vec` will run,
- // deallocating the underlying memory.
- }
- }
-}
+#[stable(feature = "rust1", since = "1.0.0")]
+impl<'a, T> ExactSizeIterator for Drain<'a, T> {}
-#[unsafe_destructor]
-impl<T,U> Drop for PartialVecZeroSized<T,U> {
- fn drop(&mut self) {
- unsafe {
- // Destruct the instances of `T` and `U` this struct owns.
- while self.num_t != 0 {
- let _: T = mem::uninitialized(); // Run a `T` destructor.
- self.num_t -= 1;
- }
- while self.num_u != 0 {
- let _: U = mem::uninitialized(); // Run a `U` destructor.
- self.num_u -= 1;
- }
- }
- }
-}
-
-#[cfg(test)]
-mod tests {
- use prelude::*;
- use core::mem::size_of;
- use core::iter::repeat;
- use core::ops::FullRange;
- use test::Bencher;
- use super::as_vec;
-
- struct DropCounter<'a> {
- count: &'a mut int
- }
-
- #[unsafe_destructor]
- impl<'a> Drop for DropCounter<'a> {
- fn drop(&mut self) {
- *self.count += 1;
- }
- }
-
- #[test]
- fn test_as_vec() {
- let xs = [1u8, 2u8, 3u8];
- assert_eq!(as_vec(&xs).as_slice(), xs);
- }
-
- #[test]
- fn test_as_vec_dtor() {
- let (mut count_x, mut count_y) = (0, 0);
- {
- let xs = &[DropCounter { count: &mut count_x }, DropCounter { count: &mut count_y }];
- assert_eq!(as_vec(xs).len(), 2);
- }
- assert_eq!(count_x, 1);
- assert_eq!(count_y, 1);
- }
-
- #[test]
- fn test_small_vec_struct() {
- assert!(size_of::<Vec<u8>>() == size_of::<uint>() * 3);
- }
-
- #[test]
- fn test_double_drop() {
- struct TwoVec<T> {
- x: Vec<T>,
- y: Vec<T>
- }
-
- let (mut count_x, mut count_y) = (0, 0);
- {
- let mut tv = TwoVec {
- x: Vec::new(),
- y: Vec::new()
- };
- tv.x.push(DropCounter {count: &mut count_x});
- tv.y.push(DropCounter {count: &mut count_y});
-
- // If Vec had a drop flag, here is where it would be zeroed.
- // Instead, it should rely on its internal state to prevent
- // doing anything significant when dropped multiple times.
- drop(tv.x);
-
- // Here tv goes out of scope, tv.y should be dropped, but not tv.x.
- }
-
- assert_eq!(count_x, 1);
- assert_eq!(count_y, 1);
- }
-
- #[test]
- fn test_reserve() {
- let mut v = Vec::new();
- assert_eq!(v.capacity(), 0);
-
- v.reserve(2);
- assert!(v.capacity() >= 2);
-
- for i in range(0i, 16) {
- v.push(i);
- }
-
- assert!(v.capacity() >= 16);
- v.reserve(16);
- assert!(v.capacity() >= 32);
-
- v.push(16);
-
- v.reserve(16);
- assert!(v.capacity() >= 33)
- }
-
- #[test]
- fn test_extend() {
- let mut v = Vec::new();
- let mut w = Vec::new();
-
- v.extend(range(0i, 3));
- for i in range(0i, 3) { w.push(i) }
-
- assert_eq!(v, w);
-
- v.extend(range(3i, 10));
- for i in range(3i, 10) { w.push(i) }
-
- assert_eq!(v, w);
- }
-
- #[test]
- fn test_slice_from_mut() {
- let mut values = vec![1u8,2,3,4,5];
- {
- let slice = values.slice_from_mut(2);
- assert!(slice == [3, 4, 5]);
- for p in slice.iter_mut() {
- *p += 2;
- }
- }
-
- assert!(values == [1, 2, 5, 6, 7]);
- }
-
- #[test]
- fn test_slice_to_mut() {
- let mut values = vec![1u8,2,3,4,5];
- {
- let slice = values.slice_to_mut(2);
- assert!(slice == [1, 2]);
- for p in slice.iter_mut() {
- *p += 1;
- }
- }
-
- assert!(values == [2, 3, 3, 4, 5]);
- }
-
- #[test]
- fn test_split_at_mut() {
- let mut values = vec![1u8,2,3,4,5];
- {
- let (left, right) = values.split_at_mut(2);
- {
- let left: &[_] = left;
- assert!(&left[..left.len()] == &[1, 2][]);
- }
- for p in left.iter_mut() {
- *p += 1;
- }
-
- {
- let right: &[_] = right;
- assert!(&right[..right.len()] == &[3, 4, 5][]);
- }
- for p in right.iter_mut() {
- *p += 2;
- }
- }
-
- assert!(values == vec![2u8, 3, 5, 6, 7]);
- }
-
- #[test]
- fn test_clone() {
- let v: Vec<int> = vec!();
- let w = vec!(1i, 2, 3);
-
- assert_eq!(v, v.clone());
-
- let z = w.clone();
- assert_eq!(w, z);
- // they should be disjoint in memory.
- assert!(w.as_ptr() != z.as_ptr())
- }
-
- #[test]
- fn test_clone_from() {
- let mut v = vec!();
- let three = vec!(box 1i, box 2, box 3);
- let two = vec!(box 4i, box 5);
- // zero, long
- v.clone_from(&three);
- assert_eq!(v, three);
-
- // equal
- v.clone_from(&three);
- assert_eq!(v, three);
-
- // long, short
- v.clone_from(&two);
- assert_eq!(v, two);
-
- // short, long
- v.clone_from(&three);
- assert_eq!(v, three)
- }
-
- #[test]
- fn test_retain() {
- let mut vec = vec![1u, 2, 3, 4];
- vec.retain(|&x| x % 2 == 0);
- assert!(vec == vec![2u, 4]);
- }
-
- #[test]
- fn zero_sized_values() {
- let mut v = Vec::new();
- assert_eq!(v.len(), 0);
- v.push(());
- assert_eq!(v.len(), 1);
- v.push(());
- assert_eq!(v.len(), 2);
- assert_eq!(v.pop(), Some(()));
- assert_eq!(v.pop(), Some(()));
- assert_eq!(v.pop(), None);
-
- assert_eq!(v.iter().count(), 0);
- v.push(());
- assert_eq!(v.iter().count(), 1);
- v.push(());
- assert_eq!(v.iter().count(), 2);
-
- for &() in v.iter() {}
-
- assert_eq!(v.iter_mut().count(), 2);
- v.push(());
- assert_eq!(v.iter_mut().count(), 3);
- v.push(());
- assert_eq!(v.iter_mut().count(), 4);
-
- for &mut () in v.iter_mut() {}
- unsafe { v.set_len(0); }
- assert_eq!(v.iter_mut().count(), 0);
- }
-
- #[test]
- fn test_partition() {
- assert_eq!(vec![].into_iter().partition(|x: &int| *x < 3), (vec![], vec![]));
- assert_eq!(vec![1i, 2, 3].into_iter().partition(|x: &int| *x < 4), (vec![1, 2, 3], vec![]));
- assert_eq!(vec![1i, 2, 3].into_iter().partition(|x: &int| *x < 2), (vec![1], vec![2, 3]));
- assert_eq!(vec![1i, 2, 3].into_iter().partition(|x: &int| *x < 0), (vec![], vec![1, 2, 3]));
- }
-
- #[test]
- fn test_zip_unzip() {
- let z1 = vec![(1i, 4i), (2, 5), (3, 6)];
-
- let (left, right): (Vec<_>, Vec<_>) = z1.iter().map(|&x| x).unzip();
-
- assert_eq!((1, 4), (left[0], right[0]));
- assert_eq!((2, 5), (left[1], right[1]));
- assert_eq!((3, 6), (left[2], right[2]));
- }
-
- #[test]
- fn test_unsafe_ptrs() {
- unsafe {
- // Test on-stack copy-from-buf.
- let a = [1i, 2, 3];
- let ptr = a.as_ptr();
- let b = Vec::from_raw_buf(ptr, 3u);
- assert_eq!(b, vec![1, 2, 3]);
-
- // Test on-heap copy-from-buf.
- let c = vec![1i, 2, 3, 4, 5];
- let ptr = c.as_ptr();
- let d = Vec::from_raw_buf(ptr, 5u);
- assert_eq!(d, vec![1, 2, 3, 4, 5]);
- }
- }
-
- #[test]
- fn test_vec_truncate_drop() {
- static mut drops: uint = 0;
- struct Elem(int);
- impl Drop for Elem {
- fn drop(&mut self) {
- unsafe { drops += 1; }
- }
- }
-
- let mut v = vec![Elem(1), Elem(2), Elem(3), Elem(4), Elem(5)];
- assert_eq!(unsafe { drops }, 0);
- v.truncate(3);
- assert_eq!(unsafe { drops }, 2);
- v.truncate(0);
- assert_eq!(unsafe { drops }, 5);
- }
-
- #[test]
- #[should_fail]
- fn test_vec_truncate_fail() {
- struct BadElem(int);
- impl Drop for BadElem {
- fn drop(&mut self) {
- let BadElem(ref mut x) = *self;
- if *x == 0xbadbeef {
- panic!("BadElem panic: 0xbadbeef")
- }
- }
- }
-
- let mut v = vec![BadElem(1), BadElem(2), BadElem(0xbadbeef), BadElem(4)];
- v.truncate(0);
- }
-
- #[test]
- fn test_index() {
- let vec = vec!(1i, 2, 3);
- assert!(vec[1] == 2);
- }
-
- #[test]
- #[should_fail]
- fn test_index_out_of_bounds() {
- let vec = vec!(1i, 2, 3);
- let _ = vec[3];
- }
-
- #[test]
- #[should_fail]
- fn test_slice_out_of_bounds_1() {
- let x: Vec<int> = vec![1, 2, 3, 4, 5];
- &x[(-1)..];
- }
-
- #[test]
- #[should_fail]
- fn test_slice_out_of_bounds_2() {
- let x: Vec<int> = vec![1, 2, 3, 4, 5];
- &x[..6];
- }
-
- #[test]
- #[should_fail]
- fn test_slice_out_of_bounds_3() {
- let x: Vec<int> = vec![1, 2, 3, 4, 5];
- &x[(-1)..4];
- }
-
- #[test]
- #[should_fail]
- fn test_slice_out_of_bounds_4() {
- let x: Vec<int> = vec![1, 2, 3, 4, 5];
- &x[1..6];
- }
-
- #[test]
- #[should_fail]
- fn test_slice_out_of_bounds_5() {
- let x: Vec<int> = vec![1, 2, 3, 4, 5];
- &x[3..2];
- }
-
- #[test]
- #[should_fail]
- fn test_swap_remove_empty() {
- let mut vec: Vec<uint> = vec!();
- vec.swap_remove(0);
- }
-
- #[test]
- fn test_move_iter_unwrap() {
- let mut vec: Vec<uint> = Vec::with_capacity(7);
- vec.push(1);
- vec.push(2);
- let ptr = vec.as_ptr();
- vec = vec.into_iter().into_inner();
- assert_eq!(vec.as_ptr(), ptr);
- assert_eq!(vec.capacity(), 7);
- assert_eq!(vec.len(), 0);
- }
-
- #[test]
- #[should_fail]
- fn test_map_in_place_incompatible_types_fail() {
- let v = vec![0u, 1, 2];
- v.map_in_place(|_| ());
- }
-
- #[test]
- fn test_map_in_place() {
- let v = vec![0u, 1, 2];
- assert_eq!(v.map_in_place(|i: uint| i as int - 1), [-1i, 0, 1]);
- }
-
- #[test]
- fn test_map_in_place_zero_sized() {
- let v = vec![(), ()];
- #[derive(PartialEq, Show)]
- struct ZeroSized;
- assert_eq!(v.map_in_place(|_| ZeroSized), [ZeroSized, ZeroSized]);
- }
-
- #[test]
- fn test_map_in_place_zero_drop_count() {
- use std::sync::atomic::{AtomicUint, Ordering, ATOMIC_UINT_INIT};
-
- #[derive(Clone, PartialEq, Show)]
- struct Nothing;
- impl Drop for Nothing { fn drop(&mut self) { } }
-
- #[derive(Clone, PartialEq, Show)]
- struct ZeroSized;
- impl Drop for ZeroSized {
- fn drop(&mut self) {
- DROP_COUNTER.fetch_add(1, Ordering::Relaxed);
- }
- }
- const NUM_ELEMENTS: uint = 2;
- static DROP_COUNTER: AtomicUint = ATOMIC_UINT_INIT;
-
- let v = repeat(Nothing).take(NUM_ELEMENTS).collect::<Vec<_>>();
-
- DROP_COUNTER.store(0, Ordering::Relaxed);
-
- let v = v.map_in_place(|_| ZeroSized);
- assert_eq!(DROP_COUNTER.load(Ordering::Relaxed), 0);
- drop(v);
- assert_eq!(DROP_COUNTER.load(Ordering::Relaxed), NUM_ELEMENTS);
- }
-
- #[test]
- fn test_move_items() {
- let vec = vec![1, 2, 3];
- let mut vec2 : Vec<i32> = vec![];
- for i in vec.into_iter() {
- vec2.push(i);
- }
- assert!(vec2 == vec![1, 2, 3]);
- }
-
- #[test]
- fn test_move_items_reverse() {
- let vec = vec![1, 2, 3];
- let mut vec2 : Vec<i32> = vec![];
- for i in vec.into_iter().rev() {
- vec2.push(i);
- }
- assert!(vec2 == vec![3, 2, 1]);
- }
-
- #[test]
- fn test_move_items_zero_sized() {
- let vec = vec![(), (), ()];
- let mut vec2 : Vec<()> = vec![];
- for i in vec.into_iter() {
- vec2.push(i);
- }
- assert!(vec2 == vec![(), (), ()]);
- }
-
- #[test]
- fn test_drain_items() {
- let mut vec = vec![1, 2, 3];
- let mut vec2: Vec<i32> = vec![];
- for i in vec.drain() {
- vec2.push(i);
- }
- assert_eq!(vec, []);
- assert_eq!(vec2, [ 1, 2, 3 ]);
- }
-
- #[test]
- fn test_drain_items_reverse() {
- let mut vec = vec![1, 2, 3];
- let mut vec2: Vec<i32> = vec![];
- for i in vec.drain().rev() {
- vec2.push(i);
- }
- assert_eq!(vec, []);
- assert_eq!(vec2, [ 3, 2, 1 ]);
- }
-
- #[test]
- fn test_drain_items_zero_sized() {
- let mut vec = vec![(), (), ()];
- let mut vec2: Vec<()> = vec![];
- for i in vec.drain() {
- vec2.push(i);
- }
- assert_eq!(vec, []);
- assert_eq!(vec2, [(), (), ()]);
- }
-
- #[test]
- fn test_into_boxed_slice() {
- let xs = vec![1u, 2, 3];
- let ys = xs.into_boxed_slice();
- assert_eq!(ys.as_slice(), [1u, 2, 3]);
- }
-
- #[bench]
- fn bench_new(b: &mut Bencher) {
- b.iter(|| {
- let v: Vec<uint> = Vec::new();
- assert_eq!(v.len(), 0);
- assert_eq!(v.capacity(), 0);
- })
- }
-
- fn do_bench_with_capacity(b: &mut Bencher, src_len: uint) {
- b.bytes = src_len as u64;
-
- b.iter(|| {
- let v: Vec<uint> = Vec::with_capacity(src_len);
- assert_eq!(v.len(), 0);
- assert_eq!(v.capacity(), src_len);
- })
- }
-
- #[bench]
- fn bench_with_capacity_0000(b: &mut Bencher) {
- do_bench_with_capacity(b, 0)
- }
-
- #[bench]
- fn bench_with_capacity_0010(b: &mut Bencher) {
- do_bench_with_capacity(b, 10)
- }
-
- #[bench]
- fn bench_with_capacity_0100(b: &mut Bencher) {
- do_bench_with_capacity(b, 100)
- }
-
- #[bench]
- fn bench_with_capacity_1000(b: &mut Bencher) {
- do_bench_with_capacity(b, 1000)
- }
-
- fn do_bench_from_fn(b: &mut Bencher, src_len: uint) {
- b.bytes = src_len as u64;
-
- b.iter(|| {
- let dst = range(0, src_len).collect::<Vec<_>>();
- assert_eq!(dst.len(), src_len);
- assert!(dst.iter().enumerate().all(|(i, x)| i == *x));
- })
- }
-
- #[bench]
- fn bench_from_fn_0000(b: &mut Bencher) {
- do_bench_from_fn(b, 0)
- }
-
- #[bench]
- fn bench_from_fn_0010(b: &mut Bencher) {
- do_bench_from_fn(b, 10)
- }
-
- #[bench]
- fn bench_from_fn_0100(b: &mut Bencher) {
- do_bench_from_fn(b, 100)
- }
-
- #[bench]
- fn bench_from_fn_1000(b: &mut Bencher) {
- do_bench_from_fn(b, 1000)
- }
-
- fn do_bench_from_elem(b: &mut Bencher, src_len: uint) {
- b.bytes = src_len as u64;
-
- b.iter(|| {
- let dst: Vec<uint> = repeat(5).take(src_len).collect();
- assert_eq!(dst.len(), src_len);
- assert!(dst.iter().all(|x| *x == 5));
- })
- }
-
- #[bench]
- fn bench_from_elem_0000(b: &mut Bencher) {
- do_bench_from_elem(b, 0)
- }
-
- #[bench]
- fn bench_from_elem_0010(b: &mut Bencher) {
- do_bench_from_elem(b, 10)
- }
-
- #[bench]
- fn bench_from_elem_0100(b: &mut Bencher) {
- do_bench_from_elem(b, 100)
- }
-
- #[bench]
- fn bench_from_elem_1000(b: &mut Bencher) {
- do_bench_from_elem(b, 1000)
- }
-
- fn do_bench_from_slice(b: &mut Bencher, src_len: uint) {
- let src: Vec<uint> = FromIterator::from_iter(range(0, src_len));
-
- b.bytes = src_len as u64;
-
- b.iter(|| {
- let dst = src.clone()[].to_vec();
- assert_eq!(dst.len(), src_len);
- assert!(dst.iter().enumerate().all(|(i, x)| i == *x));
- });
- }
-
- #[bench]
- fn bench_from_slice_0000(b: &mut Bencher) {
- do_bench_from_slice(b, 0)
- }
-
- #[bench]
- fn bench_from_slice_0010(b: &mut Bencher) {
- do_bench_from_slice(b, 10)
- }
-
- #[bench]
- fn bench_from_slice_0100(b: &mut Bencher) {
- do_bench_from_slice(b, 100)
- }
-
- #[bench]
- fn bench_from_slice_1000(b: &mut Bencher) {
- do_bench_from_slice(b, 1000)
- }
-
- fn do_bench_from_iter(b: &mut Bencher, src_len: uint) {
- let src: Vec<uint> = FromIterator::from_iter(range(0, src_len));
-
- b.bytes = src_len as u64;
-
- b.iter(|| {
- let dst: Vec<uint> = FromIterator::from_iter(src.clone().into_iter());
- assert_eq!(dst.len(), src_len);
- assert!(dst.iter().enumerate().all(|(i, x)| i == *x));
- });
- }
-
- #[bench]
- fn bench_from_iter_0000(b: &mut Bencher) {
- do_bench_from_iter(b, 0)
- }
-
- #[bench]
- fn bench_from_iter_0010(b: &mut Bencher) {
- do_bench_from_iter(b, 10)
- }
-
- #[bench]
- fn bench_from_iter_0100(b: &mut Bencher) {
- do_bench_from_iter(b, 100)
- }
-
- #[bench]
- fn bench_from_iter_1000(b: &mut Bencher) {
- do_bench_from_iter(b, 1000)
- }
-
- fn do_bench_extend(b: &mut Bencher, dst_len: uint, src_len: uint) {
- let dst: Vec<uint> = FromIterator::from_iter(range(0, dst_len));
- let src: Vec<uint> = FromIterator::from_iter(range(dst_len, dst_len + src_len));
-
- b.bytes = src_len as u64;
-
- b.iter(|| {
- let mut dst = dst.clone();
- dst.extend(src.clone().into_iter());
- assert_eq!(dst.len(), dst_len + src_len);
- assert!(dst.iter().enumerate().all(|(i, x)| i == *x));
- });
- }
-
- #[bench]
- fn bench_extend_0000_0000(b: &mut Bencher) {
- do_bench_extend(b, 0, 0)
- }
-
- #[bench]
- fn bench_extend_0000_0010(b: &mut Bencher) {
- do_bench_extend(b, 0, 10)
- }
-
- #[bench]
- fn bench_extend_0000_0100(b: &mut Bencher) {
- do_bench_extend(b, 0, 100)
- }
-
- #[bench]
- fn bench_extend_0000_1000(b: &mut Bencher) {
- do_bench_extend(b, 0, 1000)
- }
-
- #[bench]
- fn bench_extend_0010_0010(b: &mut Bencher) {
- do_bench_extend(b, 10, 10)
- }
-
- #[bench]
- fn bench_extend_0100_0100(b: &mut Bencher) {
- do_bench_extend(b, 100, 100)
- }
-
- #[bench]
- fn bench_extend_1000_1000(b: &mut Bencher) {
- do_bench_extend(b, 1000, 1000)
- }
-
- fn do_bench_push_all(b: &mut Bencher, dst_len: uint, src_len: uint) {
- let dst: Vec<uint> = FromIterator::from_iter(range(0, dst_len));
- let src: Vec<uint> = FromIterator::from_iter(range(dst_len, dst_len + src_len));
-
- b.bytes = src_len as u64;
-
- b.iter(|| {
- let mut dst = dst.clone();
- dst.push_all(src.as_slice());
- assert_eq!(dst.len(), dst_len + src_len);
- assert!(dst.iter().enumerate().all(|(i, x)| i == *x));
- });
- }
-
- #[bench]
- fn bench_push_all_0000_0000(b: &mut Bencher) {
- do_bench_push_all(b, 0, 0)
- }
-
- #[bench]
- fn bench_push_all_0000_0010(b: &mut Bencher) {
- do_bench_push_all(b, 0, 10)
- }
-
- #[bench]
- fn bench_push_all_0000_0100(b: &mut Bencher) {
- do_bench_push_all(b, 0, 100)
- }
-
- #[bench]
- fn bench_push_all_0000_1000(b: &mut Bencher) {
- do_bench_push_all(b, 0, 1000)
- }
-
- #[bench]
- fn bench_push_all_0010_0010(b: &mut Bencher) {
- do_bench_push_all(b, 10, 10)
- }
-
- #[bench]
- fn bench_push_all_0100_0100(b: &mut Bencher) {
- do_bench_push_all(b, 100, 100)
- }
-
- #[bench]
- fn bench_push_all_1000_1000(b: &mut Bencher) {
- do_bench_push_all(b, 1000, 1000)
- }
-
- fn do_bench_push_all_move(b: &mut Bencher, dst_len: uint, src_len: uint) {
- let dst: Vec<uint> = FromIterator::from_iter(range(0u, dst_len));
- let src: Vec<uint> = FromIterator::from_iter(range(dst_len, dst_len + src_len));
-
- b.bytes = src_len as u64;
-
- b.iter(|| {
- let mut dst = dst.clone();
- dst.extend(src.clone().into_iter());
- assert_eq!(dst.len(), dst_len + src_len);
- assert!(dst.iter().enumerate().all(|(i, x)| i == *x));
- });
- }
-
- #[bench]
- fn bench_push_all_move_0000_0000(b: &mut Bencher) {
- do_bench_push_all_move(b, 0, 0)
- }
-
- #[bench]
- fn bench_push_all_move_0000_0010(b: &mut Bencher) {
- do_bench_push_all_move(b, 0, 10)
- }
-
- #[bench]
- fn bench_push_all_move_0000_0100(b: &mut Bencher) {
- do_bench_push_all_move(b, 0, 100)
- }
-
- #[bench]
- fn bench_push_all_move_0000_1000(b: &mut Bencher) {
- do_bench_push_all_move(b, 0, 1000)
- }
-
- #[bench]
- fn bench_push_all_move_0010_0010(b: &mut Bencher) {
- do_bench_push_all_move(b, 10, 10)
- }
-
- #[bench]
- fn bench_push_all_move_0100_0100(b: &mut Bencher) {
- do_bench_push_all_move(b, 100, 100)
- }
-
- #[bench]
- fn bench_push_all_move_1000_1000(b: &mut Bencher) {
- do_bench_push_all_move(b, 1000, 1000)
- }
-
- fn do_bench_clone(b: &mut Bencher, src_len: uint) {
- let src: Vec<uint> = FromIterator::from_iter(range(0, src_len));
-
- b.bytes = src_len as u64;
-
- b.iter(|| {
- let dst = src.clone();
- assert_eq!(dst.len(), src_len);
- assert!(dst.iter().enumerate().all(|(i, x)| i == *x));
- });
- }
-
- #[bench]
- fn bench_clone_0000(b: &mut Bencher) {
- do_bench_clone(b, 0)
- }
-
- #[bench]
- fn bench_clone_0010(b: &mut Bencher) {
- do_bench_clone(b, 10)
- }
-
- #[bench]
- fn bench_clone_0100(b: &mut Bencher) {
- do_bench_clone(b, 100)
- }
-
- #[bench]
- fn bench_clone_1000(b: &mut Bencher) {
- do_bench_clone(b, 1000)
- }
-
- fn do_bench_clone_from(b: &mut Bencher, times: uint, dst_len: uint, src_len: uint) {
- let dst: Vec<uint> = FromIterator::from_iter(range(0, src_len));
- let src: Vec<uint> = FromIterator::from_iter(range(dst_len, dst_len + src_len));
-
- b.bytes = (times * src_len) as u64;
-
- b.iter(|| {
- let mut dst = dst.clone();
-
- for _ in range(0, times) {
- dst.clone_from(&src);
-
- assert_eq!(dst.len(), src_len);
- assert!(dst.iter().enumerate().all(|(i, x)| dst_len + i == *x));
- }
- });
- }
-
- #[bench]
- fn bench_clone_from_01_0000_0000(b: &mut Bencher) {
- do_bench_clone_from(b, 1, 0, 0)
- }
-
- #[bench]
- fn bench_clone_from_01_0000_0010(b: &mut Bencher) {
- do_bench_clone_from(b, 1, 0, 10)
- }
-
- #[bench]
- fn bench_clone_from_01_0000_0100(b: &mut Bencher) {
- do_bench_clone_from(b, 1, 0, 100)
- }
-
- #[bench]
- fn bench_clone_from_01_0000_1000(b: &mut Bencher) {
- do_bench_clone_from(b, 1, 0, 1000)
- }
-
- #[bench]
- fn bench_clone_from_01_0010_0010(b: &mut Bencher) {
- do_bench_clone_from(b, 1, 10, 10)
- }
-
- #[bench]
- fn bench_clone_from_01_0100_0100(b: &mut Bencher) {
- do_bench_clone_from(b, 1, 100, 100)
- }
-
- #[bench]
- fn bench_clone_from_01_1000_1000(b: &mut Bencher) {
- do_bench_clone_from(b, 1, 1000, 1000)
- }
-
- #[bench]
- fn bench_clone_from_01_0010_0100(b: &mut Bencher) {
- do_bench_clone_from(b, 1, 10, 100)
- }
-
- #[bench]
- fn bench_clone_from_01_0100_1000(b: &mut Bencher) {
- do_bench_clone_from(b, 1, 100, 1000)
- }
-
- #[bench]
- fn bench_clone_from_01_0010_0000(b: &mut Bencher) {
- do_bench_clone_from(b, 1, 10, 0)
- }
-
- #[bench]
- fn bench_clone_from_01_0100_0010(b: &mut Bencher) {
- do_bench_clone_from(b, 1, 100, 10)
- }
-
- #[bench]
- fn bench_clone_from_01_1000_0100(b: &mut Bencher) {
- do_bench_clone_from(b, 1, 1000, 100)
- }
-
- #[bench]
- fn bench_clone_from_10_0000_0000(b: &mut Bencher) {
- do_bench_clone_from(b, 10, 0, 0)
- }
-
- #[bench]
- fn bench_clone_from_10_0000_0010(b: &mut Bencher) {
- do_bench_clone_from(b, 10, 0, 10)
- }
-
- #[bench]
- fn bench_clone_from_10_0000_0100(b: &mut Bencher) {
- do_bench_clone_from(b, 10, 0, 100)
- }
-
- #[bench]
- fn bench_clone_from_10_0000_1000(b: &mut Bencher) {
- do_bench_clone_from(b, 10, 0, 1000)
- }
-
- #[bench]
- fn bench_clone_from_10_0010_0010(b: &mut Bencher) {
- do_bench_clone_from(b, 10, 10, 10)
- }
-
- #[bench]
- fn bench_clone_from_10_0100_0100(b: &mut Bencher) {
- do_bench_clone_from(b, 10, 100, 100)
- }
-
- #[bench]
- fn bench_clone_from_10_1000_1000(b: &mut Bencher) {
- do_bench_clone_from(b, 10, 1000, 1000)
- }
-
- #[bench]
- fn bench_clone_from_10_0010_0100(b: &mut Bencher) {
- do_bench_clone_from(b, 10, 10, 100)
- }
-
- #[bench]
- fn bench_clone_from_10_0100_1000(b: &mut Bencher) {
- do_bench_clone_from(b, 10, 100, 1000)
- }
-
- #[bench]
- fn bench_clone_from_10_0010_0000(b: &mut Bencher) {
- do_bench_clone_from(b, 10, 10, 0)
- }
-
- #[bench]
- fn bench_clone_from_10_0100_0010(b: &mut Bencher) {
- do_bench_clone_from(b, 10, 100, 10)
- }
-
- #[bench]
- fn bench_clone_from_10_1000_0100(b: &mut Bencher) {
- do_bench_clone_from(b, 10, 1000, 100)
- }
-}
+#[unstable(feature = "fused", issue = "35602")]
+impl<'a, T> FusedIterator for Drain<'a, T> {}
projects / rustc.git / blobdiff