1 //! A double-ended queue implemented with a growable ring buffer.
3 //! This queue has *O*(1) amortized inserts and removals from both ends of the
4 //! container. It also has *O*(1) indexing like a vector. The contained elements
5 //! are not required to be copyable, and the queue will be sendable if the
6 //! contained type is sendable.
8 #![stable(feature = "rust1", since = "1.0.0")]
10 use core::cmp::{self, Ordering};
12 use core::hash::{Hash, Hasher};
13 use core::iter::{repeat_with, FromIterator};
14 use core::marker::PhantomData;
15 use core::mem::{self, ManuallyDrop};
16 use core::ops::{Index, IndexMut, Range, RangeBounds};
17 use core::ptr::{self, NonNull};
20 use crate::collections::TryReserveError;
21 use crate::raw_vec::RawVec;
27 #[stable(feature = "drain", since = "1.6.0")]
28 pub use self::drain::Drain;
32 #[stable(feature = "rust1", since = "1.0.0")]
33 pub use self::iter_mut::IterMut;
37 #[stable(feature = "rust1", since = "1.0.0")]
38 pub use self::into_iter::IntoIter;
42 #[stable(feature = "rust1", since = "1.0.0")]
43 pub use self::iter::Iter;
47 use self::pair_slices::PairSlices;
51 use self::ring_slices::RingSlices;
58 const INITIAL_CAPACITY: usize = 7; // 2^3 - 1
59 const MINIMUM_CAPACITY: usize = 1; // 2 - 1
61 const MAXIMUM_ZST_CAPACITY: usize = 1 << (core::mem::size_of::<usize>() * 8 - 1); // Largest possible power of two
63 /// A double-ended queue implemented with a growable ring buffer.
65 /// The "default" usage of this type as a queue is to use [`push_back`] to add to
66 /// the queue, and [`pop_front`] to remove from the queue. [`extend`] and [`append`]
67 /// push onto the back in this manner, and iterating over `VecDeque` goes front
70 /// Since `VecDeque` is a ring buffer, its elements are not necessarily contiguous
71 /// in memory. If you want to access the elements as a single slice, such as for
72 /// efficient sorting, you can use [`make_contiguous`]. It rotates the `VecDeque`
73 /// so that its elements do not wrap, and returns a mutable slice to the
74 /// now-contiguous element sequence.
76 /// [`push_back`]: VecDeque::push_back
77 /// [`pop_front`]: VecDeque::pop_front
78 /// [`extend`]: VecDeque::extend
79 /// [`append`]: VecDeque::append
80 /// [`make_contiguous`]: VecDeque::make_contiguous
81 #[cfg_attr(not(test), rustc_diagnostic_item = "vecdeque_type")]
82 #[stable(feature = "rust1", since = "1.0.0")]
83 pub struct VecDeque<T> {
84 // tail and head are pointers into the buffer. Tail always points
85 // to the first element that could be read, Head always points
86 // to where data should be written.
87 // If tail == head the buffer is empty. The length of the ringbuffer
88 // is defined as the distance between the two.
94 #[stable(feature = "rust1", since = "1.0.0")]
95 impl<T: Clone> Clone for VecDeque<T> {
96 fn clone(&self) -> VecDeque<T> {
97 self.iter().cloned().collect()
100 fn clone_from(&mut self, other: &Self) {
101 self.truncate(other.len());
103 let mut iter = PairSlices::from(self, other);
104 while let Some((dst, src)) = iter.next() {
105 dst.clone_from_slice(&src);
108 if iter.has_remainder() {
109 for remainder in iter.remainder() {
110 self.extend(remainder.iter().cloned());
116 #[stable(feature = "rust1", since = "1.0.0")]
117 unsafe impl<#[may_dangle] T> Drop for VecDeque<T> {
119 /// Runs the destructor for all items in the slice when it gets dropped (normally or
120 /// during unwinding).
121 struct Dropper<'a, T>(&'a mut [T]);
123 impl<'a, T> Drop for Dropper<'a, T> {
126 ptr::drop_in_place(self.0);
131 let (front, back) = self.as_mut_slices();
133 let _back_dropper = Dropper(back);
135 ptr::drop_in_place(front);
137 // RawVec handles deallocation
141 #[stable(feature = "rust1", since = "1.0.0")]
142 impl<T> Default for VecDeque<T> {
143 /// Creates an empty `VecDeque<T>`.
145 fn default() -> VecDeque<T> {
150 impl<T> VecDeque<T> {
151 /// Marginally more convenient
153 fn ptr(&self) -> *mut T {
157 /// Marginally more convenient
159 fn cap(&self) -> usize {
160 if mem::size_of::<T>() == 0 {
161 // For zero sized types, we are always at maximum capacity
168 /// Turn ptr into a slice
170 unsafe fn buffer_as_slice(&self) -> &[T] {
171 unsafe { slice::from_raw_parts(self.ptr(), self.cap()) }
174 /// Turn ptr into a mut slice
176 unsafe fn buffer_as_mut_slice(&mut self) -> &mut [T] {
177 unsafe { slice::from_raw_parts_mut(self.ptr(), self.cap()) }
180 /// Moves an element out of the buffer
182 unsafe fn buffer_read(&mut self, off: usize) -> T {
183 unsafe { ptr::read(self.ptr().add(off)) }
186 /// Writes an element into the buffer, moving it.
188 unsafe fn buffer_write(&mut self, off: usize, value: T) {
190 ptr::write(self.ptr().add(off), value);
194 /// Returns `true` if the buffer is at full capacity.
196 fn is_full(&self) -> bool {
197 self.cap() - self.len() == 1
200 /// Returns the index in the underlying buffer for a given logical element
203 fn wrap_index(&self, idx: usize) -> usize {
204 wrap_index(idx, self.cap())
207 /// Returns the index in the underlying buffer for a given logical element
210 fn wrap_add(&self, idx: usize, addend: usize) -> usize {
211 wrap_index(idx.wrapping_add(addend), self.cap())
214 /// Returns the index in the underlying buffer for a given logical element
215 /// index - subtrahend.
217 fn wrap_sub(&self, idx: usize, subtrahend: usize) -> usize {
218 wrap_index(idx.wrapping_sub(subtrahend), self.cap())
221 /// Copies a contiguous block of memory len long from src to dst
223 unsafe fn copy(&self, dst: usize, src: usize, len: usize) {
225 dst + len <= self.cap(),
226 "cpy dst={} src={} len={} cap={}",
233 src + len <= self.cap(),
234 "cpy dst={} src={} len={} cap={}",
241 ptr::copy(self.ptr().add(src), self.ptr().add(dst), len);
245 /// Copies a contiguous block of memory len long from src to dst
247 unsafe fn copy_nonoverlapping(&self, dst: usize, src: usize, len: usize) {
249 dst + len <= self.cap(),
250 "cno dst={} src={} len={} cap={}",
257 src + len <= self.cap(),
258 "cno dst={} src={} len={} cap={}",
265 ptr::copy_nonoverlapping(self.ptr().add(src), self.ptr().add(dst), len);
269 /// Copies a potentially wrapping block of memory len long from src to dest.
270 /// (abs(dst - src) + len) must be no larger than cap() (There must be at
271 /// most one continuous overlapping region between src and dest).
272 unsafe fn wrap_copy(&self, dst: usize, src: usize, len: usize) {
274 fn diff(a: usize, b: usize) -> usize {
275 if a <= b { b - a } else { a - b }
278 cmp::min(diff(dst, src), self.cap() - diff(dst, src)) + len <= self.cap(),
279 "wrc dst={} src={} len={} cap={}",
286 if src == dst || len == 0 {
290 let dst_after_src = self.wrap_sub(dst, src) < len;
292 let src_pre_wrap_len = self.cap() - src;
293 let dst_pre_wrap_len = self.cap() - dst;
294 let src_wraps = src_pre_wrap_len < len;
295 let dst_wraps = dst_pre_wrap_len < len;
297 match (dst_after_src, src_wraps, dst_wraps) {
298 (_, false, false) => {
299 // src doesn't wrap, dst doesn't wrap
302 // 1 [_ _ A A B B C C _]
303 // 2 [_ _ A A A A B B _]
307 self.copy(dst, src, len);
310 (false, false, true) => {
311 // dst before src, src doesn't wrap, dst wraps
314 // 1 [A A B B _ _ _ C C]
315 // 2 [A A B B _ _ _ A A]
316 // 3 [B B B B _ _ _ A A]
320 self.copy(dst, src, dst_pre_wrap_len);
321 self.copy(0, src + dst_pre_wrap_len, len - dst_pre_wrap_len);
324 (true, false, true) => {
325 // src before dst, src doesn't wrap, dst wraps
328 // 1 [C C _ _ _ A A B B]
329 // 2 [B B _ _ _ A A B B]
330 // 3 [B B _ _ _ A A A A]
334 self.copy(0, src + dst_pre_wrap_len, len - dst_pre_wrap_len);
335 self.copy(dst, src, dst_pre_wrap_len);
338 (false, true, false) => {
339 // dst before src, src wraps, dst doesn't wrap
342 // 1 [C C _ _ _ A A B B]
343 // 2 [C C _ _ _ B B B B]
344 // 3 [C C _ _ _ B B C C]
348 self.copy(dst, src, src_pre_wrap_len);
349 self.copy(dst + src_pre_wrap_len, 0, len - src_pre_wrap_len);
352 (true, true, false) => {
353 // src before dst, src wraps, dst doesn't wrap
356 // 1 [A A B B _ _ _ C C]
357 // 2 [A A A A _ _ _ C C]
358 // 3 [C C A A _ _ _ C C]
362 self.copy(dst + src_pre_wrap_len, 0, len - src_pre_wrap_len);
363 self.copy(dst, src, src_pre_wrap_len);
366 (false, true, true) => {
367 // dst before src, src wraps, dst wraps
370 // 1 [A B C D _ E F G H]
371 // 2 [A B C D _ E G H H]
372 // 3 [A B C D _ E G H A]
373 // 4 [B C C D _ E G H A]
376 debug_assert!(dst_pre_wrap_len > src_pre_wrap_len);
377 let delta = dst_pre_wrap_len - src_pre_wrap_len;
379 self.copy(dst, src, src_pre_wrap_len);
380 self.copy(dst + src_pre_wrap_len, 0, delta);
381 self.copy(0, delta, len - dst_pre_wrap_len);
384 (true, true, true) => {
385 // src before dst, src wraps, dst wraps
388 // 1 [A B C D _ E F G H]
389 // 2 [A A B D _ E F G H]
390 // 3 [H A B D _ E F G H]
391 // 4 [H A B D _ E F F G]
394 debug_assert!(src_pre_wrap_len > dst_pre_wrap_len);
395 let delta = src_pre_wrap_len - dst_pre_wrap_len;
397 self.copy(delta, 0, len - src_pre_wrap_len);
398 self.copy(0, self.cap() - delta, delta);
399 self.copy(dst, src, dst_pre_wrap_len);
405 /// Frobs the head and tail sections around to handle the fact that we
406 /// just reallocated. Unsafe because it trusts old_capacity.
408 unsafe fn handle_capacity_increase(&mut self, old_capacity: usize) {
409 let new_capacity = self.cap();
411 // Move the shortest contiguous section of the ring buffer
413 // [o o o o o o o . ]
415 // A [o o o o o o o . . . . . . . . . ]
417 // [o o . o o o o o ]
419 // B [. . . o o o o o o o . . . . . . ]
421 // [o o o o o . o o ]
423 // C [o o o o o . . . . . . . . . o o ]
425 if self.tail <= self.head {
428 } else if self.head < old_capacity - self.tail {
431 self.copy_nonoverlapping(old_capacity, 0, self.head);
433 self.head += old_capacity;
434 debug_assert!(self.head > self.tail);
437 let new_tail = new_capacity - (old_capacity - self.tail);
439 self.copy_nonoverlapping(new_tail, self.tail, old_capacity - self.tail);
441 self.tail = new_tail;
442 debug_assert!(self.head < self.tail);
444 debug_assert!(self.head < self.cap());
445 debug_assert!(self.tail < self.cap());
446 debug_assert!(self.cap().count_ones() == 1);
450 impl<T> VecDeque<T> {
451 /// Creates an empty `VecDeque`.
456 /// use std::collections::VecDeque;
458 /// let vector: VecDeque<u32> = VecDeque::new();
460 #[stable(feature = "rust1", since = "1.0.0")]
461 pub fn new() -> VecDeque<T> {
462 VecDeque::with_capacity(INITIAL_CAPACITY)
465 /// Creates an empty `VecDeque` with space for at least `capacity` elements.
470 /// use std::collections::VecDeque;
472 /// let vector: VecDeque<u32> = VecDeque::with_capacity(10);
474 #[stable(feature = "rust1", since = "1.0.0")]
475 pub fn with_capacity(capacity: usize) -> VecDeque<T> {
476 // +1 since the ringbuffer always leaves one space empty
477 let cap = cmp::max(capacity + 1, MINIMUM_CAPACITY + 1).next_power_of_two();
478 assert!(cap > capacity, "capacity overflow");
480 VecDeque { tail: 0, head: 0, buf: RawVec::with_capacity(cap) }
483 /// Provides a reference to the element at the given index.
485 /// Element at index 0 is the front of the queue.
490 /// use std::collections::VecDeque;
492 /// let mut buf = VecDeque::new();
493 /// buf.push_back(3);
494 /// buf.push_back(4);
495 /// buf.push_back(5);
496 /// assert_eq!(buf.get(1), Some(&4));
498 #[stable(feature = "rust1", since = "1.0.0")]
499 pub fn get(&self, index: usize) -> Option<&T> {
500 if index < self.len() {
501 let idx = self.wrap_add(self.tail, index);
502 unsafe { Some(&*self.ptr().add(idx)) }
508 /// Provides a mutable reference to the element at the given index.
510 /// Element at index 0 is the front of the queue.
515 /// use std::collections::VecDeque;
517 /// let mut buf = VecDeque::new();
518 /// buf.push_back(3);
519 /// buf.push_back(4);
520 /// buf.push_back(5);
521 /// if let Some(elem) = buf.get_mut(1) {
525 /// assert_eq!(buf[1], 7);
527 #[stable(feature = "rust1", since = "1.0.0")]
528 pub fn get_mut(&mut self, index: usize) -> Option<&mut T> {
529 if index < self.len() {
530 let idx = self.wrap_add(self.tail, index);
531 unsafe { Some(&mut *self.ptr().add(idx)) }
537 /// Swaps elements at indices `i` and `j`.
539 /// `i` and `j` may be equal.
541 /// Element at index 0 is the front of the queue.
545 /// Panics if either index is out of bounds.
550 /// use std::collections::VecDeque;
552 /// let mut buf = VecDeque::new();
553 /// buf.push_back(3);
554 /// buf.push_back(4);
555 /// buf.push_back(5);
556 /// assert_eq!(buf, [3, 4, 5]);
558 /// assert_eq!(buf, [5, 4, 3]);
560 #[stable(feature = "rust1", since = "1.0.0")]
561 pub fn swap(&mut self, i: usize, j: usize) {
562 assert!(i < self.len());
563 assert!(j < self.len());
564 let ri = self.wrap_add(self.tail, i);
565 let rj = self.wrap_add(self.tail, j);
566 unsafe { ptr::swap(self.ptr().add(ri), self.ptr().add(rj)) }
569 /// Returns the number of elements the `VecDeque` can hold without
575 /// use std::collections::VecDeque;
577 /// let buf: VecDeque<i32> = VecDeque::with_capacity(10);
578 /// assert!(buf.capacity() >= 10);
581 #[stable(feature = "rust1", since = "1.0.0")]
582 pub fn capacity(&self) -> usize {
586 /// Reserves the minimum capacity for exactly `additional` more elements to be inserted in the
587 /// given `VecDeque`. Does nothing if the capacity is already sufficient.
589 /// Note that the allocator may give the collection more space than it requests. Therefore
590 /// capacity can not be relied upon to be precisely minimal. Prefer [`reserve`] if future
591 /// insertions are expected.
595 /// Panics if the new capacity overflows `usize`.
600 /// use std::collections::VecDeque;
602 /// let mut buf: VecDeque<i32> = vec![1].into_iter().collect();
603 /// buf.reserve_exact(10);
604 /// assert!(buf.capacity() >= 11);
607 /// [`reserve`]: VecDeque::reserve
608 #[stable(feature = "rust1", since = "1.0.0")]
609 pub fn reserve_exact(&mut self, additional: usize) {
610 self.reserve(additional);
613 /// Reserves capacity for at least `additional` more elements to be inserted in the given
614 /// `VecDeque`. The collection may reserve more space to avoid frequent reallocations.
618 /// Panics if the new capacity overflows `usize`.
623 /// use std::collections::VecDeque;
625 /// let mut buf: VecDeque<i32> = vec![1].into_iter().collect();
627 /// assert!(buf.capacity() >= 11);
629 #[stable(feature = "rust1", since = "1.0.0")]
630 pub fn reserve(&mut self, additional: usize) {
631 let old_cap = self.cap();
632 let used_cap = self.len() + 1;
633 let new_cap = used_cap
634 .checked_add(additional)
635 .and_then(|needed_cap| needed_cap.checked_next_power_of_two())
636 .expect("capacity overflow");
638 if new_cap > old_cap {
639 self.buf.reserve_exact(used_cap, new_cap - used_cap);
641 self.handle_capacity_increase(old_cap);
646 /// Tries to reserve the minimum capacity for exactly `additional` more elements to
647 /// be inserted in the given `VecDeque<T>`. After calling `try_reserve_exact`,
648 /// capacity will be greater than or equal to `self.len() + additional`.
649 /// Does nothing if the capacity is already sufficient.
651 /// Note that the allocator may give the collection more space than it
652 /// requests. Therefore, capacity can not be relied upon to be precisely
653 /// minimal. Prefer `reserve` if future insertions are expected.
657 /// If the capacity overflows `usize`, or the allocator reports a failure, then an error
663 /// #![feature(try_reserve)]
664 /// use std::collections::TryReserveError;
665 /// use std::collections::VecDeque;
667 /// fn process_data(data: &[u32]) -> Result<VecDeque<u32>, TryReserveError> {
668 /// let mut output = VecDeque::new();
670 /// // Pre-reserve the memory, exiting if we can't
671 /// output.try_reserve_exact(data.len())?;
673 /// // Now we know this can't OOM(Out-Of-Memory) in the middle of our complex work
674 /// output.extend(data.iter().map(|&val| {
675 /// val * 2 + 5 // very complicated
680 /// # process_data(&[1, 2, 3]).expect("why is the test harness OOMing on 12 bytes?");
682 #[unstable(feature = "try_reserve", reason = "new API", issue = "48043")]
683 pub fn try_reserve_exact(&mut self, additional: usize) -> Result<(), TryReserveError> {
684 self.try_reserve(additional)
687 /// Tries to reserve capacity for at least `additional` more elements to be inserted
688 /// in the given `VecDeque<T>`. The collection may reserve more space to avoid
689 /// frequent reallocations. After calling `try_reserve`, capacity will be
690 /// greater than or equal to `self.len() + additional`. Does nothing if
691 /// capacity is already sufficient.
695 /// If the capacity overflows `usize`, or the allocator reports a failure, then an error
701 /// #![feature(try_reserve)]
702 /// use std::collections::TryReserveError;
703 /// use std::collections::VecDeque;
705 /// fn process_data(data: &[u32]) -> Result<VecDeque<u32>, TryReserveError> {
706 /// let mut output = VecDeque::new();
708 /// // Pre-reserve the memory, exiting if we can't
709 /// output.try_reserve(data.len())?;
711 /// // Now we know this can't OOM in the middle of our complex work
712 /// output.extend(data.iter().map(|&val| {
713 /// val * 2 + 5 // very complicated
718 /// # process_data(&[1, 2, 3]).expect("why is the test harness OOMing on 12 bytes?");
720 #[unstable(feature = "try_reserve", reason = "new API", issue = "48043")]
721 pub fn try_reserve(&mut self, additional: usize) -> Result<(), TryReserveError> {
722 let old_cap = self.cap();
723 let used_cap = self.len() + 1;
724 let new_cap = used_cap
725 .checked_add(additional)
726 .and_then(|needed_cap| needed_cap.checked_next_power_of_two())
727 .ok_or(TryReserveError::CapacityOverflow)?;
729 if new_cap > old_cap {
730 self.buf.try_reserve_exact(used_cap, new_cap - used_cap)?;
732 self.handle_capacity_increase(old_cap);
738 /// Shrinks the capacity of the `VecDeque` as much as possible.
740 /// It will drop down as close as possible to the length but the allocator may still inform the
741 /// `VecDeque` that there is space for a few more elements.
746 /// use std::collections::VecDeque;
748 /// let mut buf = VecDeque::with_capacity(15);
749 /// buf.extend(0..4);
750 /// assert_eq!(buf.capacity(), 15);
751 /// buf.shrink_to_fit();
752 /// assert!(buf.capacity() >= 4);
754 #[stable(feature = "deque_extras_15", since = "1.5.0")]
755 pub fn shrink_to_fit(&mut self) {
759 /// Shrinks the capacity of the `VecDeque` with a lower bound.
761 /// The capacity will remain at least as large as both the length
762 /// and the supplied value.
764 /// Panics if the current capacity is smaller than the supplied
765 /// minimum capacity.
770 /// #![feature(shrink_to)]
771 /// use std::collections::VecDeque;
773 /// let mut buf = VecDeque::with_capacity(15);
774 /// buf.extend(0..4);
775 /// assert_eq!(buf.capacity(), 15);
776 /// buf.shrink_to(6);
777 /// assert!(buf.capacity() >= 6);
778 /// buf.shrink_to(0);
779 /// assert!(buf.capacity() >= 4);
781 #[unstable(feature = "shrink_to", reason = "new API", issue = "56431")]
782 pub fn shrink_to(&mut self, min_capacity: usize) {
783 assert!(self.capacity() >= min_capacity, "Tried to shrink to a larger capacity");
785 // +1 since the ringbuffer always leaves one space empty
786 // len + 1 can't overflow for an existing, well-formed ringbuffer.
787 let target_cap = cmp::max(cmp::max(min_capacity, self.len()) + 1, MINIMUM_CAPACITY + 1)
788 .next_power_of_two();
790 if target_cap < self.cap() {
791 // There are three cases of interest:
792 // All elements are out of desired bounds
793 // Elements are contiguous, and head is out of desired bounds
794 // Elements are discontiguous, and tail is out of desired bounds
796 // At all other times, element positions are unaffected.
798 // Indicates that elements at the head should be moved.
799 let head_outside = self.head == 0 || self.head >= target_cap;
800 // Move elements from out of desired bounds (positions after target_cap)
801 if self.tail >= target_cap && head_outside {
803 // [. . . . . . . . o o o o o o o . ]
805 // [o o o o o o o . ]
807 self.copy_nonoverlapping(0, self.tail, self.len());
809 self.head = self.len();
811 } else if self.tail != 0 && self.tail < target_cap && head_outside {
813 // [. . . o o o o o o o . . . . . . ]
815 // [o o . o o o o o ]
816 let len = self.wrap_sub(self.head, target_cap);
818 self.copy_nonoverlapping(0, target_cap, len);
821 debug_assert!(self.head < self.tail);
822 } else if self.tail >= target_cap {
824 // [o o o o o . . . . . . . . . o o ]
826 // [o o o o o . o o ]
827 debug_assert!(self.wrap_sub(self.head, 1) < target_cap);
828 let len = self.cap() - self.tail;
829 let new_tail = target_cap - len;
831 self.copy_nonoverlapping(new_tail, self.tail, len);
833 self.tail = new_tail;
834 debug_assert!(self.head < self.tail);
837 self.buf.shrink_to_fit(target_cap);
839 debug_assert!(self.head < self.cap());
840 debug_assert!(self.tail < self.cap());
841 debug_assert!(self.cap().count_ones() == 1);
845 /// Shortens the `VecDeque`, keeping the first `len` elements and dropping
848 /// If `len` is greater than the `VecDeque`'s current length, this has no
854 /// use std::collections::VecDeque;
856 /// let mut buf = VecDeque::new();
857 /// buf.push_back(5);
858 /// buf.push_back(10);
859 /// buf.push_back(15);
860 /// assert_eq!(buf, [5, 10, 15]);
862 /// assert_eq!(buf, [5]);
864 #[stable(feature = "deque_extras", since = "1.16.0")]
865 pub fn truncate(&mut self, len: usize) {
866 /// Runs the destructor for all items in the slice when it gets dropped (normally or
867 /// during unwinding).
868 struct Dropper<'a, T>(&'a mut [T]);
870 impl<'a, T> Drop for Dropper<'a, T> {
873 ptr::drop_in_place(self.0);
880 // * Any slice passed to `drop_in_place` is valid; the second case has
881 // `len <= front.len()` and returning on `len > self.len()` ensures
882 // `begin <= back.len()` in the first case
883 // * The head of the VecDeque is moved before calling `drop_in_place`,
884 // so no value is dropped twice if `drop_in_place` panics
886 if len > self.len() {
889 let num_dropped = self.len() - len;
890 let (front, back) = self.as_mut_slices();
891 if len > front.len() {
892 let begin = len - front.len();
893 let drop_back = back.get_unchecked_mut(begin..) as *mut _;
894 self.head = self.wrap_sub(self.head, num_dropped);
895 ptr::drop_in_place(drop_back);
897 let drop_back = back as *mut _;
898 let drop_front = front.get_unchecked_mut(len..) as *mut _;
899 self.head = self.wrap_sub(self.head, num_dropped);
901 // Make sure the second half is dropped even when a destructor
902 // in the first one panics.
903 let _back_dropper = Dropper(&mut *drop_back);
904 ptr::drop_in_place(drop_front);
909 /// Returns a front-to-back iterator.
914 /// use std::collections::VecDeque;
916 /// let mut buf = VecDeque::new();
917 /// buf.push_back(5);
918 /// buf.push_back(3);
919 /// buf.push_back(4);
920 /// let b: &[_] = &[&5, &3, &4];
921 /// let c: Vec<&i32> = buf.iter().collect();
922 /// assert_eq!(&c[..], b);
924 #[stable(feature = "rust1", since = "1.0.0")]
925 pub fn iter(&self) -> Iter<'_, T> {
926 Iter { tail: self.tail, head: self.head, ring: unsafe { self.buffer_as_slice() } }
929 /// Returns a front-to-back iterator that returns mutable references.
934 /// use std::collections::VecDeque;
936 /// let mut buf = VecDeque::new();
937 /// buf.push_back(5);
938 /// buf.push_back(3);
939 /// buf.push_back(4);
940 /// for num in buf.iter_mut() {
943 /// let b: &[_] = &[&mut 3, &mut 1, &mut 2];
944 /// assert_eq!(&buf.iter_mut().collect::<Vec<&mut i32>>()[..], b);
946 #[stable(feature = "rust1", since = "1.0.0")]
947 pub fn iter_mut(&mut self) -> IterMut<'_, T> {
948 // SAFETY: The internal `IterMut` safety invariant is established because the
949 // `ring` we create is a dereferencable slice for lifetime '_.
953 ring: ptr::slice_from_raw_parts_mut(self.ptr(), self.cap()),
954 phantom: PhantomData,
958 /// Returns a pair of slices which contain, in order, the contents of the
961 /// If [`make_contiguous`] was previously called, all elements of the
962 /// `VecDeque` will be in the first slice and the second slice will be empty.
964 /// [`make_contiguous`]: VecDeque::make_contiguous
969 /// use std::collections::VecDeque;
971 /// let mut vector = VecDeque::new();
973 /// vector.push_back(0);
974 /// vector.push_back(1);
975 /// vector.push_back(2);
977 /// assert_eq!(vector.as_slices(), (&[0, 1, 2][..], &[][..]));
979 /// vector.push_front(10);
980 /// vector.push_front(9);
982 /// assert_eq!(vector.as_slices(), (&[9, 10][..], &[0, 1, 2][..]));
985 #[stable(feature = "deque_extras_15", since = "1.5.0")]
986 pub fn as_slices(&self) -> (&[T], &[T]) {
988 let buf = self.buffer_as_slice();
989 RingSlices::ring_slices(buf, self.head, self.tail)
993 /// Returns a pair of slices which contain, in order, the contents of the
996 /// If [`make_contiguous`] was previously called, all elements of the
997 /// `VecDeque` will be in the first slice and the second slice will be empty.
999 /// [`make_contiguous`]: VecDeque::make_contiguous
1004 /// use std::collections::VecDeque;
1006 /// let mut vector = VecDeque::new();
1008 /// vector.push_back(0);
1009 /// vector.push_back(1);
1011 /// vector.push_front(10);
1012 /// vector.push_front(9);
1014 /// vector.as_mut_slices().0[0] = 42;
1015 /// vector.as_mut_slices().1[0] = 24;
1016 /// assert_eq!(vector.as_slices(), (&[42, 10][..], &[24, 1][..]));
1019 #[stable(feature = "deque_extras_15", since = "1.5.0")]
1020 pub fn as_mut_slices(&mut self) -> (&mut [T], &mut [T]) {
1022 let head = self.head;
1023 let tail = self.tail;
1024 let buf = self.buffer_as_mut_slice();
1025 RingSlices::ring_slices(buf, head, tail)
1029 /// Returns the number of elements in the `VecDeque`.
1034 /// use std::collections::VecDeque;
1036 /// let mut v = VecDeque::new();
1037 /// assert_eq!(v.len(), 0);
1039 /// assert_eq!(v.len(), 1);
1041 #[stable(feature = "rust1", since = "1.0.0")]
1042 pub fn len(&self) -> usize {
1043 count(self.tail, self.head, self.cap())
1046 /// Returns `true` if the `VecDeque` is empty.
1051 /// use std::collections::VecDeque;
1053 /// let mut v = VecDeque::new();
1054 /// assert!(v.is_empty());
1055 /// v.push_front(1);
1056 /// assert!(!v.is_empty());
1058 #[stable(feature = "rust1", since = "1.0.0")]
1059 pub fn is_empty(&self) -> bool {
1060 self.tail == self.head
1063 fn range_tail_head<R>(&self, range: R) -> (usize, usize)
1065 R: RangeBounds<usize>,
1067 let Range { start, end } = range.assert_len(self.len());
1068 let tail = self.wrap_add(self.tail, start);
1069 let head = self.wrap_add(self.tail, end);
1073 /// Creates an iterator that covers the specified range in the `VecDeque`.
1077 /// Panics if the starting point is greater than the end point or if
1078 /// the end point is greater than the length of the vector.
1083 /// #![feature(deque_range)]
1085 /// use std::collections::VecDeque;
1087 /// let v: VecDeque<_> = vec![1, 2, 3].into_iter().collect();
1088 /// let range = v.range(2..).copied().collect::<VecDeque<_>>();
1089 /// assert_eq!(range, [3]);
1091 /// // A full range covers all contents
1092 /// let all = v.range(..);
1093 /// assert_eq!(all.len(), 3);
1096 #[unstable(feature = "deque_range", issue = "74217")]
1097 pub fn range<R>(&self, range: R) -> Iter<'_, T>
1099 R: RangeBounds<usize>,
1101 let (tail, head) = self.range_tail_head(range);
1105 // The shared reference we have in &self is maintained in the '_ of Iter.
1106 ring: unsafe { self.buffer_as_slice() },
1110 /// Creates an iterator that covers the specified mutable range in the `VecDeque`.
1114 /// Panics if the starting point is greater than the end point or if
1115 /// the end point is greater than the length of the vector.
1120 /// #![feature(deque_range)]
1122 /// use std::collections::VecDeque;
1124 /// let mut v: VecDeque<_> = vec![1, 2, 3].into_iter().collect();
1125 /// for v in v.range_mut(2..) {
1128 /// assert_eq!(v, vec![1, 2, 6]);
1130 /// // A full range covers all contents
1131 /// for v in v.range_mut(..) {
1134 /// assert_eq!(v, vec![2, 4, 12]);
1137 #[unstable(feature = "deque_range", issue = "74217")]
1138 pub fn range_mut<R>(&mut self, range: R) -> IterMut<'_, T>
1140 R: RangeBounds<usize>,
1142 let (tail, head) = self.range_tail_head(range);
1144 // SAFETY: The internal `IterMut` safety invariant is established because the
1145 // `ring` we create is a dereferencable slice for lifetime '_.
1149 ring: ptr::slice_from_raw_parts_mut(self.ptr(), self.cap()),
1150 phantom: PhantomData,
1154 /// Creates a draining iterator that removes the specified range in the
1155 /// `VecDeque` and yields the removed items.
1157 /// Note 1: The element range is removed even if the iterator is not
1158 /// consumed until the end.
1160 /// Note 2: It is unspecified how many elements are removed from the deque,
1161 /// if the `Drain` value is not dropped, but the borrow it holds expires
1162 /// (e.g., due to `mem::forget`).
1166 /// Panics if the starting point is greater than the end point or if
1167 /// the end point is greater than the length of the vector.
1172 /// use std::collections::VecDeque;
1174 /// let mut v: VecDeque<_> = vec![1, 2, 3].into_iter().collect();
1175 /// let drained = v.drain(2..).collect::<VecDeque<_>>();
1176 /// assert_eq!(drained, [3]);
1177 /// assert_eq!(v, [1, 2]);
1179 /// // A full range clears all contents
1181 /// assert!(v.is_empty());
1184 #[stable(feature = "drain", since = "1.6.0")]
1185 pub fn drain<R>(&mut self, range: R) -> Drain<'_, T>
1187 R: RangeBounds<usize>,
1191 // When the Drain is first created, the source deque is shortened to
1192 // make sure no uninitialized or moved-from elements are accessible at
1193 // all if the Drain's destructor never gets to run.
1195 // Drain will ptr::read out the values to remove.
1196 // When finished, the remaining data will be copied back to cover the hole,
1197 // and the head/tail values will be restored correctly.
1199 let (drain_tail, drain_head) = self.range_tail_head(range);
1201 // The deque's elements are parted into three segments:
1202 // * self.tail -> drain_tail
1203 // * drain_tail -> drain_head
1204 // * drain_head -> self.head
1206 // T = self.tail; H = self.head; t = drain_tail; h = drain_head
1208 // We store drain_tail as self.head, and drain_head and self.head as
1209 // after_tail and after_head respectively on the Drain. This also
1210 // truncates the effective array such that if the Drain is leaked, we
1211 // have forgotten about the potentially moved values after the start of
1215 // [. . . o o x x o o . . .]
1217 let head = self.head;
1219 // "forget" about the values after the start of the drain until after
1220 // the drain is complete and the Drain destructor is run.
1221 self.head = drain_tail;
1224 deque: NonNull::from(&mut *self),
1225 after_tail: drain_head,
1230 // Crucially, we only create shared references from `self` here and read from
1231 // it. We do not write to `self` nor reborrow to a mutable reference.
1232 // Hence the raw pointer we created above, for `deque`, remains valid.
1233 ring: unsafe { self.buffer_as_slice() },
1238 /// Clears the `VecDeque`, removing all values.
1243 /// use std::collections::VecDeque;
1245 /// let mut v = VecDeque::new();
1248 /// assert!(v.is_empty());
1250 #[stable(feature = "rust1", since = "1.0.0")]
1252 pub fn clear(&mut self) {
1256 /// Returns `true` if the `VecDeque` contains an element equal to the
1262 /// use std::collections::VecDeque;
1264 /// let mut vector: VecDeque<u32> = VecDeque::new();
1266 /// vector.push_back(0);
1267 /// vector.push_back(1);
1269 /// assert_eq!(vector.contains(&1), true);
1270 /// assert_eq!(vector.contains(&10), false);
1272 #[stable(feature = "vec_deque_contains", since = "1.12.0")]
1273 pub fn contains(&self, x: &T) -> bool
1277 let (a, b) = self.as_slices();
1278 a.contains(x) || b.contains(x)
1281 /// Provides a reference to the front element, or `None` if the `VecDeque` is
1287 /// use std::collections::VecDeque;
1289 /// let mut d = VecDeque::new();
1290 /// assert_eq!(d.front(), None);
1294 /// assert_eq!(d.front(), Some(&1));
1296 #[stable(feature = "rust1", since = "1.0.0")]
1297 pub fn front(&self) -> Option<&T> {
1298 if !self.is_empty() { Some(&self[0]) } else { None }
1301 /// Provides a mutable reference to the front element, or `None` if the
1302 /// `VecDeque` is empty.
1307 /// use std::collections::VecDeque;
1309 /// let mut d = VecDeque::new();
1310 /// assert_eq!(d.front_mut(), None);
1314 /// match d.front_mut() {
1315 /// Some(x) => *x = 9,
1318 /// assert_eq!(d.front(), Some(&9));
1320 #[stable(feature = "rust1", since = "1.0.0")]
1321 pub fn front_mut(&mut self) -> Option<&mut T> {
1322 if !self.is_empty() { Some(&mut self[0]) } else { None }
1325 /// Provides a reference to the back element, or `None` if the `VecDeque` is
1331 /// use std::collections::VecDeque;
1333 /// let mut d = VecDeque::new();
1334 /// assert_eq!(d.back(), None);
1338 /// assert_eq!(d.back(), Some(&2));
1340 #[stable(feature = "rust1", since = "1.0.0")]
1341 pub fn back(&self) -> Option<&T> {
1342 if !self.is_empty() { Some(&self[self.len() - 1]) } else { None }
1345 /// Provides a mutable reference to the back element, or `None` if the
1346 /// `VecDeque` is empty.
1351 /// use std::collections::VecDeque;
1353 /// let mut d = VecDeque::new();
1354 /// assert_eq!(d.back(), None);
1358 /// match d.back_mut() {
1359 /// Some(x) => *x = 9,
1362 /// assert_eq!(d.back(), Some(&9));
1364 #[stable(feature = "rust1", since = "1.0.0")]
1365 pub fn back_mut(&mut self) -> Option<&mut T> {
1366 let len = self.len();
1367 if !self.is_empty() { Some(&mut self[len - 1]) } else { None }
1370 /// Removes the first element and returns it, or `None` if the `VecDeque` is
1376 /// use std::collections::VecDeque;
1378 /// let mut d = VecDeque::new();
1382 /// assert_eq!(d.pop_front(), Some(1));
1383 /// assert_eq!(d.pop_front(), Some(2));
1384 /// assert_eq!(d.pop_front(), None);
1386 #[stable(feature = "rust1", since = "1.0.0")]
1387 pub fn pop_front(&mut self) -> Option<T> {
1388 if self.is_empty() {
1391 let tail = self.tail;
1392 self.tail = self.wrap_add(self.tail, 1);
1393 unsafe { Some(self.buffer_read(tail)) }
1397 /// Removes the last element from the `VecDeque` and returns it, or `None` if
1403 /// use std::collections::VecDeque;
1405 /// let mut buf = VecDeque::new();
1406 /// assert_eq!(buf.pop_back(), None);
1407 /// buf.push_back(1);
1408 /// buf.push_back(3);
1409 /// assert_eq!(buf.pop_back(), Some(3));
1411 #[stable(feature = "rust1", since = "1.0.0")]
1412 pub fn pop_back(&mut self) -> Option<T> {
1413 if self.is_empty() {
1416 self.head = self.wrap_sub(self.head, 1);
1417 let head = self.head;
1418 unsafe { Some(self.buffer_read(head)) }
1422 /// Prepends an element to the `VecDeque`.
1427 /// use std::collections::VecDeque;
1429 /// let mut d = VecDeque::new();
1430 /// d.push_front(1);
1431 /// d.push_front(2);
1432 /// assert_eq!(d.front(), Some(&2));
1434 #[stable(feature = "rust1", since = "1.0.0")]
1435 pub fn push_front(&mut self, value: T) {
1440 self.tail = self.wrap_sub(self.tail, 1);
1441 let tail = self.tail;
1443 self.buffer_write(tail, value);
1447 /// Appends an element to the back of the `VecDeque`.
1452 /// use std::collections::VecDeque;
1454 /// let mut buf = VecDeque::new();
1455 /// buf.push_back(1);
1456 /// buf.push_back(3);
1457 /// assert_eq!(3, *buf.back().unwrap());
1459 #[stable(feature = "rust1", since = "1.0.0")]
1460 pub fn push_back(&mut self, value: T) {
1465 let head = self.head;
1466 self.head = self.wrap_add(self.head, 1);
1467 unsafe { self.buffer_write(head, value) }
1471 fn is_contiguous(&self) -> bool {
1472 self.tail <= self.head
1475 /// Removes an element from anywhere in the `VecDeque` and returns it,
1476 /// replacing it with the first element.
1478 /// This does not preserve ordering, but is *O*(1).
1480 /// Returns `None` if `index` is out of bounds.
1482 /// Element at index 0 is the front of the queue.
1487 /// use std::collections::VecDeque;
1489 /// let mut buf = VecDeque::new();
1490 /// assert_eq!(buf.swap_remove_front(0), None);
1491 /// buf.push_back(1);
1492 /// buf.push_back(2);
1493 /// buf.push_back(3);
1494 /// assert_eq!(buf, [1, 2, 3]);
1496 /// assert_eq!(buf.swap_remove_front(2), Some(3));
1497 /// assert_eq!(buf, [2, 1]);
1499 #[stable(feature = "deque_extras_15", since = "1.5.0")]
1500 pub fn swap_remove_front(&mut self, index: usize) -> Option<T> {
1501 let length = self.len();
1502 if length > 0 && index < length && index != 0 {
1503 self.swap(index, 0);
1504 } else if index >= length {
1510 /// Removes an element from anywhere in the `VecDeque` and returns it, replacing it with the
1513 /// This does not preserve ordering, but is *O*(1).
1515 /// Returns `None` if `index` is out of bounds.
1517 /// Element at index 0 is the front of the queue.
1522 /// use std::collections::VecDeque;
1524 /// let mut buf = VecDeque::new();
1525 /// assert_eq!(buf.swap_remove_back(0), None);
1526 /// buf.push_back(1);
1527 /// buf.push_back(2);
1528 /// buf.push_back(3);
1529 /// assert_eq!(buf, [1, 2, 3]);
1531 /// assert_eq!(buf.swap_remove_back(0), Some(1));
1532 /// assert_eq!(buf, [3, 2]);
1534 #[stable(feature = "deque_extras_15", since = "1.5.0")]
1535 pub fn swap_remove_back(&mut self, index: usize) -> Option<T> {
1536 let length = self.len();
1537 if length > 0 && index < length - 1 {
1538 self.swap(index, length - 1);
1539 } else if index >= length {
1545 /// Inserts an element at `index` within the `VecDeque`, shifting all elements with indices
1546 /// greater than or equal to `index` towards the back.
1548 /// Element at index 0 is the front of the queue.
1552 /// Panics if `index` is greater than `VecDeque`'s length
1557 /// use std::collections::VecDeque;
1559 /// let mut vec_deque = VecDeque::new();
1560 /// vec_deque.push_back('a');
1561 /// vec_deque.push_back('b');
1562 /// vec_deque.push_back('c');
1563 /// assert_eq!(vec_deque, &['a', 'b', 'c']);
1565 /// vec_deque.insert(1, 'd');
1566 /// assert_eq!(vec_deque, &['a', 'd', 'b', 'c']);
1568 #[stable(feature = "deque_extras_15", since = "1.5.0")]
1569 pub fn insert(&mut self, index: usize, value: T) {
1570 assert!(index <= self.len(), "index out of bounds");
1575 // Move the least number of elements in the ring buffer and insert
1578 // At most len/2 - 1 elements will be moved. O(min(n, n-i))
1580 // There are three main cases:
1581 // Elements are contiguous
1582 // - special case when tail is 0
1583 // Elements are discontiguous and the insert is in the tail section
1584 // Elements are discontiguous and the insert is in the head section
1586 // For each of those there are two more cases:
1587 // Insert is closer to tail
1588 // Insert is closer to head
1590 // Key: H - self.head
1592 // o - Valid element
1593 // I - Insertion element
1594 // A - The element that should be after the insertion point
1595 // M - Indicates element was moved
1597 let idx = self.wrap_add(self.tail, index);
1599 let distance_to_tail = index;
1600 let distance_to_head = self.len() - index;
1602 let contiguous = self.is_contiguous();
1604 match (contiguous, distance_to_tail <= distance_to_head, idx >= self.tail) {
1605 (true, true, _) if index == 0 => {
1610 // [A o o o o o o . . . . . . . . .]
1613 // [A o o o o o o o . . . . . I]
1616 self.tail = self.wrap_sub(self.tail, 1);
1618 (true, true, _) => {
1620 // contiguous, insert closer to tail:
1623 // [. . . o o A o o o o . . . . . .]
1626 // [. . o o I A o o o o . . . . . .]
1629 // contiguous, insert closer to tail and tail is 0:
1633 // [o o A o o o o . . . . . . . . .]
1636 // [o I A o o o o o . . . . . . . o]
1639 let new_tail = self.wrap_sub(self.tail, 1);
1641 self.copy(new_tail, self.tail, 1);
1642 // Already moved the tail, so we only copy `index - 1` elements.
1643 self.copy(self.tail, self.tail + 1, index - 1);
1645 self.tail = new_tail;
1648 (true, false, _) => {
1650 // contiguous, insert closer to head:
1653 // [. . . o o o o A o o . . . . . .]
1656 // [. . . o o o o I A o o . . . . .]
1659 self.copy(idx + 1, idx, self.head - idx);
1660 self.head = self.wrap_add(self.head, 1);
1663 (false, true, true) => {
1665 // discontiguous, insert closer to tail, tail section:
1668 // [o o o o o o . . . . . o o A o o]
1671 // [o o o o o o . . . . o o I A o o]
1674 self.copy(self.tail - 1, self.tail, index);
1678 (false, false, true) => {
1680 // discontiguous, insert closer to head, tail section:
1683 // [o o . . . . . . . o o o o o A o]
1686 // [o o o . . . . . . o o o o o I A]
1689 // copy elements up to new head
1690 self.copy(1, 0, self.head);
1692 // copy last element into empty spot at bottom of buffer
1693 self.copy(0, self.cap() - 1, 1);
1695 // move elements from idx to end forward not including ^ element
1696 self.copy(idx + 1, idx, self.cap() - 1 - idx);
1701 (false, true, false) if idx == 0 => {
1703 // discontiguous, insert is closer to tail, head section,
1704 // and is at index zero in the internal buffer:
1707 // [A o o o o o o o o o . . . o o o]
1710 // [A o o o o o o o o o . . o o o I]
1713 // copy elements up to new tail
1714 self.copy(self.tail - 1, self.tail, self.cap() - self.tail);
1716 // copy last element into empty spot at bottom of buffer
1717 self.copy(self.cap() - 1, 0, 1);
1722 (false, true, false) => {
1724 // discontiguous, insert closer to tail, head section:
1727 // [o o o A o o o o o o . . . o o o]
1730 // [o o I A o o o o o o . . o o o o]
1733 // copy elements up to new tail
1734 self.copy(self.tail - 1, self.tail, self.cap() - self.tail);
1736 // copy last element into empty spot at bottom of buffer
1737 self.copy(self.cap() - 1, 0, 1);
1739 // move elements from idx-1 to end forward not including ^ element
1740 self.copy(0, 1, idx - 1);
1745 (false, false, false) => {
1747 // discontiguous, insert closer to head, head section:
1750 // [o o o o A o o . . . . . . o o o]
1753 // [o o o o I A o o . . . . . o o o]
1756 self.copy(idx + 1, idx, self.head - idx);
1762 // tail might've been changed so we need to recalculate
1763 let new_idx = self.wrap_add(self.tail, index);
1765 self.buffer_write(new_idx, value);
1769 /// Removes and returns the element at `index` from the `VecDeque`.
1770 /// Whichever end is closer to the removal point will be moved to make
1771 /// room, and all the affected elements will be moved to new positions.
1772 /// Returns `None` if `index` is out of bounds.
1774 /// Element at index 0 is the front of the queue.
1779 /// use std::collections::VecDeque;
1781 /// let mut buf = VecDeque::new();
1782 /// buf.push_back(1);
1783 /// buf.push_back(2);
1784 /// buf.push_back(3);
1785 /// assert_eq!(buf, [1, 2, 3]);
1787 /// assert_eq!(buf.remove(1), Some(2));
1788 /// assert_eq!(buf, [1, 3]);
1790 #[stable(feature = "rust1", since = "1.0.0")]
1791 pub fn remove(&mut self, index: usize) -> Option<T> {
1792 if self.is_empty() || self.len() <= index {
1796 // There are three main cases:
1797 // Elements are contiguous
1798 // Elements are discontiguous and the removal is in the tail section
1799 // Elements are discontiguous and the removal is in the head section
1800 // - special case when elements are technically contiguous,
1801 // but self.head = 0
1803 // For each of those there are two more cases:
1804 // Insert is closer to tail
1805 // Insert is closer to head
1807 // Key: H - self.head
1809 // o - Valid element
1810 // x - Element marked for removal
1811 // R - Indicates element that is being removed
1812 // M - Indicates element was moved
1814 let idx = self.wrap_add(self.tail, index);
1816 let elem = unsafe { Some(self.buffer_read(idx)) };
1818 let distance_to_tail = index;
1819 let distance_to_head = self.len() - index;
1821 let contiguous = self.is_contiguous();
1823 match (contiguous, distance_to_tail <= distance_to_head, idx >= self.tail) {
1824 (true, true, _) => {
1826 // contiguous, remove closer to tail:
1829 // [. . . o o x o o o o . . . . . .]
1832 // [. . . . o o o o o o . . . . . .]
1835 self.copy(self.tail + 1, self.tail, index);
1839 (true, false, _) => {
1841 // contiguous, remove closer to head:
1844 // [. . . o o o o x o o . . . . . .]
1847 // [. . . o o o o o o . . . . . . .]
1850 self.copy(idx, idx + 1, self.head - idx - 1);
1854 (false, true, true) => {
1856 // discontiguous, remove closer to tail, tail section:
1859 // [o o o o o o . . . . . o o x o o]
1862 // [o o o o o o . . . . . . o o o o]
1865 self.copy(self.tail + 1, self.tail, index);
1866 self.tail = self.wrap_add(self.tail, 1);
1869 (false, false, false) => {
1871 // discontiguous, remove closer to head, head section:
1874 // [o o o o x o o . . . . . . o o o]
1877 // [o o o o o o . . . . . . . o o o]
1880 self.copy(idx, idx + 1, self.head - idx - 1);
1884 (false, false, true) => {
1886 // discontiguous, remove closer to head, tail section:
1889 // [o o o . . . . . . o o o o o x o]
1892 // [o o . . . . . . . o o o o o o o]
1895 // or quasi-discontiguous, remove next to head, tail section:
1898 // [. . . . . . . . . o o o o o x o]
1901 // [. . . . . . . . . o o o o o o .]
1904 // draw in elements in the tail section
1905 self.copy(idx, idx + 1, self.cap() - idx - 1);
1907 // Prevents underflow.
1909 // copy first element into empty spot
1910 self.copy(self.cap() - 1, 0, 1);
1912 // move elements in the head section backwards
1913 self.copy(0, 1, self.head - 1);
1916 self.head = self.wrap_sub(self.head, 1);
1919 (false, true, false) => {
1921 // discontiguous, remove closer to tail, head section:
1924 // [o o x o o o o o o o . . . o o o]
1927 // [o o o o o o o o o o . . . . o o]
1930 // draw in elements up to idx
1931 self.copy(1, 0, idx);
1933 // copy last element into empty spot
1934 self.copy(0, self.cap() - 1, 1);
1936 // move elements from tail to end forward, excluding the last one
1937 self.copy(self.tail + 1, self.tail, self.cap() - self.tail - 1);
1939 self.tail = self.wrap_add(self.tail, 1);
1947 /// Splits the `VecDeque` into two at the given index.
1949 /// Returns a newly allocated `VecDeque`. `self` contains elements `[0, at)`,
1950 /// and the returned `VecDeque` contains elements `[at, len)`.
1952 /// Note that the capacity of `self` does not change.
1954 /// Element at index 0 is the front of the queue.
1958 /// Panics if `at > len`.
1963 /// use std::collections::VecDeque;
1965 /// let mut buf: VecDeque<_> = vec![1,2,3].into_iter().collect();
1966 /// let buf2 = buf.split_off(1);
1967 /// assert_eq!(buf, [1]);
1968 /// assert_eq!(buf2, [2, 3]);
1971 #[must_use = "use `.truncate()` if you don't need the other half"]
1972 #[stable(feature = "split_off", since = "1.4.0")]
1973 pub fn split_off(&mut self, at: usize) -> Self {
1974 let len = self.len();
1975 assert!(at <= len, "`at` out of bounds");
1977 let other_len = len - at;
1978 let mut other = VecDeque::with_capacity(other_len);
1981 let (first_half, second_half) = self.as_slices();
1983 let first_len = first_half.len();
1984 let second_len = second_half.len();
1986 // `at` lies in the first half.
1987 let amount_in_first = first_len - at;
1989 ptr::copy_nonoverlapping(first_half.as_ptr().add(at), other.ptr(), amount_in_first);
1991 // just take all of the second half.
1992 ptr::copy_nonoverlapping(
1993 second_half.as_ptr(),
1994 other.ptr().add(amount_in_first),
1998 // `at` lies in the second half, need to factor in the elements we skipped
1999 // in the first half.
2000 let offset = at - first_len;
2001 let amount_in_second = second_len - offset;
2002 ptr::copy_nonoverlapping(
2003 second_half.as_ptr().add(offset),
2010 // Cleanup where the ends of the buffers are
2011 self.head = self.wrap_sub(self.head, other_len);
2012 other.head = other.wrap_index(other_len);
2017 /// Moves all the elements of `other` into `self`, leaving `other` empty.
2021 /// Panics if the new number of elements in self overflows a `usize`.
2026 /// use std::collections::VecDeque;
2028 /// let mut buf: VecDeque<_> = vec![1, 2].into_iter().collect();
2029 /// let mut buf2: VecDeque<_> = vec![3, 4].into_iter().collect();
2030 /// buf.append(&mut buf2);
2031 /// assert_eq!(buf, [1, 2, 3, 4]);
2032 /// assert_eq!(buf2, []);
2035 #[stable(feature = "append", since = "1.4.0")]
2036 pub fn append(&mut self, other: &mut Self) {
2038 self.extend(other.drain(..));
2041 /// Retains only the elements specified by the predicate.
2043 /// In other words, remove all elements `e` such that `f(&e)` returns false.
2044 /// This method operates in place, visiting each element exactly once in the
2045 /// original order, and preserves the order of the retained elements.
2050 /// use std::collections::VecDeque;
2052 /// let mut buf = VecDeque::new();
2053 /// buf.extend(1..5);
2054 /// buf.retain(|&x| x % 2 == 0);
2055 /// assert_eq!(buf, [2, 4]);
2058 /// The exact order may be useful for tracking external state, like an index.
2061 /// use std::collections::VecDeque;
2063 /// let mut buf = VecDeque::new();
2064 /// buf.extend(1..6);
2066 /// let keep = [false, true, true, false, true];
2068 /// buf.retain(|_| (keep[i], i += 1).0);
2069 /// assert_eq!(buf, [2, 3, 5]);
2071 #[stable(feature = "vec_deque_retain", since = "1.4.0")]
2072 pub fn retain<F>(&mut self, mut f: F)
2074 F: FnMut(&T) -> bool,
2076 let len = self.len();
2082 self.swap(i - del, i);
2086 self.truncate(len - del);
2090 // This may panic or abort
2092 fn grow(&mut self) {
2094 let old_cap = self.cap();
2095 // Double the buffer size.
2096 self.buf.reserve_exact(old_cap, old_cap);
2097 assert!(self.cap() == old_cap * 2);
2099 self.handle_capacity_increase(old_cap);
2101 debug_assert!(!self.is_full());
2105 /// Modifies the `VecDeque` in-place so that `len()` is equal to `new_len`,
2106 /// either by removing excess elements from the back or by appending
2107 /// elements generated by calling `generator` to the back.
2112 /// use std::collections::VecDeque;
2114 /// let mut buf = VecDeque::new();
2115 /// buf.push_back(5);
2116 /// buf.push_back(10);
2117 /// buf.push_back(15);
2118 /// assert_eq!(buf, [5, 10, 15]);
2120 /// buf.resize_with(5, Default::default);
2121 /// assert_eq!(buf, [5, 10, 15, 0, 0]);
2123 /// buf.resize_with(2, || unreachable!());
2124 /// assert_eq!(buf, [5, 10]);
2126 /// let mut state = 100;
2127 /// buf.resize_with(5, || { state += 1; state });
2128 /// assert_eq!(buf, [5, 10, 101, 102, 103]);
2130 #[stable(feature = "vec_resize_with", since = "1.33.0")]
2131 pub fn resize_with(&mut self, new_len: usize, generator: impl FnMut() -> T) {
2132 let len = self.len();
2135 self.extend(repeat_with(generator).take(new_len - len))
2137 self.truncate(new_len);
2141 /// Rearranges the internal storage of this deque so it is one contiguous
2142 /// slice, which is then returned.
2144 /// This method does not allocate and does not change the order of the
2145 /// inserted elements. As it returns a mutable slice, this can be used to
2148 /// Once the internal storage is contiguous, the [`as_slices`] and
2149 /// [`as_mut_slices`] methods will return the entire contents of the
2150 /// `VecDeque` in a single slice.
2152 /// [`as_slices`]: VecDeque::as_slices
2153 /// [`as_mut_slices`]: VecDeque::as_mut_slices
2157 /// Sorting the content of a deque.
2160 /// use std::collections::VecDeque;
2162 /// let mut buf = VecDeque::with_capacity(15);
2164 /// buf.push_back(2);
2165 /// buf.push_back(1);
2166 /// buf.push_front(3);
2168 /// // sorting the deque
2169 /// buf.make_contiguous().sort();
2170 /// assert_eq!(buf.as_slices(), (&[1, 2, 3] as &[_], &[] as &[_]));
2172 /// // sorting it in reverse order
2173 /// buf.make_contiguous().sort_by(|a, b| b.cmp(a));
2174 /// assert_eq!(buf.as_slices(), (&[3, 2, 1] as &[_], &[] as &[_]));
2177 /// Getting immutable access to the contiguous slice.
2180 /// use std::collections::VecDeque;
2182 /// let mut buf = VecDeque::new();
2184 /// buf.push_back(2);
2185 /// buf.push_back(1);
2186 /// buf.push_front(3);
2188 /// buf.make_contiguous();
2189 /// if let (slice, &[]) = buf.as_slices() {
2190 /// // we can now be sure that `slice` contains all elements of the deque,
2191 /// // while still having immutable access to `buf`.
2192 /// assert_eq!(buf.len(), slice.len());
2193 /// assert_eq!(slice, &[3, 2, 1] as &[_]);
2196 #[stable(feature = "deque_make_contiguous", since = "1.48.0")]
2197 pub fn make_contiguous(&mut self) -> &mut [T] {
2198 if self.is_contiguous() {
2199 let tail = self.tail;
2200 let head = self.head;
2201 return unsafe { &mut self.buffer_as_mut_slice()[tail..head] };
2204 let buf = self.buf.ptr();
2205 let cap = self.cap();
2206 let len = self.len();
2208 let free = self.tail - self.head;
2209 let tail_len = cap - self.tail;
2211 if free >= tail_len {
2212 // there is enough free space to copy the tail in one go,
2213 // this means that we first shift the head backwards, and then
2214 // copy the tail to the correct position.
2216 // from: DEFGH....ABC
2219 ptr::copy(buf, buf.add(tail_len), self.head);
2221 ptr::copy_nonoverlapping(buf.add(self.tail), buf, tail_len);
2227 } else if free >= self.head {
2228 // there is enough free space to copy the head in one go,
2229 // this means that we first shift the tail forwards, and then
2230 // copy the head to the correct position.
2232 // from: FGH....ABCDE
2235 ptr::copy(buf.add(self.tail), buf.add(self.head), tail_len);
2237 ptr::copy_nonoverlapping(buf, buf.add(self.head + tail_len), self.head);
2240 self.tail = self.head;
2241 self.head = self.tail + len;
2244 // free is smaller than both head and tail,
2245 // this means we have to slowly "swap" the tail and the head.
2247 // from: EFGHI...ABCD or HIJK.ABCDEFG
2248 // to: ABCDEFGHI... or ABCDEFGHIJK.
2249 let mut left_edge: usize = 0;
2250 let mut right_edge: usize = self.tail;
2252 // The general problem looks like this
2253 // GHIJKLM...ABCDEF - before any swaps
2254 // ABCDEFM...GHIJKL - after 1 pass of swaps
2255 // ABCDEFGHIJM...KL - swap until the left edge reaches the temp store
2256 // - then restart the algorithm with a new (smaller) store
2257 // Sometimes the temp store is reached when the right edge is at the end
2258 // of the buffer - this means we've hit the right order with fewer swaps!
2261 // ABCDEF.. - after four only swaps we've finished
2262 while left_edge < len && right_edge != cap {
2263 let mut right_offset = 0;
2264 for i in left_edge..right_edge {
2265 right_offset = (i - left_edge) % (cap - right_edge);
2266 let src: isize = (right_edge + right_offset) as isize;
2267 ptr::swap(buf.add(i), buf.offset(src));
2269 let n_ops = right_edge - left_edge;
2271 right_edge += right_offset + 1;
2279 let tail = self.tail;
2280 let head = self.head;
2281 unsafe { &mut self.buffer_as_mut_slice()[tail..head] }
2284 /// Rotates the double-ended queue `mid` places to the left.
2287 /// - Rotates item `mid` into the first position.
2288 /// - Pops the first `mid` items and pushes them to the end.
2289 /// - Rotates `len() - mid` places to the right.
2293 /// If `mid` is greater than `len()`. Note that `mid == len()`
2294 /// does _not_ panic and is a no-op rotation.
2298 /// Takes `*O*(min(mid, len() - mid))` time and no extra space.
2303 /// use std::collections::VecDeque;
2305 /// let mut buf: VecDeque<_> = (0..10).collect();
2307 /// buf.rotate_left(3);
2308 /// assert_eq!(buf, [3, 4, 5, 6, 7, 8, 9, 0, 1, 2]);
2310 /// for i in 1..10 {
2311 /// assert_eq!(i * 3 % 10, buf[0]);
2312 /// buf.rotate_left(3);
2314 /// assert_eq!(buf, [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]);
2316 #[stable(feature = "vecdeque_rotate", since = "1.36.0")]
2317 pub fn rotate_left(&mut self, mid: usize) {
2318 assert!(mid <= self.len());
2319 let k = self.len() - mid;
2321 unsafe { self.rotate_left_inner(mid) }
2323 unsafe { self.rotate_right_inner(k) }
2327 /// Rotates the double-ended queue `k` places to the right.
2330 /// - Rotates the first item into position `k`.
2331 /// - Pops the last `k` items and pushes them to the front.
2332 /// - Rotates `len() - k` places to the left.
2336 /// If `k` is greater than `len()`. Note that `k == len()`
2337 /// does _not_ panic and is a no-op rotation.
2341 /// Takes `*O*(min(k, len() - k))` time and no extra space.
2346 /// use std::collections::VecDeque;
2348 /// let mut buf: VecDeque<_> = (0..10).collect();
2350 /// buf.rotate_right(3);
2351 /// assert_eq!(buf, [7, 8, 9, 0, 1, 2, 3, 4, 5, 6]);
2353 /// for i in 1..10 {
2354 /// assert_eq!(0, buf[i * 3 % 10]);
2355 /// buf.rotate_right(3);
2357 /// assert_eq!(buf, [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]);
2359 #[stable(feature = "vecdeque_rotate", since = "1.36.0")]
2360 pub fn rotate_right(&mut self, k: usize) {
2361 assert!(k <= self.len());
2362 let mid = self.len() - k;
2364 unsafe { self.rotate_right_inner(k) }
2366 unsafe { self.rotate_left_inner(mid) }
2370 // SAFETY: the following two methods require that the rotation amount
2371 // be less than half the length of the deque.
2373 // `wrap_copy` requires that `min(x, cap() - x) + copy_len <= cap()`,
2374 // but than `min` is never more than half the capacity, regardless of x,
2375 // so it's sound to call here because we're calling with something
2376 // less than half the length, which is never above half the capacity.
2378 unsafe fn rotate_left_inner(&mut self, mid: usize) {
2379 debug_assert!(mid * 2 <= self.len());
2381 self.wrap_copy(self.head, self.tail, mid);
2383 self.head = self.wrap_add(self.head, mid);
2384 self.tail = self.wrap_add(self.tail, mid);
2387 unsafe fn rotate_right_inner(&mut self, k: usize) {
2388 debug_assert!(k * 2 <= self.len());
2389 self.head = self.wrap_sub(self.head, k);
2390 self.tail = self.wrap_sub(self.tail, k);
2392 self.wrap_copy(self.tail, self.head, k);
2396 /// Binary searches this sorted `VecDeque` for a given element.
2398 /// If the value is found then [`Result::Ok`] is returned, containing the
2399 /// index of the matching element. If there are multiple matches, then any
2400 /// one of the matches could be returned. If the value is not found then
2401 /// [`Result::Err`] is returned, containing the index where a matching
2402 /// element could be inserted while maintaining sorted order.
2406 /// Looks up a series of four elements. The first is found, with a
2407 /// uniquely determined position; the second and third are not
2408 /// found; the fourth could match any position in `[1, 4]`.
2411 /// #![feature(vecdeque_binary_search)]
2412 /// use std::collections::VecDeque;
2414 /// let deque: VecDeque<_> = vec![0, 1, 1, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55].into();
2416 /// assert_eq!(deque.binary_search(&13), Ok(9));
2417 /// assert_eq!(deque.binary_search(&4), Err(7));
2418 /// assert_eq!(deque.binary_search(&100), Err(13));
2419 /// let r = deque.binary_search(&1);
2420 /// assert!(matches!(r, Ok(1..=4)));
2423 /// If you want to insert an item to a sorted `VecDeque`, while maintaining
2427 /// #![feature(vecdeque_binary_search)]
2428 /// use std::collections::VecDeque;
2430 /// let mut deque: VecDeque<_> = vec![0, 1, 1, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55].into();
2432 /// let idx = deque.binary_search(&num).unwrap_or_else(|x| x);
2433 /// deque.insert(idx, num);
2434 /// assert_eq!(deque, &[0, 1, 1, 1, 1, 2, 3, 5, 8, 13, 21, 34, 42, 55]);
2436 #[unstable(feature = "vecdeque_binary_search", issue = "78021")]
2438 pub fn binary_search(&self, x: &T) -> Result<usize, usize>
2442 self.binary_search_by(|e| e.cmp(x))
2445 /// Binary searches this sorted `VecDeque` with a comparator function.
2447 /// The comparator function should implement an order consistent
2448 /// with the sort order of the underlying `VecDeque`, returning an
2449 /// order code that indicates whether its argument is `Less`,
2450 /// `Equal` or `Greater` than the desired target.
2452 /// If the value is found then [`Result::Ok`] is returned, containing the
2453 /// index of the matching element. If there are multiple matches, then any
2454 /// one of the matches could be returned. If the value is not found then
2455 /// [`Result::Err`] is returned, containing the index where a matching
2456 /// element could be inserted while maintaining sorted order.
2460 /// Looks up a series of four elements. The first is found, with a
2461 /// uniquely determined position; the second and third are not
2462 /// found; the fourth could match any position in `[1, 4]`.
2465 /// #![feature(vecdeque_binary_search)]
2466 /// use std::collections::VecDeque;
2468 /// let deque: VecDeque<_> = vec![0, 1, 1, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55].into();
2470 /// assert_eq!(deque.binary_search_by(|x| x.cmp(&13)), Ok(9));
2471 /// assert_eq!(deque.binary_search_by(|x| x.cmp(&4)), Err(7));
2472 /// assert_eq!(deque.binary_search_by(|x| x.cmp(&100)), Err(13));
2473 /// let r = deque.binary_search_by(|x| x.cmp(&1));
2474 /// assert!(matches!(r, Ok(1..=4)));
2476 #[unstable(feature = "vecdeque_binary_search", issue = "78021")]
2477 pub fn binary_search_by<'a, F>(&'a self, mut f: F) -> Result<usize, usize>
2479 F: FnMut(&'a T) -> Ordering,
2481 let (front, back) = self.as_slices();
2483 if let Some(Ordering::Less | Ordering::Equal) = back.first().map(|elem| f(elem)) {
2484 back.binary_search_by(f).map(|idx| idx + front.len()).map_err(|idx| idx + front.len())
2486 front.binary_search_by(f)
2490 /// Binary searches this sorted `VecDeque` with a key extraction function.
2492 /// Assumes that the `VecDeque` is sorted by the key, for instance with
2493 /// [`make_contiguous().sort_by_key()`](#method.make_contiguous) using the same
2494 /// key extraction function.
2496 /// If the value is found then [`Result::Ok`] is returned, containing the
2497 /// index of the matching element. If there are multiple matches, then any
2498 /// one of the matches could be returned. If the value is not found then
2499 /// [`Result::Err`] is returned, containing the index where a matching
2500 /// element could be inserted while maintaining sorted order.
2504 /// Looks up a series of four elements in a slice of pairs sorted by
2505 /// their second elements. The first is found, with a uniquely
2506 /// determined position; the second and third are not found; the
2507 /// fourth could match any position in `[1, 4]`.
2510 /// #![feature(vecdeque_binary_search)]
2511 /// use std::collections::VecDeque;
2513 /// let deque: VecDeque<_> = vec![(0, 0), (2, 1), (4, 1), (5, 1),
2514 /// (3, 1), (1, 2), (2, 3), (4, 5), (5, 8), (3, 13),
2515 /// (1, 21), (2, 34), (4, 55)].into();
2517 /// assert_eq!(deque.binary_search_by_key(&13, |&(a,b)| b), Ok(9));
2518 /// assert_eq!(deque.binary_search_by_key(&4, |&(a,b)| b), Err(7));
2519 /// assert_eq!(deque.binary_search_by_key(&100, |&(a,b)| b), Err(13));
2520 /// let r = deque.binary_search_by_key(&1, |&(a,b)| b);
2521 /// assert!(matches!(r, Ok(1..=4)));
2523 #[unstable(feature = "vecdeque_binary_search", issue = "78021")]
2525 pub fn binary_search_by_key<'a, B, F>(&'a self, b: &B, mut f: F) -> Result<usize, usize>
2527 F: FnMut(&'a T) -> B,
2530 self.binary_search_by(|k| f(k).cmp(b))
2534 impl<T: Clone> VecDeque<T> {
2535 /// Modifies the `VecDeque` in-place so that `len()` is equal to new_len,
2536 /// either by removing excess elements from the back or by appending clones of `value`
2542 /// use std::collections::VecDeque;
2544 /// let mut buf = VecDeque::new();
2545 /// buf.push_back(5);
2546 /// buf.push_back(10);
2547 /// buf.push_back(15);
2548 /// assert_eq!(buf, [5, 10, 15]);
2550 /// buf.resize(2, 0);
2551 /// assert_eq!(buf, [5, 10]);
2553 /// buf.resize(5, 20);
2554 /// assert_eq!(buf, [5, 10, 20, 20, 20]);
2556 #[stable(feature = "deque_extras", since = "1.16.0")]
2557 pub fn resize(&mut self, new_len: usize, value: T) {
2558 self.resize_with(new_len, || value.clone());
2562 /// Returns the index in the underlying buffer for a given logical element index.
2564 fn wrap_index(index: usize, size: usize) -> usize {
2565 // size is always a power of 2
2566 debug_assert!(size.is_power_of_two());
2570 /// Calculate the number of elements left to be read in the buffer
2572 fn count(tail: usize, head: usize, size: usize) -> usize {
2573 // size is always a power of 2
2574 (head.wrapping_sub(tail)) & (size - 1)
2577 #[stable(feature = "rust1", since = "1.0.0")]
2578 impl<A: PartialEq> PartialEq for VecDeque<A> {
2579 fn eq(&self, other: &VecDeque<A>) -> bool {
2580 if self.len() != other.len() {
2583 let (sa, sb) = self.as_slices();
2584 let (oa, ob) = other.as_slices();
2585 if sa.len() == oa.len() {
2586 sa == oa && sb == ob
2587 } else if sa.len() < oa.len() {
2588 // Always divisible in three sections, for example:
2589 // self: [a b c|d e f]
2590 // other: [0 1 2 3|4 5]
2591 // front = 3, mid = 1,
2592 // [a b c] == [0 1 2] && [d] == [3] && [e f] == [4 5]
2593 let front = sa.len();
2594 let mid = oa.len() - front;
2596 let (oa_front, oa_mid) = oa.split_at(front);
2597 let (sb_mid, sb_back) = sb.split_at(mid);
2598 debug_assert_eq!(sa.len(), oa_front.len());
2599 debug_assert_eq!(sb_mid.len(), oa_mid.len());
2600 debug_assert_eq!(sb_back.len(), ob.len());
2601 sa == oa_front && sb_mid == oa_mid && sb_back == ob
2603 let front = oa.len();
2604 let mid = sa.len() - front;
2606 let (sa_front, sa_mid) = sa.split_at(front);
2607 let (ob_mid, ob_back) = ob.split_at(mid);
2608 debug_assert_eq!(sa_front.len(), oa.len());
2609 debug_assert_eq!(sa_mid.len(), ob_mid.len());
2610 debug_assert_eq!(sb.len(), ob_back.len());
2611 sa_front == oa && sa_mid == ob_mid && sb == ob_back
2616 #[stable(feature = "rust1", since = "1.0.0")]
2617 impl<A: Eq> Eq for VecDeque<A> {}
2619 __impl_slice_eq1! { [] VecDeque<A>, Vec<B>, }
2620 __impl_slice_eq1! { [] VecDeque<A>, &[B], }
2621 __impl_slice_eq1! { [] VecDeque<A>, &mut [B], }
2622 __impl_slice_eq1! { [const N: usize] VecDeque<A>, [B; N], }
2623 __impl_slice_eq1! { [const N: usize] VecDeque<A>, &[B; N], }
2624 __impl_slice_eq1! { [const N: usize] VecDeque<A>, &mut [B; N], }
2626 #[stable(feature = "rust1", since = "1.0.0")]
2627 impl<A: PartialOrd> PartialOrd for VecDeque<A> {
2628 fn partial_cmp(&self, other: &VecDeque<A>) -> Option<Ordering> {
2629 self.iter().partial_cmp(other.iter())
2633 #[stable(feature = "rust1", since = "1.0.0")]
2634 impl<A: Ord> Ord for VecDeque<A> {
2636 fn cmp(&self, other: &VecDeque<A>) -> Ordering {
2637 self.iter().cmp(other.iter())
2641 #[stable(feature = "rust1", since = "1.0.0")]
2642 impl<A: Hash> Hash for VecDeque<A> {
2643 fn hash<H: Hasher>(&self, state: &mut H) {
2644 self.len().hash(state);
2645 let (a, b) = self.as_slices();
2646 Hash::hash_slice(a, state);
2647 Hash::hash_slice(b, state);
2651 #[stable(feature = "rust1", since = "1.0.0")]
2652 impl<A> Index<usize> for VecDeque<A> {
2656 fn index(&self, index: usize) -> &A {
2657 self.get(index).expect("Out of bounds access")
2661 #[stable(feature = "rust1", since = "1.0.0")]
2662 impl<A> IndexMut<usize> for VecDeque<A> {
2664 fn index_mut(&mut self, index: usize) -> &mut A {
2665 self.get_mut(index).expect("Out of bounds access")
2669 #[stable(feature = "rust1", since = "1.0.0")]
2670 impl<A> FromIterator<A> for VecDeque<A> {
2671 fn from_iter<T: IntoIterator<Item = A>>(iter: T) -> VecDeque<A> {
2672 let iterator = iter.into_iter();
2673 let (lower, _) = iterator.size_hint();
2674 let mut deq = VecDeque::with_capacity(lower);
2675 deq.extend(iterator);
2680 #[stable(feature = "rust1", since = "1.0.0")]
2681 impl<T> IntoIterator for VecDeque<T> {
2683 type IntoIter = IntoIter<T>;
2685 /// Consumes the `VecDeque` into a front-to-back iterator yielding elements by
2687 fn into_iter(self) -> IntoIter<T> {
2688 IntoIter { inner: self }
2692 #[stable(feature = "rust1", since = "1.0.0")]
2693 impl<'a, T> IntoIterator for &'a VecDeque<T> {
2695 type IntoIter = Iter<'a, T>;
2697 fn into_iter(self) -> Iter<'a, T> {
2702 #[stable(feature = "rust1", since = "1.0.0")]
2703 impl<'a, T> IntoIterator for &'a mut VecDeque<T> {
2704 type Item = &'a mut T;
2705 type IntoIter = IterMut<'a, T>;
2707 fn into_iter(self) -> IterMut<'a, T> {
2712 #[stable(feature = "rust1", since = "1.0.0")]
2713 impl<A> Extend<A> for VecDeque<A> {
2714 fn extend<T: IntoIterator<Item = A>>(&mut self, iter: T) {
2715 // This function should be the moral equivalent of:
2717 // for item in iter.into_iter() {
2718 // self.push_back(item);
2720 let mut iter = iter.into_iter();
2721 while let Some(element) = iter.next() {
2722 if self.len() == self.capacity() {
2723 let (lower, _) = iter.size_hint();
2724 self.reserve(lower.saturating_add(1));
2727 let head = self.head;
2728 self.head = self.wrap_add(self.head, 1);
2730 self.buffer_write(head, element);
2736 fn extend_one(&mut self, elem: A) {
2737 self.push_back(elem);
2741 fn extend_reserve(&mut self, additional: usize) {
2742 self.reserve(additional);
2746 #[stable(feature = "extend_ref", since = "1.2.0")]
2747 impl<'a, T: 'a + Copy> Extend<&'a T> for VecDeque<T> {
2748 fn extend<I: IntoIterator<Item = &'a T>>(&mut self, iter: I) {
2749 self.extend(iter.into_iter().cloned());
2753 fn extend_one(&mut self, &elem: &T) {
2754 self.push_back(elem);
2758 fn extend_reserve(&mut self, additional: usize) {
2759 self.reserve(additional);
2763 #[stable(feature = "rust1", since = "1.0.0")]
2764 impl<T: fmt::Debug> fmt::Debug for VecDeque<T> {
2765 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
2766 f.debug_list().entries(self).finish()
2770 #[stable(feature = "vecdeque_vec_conversions", since = "1.10.0")]
2771 impl<T> From<Vec<T>> for VecDeque<T> {
2772 /// Turn a [`Vec<T>`] into a [`VecDeque<T>`].
2774 /// [`Vec<T>`]: crate::vec::Vec
2775 /// [`VecDeque<T>`]: crate::collections::VecDeque
2777 /// This avoids reallocating where possible, but the conditions for that are
2778 /// strict, and subject to change, and so shouldn't be relied upon unless the
2779 /// `Vec<T>` came from `From<VecDeque<T>>` and hasn't been reallocated.
2780 fn from(other: Vec<T>) -> Self {
2782 let mut other = ManuallyDrop::new(other);
2783 let other_buf = other.as_mut_ptr();
2784 let mut buf = RawVec::from_raw_parts(other_buf, other.capacity());
2785 let len = other.len();
2787 // We need to extend the buf if it's not a power of two, too small
2788 // or doesn't have at least one free space
2789 if !buf.capacity().is_power_of_two()
2790 || (buf.capacity() < (MINIMUM_CAPACITY + 1))
2791 || (buf.capacity() == len)
2793 let cap = cmp::max(buf.capacity() + 1, MINIMUM_CAPACITY + 1).next_power_of_two();
2794 buf.reserve_exact(len, cap - len);
2797 VecDeque { tail: 0, head: len, buf }
2802 #[stable(feature = "vecdeque_vec_conversions", since = "1.10.0")]
2803 impl<T> From<VecDeque<T>> for Vec<T> {
2804 /// Turn a [`VecDeque<T>`] into a [`Vec<T>`].
2806 /// [`Vec<T>`]: crate::vec::Vec
2807 /// [`VecDeque<T>`]: crate::collections::VecDeque
2809 /// This never needs to re-allocate, but does need to do *O*(*n*) data movement if
2810 /// the circular buffer doesn't happen to be at the beginning of the allocation.
2815 /// use std::collections::VecDeque;
2817 /// // This one is *O*(1).
2818 /// let deque: VecDeque<_> = (1..5).collect();
2819 /// let ptr = deque.as_slices().0.as_ptr();
2820 /// let vec = Vec::from(deque);
2821 /// assert_eq!(vec, [1, 2, 3, 4]);
2822 /// assert_eq!(vec.as_ptr(), ptr);
2824 /// // This one needs data rearranging.
2825 /// let mut deque: VecDeque<_> = (1..5).collect();
2826 /// deque.push_front(9);
2827 /// deque.push_front(8);
2828 /// let ptr = deque.as_slices().1.as_ptr();
2829 /// let vec = Vec::from(deque);
2830 /// assert_eq!(vec, [8, 9, 1, 2, 3, 4]);
2831 /// assert_eq!(vec.as_ptr(), ptr);
2833 fn from(mut other: VecDeque<T>) -> Self {
2834 other.make_contiguous();
2837 let other = ManuallyDrop::new(other);
2838 let buf = other.buf.ptr();
2839 let len = other.len();
2840 let cap = other.cap();
2842 if other.head != 0 {
2843 ptr::copy(buf.add(other.tail), buf, len);
2845 Vec::from_raw_parts(buf, len, cap)