Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Add methods for joining queries with lists. #5075

Closed
wants to merge 7 commits into from
Closed
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
149 changes: 149 additions & 0 deletions crates/bevy_ecs/src/query/iter.rs
Original file line number Diff line number Diff line change
Expand Up @@ -214,6 +214,155 @@ where
{
}

/// An [`Iterator`] over [`Query`](crate::system::Query) results a list mapped to [`Entity`]'s and the list items.
///
/// This struct is created by the [`Query::iter_join_map`](crate::system::Query::iter_join_map) and [`Query::iter_join_map_mut`](crate::system::Query::iter_join_map_mut) methods.
pub struct QueryJoinMapIter<'w, 's, Q: WorldQuery, F: WorldQuery, I: Iterator, MapFn>
where
MapFn: FnMut(&I::Item) -> Entity,
{
list: I,
map_f: MapFn,
entities: &'w Entities,
tables: &'w Tables,
archetypes: &'w Archetypes,
fetch: QueryFetch<'w, Q>,
filter: QueryFetch<'w, F>,
query_state: &'s QueryState<Q, F>,
}

impl<'w, 's, Q: WorldQuery, F: WorldQuery, I: Iterator, MapFn>
QueryJoinMapIter<'w, 's, Q, F, I, MapFn>
where
MapFn: FnMut(&I::Item) -> Entity,
{
/// # Safety
/// This does not check for mutable query correctness. To be safe, make sure mutable queries
/// have unique access to the components they query.
/// This does not validate that `world.id()` matches `query_state.world_id`. Calling this on a `world`
/// with a mismatched [`WorldId`](crate::world::WorldId) is unsound.
pub(crate) unsafe fn new(
world: &'w World,
query_state: &'s QueryState<Q, F>,
last_change_tick: u32,
change_tick: u32,
entity_map: impl IntoIterator<IntoIter = I>,
map_f: MapFn,
) -> QueryJoinMapIter<'w, 's, Q, F, I, MapFn> {
let fetch = Q::init_fetch(
world,
&query_state.fetch_state,
last_change_tick,
change_tick,
);
let filter = F::init_fetch(
world,
&query_state.filter_state,
last_change_tick,
change_tick,
);
QueryJoinMapIter {
query_state,
entities: &world.entities,
archetypes: &world.archetypes,
tables: &world.storages.tables,
fetch,
filter,
list: entity_map.into_iter(),
map_f,
}
}

/// SAFETY:
/// The lifetime here is not restrictive enough for Fetch with &mut access,
/// as calling `fetch_next_aliased_unchecked` multiple times can produce multiple
/// references to the same component, leading to unique reference aliasing.
///
/// It is always safe for immutable borrows.
#[inline(always)]
unsafe fn fetch_next_aliased_unchecked(&mut self) -> Option<(QueryItem<'w, Q>, I::Item)> {
for item in self.list.by_ref() {
let location = match self.entities.get((self.map_f)(&item)) {
Some(location) => location,
None => continue,
};

if !self
.query_state
.matched_archetypes
.contains(location.archetype_id.index())
{
continue;
}

let archetype = &self.archetypes[location.archetype_id];

// SAFETY: `archetype` is from the world that `fetch/filter` were created for,
// `fetch_state`/`filter_state` are the states that `fetch/filter` were initialized with
Q::set_archetype(
&mut self.fetch,
&self.query_state.fetch_state,
archetype,
self.tables,
);
// SAFETY: `table` is from the world that `fetch/filter` were created for,
// `fetch_state`/`filter_state` are the states that `fetch/filter` were initialized with
F::set_archetype(
&mut self.filter,
&self.query_state.filter_state,
archetype,
self.tables,
);
// SAFETY: set_archetype was called prior.
// `location.index` is an archetype index row in range of the current archetype, because if it was not, the match above would have `continue`d
if F::archetype_filter_fetch(&mut self.filter, location.index) {
// SAFETY: set_archetype was called prior, `location.index` is an archetype index in range of the current archetype
return Some((Q::archetype_fetch(&mut self.fetch, location.index), item));
}
}
None
}

/// Get the next item from the iterator.
#[inline(always)]
pub fn fetch_next(&mut self) -> Option<(QueryItem<'_, Q>, I::Item)> {
// safety: we are limiting the returned reference to self,
// making sure this method cannot be called multiple times without getting rid
// of any previously returned unique references first, thus preventing aliasing.
unsafe {
self.fetch_next_aliased_unchecked()
.map(|(q_item, item)| (Q::shrink(q_item), item))
}
}
}

impl<'w, 's, Q: ReadOnlyWorldQuery, F: ReadOnlyWorldQuery, I: Iterator, MapFn> Iterator
for QueryJoinMapIter<'w, 's, Q, F, I, MapFn>
where
MapFn: FnMut(&I::Item) -> Entity,
{
type Item = (QueryItem<'w, Q>, I::Item);

#[inline(always)]
fn next(&mut self) -> Option<Self::Item> {
// SAFETY: it is safe to alias for ReadOnlyWorldQuery
unsafe { self.fetch_next_aliased_unchecked() }
}

fn size_hint(&self) -> (usize, Option<usize>) {
let (_, max_size) = self.list.size_hint();
(0, max_size)
}
}

// This is correct as QueryJoinMapIter always returns `None` once exhausted.
impl<'w, 's, Q: ReadOnlyWorldQuery, F: ReadOnlyWorldQuery, I: Iterator, MapFn> FusedIterator
for QueryJoinMapIter<'w, 's, Q, F, I, MapFn>
where
MapFn: FnMut(&I::Item) -> Entity,
{
}

/// An iterator over `K`-sized combinations of query items without repetition.
///
/// In this context, a combination is an unordered subset of `K` elements.
Expand Down
72 changes: 70 additions & 2 deletions crates/bevy_ecs/src/query/state.rs
Original file line number Diff line number Diff line change
Expand Up @@ -3,7 +3,9 @@ use crate::{
component::ComponentId,
entity::Entity,
prelude::FromWorld,
query::{Access, FilteredAccess, QueryCombinationIter, QueryIter, WorldQuery},
query::{
Access, FilteredAccess, QueryCombinationIter, QueryIter, QueryJoinMapIter, WorldQuery,
},
storage::TableId,
world::{World, WorldId},
};
Expand Down Expand Up @@ -642,6 +644,50 @@ impl<Q: WorldQuery, F: WorldQuery> QueryState<Q, F> {
}
}

/// Returns an [`Iterator`] over the inner join of the results of a query and list of items mapped to [`Entity`]'s.
///
/// This can only be called for read-only queries, see [`Self::iter_join_map_mut`] for write-queries.
#[inline]
pub fn iter_join_map<'w, 's, I: IntoIterator, MapFn: FnMut(&I::Item) -> Entity>(
&'s mut self,
world: &'w World,
list: I,
map_f: MapFn,
) -> QueryJoinMapIter<'w, 's, Q::ReadOnly, F::ReadOnly, I::IntoIter, MapFn> {
self.update_archetypes(world);
// SAFETY: Query has unique world access.
unsafe {
self.as_readonly().iter_join_map_unchecked_manual(
world,
world.last_change_tick(),
world.read_change_tick(),
list,
map_f,
)
}
}

/// Returns an iterator over the inner join of the results of a query and list of items mapped to [`Entity`]'s.
#[inline]
pub fn iter_join_map_mut<'w, 's, I: IntoIterator, MapFn: FnMut(&I::Item) -> Entity>(
&'s mut self,
world: &'w mut World,
list: I,
map_f: MapFn,
) -> QueryJoinMapIter<'w, 's, Q, F, I::IntoIter, MapFn> {
self.update_archetypes(world);
// SAFETY: Query has unique world access.
unsafe {
self.iter_join_map_unchecked_manual(
world,
world.last_change_tick(),
world.read_change_tick(),
list,
map_f,
)
}
}

/// Returns an [`Iterator`] over the query results for the given [`World`].
///
/// # Safety
Expand Down Expand Up @@ -704,7 +750,6 @@ impl<Q: WorldQuery, F: WorldQuery> QueryState<Q, F> {
///
/// This does not check for mutable query correctness. To be safe, make sure mutable queries
/// have unique access to the components they query.
/// This does not check for entity uniqueness
/// This does not validate that `world.id()` matches `self.world_id`. Calling this on a `world`
/// with a mismatched [`WorldId`] is unsound.
#[inline]
Expand All @@ -721,6 +766,29 @@ impl<Q: WorldQuery, F: WorldQuery> QueryState<Q, F> {
QueryManyIter::new(world, self, entities, last_change_tick, change_tick)
}

/// Returns an [`Iterator`] over each item in an inner join on [`Entity`] between the query and a list of items which are mapped to [`Entity`]'s.
///
/// # Safety
///
/// This does not check for mutable query correctness. To be safe, make sure mutable queries
/// have unique access to the components they query.
/// This does not validate that `world.id()` matches `self.world_id`. Calling this on a `world`
/// with a mismatched [`WorldId`] is unsound.
#[inline]
pub(crate) unsafe fn iter_join_map_unchecked_manual<'w, 's, I: IntoIterator, MapFn>(
&'s self,
world: &'w World,
last_change_tick: u32,
change_tick: u32,
list: I,
map_f: MapFn,
) -> QueryJoinMapIter<'w, 's, Q, F, I::IntoIter, MapFn>
where
MapFn: FnMut(&I::Item) -> Entity,
{
QueryJoinMapIter::new(world, self, last_change_tick, change_tick, list, map_f)
}

/// Returns an [`Iterator`] over all possible combinations of `K` query results for the
/// given [`World`] without repetition.
/// This can only be called for read-only queries.
Expand Down
52 changes: 52 additions & 0 deletions crates/bevy_ecs/src/system/mod.rs
Original file line number Diff line number Diff line change
Expand Up @@ -136,6 +136,7 @@ mod tests {
bundle::Bundles,
component::{Component, Components},
entity::{Entities, Entity},
event::{EventReader, Events},
prelude::AnyOf,
query::{Added, Changed, Or, With, Without},
schedule::{Schedule, Stage, SystemStage},
Expand Down Expand Up @@ -1187,4 +1188,55 @@ mod tests {
}
});
}

#[test]
fn iter_join_map() {
struct DamageEvent {
target: Entity,
damage: f32,
}

#[derive(Component, PartialEq, Debug)]
struct Health(f32);

let mut world = World::new();

let e1 = world.spawn().insert(Health(200.)).id();
let e2 = world.spawn().insert(Health(100.)).id();

let mut events = Events::<DamageEvent>::default();

events.extend([
DamageEvent {
target: e1,
damage: 50.,
},
DamageEvent {
target: e2,
damage: 80.,
},
DamageEvent {
target: e1,
damage: 150.,
},
]);

world.insert_resource(events);

fn process_damage_events(
mut health_query: Query<&mut Health>,
mut event_reader: EventReader<DamageEvent>,
) {
let mut join =
health_query.iter_join_map_mut(event_reader.iter(), |event| event.target);
while let Some((mut health, event)) = join.fetch_next() {
health.0 -= event.damage;
}
}
run_system(&mut world, process_damage_events);

run_system(&mut world, move |query: Query<&Health>| {
assert_eq!([&Health(0.), &Health(20.)], query.many([e1, e2]));
});
}
}
Loading