Hi,
how to do the following thing in setdef language:
1. suppose i have the following referencing scheme
A<-C<-B
2. I do a selection of set of A objects based on C class (reachable from C)
3. I want to select distinct instances of B which inderectly references to selected A objects..
Is it possible? Paths between sets is not the thing as it does not have a distinct condition.
How to do such thing in set def language?
-
- Posts: 6172
- Joined: Wed Aug 11, 2004 8:37 am
Hi,
This is not possible at the moment.
I think that adding a tag that defines objects lying on paths to given set X should solve this use case. I.e. this could be like
all_objects_on_paths_to(A<-C) AND B
where all_objects_on_paths_to is the new proposed tag.
What do you think?
As a workaround, please define a set for the A's according to the scheme.
Then please use "Memory | Predefined Set..." action, and then apply Find Paths to the result.
Best regards,
Anton
This is not possible at the moment.
I think that adding a tag that defines objects lying on paths to given set X should solve this use case. I.e. this could be like
all_objects_on_paths_to(A<-C) AND B
where all_objects_on_paths_to is the new proposed tag.
What do you think?
As a workaround, please define a set for the A's according to the scheme.
Then please use "Memory | Predefined Set..." action, and then apply Find Paths to the result.
Best regards,
Anton