2 use crate::fmt::{self, Debug};
3 use crate::iter::{DoubleEndedIterator, ExactSizeIterator, FusedIterator, Iterator};
4 use crate::iter::{InPlaceIterable, SourceIter, TrustedLen};
6 /// An iterator that iterates two other iterators simultaneously.
8 /// This `struct` is created by [`zip`] or [`Iterator::zip`].
9 /// See their documentation for more.
11 #[must_use = "iterators are lazy and do nothing unless consumed"]
12 #[stable(feature = "rust1", since = "1.0.0")]
13 pub struct Zip<A, B> {
16 // index, len and a_len are only used by the specialized version of zip
21 impl<A: Iterator, B: Iterator> Zip<A, B> {
22 pub(in crate::iter) fn new(a: A, b: B) -> Zip<A, B> {
25 fn super_nth(&mut self, mut n: usize) -> Option<(A::Item, B::Item)> {
26 while let Some(x) = Iterator::next(self) {
36 /// Converts the arguments to iterators and zips them.
38 /// See the documentation of [`Iterator::zip`] for more.
43 /// #![feature(iter_zip)]
44 /// use std::iter::zip;
46 /// let xs = [1, 2, 3];
47 /// let ys = [4, 5, 6];
48 /// for (x, y) in zip(&xs, &ys) {
49 /// println!("x:{}, y:{}", x, y);
52 /// // Nested zips are also possible:
53 /// let zs = [7, 8, 9];
54 /// for ((x, y), z) in zip(zip(&xs, &ys), &zs) {
55 /// println!("x:{}, y:{}, z:{}", x, y, z);
58 #[unstable(feature = "iter_zip", issue = "83574")]
59 pub fn zip<A, B>(a: A, b: B) -> Zip<A::IntoIter, B::IntoIter>
64 ZipImpl::new(a.into_iter(), b.into_iter())
67 #[stable(feature = "rust1", since = "1.0.0")]
68 impl<A, B> Iterator for Zip<A, B>
73 type Item = (A::Item, B::Item);
76 fn next(&mut self) -> Option<Self::Item> {
81 fn size_hint(&self) -> (usize, Option<usize>) {
82 ZipImpl::size_hint(self)
86 fn nth(&mut self, n: usize) -> Option<Self::Item> {
92 unsafe fn __iterator_get_unchecked(&mut self, idx: usize) -> Self::Item
94 Self: TrustedRandomAccessNoCoerce,
96 // SAFETY: `ZipImpl::__iterator_get_unchecked` has same safety
97 // requirements as `Iterator::__iterator_get_unchecked`.
98 unsafe { ZipImpl::get_unchecked(self, idx) }
102 #[stable(feature = "rust1", since = "1.0.0")]
103 impl<A, B> DoubleEndedIterator for Zip<A, B>
105 A: DoubleEndedIterator + ExactSizeIterator,
106 B: DoubleEndedIterator + ExactSizeIterator,
109 fn next_back(&mut self) -> Option<(A::Item, B::Item)> {
110 ZipImpl::next_back(self)
114 // Zip specialization trait
116 trait ZipImpl<A, B> {
118 fn new(a: A, b: B) -> Self;
119 fn next(&mut self) -> Option<Self::Item>;
120 fn size_hint(&self) -> (usize, Option<usize>);
121 fn nth(&mut self, n: usize) -> Option<Self::Item>;
122 fn next_back(&mut self) -> Option<Self::Item>
124 A: DoubleEndedIterator + ExactSizeIterator,
125 B: DoubleEndedIterator + ExactSizeIterator;
126 // This has the same safety requirements as `Iterator::__iterator_get_unchecked`
127 unsafe fn get_unchecked(&mut self, idx: usize) -> <Self as Iterator>::Item
129 Self: Iterator + TrustedRandomAccessNoCoerce;
132 // Work around limitations of specialization, requiring `default` impls to be repeated
133 // in intermediary impls.
134 macro_rules! zip_impl_general_defaults {
136 default fn new(a: A, b: B) -> Self {
147 default fn next(&mut self) -> Option<(A::Item, B::Item)> {
148 let x = self.a.next()?;
149 let y = self.b.next()?;
154 default fn nth(&mut self, n: usize) -> Option<Self::Item> {
159 default fn next_back(&mut self) -> Option<(A::Item, B::Item)>
161 A: DoubleEndedIterator + ExactSizeIterator,
162 B: DoubleEndedIterator + ExactSizeIterator,
164 // The function body below only uses `self.a/b.len()` and `self.a/b.next_back()`
165 // and doesn’t call `next_back` too often, so this implementation is safe in
166 // the `TrustedRandomAccessNoCoerce` specialization
168 let a_sz = self.a.len();
169 let b_sz = self.b.len();
171 // Adjust a, b to equal length
173 for _ in 0..a_sz - b_sz {
177 for _ in 0..b_sz - a_sz {
182 match (self.a.next_back(), self.b.next_back()) {
183 (Some(x), Some(y)) => Some((x, y)),
184 (None, None) => None,
193 impl<A, B> ZipImpl<A, B> for Zip<A, B>
198 type Item = (A::Item, B::Item);
200 zip_impl_general_defaults! {}
203 default fn size_hint(&self) -> (usize, Option<usize>) {
204 let (a_lower, a_upper) = self.a.size_hint();
205 let (b_lower, b_upper) = self.b.size_hint();
207 let lower = cmp::min(a_lower, b_lower);
209 let upper = match (a_upper, b_upper) {
210 (Some(x), Some(y)) => Some(cmp::min(x, y)),
211 (Some(x), None) => Some(x),
212 (None, Some(y)) => Some(y),
213 (None, None) => None,
219 default unsafe fn get_unchecked(&mut self, _idx: usize) -> <Self as Iterator>::Item
221 Self: TrustedRandomAccessNoCoerce,
223 unreachable!("Always specialized");
228 impl<A, B> ZipImpl<A, B> for Zip<A, B>
230 A: TrustedRandomAccessNoCoerce + Iterator,
231 B: TrustedRandomAccessNoCoerce + Iterator,
233 zip_impl_general_defaults! {}
236 default fn size_hint(&self) -> (usize, Option<usize>) {
237 let size = cmp::min(self.a.size(), self.b.size());
242 unsafe fn get_unchecked(&mut self, idx: usize) -> <Self as Iterator>::Item {
243 let idx = self.index + idx;
244 // SAFETY: the caller must uphold the contract for
245 // `Iterator::__iterator_get_unchecked`.
246 unsafe { (self.a.__iterator_get_unchecked(idx), self.b.__iterator_get_unchecked(idx)) }
251 impl<A, B> ZipImpl<A, B> for Zip<A, B>
253 A: TrustedRandomAccess + Iterator,
254 B: TrustedRandomAccess + Iterator,
256 fn new(a: A, b: B) -> Self {
257 let a_len = a.size();
258 let len = cmp::min(a_len, b.size());
259 Zip { a, b, index: 0, len, a_len }
263 fn next(&mut self) -> Option<(A::Item, B::Item)> {
264 if self.index < self.len {
266 // since get_unchecked executes code which can panic we increment the counters beforehand
267 // so that the same index won't be accessed twice, as required by TrustedRandomAccess
269 // SAFETY: `i` is smaller than `self.len`, thus smaller than `self.a.len()` and `self.b.len()`
271 Some((self.a.__iterator_get_unchecked(i), self.b.__iterator_get_unchecked(i)))
273 } else if A::MAY_HAVE_SIDE_EFFECT && self.index < self.a_len {
275 // as above, increment before executing code that may panic
278 // match the base implementation's potential side effects
279 // SAFETY: we just checked that `i` < `self.a.len()`
281 self.a.__iterator_get_unchecked(i);
290 fn size_hint(&self) -> (usize, Option<usize>) {
291 let len = self.len - self.index;
296 fn nth(&mut self, n: usize) -> Option<Self::Item> {
297 let delta = cmp::min(n, self.len - self.index);
298 let end = self.index + delta;
299 while self.index < end {
301 // since get_unchecked executes code which can panic we increment the counters beforehand
302 // so that the same index won't be accessed twice, as required by TrustedRandomAccess
304 if A::MAY_HAVE_SIDE_EFFECT {
305 // SAFETY: the usage of `cmp::min` to calculate `delta`
306 // ensures that `end` is smaller than or equal to `self.len`,
307 // so `i` is also smaller than `self.len`.
309 self.a.__iterator_get_unchecked(i);
312 if B::MAY_HAVE_SIDE_EFFECT {
313 // SAFETY: same as above.
315 self.b.__iterator_get_unchecked(i);
320 self.super_nth(n - delta)
324 fn next_back(&mut self) -> Option<(A::Item, B::Item)>
326 A: DoubleEndedIterator + ExactSizeIterator,
327 B: DoubleEndedIterator + ExactSizeIterator,
329 if A::MAY_HAVE_SIDE_EFFECT || B::MAY_HAVE_SIDE_EFFECT {
330 let sz_a = self.a.size();
331 let sz_b = self.b.size();
332 // Adjust a, b to equal length, make sure that only the first call
333 // of `next_back` does this, otherwise we will break the restriction
334 // on calls to `self.next_back()` after calling `get_unchecked()`.
336 let sz_a = self.a.size();
337 if A::MAY_HAVE_SIDE_EFFECT && sz_a > self.len {
338 for _ in 0..sz_a - self.len {
339 // since next_back() may panic we increment the counters beforehand
340 // to keep Zip's state in sync with the underlying iterator source
344 debug_assert_eq!(self.a_len, self.len);
346 let sz_b = self.b.size();
347 if B::MAY_HAVE_SIDE_EFFECT && sz_b > self.len {
348 for _ in 0..sz_b - self.len {
354 if self.index < self.len {
355 // since get_unchecked executes code which can panic we increment the counters beforehand
356 // so that the same index won't be accessed twice, as required by TrustedRandomAccess
360 // SAFETY: `i` is smaller than the previous value of `self.len`,
361 // which is also smaller than or equal to `self.a.len()` and `self.b.len()`
363 Some((self.a.__iterator_get_unchecked(i), self.b.__iterator_get_unchecked(i)))
371 #[stable(feature = "rust1", since = "1.0.0")]
372 impl<A, B> ExactSizeIterator for Zip<A, B>
374 A: ExactSizeIterator,
375 B: ExactSizeIterator,
380 #[unstable(feature = "trusted_random_access", issue = "none")]
381 unsafe impl<A, B> TrustedRandomAccess for Zip<A, B>
383 A: TrustedRandomAccess,
384 B: TrustedRandomAccess,
389 #[unstable(feature = "trusted_random_access", issue = "none")]
390 unsafe impl<A, B> TrustedRandomAccessNoCoerce for Zip<A, B>
392 A: TrustedRandomAccessNoCoerce,
393 B: TrustedRandomAccessNoCoerce,
395 const MAY_HAVE_SIDE_EFFECT: bool = A::MAY_HAVE_SIDE_EFFECT || B::MAY_HAVE_SIDE_EFFECT;
398 #[stable(feature = "fused", since = "1.26.0")]
399 impl<A, B> FusedIterator for Zip<A, B>
406 #[unstable(feature = "trusted_len", issue = "37572")]
407 unsafe impl<A, B> TrustedLen for Zip<A, B>
414 // Arbitrarily selects the left side of the zip iteration as extractable "source"
415 // it would require negative trait bounds to be able to try both
416 #[unstable(issue = "none", feature = "inplace_iteration")]
417 unsafe impl<S, A, B> SourceIter for Zip<A, B>
419 A: SourceIter<Source = S>,
426 unsafe fn as_inner(&mut self) -> &mut S {
427 // SAFETY: unsafe function forwarding to unsafe function with the same requirements
428 unsafe { SourceIter::as_inner(&mut self.a) }
432 #[unstable(issue = "none", feature = "inplace_iteration")]
433 // Limited to Item: Copy since interaction between Zip's use of TrustedRandomAccess
434 // and Drop implementation of the source is unclear.
436 // An additional method returning the number of times the source has been logically advanced
437 // (without calling next()) would be needed to properly drop the remainder of the source.
438 unsafe impl<A: InPlaceIterable, B: Iterator> InPlaceIterable for Zip<A, B> where A::Item: Copy {}
440 #[stable(feature = "rust1", since = "1.0.0")]
441 impl<A: Debug, B: Debug> Debug for Zip<A, B> {
442 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
448 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result;
451 impl<A: Debug, B: Debug> ZipFmt<A, B> for Zip<A, B> {
452 default fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
453 f.debug_struct("Zip").field("a", &self.a).field("b", &self.b).finish()
457 impl<A: Debug + TrustedRandomAccessNoCoerce, B: Debug + TrustedRandomAccessNoCoerce> ZipFmt<A, B>
460 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
461 // It's *not safe* to call fmt on the contained iterators, since once
462 // we start iterating they're in strange, potentially unsafe, states.
463 f.debug_struct("Zip").finish()
467 /// An iterator whose items are random-accessible efficiently
471 /// The iterator's `size_hint` must be exact and cheap to call.
473 /// `TrustedRandomAccessNoCoerce::size` may not be overridden.
475 /// All subtypes and all supertypes of `Self` must also implement `TrustedRandomAccess`.
476 /// In particular, this means that types with non-invariant parameters usually can not have
477 /// an impl for `TrustedRandomAccess` that depends on any trait bounds on such parameters, except
478 /// for bounds that come from the respective struct/enum definition itself, or bounds involving
479 /// traits that themselves come with a guarantee similar to this one.
481 /// If `Self: ExactSizeIterator` then `self.len()` must always produce results consistent
482 /// with `self.size()`.
484 /// If `Self: Iterator`, then `<Self as Iterator>::__iterator_get_unchecked(&mut self, idx)`
485 /// must be safe to call provided the following conditions are met.
487 /// 1. `0 <= idx` and `idx < self.size()`.
488 /// 2. If `Self: !Clone`, then `self.__iterator_get_unchecked(idx)` is never called with the same
489 /// index on `self` more than once.
490 /// 3. After `self.__iterator_get_unchecked(idx)` has been called, then `self.next_back()` will
491 /// only be called at most `self.size() - idx - 1` times. If `Self: Clone` and `self` is cloned,
492 /// then this number is calculated for `self` and its clone individually,
493 /// but `self.next_back()` calls that happened before the cloning count for both `self` and the clone.
494 /// 4. After `self.__iterator_get_unchecked(idx)` has been called, then only the following methods
495 /// will be called on `self` or on any new clones of `self`:
496 /// * `std::clone::Clone::clone`
497 /// * `std::iter::Iterator::size_hint`
498 /// * `std::iter::DoubleEndedIterator::next_back`
499 /// * `std::iter::ExactSizeIterator::len`
500 /// * `std::iter::Iterator::__iterator_get_unchecked`
501 /// * `std::iter::TrustedRandomAccessNoCoerce::size`
502 /// 5. If `T` is a subtype of `Self`, then `self` is allowed to be coerced
503 /// to `T`. If `self` is coerced to `T` after `self.__iterator_get_unchecked(idx)` has already
504 /// been called, then no methods except for the ones listed under 4. are allowed to be called
505 /// on the resulting value of type `T`, either. Multiple such coercion steps are allowed.
506 /// Regarding 2. and 3., the number of times `__iterator_get_unchecked(idx)` or `next_back()` is
507 /// called on `self` and the resulting value of type `T` (and on further coercion results with
508 /// sub-subtypes) are added together and their sums must not exceed the specified bounds.
510 /// Further, given that these conditions are met, it must guarantee that:
512 /// * It does not change the value returned from `size_hint`
513 /// * It must be safe to call the methods listed above on `self` after calling
514 /// `self.__iterator_get_unchecked(idx)`, assuming that the required traits are implemented.
515 /// * It must also be safe to drop `self` after calling `self.__iterator_get_unchecked(idx)`.
516 /// * If `T` is a subtype of `Self`, then it must be safe to coerce `self` to `T`.
518 // FIXME: Clarify interaction with SourceIter/InPlaceIterable. Calling `SouceIter::as_inner`
519 // after `__iterator_get_unchecked` is supposed to be allowed.
521 #[unstable(feature = "trusted_random_access", issue = "none")]
522 #[rustc_specialization_trait]
523 pub unsafe trait TrustedRandomAccess: TrustedRandomAccessNoCoerce {}
525 /// Like [`TrustedRandomAccess`] but without any of the requirements / guarantees around
526 /// coercions to subtypes after `__iterator_get_unchecked` (they aren’t allowed here!), and
527 /// without the requirement that subtypes / supertypes implement `TrustedRandomAccessNoCoerce`.
529 /// This trait was created in PR #85874 to fix soundness issue #85873 without performance regressions.
530 /// It is subject to change as we might want to build a more generally useful (for performance
531 /// optimizations) and more sophisticated trait or trait hierarchy that replaces or extends
532 /// [`TrustedRandomAccess`] and `TrustedRandomAccessNoCoerce`.
534 #[unstable(feature = "trusted_random_access", issue = "none")]
535 #[rustc_specialization_trait]
536 pub unsafe trait TrustedRandomAccessNoCoerce: Sized {
537 // Convenience method.
538 fn size(&self) -> usize
544 /// `true` if getting an iterator element may have side effects.
545 /// Remember to take inner iterators into account.
546 const MAY_HAVE_SIDE_EFFECT: bool;
549 /// Like `Iterator::__iterator_get_unchecked`, but doesn't require the compiler to
550 /// know that `U: TrustedRandomAccess`.
554 /// Same requirements calling `get_unchecked` directly.
556 pub(in crate::iter::adapters) unsafe fn try_get_unchecked<I>(it: &mut I, idx: usize) -> I::Item
560 // SAFETY: the caller must uphold the contract for
561 // `Iterator::__iterator_get_unchecked`.
562 unsafe { it.try_get_unchecked(idx) }
565 unsafe trait SpecTrustedRandomAccess: Iterator {
566 /// If `Self: TrustedRandomAccess`, it must be safe to call a
567 /// `Iterator::__iterator_get_unchecked(self, index)`.
568 unsafe fn try_get_unchecked(&mut self, index: usize) -> Self::Item;
571 unsafe impl<I: Iterator> SpecTrustedRandomAccess for I {
572 default unsafe fn try_get_unchecked(&mut self, _: usize) -> Self::Item {
573 panic!("Should only be called on TrustedRandomAccess iterators");
577 unsafe impl<I: Iterator + TrustedRandomAccessNoCoerce> SpecTrustedRandomAccess for I {
578 unsafe fn try_get_unchecked(&mut self, index: usize) -> Self::Item {
579 // SAFETY: the caller must uphold the contract for
580 // `Iterator::__iterator_get_unchecked`.
581 unsafe { self.__iterator_get_unchecked(index) }