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

Allow traversing arbitrary relations in a single query #1453

Open
RiscadoA opened this issue Jan 27, 2025 · 0 comments
Open

Allow traversing arbitrary relations in a single query #1453

RiscadoA opened this issue Jan 27, 2025 · 0 comments
Labels
A-Core B-ECS D-Complex Looks hard P-Normal This issue isn't a big priority, but it would still be nice to have it closed soon S-Needs-Design Demands some time designing an implementation

Comments

@RiscadoA
Copy link
Member

Problem

Currently, if it isn't possible to write a Query which matches against all entities who have an ancestor with a given component.

For example, imagine you have a scene such as:

  • foo (component A)
    • bar (component B)
      • baz (component B)

And you want to write a query which matches against (bar, foo) and (baz, foo), such as:

Query<const B&, Indirect<const ChildOf&>, const A&>

I.e., the ChildOf relation could be indirect

Solution

Needs design.

@RiscadoA RiscadoA added A-Core B-ECS D-Complex Looks hard P-Normal This issue isn't a big priority, but it would still be nice to have it closed soon S-Needs-Design Demands some time designing an implementation labels Jan 27, 2025
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
A-Core B-ECS D-Complex Looks hard P-Normal This issue isn't a big priority, but it would still be nice to have it closed soon S-Needs-Design Demands some time designing an implementation
Projects
None yet
Development

No branches or pull requests

1 participant