Allow traversing arbitrary relations in a single query #1453
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
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:
And you want to write a query which matches against
(bar, foo)
and(baz, foo
), such as:I.e., the ChildOf relation could be indirect
Solution
Needs design.
The text was updated successfully, but these errors were encountered: