Skip to main content


Eclipse Community Forums
Forum Search:

Search      Help    Register    Login    Home
Home » Modeling » OCL » Complex query help(complex query on the diamond problem)
Complex query help [message #1803450] Thu, 28 February 2019 20:31 Go to next message
Jonathan Marino is currently offline Jonathan MarinoFriend
Messages: 8
Registered: May 2015
Junior Member
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 #1803459 is a reply to message #1803450] Fri, 01 March 2019 05:52 Go to previous messageGo to next message
Ed Willink is currently offline Ed WillinkFriend
Messages: 6437
Registered: July 2009
Senior Member
Your question makes no sense and assumes a knowledge of a diamond problem.
Re: Complex query help [message #1803729 is a reply to message #1803459] Thu, 07 March 2019 17:56 Go to previous message
Jonathan Marino is currently offline Jonathan MarinoFriend
Messages: 8
Registered: May 2015
Junior Member
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?
Previous Topic:OCL query from file
Next Topic:Announce OCL 6.7.0
Goto Forum:
  


Current Time: Sun Aug 18 19:27:39 GMT 2019

Powered by FUDForum. Page generated in 0.01361 seconds
.:: Contact :: Home ::.

Powered by: FUDforum 3.0.2.
Copyright ©2001-2010 FUDforum Bulletin Board Software

Back to the top