1057b8d25SMiguel Ojeda // SPDX-License-Identifier: Apache-2.0 OR MIT 2057b8d25SMiguel Ojeda 3753dece8SMiguel Ojeda //! A contiguous growable array type with heap-allocated contents, written 4753dece8SMiguel Ojeda //! `Vec<T>`. 5753dece8SMiguel Ojeda //! 6753dece8SMiguel Ojeda //! Vectors have *O*(1) indexing, amortized *O*(1) push (to the end) and 7753dece8SMiguel Ojeda //! *O*(1) pop (from the end). 8753dece8SMiguel Ojeda //! 9753dece8SMiguel Ojeda //! Vectors ensure they never allocate more than `isize::MAX` bytes. 10753dece8SMiguel Ojeda //! 11753dece8SMiguel Ojeda //! # Examples 12753dece8SMiguel Ojeda //! 13753dece8SMiguel Ojeda //! You can explicitly create a [`Vec`] with [`Vec::new`]: 14753dece8SMiguel Ojeda //! 15753dece8SMiguel Ojeda //! ``` 16753dece8SMiguel Ojeda //! let v: Vec<i32> = Vec::new(); 17753dece8SMiguel Ojeda //! ``` 18753dece8SMiguel Ojeda //! 19753dece8SMiguel Ojeda //! ...or by using the [`vec!`] macro: 20753dece8SMiguel Ojeda //! 21753dece8SMiguel Ojeda //! ``` 22753dece8SMiguel Ojeda //! let v: Vec<i32> = vec![]; 23753dece8SMiguel Ojeda //! 24753dece8SMiguel Ojeda //! let v = vec![1, 2, 3, 4, 5]; 25753dece8SMiguel Ojeda //! 26753dece8SMiguel Ojeda //! let v = vec![0; 10]; // ten zeroes 27753dece8SMiguel Ojeda //! ``` 28753dece8SMiguel Ojeda //! 29753dece8SMiguel Ojeda //! You can [`push`] values onto the end of a vector (which will grow the vector 30753dece8SMiguel Ojeda //! as needed): 31753dece8SMiguel Ojeda //! 32753dece8SMiguel Ojeda //! ``` 33753dece8SMiguel Ojeda //! let mut v = vec![1, 2]; 34753dece8SMiguel Ojeda //! 35753dece8SMiguel Ojeda //! v.push(3); 36753dece8SMiguel Ojeda //! ``` 37753dece8SMiguel Ojeda //! 38753dece8SMiguel Ojeda //! Popping values works in much the same way: 39753dece8SMiguel Ojeda //! 40753dece8SMiguel Ojeda //! ``` 41753dece8SMiguel Ojeda //! let mut v = vec![1, 2]; 42753dece8SMiguel Ojeda //! 43753dece8SMiguel Ojeda //! let two = v.pop(); 44753dece8SMiguel Ojeda //! ``` 45753dece8SMiguel Ojeda //! 46753dece8SMiguel Ojeda //! Vectors also support indexing (through the [`Index`] and [`IndexMut`] traits): 47753dece8SMiguel Ojeda //! 48753dece8SMiguel Ojeda //! ``` 49753dece8SMiguel Ojeda //! let mut v = vec![1, 2, 3]; 50753dece8SMiguel Ojeda //! let three = v[2]; 51753dece8SMiguel Ojeda //! v[1] = v[1] + 5; 52753dece8SMiguel Ojeda //! ``` 53753dece8SMiguel Ojeda //! 54753dece8SMiguel Ojeda //! [`push`]: Vec::push 55753dece8SMiguel Ojeda 56753dece8SMiguel Ojeda #![stable(feature = "rust1", since = "1.0.0")] 57753dece8SMiguel Ojeda 58753dece8SMiguel Ojeda #[cfg(not(no_global_oom_handling))] 59753dece8SMiguel Ojeda use core::cmp; 60753dece8SMiguel Ojeda use core::cmp::Ordering; 61753dece8SMiguel Ojeda use core::convert::TryFrom; 62753dece8SMiguel Ojeda use core::fmt; 63753dece8SMiguel Ojeda use core::hash::{Hash, Hasher}; 64753dece8SMiguel Ojeda use core::intrinsics::{arith_offset, assume}; 65753dece8SMiguel Ojeda use core::iter; 66753dece8SMiguel Ojeda #[cfg(not(no_global_oom_handling))] 67753dece8SMiguel Ojeda use core::iter::FromIterator; 68753dece8SMiguel Ojeda use core::marker::PhantomData; 69753dece8SMiguel Ojeda use core::mem::{self, ManuallyDrop, MaybeUninit}; 70753dece8SMiguel Ojeda use core::ops::{self, Index, IndexMut, Range, RangeBounds}; 71753dece8SMiguel Ojeda use core::ptr::{self, NonNull}; 72753dece8SMiguel Ojeda use core::slice::{self, SliceIndex}; 73753dece8SMiguel Ojeda 74753dece8SMiguel Ojeda use crate::alloc::{Allocator, Global}; 758909a80eSMiguel Ojeda #[cfg(not(no_borrow))] 76753dece8SMiguel Ojeda use crate::borrow::{Cow, ToOwned}; 77753dece8SMiguel Ojeda use crate::boxed::Box; 78753dece8SMiguel Ojeda use crate::collections::TryReserveError; 79753dece8SMiguel Ojeda use crate::raw_vec::RawVec; 80753dece8SMiguel Ojeda 81753dece8SMiguel Ojeda #[unstable(feature = "drain_filter", reason = "recently added", issue = "43244")] 82753dece8SMiguel Ojeda pub use self::drain_filter::DrainFilter; 83753dece8SMiguel Ojeda 84753dece8SMiguel Ojeda mod drain_filter; 85753dece8SMiguel Ojeda 86753dece8SMiguel Ojeda #[cfg(not(no_global_oom_handling))] 87753dece8SMiguel Ojeda #[stable(feature = "vec_splice", since = "1.21.0")] 88753dece8SMiguel Ojeda pub use self::splice::Splice; 89753dece8SMiguel Ojeda 90753dece8SMiguel Ojeda #[cfg(not(no_global_oom_handling))] 91753dece8SMiguel Ojeda mod splice; 92753dece8SMiguel Ojeda 93753dece8SMiguel Ojeda #[stable(feature = "drain", since = "1.6.0")] 94753dece8SMiguel Ojeda pub use self::drain::Drain; 95753dece8SMiguel Ojeda 96753dece8SMiguel Ojeda mod drain; 97753dece8SMiguel Ojeda 988909a80eSMiguel Ojeda #[cfg(not(no_borrow))] 99753dece8SMiguel Ojeda #[cfg(not(no_global_oom_handling))] 100753dece8SMiguel Ojeda mod cow; 101753dece8SMiguel Ojeda 102753dece8SMiguel Ojeda #[cfg(not(no_global_oom_handling))] 103753dece8SMiguel Ojeda pub(crate) use self::in_place_collect::AsVecIntoIter; 104753dece8SMiguel Ojeda #[stable(feature = "rust1", since = "1.0.0")] 105753dece8SMiguel Ojeda pub use self::into_iter::IntoIter; 106753dece8SMiguel Ojeda 107753dece8SMiguel Ojeda mod into_iter; 108753dece8SMiguel Ojeda 109753dece8SMiguel Ojeda #[cfg(not(no_global_oom_handling))] 110753dece8SMiguel Ojeda use self::is_zero::IsZero; 111753dece8SMiguel Ojeda 112753dece8SMiguel Ojeda mod is_zero; 113753dece8SMiguel Ojeda 114753dece8SMiguel Ojeda #[cfg(not(no_global_oom_handling))] 115753dece8SMiguel Ojeda mod in_place_collect; 116753dece8SMiguel Ojeda 117753dece8SMiguel Ojeda mod partial_eq; 118753dece8SMiguel Ojeda 119753dece8SMiguel Ojeda #[cfg(not(no_global_oom_handling))] 120753dece8SMiguel Ojeda use self::spec_from_elem::SpecFromElem; 121753dece8SMiguel Ojeda 122753dece8SMiguel Ojeda #[cfg(not(no_global_oom_handling))] 123753dece8SMiguel Ojeda mod spec_from_elem; 124753dece8SMiguel Ojeda 125753dece8SMiguel Ojeda use self::set_len_on_drop::SetLenOnDrop; 126753dece8SMiguel Ojeda 127753dece8SMiguel Ojeda mod set_len_on_drop; 128753dece8SMiguel Ojeda 129753dece8SMiguel Ojeda #[cfg(not(no_global_oom_handling))] 130753dece8SMiguel Ojeda use self::in_place_drop::InPlaceDrop; 131753dece8SMiguel Ojeda 132753dece8SMiguel Ojeda #[cfg(not(no_global_oom_handling))] 133753dece8SMiguel Ojeda mod in_place_drop; 134753dece8SMiguel Ojeda 135753dece8SMiguel Ojeda #[cfg(not(no_global_oom_handling))] 136753dece8SMiguel Ojeda use self::spec_from_iter_nested::SpecFromIterNested; 137753dece8SMiguel Ojeda 138753dece8SMiguel Ojeda #[cfg(not(no_global_oom_handling))] 139753dece8SMiguel Ojeda mod spec_from_iter_nested; 140753dece8SMiguel Ojeda 141753dece8SMiguel Ojeda #[cfg(not(no_global_oom_handling))] 142753dece8SMiguel Ojeda use self::spec_from_iter::SpecFromIter; 143753dece8SMiguel Ojeda 144753dece8SMiguel Ojeda #[cfg(not(no_global_oom_handling))] 145753dece8SMiguel Ojeda mod spec_from_iter; 146753dece8SMiguel Ojeda 147753dece8SMiguel Ojeda #[cfg(not(no_global_oom_handling))] 148753dece8SMiguel Ojeda use self::spec_extend::SpecExtend; 149753dece8SMiguel Ojeda 150*318c3cc8SMiguel Ojeda use self::spec_extend::TrySpecExtend; 151*318c3cc8SMiguel Ojeda 152753dece8SMiguel Ojeda mod spec_extend; 153753dece8SMiguel Ojeda 154753dece8SMiguel Ojeda /// A contiguous growable array type, written as `Vec<T>`, short for 'vector'. 155753dece8SMiguel Ojeda /// 156753dece8SMiguel Ojeda /// # Examples 157753dece8SMiguel Ojeda /// 158753dece8SMiguel Ojeda /// ``` 159753dece8SMiguel Ojeda /// let mut vec = Vec::new(); 160753dece8SMiguel Ojeda /// vec.push(1); 161753dece8SMiguel Ojeda /// vec.push(2); 162753dece8SMiguel Ojeda /// 163753dece8SMiguel Ojeda /// assert_eq!(vec.len(), 2); 164753dece8SMiguel Ojeda /// assert_eq!(vec[0], 1); 165753dece8SMiguel Ojeda /// 166753dece8SMiguel Ojeda /// assert_eq!(vec.pop(), Some(2)); 167753dece8SMiguel Ojeda /// assert_eq!(vec.len(), 1); 168753dece8SMiguel Ojeda /// 169753dece8SMiguel Ojeda /// vec[0] = 7; 170753dece8SMiguel Ojeda /// assert_eq!(vec[0], 7); 171753dece8SMiguel Ojeda /// 172753dece8SMiguel Ojeda /// vec.extend([1, 2, 3].iter().copied()); 173753dece8SMiguel Ojeda /// 174753dece8SMiguel Ojeda /// for x in &vec { 175753dece8SMiguel Ojeda /// println!("{x}"); 176753dece8SMiguel Ojeda /// } 177753dece8SMiguel Ojeda /// assert_eq!(vec, [7, 1, 2, 3]); 178753dece8SMiguel Ojeda /// ``` 179753dece8SMiguel Ojeda /// 180753dece8SMiguel Ojeda /// The [`vec!`] macro is provided for convenient initialization: 181753dece8SMiguel Ojeda /// 182753dece8SMiguel Ojeda /// ``` 183753dece8SMiguel Ojeda /// let mut vec1 = vec![1, 2, 3]; 184753dece8SMiguel Ojeda /// vec1.push(4); 185753dece8SMiguel Ojeda /// let vec2 = Vec::from([1, 2, 3, 4]); 186753dece8SMiguel Ojeda /// assert_eq!(vec1, vec2); 187753dece8SMiguel Ojeda /// ``` 188753dece8SMiguel Ojeda /// 189753dece8SMiguel Ojeda /// It can also initialize each element of a `Vec<T>` with a given value. 190753dece8SMiguel Ojeda /// This may be more efficient than performing allocation and initialization 191753dece8SMiguel Ojeda /// in separate steps, especially when initializing a vector of zeros: 192753dece8SMiguel Ojeda /// 193753dece8SMiguel Ojeda /// ``` 194753dece8SMiguel Ojeda /// let vec = vec![0; 5]; 195753dece8SMiguel Ojeda /// assert_eq!(vec, [0, 0, 0, 0, 0]); 196753dece8SMiguel Ojeda /// 197753dece8SMiguel Ojeda /// // The following is equivalent, but potentially slower: 198753dece8SMiguel Ojeda /// let mut vec = Vec::with_capacity(5); 199753dece8SMiguel Ojeda /// vec.resize(5, 0); 200753dece8SMiguel Ojeda /// assert_eq!(vec, [0, 0, 0, 0, 0]); 201753dece8SMiguel Ojeda /// ``` 202753dece8SMiguel Ojeda /// 203753dece8SMiguel Ojeda /// For more information, see 204753dece8SMiguel Ojeda /// [Capacity and Reallocation](#capacity-and-reallocation). 205753dece8SMiguel Ojeda /// 206753dece8SMiguel Ojeda /// Use a `Vec<T>` as an efficient stack: 207753dece8SMiguel Ojeda /// 208753dece8SMiguel Ojeda /// ``` 209753dece8SMiguel Ojeda /// let mut stack = Vec::new(); 210753dece8SMiguel Ojeda /// 211753dece8SMiguel Ojeda /// stack.push(1); 212753dece8SMiguel Ojeda /// stack.push(2); 213753dece8SMiguel Ojeda /// stack.push(3); 214753dece8SMiguel Ojeda /// 215753dece8SMiguel Ojeda /// while let Some(top) = stack.pop() { 216753dece8SMiguel Ojeda /// // Prints 3, 2, 1 217753dece8SMiguel Ojeda /// println!("{top}"); 218753dece8SMiguel Ojeda /// } 219753dece8SMiguel Ojeda /// ``` 220753dece8SMiguel Ojeda /// 221753dece8SMiguel Ojeda /// # Indexing 222753dece8SMiguel Ojeda /// 223753dece8SMiguel Ojeda /// The `Vec` type allows to access values by index, because it implements the 224753dece8SMiguel Ojeda /// [`Index`] trait. An example will be more explicit: 225753dece8SMiguel Ojeda /// 226753dece8SMiguel Ojeda /// ``` 227753dece8SMiguel Ojeda /// let v = vec![0, 2, 4, 6]; 228753dece8SMiguel Ojeda /// println!("{}", v[1]); // it will display '2' 229753dece8SMiguel Ojeda /// ``` 230753dece8SMiguel Ojeda /// 231753dece8SMiguel Ojeda /// However be careful: if you try to access an index which isn't in the `Vec`, 232753dece8SMiguel Ojeda /// your software will panic! You cannot do this: 233753dece8SMiguel Ojeda /// 234753dece8SMiguel Ojeda /// ```should_panic 235753dece8SMiguel Ojeda /// let v = vec![0, 2, 4, 6]; 236753dece8SMiguel Ojeda /// println!("{}", v[6]); // it will panic! 237753dece8SMiguel Ojeda /// ``` 238753dece8SMiguel Ojeda /// 239753dece8SMiguel Ojeda /// Use [`get`] and [`get_mut`] if you want to check whether the index is in 240753dece8SMiguel Ojeda /// the `Vec`. 241753dece8SMiguel Ojeda /// 242753dece8SMiguel Ojeda /// # Slicing 243753dece8SMiguel Ojeda /// 244753dece8SMiguel Ojeda /// A `Vec` can be mutable. On the other hand, slices are read-only objects. 245753dece8SMiguel Ojeda /// To get a [slice][prim@slice], use [`&`]. Example: 246753dece8SMiguel Ojeda /// 247753dece8SMiguel Ojeda /// ``` 248753dece8SMiguel Ojeda /// fn read_slice(slice: &[usize]) { 249753dece8SMiguel Ojeda /// // ... 250753dece8SMiguel Ojeda /// } 251753dece8SMiguel Ojeda /// 252753dece8SMiguel Ojeda /// let v = vec![0, 1]; 253753dece8SMiguel Ojeda /// read_slice(&v); 254753dece8SMiguel Ojeda /// 255753dece8SMiguel Ojeda /// // ... and that's all! 256753dece8SMiguel Ojeda /// // you can also do it like this: 257753dece8SMiguel Ojeda /// let u: &[usize] = &v; 258753dece8SMiguel Ojeda /// // or like this: 259753dece8SMiguel Ojeda /// let u: &[_] = &v; 260753dece8SMiguel Ojeda /// ``` 261753dece8SMiguel Ojeda /// 262753dece8SMiguel Ojeda /// In Rust, it's more common to pass slices as arguments rather than vectors 263753dece8SMiguel Ojeda /// when you just want to provide read access. The same goes for [`String`] and 264753dece8SMiguel Ojeda /// [`&str`]. 265753dece8SMiguel Ojeda /// 266753dece8SMiguel Ojeda /// # Capacity and reallocation 267753dece8SMiguel Ojeda /// 268753dece8SMiguel Ojeda /// The capacity of a vector is the amount of space allocated for any future 269753dece8SMiguel Ojeda /// elements that will be added onto the vector. This is not to be confused with 270753dece8SMiguel Ojeda /// the *length* of a vector, which specifies the number of actual elements 271753dece8SMiguel Ojeda /// within the vector. If a vector's length exceeds its capacity, its capacity 272753dece8SMiguel Ojeda /// will automatically be increased, but its elements will have to be 273753dece8SMiguel Ojeda /// reallocated. 274753dece8SMiguel Ojeda /// 275753dece8SMiguel Ojeda /// For example, a vector with capacity 10 and length 0 would be an empty vector 276753dece8SMiguel Ojeda /// with space for 10 more elements. Pushing 10 or fewer elements onto the 277753dece8SMiguel Ojeda /// vector will not change its capacity or cause reallocation to occur. However, 278753dece8SMiguel Ojeda /// if the vector's length is increased to 11, it will have to reallocate, which 279753dece8SMiguel Ojeda /// can be slow. For this reason, it is recommended to use [`Vec::with_capacity`] 280753dece8SMiguel Ojeda /// whenever possible to specify how big the vector is expected to get. 281753dece8SMiguel Ojeda /// 282753dece8SMiguel Ojeda /// # Guarantees 283753dece8SMiguel Ojeda /// 284753dece8SMiguel Ojeda /// Due to its incredibly fundamental nature, `Vec` makes a lot of guarantees 285753dece8SMiguel Ojeda /// about its design. This ensures that it's as low-overhead as possible in 286753dece8SMiguel Ojeda /// the general case, and can be correctly manipulated in primitive ways 287753dece8SMiguel Ojeda /// by unsafe code. Note that these guarantees refer to an unqualified `Vec<T>`. 288753dece8SMiguel Ojeda /// If additional type parameters are added (e.g., to support custom allocators), 289753dece8SMiguel Ojeda /// overriding their defaults may change the behavior. 290753dece8SMiguel Ojeda /// 291753dece8SMiguel Ojeda /// Most fundamentally, `Vec` is and always will be a (pointer, capacity, length) 292753dece8SMiguel Ojeda /// triplet. No more, no less. The order of these fields is completely 293753dece8SMiguel Ojeda /// unspecified, and you should use the appropriate methods to modify these. 294753dece8SMiguel Ojeda /// The pointer will never be null, so this type is null-pointer-optimized. 295753dece8SMiguel Ojeda /// 296753dece8SMiguel Ojeda /// However, the pointer might not actually point to allocated memory. In particular, 297753dece8SMiguel Ojeda /// if you construct a `Vec` with capacity 0 via [`Vec::new`], [`vec![]`][`vec!`], 298753dece8SMiguel Ojeda /// [`Vec::with_capacity(0)`][`Vec::with_capacity`], or by calling [`shrink_to_fit`] 299753dece8SMiguel Ojeda /// on an empty Vec, it will not allocate memory. Similarly, if you store zero-sized 300753dece8SMiguel Ojeda /// types inside a `Vec`, it will not allocate space for them. *Note that in this case 301753dece8SMiguel Ojeda /// the `Vec` might not report a [`capacity`] of 0*. `Vec` will allocate if and only 302753dece8SMiguel Ojeda /// if <code>[mem::size_of::\<T>]\() * [capacity]\() > 0</code>. In general, `Vec`'s allocation 303753dece8SMiguel Ojeda /// details are very subtle --- if you intend to allocate memory using a `Vec` 304753dece8SMiguel Ojeda /// and use it for something else (either to pass to unsafe code, or to build your 305753dece8SMiguel Ojeda /// own memory-backed collection), be sure to deallocate this memory by using 306753dece8SMiguel Ojeda /// `from_raw_parts` to recover the `Vec` and then dropping it. 307753dece8SMiguel Ojeda /// 308753dece8SMiguel Ojeda /// If a `Vec` *has* allocated memory, then the memory it points to is on the heap 309753dece8SMiguel Ojeda /// (as defined by the allocator Rust is configured to use by default), and its 310753dece8SMiguel Ojeda /// pointer points to [`len`] initialized, contiguous elements in order (what 311753dece8SMiguel Ojeda /// you would see if you coerced it to a slice), followed by <code>[capacity] - [len]</code> 312753dece8SMiguel Ojeda /// logically uninitialized, contiguous elements. 313753dece8SMiguel Ojeda /// 314753dece8SMiguel Ojeda /// A vector containing the elements `'a'` and `'b'` with capacity 4 can be 315753dece8SMiguel Ojeda /// visualized as below. The top part is the `Vec` struct, it contains a 316753dece8SMiguel Ojeda /// pointer to the head of the allocation in the heap, length and capacity. 317753dece8SMiguel Ojeda /// The bottom part is the allocation on the heap, a contiguous memory block. 318753dece8SMiguel Ojeda /// 319753dece8SMiguel Ojeda /// ```text 320753dece8SMiguel Ojeda /// ptr len capacity 321753dece8SMiguel Ojeda /// +--------+--------+--------+ 322753dece8SMiguel Ojeda /// | 0x0123 | 2 | 4 | 323753dece8SMiguel Ojeda /// +--------+--------+--------+ 324753dece8SMiguel Ojeda /// | 325753dece8SMiguel Ojeda /// v 326753dece8SMiguel Ojeda /// Heap +--------+--------+--------+--------+ 327753dece8SMiguel Ojeda /// | 'a' | 'b' | uninit | uninit | 328753dece8SMiguel Ojeda /// +--------+--------+--------+--------+ 329753dece8SMiguel Ojeda /// ``` 330753dece8SMiguel Ojeda /// 331753dece8SMiguel Ojeda /// - **uninit** represents memory that is not initialized, see [`MaybeUninit`]. 332753dece8SMiguel Ojeda /// - Note: the ABI is not stable and `Vec` makes no guarantees about its memory 333753dece8SMiguel Ojeda /// layout (including the order of fields). 334753dece8SMiguel Ojeda /// 335753dece8SMiguel Ojeda /// `Vec` will never perform a "small optimization" where elements are actually 336753dece8SMiguel Ojeda /// stored on the stack for two reasons: 337753dece8SMiguel Ojeda /// 338753dece8SMiguel Ojeda /// * It would make it more difficult for unsafe code to correctly manipulate 339753dece8SMiguel Ojeda /// a `Vec`. The contents of a `Vec` wouldn't have a stable address if it were 340753dece8SMiguel Ojeda /// only moved, and it would be more difficult to determine if a `Vec` had 341753dece8SMiguel Ojeda /// actually allocated memory. 342753dece8SMiguel Ojeda /// 343753dece8SMiguel Ojeda /// * It would penalize the general case, incurring an additional branch 344753dece8SMiguel Ojeda /// on every access. 345753dece8SMiguel Ojeda /// 346753dece8SMiguel Ojeda /// `Vec` will never automatically shrink itself, even if completely empty. This 347753dece8SMiguel Ojeda /// ensures no unnecessary allocations or deallocations occur. Emptying a `Vec` 348753dece8SMiguel Ojeda /// and then filling it back up to the same [`len`] should incur no calls to 349753dece8SMiguel Ojeda /// the allocator. If you wish to free up unused memory, use 350753dece8SMiguel Ojeda /// [`shrink_to_fit`] or [`shrink_to`]. 351753dece8SMiguel Ojeda /// 352753dece8SMiguel Ojeda /// [`push`] and [`insert`] will never (re)allocate if the reported capacity is 353753dece8SMiguel Ojeda /// sufficient. [`push`] and [`insert`] *will* (re)allocate if 354753dece8SMiguel Ojeda /// <code>[len] == [capacity]</code>. That is, the reported capacity is completely 355753dece8SMiguel Ojeda /// accurate, and can be relied on. It can even be used to manually free the memory 356753dece8SMiguel Ojeda /// allocated by a `Vec` if desired. Bulk insertion methods *may* reallocate, even 357753dece8SMiguel Ojeda /// when not necessary. 358753dece8SMiguel Ojeda /// 359753dece8SMiguel Ojeda /// `Vec` does not guarantee any particular growth strategy when reallocating 360753dece8SMiguel Ojeda /// when full, nor when [`reserve`] is called. The current strategy is basic 361753dece8SMiguel Ojeda /// and it may prove desirable to use a non-constant growth factor. Whatever 362753dece8SMiguel Ojeda /// strategy is used will of course guarantee *O*(1) amortized [`push`]. 363753dece8SMiguel Ojeda /// 364753dece8SMiguel Ojeda /// `vec![x; n]`, `vec![a, b, c, d]`, and 365753dece8SMiguel Ojeda /// [`Vec::with_capacity(n)`][`Vec::with_capacity`], will all produce a `Vec` 366753dece8SMiguel Ojeda /// with exactly the requested capacity. If <code>[len] == [capacity]</code>, 367753dece8SMiguel Ojeda /// (as is the case for the [`vec!`] macro), then a `Vec<T>` can be converted to 368753dece8SMiguel Ojeda /// and from a [`Box<[T]>`][owned slice] without reallocating or moving the elements. 369753dece8SMiguel Ojeda /// 370753dece8SMiguel Ojeda /// `Vec` will not specifically overwrite any data that is removed from it, 371753dece8SMiguel Ojeda /// but also won't specifically preserve it. Its uninitialized memory is 372753dece8SMiguel Ojeda /// scratch space that it may use however it wants. It will generally just do 373753dece8SMiguel Ojeda /// whatever is most efficient or otherwise easy to implement. Do not rely on 374753dece8SMiguel Ojeda /// removed data to be erased for security purposes. Even if you drop a `Vec`, its 375753dece8SMiguel Ojeda /// buffer may simply be reused by another allocation. Even if you zero a `Vec`'s memory 376753dece8SMiguel Ojeda /// first, that might not actually happen because the optimizer does not consider 377753dece8SMiguel Ojeda /// this a side-effect that must be preserved. There is one case which we will 378753dece8SMiguel Ojeda /// not break, however: using `unsafe` code to write to the excess capacity, 379753dece8SMiguel Ojeda /// and then increasing the length to match, is always valid. 380753dece8SMiguel Ojeda /// 381753dece8SMiguel Ojeda /// Currently, `Vec` does not guarantee the order in which elements are dropped. 382753dece8SMiguel Ojeda /// The order has changed in the past and may change again. 383753dece8SMiguel Ojeda /// 384753dece8SMiguel Ojeda /// [`get`]: ../../std/vec/struct.Vec.html#method.get 385753dece8SMiguel Ojeda /// [`get_mut`]: ../../std/vec/struct.Vec.html#method.get_mut 386753dece8SMiguel Ojeda /// [`String`]: crate::string::String 387753dece8SMiguel Ojeda /// [`&str`]: type@str 388753dece8SMiguel Ojeda /// [`shrink_to_fit`]: Vec::shrink_to_fit 389753dece8SMiguel Ojeda /// [`shrink_to`]: Vec::shrink_to 390753dece8SMiguel Ojeda /// [capacity]: Vec::capacity 391753dece8SMiguel Ojeda /// [`capacity`]: Vec::capacity 392753dece8SMiguel Ojeda /// [mem::size_of::\<T>]: core::mem::size_of 393753dece8SMiguel Ojeda /// [len]: Vec::len 394753dece8SMiguel Ojeda /// [`len`]: Vec::len 395753dece8SMiguel Ojeda /// [`push`]: Vec::push 396753dece8SMiguel Ojeda /// [`insert`]: Vec::insert 397753dece8SMiguel Ojeda /// [`reserve`]: Vec::reserve 398753dece8SMiguel Ojeda /// [`MaybeUninit`]: core::mem::MaybeUninit 399753dece8SMiguel Ojeda /// [owned slice]: Box 400753dece8SMiguel Ojeda #[stable(feature = "rust1", since = "1.0.0")] 401753dece8SMiguel Ojeda #[cfg_attr(not(test), rustc_diagnostic_item = "Vec")] 402753dece8SMiguel Ojeda #[rustc_insignificant_dtor] 403753dece8SMiguel Ojeda pub struct Vec<T, #[unstable(feature = "allocator_api", issue = "32838")] A: Allocator = Global> { 404753dece8SMiguel Ojeda buf: RawVec<T, A>, 405753dece8SMiguel Ojeda len: usize, 406753dece8SMiguel Ojeda } 407753dece8SMiguel Ojeda 408753dece8SMiguel Ojeda //////////////////////////////////////////////////////////////////////////////// 409753dece8SMiguel Ojeda // Inherent methods 410753dece8SMiguel Ojeda //////////////////////////////////////////////////////////////////////////////// 411753dece8SMiguel Ojeda 412753dece8SMiguel Ojeda impl<T> Vec<T> { 413753dece8SMiguel Ojeda /// Constructs a new, empty `Vec<T>`. 414753dece8SMiguel Ojeda /// 415753dece8SMiguel Ojeda /// The vector will not allocate until elements are pushed onto it. 416753dece8SMiguel Ojeda /// 417753dece8SMiguel Ojeda /// # Examples 418753dece8SMiguel Ojeda /// 419753dece8SMiguel Ojeda /// ``` 420753dece8SMiguel Ojeda /// # #![allow(unused_mut)] 421753dece8SMiguel Ojeda /// let mut vec: Vec<i32> = Vec::new(); 422753dece8SMiguel Ojeda /// ``` 423753dece8SMiguel Ojeda #[inline] 424753dece8SMiguel Ojeda #[rustc_const_stable(feature = "const_vec_new", since = "1.39.0")] 425753dece8SMiguel Ojeda #[stable(feature = "rust1", since = "1.0.0")] 426753dece8SMiguel Ojeda #[must_use] 427753dece8SMiguel Ojeda pub const fn new() -> Self { 428753dece8SMiguel Ojeda Vec { buf: RawVec::NEW, len: 0 } 429753dece8SMiguel Ojeda } 430753dece8SMiguel Ojeda 431753dece8SMiguel Ojeda /// Constructs a new, empty `Vec<T>` with the specified capacity. 432753dece8SMiguel Ojeda /// 433753dece8SMiguel Ojeda /// The vector will be able to hold exactly `capacity` elements without 434753dece8SMiguel Ojeda /// reallocating. If `capacity` is 0, the vector will not allocate. 435753dece8SMiguel Ojeda /// 436753dece8SMiguel Ojeda /// It is important to note that although the returned vector has the 437753dece8SMiguel Ojeda /// *capacity* specified, the vector will have a zero *length*. For an 438753dece8SMiguel Ojeda /// explanation of the difference between length and capacity, see 439753dece8SMiguel Ojeda /// *[Capacity and reallocation]*. 440753dece8SMiguel Ojeda /// 441753dece8SMiguel Ojeda /// [Capacity and reallocation]: #capacity-and-reallocation 442753dece8SMiguel Ojeda /// 443753dece8SMiguel Ojeda /// # Panics 444753dece8SMiguel Ojeda /// 445753dece8SMiguel Ojeda /// Panics if the new capacity exceeds `isize::MAX` bytes. 446753dece8SMiguel Ojeda /// 447753dece8SMiguel Ojeda /// # Examples 448753dece8SMiguel Ojeda /// 449753dece8SMiguel Ojeda /// ``` 450753dece8SMiguel Ojeda /// let mut vec = Vec::with_capacity(10); 451753dece8SMiguel Ojeda /// 452753dece8SMiguel Ojeda /// // The vector contains no items, even though it has capacity for more 453753dece8SMiguel Ojeda /// assert_eq!(vec.len(), 0); 454753dece8SMiguel Ojeda /// assert_eq!(vec.capacity(), 10); 455753dece8SMiguel Ojeda /// 456753dece8SMiguel Ojeda /// // These are all done without reallocating... 457753dece8SMiguel Ojeda /// for i in 0..10 { 458753dece8SMiguel Ojeda /// vec.push(i); 459753dece8SMiguel Ojeda /// } 460753dece8SMiguel Ojeda /// assert_eq!(vec.len(), 10); 461753dece8SMiguel Ojeda /// assert_eq!(vec.capacity(), 10); 462753dece8SMiguel Ojeda /// 463753dece8SMiguel Ojeda /// // ...but this may make the vector reallocate 464753dece8SMiguel Ojeda /// vec.push(11); 465753dece8SMiguel Ojeda /// assert_eq!(vec.len(), 11); 466753dece8SMiguel Ojeda /// assert!(vec.capacity() >= 11); 467753dece8SMiguel Ojeda /// ``` 468753dece8SMiguel Ojeda #[cfg(not(no_global_oom_handling))] 469753dece8SMiguel Ojeda #[inline] 470753dece8SMiguel Ojeda #[stable(feature = "rust1", since = "1.0.0")] 471753dece8SMiguel Ojeda #[must_use] 472753dece8SMiguel Ojeda pub fn with_capacity(capacity: usize) -> Self { 473753dece8SMiguel Ojeda Self::with_capacity_in(capacity, Global) 474753dece8SMiguel Ojeda } 475753dece8SMiguel Ojeda 476feadd062SMiguel Ojeda /// Tries to construct a new, empty `Vec<T>` with the specified capacity. 477feadd062SMiguel Ojeda /// 478feadd062SMiguel Ojeda /// The vector will be able to hold exactly `capacity` elements without 479feadd062SMiguel Ojeda /// reallocating. If `capacity` is 0, the vector will not allocate. 480feadd062SMiguel Ojeda /// 481feadd062SMiguel Ojeda /// It is important to note that although the returned vector has the 482feadd062SMiguel Ojeda /// *capacity* specified, the vector will have a zero *length*. For an 483feadd062SMiguel Ojeda /// explanation of the difference between length and capacity, see 484feadd062SMiguel Ojeda /// *[Capacity and reallocation]*. 485feadd062SMiguel Ojeda /// 486feadd062SMiguel Ojeda /// [Capacity and reallocation]: #capacity-and-reallocation 487feadd062SMiguel Ojeda /// 488feadd062SMiguel Ojeda /// # Examples 489feadd062SMiguel Ojeda /// 490feadd062SMiguel Ojeda /// ``` 491feadd062SMiguel Ojeda /// let mut vec = Vec::try_with_capacity(10).unwrap(); 492feadd062SMiguel Ojeda /// 493feadd062SMiguel Ojeda /// // The vector contains no items, even though it has capacity for more 494feadd062SMiguel Ojeda /// assert_eq!(vec.len(), 0); 495feadd062SMiguel Ojeda /// assert_eq!(vec.capacity(), 10); 496feadd062SMiguel Ojeda /// 497feadd062SMiguel Ojeda /// // These are all done without reallocating... 498feadd062SMiguel Ojeda /// for i in 0..10 { 499feadd062SMiguel Ojeda /// vec.push(i); 500feadd062SMiguel Ojeda /// } 501feadd062SMiguel Ojeda /// assert_eq!(vec.len(), 10); 502feadd062SMiguel Ojeda /// assert_eq!(vec.capacity(), 10); 503feadd062SMiguel Ojeda /// 504feadd062SMiguel Ojeda /// // ...but this may make the vector reallocate 505feadd062SMiguel Ojeda /// vec.push(11); 506feadd062SMiguel Ojeda /// assert_eq!(vec.len(), 11); 507feadd062SMiguel Ojeda /// assert!(vec.capacity() >= 11); 508feadd062SMiguel Ojeda /// 509feadd062SMiguel Ojeda /// let mut result = Vec::try_with_capacity(usize::MAX); 510feadd062SMiguel Ojeda /// assert!(result.is_err()); 511feadd062SMiguel Ojeda /// ``` 512feadd062SMiguel Ojeda #[inline] 513feadd062SMiguel Ojeda #[stable(feature = "kernel", since = "1.0.0")] 514feadd062SMiguel Ojeda pub fn try_with_capacity(capacity: usize) -> Result<Self, TryReserveError> { 515feadd062SMiguel Ojeda Self::try_with_capacity_in(capacity, Global) 516feadd062SMiguel Ojeda } 517feadd062SMiguel Ojeda 518753dece8SMiguel Ojeda /// Creates a `Vec<T>` directly from the raw components of another vector. 519753dece8SMiguel Ojeda /// 520753dece8SMiguel Ojeda /// # Safety 521753dece8SMiguel Ojeda /// 522753dece8SMiguel Ojeda /// This is highly unsafe, due to the number of invariants that aren't 523753dece8SMiguel Ojeda /// checked: 524753dece8SMiguel Ojeda /// 525753dece8SMiguel Ojeda /// * `ptr` needs to have been previously allocated via [`String`]/`Vec<T>` 526753dece8SMiguel Ojeda /// (at least, it's highly likely to be incorrect if it wasn't). 527753dece8SMiguel Ojeda /// * `T` needs to have the same alignment as what `ptr` was allocated with. 528753dece8SMiguel Ojeda /// (`T` having a less strict alignment is not sufficient, the alignment really 529753dece8SMiguel Ojeda /// needs to be equal to satisfy the [`dealloc`] requirement that memory must be 530753dece8SMiguel Ojeda /// allocated and deallocated with the same layout.) 531753dece8SMiguel Ojeda /// * The size of `T` times the `capacity` (ie. the allocated size in bytes) needs 532753dece8SMiguel Ojeda /// to be the same size as the pointer was allocated with. (Because similar to 533753dece8SMiguel Ojeda /// alignment, [`dealloc`] must be called with the same layout `size`.) 534753dece8SMiguel Ojeda /// * `length` needs to be less than or equal to `capacity`. 535753dece8SMiguel Ojeda /// 536753dece8SMiguel Ojeda /// Violating these may cause problems like corrupting the allocator's 537753dece8SMiguel Ojeda /// internal data structures. For example it is normally **not** safe 538753dece8SMiguel Ojeda /// to build a `Vec<u8>` from a pointer to a C `char` array with length 539753dece8SMiguel Ojeda /// `size_t`, doing so is only safe if the array was initially allocated by 540753dece8SMiguel Ojeda /// a `Vec` or `String`. 541753dece8SMiguel Ojeda /// It's also not safe to build one from a `Vec<u16>` and its length, because 542753dece8SMiguel Ojeda /// the allocator cares about the alignment, and these two types have different 543753dece8SMiguel Ojeda /// alignments. The buffer was allocated with alignment 2 (for `u16`), but after 544753dece8SMiguel Ojeda /// turning it into a `Vec<u8>` it'll be deallocated with alignment 1. To avoid 545753dece8SMiguel Ojeda /// these issues, it is often preferable to do casting/transmuting using 546753dece8SMiguel Ojeda /// [`slice::from_raw_parts`] instead. 547753dece8SMiguel Ojeda /// 548753dece8SMiguel Ojeda /// The ownership of `ptr` is effectively transferred to the 549753dece8SMiguel Ojeda /// `Vec<T>` which may then deallocate, reallocate or change the 550753dece8SMiguel Ojeda /// contents of memory pointed to by the pointer at will. Ensure 551753dece8SMiguel Ojeda /// that nothing else uses the pointer after calling this 552753dece8SMiguel Ojeda /// function. 553753dece8SMiguel Ojeda /// 554753dece8SMiguel Ojeda /// [`String`]: crate::string::String 555753dece8SMiguel Ojeda /// [`dealloc`]: crate::alloc::GlobalAlloc::dealloc 556753dece8SMiguel Ojeda /// 557753dece8SMiguel Ojeda /// # Examples 558753dece8SMiguel Ojeda /// 559753dece8SMiguel Ojeda /// ``` 560753dece8SMiguel Ojeda /// use std::ptr; 561753dece8SMiguel Ojeda /// use std::mem; 562753dece8SMiguel Ojeda /// 563753dece8SMiguel Ojeda /// let v = vec![1, 2, 3]; 564753dece8SMiguel Ojeda /// 565753dece8SMiguel Ojeda // FIXME Update this when vec_into_raw_parts is stabilized 566753dece8SMiguel Ojeda /// // Prevent running `v`'s destructor so we are in complete control 567753dece8SMiguel Ojeda /// // of the allocation. 568753dece8SMiguel Ojeda /// let mut v = mem::ManuallyDrop::new(v); 569753dece8SMiguel Ojeda /// 570753dece8SMiguel Ojeda /// // Pull out the various important pieces of information about `v` 571753dece8SMiguel Ojeda /// let p = v.as_mut_ptr(); 572753dece8SMiguel Ojeda /// let len = v.len(); 573753dece8SMiguel Ojeda /// let cap = v.capacity(); 574753dece8SMiguel Ojeda /// 575753dece8SMiguel Ojeda /// unsafe { 576753dece8SMiguel Ojeda /// // Overwrite memory with 4, 5, 6 577753dece8SMiguel Ojeda /// for i in 0..len as isize { 578753dece8SMiguel Ojeda /// ptr::write(p.offset(i), 4 + i); 579753dece8SMiguel Ojeda /// } 580753dece8SMiguel Ojeda /// 581753dece8SMiguel Ojeda /// // Put everything back together into a Vec 582753dece8SMiguel Ojeda /// let rebuilt = Vec::from_raw_parts(p, len, cap); 583753dece8SMiguel Ojeda /// assert_eq!(rebuilt, [4, 5, 6]); 584753dece8SMiguel Ojeda /// } 585753dece8SMiguel Ojeda /// ``` 586753dece8SMiguel Ojeda #[inline] 587753dece8SMiguel Ojeda #[stable(feature = "rust1", since = "1.0.0")] 588753dece8SMiguel Ojeda pub unsafe fn from_raw_parts(ptr: *mut T, length: usize, capacity: usize) -> Self { 589753dece8SMiguel Ojeda unsafe { Self::from_raw_parts_in(ptr, length, capacity, Global) } 590753dece8SMiguel Ojeda } 591753dece8SMiguel Ojeda } 592753dece8SMiguel Ojeda 593753dece8SMiguel Ojeda impl<T, A: Allocator> Vec<T, A> { 594753dece8SMiguel Ojeda /// Constructs a new, empty `Vec<T, A>`. 595753dece8SMiguel Ojeda /// 596753dece8SMiguel Ojeda /// The vector will not allocate until elements are pushed onto it. 597753dece8SMiguel Ojeda /// 598753dece8SMiguel Ojeda /// # Examples 599753dece8SMiguel Ojeda /// 600753dece8SMiguel Ojeda /// ``` 601753dece8SMiguel Ojeda /// #![feature(allocator_api)] 602753dece8SMiguel Ojeda /// 603753dece8SMiguel Ojeda /// use std::alloc::System; 604753dece8SMiguel Ojeda /// 605753dece8SMiguel Ojeda /// # #[allow(unused_mut)] 606753dece8SMiguel Ojeda /// let mut vec: Vec<i32, _> = Vec::new_in(System); 607753dece8SMiguel Ojeda /// ``` 608753dece8SMiguel Ojeda #[inline] 609753dece8SMiguel Ojeda #[unstable(feature = "allocator_api", issue = "32838")] 610753dece8SMiguel Ojeda pub const fn new_in(alloc: A) -> Self { 611753dece8SMiguel Ojeda Vec { buf: RawVec::new_in(alloc), len: 0 } 612753dece8SMiguel Ojeda } 613753dece8SMiguel Ojeda 614753dece8SMiguel Ojeda /// Constructs a new, empty `Vec<T, A>` with the specified capacity with the provided 615753dece8SMiguel Ojeda /// allocator. 616753dece8SMiguel Ojeda /// 617753dece8SMiguel Ojeda /// The vector will be able to hold exactly `capacity` elements without 618753dece8SMiguel Ojeda /// reallocating. If `capacity` is 0, the vector will not allocate. 619753dece8SMiguel Ojeda /// 620753dece8SMiguel Ojeda /// It is important to note that although the returned vector has the 621753dece8SMiguel Ojeda /// *capacity* specified, the vector will have a zero *length*. For an 622753dece8SMiguel Ojeda /// explanation of the difference between length and capacity, see 623753dece8SMiguel Ojeda /// *[Capacity and reallocation]*. 624753dece8SMiguel Ojeda /// 625753dece8SMiguel Ojeda /// [Capacity and reallocation]: #capacity-and-reallocation 626753dece8SMiguel Ojeda /// 627753dece8SMiguel Ojeda /// # Panics 628753dece8SMiguel Ojeda /// 629753dece8SMiguel Ojeda /// Panics if the new capacity exceeds `isize::MAX` bytes. 630753dece8SMiguel Ojeda /// 631753dece8SMiguel Ojeda /// # Examples 632753dece8SMiguel Ojeda /// 633753dece8SMiguel Ojeda /// ``` 634753dece8SMiguel Ojeda /// #![feature(allocator_api)] 635753dece8SMiguel Ojeda /// 636753dece8SMiguel Ojeda /// use std::alloc::System; 637753dece8SMiguel Ojeda /// 638753dece8SMiguel Ojeda /// let mut vec = Vec::with_capacity_in(10, System); 639753dece8SMiguel Ojeda /// 640753dece8SMiguel Ojeda /// // The vector contains no items, even though it has capacity for more 641753dece8SMiguel Ojeda /// assert_eq!(vec.len(), 0); 642753dece8SMiguel Ojeda /// assert_eq!(vec.capacity(), 10); 643753dece8SMiguel Ojeda /// 644753dece8SMiguel Ojeda /// // These are all done without reallocating... 645753dece8SMiguel Ojeda /// for i in 0..10 { 646753dece8SMiguel Ojeda /// vec.push(i); 647753dece8SMiguel Ojeda /// } 648753dece8SMiguel Ojeda /// assert_eq!(vec.len(), 10); 649753dece8SMiguel Ojeda /// assert_eq!(vec.capacity(), 10); 650753dece8SMiguel Ojeda /// 651753dece8SMiguel Ojeda /// // ...but this may make the vector reallocate 652753dece8SMiguel Ojeda /// vec.push(11); 653753dece8SMiguel Ojeda /// assert_eq!(vec.len(), 11); 654753dece8SMiguel Ojeda /// assert!(vec.capacity() >= 11); 655753dece8SMiguel Ojeda /// ``` 656753dece8SMiguel Ojeda #[cfg(not(no_global_oom_handling))] 657753dece8SMiguel Ojeda #[inline] 658753dece8SMiguel Ojeda #[unstable(feature = "allocator_api", issue = "32838")] 659753dece8SMiguel Ojeda pub fn with_capacity_in(capacity: usize, alloc: A) -> Self { 660753dece8SMiguel Ojeda Vec { buf: RawVec::with_capacity_in(capacity, alloc), len: 0 } 661753dece8SMiguel Ojeda } 662753dece8SMiguel Ojeda 663feadd062SMiguel Ojeda /// Tries to construct a new, empty `Vec<T, A>` with the specified capacity 664feadd062SMiguel Ojeda /// with the provided allocator. 665feadd062SMiguel Ojeda /// 666feadd062SMiguel Ojeda /// The vector will be able to hold exactly `capacity` elements without 667feadd062SMiguel Ojeda /// reallocating. If `capacity` is 0, the vector will not allocate. 668feadd062SMiguel Ojeda /// 669feadd062SMiguel Ojeda /// It is important to note that although the returned vector has the 670feadd062SMiguel Ojeda /// *capacity* specified, the vector will have a zero *length*. For an 671feadd062SMiguel Ojeda /// explanation of the difference between length and capacity, see 672feadd062SMiguel Ojeda /// *[Capacity and reallocation]*. 673feadd062SMiguel Ojeda /// 674feadd062SMiguel Ojeda /// [Capacity and reallocation]: #capacity-and-reallocation 675feadd062SMiguel Ojeda /// 676feadd062SMiguel Ojeda /// # Examples 677feadd062SMiguel Ojeda /// 678feadd062SMiguel Ojeda /// ``` 679feadd062SMiguel Ojeda /// #![feature(allocator_api)] 680feadd062SMiguel Ojeda /// 681feadd062SMiguel Ojeda /// use std::alloc::System; 682feadd062SMiguel Ojeda /// 683feadd062SMiguel Ojeda /// let mut vec = Vec::try_with_capacity_in(10, System).unwrap(); 684feadd062SMiguel Ojeda /// 685feadd062SMiguel Ojeda /// // The vector contains no items, even though it has capacity for more 686feadd062SMiguel Ojeda /// assert_eq!(vec.len(), 0); 687feadd062SMiguel Ojeda /// assert_eq!(vec.capacity(), 10); 688feadd062SMiguel Ojeda /// 689feadd062SMiguel Ojeda /// // These are all done without reallocating... 690feadd062SMiguel Ojeda /// for i in 0..10 { 691feadd062SMiguel Ojeda /// vec.push(i); 692feadd062SMiguel Ojeda /// } 693feadd062SMiguel Ojeda /// assert_eq!(vec.len(), 10); 694feadd062SMiguel Ojeda /// assert_eq!(vec.capacity(), 10); 695feadd062SMiguel Ojeda /// 696feadd062SMiguel Ojeda /// // ...but this may make the vector reallocate 697feadd062SMiguel Ojeda /// vec.push(11); 698feadd062SMiguel Ojeda /// assert_eq!(vec.len(), 11); 699feadd062SMiguel Ojeda /// assert!(vec.capacity() >= 11); 700feadd062SMiguel Ojeda /// 701feadd062SMiguel Ojeda /// let mut result = Vec::try_with_capacity_in(usize::MAX, System); 702feadd062SMiguel Ojeda /// assert!(result.is_err()); 703feadd062SMiguel Ojeda /// ``` 704feadd062SMiguel Ojeda #[inline] 705feadd062SMiguel Ojeda #[stable(feature = "kernel", since = "1.0.0")] 706feadd062SMiguel Ojeda pub fn try_with_capacity_in(capacity: usize, alloc: A) -> Result<Self, TryReserveError> { 707feadd062SMiguel Ojeda Ok(Vec { buf: RawVec::try_with_capacity_in(capacity, alloc)?, len: 0 }) 708feadd062SMiguel Ojeda } 709feadd062SMiguel Ojeda 710753dece8SMiguel Ojeda /// Creates a `Vec<T, A>` directly from the raw components of another vector. 711753dece8SMiguel Ojeda /// 712753dece8SMiguel Ojeda /// # Safety 713753dece8SMiguel Ojeda /// 714753dece8SMiguel Ojeda /// This is highly unsafe, due to the number of invariants that aren't 715753dece8SMiguel Ojeda /// checked: 716753dece8SMiguel Ojeda /// 717753dece8SMiguel Ojeda /// * `ptr` needs to have been previously allocated via [`String`]/`Vec<T>` 718753dece8SMiguel Ojeda /// (at least, it's highly likely to be incorrect if it wasn't). 719753dece8SMiguel Ojeda /// * `T` needs to have the same size and alignment as what `ptr` was allocated with. 720753dece8SMiguel Ojeda /// (`T` having a less strict alignment is not sufficient, the alignment really 721753dece8SMiguel Ojeda /// needs to be equal to satisfy the [`dealloc`] requirement that memory must be 722753dece8SMiguel Ojeda /// allocated and deallocated with the same layout.) 723753dece8SMiguel Ojeda /// * `length` needs to be less than or equal to `capacity`. 724753dece8SMiguel Ojeda /// * `capacity` needs to be the capacity that the pointer was allocated with. 725753dece8SMiguel Ojeda /// 726753dece8SMiguel Ojeda /// Violating these may cause problems like corrupting the allocator's 727753dece8SMiguel Ojeda /// internal data structures. For example it is **not** safe 728753dece8SMiguel Ojeda /// to build a `Vec<u8>` from a pointer to a C `char` array with length `size_t`. 729753dece8SMiguel Ojeda /// It's also not safe to build one from a `Vec<u16>` and its length, because 730753dece8SMiguel Ojeda /// the allocator cares about the alignment, and these two types have different 731753dece8SMiguel Ojeda /// alignments. The buffer was allocated with alignment 2 (for `u16`), but after 732753dece8SMiguel Ojeda /// turning it into a `Vec<u8>` it'll be deallocated with alignment 1. 733753dece8SMiguel Ojeda /// 734753dece8SMiguel Ojeda /// The ownership of `ptr` is effectively transferred to the 735753dece8SMiguel Ojeda /// `Vec<T>` which may then deallocate, reallocate or change the 736753dece8SMiguel Ojeda /// contents of memory pointed to by the pointer at will. Ensure 737753dece8SMiguel Ojeda /// that nothing else uses the pointer after calling this 738753dece8SMiguel Ojeda /// function. 739753dece8SMiguel Ojeda /// 740753dece8SMiguel Ojeda /// [`String`]: crate::string::String 741753dece8SMiguel Ojeda /// [`dealloc`]: crate::alloc::GlobalAlloc::dealloc 742753dece8SMiguel Ojeda /// 743753dece8SMiguel Ojeda /// # Examples 744753dece8SMiguel Ojeda /// 745753dece8SMiguel Ojeda /// ``` 746753dece8SMiguel Ojeda /// #![feature(allocator_api)] 747753dece8SMiguel Ojeda /// 748753dece8SMiguel Ojeda /// use std::alloc::System; 749753dece8SMiguel Ojeda /// 750753dece8SMiguel Ojeda /// use std::ptr; 751753dece8SMiguel Ojeda /// use std::mem; 752753dece8SMiguel Ojeda /// 753753dece8SMiguel Ojeda /// let mut v = Vec::with_capacity_in(3, System); 754753dece8SMiguel Ojeda /// v.push(1); 755753dece8SMiguel Ojeda /// v.push(2); 756753dece8SMiguel Ojeda /// v.push(3); 757753dece8SMiguel Ojeda /// 758753dece8SMiguel Ojeda // FIXME Update this when vec_into_raw_parts is stabilized 759753dece8SMiguel Ojeda /// // Prevent running `v`'s destructor so we are in complete control 760753dece8SMiguel Ojeda /// // of the allocation. 761753dece8SMiguel Ojeda /// let mut v = mem::ManuallyDrop::new(v); 762753dece8SMiguel Ojeda /// 763753dece8SMiguel Ojeda /// // Pull out the various important pieces of information about `v` 764753dece8SMiguel Ojeda /// let p = v.as_mut_ptr(); 765753dece8SMiguel Ojeda /// let len = v.len(); 766753dece8SMiguel Ojeda /// let cap = v.capacity(); 767753dece8SMiguel Ojeda /// let alloc = v.allocator(); 768753dece8SMiguel Ojeda /// 769753dece8SMiguel Ojeda /// unsafe { 770753dece8SMiguel Ojeda /// // Overwrite memory with 4, 5, 6 771753dece8SMiguel Ojeda /// for i in 0..len as isize { 772753dece8SMiguel Ojeda /// ptr::write(p.offset(i), 4 + i); 773753dece8SMiguel Ojeda /// } 774753dece8SMiguel Ojeda /// 775753dece8SMiguel Ojeda /// // Put everything back together into a Vec 776753dece8SMiguel Ojeda /// let rebuilt = Vec::from_raw_parts_in(p, len, cap, alloc.clone()); 777753dece8SMiguel Ojeda /// assert_eq!(rebuilt, [4, 5, 6]); 778753dece8SMiguel Ojeda /// } 779753dece8SMiguel Ojeda /// ``` 780753dece8SMiguel Ojeda #[inline] 781753dece8SMiguel Ojeda #[unstable(feature = "allocator_api", issue = "32838")] 782753dece8SMiguel Ojeda pub unsafe fn from_raw_parts_in(ptr: *mut T, length: usize, capacity: usize, alloc: A) -> Self { 783753dece8SMiguel Ojeda unsafe { Vec { buf: RawVec::from_raw_parts_in(ptr, capacity, alloc), len: length } } 784753dece8SMiguel Ojeda } 785753dece8SMiguel Ojeda 786753dece8SMiguel Ojeda /// Decomposes a `Vec<T>` into its raw components. 787753dece8SMiguel Ojeda /// 788753dece8SMiguel Ojeda /// Returns the raw pointer to the underlying data, the length of 789753dece8SMiguel Ojeda /// the vector (in elements), and the allocated capacity of the 790753dece8SMiguel Ojeda /// data (in elements). These are the same arguments in the same 791753dece8SMiguel Ojeda /// order as the arguments to [`from_raw_parts`]. 792753dece8SMiguel Ojeda /// 793753dece8SMiguel Ojeda /// After calling this function, the caller is responsible for the 794753dece8SMiguel Ojeda /// memory previously managed by the `Vec`. The only way to do 795753dece8SMiguel Ojeda /// this is to convert the raw pointer, length, and capacity back 796753dece8SMiguel Ojeda /// into a `Vec` with the [`from_raw_parts`] function, allowing 797753dece8SMiguel Ojeda /// the destructor to perform the cleanup. 798753dece8SMiguel Ojeda /// 799753dece8SMiguel Ojeda /// [`from_raw_parts`]: Vec::from_raw_parts 800753dece8SMiguel Ojeda /// 801753dece8SMiguel Ojeda /// # Examples 802753dece8SMiguel Ojeda /// 803753dece8SMiguel Ojeda /// ``` 804753dece8SMiguel Ojeda /// #![feature(vec_into_raw_parts)] 805753dece8SMiguel Ojeda /// let v: Vec<i32> = vec![-1, 0, 1]; 806753dece8SMiguel Ojeda /// 807753dece8SMiguel Ojeda /// let (ptr, len, cap) = v.into_raw_parts(); 808753dece8SMiguel Ojeda /// 809753dece8SMiguel Ojeda /// let rebuilt = unsafe { 810753dece8SMiguel Ojeda /// // We can now make changes to the components, such as 811753dece8SMiguel Ojeda /// // transmuting the raw pointer to a compatible type. 812753dece8SMiguel Ojeda /// let ptr = ptr as *mut u32; 813753dece8SMiguel Ojeda /// 814753dece8SMiguel Ojeda /// Vec::from_raw_parts(ptr, len, cap) 815753dece8SMiguel Ojeda /// }; 816753dece8SMiguel Ojeda /// assert_eq!(rebuilt, [4294967295, 0, 1]); 817753dece8SMiguel Ojeda /// ``` 818753dece8SMiguel Ojeda #[unstable(feature = "vec_into_raw_parts", reason = "new API", issue = "65816")] 819753dece8SMiguel Ojeda pub fn into_raw_parts(self) -> (*mut T, usize, usize) { 820753dece8SMiguel Ojeda let mut me = ManuallyDrop::new(self); 821753dece8SMiguel Ojeda (me.as_mut_ptr(), me.len(), me.capacity()) 822753dece8SMiguel Ojeda } 823753dece8SMiguel Ojeda 824753dece8SMiguel Ojeda /// Decomposes a `Vec<T>` into its raw components. 825753dece8SMiguel Ojeda /// 826753dece8SMiguel Ojeda /// Returns the raw pointer to the underlying data, the length of the vector (in elements), 827753dece8SMiguel Ojeda /// the allocated capacity of the data (in elements), and the allocator. These are the same 828753dece8SMiguel Ojeda /// arguments in the same order as the arguments to [`from_raw_parts_in`]. 829753dece8SMiguel Ojeda /// 830753dece8SMiguel Ojeda /// After calling this function, the caller is responsible for the 831753dece8SMiguel Ojeda /// memory previously managed by the `Vec`. The only way to do 832753dece8SMiguel Ojeda /// this is to convert the raw pointer, length, and capacity back 833753dece8SMiguel Ojeda /// into a `Vec` with the [`from_raw_parts_in`] function, allowing 834753dece8SMiguel Ojeda /// the destructor to perform the cleanup. 835753dece8SMiguel Ojeda /// 836753dece8SMiguel Ojeda /// [`from_raw_parts_in`]: Vec::from_raw_parts_in 837753dece8SMiguel Ojeda /// 838753dece8SMiguel Ojeda /// # Examples 839753dece8SMiguel Ojeda /// 840753dece8SMiguel Ojeda /// ``` 841753dece8SMiguel Ojeda /// #![feature(allocator_api, vec_into_raw_parts)] 842753dece8SMiguel Ojeda /// 843753dece8SMiguel Ojeda /// use std::alloc::System; 844753dece8SMiguel Ojeda /// 845753dece8SMiguel Ojeda /// let mut v: Vec<i32, System> = Vec::new_in(System); 846753dece8SMiguel Ojeda /// v.push(-1); 847753dece8SMiguel Ojeda /// v.push(0); 848753dece8SMiguel Ojeda /// v.push(1); 849753dece8SMiguel Ojeda /// 850753dece8SMiguel Ojeda /// let (ptr, len, cap, alloc) = v.into_raw_parts_with_alloc(); 851753dece8SMiguel Ojeda /// 852753dece8SMiguel Ojeda /// let rebuilt = unsafe { 853753dece8SMiguel Ojeda /// // We can now make changes to the components, such as 854753dece8SMiguel Ojeda /// // transmuting the raw pointer to a compatible type. 855753dece8SMiguel Ojeda /// let ptr = ptr as *mut u32; 856753dece8SMiguel Ojeda /// 857753dece8SMiguel Ojeda /// Vec::from_raw_parts_in(ptr, len, cap, alloc) 858753dece8SMiguel Ojeda /// }; 859753dece8SMiguel Ojeda /// assert_eq!(rebuilt, [4294967295, 0, 1]); 860753dece8SMiguel Ojeda /// ``` 861753dece8SMiguel Ojeda #[unstable(feature = "allocator_api", issue = "32838")] 862753dece8SMiguel Ojeda // #[unstable(feature = "vec_into_raw_parts", reason = "new API", issue = "65816")] 863753dece8SMiguel Ojeda pub fn into_raw_parts_with_alloc(self) -> (*mut T, usize, usize, A) { 864753dece8SMiguel Ojeda let mut me = ManuallyDrop::new(self); 865753dece8SMiguel Ojeda let len = me.len(); 866753dece8SMiguel Ojeda let capacity = me.capacity(); 867753dece8SMiguel Ojeda let ptr = me.as_mut_ptr(); 868753dece8SMiguel Ojeda let alloc = unsafe { ptr::read(me.allocator()) }; 869753dece8SMiguel Ojeda (ptr, len, capacity, alloc) 870753dece8SMiguel Ojeda } 871753dece8SMiguel Ojeda 872753dece8SMiguel Ojeda /// Returns the number of elements the vector can hold without 873753dece8SMiguel Ojeda /// reallocating. 874753dece8SMiguel Ojeda /// 875753dece8SMiguel Ojeda /// # Examples 876753dece8SMiguel Ojeda /// 877753dece8SMiguel Ojeda /// ``` 878753dece8SMiguel Ojeda /// let vec: Vec<i32> = Vec::with_capacity(10); 879753dece8SMiguel Ojeda /// assert_eq!(vec.capacity(), 10); 880753dece8SMiguel Ojeda /// ``` 881753dece8SMiguel Ojeda #[inline] 882753dece8SMiguel Ojeda #[stable(feature = "rust1", since = "1.0.0")] 883753dece8SMiguel Ojeda pub fn capacity(&self) -> usize { 884753dece8SMiguel Ojeda self.buf.capacity() 885753dece8SMiguel Ojeda } 886753dece8SMiguel Ojeda 887753dece8SMiguel Ojeda /// Reserves capacity for at least `additional` more elements to be inserted 888753dece8SMiguel Ojeda /// in the given `Vec<T>`. The collection may reserve more space to avoid 889753dece8SMiguel Ojeda /// frequent reallocations. After calling `reserve`, capacity will be 890753dece8SMiguel Ojeda /// greater than or equal to `self.len() + additional`. Does nothing if 891753dece8SMiguel Ojeda /// capacity is already sufficient. 892753dece8SMiguel Ojeda /// 893753dece8SMiguel Ojeda /// # Panics 894753dece8SMiguel Ojeda /// 895753dece8SMiguel Ojeda /// Panics if the new capacity exceeds `isize::MAX` bytes. 896753dece8SMiguel Ojeda /// 897753dece8SMiguel Ojeda /// # Examples 898753dece8SMiguel Ojeda /// 899753dece8SMiguel Ojeda /// ``` 900753dece8SMiguel Ojeda /// let mut vec = vec![1]; 901753dece8SMiguel Ojeda /// vec.reserve(10); 902753dece8SMiguel Ojeda /// assert!(vec.capacity() >= 11); 903753dece8SMiguel Ojeda /// ``` 904753dece8SMiguel Ojeda #[cfg(not(no_global_oom_handling))] 905753dece8SMiguel Ojeda #[stable(feature = "rust1", since = "1.0.0")] 906753dece8SMiguel Ojeda pub fn reserve(&mut self, additional: usize) { 907753dece8SMiguel Ojeda self.buf.reserve(self.len, additional); 908753dece8SMiguel Ojeda } 909753dece8SMiguel Ojeda 910753dece8SMiguel Ojeda /// Reserves the minimum capacity for exactly `additional` more elements to 911753dece8SMiguel Ojeda /// be inserted in the given `Vec<T>`. After calling `reserve_exact`, 912753dece8SMiguel Ojeda /// capacity will be greater than or equal to `self.len() + additional`. 913753dece8SMiguel Ojeda /// Does nothing if the capacity is already sufficient. 914753dece8SMiguel Ojeda /// 915753dece8SMiguel Ojeda /// Note that the allocator may give the collection more space than it 916753dece8SMiguel Ojeda /// requests. Therefore, capacity can not be relied upon to be precisely 917753dece8SMiguel Ojeda /// minimal. Prefer [`reserve`] if future insertions are expected. 918753dece8SMiguel Ojeda /// 919753dece8SMiguel Ojeda /// [`reserve`]: Vec::reserve 920753dece8SMiguel Ojeda /// 921753dece8SMiguel Ojeda /// # Panics 922753dece8SMiguel Ojeda /// 923753dece8SMiguel Ojeda /// Panics if the new capacity exceeds `isize::MAX` bytes. 924753dece8SMiguel Ojeda /// 925753dece8SMiguel Ojeda /// # Examples 926753dece8SMiguel Ojeda /// 927753dece8SMiguel Ojeda /// ``` 928753dece8SMiguel Ojeda /// let mut vec = vec![1]; 929753dece8SMiguel Ojeda /// vec.reserve_exact(10); 930753dece8SMiguel Ojeda /// assert!(vec.capacity() >= 11); 931753dece8SMiguel Ojeda /// ``` 932753dece8SMiguel Ojeda #[cfg(not(no_global_oom_handling))] 933753dece8SMiguel Ojeda #[stable(feature = "rust1", since = "1.0.0")] 934753dece8SMiguel Ojeda pub fn reserve_exact(&mut self, additional: usize) { 935753dece8SMiguel Ojeda self.buf.reserve_exact(self.len, additional); 936753dece8SMiguel Ojeda } 937753dece8SMiguel Ojeda 938753dece8SMiguel Ojeda /// Tries to reserve capacity for at least `additional` more elements to be inserted 939753dece8SMiguel Ojeda /// in the given `Vec<T>`. The collection may reserve more space to avoid 940753dece8SMiguel Ojeda /// frequent reallocations. After calling `try_reserve`, capacity will be 941753dece8SMiguel Ojeda /// greater than or equal to `self.len() + additional`. Does nothing if 942753dece8SMiguel Ojeda /// capacity is already sufficient. 943753dece8SMiguel Ojeda /// 944753dece8SMiguel Ojeda /// # Errors 945753dece8SMiguel Ojeda /// 946753dece8SMiguel Ojeda /// If the capacity overflows, or the allocator reports a failure, then an error 947753dece8SMiguel Ojeda /// is returned. 948753dece8SMiguel Ojeda /// 949753dece8SMiguel Ojeda /// # Examples 950753dece8SMiguel Ojeda /// 951753dece8SMiguel Ojeda /// ``` 952753dece8SMiguel Ojeda /// use std::collections::TryReserveError; 953753dece8SMiguel Ojeda /// 954753dece8SMiguel Ojeda /// fn process_data(data: &[u32]) -> Result<Vec<u32>, TryReserveError> { 955753dece8SMiguel Ojeda /// let mut output = Vec::new(); 956753dece8SMiguel Ojeda /// 957753dece8SMiguel Ojeda /// // Pre-reserve the memory, exiting if we can't 958753dece8SMiguel Ojeda /// output.try_reserve(data.len())?; 959753dece8SMiguel Ojeda /// 960753dece8SMiguel Ojeda /// // Now we know this can't OOM in the middle of our complex work 961753dece8SMiguel Ojeda /// output.extend(data.iter().map(|&val| { 962753dece8SMiguel Ojeda /// val * 2 + 5 // very complicated 963753dece8SMiguel Ojeda /// })); 964753dece8SMiguel Ojeda /// 965753dece8SMiguel Ojeda /// Ok(output) 966753dece8SMiguel Ojeda /// } 967753dece8SMiguel Ojeda /// # process_data(&[1, 2, 3]).expect("why is the test harness OOMing on 12 bytes?"); 968753dece8SMiguel Ojeda /// ``` 969753dece8SMiguel Ojeda #[stable(feature = "try_reserve", since = "1.57.0")] 970753dece8SMiguel Ojeda pub fn try_reserve(&mut self, additional: usize) -> Result<(), TryReserveError> { 971753dece8SMiguel Ojeda self.buf.try_reserve(self.len, additional) 972753dece8SMiguel Ojeda } 973753dece8SMiguel Ojeda 974753dece8SMiguel Ojeda /// Tries to reserve the minimum capacity for exactly `additional` 975753dece8SMiguel Ojeda /// elements to be inserted in the given `Vec<T>`. After calling 976753dece8SMiguel Ojeda /// `try_reserve_exact`, capacity will be greater than or equal to 977753dece8SMiguel Ojeda /// `self.len() + additional` if it returns `Ok(())`. 978753dece8SMiguel Ojeda /// Does nothing if the capacity is already sufficient. 979753dece8SMiguel Ojeda /// 980753dece8SMiguel Ojeda /// Note that the allocator may give the collection more space than it 981753dece8SMiguel Ojeda /// requests. Therefore, capacity can not be relied upon to be precisely 982753dece8SMiguel Ojeda /// minimal. Prefer [`try_reserve`] if future insertions are expected. 983753dece8SMiguel Ojeda /// 984753dece8SMiguel Ojeda /// [`try_reserve`]: Vec::try_reserve 985753dece8SMiguel Ojeda /// 986753dece8SMiguel Ojeda /// # Errors 987753dece8SMiguel Ojeda /// 988753dece8SMiguel Ojeda /// If the capacity overflows, or the allocator reports a failure, then an error 989753dece8SMiguel Ojeda /// is returned. 990753dece8SMiguel Ojeda /// 991753dece8SMiguel Ojeda /// # Examples 992753dece8SMiguel Ojeda /// 993753dece8SMiguel Ojeda /// ``` 994753dece8SMiguel Ojeda /// use std::collections::TryReserveError; 995753dece8SMiguel Ojeda /// 996753dece8SMiguel Ojeda /// fn process_data(data: &[u32]) -> Result<Vec<u32>, TryReserveError> { 997753dece8SMiguel Ojeda /// let mut output = Vec::new(); 998753dece8SMiguel Ojeda /// 999753dece8SMiguel Ojeda /// // Pre-reserve the memory, exiting if we can't 1000753dece8SMiguel Ojeda /// output.try_reserve_exact(data.len())?; 1001753dece8SMiguel Ojeda /// 1002753dece8SMiguel Ojeda /// // Now we know this can't OOM in the middle of our complex work 1003753dece8SMiguel Ojeda /// output.extend(data.iter().map(|&val| { 1004753dece8SMiguel Ojeda /// val * 2 + 5 // very complicated 1005753dece8SMiguel Ojeda /// })); 1006753dece8SMiguel Ojeda /// 1007753dece8SMiguel Ojeda /// Ok(output) 1008753dece8SMiguel Ojeda /// } 1009753dece8SMiguel Ojeda /// # process_data(&[1, 2, 3]).expect("why is the test harness OOMing on 12 bytes?"); 1010753dece8SMiguel Ojeda /// ``` 1011753dece8SMiguel Ojeda #[stable(feature = "try_reserve", since = "1.57.0")] 1012753dece8SMiguel Ojeda pub fn try_reserve_exact(&mut self, additional: usize) -> Result<(), TryReserveError> { 1013753dece8SMiguel Ojeda self.buf.try_reserve_exact(self.len, additional) 1014753dece8SMiguel Ojeda } 1015753dece8SMiguel Ojeda 1016753dece8SMiguel Ojeda /// Shrinks the capacity of the vector as much as possible. 1017753dece8SMiguel Ojeda /// 1018753dece8SMiguel Ojeda /// It will drop down as close as possible to the length but the allocator 1019753dece8SMiguel Ojeda /// may still inform the vector that there is space for a few more elements. 1020753dece8SMiguel Ojeda /// 1021753dece8SMiguel Ojeda /// # Examples 1022753dece8SMiguel Ojeda /// 1023753dece8SMiguel Ojeda /// ``` 1024753dece8SMiguel Ojeda /// let mut vec = Vec::with_capacity(10); 1025753dece8SMiguel Ojeda /// vec.extend([1, 2, 3]); 1026753dece8SMiguel Ojeda /// assert_eq!(vec.capacity(), 10); 1027753dece8SMiguel Ojeda /// vec.shrink_to_fit(); 1028753dece8SMiguel Ojeda /// assert!(vec.capacity() >= 3); 1029753dece8SMiguel Ojeda /// ``` 1030753dece8SMiguel Ojeda #[cfg(not(no_global_oom_handling))] 1031753dece8SMiguel Ojeda #[stable(feature = "rust1", since = "1.0.0")] 1032753dece8SMiguel Ojeda pub fn shrink_to_fit(&mut self) { 1033753dece8SMiguel Ojeda // The capacity is never less than the length, and there's nothing to do when 1034753dece8SMiguel Ojeda // they are equal, so we can avoid the panic case in `RawVec::shrink_to_fit` 1035753dece8SMiguel Ojeda // by only calling it with a greater capacity. 1036753dece8SMiguel Ojeda if self.capacity() > self.len { 1037753dece8SMiguel Ojeda self.buf.shrink_to_fit(self.len); 1038753dece8SMiguel Ojeda } 1039753dece8SMiguel Ojeda } 1040753dece8SMiguel Ojeda 1041753dece8SMiguel Ojeda /// Shrinks the capacity of the vector with a lower bound. 1042753dece8SMiguel Ojeda /// 1043753dece8SMiguel Ojeda /// The capacity will remain at least as large as both the length 1044753dece8SMiguel Ojeda /// and the supplied value. 1045753dece8SMiguel Ojeda /// 1046753dece8SMiguel Ojeda /// If the current capacity is less than the lower limit, this is a no-op. 1047753dece8SMiguel Ojeda /// 1048753dece8SMiguel Ojeda /// # Examples 1049753dece8SMiguel Ojeda /// 1050753dece8SMiguel Ojeda /// ``` 1051753dece8SMiguel Ojeda /// let mut vec = Vec::with_capacity(10); 1052753dece8SMiguel Ojeda /// vec.extend([1, 2, 3]); 1053753dece8SMiguel Ojeda /// assert_eq!(vec.capacity(), 10); 1054753dece8SMiguel Ojeda /// vec.shrink_to(4); 1055753dece8SMiguel Ojeda /// assert!(vec.capacity() >= 4); 1056753dece8SMiguel Ojeda /// vec.shrink_to(0); 1057753dece8SMiguel Ojeda /// assert!(vec.capacity() >= 3); 1058753dece8SMiguel Ojeda /// ``` 1059753dece8SMiguel Ojeda #[cfg(not(no_global_oom_handling))] 1060753dece8SMiguel Ojeda #[stable(feature = "shrink_to", since = "1.56.0")] 1061753dece8SMiguel Ojeda pub fn shrink_to(&mut self, min_capacity: usize) { 1062753dece8SMiguel Ojeda if self.capacity() > min_capacity { 1063753dece8SMiguel Ojeda self.buf.shrink_to_fit(cmp::max(self.len, min_capacity)); 1064753dece8SMiguel Ojeda } 1065753dece8SMiguel Ojeda } 1066753dece8SMiguel Ojeda 1067753dece8SMiguel Ojeda /// Converts the vector into [`Box<[T]>`][owned slice]. 1068753dece8SMiguel Ojeda /// 1069753dece8SMiguel Ojeda /// Note that this will drop any excess capacity. 1070753dece8SMiguel Ojeda /// 1071753dece8SMiguel Ojeda /// [owned slice]: Box 1072753dece8SMiguel Ojeda /// 1073753dece8SMiguel Ojeda /// # Examples 1074753dece8SMiguel Ojeda /// 1075753dece8SMiguel Ojeda /// ``` 1076753dece8SMiguel Ojeda /// let v = vec![1, 2, 3]; 1077753dece8SMiguel Ojeda /// 1078753dece8SMiguel Ojeda /// let slice = v.into_boxed_slice(); 1079753dece8SMiguel Ojeda /// ``` 1080753dece8SMiguel Ojeda /// 1081753dece8SMiguel Ojeda /// Any excess capacity is removed: 1082753dece8SMiguel Ojeda /// 1083753dece8SMiguel Ojeda /// ``` 1084753dece8SMiguel Ojeda /// let mut vec = Vec::with_capacity(10); 1085753dece8SMiguel Ojeda /// vec.extend([1, 2, 3]); 1086753dece8SMiguel Ojeda /// 1087753dece8SMiguel Ojeda /// assert_eq!(vec.capacity(), 10); 1088753dece8SMiguel Ojeda /// let slice = vec.into_boxed_slice(); 1089753dece8SMiguel Ojeda /// assert_eq!(slice.into_vec().capacity(), 3); 1090753dece8SMiguel Ojeda /// ``` 1091753dece8SMiguel Ojeda #[cfg(not(no_global_oom_handling))] 1092753dece8SMiguel Ojeda #[stable(feature = "rust1", since = "1.0.0")] 1093753dece8SMiguel Ojeda pub fn into_boxed_slice(mut self) -> Box<[T], A> { 1094753dece8SMiguel Ojeda unsafe { 1095753dece8SMiguel Ojeda self.shrink_to_fit(); 1096753dece8SMiguel Ojeda let me = ManuallyDrop::new(self); 1097753dece8SMiguel Ojeda let buf = ptr::read(&me.buf); 1098753dece8SMiguel Ojeda let len = me.len(); 1099753dece8SMiguel Ojeda buf.into_box(len).assume_init() 1100753dece8SMiguel Ojeda } 1101753dece8SMiguel Ojeda } 1102753dece8SMiguel Ojeda 1103753dece8SMiguel Ojeda /// Shortens the vector, keeping the first `len` elements and dropping 1104753dece8SMiguel Ojeda /// the rest. 1105753dece8SMiguel Ojeda /// 1106753dece8SMiguel Ojeda /// If `len` is greater than the vector's current length, this has no 1107753dece8SMiguel Ojeda /// effect. 1108753dece8SMiguel Ojeda /// 1109753dece8SMiguel Ojeda /// The [`drain`] method can emulate `truncate`, but causes the excess 1110753dece8SMiguel Ojeda /// elements to be returned instead of dropped. 1111753dece8SMiguel Ojeda /// 1112753dece8SMiguel Ojeda /// Note that this method has no effect on the allocated capacity 1113753dece8SMiguel Ojeda /// of the vector. 1114753dece8SMiguel Ojeda /// 1115753dece8SMiguel Ojeda /// # Examples 1116753dece8SMiguel Ojeda /// 1117753dece8SMiguel Ojeda /// Truncating a five element vector to two elements: 1118753dece8SMiguel Ojeda /// 1119753dece8SMiguel Ojeda /// ``` 1120753dece8SMiguel Ojeda /// let mut vec = vec![1, 2, 3, 4, 5]; 1121753dece8SMiguel Ojeda /// vec.truncate(2); 1122753dece8SMiguel Ojeda /// assert_eq!(vec, [1, 2]); 1123753dece8SMiguel Ojeda /// ``` 1124753dece8SMiguel Ojeda /// 1125753dece8SMiguel Ojeda /// No truncation occurs when `len` is greater than the vector's current 1126753dece8SMiguel Ojeda /// length: 1127753dece8SMiguel Ojeda /// 1128753dece8SMiguel Ojeda /// ``` 1129753dece8SMiguel Ojeda /// let mut vec = vec![1, 2, 3]; 1130753dece8SMiguel Ojeda /// vec.truncate(8); 1131753dece8SMiguel Ojeda /// assert_eq!(vec, [1, 2, 3]); 1132753dece8SMiguel Ojeda /// ``` 1133753dece8SMiguel Ojeda /// 1134753dece8SMiguel Ojeda /// Truncating when `len == 0` is equivalent to calling the [`clear`] 1135753dece8SMiguel Ojeda /// method. 1136753dece8SMiguel Ojeda /// 1137753dece8SMiguel Ojeda /// ``` 1138753dece8SMiguel Ojeda /// let mut vec = vec![1, 2, 3]; 1139753dece8SMiguel Ojeda /// vec.truncate(0); 1140753dece8SMiguel Ojeda /// assert_eq!(vec, []); 1141753dece8SMiguel Ojeda /// ``` 1142753dece8SMiguel Ojeda /// 1143753dece8SMiguel Ojeda /// [`clear`]: Vec::clear 1144753dece8SMiguel Ojeda /// [`drain`]: Vec::drain 1145753dece8SMiguel Ojeda #[stable(feature = "rust1", since = "1.0.0")] 1146753dece8SMiguel Ojeda pub fn truncate(&mut self, len: usize) { 1147753dece8SMiguel Ojeda // This is safe because: 1148753dece8SMiguel Ojeda // 1149753dece8SMiguel Ojeda // * the slice passed to `drop_in_place` is valid; the `len > self.len` 1150753dece8SMiguel Ojeda // case avoids creating an invalid slice, and 1151753dece8SMiguel Ojeda // * the `len` of the vector is shrunk before calling `drop_in_place`, 1152753dece8SMiguel Ojeda // such that no value will be dropped twice in case `drop_in_place` 1153753dece8SMiguel Ojeda // were to panic once (if it panics twice, the program aborts). 1154753dece8SMiguel Ojeda unsafe { 1155753dece8SMiguel Ojeda // Note: It's intentional that this is `>` and not `>=`. 1156753dece8SMiguel Ojeda // Changing it to `>=` has negative performance 1157753dece8SMiguel Ojeda // implications in some cases. See #78884 for more. 1158753dece8SMiguel Ojeda if len > self.len { 1159753dece8SMiguel Ojeda return; 1160753dece8SMiguel Ojeda } 1161753dece8SMiguel Ojeda let remaining_len = self.len - len; 1162753dece8SMiguel Ojeda let s = ptr::slice_from_raw_parts_mut(self.as_mut_ptr().add(len), remaining_len); 1163753dece8SMiguel Ojeda self.len = len; 1164753dece8SMiguel Ojeda ptr::drop_in_place(s); 1165753dece8SMiguel Ojeda } 1166753dece8SMiguel Ojeda } 1167753dece8SMiguel Ojeda 1168753dece8SMiguel Ojeda /// Extracts a slice containing the entire vector. 1169753dece8SMiguel Ojeda /// 1170753dece8SMiguel Ojeda /// Equivalent to `&s[..]`. 1171753dece8SMiguel Ojeda /// 1172753dece8SMiguel Ojeda /// # Examples 1173753dece8SMiguel Ojeda /// 1174753dece8SMiguel Ojeda /// ``` 1175753dece8SMiguel Ojeda /// use std::io::{self, Write}; 1176753dece8SMiguel Ojeda /// let buffer = vec![1, 2, 3, 5, 8]; 1177753dece8SMiguel Ojeda /// io::sink().write(buffer.as_slice()).unwrap(); 1178753dece8SMiguel Ojeda /// ``` 1179753dece8SMiguel Ojeda #[inline] 1180753dece8SMiguel Ojeda #[stable(feature = "vec_as_slice", since = "1.7.0")] 1181753dece8SMiguel Ojeda pub fn as_slice(&self) -> &[T] { 1182753dece8SMiguel Ojeda self 1183753dece8SMiguel Ojeda } 1184753dece8SMiguel Ojeda 1185753dece8SMiguel Ojeda /// Extracts a mutable slice of the entire vector. 1186753dece8SMiguel Ojeda /// 1187753dece8SMiguel Ojeda /// Equivalent to `&mut s[..]`. 1188753dece8SMiguel Ojeda /// 1189753dece8SMiguel Ojeda /// # Examples 1190753dece8SMiguel Ojeda /// 1191753dece8SMiguel Ojeda /// ``` 1192753dece8SMiguel Ojeda /// use std::io::{self, Read}; 1193753dece8SMiguel Ojeda /// let mut buffer = vec![0; 3]; 1194753dece8SMiguel Ojeda /// io::repeat(0b101).read_exact(buffer.as_mut_slice()).unwrap(); 1195753dece8SMiguel Ojeda /// ``` 1196753dece8SMiguel Ojeda #[inline] 1197753dece8SMiguel Ojeda #[stable(feature = "vec_as_slice", since = "1.7.0")] 1198753dece8SMiguel Ojeda pub fn as_mut_slice(&mut self) -> &mut [T] { 1199753dece8SMiguel Ojeda self 1200753dece8SMiguel Ojeda } 1201753dece8SMiguel Ojeda 1202753dece8SMiguel Ojeda /// Returns a raw pointer to the vector's buffer. 1203753dece8SMiguel Ojeda /// 1204753dece8SMiguel Ojeda /// The caller must ensure that the vector outlives the pointer this 1205753dece8SMiguel Ojeda /// function returns, or else it will end up pointing to garbage. 1206753dece8SMiguel Ojeda /// Modifying the vector may cause its buffer to be reallocated, 1207753dece8SMiguel Ojeda /// which would also make any pointers to it invalid. 1208753dece8SMiguel Ojeda /// 1209753dece8SMiguel Ojeda /// The caller must also ensure that the memory the pointer (non-transitively) points to 1210753dece8SMiguel Ojeda /// is never written to (except inside an `UnsafeCell`) using this pointer or any pointer 1211753dece8SMiguel Ojeda /// derived from it. If you need to mutate the contents of the slice, use [`as_mut_ptr`]. 1212753dece8SMiguel Ojeda /// 1213753dece8SMiguel Ojeda /// # Examples 1214753dece8SMiguel Ojeda /// 1215753dece8SMiguel Ojeda /// ``` 1216753dece8SMiguel Ojeda /// let x = vec![1, 2, 4]; 1217753dece8SMiguel Ojeda /// let x_ptr = x.as_ptr(); 1218753dece8SMiguel Ojeda /// 1219753dece8SMiguel Ojeda /// unsafe { 1220753dece8SMiguel Ojeda /// for i in 0..x.len() { 1221753dece8SMiguel Ojeda /// assert_eq!(*x_ptr.add(i), 1 << i); 1222753dece8SMiguel Ojeda /// } 1223753dece8SMiguel Ojeda /// } 1224753dece8SMiguel Ojeda /// ``` 1225753dece8SMiguel Ojeda /// 1226753dece8SMiguel Ojeda /// [`as_mut_ptr`]: Vec::as_mut_ptr 1227753dece8SMiguel Ojeda #[stable(feature = "vec_as_ptr", since = "1.37.0")] 1228753dece8SMiguel Ojeda #[inline] 1229753dece8SMiguel Ojeda pub fn as_ptr(&self) -> *const T { 1230753dece8SMiguel Ojeda // We shadow the slice method of the same name to avoid going through 1231753dece8SMiguel Ojeda // `deref`, which creates an intermediate reference. 1232753dece8SMiguel Ojeda let ptr = self.buf.ptr(); 1233753dece8SMiguel Ojeda unsafe { 1234753dece8SMiguel Ojeda assume(!ptr.is_null()); 1235753dece8SMiguel Ojeda } 1236753dece8SMiguel Ojeda ptr 1237753dece8SMiguel Ojeda } 1238753dece8SMiguel Ojeda 1239753dece8SMiguel Ojeda /// Returns an unsafe mutable pointer to the vector's buffer. 1240753dece8SMiguel Ojeda /// 1241753dece8SMiguel Ojeda /// The caller must ensure that the vector outlives the pointer this 1242753dece8SMiguel Ojeda /// function returns, or else it will end up pointing to garbage. 1243753dece8SMiguel Ojeda /// Modifying the vector may cause its buffer to be reallocated, 1244753dece8SMiguel Ojeda /// which would also make any pointers to it invalid. 1245753dece8SMiguel Ojeda /// 1246753dece8SMiguel Ojeda /// # Examples 1247753dece8SMiguel Ojeda /// 1248753dece8SMiguel Ojeda /// ``` 1249753dece8SMiguel Ojeda /// // Allocate vector big enough for 4 elements. 1250753dece8SMiguel Ojeda /// let size = 4; 1251753dece8SMiguel Ojeda /// let mut x: Vec<i32> = Vec::with_capacity(size); 1252753dece8SMiguel Ojeda /// let x_ptr = x.as_mut_ptr(); 1253753dece8SMiguel Ojeda /// 1254753dece8SMiguel Ojeda /// // Initialize elements via raw pointer writes, then set length. 1255753dece8SMiguel Ojeda /// unsafe { 1256753dece8SMiguel Ojeda /// for i in 0..size { 1257753dece8SMiguel Ojeda /// *x_ptr.add(i) = i as i32; 1258753dece8SMiguel Ojeda /// } 1259753dece8SMiguel Ojeda /// x.set_len(size); 1260753dece8SMiguel Ojeda /// } 1261753dece8SMiguel Ojeda /// assert_eq!(&*x, &[0, 1, 2, 3]); 1262753dece8SMiguel Ojeda /// ``` 1263753dece8SMiguel Ojeda #[stable(feature = "vec_as_ptr", since = "1.37.0")] 1264753dece8SMiguel Ojeda #[inline] 1265753dece8SMiguel Ojeda pub fn as_mut_ptr(&mut self) -> *mut T { 1266753dece8SMiguel Ojeda // We shadow the slice method of the same name to avoid going through 1267753dece8SMiguel Ojeda // `deref_mut`, which creates an intermediate reference. 1268753dece8SMiguel Ojeda let ptr = self.buf.ptr(); 1269753dece8SMiguel Ojeda unsafe { 1270753dece8SMiguel Ojeda assume(!ptr.is_null()); 1271753dece8SMiguel Ojeda } 1272753dece8SMiguel Ojeda ptr 1273753dece8SMiguel Ojeda } 1274753dece8SMiguel Ojeda 1275753dece8SMiguel Ojeda /// Returns a reference to the underlying allocator. 1276753dece8SMiguel Ojeda #[unstable(feature = "allocator_api", issue = "32838")] 1277753dece8SMiguel Ojeda #[inline] 1278753dece8SMiguel Ojeda pub fn allocator(&self) -> &A { 1279753dece8SMiguel Ojeda self.buf.allocator() 1280753dece8SMiguel Ojeda } 1281753dece8SMiguel Ojeda 1282753dece8SMiguel Ojeda /// Forces the length of the vector to `new_len`. 1283753dece8SMiguel Ojeda /// 1284753dece8SMiguel Ojeda /// This is a low-level operation that maintains none of the normal 1285753dece8SMiguel Ojeda /// invariants of the type. Normally changing the length of a vector 1286753dece8SMiguel Ojeda /// is done using one of the safe operations instead, such as 1287753dece8SMiguel Ojeda /// [`truncate`], [`resize`], [`extend`], or [`clear`]. 1288753dece8SMiguel Ojeda /// 1289753dece8SMiguel Ojeda /// [`truncate`]: Vec::truncate 1290753dece8SMiguel Ojeda /// [`resize`]: Vec::resize 1291753dece8SMiguel Ojeda /// [`extend`]: Extend::extend 1292753dece8SMiguel Ojeda /// [`clear`]: Vec::clear 1293753dece8SMiguel Ojeda /// 1294753dece8SMiguel Ojeda /// # Safety 1295753dece8SMiguel Ojeda /// 1296753dece8SMiguel Ojeda /// - `new_len` must be less than or equal to [`capacity()`]. 1297753dece8SMiguel Ojeda /// - The elements at `old_len..new_len` must be initialized. 1298753dece8SMiguel Ojeda /// 1299753dece8SMiguel Ojeda /// [`capacity()`]: Vec::capacity 1300753dece8SMiguel Ojeda /// 1301753dece8SMiguel Ojeda /// # Examples 1302753dece8SMiguel Ojeda /// 1303753dece8SMiguel Ojeda /// This method can be useful for situations in which the vector 1304753dece8SMiguel Ojeda /// is serving as a buffer for other code, particularly over FFI: 1305753dece8SMiguel Ojeda /// 1306753dece8SMiguel Ojeda /// ```no_run 1307753dece8SMiguel Ojeda /// # #![allow(dead_code)] 1308753dece8SMiguel Ojeda /// # // This is just a minimal skeleton for the doc example; 1309753dece8SMiguel Ojeda /// # // don't use this as a starting point for a real library. 1310753dece8SMiguel Ojeda /// # pub struct StreamWrapper { strm: *mut std::ffi::c_void } 1311753dece8SMiguel Ojeda /// # const Z_OK: i32 = 0; 1312753dece8SMiguel Ojeda /// # extern "C" { 1313753dece8SMiguel Ojeda /// # fn deflateGetDictionary( 1314753dece8SMiguel Ojeda /// # strm: *mut std::ffi::c_void, 1315753dece8SMiguel Ojeda /// # dictionary: *mut u8, 1316753dece8SMiguel Ojeda /// # dictLength: *mut usize, 1317753dece8SMiguel Ojeda /// # ) -> i32; 1318753dece8SMiguel Ojeda /// # } 1319753dece8SMiguel Ojeda /// # impl StreamWrapper { 1320753dece8SMiguel Ojeda /// pub fn get_dictionary(&self) -> Option<Vec<u8>> { 1321753dece8SMiguel Ojeda /// // Per the FFI method's docs, "32768 bytes is always enough". 1322753dece8SMiguel Ojeda /// let mut dict = Vec::with_capacity(32_768); 1323753dece8SMiguel Ojeda /// let mut dict_length = 0; 1324753dece8SMiguel Ojeda /// // SAFETY: When `deflateGetDictionary` returns `Z_OK`, it holds that: 1325753dece8SMiguel Ojeda /// // 1. `dict_length` elements were initialized. 1326753dece8SMiguel Ojeda /// // 2. `dict_length` <= the capacity (32_768) 1327753dece8SMiguel Ojeda /// // which makes `set_len` safe to call. 1328753dece8SMiguel Ojeda /// unsafe { 1329753dece8SMiguel Ojeda /// // Make the FFI call... 1330753dece8SMiguel Ojeda /// let r = deflateGetDictionary(self.strm, dict.as_mut_ptr(), &mut dict_length); 1331753dece8SMiguel Ojeda /// if r == Z_OK { 1332753dece8SMiguel Ojeda /// // ...and update the length to what was initialized. 1333753dece8SMiguel Ojeda /// dict.set_len(dict_length); 1334753dece8SMiguel Ojeda /// Some(dict) 1335753dece8SMiguel Ojeda /// } else { 1336753dece8SMiguel Ojeda /// None 1337753dece8SMiguel Ojeda /// } 1338753dece8SMiguel Ojeda /// } 1339753dece8SMiguel Ojeda /// } 1340753dece8SMiguel Ojeda /// # } 1341753dece8SMiguel Ojeda /// ``` 1342753dece8SMiguel Ojeda /// 1343753dece8SMiguel Ojeda /// While the following example is sound, there is a memory leak since 1344753dece8SMiguel Ojeda /// the inner vectors were not freed prior to the `set_len` call: 1345753dece8SMiguel Ojeda /// 1346753dece8SMiguel Ojeda /// ``` 1347753dece8SMiguel Ojeda /// let mut vec = vec![vec![1, 0, 0], 1348753dece8SMiguel Ojeda /// vec![0, 1, 0], 1349753dece8SMiguel Ojeda /// vec![0, 0, 1]]; 1350753dece8SMiguel Ojeda /// // SAFETY: 1351753dece8SMiguel Ojeda /// // 1. `old_len..0` is empty so no elements need to be initialized. 1352753dece8SMiguel Ojeda /// // 2. `0 <= capacity` always holds whatever `capacity` is. 1353753dece8SMiguel Ojeda /// unsafe { 1354753dece8SMiguel Ojeda /// vec.set_len(0); 1355753dece8SMiguel Ojeda /// } 1356753dece8SMiguel Ojeda /// ``` 1357753dece8SMiguel Ojeda /// 1358753dece8SMiguel Ojeda /// Normally, here, one would use [`clear`] instead to correctly drop 1359753dece8SMiguel Ojeda /// the contents and thus not leak memory. 1360753dece8SMiguel Ojeda #[inline] 1361753dece8SMiguel Ojeda #[stable(feature = "rust1", since = "1.0.0")] 1362753dece8SMiguel Ojeda pub unsafe fn set_len(&mut self, new_len: usize) { 1363753dece8SMiguel Ojeda debug_assert!(new_len <= self.capacity()); 1364753dece8SMiguel Ojeda 1365753dece8SMiguel Ojeda self.len = new_len; 1366753dece8SMiguel Ojeda } 1367753dece8SMiguel Ojeda 1368753dece8SMiguel Ojeda /// Removes an element from the vector and returns it. 1369753dece8SMiguel Ojeda /// 1370753dece8SMiguel Ojeda /// The removed element is replaced by the last element of the vector. 1371753dece8SMiguel Ojeda /// 1372753dece8SMiguel Ojeda /// This does not preserve ordering, but is *O*(1). 1373753dece8SMiguel Ojeda /// If you need to preserve the element order, use [`remove`] instead. 1374753dece8SMiguel Ojeda /// 1375753dece8SMiguel Ojeda /// [`remove`]: Vec::remove 1376753dece8SMiguel Ojeda /// 1377753dece8SMiguel Ojeda /// # Panics 1378753dece8SMiguel Ojeda /// 1379753dece8SMiguel Ojeda /// Panics if `index` is out of bounds. 1380753dece8SMiguel Ojeda /// 1381753dece8SMiguel Ojeda /// # Examples 1382753dece8SMiguel Ojeda /// 1383753dece8SMiguel Ojeda /// ``` 1384753dece8SMiguel Ojeda /// let mut v = vec!["foo", "bar", "baz", "qux"]; 1385753dece8SMiguel Ojeda /// 1386753dece8SMiguel Ojeda /// assert_eq!(v.swap_remove(1), "bar"); 1387753dece8SMiguel Ojeda /// assert_eq!(v, ["foo", "qux", "baz"]); 1388753dece8SMiguel Ojeda /// 1389753dece8SMiguel Ojeda /// assert_eq!(v.swap_remove(0), "foo"); 1390753dece8SMiguel Ojeda /// assert_eq!(v, ["baz", "qux"]); 1391753dece8SMiguel Ojeda /// ``` 1392753dece8SMiguel Ojeda #[inline] 1393753dece8SMiguel Ojeda #[stable(feature = "rust1", since = "1.0.0")] 1394753dece8SMiguel Ojeda pub fn swap_remove(&mut self, index: usize) -> T { 1395753dece8SMiguel Ojeda #[cold] 1396753dece8SMiguel Ojeda #[inline(never)] 1397753dece8SMiguel Ojeda fn assert_failed(index: usize, len: usize) -> ! { 1398753dece8SMiguel Ojeda panic!("swap_remove index (is {index}) should be < len (is {len})"); 1399753dece8SMiguel Ojeda } 1400753dece8SMiguel Ojeda 1401753dece8SMiguel Ojeda let len = self.len(); 1402753dece8SMiguel Ojeda if index >= len { 1403753dece8SMiguel Ojeda assert_failed(index, len); 1404753dece8SMiguel Ojeda } 1405753dece8SMiguel Ojeda unsafe { 1406753dece8SMiguel Ojeda // We replace self[index] with the last element. Note that if the 1407753dece8SMiguel Ojeda // bounds check above succeeds there must be a last element (which 1408753dece8SMiguel Ojeda // can be self[index] itself). 1409753dece8SMiguel Ojeda let value = ptr::read(self.as_ptr().add(index)); 1410753dece8SMiguel Ojeda let base_ptr = self.as_mut_ptr(); 1411753dece8SMiguel Ojeda ptr::copy(base_ptr.add(len - 1), base_ptr.add(index), 1); 1412753dece8SMiguel Ojeda self.set_len(len - 1); 1413753dece8SMiguel Ojeda value 1414753dece8SMiguel Ojeda } 1415753dece8SMiguel Ojeda } 1416753dece8SMiguel Ojeda 1417753dece8SMiguel Ojeda /// Inserts an element at position `index` within the vector, shifting all 1418753dece8SMiguel Ojeda /// elements after it to the right. 1419753dece8SMiguel Ojeda /// 1420753dece8SMiguel Ojeda /// # Panics 1421753dece8SMiguel Ojeda /// 1422753dece8SMiguel Ojeda /// Panics if `index > len`. 1423753dece8SMiguel Ojeda /// 1424753dece8SMiguel Ojeda /// # Examples 1425753dece8SMiguel Ojeda /// 1426753dece8SMiguel Ojeda /// ``` 1427753dece8SMiguel Ojeda /// let mut vec = vec![1, 2, 3]; 1428753dece8SMiguel Ojeda /// vec.insert(1, 4); 1429753dece8SMiguel Ojeda /// assert_eq!(vec, [1, 4, 2, 3]); 1430753dece8SMiguel Ojeda /// vec.insert(4, 5); 1431753dece8SMiguel Ojeda /// assert_eq!(vec, [1, 4, 2, 3, 5]); 1432753dece8SMiguel Ojeda /// ``` 1433753dece8SMiguel Ojeda #[cfg(not(no_global_oom_handling))] 1434753dece8SMiguel Ojeda #[stable(feature = "rust1", since = "1.0.0")] 1435753dece8SMiguel Ojeda pub fn insert(&mut self, index: usize, element: T) { 1436753dece8SMiguel Ojeda #[cold] 1437753dece8SMiguel Ojeda #[inline(never)] 1438753dece8SMiguel Ojeda fn assert_failed(index: usize, len: usize) -> ! { 1439753dece8SMiguel Ojeda panic!("insertion index (is {index}) should be <= len (is {len})"); 1440753dece8SMiguel Ojeda } 1441753dece8SMiguel Ojeda 1442753dece8SMiguel Ojeda let len = self.len(); 1443753dece8SMiguel Ojeda if index > len { 1444753dece8SMiguel Ojeda assert_failed(index, len); 1445753dece8SMiguel Ojeda } 1446753dece8SMiguel Ojeda 1447753dece8SMiguel Ojeda // space for the new element 1448753dece8SMiguel Ojeda if len == self.buf.capacity() { 1449753dece8SMiguel Ojeda self.reserve(1); 1450753dece8SMiguel Ojeda } 1451753dece8SMiguel Ojeda 1452753dece8SMiguel Ojeda unsafe { 1453753dece8SMiguel Ojeda // infallible 1454753dece8SMiguel Ojeda // The spot to put the new value 1455753dece8SMiguel Ojeda { 1456753dece8SMiguel Ojeda let p = self.as_mut_ptr().add(index); 1457753dece8SMiguel Ojeda // Shift everything over to make space. (Duplicating the 1458753dece8SMiguel Ojeda // `index`th element into two consecutive places.) 1459753dece8SMiguel Ojeda ptr::copy(p, p.offset(1), len - index); 1460753dece8SMiguel Ojeda // Write it in, overwriting the first copy of the `index`th 1461753dece8SMiguel Ojeda // element. 1462753dece8SMiguel Ojeda ptr::write(p, element); 1463753dece8SMiguel Ojeda } 1464753dece8SMiguel Ojeda self.set_len(len + 1); 1465753dece8SMiguel Ojeda } 1466753dece8SMiguel Ojeda } 1467753dece8SMiguel Ojeda 1468753dece8SMiguel Ojeda /// Removes and returns the element at position `index` within the vector, 1469753dece8SMiguel Ojeda /// shifting all elements after it to the left. 1470753dece8SMiguel Ojeda /// 1471753dece8SMiguel Ojeda /// Note: Because this shifts over the remaining elements, it has a 1472753dece8SMiguel Ojeda /// worst-case performance of *O*(*n*). If you don't need the order of elements 1473753dece8SMiguel Ojeda /// to be preserved, use [`swap_remove`] instead. If you'd like to remove 1474753dece8SMiguel Ojeda /// elements from the beginning of the `Vec`, consider using 1475753dece8SMiguel Ojeda /// [`VecDeque::pop_front`] instead. 1476753dece8SMiguel Ojeda /// 1477753dece8SMiguel Ojeda /// [`swap_remove`]: Vec::swap_remove 1478753dece8SMiguel Ojeda /// [`VecDeque::pop_front`]: crate::collections::VecDeque::pop_front 1479753dece8SMiguel Ojeda /// 1480753dece8SMiguel Ojeda /// # Panics 1481753dece8SMiguel Ojeda /// 1482753dece8SMiguel Ojeda /// Panics if `index` is out of bounds. 1483753dece8SMiguel Ojeda /// 1484753dece8SMiguel Ojeda /// # Examples 1485753dece8SMiguel Ojeda /// 1486753dece8SMiguel Ojeda /// ``` 1487753dece8SMiguel Ojeda /// let mut v = vec![1, 2, 3]; 1488753dece8SMiguel Ojeda /// assert_eq!(v.remove(1), 2); 1489753dece8SMiguel Ojeda /// assert_eq!(v, [1, 3]); 1490753dece8SMiguel Ojeda /// ``` 1491753dece8SMiguel Ojeda #[stable(feature = "rust1", since = "1.0.0")] 1492753dece8SMiguel Ojeda #[track_caller] 1493753dece8SMiguel Ojeda pub fn remove(&mut self, index: usize) -> T { 1494753dece8SMiguel Ojeda #[cold] 1495753dece8SMiguel Ojeda #[inline(never)] 1496753dece8SMiguel Ojeda #[track_caller] 1497753dece8SMiguel Ojeda fn assert_failed(index: usize, len: usize) -> ! { 1498753dece8SMiguel Ojeda panic!("removal index (is {index}) should be < len (is {len})"); 1499753dece8SMiguel Ojeda } 1500753dece8SMiguel Ojeda 1501753dece8SMiguel Ojeda let len = self.len(); 1502753dece8SMiguel Ojeda if index >= len { 1503753dece8SMiguel Ojeda assert_failed(index, len); 1504753dece8SMiguel Ojeda } 1505753dece8SMiguel Ojeda unsafe { 1506753dece8SMiguel Ojeda // infallible 1507753dece8SMiguel Ojeda let ret; 1508753dece8SMiguel Ojeda { 1509753dece8SMiguel Ojeda // the place we are taking from. 1510753dece8SMiguel Ojeda let ptr = self.as_mut_ptr().add(index); 1511753dece8SMiguel Ojeda // copy it out, unsafely having a copy of the value on 1512753dece8SMiguel Ojeda // the stack and in the vector at the same time. 1513753dece8SMiguel Ojeda ret = ptr::read(ptr); 1514753dece8SMiguel Ojeda 1515753dece8SMiguel Ojeda // Shift everything down to fill in that spot. 1516753dece8SMiguel Ojeda ptr::copy(ptr.offset(1), ptr, len - index - 1); 1517753dece8SMiguel Ojeda } 1518753dece8SMiguel Ojeda self.set_len(len - 1); 1519753dece8SMiguel Ojeda ret 1520753dece8SMiguel Ojeda } 1521753dece8SMiguel Ojeda } 1522753dece8SMiguel Ojeda 1523753dece8SMiguel Ojeda /// Retains only the elements specified by the predicate. 1524753dece8SMiguel Ojeda /// 1525753dece8SMiguel Ojeda /// In other words, remove all elements `e` for which `f(&e)` returns `false`. 1526753dece8SMiguel Ojeda /// This method operates in place, visiting each element exactly once in the 1527753dece8SMiguel Ojeda /// original order, and preserves the order of the retained elements. 1528753dece8SMiguel Ojeda /// 1529753dece8SMiguel Ojeda /// # Examples 1530753dece8SMiguel Ojeda /// 1531753dece8SMiguel Ojeda /// ``` 1532753dece8SMiguel Ojeda /// let mut vec = vec![1, 2, 3, 4]; 1533753dece8SMiguel Ojeda /// vec.retain(|&x| x % 2 == 0); 1534753dece8SMiguel Ojeda /// assert_eq!(vec, [2, 4]); 1535753dece8SMiguel Ojeda /// ``` 1536753dece8SMiguel Ojeda /// 1537753dece8SMiguel Ojeda /// Because the elements are visited exactly once in the original order, 1538753dece8SMiguel Ojeda /// external state may be used to decide which elements to keep. 1539753dece8SMiguel Ojeda /// 1540753dece8SMiguel Ojeda /// ``` 1541753dece8SMiguel Ojeda /// let mut vec = vec![1, 2, 3, 4, 5]; 1542753dece8SMiguel Ojeda /// let keep = [false, true, true, false, true]; 1543753dece8SMiguel Ojeda /// let mut iter = keep.iter(); 1544753dece8SMiguel Ojeda /// vec.retain(|_| *iter.next().unwrap()); 1545753dece8SMiguel Ojeda /// assert_eq!(vec, [2, 3, 5]); 1546753dece8SMiguel Ojeda /// ``` 1547753dece8SMiguel Ojeda #[stable(feature = "rust1", since = "1.0.0")] 1548753dece8SMiguel Ojeda pub fn retain<F>(&mut self, mut f: F) 1549753dece8SMiguel Ojeda where 1550753dece8SMiguel Ojeda F: FnMut(&T) -> bool, 1551753dece8SMiguel Ojeda { 1552753dece8SMiguel Ojeda self.retain_mut(|elem| f(elem)); 1553753dece8SMiguel Ojeda } 1554753dece8SMiguel Ojeda 1555753dece8SMiguel Ojeda /// Retains only the elements specified by the predicate, passing a mutable reference to it. 1556753dece8SMiguel Ojeda /// 1557753dece8SMiguel Ojeda /// In other words, remove all elements `e` such that `f(&mut e)` returns `false`. 1558753dece8SMiguel Ojeda /// This method operates in place, visiting each element exactly once in the 1559753dece8SMiguel Ojeda /// original order, and preserves the order of the retained elements. 1560753dece8SMiguel Ojeda /// 1561753dece8SMiguel Ojeda /// # Examples 1562753dece8SMiguel Ojeda /// 1563753dece8SMiguel Ojeda /// ``` 1564753dece8SMiguel Ojeda /// let mut vec = vec![1, 2, 3, 4]; 1565753dece8SMiguel Ojeda /// vec.retain_mut(|x| if *x > 3 { 1566753dece8SMiguel Ojeda /// false 1567753dece8SMiguel Ojeda /// } else { 1568753dece8SMiguel Ojeda /// *x += 1; 1569753dece8SMiguel Ojeda /// true 1570753dece8SMiguel Ojeda /// }); 1571753dece8SMiguel Ojeda /// assert_eq!(vec, [2, 3, 4]); 1572753dece8SMiguel Ojeda /// ``` 1573753dece8SMiguel Ojeda #[stable(feature = "vec_retain_mut", since = "1.61.0")] 1574753dece8SMiguel Ojeda pub fn retain_mut<F>(&mut self, mut f: F) 1575753dece8SMiguel Ojeda where 1576753dece8SMiguel Ojeda F: FnMut(&mut T) -> bool, 1577753dece8SMiguel Ojeda { 1578753dece8SMiguel Ojeda let original_len = self.len(); 1579753dece8SMiguel Ojeda // Avoid double drop if the drop guard is not executed, 1580753dece8SMiguel Ojeda // since we may make some holes during the process. 1581753dece8SMiguel Ojeda unsafe { self.set_len(0) }; 1582753dece8SMiguel Ojeda 1583753dece8SMiguel Ojeda // Vec: [Kept, Kept, Hole, Hole, Hole, Hole, Unchecked, Unchecked] 1584753dece8SMiguel Ojeda // |<- processed len ->| ^- next to check 1585753dece8SMiguel Ojeda // |<- deleted cnt ->| 1586753dece8SMiguel Ojeda // |<- original_len ->| 1587753dece8SMiguel Ojeda // Kept: Elements which predicate returns true on. 1588753dece8SMiguel Ojeda // Hole: Moved or dropped element slot. 1589753dece8SMiguel Ojeda // Unchecked: Unchecked valid elements. 1590753dece8SMiguel Ojeda // 1591753dece8SMiguel Ojeda // This drop guard will be invoked when predicate or `drop` of element panicked. 1592753dece8SMiguel Ojeda // It shifts unchecked elements to cover holes and `set_len` to the correct length. 1593753dece8SMiguel Ojeda // In cases when predicate and `drop` never panick, it will be optimized out. 1594753dece8SMiguel Ojeda struct BackshiftOnDrop<'a, T, A: Allocator> { 1595753dece8SMiguel Ojeda v: &'a mut Vec<T, A>, 1596753dece8SMiguel Ojeda processed_len: usize, 1597753dece8SMiguel Ojeda deleted_cnt: usize, 1598753dece8SMiguel Ojeda original_len: usize, 1599753dece8SMiguel Ojeda } 1600753dece8SMiguel Ojeda 1601753dece8SMiguel Ojeda impl<T, A: Allocator> Drop for BackshiftOnDrop<'_, T, A> { 1602753dece8SMiguel Ojeda fn drop(&mut self) { 1603753dece8SMiguel Ojeda if self.deleted_cnt > 0 { 1604753dece8SMiguel Ojeda // SAFETY: Trailing unchecked items must be valid since we never touch them. 1605753dece8SMiguel Ojeda unsafe { 1606753dece8SMiguel Ojeda ptr::copy( 1607753dece8SMiguel Ojeda self.v.as_ptr().add(self.processed_len), 1608753dece8SMiguel Ojeda self.v.as_mut_ptr().add(self.processed_len - self.deleted_cnt), 1609753dece8SMiguel Ojeda self.original_len - self.processed_len, 1610753dece8SMiguel Ojeda ); 1611753dece8SMiguel Ojeda } 1612753dece8SMiguel Ojeda } 1613753dece8SMiguel Ojeda // SAFETY: After filling holes, all items are in contiguous memory. 1614753dece8SMiguel Ojeda unsafe { 1615753dece8SMiguel Ojeda self.v.set_len(self.original_len - self.deleted_cnt); 1616753dece8SMiguel Ojeda } 1617753dece8SMiguel Ojeda } 1618753dece8SMiguel Ojeda } 1619753dece8SMiguel Ojeda 1620753dece8SMiguel Ojeda let mut g = BackshiftOnDrop { v: self, processed_len: 0, deleted_cnt: 0, original_len }; 1621753dece8SMiguel Ojeda 1622753dece8SMiguel Ojeda fn process_loop<F, T, A: Allocator, const DELETED: bool>( 1623753dece8SMiguel Ojeda original_len: usize, 1624753dece8SMiguel Ojeda f: &mut F, 1625753dece8SMiguel Ojeda g: &mut BackshiftOnDrop<'_, T, A>, 1626753dece8SMiguel Ojeda ) where 1627753dece8SMiguel Ojeda F: FnMut(&mut T) -> bool, 1628753dece8SMiguel Ojeda { 1629753dece8SMiguel Ojeda while g.processed_len != original_len { 1630753dece8SMiguel Ojeda // SAFETY: Unchecked element must be valid. 1631753dece8SMiguel Ojeda let cur = unsafe { &mut *g.v.as_mut_ptr().add(g.processed_len) }; 1632753dece8SMiguel Ojeda if !f(cur) { 1633753dece8SMiguel Ojeda // Advance early to avoid double drop if `drop_in_place` panicked. 1634753dece8SMiguel Ojeda g.processed_len += 1; 1635753dece8SMiguel Ojeda g.deleted_cnt += 1; 1636753dece8SMiguel Ojeda // SAFETY: We never touch this element again after dropped. 1637753dece8SMiguel Ojeda unsafe { ptr::drop_in_place(cur) }; 1638753dece8SMiguel Ojeda // We already advanced the counter. 1639753dece8SMiguel Ojeda if DELETED { 1640753dece8SMiguel Ojeda continue; 1641753dece8SMiguel Ojeda } else { 1642753dece8SMiguel Ojeda break; 1643753dece8SMiguel Ojeda } 1644753dece8SMiguel Ojeda } 1645753dece8SMiguel Ojeda if DELETED { 1646753dece8SMiguel Ojeda // SAFETY: `deleted_cnt` > 0, so the hole slot must not overlap with current element. 1647753dece8SMiguel Ojeda // We use copy for move, and never touch this element again. 1648753dece8SMiguel Ojeda unsafe { 1649753dece8SMiguel Ojeda let hole_slot = g.v.as_mut_ptr().add(g.processed_len - g.deleted_cnt); 1650753dece8SMiguel Ojeda ptr::copy_nonoverlapping(cur, hole_slot, 1); 1651753dece8SMiguel Ojeda } 1652753dece8SMiguel Ojeda } 1653753dece8SMiguel Ojeda g.processed_len += 1; 1654753dece8SMiguel Ojeda } 1655753dece8SMiguel Ojeda } 1656753dece8SMiguel Ojeda 1657753dece8SMiguel Ojeda // Stage 1: Nothing was deleted. 1658753dece8SMiguel Ojeda process_loop::<F, T, A, false>(original_len, &mut f, &mut g); 1659753dece8SMiguel Ojeda 1660753dece8SMiguel Ojeda // Stage 2: Some elements were deleted. 1661753dece8SMiguel Ojeda process_loop::<F, T, A, true>(original_len, &mut f, &mut g); 1662753dece8SMiguel Ojeda 1663753dece8SMiguel Ojeda // All item are processed. This can be optimized to `set_len` by LLVM. 1664753dece8SMiguel Ojeda drop(g); 1665753dece8SMiguel Ojeda } 1666753dece8SMiguel Ojeda 1667753dece8SMiguel Ojeda /// Removes all but the first of consecutive elements in the vector that resolve to the same 1668753dece8SMiguel Ojeda /// key. 1669753dece8SMiguel Ojeda /// 1670753dece8SMiguel Ojeda /// If the vector is sorted, this removes all duplicates. 1671753dece8SMiguel Ojeda /// 1672753dece8SMiguel Ojeda /// # Examples 1673753dece8SMiguel Ojeda /// 1674753dece8SMiguel Ojeda /// ``` 1675753dece8SMiguel Ojeda /// let mut vec = vec![10, 20, 21, 30, 20]; 1676753dece8SMiguel Ojeda /// 1677753dece8SMiguel Ojeda /// vec.dedup_by_key(|i| *i / 10); 1678753dece8SMiguel Ojeda /// 1679753dece8SMiguel Ojeda /// assert_eq!(vec, [10, 20, 30, 20]); 1680753dece8SMiguel Ojeda /// ``` 1681753dece8SMiguel Ojeda #[stable(feature = "dedup_by", since = "1.16.0")] 1682753dece8SMiguel Ojeda #[inline] 1683753dece8SMiguel Ojeda pub fn dedup_by_key<F, K>(&mut self, mut key: F) 1684753dece8SMiguel Ojeda where 1685753dece8SMiguel Ojeda F: FnMut(&mut T) -> K, 1686753dece8SMiguel Ojeda K: PartialEq, 1687753dece8SMiguel Ojeda { 1688753dece8SMiguel Ojeda self.dedup_by(|a, b| key(a) == key(b)) 1689753dece8SMiguel Ojeda } 1690753dece8SMiguel Ojeda 1691753dece8SMiguel Ojeda /// Removes all but the first of consecutive elements in the vector satisfying a given equality 1692753dece8SMiguel Ojeda /// relation. 1693753dece8SMiguel Ojeda /// 1694753dece8SMiguel Ojeda /// The `same_bucket` function is passed references to two elements from the vector and 1695753dece8SMiguel Ojeda /// must determine if the elements compare equal. The elements are passed in opposite order 1696753dece8SMiguel Ojeda /// from their order in the slice, so if `same_bucket(a, b)` returns `true`, `a` is removed. 1697753dece8SMiguel Ojeda /// 1698753dece8SMiguel Ojeda /// If the vector is sorted, this removes all duplicates. 1699753dece8SMiguel Ojeda /// 1700753dece8SMiguel Ojeda /// # Examples 1701753dece8SMiguel Ojeda /// 1702753dece8SMiguel Ojeda /// ``` 1703753dece8SMiguel Ojeda /// let mut vec = vec!["foo", "bar", "Bar", "baz", "bar"]; 1704753dece8SMiguel Ojeda /// 1705753dece8SMiguel Ojeda /// vec.dedup_by(|a, b| a.eq_ignore_ascii_case(b)); 1706753dece8SMiguel Ojeda /// 1707753dece8SMiguel Ojeda /// assert_eq!(vec, ["foo", "bar", "baz", "bar"]); 1708753dece8SMiguel Ojeda /// ``` 1709753dece8SMiguel Ojeda #[stable(feature = "dedup_by", since = "1.16.0")] 1710753dece8SMiguel Ojeda pub fn dedup_by<F>(&mut self, mut same_bucket: F) 1711753dece8SMiguel Ojeda where 1712753dece8SMiguel Ojeda F: FnMut(&mut T, &mut T) -> bool, 1713753dece8SMiguel Ojeda { 1714753dece8SMiguel Ojeda let len = self.len(); 1715753dece8SMiguel Ojeda if len <= 1 { 1716753dece8SMiguel Ojeda return; 1717753dece8SMiguel Ojeda } 1718753dece8SMiguel Ojeda 1719753dece8SMiguel Ojeda /* INVARIANT: vec.len() > read >= write > write-1 >= 0 */ 1720753dece8SMiguel Ojeda struct FillGapOnDrop<'a, T, A: core::alloc::Allocator> { 1721753dece8SMiguel Ojeda /* Offset of the element we want to check if it is duplicate */ 1722753dece8SMiguel Ojeda read: usize, 1723753dece8SMiguel Ojeda 1724753dece8SMiguel Ojeda /* Offset of the place where we want to place the non-duplicate 1725753dece8SMiguel Ojeda * when we find it. */ 1726753dece8SMiguel Ojeda write: usize, 1727753dece8SMiguel Ojeda 1728753dece8SMiguel Ojeda /* The Vec that would need correction if `same_bucket` panicked */ 1729753dece8SMiguel Ojeda vec: &'a mut Vec<T, A>, 1730753dece8SMiguel Ojeda } 1731753dece8SMiguel Ojeda 1732753dece8SMiguel Ojeda impl<'a, T, A: core::alloc::Allocator> Drop for FillGapOnDrop<'a, T, A> { 1733753dece8SMiguel Ojeda fn drop(&mut self) { 1734753dece8SMiguel Ojeda /* This code gets executed when `same_bucket` panics */ 1735753dece8SMiguel Ojeda 1736753dece8SMiguel Ojeda /* SAFETY: invariant guarantees that `read - write` 1737753dece8SMiguel Ojeda * and `len - read` never overflow and that the copy is always 1738753dece8SMiguel Ojeda * in-bounds. */ 1739753dece8SMiguel Ojeda unsafe { 1740753dece8SMiguel Ojeda let ptr = self.vec.as_mut_ptr(); 1741753dece8SMiguel Ojeda let len = self.vec.len(); 1742753dece8SMiguel Ojeda 1743753dece8SMiguel Ojeda /* How many items were left when `same_bucket` panicked. 1744753dece8SMiguel Ojeda * Basically vec[read..].len() */ 1745753dece8SMiguel Ojeda let items_left = len.wrapping_sub(self.read); 1746753dece8SMiguel Ojeda 1747753dece8SMiguel Ojeda /* Pointer to first item in vec[write..write+items_left] slice */ 1748753dece8SMiguel Ojeda let dropped_ptr = ptr.add(self.write); 1749753dece8SMiguel Ojeda /* Pointer to first item in vec[read..] slice */ 1750753dece8SMiguel Ojeda let valid_ptr = ptr.add(self.read); 1751753dece8SMiguel Ojeda 1752753dece8SMiguel Ojeda /* Copy `vec[read..]` to `vec[write..write+items_left]`. 1753753dece8SMiguel Ojeda * The slices can overlap, so `copy_nonoverlapping` cannot be used */ 1754753dece8SMiguel Ojeda ptr::copy(valid_ptr, dropped_ptr, items_left); 1755753dece8SMiguel Ojeda 1756753dece8SMiguel Ojeda /* How many items have been already dropped 1757753dece8SMiguel Ojeda * Basically vec[read..write].len() */ 1758753dece8SMiguel Ojeda let dropped = self.read.wrapping_sub(self.write); 1759753dece8SMiguel Ojeda 1760753dece8SMiguel Ojeda self.vec.set_len(len - dropped); 1761753dece8SMiguel Ojeda } 1762753dece8SMiguel Ojeda } 1763753dece8SMiguel Ojeda } 1764753dece8SMiguel Ojeda 1765753dece8SMiguel Ojeda let mut gap = FillGapOnDrop { read: 1, write: 1, vec: self }; 1766753dece8SMiguel Ojeda let ptr = gap.vec.as_mut_ptr(); 1767753dece8SMiguel Ojeda 1768753dece8SMiguel Ojeda /* Drop items while going through Vec, it should be more efficient than 1769753dece8SMiguel Ojeda * doing slice partition_dedup + truncate */ 1770753dece8SMiguel Ojeda 1771753dece8SMiguel Ojeda /* SAFETY: Because of the invariant, read_ptr, prev_ptr and write_ptr 1772753dece8SMiguel Ojeda * are always in-bounds and read_ptr never aliases prev_ptr */ 1773753dece8SMiguel Ojeda unsafe { 1774753dece8SMiguel Ojeda while gap.read < len { 1775753dece8SMiguel Ojeda let read_ptr = ptr.add(gap.read); 1776753dece8SMiguel Ojeda let prev_ptr = ptr.add(gap.write.wrapping_sub(1)); 1777753dece8SMiguel Ojeda 1778753dece8SMiguel Ojeda if same_bucket(&mut *read_ptr, &mut *prev_ptr) { 1779753dece8SMiguel Ojeda // Increase `gap.read` now since the drop may panic. 1780753dece8SMiguel Ojeda gap.read += 1; 1781753dece8SMiguel Ojeda /* We have found duplicate, drop it in-place */ 1782753dece8SMiguel Ojeda ptr::drop_in_place(read_ptr); 1783753dece8SMiguel Ojeda } else { 1784753dece8SMiguel Ojeda let write_ptr = ptr.add(gap.write); 1785753dece8SMiguel Ojeda 1786753dece8SMiguel Ojeda /* Because `read_ptr` can be equal to `write_ptr`, we either 1787753dece8SMiguel Ojeda * have to use `copy` or conditional `copy_nonoverlapping`. 1788753dece8SMiguel Ojeda * Looks like the first option is faster. */ 1789753dece8SMiguel Ojeda ptr::copy(read_ptr, write_ptr, 1); 1790753dece8SMiguel Ojeda 1791753dece8SMiguel Ojeda /* We have filled that place, so go further */ 1792753dece8SMiguel Ojeda gap.write += 1; 1793753dece8SMiguel Ojeda gap.read += 1; 1794753dece8SMiguel Ojeda } 1795753dece8SMiguel Ojeda } 1796753dece8SMiguel Ojeda 1797753dece8SMiguel Ojeda /* Technically we could let `gap` clean up with its Drop, but 1798753dece8SMiguel Ojeda * when `same_bucket` is guaranteed to not panic, this bloats a little 1799753dece8SMiguel Ojeda * the codegen, so we just do it manually */ 1800753dece8SMiguel Ojeda gap.vec.set_len(gap.write); 1801753dece8SMiguel Ojeda mem::forget(gap); 1802753dece8SMiguel Ojeda } 1803753dece8SMiguel Ojeda } 1804753dece8SMiguel Ojeda 1805753dece8SMiguel Ojeda /// Appends an element to the back of a collection. 1806753dece8SMiguel Ojeda /// 1807753dece8SMiguel Ojeda /// # Panics 1808753dece8SMiguel Ojeda /// 1809753dece8SMiguel Ojeda /// Panics if the new capacity exceeds `isize::MAX` bytes. 1810753dece8SMiguel Ojeda /// 1811753dece8SMiguel Ojeda /// # Examples 1812753dece8SMiguel Ojeda /// 1813753dece8SMiguel Ojeda /// ``` 1814753dece8SMiguel Ojeda /// let mut vec = vec![1, 2]; 1815753dece8SMiguel Ojeda /// vec.push(3); 1816753dece8SMiguel Ojeda /// assert_eq!(vec, [1, 2, 3]); 1817753dece8SMiguel Ojeda /// ``` 1818753dece8SMiguel Ojeda #[cfg(not(no_global_oom_handling))] 1819753dece8SMiguel Ojeda #[inline] 1820753dece8SMiguel Ojeda #[stable(feature = "rust1", since = "1.0.0")] 1821753dece8SMiguel Ojeda pub fn push(&mut self, value: T) { 1822753dece8SMiguel Ojeda // This will panic or abort if we would allocate > isize::MAX bytes 1823753dece8SMiguel Ojeda // or if the length increment would overflow for zero-sized types. 1824753dece8SMiguel Ojeda if self.len == self.buf.capacity() { 1825753dece8SMiguel Ojeda self.buf.reserve_for_push(self.len); 1826753dece8SMiguel Ojeda } 1827753dece8SMiguel Ojeda unsafe { 1828753dece8SMiguel Ojeda let end = self.as_mut_ptr().add(self.len); 1829753dece8SMiguel Ojeda ptr::write(end, value); 1830753dece8SMiguel Ojeda self.len += 1; 1831753dece8SMiguel Ojeda } 1832753dece8SMiguel Ojeda } 1833753dece8SMiguel Ojeda 1834057b8d25SMiguel Ojeda /// Tries to append an element to the back of a collection. 1835057b8d25SMiguel Ojeda /// 1836057b8d25SMiguel Ojeda /// # Examples 1837057b8d25SMiguel Ojeda /// 1838057b8d25SMiguel Ojeda /// ``` 1839057b8d25SMiguel Ojeda /// let mut vec = vec![1, 2]; 1840057b8d25SMiguel Ojeda /// vec.try_push(3).unwrap(); 1841057b8d25SMiguel Ojeda /// assert_eq!(vec, [1, 2, 3]); 1842057b8d25SMiguel Ojeda /// ``` 1843057b8d25SMiguel Ojeda #[inline] 1844057b8d25SMiguel Ojeda #[stable(feature = "kernel", since = "1.0.0")] 1845057b8d25SMiguel Ojeda pub fn try_push(&mut self, value: T) -> Result<(), TryReserveError> { 1846057b8d25SMiguel Ojeda if self.len == self.buf.capacity() { 1847057b8d25SMiguel Ojeda self.buf.try_reserve_for_push(self.len)?; 1848057b8d25SMiguel Ojeda } 1849057b8d25SMiguel Ojeda unsafe { 1850057b8d25SMiguel Ojeda let end = self.as_mut_ptr().add(self.len); 1851057b8d25SMiguel Ojeda ptr::write(end, value); 1852057b8d25SMiguel Ojeda self.len += 1; 1853057b8d25SMiguel Ojeda } 1854057b8d25SMiguel Ojeda Ok(()) 1855057b8d25SMiguel Ojeda } 1856057b8d25SMiguel Ojeda 1857753dece8SMiguel Ojeda /// Removes the last element from a vector and returns it, or [`None`] if it 1858753dece8SMiguel Ojeda /// is empty. 1859753dece8SMiguel Ojeda /// 1860753dece8SMiguel Ojeda /// If you'd like to pop the first element, consider using 1861753dece8SMiguel Ojeda /// [`VecDeque::pop_front`] instead. 1862753dece8SMiguel Ojeda /// 1863753dece8SMiguel Ojeda /// [`VecDeque::pop_front`]: crate::collections::VecDeque::pop_front 1864753dece8SMiguel Ojeda /// 1865753dece8SMiguel Ojeda /// # Examples 1866753dece8SMiguel Ojeda /// 1867753dece8SMiguel Ojeda /// ``` 1868753dece8SMiguel Ojeda /// let mut vec = vec![1, 2, 3]; 1869753dece8SMiguel Ojeda /// assert_eq!(vec.pop(), Some(3)); 1870753dece8SMiguel Ojeda /// assert_eq!(vec, [1, 2]); 1871753dece8SMiguel Ojeda /// ``` 1872753dece8SMiguel Ojeda #[inline] 1873753dece8SMiguel Ojeda #[stable(feature = "rust1", since = "1.0.0")] 1874753dece8SMiguel Ojeda pub fn pop(&mut self) -> Option<T> { 1875753dece8SMiguel Ojeda if self.len == 0 { 1876753dece8SMiguel Ojeda None 1877753dece8SMiguel Ojeda } else { 1878753dece8SMiguel Ojeda unsafe { 1879753dece8SMiguel Ojeda self.len -= 1; 1880753dece8SMiguel Ojeda Some(ptr::read(self.as_ptr().add(self.len()))) 1881753dece8SMiguel Ojeda } 1882753dece8SMiguel Ojeda } 1883753dece8SMiguel Ojeda } 1884753dece8SMiguel Ojeda 1885753dece8SMiguel Ojeda /// Moves all the elements of `other` into `self`, leaving `other` empty. 1886753dece8SMiguel Ojeda /// 1887753dece8SMiguel Ojeda /// # Panics 1888753dece8SMiguel Ojeda /// 1889753dece8SMiguel Ojeda /// Panics if the number of elements in the vector overflows a `usize`. 1890753dece8SMiguel Ojeda /// 1891753dece8SMiguel Ojeda /// # Examples 1892753dece8SMiguel Ojeda /// 1893753dece8SMiguel Ojeda /// ``` 1894753dece8SMiguel Ojeda /// let mut vec = vec![1, 2, 3]; 1895753dece8SMiguel Ojeda /// let mut vec2 = vec![4, 5, 6]; 1896753dece8SMiguel Ojeda /// vec.append(&mut vec2); 1897753dece8SMiguel Ojeda /// assert_eq!(vec, [1, 2, 3, 4, 5, 6]); 1898753dece8SMiguel Ojeda /// assert_eq!(vec2, []); 1899753dece8SMiguel Ojeda /// ``` 1900753dece8SMiguel Ojeda #[cfg(not(no_global_oom_handling))] 1901753dece8SMiguel Ojeda #[inline] 1902753dece8SMiguel Ojeda #[stable(feature = "append", since = "1.4.0")] 1903753dece8SMiguel Ojeda pub fn append(&mut self, other: &mut Self) { 1904753dece8SMiguel Ojeda unsafe { 1905753dece8SMiguel Ojeda self.append_elements(other.as_slice() as _); 1906753dece8SMiguel Ojeda other.set_len(0); 1907753dece8SMiguel Ojeda } 1908753dece8SMiguel Ojeda } 1909753dece8SMiguel Ojeda 1910753dece8SMiguel Ojeda /// Appends elements to `self` from other buffer. 1911753dece8SMiguel Ojeda #[cfg(not(no_global_oom_handling))] 1912753dece8SMiguel Ojeda #[inline] 1913753dece8SMiguel Ojeda unsafe fn append_elements(&mut self, other: *const [T]) { 1914753dece8SMiguel Ojeda let count = unsafe { (*other).len() }; 1915753dece8SMiguel Ojeda self.reserve(count); 1916753dece8SMiguel Ojeda let len = self.len(); 1917753dece8SMiguel Ojeda unsafe { ptr::copy_nonoverlapping(other as *const T, self.as_mut_ptr().add(len), count) }; 1918753dece8SMiguel Ojeda self.len += count; 1919753dece8SMiguel Ojeda } 1920753dece8SMiguel Ojeda 1921*318c3cc8SMiguel Ojeda /// Tries to append elements to `self` from other buffer. 1922*318c3cc8SMiguel Ojeda #[inline] 1923*318c3cc8SMiguel Ojeda unsafe fn try_append_elements(&mut self, other: *const [T]) -> Result<(), TryReserveError> { 1924*318c3cc8SMiguel Ojeda let count = unsafe { (*other).len() }; 1925*318c3cc8SMiguel Ojeda self.try_reserve(count)?; 1926*318c3cc8SMiguel Ojeda let len = self.len(); 1927*318c3cc8SMiguel Ojeda unsafe { ptr::copy_nonoverlapping(other as *const T, self.as_mut_ptr().add(len), count) }; 1928*318c3cc8SMiguel Ojeda self.len += count; 1929*318c3cc8SMiguel Ojeda Ok(()) 1930*318c3cc8SMiguel Ojeda } 1931*318c3cc8SMiguel Ojeda 1932753dece8SMiguel Ojeda /// Removes the specified range from the vector in bulk, returning all 1933753dece8SMiguel Ojeda /// removed elements as an iterator. If the iterator is dropped before 1934753dece8SMiguel Ojeda /// being fully consumed, it drops the remaining removed elements. 1935753dece8SMiguel Ojeda /// 1936753dece8SMiguel Ojeda /// The returned iterator keeps a mutable borrow on the vector to optimize 1937753dece8SMiguel Ojeda /// its implementation. 1938753dece8SMiguel Ojeda /// 1939753dece8SMiguel Ojeda /// # Panics 1940753dece8SMiguel Ojeda /// 1941753dece8SMiguel Ojeda /// Panics if the starting point is greater than the end point or if 1942753dece8SMiguel Ojeda /// the end point is greater than the length of the vector. 1943753dece8SMiguel Ojeda /// 1944753dece8SMiguel Ojeda /// # Leaking 1945753dece8SMiguel Ojeda /// 1946753dece8SMiguel Ojeda /// If the returned iterator goes out of scope without being dropped (due to 1947753dece8SMiguel Ojeda /// [`mem::forget`], for example), the vector may have lost and leaked 1948753dece8SMiguel Ojeda /// elements arbitrarily, including elements outside the range. 1949753dece8SMiguel Ojeda /// 1950753dece8SMiguel Ojeda /// # Examples 1951753dece8SMiguel Ojeda /// 1952753dece8SMiguel Ojeda /// ``` 1953753dece8SMiguel Ojeda /// let mut v = vec![1, 2, 3]; 1954753dece8SMiguel Ojeda /// let u: Vec<_> = v.drain(1..).collect(); 1955753dece8SMiguel Ojeda /// assert_eq!(v, &[1]); 1956753dece8SMiguel Ojeda /// assert_eq!(u, &[2, 3]); 1957753dece8SMiguel Ojeda /// 1958753dece8SMiguel Ojeda /// // A full range clears the vector, like `clear()` does 1959753dece8SMiguel Ojeda /// v.drain(..); 1960753dece8SMiguel Ojeda /// assert_eq!(v, &[]); 1961753dece8SMiguel Ojeda /// ``` 1962753dece8SMiguel Ojeda #[stable(feature = "drain", since = "1.6.0")] 1963753dece8SMiguel Ojeda pub fn drain<R>(&mut self, range: R) -> Drain<'_, T, A> 1964753dece8SMiguel Ojeda where 1965753dece8SMiguel Ojeda R: RangeBounds<usize>, 1966753dece8SMiguel Ojeda { 1967753dece8SMiguel Ojeda // Memory safety 1968753dece8SMiguel Ojeda // 1969753dece8SMiguel Ojeda // When the Drain is first created, it shortens the length of 1970753dece8SMiguel Ojeda // the source vector to make sure no uninitialized or moved-from elements 1971753dece8SMiguel Ojeda // are accessible at all if the Drain's destructor never gets to run. 1972753dece8SMiguel Ojeda // 1973753dece8SMiguel Ojeda // Drain will ptr::read out the values to remove. 1974753dece8SMiguel Ojeda // When finished, remaining tail of the vec is copied back to cover 1975753dece8SMiguel Ojeda // the hole, and the vector length is restored to the new length. 1976753dece8SMiguel Ojeda // 1977753dece8SMiguel Ojeda let len = self.len(); 1978753dece8SMiguel Ojeda let Range { start, end } = slice::range(range, ..len); 1979753dece8SMiguel Ojeda 1980753dece8SMiguel Ojeda unsafe { 1981753dece8SMiguel Ojeda // set self.vec length's to start, to be safe in case Drain is leaked 1982753dece8SMiguel Ojeda self.set_len(start); 1983753dece8SMiguel Ojeda // Use the borrow in the IterMut to indicate borrowing behavior of the 1984753dece8SMiguel Ojeda // whole Drain iterator (like &mut T). 1985753dece8SMiguel Ojeda let range_slice = slice::from_raw_parts_mut(self.as_mut_ptr().add(start), end - start); 1986753dece8SMiguel Ojeda Drain { 1987753dece8SMiguel Ojeda tail_start: end, 1988753dece8SMiguel Ojeda tail_len: len - end, 1989753dece8SMiguel Ojeda iter: range_slice.iter(), 1990753dece8SMiguel Ojeda vec: NonNull::from(self), 1991753dece8SMiguel Ojeda } 1992753dece8SMiguel Ojeda } 1993753dece8SMiguel Ojeda } 1994753dece8SMiguel Ojeda 1995753dece8SMiguel Ojeda /// Clears the vector, removing all values. 1996753dece8SMiguel Ojeda /// 1997753dece8SMiguel Ojeda /// Note that this method has no effect on the allocated capacity 1998753dece8SMiguel Ojeda /// of the vector. 1999753dece8SMiguel Ojeda /// 2000753dece8SMiguel Ojeda /// # Examples 2001753dece8SMiguel Ojeda /// 2002753dece8SMiguel Ojeda /// ``` 2003753dece8SMiguel Ojeda /// let mut v = vec![1, 2, 3]; 2004753dece8SMiguel Ojeda /// 2005753dece8SMiguel Ojeda /// v.clear(); 2006753dece8SMiguel Ojeda /// 2007753dece8SMiguel Ojeda /// assert!(v.is_empty()); 2008753dece8SMiguel Ojeda /// ``` 2009753dece8SMiguel Ojeda #[inline] 2010753dece8SMiguel Ojeda #[stable(feature = "rust1", since = "1.0.0")] 2011753dece8SMiguel Ojeda pub fn clear(&mut self) { 2012753dece8SMiguel Ojeda let elems: *mut [T] = self.as_mut_slice(); 2013753dece8SMiguel Ojeda 2014753dece8SMiguel Ojeda // SAFETY: 2015753dece8SMiguel Ojeda // - `elems` comes directly from `as_mut_slice` and is therefore valid. 2016753dece8SMiguel Ojeda // - Setting `self.len` before calling `drop_in_place` means that, 2017753dece8SMiguel Ojeda // if an element's `Drop` impl panics, the vector's `Drop` impl will 2018753dece8SMiguel Ojeda // do nothing (leaking the rest of the elements) instead of dropping 2019753dece8SMiguel Ojeda // some twice. 2020753dece8SMiguel Ojeda unsafe { 2021753dece8SMiguel Ojeda self.len = 0; 2022753dece8SMiguel Ojeda ptr::drop_in_place(elems); 2023753dece8SMiguel Ojeda } 2024753dece8SMiguel Ojeda } 2025753dece8SMiguel Ojeda 2026753dece8SMiguel Ojeda /// Returns the number of elements in the vector, also referred to 2027753dece8SMiguel Ojeda /// as its 'length'. 2028753dece8SMiguel Ojeda /// 2029753dece8SMiguel Ojeda /// # Examples 2030753dece8SMiguel Ojeda /// 2031753dece8SMiguel Ojeda /// ``` 2032753dece8SMiguel Ojeda /// let a = vec![1, 2, 3]; 2033753dece8SMiguel Ojeda /// assert_eq!(a.len(), 3); 2034753dece8SMiguel Ojeda /// ``` 2035753dece8SMiguel Ojeda #[inline] 2036753dece8SMiguel Ojeda #[stable(feature = "rust1", since = "1.0.0")] 2037753dece8SMiguel Ojeda pub fn len(&self) -> usize { 2038753dece8SMiguel Ojeda self.len 2039753dece8SMiguel Ojeda } 2040753dece8SMiguel Ojeda 2041753dece8SMiguel Ojeda /// Returns `true` if the vector contains no elements. 2042753dece8SMiguel Ojeda /// 2043753dece8SMiguel Ojeda /// # Examples 2044753dece8SMiguel Ojeda /// 2045753dece8SMiguel Ojeda /// ``` 2046753dece8SMiguel Ojeda /// let mut v = Vec::new(); 2047753dece8SMiguel Ojeda /// assert!(v.is_empty()); 2048753dece8SMiguel Ojeda /// 2049753dece8SMiguel Ojeda /// v.push(1); 2050753dece8SMiguel Ojeda /// assert!(!v.is_empty()); 2051753dece8SMiguel Ojeda /// ``` 2052753dece8SMiguel Ojeda #[stable(feature = "rust1", since = "1.0.0")] 2053753dece8SMiguel Ojeda pub fn is_empty(&self) -> bool { 2054753dece8SMiguel Ojeda self.len() == 0 2055753dece8SMiguel Ojeda } 2056753dece8SMiguel Ojeda 2057753dece8SMiguel Ojeda /// Splits the collection into two at the given index. 2058753dece8SMiguel Ojeda /// 2059753dece8SMiguel Ojeda /// Returns a newly allocated vector containing the elements in the range 2060753dece8SMiguel Ojeda /// `[at, len)`. After the call, the original vector will be left containing 2061753dece8SMiguel Ojeda /// the elements `[0, at)` with its previous capacity unchanged. 2062753dece8SMiguel Ojeda /// 2063753dece8SMiguel Ojeda /// # Panics 2064753dece8SMiguel Ojeda /// 2065753dece8SMiguel Ojeda /// Panics if `at > len`. 2066753dece8SMiguel Ojeda /// 2067753dece8SMiguel Ojeda /// # Examples 2068753dece8SMiguel Ojeda /// 2069753dece8SMiguel Ojeda /// ``` 2070753dece8SMiguel Ojeda /// let mut vec = vec![1, 2, 3]; 2071753dece8SMiguel Ojeda /// let vec2 = vec.split_off(1); 2072753dece8SMiguel Ojeda /// assert_eq!(vec, [1]); 2073753dece8SMiguel Ojeda /// assert_eq!(vec2, [2, 3]); 2074753dece8SMiguel Ojeda /// ``` 2075753dece8SMiguel Ojeda #[cfg(not(no_global_oom_handling))] 2076753dece8SMiguel Ojeda #[inline] 2077753dece8SMiguel Ojeda #[must_use = "use `.truncate()` if you don't need the other half"] 2078753dece8SMiguel Ojeda #[stable(feature = "split_off", since = "1.4.0")] 2079753dece8SMiguel Ojeda pub fn split_off(&mut self, at: usize) -> Self 2080753dece8SMiguel Ojeda where 2081753dece8SMiguel Ojeda A: Clone, 2082753dece8SMiguel Ojeda { 2083753dece8SMiguel Ojeda #[cold] 2084753dece8SMiguel Ojeda #[inline(never)] 2085753dece8SMiguel Ojeda fn assert_failed(at: usize, len: usize) -> ! { 2086753dece8SMiguel Ojeda panic!("`at` split index (is {at}) should be <= len (is {len})"); 2087753dece8SMiguel Ojeda } 2088753dece8SMiguel Ojeda 2089753dece8SMiguel Ojeda if at > self.len() { 2090753dece8SMiguel Ojeda assert_failed(at, self.len()); 2091753dece8SMiguel Ojeda } 2092753dece8SMiguel Ojeda 2093753dece8SMiguel Ojeda if at == 0 { 2094753dece8SMiguel Ojeda // the new vector can take over the original buffer and avoid the copy 2095753dece8SMiguel Ojeda return mem::replace( 2096753dece8SMiguel Ojeda self, 2097753dece8SMiguel Ojeda Vec::with_capacity_in(self.capacity(), self.allocator().clone()), 2098753dece8SMiguel Ojeda ); 2099753dece8SMiguel Ojeda } 2100753dece8SMiguel Ojeda 2101753dece8SMiguel Ojeda let other_len = self.len - at; 2102753dece8SMiguel Ojeda let mut other = Vec::with_capacity_in(other_len, self.allocator().clone()); 2103753dece8SMiguel Ojeda 2104753dece8SMiguel Ojeda // Unsafely `set_len` and copy items to `other`. 2105753dece8SMiguel Ojeda unsafe { 2106753dece8SMiguel Ojeda self.set_len(at); 2107753dece8SMiguel Ojeda other.set_len(other_len); 2108753dece8SMiguel Ojeda 2109753dece8SMiguel Ojeda ptr::copy_nonoverlapping(self.as_ptr().add(at), other.as_mut_ptr(), other.len()); 2110753dece8SMiguel Ojeda } 2111753dece8SMiguel Ojeda other 2112753dece8SMiguel Ojeda } 2113753dece8SMiguel Ojeda 2114753dece8SMiguel Ojeda /// Resizes the `Vec` in-place so that `len` is equal to `new_len`. 2115753dece8SMiguel Ojeda /// 2116753dece8SMiguel Ojeda /// If `new_len` is greater than `len`, the `Vec` is extended by the 2117753dece8SMiguel Ojeda /// difference, with each additional slot filled with the result of 2118753dece8SMiguel Ojeda /// calling the closure `f`. The return values from `f` will end up 2119753dece8SMiguel Ojeda /// in the `Vec` in the order they have been generated. 2120753dece8SMiguel Ojeda /// 2121753dece8SMiguel Ojeda /// If `new_len` is less than `len`, the `Vec` is simply truncated. 2122753dece8SMiguel Ojeda /// 2123753dece8SMiguel Ojeda /// This method uses a closure to create new values on every push. If 2124753dece8SMiguel Ojeda /// you'd rather [`Clone`] a given value, use [`Vec::resize`]. If you 2125753dece8SMiguel Ojeda /// want to use the [`Default`] trait to generate values, you can 2126753dece8SMiguel Ojeda /// pass [`Default::default`] as the second argument. 2127753dece8SMiguel Ojeda /// 2128753dece8SMiguel Ojeda /// # Examples 2129753dece8SMiguel Ojeda /// 2130753dece8SMiguel Ojeda /// ``` 2131753dece8SMiguel Ojeda /// let mut vec = vec![1, 2, 3]; 2132753dece8SMiguel Ojeda /// vec.resize_with(5, Default::default); 2133753dece8SMiguel Ojeda /// assert_eq!(vec, [1, 2, 3, 0, 0]); 2134753dece8SMiguel Ojeda /// 2135753dece8SMiguel Ojeda /// let mut vec = vec![]; 2136753dece8SMiguel Ojeda /// let mut p = 1; 2137753dece8SMiguel Ojeda /// vec.resize_with(4, || { p *= 2; p }); 2138753dece8SMiguel Ojeda /// assert_eq!(vec, [2, 4, 8, 16]); 2139753dece8SMiguel Ojeda /// ``` 2140753dece8SMiguel Ojeda #[cfg(not(no_global_oom_handling))] 2141753dece8SMiguel Ojeda #[stable(feature = "vec_resize_with", since = "1.33.0")] 2142753dece8SMiguel Ojeda pub fn resize_with<F>(&mut self, new_len: usize, f: F) 2143753dece8SMiguel Ojeda where 2144753dece8SMiguel Ojeda F: FnMut() -> T, 2145753dece8SMiguel Ojeda { 2146753dece8SMiguel Ojeda let len = self.len(); 2147753dece8SMiguel Ojeda if new_len > len { 2148753dece8SMiguel Ojeda self.extend_with(new_len - len, ExtendFunc(f)); 2149753dece8SMiguel Ojeda } else { 2150753dece8SMiguel Ojeda self.truncate(new_len); 2151753dece8SMiguel Ojeda } 2152753dece8SMiguel Ojeda } 2153753dece8SMiguel Ojeda 2154753dece8SMiguel Ojeda /// Consumes and leaks the `Vec`, returning a mutable reference to the contents, 2155753dece8SMiguel Ojeda /// `&'a mut [T]`. Note that the type `T` must outlive the chosen lifetime 2156753dece8SMiguel Ojeda /// `'a`. If the type has only static references, or none at all, then this 2157753dece8SMiguel Ojeda /// may be chosen to be `'static`. 2158753dece8SMiguel Ojeda /// 2159753dece8SMiguel Ojeda /// As of Rust 1.57, this method does not reallocate or shrink the `Vec`, 2160753dece8SMiguel Ojeda /// so the leaked allocation may include unused capacity that is not part 2161753dece8SMiguel Ojeda /// of the returned slice. 2162753dece8SMiguel Ojeda /// 2163753dece8SMiguel Ojeda /// This function is mainly useful for data that lives for the remainder of 2164753dece8SMiguel Ojeda /// the program's life. Dropping the returned reference will cause a memory 2165753dece8SMiguel Ojeda /// leak. 2166753dece8SMiguel Ojeda /// 2167753dece8SMiguel Ojeda /// # Examples 2168753dece8SMiguel Ojeda /// 2169753dece8SMiguel Ojeda /// Simple usage: 2170753dece8SMiguel Ojeda /// 2171753dece8SMiguel Ojeda /// ``` 2172753dece8SMiguel Ojeda /// let x = vec![1, 2, 3]; 2173753dece8SMiguel Ojeda /// let static_ref: &'static mut [usize] = x.leak(); 2174753dece8SMiguel Ojeda /// static_ref[0] += 1; 2175753dece8SMiguel Ojeda /// assert_eq!(static_ref, &[2, 2, 3]); 2176753dece8SMiguel Ojeda /// ``` 2177753dece8SMiguel Ojeda #[cfg(not(no_global_oom_handling))] 2178753dece8SMiguel Ojeda #[stable(feature = "vec_leak", since = "1.47.0")] 2179753dece8SMiguel Ojeda #[inline] 2180753dece8SMiguel Ojeda pub fn leak<'a>(self) -> &'a mut [T] 2181753dece8SMiguel Ojeda where 2182753dece8SMiguel Ojeda A: 'a, 2183753dece8SMiguel Ojeda { 2184753dece8SMiguel Ojeda let mut me = ManuallyDrop::new(self); 2185753dece8SMiguel Ojeda unsafe { slice::from_raw_parts_mut(me.as_mut_ptr(), me.len) } 2186753dece8SMiguel Ojeda } 2187753dece8SMiguel Ojeda 2188753dece8SMiguel Ojeda /// Returns the remaining spare capacity of the vector as a slice of 2189753dece8SMiguel Ojeda /// `MaybeUninit<T>`. 2190753dece8SMiguel Ojeda /// 2191753dece8SMiguel Ojeda /// The returned slice can be used to fill the vector with data (e.g. by 2192753dece8SMiguel Ojeda /// reading from a file) before marking the data as initialized using the 2193753dece8SMiguel Ojeda /// [`set_len`] method. 2194753dece8SMiguel Ojeda /// 2195753dece8SMiguel Ojeda /// [`set_len`]: Vec::set_len 2196753dece8SMiguel Ojeda /// 2197753dece8SMiguel Ojeda /// # Examples 2198753dece8SMiguel Ojeda /// 2199753dece8SMiguel Ojeda /// ``` 2200753dece8SMiguel Ojeda /// // Allocate vector big enough for 10 elements. 2201753dece8SMiguel Ojeda /// let mut v = Vec::with_capacity(10); 2202753dece8SMiguel Ojeda /// 2203753dece8SMiguel Ojeda /// // Fill in the first 3 elements. 2204753dece8SMiguel Ojeda /// let uninit = v.spare_capacity_mut(); 2205753dece8SMiguel Ojeda /// uninit[0].write(0); 2206753dece8SMiguel Ojeda /// uninit[1].write(1); 2207753dece8SMiguel Ojeda /// uninit[2].write(2); 2208753dece8SMiguel Ojeda /// 2209753dece8SMiguel Ojeda /// // Mark the first 3 elements of the vector as being initialized. 2210753dece8SMiguel Ojeda /// unsafe { 2211753dece8SMiguel Ojeda /// v.set_len(3); 2212753dece8SMiguel Ojeda /// } 2213753dece8SMiguel Ojeda /// 2214753dece8SMiguel Ojeda /// assert_eq!(&v, &[0, 1, 2]); 2215753dece8SMiguel Ojeda /// ``` 2216753dece8SMiguel Ojeda #[stable(feature = "vec_spare_capacity", since = "1.60.0")] 2217753dece8SMiguel Ojeda #[inline] 2218753dece8SMiguel Ojeda pub fn spare_capacity_mut(&mut self) -> &mut [MaybeUninit<T>] { 2219753dece8SMiguel Ojeda // Note: 2220753dece8SMiguel Ojeda // This method is not implemented in terms of `split_at_spare_mut`, 2221753dece8SMiguel Ojeda // to prevent invalidation of pointers to the buffer. 2222753dece8SMiguel Ojeda unsafe { 2223753dece8SMiguel Ojeda slice::from_raw_parts_mut( 2224753dece8SMiguel Ojeda self.as_mut_ptr().add(self.len) as *mut MaybeUninit<T>, 2225753dece8SMiguel Ojeda self.buf.capacity() - self.len, 2226753dece8SMiguel Ojeda ) 2227753dece8SMiguel Ojeda } 2228753dece8SMiguel Ojeda } 2229753dece8SMiguel Ojeda 2230753dece8SMiguel Ojeda /// Returns vector content as a slice of `T`, along with the remaining spare 2231753dece8SMiguel Ojeda /// capacity of the vector as a slice of `MaybeUninit<T>`. 2232753dece8SMiguel Ojeda /// 2233753dece8SMiguel Ojeda /// The returned spare capacity slice can be used to fill the vector with data 2234753dece8SMiguel Ojeda /// (e.g. by reading from a file) before marking the data as initialized using 2235753dece8SMiguel Ojeda /// the [`set_len`] method. 2236753dece8SMiguel Ojeda /// 2237753dece8SMiguel Ojeda /// [`set_len`]: Vec::set_len 2238753dece8SMiguel Ojeda /// 2239753dece8SMiguel Ojeda /// Note that this is a low-level API, which should be used with care for 2240753dece8SMiguel Ojeda /// optimization purposes. If you need to append data to a `Vec` 2241753dece8SMiguel Ojeda /// you can use [`push`], [`extend`], [`extend_from_slice`], 2242753dece8SMiguel Ojeda /// [`extend_from_within`], [`insert`], [`append`], [`resize`] or 2243753dece8SMiguel Ojeda /// [`resize_with`], depending on your exact needs. 2244753dece8SMiguel Ojeda /// 2245753dece8SMiguel Ojeda /// [`push`]: Vec::push 2246753dece8SMiguel Ojeda /// [`extend`]: Vec::extend 2247753dece8SMiguel Ojeda /// [`extend_from_slice`]: Vec::extend_from_slice 2248753dece8SMiguel Ojeda /// [`extend_from_within`]: Vec::extend_from_within 2249753dece8SMiguel Ojeda /// [`insert`]: Vec::insert 2250753dece8SMiguel Ojeda /// [`append`]: Vec::append 2251753dece8SMiguel Ojeda /// [`resize`]: Vec::resize 2252753dece8SMiguel Ojeda /// [`resize_with`]: Vec::resize_with 2253753dece8SMiguel Ojeda /// 2254753dece8SMiguel Ojeda /// # Examples 2255753dece8SMiguel Ojeda /// 2256753dece8SMiguel Ojeda /// ``` 2257753dece8SMiguel Ojeda /// #![feature(vec_split_at_spare)] 2258753dece8SMiguel Ojeda /// 2259753dece8SMiguel Ojeda /// let mut v = vec![1, 1, 2]; 2260753dece8SMiguel Ojeda /// 2261753dece8SMiguel Ojeda /// // Reserve additional space big enough for 10 elements. 2262753dece8SMiguel Ojeda /// v.reserve(10); 2263753dece8SMiguel Ojeda /// 2264753dece8SMiguel Ojeda /// let (init, uninit) = v.split_at_spare_mut(); 2265753dece8SMiguel Ojeda /// let sum = init.iter().copied().sum::<u32>(); 2266753dece8SMiguel Ojeda /// 2267753dece8SMiguel Ojeda /// // Fill in the next 4 elements. 2268753dece8SMiguel Ojeda /// uninit[0].write(sum); 2269753dece8SMiguel Ojeda /// uninit[1].write(sum * 2); 2270753dece8SMiguel Ojeda /// uninit[2].write(sum * 3); 2271753dece8SMiguel Ojeda /// uninit[3].write(sum * 4); 2272753dece8SMiguel Ojeda /// 2273753dece8SMiguel Ojeda /// // Mark the 4 elements of the vector as being initialized. 2274753dece8SMiguel Ojeda /// unsafe { 2275753dece8SMiguel Ojeda /// let len = v.len(); 2276753dece8SMiguel Ojeda /// v.set_len(len + 4); 2277753dece8SMiguel Ojeda /// } 2278753dece8SMiguel Ojeda /// 2279753dece8SMiguel Ojeda /// assert_eq!(&v, &[1, 1, 2, 4, 8, 12, 16]); 2280753dece8SMiguel Ojeda /// ``` 2281753dece8SMiguel Ojeda #[unstable(feature = "vec_split_at_spare", issue = "81944")] 2282753dece8SMiguel Ojeda #[inline] 2283753dece8SMiguel Ojeda pub fn split_at_spare_mut(&mut self) -> (&mut [T], &mut [MaybeUninit<T>]) { 2284753dece8SMiguel Ojeda // SAFETY: 2285753dece8SMiguel Ojeda // - len is ignored and so never changed 2286753dece8SMiguel Ojeda let (init, spare, _) = unsafe { self.split_at_spare_mut_with_len() }; 2287753dece8SMiguel Ojeda (init, spare) 2288753dece8SMiguel Ojeda } 2289753dece8SMiguel Ojeda 2290753dece8SMiguel Ojeda /// Safety: changing returned .2 (&mut usize) is considered the same as calling `.set_len(_)`. 2291753dece8SMiguel Ojeda /// 2292753dece8SMiguel Ojeda /// This method provides unique access to all vec parts at once in `extend_from_within`. 2293753dece8SMiguel Ojeda unsafe fn split_at_spare_mut_with_len( 2294753dece8SMiguel Ojeda &mut self, 2295753dece8SMiguel Ojeda ) -> (&mut [T], &mut [MaybeUninit<T>], &mut usize) { 2296753dece8SMiguel Ojeda let ptr = self.as_mut_ptr(); 2297753dece8SMiguel Ojeda // SAFETY: 2298753dece8SMiguel Ojeda // - `ptr` is guaranteed to be valid for `self.len` elements 2299753dece8SMiguel Ojeda // - but the allocation extends out to `self.buf.capacity()` elements, possibly 2300753dece8SMiguel Ojeda // uninitialized 2301753dece8SMiguel Ojeda let spare_ptr = unsafe { ptr.add(self.len) }; 2302753dece8SMiguel Ojeda let spare_ptr = spare_ptr.cast::<MaybeUninit<T>>(); 2303753dece8SMiguel Ojeda let spare_len = self.buf.capacity() - self.len; 2304753dece8SMiguel Ojeda 2305753dece8SMiguel Ojeda // SAFETY: 2306753dece8SMiguel Ojeda // - `ptr` is guaranteed to be valid for `self.len` elements 2307753dece8SMiguel Ojeda // - `spare_ptr` is pointing one element past the buffer, so it doesn't overlap with `initialized` 2308753dece8SMiguel Ojeda unsafe { 2309753dece8SMiguel Ojeda let initialized = slice::from_raw_parts_mut(ptr, self.len); 2310753dece8SMiguel Ojeda let spare = slice::from_raw_parts_mut(spare_ptr, spare_len); 2311753dece8SMiguel Ojeda 2312753dece8SMiguel Ojeda (initialized, spare, &mut self.len) 2313753dece8SMiguel Ojeda } 2314753dece8SMiguel Ojeda } 2315753dece8SMiguel Ojeda } 2316753dece8SMiguel Ojeda 2317753dece8SMiguel Ojeda impl<T: Clone, A: Allocator> Vec<T, A> { 2318753dece8SMiguel Ojeda /// Resizes the `Vec` in-place so that `len` is equal to `new_len`. 2319753dece8SMiguel Ojeda /// 2320753dece8SMiguel Ojeda /// If `new_len` is greater than `len`, the `Vec` is extended by the 2321753dece8SMiguel Ojeda /// difference, with each additional slot filled with `value`. 2322753dece8SMiguel Ojeda /// If `new_len` is less than `len`, the `Vec` is simply truncated. 2323753dece8SMiguel Ojeda /// 2324753dece8SMiguel Ojeda /// This method requires `T` to implement [`Clone`], 2325753dece8SMiguel Ojeda /// in order to be able to clone the passed value. 2326753dece8SMiguel Ojeda /// If you need more flexibility (or want to rely on [`Default`] instead of 2327753dece8SMiguel Ojeda /// [`Clone`]), use [`Vec::resize_with`]. 2328753dece8SMiguel Ojeda /// If you only need to resize to a smaller size, use [`Vec::truncate`]. 2329753dece8SMiguel Ojeda /// 2330753dece8SMiguel Ojeda /// # Examples 2331753dece8SMiguel Ojeda /// 2332753dece8SMiguel Ojeda /// ``` 2333753dece8SMiguel Ojeda /// let mut vec = vec!["hello"]; 2334753dece8SMiguel Ojeda /// vec.resize(3, "world"); 2335753dece8SMiguel Ojeda /// assert_eq!(vec, ["hello", "world", "world"]); 2336753dece8SMiguel Ojeda /// 2337753dece8SMiguel Ojeda /// let mut vec = vec![1, 2, 3, 4]; 2338753dece8SMiguel Ojeda /// vec.resize(2, 0); 2339753dece8SMiguel Ojeda /// assert_eq!(vec, [1, 2]); 2340753dece8SMiguel Ojeda /// ``` 2341753dece8SMiguel Ojeda #[cfg(not(no_global_oom_handling))] 2342753dece8SMiguel Ojeda #[stable(feature = "vec_resize", since = "1.5.0")] 2343753dece8SMiguel Ojeda pub fn resize(&mut self, new_len: usize, value: T) { 2344753dece8SMiguel Ojeda let len = self.len(); 2345753dece8SMiguel Ojeda 2346753dece8SMiguel Ojeda if new_len > len { 2347753dece8SMiguel Ojeda self.extend_with(new_len - len, ExtendElement(value)) 2348753dece8SMiguel Ojeda } else { 2349753dece8SMiguel Ojeda self.truncate(new_len); 2350753dece8SMiguel Ojeda } 2351753dece8SMiguel Ojeda } 2352753dece8SMiguel Ojeda 2353*318c3cc8SMiguel Ojeda /// Tries to resize the `Vec` in-place so that `len` is equal to `new_len`. 2354*318c3cc8SMiguel Ojeda /// 2355*318c3cc8SMiguel Ojeda /// If `new_len` is greater than `len`, the `Vec` is extended by the 2356*318c3cc8SMiguel Ojeda /// difference, with each additional slot filled with `value`. 2357*318c3cc8SMiguel Ojeda /// If `new_len` is less than `len`, the `Vec` is simply truncated. 2358*318c3cc8SMiguel Ojeda /// 2359*318c3cc8SMiguel Ojeda /// This method requires `T` to implement [`Clone`], 2360*318c3cc8SMiguel Ojeda /// in order to be able to clone the passed value. 2361*318c3cc8SMiguel Ojeda /// If you need more flexibility (or want to rely on [`Default`] instead of 2362*318c3cc8SMiguel Ojeda /// [`Clone`]), use [`Vec::resize_with`]. 2363*318c3cc8SMiguel Ojeda /// If you only need to resize to a smaller size, use [`Vec::truncate`]. 2364*318c3cc8SMiguel Ojeda /// 2365*318c3cc8SMiguel Ojeda /// # Examples 2366*318c3cc8SMiguel Ojeda /// 2367*318c3cc8SMiguel Ojeda /// ``` 2368*318c3cc8SMiguel Ojeda /// let mut vec = vec!["hello"]; 2369*318c3cc8SMiguel Ojeda /// vec.try_resize(3, "world").unwrap(); 2370*318c3cc8SMiguel Ojeda /// assert_eq!(vec, ["hello", "world", "world"]); 2371*318c3cc8SMiguel Ojeda /// 2372*318c3cc8SMiguel Ojeda /// let mut vec = vec![1, 2, 3, 4]; 2373*318c3cc8SMiguel Ojeda /// vec.try_resize(2, 0).unwrap(); 2374*318c3cc8SMiguel Ojeda /// assert_eq!(vec, [1, 2]); 2375*318c3cc8SMiguel Ojeda /// 2376*318c3cc8SMiguel Ojeda /// let mut vec = vec![42]; 2377*318c3cc8SMiguel Ojeda /// let result = vec.try_resize(usize::MAX, 0); 2378*318c3cc8SMiguel Ojeda /// assert!(result.is_err()); 2379*318c3cc8SMiguel Ojeda /// ``` 2380*318c3cc8SMiguel Ojeda #[stable(feature = "kernel", since = "1.0.0")] 2381*318c3cc8SMiguel Ojeda pub fn try_resize(&mut self, new_len: usize, value: T) -> Result<(), TryReserveError> { 2382*318c3cc8SMiguel Ojeda let len = self.len(); 2383*318c3cc8SMiguel Ojeda 2384*318c3cc8SMiguel Ojeda if new_len > len { 2385*318c3cc8SMiguel Ojeda self.try_extend_with(new_len - len, ExtendElement(value)) 2386*318c3cc8SMiguel Ojeda } else { 2387*318c3cc8SMiguel Ojeda self.truncate(new_len); 2388*318c3cc8SMiguel Ojeda Ok(()) 2389*318c3cc8SMiguel Ojeda } 2390*318c3cc8SMiguel Ojeda } 2391*318c3cc8SMiguel Ojeda 2392753dece8SMiguel Ojeda /// Clones and appends all elements in a slice to the `Vec`. 2393753dece8SMiguel Ojeda /// 2394753dece8SMiguel Ojeda /// Iterates over the slice `other`, clones each element, and then appends 2395753dece8SMiguel Ojeda /// it to this `Vec`. The `other` slice is traversed in-order. 2396753dece8SMiguel Ojeda /// 2397753dece8SMiguel Ojeda /// Note that this function is same as [`extend`] except that it is 2398753dece8SMiguel Ojeda /// specialized to work with slices instead. If and when Rust gets 2399753dece8SMiguel Ojeda /// specialization this function will likely be deprecated (but still 2400753dece8SMiguel Ojeda /// available). 2401753dece8SMiguel Ojeda /// 2402753dece8SMiguel Ojeda /// # Examples 2403753dece8SMiguel Ojeda /// 2404753dece8SMiguel Ojeda /// ``` 2405753dece8SMiguel Ojeda /// let mut vec = vec![1]; 2406753dece8SMiguel Ojeda /// vec.extend_from_slice(&[2, 3, 4]); 2407753dece8SMiguel Ojeda /// assert_eq!(vec, [1, 2, 3, 4]); 2408753dece8SMiguel Ojeda /// ``` 2409753dece8SMiguel Ojeda /// 2410753dece8SMiguel Ojeda /// [`extend`]: Vec::extend 2411753dece8SMiguel Ojeda #[cfg(not(no_global_oom_handling))] 2412753dece8SMiguel Ojeda #[stable(feature = "vec_extend_from_slice", since = "1.6.0")] 2413753dece8SMiguel Ojeda pub fn extend_from_slice(&mut self, other: &[T]) { 2414753dece8SMiguel Ojeda self.spec_extend(other.iter()) 2415753dece8SMiguel Ojeda } 2416753dece8SMiguel Ojeda 2417*318c3cc8SMiguel Ojeda /// Tries to clone and append all elements in a slice to the `Vec`. 2418*318c3cc8SMiguel Ojeda /// 2419*318c3cc8SMiguel Ojeda /// Iterates over the slice `other`, clones each element, and then appends 2420*318c3cc8SMiguel Ojeda /// it to this `Vec`. The `other` slice is traversed in-order. 2421*318c3cc8SMiguel Ojeda /// 2422*318c3cc8SMiguel Ojeda /// Note that this function is same as [`extend`] except that it is 2423*318c3cc8SMiguel Ojeda /// specialized to work with slices instead. If and when Rust gets 2424*318c3cc8SMiguel Ojeda /// specialization this function will likely be deprecated (but still 2425*318c3cc8SMiguel Ojeda /// available). 2426*318c3cc8SMiguel Ojeda /// 2427*318c3cc8SMiguel Ojeda /// # Examples 2428*318c3cc8SMiguel Ojeda /// 2429*318c3cc8SMiguel Ojeda /// ``` 2430*318c3cc8SMiguel Ojeda /// let mut vec = vec![1]; 2431*318c3cc8SMiguel Ojeda /// vec.try_extend_from_slice(&[2, 3, 4]).unwrap(); 2432*318c3cc8SMiguel Ojeda /// assert_eq!(vec, [1, 2, 3, 4]); 2433*318c3cc8SMiguel Ojeda /// ``` 2434*318c3cc8SMiguel Ojeda /// 2435*318c3cc8SMiguel Ojeda /// [`extend`]: Vec::extend 2436*318c3cc8SMiguel Ojeda #[stable(feature = "kernel", since = "1.0.0")] 2437*318c3cc8SMiguel Ojeda pub fn try_extend_from_slice(&mut self, other: &[T]) -> Result<(), TryReserveError> { 2438*318c3cc8SMiguel Ojeda self.try_spec_extend(other.iter()) 2439*318c3cc8SMiguel Ojeda } 2440*318c3cc8SMiguel Ojeda 2441753dece8SMiguel Ojeda /// Copies elements from `src` range to the end of the vector. 2442753dece8SMiguel Ojeda /// 2443753dece8SMiguel Ojeda /// # Panics 2444753dece8SMiguel Ojeda /// 2445753dece8SMiguel Ojeda /// Panics if the starting point is greater than the end point or if 2446753dece8SMiguel Ojeda /// the end point is greater than the length of the vector. 2447753dece8SMiguel Ojeda /// 2448753dece8SMiguel Ojeda /// # Examples 2449753dece8SMiguel Ojeda /// 2450753dece8SMiguel Ojeda /// ``` 2451753dece8SMiguel Ojeda /// let mut vec = vec![0, 1, 2, 3, 4]; 2452753dece8SMiguel Ojeda /// 2453753dece8SMiguel Ojeda /// vec.extend_from_within(2..); 2454753dece8SMiguel Ojeda /// assert_eq!(vec, [0, 1, 2, 3, 4, 2, 3, 4]); 2455753dece8SMiguel Ojeda /// 2456753dece8SMiguel Ojeda /// vec.extend_from_within(..2); 2457753dece8SMiguel Ojeda /// assert_eq!(vec, [0, 1, 2, 3, 4, 2, 3, 4, 0, 1]); 2458753dece8SMiguel Ojeda /// 2459753dece8SMiguel Ojeda /// vec.extend_from_within(4..8); 2460753dece8SMiguel Ojeda /// assert_eq!(vec, [0, 1, 2, 3, 4, 2, 3, 4, 0, 1, 4, 2, 3, 4]); 2461753dece8SMiguel Ojeda /// ``` 2462753dece8SMiguel Ojeda #[cfg(not(no_global_oom_handling))] 2463753dece8SMiguel Ojeda #[stable(feature = "vec_extend_from_within", since = "1.53.0")] 2464753dece8SMiguel Ojeda pub fn extend_from_within<R>(&mut self, src: R) 2465753dece8SMiguel Ojeda where 2466753dece8SMiguel Ojeda R: RangeBounds<usize>, 2467753dece8SMiguel Ojeda { 2468753dece8SMiguel Ojeda let range = slice::range(src, ..self.len()); 2469753dece8SMiguel Ojeda self.reserve(range.len()); 2470753dece8SMiguel Ojeda 2471753dece8SMiguel Ojeda // SAFETY: 2472753dece8SMiguel Ojeda // - `slice::range` guarantees that the given range is valid for indexing self 2473753dece8SMiguel Ojeda unsafe { 2474753dece8SMiguel Ojeda self.spec_extend_from_within(range); 2475753dece8SMiguel Ojeda } 2476753dece8SMiguel Ojeda } 2477753dece8SMiguel Ojeda } 2478753dece8SMiguel Ojeda 2479753dece8SMiguel Ojeda impl<T, A: Allocator, const N: usize> Vec<[T; N], A> { 2480753dece8SMiguel Ojeda /// Takes a `Vec<[T; N]>` and flattens it into a `Vec<T>`. 2481753dece8SMiguel Ojeda /// 2482753dece8SMiguel Ojeda /// # Panics 2483753dece8SMiguel Ojeda /// 2484753dece8SMiguel Ojeda /// Panics if the length of the resulting vector would overflow a `usize`. 2485753dece8SMiguel Ojeda /// 2486753dece8SMiguel Ojeda /// This is only possible when flattening a vector of arrays of zero-sized 2487753dece8SMiguel Ojeda /// types, and thus tends to be irrelevant in practice. If 2488753dece8SMiguel Ojeda /// `size_of::<T>() > 0`, this will never panic. 2489753dece8SMiguel Ojeda /// 2490753dece8SMiguel Ojeda /// # Examples 2491753dece8SMiguel Ojeda /// 2492753dece8SMiguel Ojeda /// ``` 2493753dece8SMiguel Ojeda /// #![feature(slice_flatten)] 2494753dece8SMiguel Ojeda /// 2495753dece8SMiguel Ojeda /// let mut vec = vec![[1, 2, 3], [4, 5, 6], [7, 8, 9]]; 2496753dece8SMiguel Ojeda /// assert_eq!(vec.pop(), Some([7, 8, 9])); 2497753dece8SMiguel Ojeda /// 2498753dece8SMiguel Ojeda /// let mut flattened = vec.into_flattened(); 2499753dece8SMiguel Ojeda /// assert_eq!(flattened.pop(), Some(6)); 2500753dece8SMiguel Ojeda /// ``` 2501753dece8SMiguel Ojeda #[unstable(feature = "slice_flatten", issue = "95629")] 2502753dece8SMiguel Ojeda pub fn into_flattened(self) -> Vec<T, A> { 2503753dece8SMiguel Ojeda let (ptr, len, cap, alloc) = self.into_raw_parts_with_alloc(); 2504753dece8SMiguel Ojeda let (new_len, new_cap) = if mem::size_of::<T>() == 0 { 2505753dece8SMiguel Ojeda (len.checked_mul(N).expect("vec len overflow"), usize::MAX) 2506753dece8SMiguel Ojeda } else { 2507753dece8SMiguel Ojeda // SAFETY: 2508753dece8SMiguel Ojeda // - `cap * N` cannot overflow because the allocation is already in 2509753dece8SMiguel Ojeda // the address space. 2510753dece8SMiguel Ojeda // - Each `[T; N]` has `N` valid elements, so there are `len * N` 2511753dece8SMiguel Ojeda // valid elements in the allocation. 2512753dece8SMiguel Ojeda unsafe { (len.unchecked_mul(N), cap.unchecked_mul(N)) } 2513753dece8SMiguel Ojeda }; 2514753dece8SMiguel Ojeda // SAFETY: 2515753dece8SMiguel Ojeda // - `ptr` was allocated by `self` 2516753dece8SMiguel Ojeda // - `ptr` is well-aligned because `[T; N]` has the same alignment as `T`. 2517753dece8SMiguel Ojeda // - `new_cap` refers to the same sized allocation as `cap` because 2518753dece8SMiguel Ojeda // `new_cap * size_of::<T>()` == `cap * size_of::<[T; N]>()` 2519753dece8SMiguel Ojeda // - `len` <= `cap`, so `len * N` <= `cap * N`. 2520753dece8SMiguel Ojeda unsafe { Vec::<T, A>::from_raw_parts_in(ptr.cast(), new_len, new_cap, alloc) } 2521753dece8SMiguel Ojeda } 2522753dece8SMiguel Ojeda } 2523753dece8SMiguel Ojeda 2524753dece8SMiguel Ojeda // This code generalizes `extend_with_{element,default}`. 2525753dece8SMiguel Ojeda trait ExtendWith<T> { 2526753dece8SMiguel Ojeda fn next(&mut self) -> T; 2527753dece8SMiguel Ojeda fn last(self) -> T; 2528753dece8SMiguel Ojeda } 2529753dece8SMiguel Ojeda 2530753dece8SMiguel Ojeda struct ExtendElement<T>(T); 2531753dece8SMiguel Ojeda impl<T: Clone> ExtendWith<T> for ExtendElement<T> { 2532753dece8SMiguel Ojeda fn next(&mut self) -> T { 2533753dece8SMiguel Ojeda self.0.clone() 2534753dece8SMiguel Ojeda } 2535753dece8SMiguel Ojeda fn last(self) -> T { 2536753dece8SMiguel Ojeda self.0 2537753dece8SMiguel Ojeda } 2538753dece8SMiguel Ojeda } 2539753dece8SMiguel Ojeda 2540753dece8SMiguel Ojeda struct ExtendFunc<F>(F); 2541753dece8SMiguel Ojeda impl<T, F: FnMut() -> T> ExtendWith<T> for ExtendFunc<F> { 2542753dece8SMiguel Ojeda fn next(&mut self) -> T { 2543753dece8SMiguel Ojeda (self.0)() 2544753dece8SMiguel Ojeda } 2545753dece8SMiguel Ojeda fn last(mut self) -> T { 2546753dece8SMiguel Ojeda (self.0)() 2547753dece8SMiguel Ojeda } 2548753dece8SMiguel Ojeda } 2549753dece8SMiguel Ojeda 2550753dece8SMiguel Ojeda impl<T, A: Allocator> Vec<T, A> { 2551753dece8SMiguel Ojeda #[cfg(not(no_global_oom_handling))] 2552753dece8SMiguel Ojeda /// Extend the vector by `n` values, using the given generator. 2553753dece8SMiguel Ojeda fn extend_with<E: ExtendWith<T>>(&mut self, n: usize, mut value: E) { 2554753dece8SMiguel Ojeda self.reserve(n); 2555753dece8SMiguel Ojeda 2556753dece8SMiguel Ojeda unsafe { 2557753dece8SMiguel Ojeda let mut ptr = self.as_mut_ptr().add(self.len()); 2558753dece8SMiguel Ojeda // Use SetLenOnDrop to work around bug where compiler 2559753dece8SMiguel Ojeda // might not realize the store through `ptr` through self.set_len() 2560753dece8SMiguel Ojeda // don't alias. 2561753dece8SMiguel Ojeda let mut local_len = SetLenOnDrop::new(&mut self.len); 2562753dece8SMiguel Ojeda 2563753dece8SMiguel Ojeda // Write all elements except the last one 2564753dece8SMiguel Ojeda for _ in 1..n { 2565753dece8SMiguel Ojeda ptr::write(ptr, value.next()); 2566753dece8SMiguel Ojeda ptr = ptr.offset(1); 2567753dece8SMiguel Ojeda // Increment the length in every step in case next() panics 2568753dece8SMiguel Ojeda local_len.increment_len(1); 2569753dece8SMiguel Ojeda } 2570753dece8SMiguel Ojeda 2571753dece8SMiguel Ojeda if n > 0 { 2572753dece8SMiguel Ojeda // We can write the last element directly without cloning needlessly 2573753dece8SMiguel Ojeda ptr::write(ptr, value.last()); 2574753dece8SMiguel Ojeda local_len.increment_len(1); 2575753dece8SMiguel Ojeda } 2576753dece8SMiguel Ojeda 2577753dece8SMiguel Ojeda // len set by scope guard 2578753dece8SMiguel Ojeda } 2579753dece8SMiguel Ojeda } 2580*318c3cc8SMiguel Ojeda 2581*318c3cc8SMiguel Ojeda /// Try to extend the vector by `n` values, using the given generator. 2582*318c3cc8SMiguel Ojeda fn try_extend_with<E: ExtendWith<T>>(&mut self, n: usize, mut value: E) -> Result<(), TryReserveError> { 2583*318c3cc8SMiguel Ojeda self.try_reserve(n)?; 2584*318c3cc8SMiguel Ojeda 2585*318c3cc8SMiguel Ojeda unsafe { 2586*318c3cc8SMiguel Ojeda let mut ptr = self.as_mut_ptr().add(self.len()); 2587*318c3cc8SMiguel Ojeda // Use SetLenOnDrop to work around bug where compiler 2588*318c3cc8SMiguel Ojeda // might not realize the store through `ptr` through self.set_len() 2589*318c3cc8SMiguel Ojeda // don't alias. 2590*318c3cc8SMiguel Ojeda let mut local_len = SetLenOnDrop::new(&mut self.len); 2591*318c3cc8SMiguel Ojeda 2592*318c3cc8SMiguel Ojeda // Write all elements except the last one 2593*318c3cc8SMiguel Ojeda for _ in 1..n { 2594*318c3cc8SMiguel Ojeda ptr::write(ptr, value.next()); 2595*318c3cc8SMiguel Ojeda ptr = ptr.offset(1); 2596*318c3cc8SMiguel Ojeda // Increment the length in every step in case next() panics 2597*318c3cc8SMiguel Ojeda local_len.increment_len(1); 2598*318c3cc8SMiguel Ojeda } 2599*318c3cc8SMiguel Ojeda 2600*318c3cc8SMiguel Ojeda if n > 0 { 2601*318c3cc8SMiguel Ojeda // We can write the last element directly without cloning needlessly 2602*318c3cc8SMiguel Ojeda ptr::write(ptr, value.last()); 2603*318c3cc8SMiguel Ojeda local_len.increment_len(1); 2604*318c3cc8SMiguel Ojeda } 2605*318c3cc8SMiguel Ojeda 2606*318c3cc8SMiguel Ojeda // len set by scope guard 2607*318c3cc8SMiguel Ojeda Ok(()) 2608*318c3cc8SMiguel Ojeda } 2609*318c3cc8SMiguel Ojeda } 2610753dece8SMiguel Ojeda } 2611753dece8SMiguel Ojeda 2612753dece8SMiguel Ojeda impl<T: PartialEq, A: Allocator> Vec<T, A> { 2613753dece8SMiguel Ojeda /// Removes consecutive repeated elements in the vector according to the 2614753dece8SMiguel Ojeda /// [`PartialEq`] trait implementation. 2615753dece8SMiguel Ojeda /// 2616753dece8SMiguel Ojeda /// If the vector is sorted, this removes all duplicates. 2617753dece8SMiguel Ojeda /// 2618753dece8SMiguel Ojeda /// # Examples 2619753dece8SMiguel Ojeda /// 2620753dece8SMiguel Ojeda /// ``` 2621753dece8SMiguel Ojeda /// let mut vec = vec![1, 2, 2, 3, 2]; 2622753dece8SMiguel Ojeda /// 2623753dece8SMiguel Ojeda /// vec.dedup(); 2624753dece8SMiguel Ojeda /// 2625753dece8SMiguel Ojeda /// assert_eq!(vec, [1, 2, 3, 2]); 2626753dece8SMiguel Ojeda /// ``` 2627753dece8SMiguel Ojeda #[stable(feature = "rust1", since = "1.0.0")] 2628753dece8SMiguel Ojeda #[inline] 2629753dece8SMiguel Ojeda pub fn dedup(&mut self) { 2630753dece8SMiguel Ojeda self.dedup_by(|a, b| a == b) 2631753dece8SMiguel Ojeda } 2632753dece8SMiguel Ojeda } 2633753dece8SMiguel Ojeda 2634753dece8SMiguel Ojeda //////////////////////////////////////////////////////////////////////////////// 2635753dece8SMiguel Ojeda // Internal methods and functions 2636753dece8SMiguel Ojeda //////////////////////////////////////////////////////////////////////////////// 2637753dece8SMiguel Ojeda 2638753dece8SMiguel Ojeda #[doc(hidden)] 2639753dece8SMiguel Ojeda #[cfg(not(no_global_oom_handling))] 2640753dece8SMiguel Ojeda #[stable(feature = "rust1", since = "1.0.0")] 2641753dece8SMiguel Ojeda pub fn from_elem<T: Clone>(elem: T, n: usize) -> Vec<T> { 2642753dece8SMiguel Ojeda <T as SpecFromElem>::from_elem(elem, n, Global) 2643753dece8SMiguel Ojeda } 2644753dece8SMiguel Ojeda 2645753dece8SMiguel Ojeda #[doc(hidden)] 2646753dece8SMiguel Ojeda #[cfg(not(no_global_oom_handling))] 2647753dece8SMiguel Ojeda #[unstable(feature = "allocator_api", issue = "32838")] 2648753dece8SMiguel Ojeda pub fn from_elem_in<T: Clone, A: Allocator>(elem: T, n: usize, alloc: A) -> Vec<T, A> { 2649753dece8SMiguel Ojeda <T as SpecFromElem>::from_elem(elem, n, alloc) 2650753dece8SMiguel Ojeda } 2651753dece8SMiguel Ojeda 2652753dece8SMiguel Ojeda trait ExtendFromWithinSpec { 2653753dece8SMiguel Ojeda /// # Safety 2654753dece8SMiguel Ojeda /// 2655753dece8SMiguel Ojeda /// - `src` needs to be valid index 2656753dece8SMiguel Ojeda /// - `self.capacity() - self.len()` must be `>= src.len()` 2657753dece8SMiguel Ojeda unsafe fn spec_extend_from_within(&mut self, src: Range<usize>); 2658753dece8SMiguel Ojeda } 2659753dece8SMiguel Ojeda 2660753dece8SMiguel Ojeda impl<T: Clone, A: Allocator> ExtendFromWithinSpec for Vec<T, A> { 2661753dece8SMiguel Ojeda default unsafe fn spec_extend_from_within(&mut self, src: Range<usize>) { 2662753dece8SMiguel Ojeda // SAFETY: 2663753dece8SMiguel Ojeda // - len is increased only after initializing elements 2664753dece8SMiguel Ojeda let (this, spare, len) = unsafe { self.split_at_spare_mut_with_len() }; 2665753dece8SMiguel Ojeda 2666753dece8SMiguel Ojeda // SAFETY: 2667753dece8SMiguel Ojeda // - caller guaratees that src is a valid index 2668753dece8SMiguel Ojeda let to_clone = unsafe { this.get_unchecked(src) }; 2669753dece8SMiguel Ojeda 2670753dece8SMiguel Ojeda iter::zip(to_clone, spare) 2671753dece8SMiguel Ojeda .map(|(src, dst)| dst.write(src.clone())) 2672753dece8SMiguel Ojeda // Note: 2673753dece8SMiguel Ojeda // - Element was just initialized with `MaybeUninit::write`, so it's ok to increase len 2674753dece8SMiguel Ojeda // - len is increased after each element to prevent leaks (see issue #82533) 2675753dece8SMiguel Ojeda .for_each(|_| *len += 1); 2676753dece8SMiguel Ojeda } 2677753dece8SMiguel Ojeda } 2678753dece8SMiguel Ojeda 2679753dece8SMiguel Ojeda impl<T: Copy, A: Allocator> ExtendFromWithinSpec for Vec<T, A> { 2680753dece8SMiguel Ojeda unsafe fn spec_extend_from_within(&mut self, src: Range<usize>) { 2681753dece8SMiguel Ojeda let count = src.len(); 2682753dece8SMiguel Ojeda { 2683753dece8SMiguel Ojeda let (init, spare) = self.split_at_spare_mut(); 2684753dece8SMiguel Ojeda 2685753dece8SMiguel Ojeda // SAFETY: 2686753dece8SMiguel Ojeda // - caller guaratees that `src` is a valid index 2687753dece8SMiguel Ojeda let source = unsafe { init.get_unchecked(src) }; 2688753dece8SMiguel Ojeda 2689753dece8SMiguel Ojeda // SAFETY: 2690753dece8SMiguel Ojeda // - Both pointers are created from unique slice references (`&mut [_]`) 2691753dece8SMiguel Ojeda // so they are valid and do not overlap. 2692753dece8SMiguel Ojeda // - Elements are :Copy so it's OK to to copy them, without doing 2693753dece8SMiguel Ojeda // anything with the original values 2694753dece8SMiguel Ojeda // - `count` is equal to the len of `source`, so source is valid for 2695753dece8SMiguel Ojeda // `count` reads 2696753dece8SMiguel Ojeda // - `.reserve(count)` guarantees that `spare.len() >= count` so spare 2697753dece8SMiguel Ojeda // is valid for `count` writes 2698753dece8SMiguel Ojeda unsafe { ptr::copy_nonoverlapping(source.as_ptr(), spare.as_mut_ptr() as _, count) }; 2699753dece8SMiguel Ojeda } 2700753dece8SMiguel Ojeda 2701753dece8SMiguel Ojeda // SAFETY: 2702753dece8SMiguel Ojeda // - The elements were just initialized by `copy_nonoverlapping` 2703753dece8SMiguel Ojeda self.len += count; 2704753dece8SMiguel Ojeda } 2705753dece8SMiguel Ojeda } 2706753dece8SMiguel Ojeda 2707753dece8SMiguel Ojeda //////////////////////////////////////////////////////////////////////////////// 2708753dece8SMiguel Ojeda // Common trait implementations for Vec 2709753dece8SMiguel Ojeda //////////////////////////////////////////////////////////////////////////////// 2710753dece8SMiguel Ojeda 2711753dece8SMiguel Ojeda #[stable(feature = "rust1", since = "1.0.0")] 2712753dece8SMiguel Ojeda impl<T, A: Allocator> ops::Deref for Vec<T, A> { 2713753dece8SMiguel Ojeda type Target = [T]; 2714753dece8SMiguel Ojeda 2715753dece8SMiguel Ojeda fn deref(&self) -> &[T] { 2716753dece8SMiguel Ojeda unsafe { slice::from_raw_parts(self.as_ptr(), self.len) } 2717753dece8SMiguel Ojeda } 2718753dece8SMiguel Ojeda } 2719753dece8SMiguel Ojeda 2720753dece8SMiguel Ojeda #[stable(feature = "rust1", since = "1.0.0")] 2721753dece8SMiguel Ojeda impl<T, A: Allocator> ops::DerefMut for Vec<T, A> { 2722753dece8SMiguel Ojeda fn deref_mut(&mut self) -> &mut [T] { 2723753dece8SMiguel Ojeda unsafe { slice::from_raw_parts_mut(self.as_mut_ptr(), self.len) } 2724753dece8SMiguel Ojeda } 2725753dece8SMiguel Ojeda } 2726753dece8SMiguel Ojeda 2727753dece8SMiguel Ojeda #[cfg(not(no_global_oom_handling))] 2728753dece8SMiguel Ojeda trait SpecCloneFrom { 2729753dece8SMiguel Ojeda fn clone_from(this: &mut Self, other: &Self); 2730753dece8SMiguel Ojeda } 2731753dece8SMiguel Ojeda 2732753dece8SMiguel Ojeda #[cfg(not(no_global_oom_handling))] 2733753dece8SMiguel Ojeda impl<T: Clone, A: Allocator> SpecCloneFrom for Vec<T, A> { 2734753dece8SMiguel Ojeda default fn clone_from(this: &mut Self, other: &Self) { 2735753dece8SMiguel Ojeda // drop anything that will not be overwritten 2736753dece8SMiguel Ojeda this.truncate(other.len()); 2737753dece8SMiguel Ojeda 2738753dece8SMiguel Ojeda // self.len <= other.len due to the truncate above, so the 2739753dece8SMiguel Ojeda // slices here are always in-bounds. 2740753dece8SMiguel Ojeda let (init, tail) = other.split_at(this.len()); 2741753dece8SMiguel Ojeda 2742753dece8SMiguel Ojeda // reuse the contained values' allocations/resources. 2743753dece8SMiguel Ojeda this.clone_from_slice(init); 2744753dece8SMiguel Ojeda this.extend_from_slice(tail); 2745753dece8SMiguel Ojeda } 2746753dece8SMiguel Ojeda } 2747753dece8SMiguel Ojeda 2748753dece8SMiguel Ojeda #[cfg(not(no_global_oom_handling))] 2749753dece8SMiguel Ojeda impl<T: Copy, A: Allocator> SpecCloneFrom for Vec<T, A> { 2750753dece8SMiguel Ojeda fn clone_from(this: &mut Self, other: &Self) { 2751753dece8SMiguel Ojeda this.clear(); 2752753dece8SMiguel Ojeda this.extend_from_slice(other); 2753753dece8SMiguel Ojeda } 2754753dece8SMiguel Ojeda } 2755753dece8SMiguel Ojeda 2756753dece8SMiguel Ojeda #[cfg(not(no_global_oom_handling))] 2757753dece8SMiguel Ojeda #[stable(feature = "rust1", since = "1.0.0")] 2758753dece8SMiguel Ojeda impl<T: Clone, A: Allocator + Clone> Clone for Vec<T, A> { 2759753dece8SMiguel Ojeda #[cfg(not(test))] 2760753dece8SMiguel Ojeda fn clone(&self) -> Self { 2761753dece8SMiguel Ojeda let alloc = self.allocator().clone(); 2762753dece8SMiguel Ojeda <[T]>::to_vec_in(&**self, alloc) 2763753dece8SMiguel Ojeda } 2764753dece8SMiguel Ojeda 2765753dece8SMiguel Ojeda // HACK(japaric): with cfg(test) the inherent `[T]::to_vec` method, which is 2766753dece8SMiguel Ojeda // required for this method definition, is not available. Instead use the 2767753dece8SMiguel Ojeda // `slice::to_vec` function which is only available with cfg(test) 2768753dece8SMiguel Ojeda // NB see the slice::hack module in slice.rs for more information 2769753dece8SMiguel Ojeda #[cfg(test)] 2770753dece8SMiguel Ojeda fn clone(&self) -> Self { 2771753dece8SMiguel Ojeda let alloc = self.allocator().clone(); 2772753dece8SMiguel Ojeda crate::slice::to_vec(&**self, alloc) 2773753dece8SMiguel Ojeda } 2774753dece8SMiguel Ojeda 2775753dece8SMiguel Ojeda fn clone_from(&mut self, other: &Self) { 2776753dece8SMiguel Ojeda SpecCloneFrom::clone_from(self, other) 2777753dece8SMiguel Ojeda } 2778753dece8SMiguel Ojeda } 2779753dece8SMiguel Ojeda 2780753dece8SMiguel Ojeda /// The hash of a vector is the same as that of the corresponding slice, 2781753dece8SMiguel Ojeda /// as required by the `core::borrow::Borrow` implementation. 2782753dece8SMiguel Ojeda /// 2783753dece8SMiguel Ojeda /// ``` 2784753dece8SMiguel Ojeda /// #![feature(build_hasher_simple_hash_one)] 2785753dece8SMiguel Ojeda /// use std::hash::BuildHasher; 2786753dece8SMiguel Ojeda /// 2787753dece8SMiguel Ojeda /// let b = std::collections::hash_map::RandomState::new(); 2788753dece8SMiguel Ojeda /// let v: Vec<u8> = vec![0xa8, 0x3c, 0x09]; 2789753dece8SMiguel Ojeda /// let s: &[u8] = &[0xa8, 0x3c, 0x09]; 2790753dece8SMiguel Ojeda /// assert_eq!(b.hash_one(v), b.hash_one(s)); 2791753dece8SMiguel Ojeda /// ``` 2792753dece8SMiguel Ojeda #[stable(feature = "rust1", since = "1.0.0")] 2793753dece8SMiguel Ojeda impl<T: Hash, A: Allocator> Hash for Vec<T, A> { 2794753dece8SMiguel Ojeda #[inline] 2795753dece8SMiguel Ojeda fn hash<H: Hasher>(&self, state: &mut H) { 2796753dece8SMiguel Ojeda Hash::hash(&**self, state) 2797753dece8SMiguel Ojeda } 2798753dece8SMiguel Ojeda } 2799753dece8SMiguel Ojeda 2800753dece8SMiguel Ojeda #[stable(feature = "rust1", since = "1.0.0")] 2801753dece8SMiguel Ojeda #[rustc_on_unimplemented( 2802753dece8SMiguel Ojeda message = "vector indices are of type `usize` or ranges of `usize`", 2803753dece8SMiguel Ojeda label = "vector indices are of type `usize` or ranges of `usize`" 2804753dece8SMiguel Ojeda )] 2805753dece8SMiguel Ojeda impl<T, I: SliceIndex<[T]>, A: Allocator> Index<I> for Vec<T, A> { 2806753dece8SMiguel Ojeda type Output = I::Output; 2807753dece8SMiguel Ojeda 2808753dece8SMiguel Ojeda #[inline] 2809753dece8SMiguel Ojeda fn index(&self, index: I) -> &Self::Output { 2810753dece8SMiguel Ojeda Index::index(&**self, index) 2811753dece8SMiguel Ojeda } 2812753dece8SMiguel Ojeda } 2813753dece8SMiguel Ojeda 2814753dece8SMiguel Ojeda #[stable(feature = "rust1", since = "1.0.0")] 2815753dece8SMiguel Ojeda #[rustc_on_unimplemented( 2816753dece8SMiguel Ojeda message = "vector indices are of type `usize` or ranges of `usize`", 2817753dece8SMiguel Ojeda label = "vector indices are of type `usize` or ranges of `usize`" 2818753dece8SMiguel Ojeda )] 2819753dece8SMiguel Ojeda impl<T, I: SliceIndex<[T]>, A: Allocator> IndexMut<I> for Vec<T, A> { 2820753dece8SMiguel Ojeda #[inline] 2821753dece8SMiguel Ojeda fn index_mut(&mut self, index: I) -> &mut Self::Output { 2822753dece8SMiguel Ojeda IndexMut::index_mut(&mut **self, index) 2823753dece8SMiguel Ojeda } 2824753dece8SMiguel Ojeda } 2825753dece8SMiguel Ojeda 2826753dece8SMiguel Ojeda #[cfg(not(no_global_oom_handling))] 2827753dece8SMiguel Ojeda #[stable(feature = "rust1", since = "1.0.0")] 2828753dece8SMiguel Ojeda impl<T> FromIterator<T> for Vec<T> { 2829753dece8SMiguel Ojeda #[inline] 2830753dece8SMiguel Ojeda fn from_iter<I: IntoIterator<Item = T>>(iter: I) -> Vec<T> { 2831753dece8SMiguel Ojeda <Self as SpecFromIter<T, I::IntoIter>>::from_iter(iter.into_iter()) 2832753dece8SMiguel Ojeda } 2833753dece8SMiguel Ojeda } 2834753dece8SMiguel Ojeda 2835753dece8SMiguel Ojeda #[stable(feature = "rust1", since = "1.0.0")] 2836753dece8SMiguel Ojeda impl<T, A: Allocator> IntoIterator for Vec<T, A> { 2837753dece8SMiguel Ojeda type Item = T; 2838753dece8SMiguel Ojeda type IntoIter = IntoIter<T, A>; 2839753dece8SMiguel Ojeda 2840753dece8SMiguel Ojeda /// Creates a consuming iterator, that is, one that moves each value out of 2841753dece8SMiguel Ojeda /// the vector (from start to end). The vector cannot be used after calling 2842753dece8SMiguel Ojeda /// this. 2843753dece8SMiguel Ojeda /// 2844753dece8SMiguel Ojeda /// # Examples 2845753dece8SMiguel Ojeda /// 2846753dece8SMiguel Ojeda /// ``` 2847753dece8SMiguel Ojeda /// let v = vec!["a".to_string(), "b".to_string()]; 2848753dece8SMiguel Ojeda /// for s in v.into_iter() { 2849753dece8SMiguel Ojeda /// // s has type String, not &String 2850753dece8SMiguel Ojeda /// println!("{s}"); 2851753dece8SMiguel Ojeda /// } 2852753dece8SMiguel Ojeda /// ``` 2853753dece8SMiguel Ojeda #[inline] 2854753dece8SMiguel Ojeda fn into_iter(self) -> IntoIter<T, A> { 2855753dece8SMiguel Ojeda unsafe { 2856753dece8SMiguel Ojeda let mut me = ManuallyDrop::new(self); 2857753dece8SMiguel Ojeda let alloc = ManuallyDrop::new(ptr::read(me.allocator())); 2858753dece8SMiguel Ojeda let begin = me.as_mut_ptr(); 2859753dece8SMiguel Ojeda let end = if mem::size_of::<T>() == 0 { 2860753dece8SMiguel Ojeda arith_offset(begin as *const i8, me.len() as isize) as *const T 2861753dece8SMiguel Ojeda } else { 2862753dece8SMiguel Ojeda begin.add(me.len()) as *const T 2863753dece8SMiguel Ojeda }; 2864753dece8SMiguel Ojeda let cap = me.buf.capacity(); 2865753dece8SMiguel Ojeda IntoIter { 2866753dece8SMiguel Ojeda buf: NonNull::new_unchecked(begin), 2867753dece8SMiguel Ojeda phantom: PhantomData, 2868753dece8SMiguel Ojeda cap, 2869753dece8SMiguel Ojeda alloc, 2870753dece8SMiguel Ojeda ptr: begin, 2871753dece8SMiguel Ojeda end, 2872753dece8SMiguel Ojeda } 2873753dece8SMiguel Ojeda } 2874753dece8SMiguel Ojeda } 2875753dece8SMiguel Ojeda } 2876753dece8SMiguel Ojeda 2877753dece8SMiguel Ojeda #[stable(feature = "rust1", since = "1.0.0")] 2878753dece8SMiguel Ojeda impl<'a, T, A: Allocator> IntoIterator for &'a Vec<T, A> { 2879753dece8SMiguel Ojeda type Item = &'a T; 2880753dece8SMiguel Ojeda type IntoIter = slice::Iter<'a, T>; 2881753dece8SMiguel Ojeda 2882753dece8SMiguel Ojeda fn into_iter(self) -> slice::Iter<'a, T> { 2883753dece8SMiguel Ojeda self.iter() 2884753dece8SMiguel Ojeda } 2885753dece8SMiguel Ojeda } 2886753dece8SMiguel Ojeda 2887753dece8SMiguel Ojeda #[stable(feature = "rust1", since = "1.0.0")] 2888753dece8SMiguel Ojeda impl<'a, T, A: Allocator> IntoIterator for &'a mut Vec<T, A> { 2889753dece8SMiguel Ojeda type Item = &'a mut T; 2890753dece8SMiguel Ojeda type IntoIter = slice::IterMut<'a, T>; 2891753dece8SMiguel Ojeda 2892753dece8SMiguel Ojeda fn into_iter(self) -> slice::IterMut<'a, T> { 2893753dece8SMiguel Ojeda self.iter_mut() 2894753dece8SMiguel Ojeda } 2895753dece8SMiguel Ojeda } 2896753dece8SMiguel Ojeda 2897753dece8SMiguel Ojeda #[cfg(not(no_global_oom_handling))] 2898753dece8SMiguel Ojeda #[stable(feature = "rust1", since = "1.0.0")] 2899753dece8SMiguel Ojeda impl<T, A: Allocator> Extend<T> for Vec<T, A> { 2900753dece8SMiguel Ojeda #[inline] 2901753dece8SMiguel Ojeda fn extend<I: IntoIterator<Item = T>>(&mut self, iter: I) { 2902753dece8SMiguel Ojeda <Self as SpecExtend<T, I::IntoIter>>::spec_extend(self, iter.into_iter()) 2903753dece8SMiguel Ojeda } 2904753dece8SMiguel Ojeda 2905753dece8SMiguel Ojeda #[inline] 2906753dece8SMiguel Ojeda fn extend_one(&mut self, item: T) { 2907753dece8SMiguel Ojeda self.push(item); 2908753dece8SMiguel Ojeda } 2909753dece8SMiguel Ojeda 2910753dece8SMiguel Ojeda #[inline] 2911753dece8SMiguel Ojeda fn extend_reserve(&mut self, additional: usize) { 2912753dece8SMiguel Ojeda self.reserve(additional); 2913753dece8SMiguel Ojeda } 2914753dece8SMiguel Ojeda } 2915753dece8SMiguel Ojeda 2916753dece8SMiguel Ojeda impl<T, A: Allocator> Vec<T, A> { 2917753dece8SMiguel Ojeda // leaf method to which various SpecFrom/SpecExtend implementations delegate when 2918753dece8SMiguel Ojeda // they have no further optimizations to apply 2919753dece8SMiguel Ojeda #[cfg(not(no_global_oom_handling))] 2920753dece8SMiguel Ojeda fn extend_desugared<I: Iterator<Item = T>>(&mut self, mut iterator: I) { 2921753dece8SMiguel Ojeda // This is the case for a general iterator. 2922753dece8SMiguel Ojeda // 2923753dece8SMiguel Ojeda // This function should be the moral equivalent of: 2924753dece8SMiguel Ojeda // 2925753dece8SMiguel Ojeda // for item in iterator { 2926753dece8SMiguel Ojeda // self.push(item); 2927753dece8SMiguel Ojeda // } 2928753dece8SMiguel Ojeda while let Some(element) = iterator.next() { 2929753dece8SMiguel Ojeda let len = self.len(); 2930753dece8SMiguel Ojeda if len == self.capacity() { 2931753dece8SMiguel Ojeda let (lower, _) = iterator.size_hint(); 2932753dece8SMiguel Ojeda self.reserve(lower.saturating_add(1)); 2933753dece8SMiguel Ojeda } 2934753dece8SMiguel Ojeda unsafe { 2935753dece8SMiguel Ojeda ptr::write(self.as_mut_ptr().add(len), element); 2936753dece8SMiguel Ojeda // Since next() executes user code which can panic we have to bump the length 2937753dece8SMiguel Ojeda // after each step. 2938753dece8SMiguel Ojeda // NB can't overflow since we would have had to alloc the address space 2939753dece8SMiguel Ojeda self.set_len(len + 1); 2940753dece8SMiguel Ojeda } 2941753dece8SMiguel Ojeda } 2942753dece8SMiguel Ojeda } 2943753dece8SMiguel Ojeda 2944*318c3cc8SMiguel Ojeda // leaf method to which various SpecFrom/SpecExtend implementations delegate when 2945*318c3cc8SMiguel Ojeda // they have no further optimizations to apply 2946*318c3cc8SMiguel Ojeda fn try_extend_desugared<I: Iterator<Item = T>>(&mut self, mut iterator: I) -> Result<(), TryReserveError> { 2947*318c3cc8SMiguel Ojeda // This is the case for a general iterator. 2948*318c3cc8SMiguel Ojeda // 2949*318c3cc8SMiguel Ojeda // This function should be the moral equivalent of: 2950*318c3cc8SMiguel Ojeda // 2951*318c3cc8SMiguel Ojeda // for item in iterator { 2952*318c3cc8SMiguel Ojeda // self.push(item); 2953*318c3cc8SMiguel Ojeda // } 2954*318c3cc8SMiguel Ojeda while let Some(element) = iterator.next() { 2955*318c3cc8SMiguel Ojeda let len = self.len(); 2956*318c3cc8SMiguel Ojeda if len == self.capacity() { 2957*318c3cc8SMiguel Ojeda let (lower, _) = iterator.size_hint(); 2958*318c3cc8SMiguel Ojeda self.try_reserve(lower.saturating_add(1))?; 2959*318c3cc8SMiguel Ojeda } 2960*318c3cc8SMiguel Ojeda unsafe { 2961*318c3cc8SMiguel Ojeda ptr::write(self.as_mut_ptr().add(len), element); 2962*318c3cc8SMiguel Ojeda // Since next() executes user code which can panic we have to bump the length 2963*318c3cc8SMiguel Ojeda // after each step. 2964*318c3cc8SMiguel Ojeda // NB can't overflow since we would have had to alloc the address space 2965*318c3cc8SMiguel Ojeda self.set_len(len + 1); 2966*318c3cc8SMiguel Ojeda } 2967*318c3cc8SMiguel Ojeda } 2968*318c3cc8SMiguel Ojeda 2969*318c3cc8SMiguel Ojeda Ok(()) 2970*318c3cc8SMiguel Ojeda } 2971*318c3cc8SMiguel Ojeda 2972753dece8SMiguel Ojeda /// Creates a splicing iterator that replaces the specified range in the vector 2973753dece8SMiguel Ojeda /// with the given `replace_with` iterator and yields the removed items. 2974753dece8SMiguel Ojeda /// `replace_with` does not need to be the same length as `range`. 2975753dece8SMiguel Ojeda /// 2976753dece8SMiguel Ojeda /// `range` is removed even if the iterator is not consumed until the end. 2977753dece8SMiguel Ojeda /// 2978753dece8SMiguel Ojeda /// It is unspecified how many elements are removed from the vector 2979753dece8SMiguel Ojeda /// if the `Splice` value is leaked. 2980753dece8SMiguel Ojeda /// 2981753dece8SMiguel Ojeda /// The input iterator `replace_with` is only consumed when the `Splice` value is dropped. 2982753dece8SMiguel Ojeda /// 2983753dece8SMiguel Ojeda /// This is optimal if: 2984753dece8SMiguel Ojeda /// 2985753dece8SMiguel Ojeda /// * The tail (elements in the vector after `range`) is empty, 2986753dece8SMiguel Ojeda /// * or `replace_with` yields fewer or equal elements than `range`’s length 2987753dece8SMiguel Ojeda /// * or the lower bound of its `size_hint()` is exact. 2988753dece8SMiguel Ojeda /// 2989753dece8SMiguel Ojeda /// Otherwise, a temporary vector is allocated and the tail is moved twice. 2990753dece8SMiguel Ojeda /// 2991753dece8SMiguel Ojeda /// # Panics 2992753dece8SMiguel Ojeda /// 2993753dece8SMiguel Ojeda /// Panics if the starting point is greater than the end point or if 2994753dece8SMiguel Ojeda /// the end point is greater than the length of the vector. 2995753dece8SMiguel Ojeda /// 2996753dece8SMiguel Ojeda /// # Examples 2997753dece8SMiguel Ojeda /// 2998753dece8SMiguel Ojeda /// ``` 2999753dece8SMiguel Ojeda /// let mut v = vec![1, 2, 3, 4]; 3000753dece8SMiguel Ojeda /// let new = [7, 8, 9]; 3001753dece8SMiguel Ojeda /// let u: Vec<_> = v.splice(1..3, new).collect(); 3002753dece8SMiguel Ojeda /// assert_eq!(v, &[1, 7, 8, 9, 4]); 3003753dece8SMiguel Ojeda /// assert_eq!(u, &[2, 3]); 3004753dece8SMiguel Ojeda /// ``` 3005753dece8SMiguel Ojeda #[cfg(not(no_global_oom_handling))] 3006753dece8SMiguel Ojeda #[inline] 3007753dece8SMiguel Ojeda #[stable(feature = "vec_splice", since = "1.21.0")] 3008753dece8SMiguel Ojeda pub fn splice<R, I>(&mut self, range: R, replace_with: I) -> Splice<'_, I::IntoIter, A> 3009753dece8SMiguel Ojeda where 3010753dece8SMiguel Ojeda R: RangeBounds<usize>, 3011753dece8SMiguel Ojeda I: IntoIterator<Item = T>, 3012753dece8SMiguel Ojeda { 3013753dece8SMiguel Ojeda Splice { drain: self.drain(range), replace_with: replace_with.into_iter() } 3014753dece8SMiguel Ojeda } 3015753dece8SMiguel Ojeda 3016753dece8SMiguel Ojeda /// Creates an iterator which uses a closure to determine if an element should be removed. 3017753dece8SMiguel Ojeda /// 3018753dece8SMiguel Ojeda /// If the closure returns true, then the element is removed and yielded. 3019753dece8SMiguel Ojeda /// If the closure returns false, the element will remain in the vector and will not be yielded 3020753dece8SMiguel Ojeda /// by the iterator. 3021753dece8SMiguel Ojeda /// 3022753dece8SMiguel Ojeda /// Using this method is equivalent to the following code: 3023753dece8SMiguel Ojeda /// 3024753dece8SMiguel Ojeda /// ``` 3025753dece8SMiguel Ojeda /// # let some_predicate = |x: &mut i32| { *x == 2 || *x == 3 || *x == 6 }; 3026753dece8SMiguel Ojeda /// # let mut vec = vec![1, 2, 3, 4, 5, 6]; 3027753dece8SMiguel Ojeda /// let mut i = 0; 3028753dece8SMiguel Ojeda /// while i < vec.len() { 3029753dece8SMiguel Ojeda /// if some_predicate(&mut vec[i]) { 3030753dece8SMiguel Ojeda /// let val = vec.remove(i); 3031753dece8SMiguel Ojeda /// // your code here 3032753dece8SMiguel Ojeda /// } else { 3033753dece8SMiguel Ojeda /// i += 1; 3034753dece8SMiguel Ojeda /// } 3035753dece8SMiguel Ojeda /// } 3036753dece8SMiguel Ojeda /// 3037753dece8SMiguel Ojeda /// # assert_eq!(vec, vec![1, 4, 5]); 3038753dece8SMiguel Ojeda /// ``` 3039753dece8SMiguel Ojeda /// 3040753dece8SMiguel Ojeda /// But `drain_filter` is easier to use. `drain_filter` is also more efficient, 3041753dece8SMiguel Ojeda /// because it can backshift the elements of the array in bulk. 3042753dece8SMiguel Ojeda /// 3043753dece8SMiguel Ojeda /// Note that `drain_filter` also lets you mutate every element in the filter closure, 3044753dece8SMiguel Ojeda /// regardless of whether you choose to keep or remove it. 3045753dece8SMiguel Ojeda /// 3046753dece8SMiguel Ojeda /// # Examples 3047753dece8SMiguel Ojeda /// 3048753dece8SMiguel Ojeda /// Splitting an array into evens and odds, reusing the original allocation: 3049753dece8SMiguel Ojeda /// 3050753dece8SMiguel Ojeda /// ``` 3051753dece8SMiguel Ojeda /// #![feature(drain_filter)] 3052753dece8SMiguel Ojeda /// let mut numbers = vec![1, 2, 3, 4, 5, 6, 8, 9, 11, 13, 14, 15]; 3053753dece8SMiguel Ojeda /// 3054753dece8SMiguel Ojeda /// let evens = numbers.drain_filter(|x| *x % 2 == 0).collect::<Vec<_>>(); 3055753dece8SMiguel Ojeda /// let odds = numbers; 3056753dece8SMiguel Ojeda /// 3057753dece8SMiguel Ojeda /// assert_eq!(evens, vec![2, 4, 6, 8, 14]); 3058753dece8SMiguel Ojeda /// assert_eq!(odds, vec![1, 3, 5, 9, 11, 13, 15]); 3059753dece8SMiguel Ojeda /// ``` 3060753dece8SMiguel Ojeda #[unstable(feature = "drain_filter", reason = "recently added", issue = "43244")] 3061753dece8SMiguel Ojeda pub fn drain_filter<F>(&mut self, filter: F) -> DrainFilter<'_, T, F, A> 3062753dece8SMiguel Ojeda where 3063753dece8SMiguel Ojeda F: FnMut(&mut T) -> bool, 3064753dece8SMiguel Ojeda { 3065753dece8SMiguel Ojeda let old_len = self.len(); 3066753dece8SMiguel Ojeda 3067753dece8SMiguel Ojeda // Guard against us getting leaked (leak amplification) 3068753dece8SMiguel Ojeda unsafe { 3069753dece8SMiguel Ojeda self.set_len(0); 3070753dece8SMiguel Ojeda } 3071753dece8SMiguel Ojeda 3072753dece8SMiguel Ojeda DrainFilter { vec: self, idx: 0, del: 0, old_len, pred: filter, panic_flag: false } 3073753dece8SMiguel Ojeda } 3074753dece8SMiguel Ojeda } 3075753dece8SMiguel Ojeda 3076753dece8SMiguel Ojeda /// Extend implementation that copies elements out of references before pushing them onto the Vec. 3077753dece8SMiguel Ojeda /// 3078753dece8SMiguel Ojeda /// This implementation is specialized for slice iterators, where it uses [`copy_from_slice`] to 3079753dece8SMiguel Ojeda /// append the entire slice at once. 3080753dece8SMiguel Ojeda /// 3081753dece8SMiguel Ojeda /// [`copy_from_slice`]: slice::copy_from_slice 3082753dece8SMiguel Ojeda #[cfg(not(no_global_oom_handling))] 3083753dece8SMiguel Ojeda #[stable(feature = "extend_ref", since = "1.2.0")] 3084753dece8SMiguel Ojeda impl<'a, T: Copy + 'a, A: Allocator + 'a> Extend<&'a T> for Vec<T, A> { 3085753dece8SMiguel Ojeda fn extend<I: IntoIterator<Item = &'a T>>(&mut self, iter: I) { 3086753dece8SMiguel Ojeda self.spec_extend(iter.into_iter()) 3087753dece8SMiguel Ojeda } 3088753dece8SMiguel Ojeda 3089753dece8SMiguel Ojeda #[inline] 3090753dece8SMiguel Ojeda fn extend_one(&mut self, &item: &'a T) { 3091753dece8SMiguel Ojeda self.push(item); 3092753dece8SMiguel Ojeda } 3093753dece8SMiguel Ojeda 3094753dece8SMiguel Ojeda #[inline] 3095753dece8SMiguel Ojeda fn extend_reserve(&mut self, additional: usize) { 3096753dece8SMiguel Ojeda self.reserve(additional); 3097753dece8SMiguel Ojeda } 3098753dece8SMiguel Ojeda } 3099753dece8SMiguel Ojeda 3100753dece8SMiguel Ojeda /// Implements comparison of vectors, [lexicographically](core::cmp::Ord#lexicographical-comparison). 3101753dece8SMiguel Ojeda #[stable(feature = "rust1", since = "1.0.0")] 3102753dece8SMiguel Ojeda impl<T: PartialOrd, A: Allocator> PartialOrd for Vec<T, A> { 3103753dece8SMiguel Ojeda #[inline] 3104753dece8SMiguel Ojeda fn partial_cmp(&self, other: &Self) -> Option<Ordering> { 3105753dece8SMiguel Ojeda PartialOrd::partial_cmp(&**self, &**other) 3106753dece8SMiguel Ojeda } 3107753dece8SMiguel Ojeda } 3108753dece8SMiguel Ojeda 3109753dece8SMiguel Ojeda #[stable(feature = "rust1", since = "1.0.0")] 3110753dece8SMiguel Ojeda impl<T: Eq, A: Allocator> Eq for Vec<T, A> {} 3111753dece8SMiguel Ojeda 3112753dece8SMiguel Ojeda /// Implements ordering of vectors, [lexicographically](core::cmp::Ord#lexicographical-comparison). 3113753dece8SMiguel Ojeda #[stable(feature = "rust1", since = "1.0.0")] 3114753dece8SMiguel Ojeda impl<T: Ord, A: Allocator> Ord for Vec<T, A> { 3115753dece8SMiguel Ojeda #[inline] 3116753dece8SMiguel Ojeda fn cmp(&self, other: &Self) -> Ordering { 3117753dece8SMiguel Ojeda Ord::cmp(&**self, &**other) 3118753dece8SMiguel Ojeda } 3119753dece8SMiguel Ojeda } 3120753dece8SMiguel Ojeda 3121753dece8SMiguel Ojeda #[stable(feature = "rust1", since = "1.0.0")] 3122753dece8SMiguel Ojeda unsafe impl<#[may_dangle] T, A: Allocator> Drop for Vec<T, A> { 3123753dece8SMiguel Ojeda fn drop(&mut self) { 3124753dece8SMiguel Ojeda unsafe { 3125753dece8SMiguel Ojeda // use drop for [T] 3126753dece8SMiguel Ojeda // use a raw slice to refer to the elements of the vector as weakest necessary type; 3127753dece8SMiguel Ojeda // could avoid questions of validity in certain cases 3128753dece8SMiguel Ojeda ptr::drop_in_place(ptr::slice_from_raw_parts_mut(self.as_mut_ptr(), self.len)) 3129753dece8SMiguel Ojeda } 3130753dece8SMiguel Ojeda // RawVec handles deallocation 3131753dece8SMiguel Ojeda } 3132753dece8SMiguel Ojeda } 3133753dece8SMiguel Ojeda 3134753dece8SMiguel Ojeda #[stable(feature = "rust1", since = "1.0.0")] 3135753dece8SMiguel Ojeda #[rustc_const_unstable(feature = "const_default_impls", issue = "87864")] 3136753dece8SMiguel Ojeda impl<T> const Default for Vec<T> { 3137753dece8SMiguel Ojeda /// Creates an empty `Vec<T>`. 3138753dece8SMiguel Ojeda fn default() -> Vec<T> { 3139753dece8SMiguel Ojeda Vec::new() 3140753dece8SMiguel Ojeda } 3141753dece8SMiguel Ojeda } 3142753dece8SMiguel Ojeda 3143753dece8SMiguel Ojeda #[stable(feature = "rust1", since = "1.0.0")] 3144753dece8SMiguel Ojeda impl<T: fmt::Debug, A: Allocator> fmt::Debug for Vec<T, A> { 3145753dece8SMiguel Ojeda fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { 3146753dece8SMiguel Ojeda fmt::Debug::fmt(&**self, f) 3147753dece8SMiguel Ojeda } 3148753dece8SMiguel Ojeda } 3149753dece8SMiguel Ojeda 3150753dece8SMiguel Ojeda #[stable(feature = "rust1", since = "1.0.0")] 3151753dece8SMiguel Ojeda impl<T, A: Allocator> AsRef<Vec<T, A>> for Vec<T, A> { 3152753dece8SMiguel Ojeda fn as_ref(&self) -> &Vec<T, A> { 3153753dece8SMiguel Ojeda self 3154753dece8SMiguel Ojeda } 3155753dece8SMiguel Ojeda } 3156753dece8SMiguel Ojeda 3157753dece8SMiguel Ojeda #[stable(feature = "vec_as_mut", since = "1.5.0")] 3158753dece8SMiguel Ojeda impl<T, A: Allocator> AsMut<Vec<T, A>> for Vec<T, A> { 3159753dece8SMiguel Ojeda fn as_mut(&mut self) -> &mut Vec<T, A> { 3160753dece8SMiguel Ojeda self 3161753dece8SMiguel Ojeda } 3162753dece8SMiguel Ojeda } 3163753dece8SMiguel Ojeda 3164753dece8SMiguel Ojeda #[stable(feature = "rust1", since = "1.0.0")] 3165753dece8SMiguel Ojeda impl<T, A: Allocator> AsRef<[T]> for Vec<T, A> { 3166753dece8SMiguel Ojeda fn as_ref(&self) -> &[T] { 3167753dece8SMiguel Ojeda self 3168753dece8SMiguel Ojeda } 3169753dece8SMiguel Ojeda } 3170753dece8SMiguel Ojeda 3171753dece8SMiguel Ojeda #[stable(feature = "vec_as_mut", since = "1.5.0")] 3172753dece8SMiguel Ojeda impl<T, A: Allocator> AsMut<[T]> for Vec<T, A> { 3173753dece8SMiguel Ojeda fn as_mut(&mut self) -> &mut [T] { 3174753dece8SMiguel Ojeda self 3175753dece8SMiguel Ojeda } 3176753dece8SMiguel Ojeda } 3177753dece8SMiguel Ojeda 3178753dece8SMiguel Ojeda #[cfg(not(no_global_oom_handling))] 3179753dece8SMiguel Ojeda #[stable(feature = "rust1", since = "1.0.0")] 3180753dece8SMiguel Ojeda impl<T: Clone> From<&[T]> for Vec<T> { 3181753dece8SMiguel Ojeda /// Allocate a `Vec<T>` and fill it by cloning `s`'s items. 3182753dece8SMiguel Ojeda /// 3183753dece8SMiguel Ojeda /// # Examples 3184753dece8SMiguel Ojeda /// 3185753dece8SMiguel Ojeda /// ``` 3186753dece8SMiguel Ojeda /// assert_eq!(Vec::from(&[1, 2, 3][..]), vec![1, 2, 3]); 3187753dece8SMiguel Ojeda /// ``` 3188753dece8SMiguel Ojeda #[cfg(not(test))] 3189753dece8SMiguel Ojeda fn from(s: &[T]) -> Vec<T> { 3190753dece8SMiguel Ojeda s.to_vec() 3191753dece8SMiguel Ojeda } 3192753dece8SMiguel Ojeda #[cfg(test)] 3193753dece8SMiguel Ojeda fn from(s: &[T]) -> Vec<T> { 3194753dece8SMiguel Ojeda crate::slice::to_vec(s, Global) 3195753dece8SMiguel Ojeda } 3196753dece8SMiguel Ojeda } 3197753dece8SMiguel Ojeda 3198753dece8SMiguel Ojeda #[cfg(not(no_global_oom_handling))] 3199753dece8SMiguel Ojeda #[stable(feature = "vec_from_mut", since = "1.19.0")] 3200753dece8SMiguel Ojeda impl<T: Clone> From<&mut [T]> for Vec<T> { 3201753dece8SMiguel Ojeda /// Allocate a `Vec<T>` and fill it by cloning `s`'s items. 3202753dece8SMiguel Ojeda /// 3203753dece8SMiguel Ojeda /// # Examples 3204753dece8SMiguel Ojeda /// 3205753dece8SMiguel Ojeda /// ``` 3206753dece8SMiguel Ojeda /// assert_eq!(Vec::from(&mut [1, 2, 3][..]), vec![1, 2, 3]); 3207753dece8SMiguel Ojeda /// ``` 3208753dece8SMiguel Ojeda #[cfg(not(test))] 3209753dece8SMiguel Ojeda fn from(s: &mut [T]) -> Vec<T> { 3210753dece8SMiguel Ojeda s.to_vec() 3211753dece8SMiguel Ojeda } 3212753dece8SMiguel Ojeda #[cfg(test)] 3213753dece8SMiguel Ojeda fn from(s: &mut [T]) -> Vec<T> { 3214753dece8SMiguel Ojeda crate::slice::to_vec(s, Global) 3215753dece8SMiguel Ojeda } 3216753dece8SMiguel Ojeda } 3217753dece8SMiguel Ojeda 3218753dece8SMiguel Ojeda #[cfg(not(no_global_oom_handling))] 3219753dece8SMiguel Ojeda #[stable(feature = "vec_from_array", since = "1.44.0")] 3220753dece8SMiguel Ojeda impl<T, const N: usize> From<[T; N]> for Vec<T> { 3221753dece8SMiguel Ojeda /// Allocate a `Vec<T>` and move `s`'s items into it. 3222753dece8SMiguel Ojeda /// 3223753dece8SMiguel Ojeda /// # Examples 3224753dece8SMiguel Ojeda /// 3225753dece8SMiguel Ojeda /// ``` 3226753dece8SMiguel Ojeda /// assert_eq!(Vec::from([1, 2, 3]), vec![1, 2, 3]); 3227753dece8SMiguel Ojeda /// ``` 3228753dece8SMiguel Ojeda #[cfg(not(test))] 3229753dece8SMiguel Ojeda fn from(s: [T; N]) -> Vec<T> { 3230753dece8SMiguel Ojeda <[T]>::into_vec(box s) 3231753dece8SMiguel Ojeda } 3232753dece8SMiguel Ojeda 3233753dece8SMiguel Ojeda #[cfg(test)] 3234753dece8SMiguel Ojeda fn from(s: [T; N]) -> Vec<T> { 3235753dece8SMiguel Ojeda crate::slice::into_vec(box s) 3236753dece8SMiguel Ojeda } 3237753dece8SMiguel Ojeda } 3238753dece8SMiguel Ojeda 32398909a80eSMiguel Ojeda #[cfg(not(no_borrow))] 3240753dece8SMiguel Ojeda #[stable(feature = "vec_from_cow_slice", since = "1.14.0")] 3241753dece8SMiguel Ojeda impl<'a, T> From<Cow<'a, [T]>> for Vec<T> 3242753dece8SMiguel Ojeda where 3243753dece8SMiguel Ojeda [T]: ToOwned<Owned = Vec<T>>, 3244753dece8SMiguel Ojeda { 3245753dece8SMiguel Ojeda /// Convert a clone-on-write slice into a vector. 3246753dece8SMiguel Ojeda /// 3247753dece8SMiguel Ojeda /// If `s` already owns a `Vec<T>`, it will be returned directly. 3248753dece8SMiguel Ojeda /// If `s` is borrowing a slice, a new `Vec<T>` will be allocated and 3249753dece8SMiguel Ojeda /// filled by cloning `s`'s items into it. 3250753dece8SMiguel Ojeda /// 3251753dece8SMiguel Ojeda /// # Examples 3252753dece8SMiguel Ojeda /// 3253753dece8SMiguel Ojeda /// ``` 3254753dece8SMiguel Ojeda /// # use std::borrow::Cow; 3255753dece8SMiguel Ojeda /// let o: Cow<[i32]> = Cow::Owned(vec![1, 2, 3]); 3256753dece8SMiguel Ojeda /// let b: Cow<[i32]> = Cow::Borrowed(&[1, 2, 3]); 3257753dece8SMiguel Ojeda /// assert_eq!(Vec::from(o), Vec::from(b)); 3258753dece8SMiguel Ojeda /// ``` 3259753dece8SMiguel Ojeda fn from(s: Cow<'a, [T]>) -> Vec<T> { 3260753dece8SMiguel Ojeda s.into_owned() 3261753dece8SMiguel Ojeda } 3262753dece8SMiguel Ojeda } 3263753dece8SMiguel Ojeda 3264753dece8SMiguel Ojeda // note: test pulls in libstd, which causes errors here 3265753dece8SMiguel Ojeda #[cfg(not(test))] 3266753dece8SMiguel Ojeda #[stable(feature = "vec_from_box", since = "1.18.0")] 3267753dece8SMiguel Ojeda impl<T, A: Allocator> From<Box<[T], A>> for Vec<T, A> { 3268753dece8SMiguel Ojeda /// Convert a boxed slice into a vector by transferring ownership of 3269753dece8SMiguel Ojeda /// the existing heap allocation. 3270753dece8SMiguel Ojeda /// 3271753dece8SMiguel Ojeda /// # Examples 3272753dece8SMiguel Ojeda /// 3273753dece8SMiguel Ojeda /// ``` 3274753dece8SMiguel Ojeda /// let b: Box<[i32]> = vec![1, 2, 3].into_boxed_slice(); 3275753dece8SMiguel Ojeda /// assert_eq!(Vec::from(b), vec![1, 2, 3]); 3276753dece8SMiguel Ojeda /// ``` 3277753dece8SMiguel Ojeda fn from(s: Box<[T], A>) -> Self { 3278753dece8SMiguel Ojeda s.into_vec() 3279753dece8SMiguel Ojeda } 3280753dece8SMiguel Ojeda } 3281753dece8SMiguel Ojeda 3282753dece8SMiguel Ojeda // note: test pulls in libstd, which causes errors here 3283753dece8SMiguel Ojeda #[cfg(not(no_global_oom_handling))] 3284753dece8SMiguel Ojeda #[cfg(not(test))] 3285753dece8SMiguel Ojeda #[stable(feature = "box_from_vec", since = "1.20.0")] 3286753dece8SMiguel Ojeda impl<T, A: Allocator> From<Vec<T, A>> for Box<[T], A> { 3287753dece8SMiguel Ojeda /// Convert a vector into a boxed slice. 3288753dece8SMiguel Ojeda /// 3289753dece8SMiguel Ojeda /// If `v` has excess capacity, its items will be moved into a 3290753dece8SMiguel Ojeda /// newly-allocated buffer with exactly the right capacity. 3291753dece8SMiguel Ojeda /// 3292753dece8SMiguel Ojeda /// # Examples 3293753dece8SMiguel Ojeda /// 3294753dece8SMiguel Ojeda /// ``` 3295753dece8SMiguel Ojeda /// assert_eq!(Box::from(vec![1, 2, 3]), vec![1, 2, 3].into_boxed_slice()); 3296753dece8SMiguel Ojeda /// ``` 3297753dece8SMiguel Ojeda fn from(v: Vec<T, A>) -> Self { 3298753dece8SMiguel Ojeda v.into_boxed_slice() 3299753dece8SMiguel Ojeda } 3300753dece8SMiguel Ojeda } 3301753dece8SMiguel Ojeda 3302753dece8SMiguel Ojeda #[cfg(not(no_global_oom_handling))] 3303753dece8SMiguel Ojeda #[stable(feature = "rust1", since = "1.0.0")] 3304753dece8SMiguel Ojeda impl From<&str> for Vec<u8> { 3305753dece8SMiguel Ojeda /// Allocate a `Vec<u8>` and fill it with a UTF-8 string. 3306753dece8SMiguel Ojeda /// 3307753dece8SMiguel Ojeda /// # Examples 3308753dece8SMiguel Ojeda /// 3309753dece8SMiguel Ojeda /// ``` 3310753dece8SMiguel Ojeda /// assert_eq!(Vec::from("123"), vec![b'1', b'2', b'3']); 3311753dece8SMiguel Ojeda /// ``` 3312753dece8SMiguel Ojeda fn from(s: &str) -> Vec<u8> { 3313753dece8SMiguel Ojeda From::from(s.as_bytes()) 3314753dece8SMiguel Ojeda } 3315753dece8SMiguel Ojeda } 3316753dece8SMiguel Ojeda 3317753dece8SMiguel Ojeda #[stable(feature = "array_try_from_vec", since = "1.48.0")] 3318753dece8SMiguel Ojeda impl<T, A: Allocator, const N: usize> TryFrom<Vec<T, A>> for [T; N] { 3319753dece8SMiguel Ojeda type Error = Vec<T, A>; 3320753dece8SMiguel Ojeda 3321753dece8SMiguel Ojeda /// Gets the entire contents of the `Vec<T>` as an array, 3322753dece8SMiguel Ojeda /// if its size exactly matches that of the requested array. 3323753dece8SMiguel Ojeda /// 3324753dece8SMiguel Ojeda /// # Examples 3325753dece8SMiguel Ojeda /// 3326753dece8SMiguel Ojeda /// ``` 3327753dece8SMiguel Ojeda /// assert_eq!(vec![1, 2, 3].try_into(), Ok([1, 2, 3])); 3328753dece8SMiguel Ojeda /// assert_eq!(<Vec<i32>>::new().try_into(), Ok([])); 3329753dece8SMiguel Ojeda /// ``` 3330753dece8SMiguel Ojeda /// 3331753dece8SMiguel Ojeda /// If the length doesn't match, the input comes back in `Err`: 3332753dece8SMiguel Ojeda /// ``` 3333753dece8SMiguel Ojeda /// let r: Result<[i32; 4], _> = (0..10).collect::<Vec<_>>().try_into(); 3334753dece8SMiguel Ojeda /// assert_eq!(r, Err(vec![0, 1, 2, 3, 4, 5, 6, 7, 8, 9])); 3335753dece8SMiguel Ojeda /// ``` 3336753dece8SMiguel Ojeda /// 3337753dece8SMiguel Ojeda /// If you're fine with just getting a prefix of the `Vec<T>`, 3338753dece8SMiguel Ojeda /// you can call [`.truncate(N)`](Vec::truncate) first. 3339753dece8SMiguel Ojeda /// ``` 3340753dece8SMiguel Ojeda /// let mut v = String::from("hello world").into_bytes(); 3341753dece8SMiguel Ojeda /// v.sort(); 3342753dece8SMiguel Ojeda /// v.truncate(2); 3343753dece8SMiguel Ojeda /// let [a, b]: [_; 2] = v.try_into().unwrap(); 3344753dece8SMiguel Ojeda /// assert_eq!(a, b' '); 3345753dece8SMiguel Ojeda /// assert_eq!(b, b'd'); 3346753dece8SMiguel Ojeda /// ``` 3347753dece8SMiguel Ojeda fn try_from(mut vec: Vec<T, A>) -> Result<[T; N], Vec<T, A>> { 3348753dece8SMiguel Ojeda if vec.len() != N { 3349753dece8SMiguel Ojeda return Err(vec); 3350753dece8SMiguel Ojeda } 3351753dece8SMiguel Ojeda 3352753dece8SMiguel Ojeda // SAFETY: `.set_len(0)` is always sound. 3353753dece8SMiguel Ojeda unsafe { vec.set_len(0) }; 3354753dece8SMiguel Ojeda 3355753dece8SMiguel Ojeda // SAFETY: A `Vec`'s pointer is always aligned properly, and 3356753dece8SMiguel Ojeda // the alignment the array needs is the same as the items. 3357753dece8SMiguel Ojeda // We checked earlier that we have sufficient items. 3358753dece8SMiguel Ojeda // The items will not double-drop as the `set_len` 3359753dece8SMiguel Ojeda // tells the `Vec` not to also drop them. 3360753dece8SMiguel Ojeda let array = unsafe { ptr::read(vec.as_ptr() as *const [T; N]) }; 3361753dece8SMiguel Ojeda Ok(array) 3362753dece8SMiguel Ojeda } 3363753dece8SMiguel Ojeda } 3364