What do you mean by « , I can write/change both the Branch directory code as the Trunk directory code » ? De : mdt-papyrus.dev-bounces@xxxxxxxxxxx [mailto:mdt-papyrus.dev-bounces@xxxxxxxxxxx] De la part de Paulo Alexandre Costa Envoyé : jeudi 17 mars 2011 14:05 À : Papyrus Project list Objet : Re: [mdt-papyrus.dev] Help in customization Basically, I intend to add some screens during a profile creation and write some code to change another ones. At the moment, I'am not sure yet about I'll really do but your help was helpful. If I understand correctly what you said, I can write/change both the Branch directory code as the Trunk directory code. Am I Right ? Anyway, I'm really grateful for your help!!!! On Mon, Mar 14, 2011 at 6:09 PM, GERARD Sebastien 166342 <Sebastien.GERARD@xxxxxx> wrote: Hi Paulo, Trunk consist of the most up to date development. Branch is dedicated to “stable versions”. Trunk is on Indigo and will lead to 0.8.x version, whereas 0.7.x is on the branch and is helios-based. What do you intend to add as functionalities? Best… Sébastien. Hi, everybody. I'm interested in knowing better the papyrus 4 uml. My objective is to add more functionalities but i have no clue where do I start. Searching for more informations in the site http://wiki.eclipse.org/MDT/Papyrus, I've found the svn address in which one there are three folders: branches, trunk and tags. So, my first doubt is which of these directories I should download. I'd like to ask all off you where do I Start. Any help would be of great help!
-- Paulo Alexandre da Silva Costa
Universidade Federal do Ceará
"While 2SAT is in P, 3SAT is NP-complete. This shows that innocent changes in a problem may lead to drastic changes in the complexity."
"A velocidade impressionante dos computadores é de utilidade limitada se os programas que neles rodam usam algoritmos ineficientes." _______________________________________________ mdt-papyrus.dev mailing list mdt-papyrus.dev@xxxxxxxxxxx https://dev.eclipse.org/mailman/listinfo/mdt-papyrus.dev
-- Paulo Alexandre da Silva Costa
Universidade Federal do Ceará
"While 2SAT is in P, 3SAT is NP-complete. This shows that innocent changes in a problem may lead to drastic changes in the complexity."
"A velocidade impressionante dos computadores é de utilidade limitada se os programas que neles rodam usam algoritmos ineficientes." |