ParallelIterator

Struct ParallelIterator 

Source
pub struct ParallelIterator<DiscQ, T>
where DiscQ: DiscreteQueue<Output = T>,
{ pub iter: DiscQ, /* private fields */ }
Expand description

ParallelIterator is comparable to Iter, but is set up for the AtomicIterator.

Fields§

§iter: DiscQ

Implementations§

Source§

impl<DiscQ, T> ParallelIterator<DiscQ, T>
where DiscQ: DiscreteQueue<Output = T>,

Source

pub fn new(iter: DiscQ) -> Self

Trait Implementations§

Source§

impl<DiscQ, T> AtomicIterator for ParallelIterator<DiscQ, T>
where DiscQ: DiscreteQueue<Output = T>,

Source§

type AtomicItem = <DiscQ as DiscreteQueue>::Output

Source§

fn atomic_next(&mut self) -> Option<Self::AtomicItem>

Source§

fn len(&self) -> Option<usize>

Source§

fn is_active(&self) -> bool

tests whether the iterator is still active with values still available to be pulled
Source§

fn atomic_pull(&mut self) -> Option<Vec<Self::AtomicItem>>

Auto Trait Implementations§

§

impl<DiscQ, T> Freeze for ParallelIterator<DiscQ, T>
where DiscQ: Freeze,

§

impl<DiscQ, T> RefUnwindSafe for ParallelIterator<DiscQ, T>
where DiscQ: RefUnwindSafe, T: RefUnwindSafe,

§

impl<DiscQ, T> Send for ParallelIterator<DiscQ, T>
where DiscQ: Send, T: Send,

§

impl<DiscQ, T> Sync for ParallelIterator<DiscQ, T>
where DiscQ: Sync, T: Sync,

§

impl<DiscQ, T> Unpin for ParallelIterator<DiscQ, T>
where DiscQ: Unpin, T: Unpin,

§

impl<DiscQ, T> UnwindSafe for ParallelIterator<DiscQ, T>
where DiscQ: UnwindSafe, T: UnwindSafe,

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<I, V, F> ParallelForEachIter<I, V, F> for I
where I: AtomicIterator<AtomicItem = V> + Send, F: Fn(V) + Send + Sync, V: Send + Sync,

Source§

fn for_each(self, f: F)

Source§

impl<I, V, F, T> ParallelMapIter<I, V, F, T> for I
where I: AtomicIterator<AtomicItem = V> + Send, F: Fn(V) -> T + Send + Sync, V: Send + Sync, T: Send + Sync,

Source§

fn map(self, f: F) -> ParallelMap<V, F, T, Self>

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

Source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
Source§

fn is_in_subset(&self) -> bool

Checks if self is actually part of its subset T (and can be converted to it).
Source§

fn to_subset_unchecked(&self) -> SS

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
Source§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
Source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

fn vzip(self) -> V