| Complex query help [message #1803450] |
Thu, 28 February 2019 15:31  |
Eclipse User |
|
|
|
I am doing my engineering thesis in code generation for C language.
I have a query that I have not been able to solve: in the context of the diamond problem (and more complex too), how could I get a Set of OrderedSet(Class) with the different possible ways to get from a class to its ancestor?
I would greatly appreciate your help.
Regards
|
|
|
|
| Re: Complex query help [message #1803729 is a reply to message #1803459] |
Thu, 07 March 2019 12:56  |
| Eclipse User |
|
|
|
I will explain myself better:
We are in uml using multiple inheritance. Let's say we have the following class diagram:
A
/ | \
B C D
| | \ |
| | E
\ | /
F
And we want to get all possible paths from A to F
((A, B, F), (A, C, F), (A, C, E, F), (A, D, E, F))
How can I write a query that throws that result in such a case?
|
|
|
Powered by
FUDForum. Page generated in 0.03866 seconds
Home