Eclipse Community Forums: OCL » Complex query help

Help

Home

Home » Modeling » OCL » Complex query help(complex query on the diamond problem)

Show: Today's Messages :: Show Polls :: Message Navigator

Complex query help [message #1803450]

Thu, 28 February 2019 20:31

Jonathan Marino

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

Report message to a moderator

Re: Complex query help [message #1803459 is a reply to message #1803450]

Fri, 01 March 2019 05:52

Ed Willink

Messages: 7655
Registered: July 2009

Senior Member

Your question makes no sense and assumes a knowledge of a diamond problem.

Report message to a moderator

Re: Complex query help [message #1803729 is a reply to message #1803459]

Thu, 07 March 2019 17:56

Jonathan Marino

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?

Report message to a moderator

Previous Topic:	OCL query from file
Next Topic:	Announce OCL 6.7.0

Goto Forum:

-=] Back to Top [=-

[ Syndicate this forum (XML) ] [

]

Current Time: Tue Apr 16 07:57:06 GMT 2024

.:: Contact :: Home ::.

Breadcrumbs

Sign up to our Newsletter