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

[Merged by Bors] - Added example of entity sorting by components #1817

Closed
wants to merge 9 commits into from
26 changes: 26 additions & 0 deletions crates/bevy_ecs/src/world/mod.rs
Original file line number Diff line number Diff line change
Expand Up @@ -444,6 +444,32 @@ impl World {
/// assert_eq!(world.get::<Position>(entities[0]).unwrap(), &Position { x: 1.0, y: 0.0 });
/// assert_eq!(world.get::<Position>(entities[1]).unwrap(), &Position { x: 0.0, y: 1.0 });
/// ```
///
/// To iterate over entities in a deterministic order,
/// sort the results of the query using the desired component as a key.
YohDeadfall marked this conversation as resolved.
Show resolved Hide resolved
/// Note that it requires fetching the whole result set from the query
YohDeadfall marked this conversation as resolved.
Show resolved Hide resolved
/// and allocation of a [Vec] to store it.
///
/// ```
/// use bevy_ecs::{entity::Entity, world::World};
/// let mut world = World::new();
/// let a = world.spawn().insert_bundle((2, 4.0)).id();
/// let b = world.spawn().insert_bundle((3, 5.0)).id();
/// let c = world.spawn().insert_bundle((1, 6.0)).id();
/// let mut entities = world.query::<(Entity, &i32, &f32)>()
/// .iter(&world)
/// .collect::<Vec<_>>();
/// // Sort by `i32` component
/// entities.sort_by(|x, y| x.1.cmp(&y.1));
YohDeadfall marked this conversation as resolved.
Show resolved Hide resolved
/// for (index, entity) in entities.iter().enumerate() {
/// match index {
/// 0 => assert_eq!(entity, &(c, &1, &6.0)),
/// 1 => assert_eq!(entity, &(a, &2, &4.0)),
/// 2 => assert_eq!(entity, &(b, &3, &5.0)),
/// _ => panic!("not expected"),
/// }
/// }
/// ```
#[inline]
pub fn query<Q: WorldQuery>(&mut self) -> QueryState<Q, ()> {
QueryState::new(self)
Expand Down