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: DiscQImplementations§
Source§impl<DiscQ, T> ParallelIterator<DiscQ, T>where
DiscQ: DiscreteQueue<Output = T>,
impl<DiscQ, T> ParallelIterator<DiscQ, T>where
DiscQ: DiscreteQueue<Output = T>,
Trait Implementations§
Source§impl<DiscQ, T> AtomicIterator for ParallelIterator<DiscQ, T>where
DiscQ: DiscreteQueue<Output = T>,
impl<DiscQ, T> AtomicIterator for ParallelIterator<DiscQ, T>where
DiscQ: DiscreteQueue<Output = T>,
type AtomicItem = <DiscQ as DiscreteQueue>::Output
fn atomic_next(&mut self) -> Option<Self::AtomicItem>
fn len(&self) -> Option<usize>
Source§fn is_active(&self) -> bool
fn is_active(&self) -> bool
tests whether the iterator is still active with values still available
to be pulled
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>
impl<DiscQ, T> Sync for ParallelIterator<DiscQ, T>
impl<DiscQ, T> Unpin for ParallelIterator<DiscQ, T>
impl<DiscQ, T> UnwindSafe for ParallelIterator<DiscQ, T>where
DiscQ: UnwindSafe,
T: UnwindSafe,
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<I, V, F> ParallelForEachIter<I, V, F> for I
impl<I, V, F> ParallelForEachIter<I, V, F> for I
Source§impl<I, V, F, T> ParallelMapIter<I, V, F, T> for I
impl<I, V, F, T> ParallelMapIter<I, V, F, T> for I
fn map(self, f: F) -> ParallelMap<V, F, T, Self>
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
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
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
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.