pub struct QueryParManyUniqueIter<'w, 's, D: QueryData, F: QueryFilter, E: EntityEquivalent + Sync> { /* private fields */ }
Expand description
A parallel iterator over the unique query items generated from an EntitySet
.
This struct is created by the Query::par_iter_many_unique
and Query::par_iter_many_unique_mut
methods.
Implementations§
Source§impl<'w, 's, D: QueryData, F: QueryFilter, E: EntityEquivalent + Sync> QueryParManyUniqueIter<'w, 's, D, F, E>
impl<'w, 's, D: QueryData, F: QueryFilter, E: EntityEquivalent + Sync> QueryParManyUniqueIter<'w, 's, D, F, E>
Sourcepub fn batching_strategy(self, strategy: BatchingStrategy) -> Self
pub fn batching_strategy(self, strategy: BatchingStrategy) -> Self
Changes the batching strategy used when iterating.
For more information on how this affects the resultant iteration, see
BatchingStrategy
.
Sourcepub fn for_each<FN: Fn(QueryItem<'w, D>) + Send + Sync + Clone>(self, func: FN)
pub fn for_each<FN: Fn(QueryItem<'w, D>) + Send + Sync + Clone>(self, func: FN)
Runs func
on each query result in parallel.
§Panics
If the ComputeTaskPool
is not initialized. If using this from a query that is being
initialized and run from the ECS scheduler, this should never panic.
Sourcepub fn for_each_init<FN, INIT, T>(self, init: INIT, func: FN)
pub fn for_each_init<FN, INIT, T>(self, init: INIT, func: FN)
Runs func
on each query result in parallel on a value returned by init
.
init
may be called multiple times per thread, and the values returned may be discarded between tasks on any given thread.
Callers should avoid using this function as if it were a parallel version
of Iterator::fold
.
§Example
use bevy_utils::Parallel;
use crate::{bevy_ecs::{prelude::{Component, Res, Resource, Entity}, entity::UniqueEntityVec, system::Query}};
#[derive(Component)]
struct T;
#[derive(Resource)]
struct V(UniqueEntityVec);
impl<'a> IntoIterator for &'a V {
// ...
}
fn system(query: Query<&T>, entities: Res<V>){
let mut queue: Parallel<usize> = Parallel::default();
// queue.borrow_local_mut() will get or create a thread_local queue for each task/thread;
query.par_iter_many_unique(&entities).for_each_init(|| queue.borrow_local_mut(),|local_queue, item| {
**local_queue += some_expensive_operation(item);
});
// collect value from every thread
let final_value: usize = queue.iter_mut().map(|v| *v).sum();
}
§Panics
If the ComputeTaskPool
is not initialized. If using this from a query that is being
initialized and run from the ECS scheduler, this should never panic.
Auto Trait Implementations§
impl<'w, 's, D, F, E> Freeze for QueryParManyUniqueIter<'w, 's, D, F, E>
impl<'w, 's, D, F, E> !RefUnwindSafe for QueryParManyUniqueIter<'w, 's, D, F, E>
impl<'w, 's, D, F, E> Send for QueryParManyUniqueIter<'w, 's, D, F, E>where
E: Send,
impl<'w, 's, D, F, E> Sync for QueryParManyUniqueIter<'w, 's, D, F, E>
impl<'w, 's, D, F, E> Unpin for QueryParManyUniqueIter<'w, 's, D, F, E>where
E: Unpin,
impl<'w, 's, D, F, E> !UnwindSafe for QueryParManyUniqueIter<'w, 's, D, F, E>
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
Source§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
Source§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
Box<dyn Trait>
(where Trait: Downcast
) to Box<dyn Any>
, which can then be
downcast
into Box<dyn ConcreteType>
where ConcreteType
implements Trait
.Source§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Rc<Trait>
(where Trait: Downcast
) to Rc<Any>
, which can then be further
downcast
into Rc<ConcreteType>
where ConcreteType
implements Trait
.Source§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
&Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &Any
’s vtable from &Trait
’s.Source§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
&mut Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &mut Any
’s vtable from &mut Trait
’s.