Moose-dev October 2012

moose-dev@list.inf.unibe.ch

25 participants
139 discussions

[Fwd: Re: [Pharo-project] Roassal Survey]
by Ben Coman 06 Oct '12

06 Oct '12

moved to moose-dev Ciprian, Thanks for your detailed reply. Some comments inline... Ciprian Teodorov wrote: > Hi Ben, > > Sorry for the delay, I was very bussy these last few days. Attached to this > mail you will find some drawings showing what I mean. > > The first attachement [1] show the two most important graph concepts that > are needed for circuit design: the support for hyper-edges, and the ports > crossing hierarchical nodes. > The hyper-edges are useful to represent physical wires (which are connected > to a source, and then provide input to a number of sinks). > hyper-edges: Can you comment on how close Roassal Easel > #ROMondrianExample > #edges > orthoVerticalLine comes to your need for hyper-edges. Try arranging the nodes in various configurations. Note however... that where you have three "ortho" segments making up an edge and it looks like the first segment is shared by all edges, actually each edge has three segments each and the first segments are being drawn over the top of each other. Would that be significant? > The hierarchical crossings can be thought as the physical pins of an > integrated circuit, that are plugged into a socket in order to integrate > that circuit into a system. > hierarchical-crossing: Check out Roassal Easel > #ROMondrianExample > #edges > attachPoint. Also look at the coding of ROAttachPoint and subclasses, and in particular ROShorterDistanceAttachPoint>>fourFromPointsOfEdge: and >>fourToPointsOfEdge:. I think the way this has been done is quite elegant and building on these to create hierarchical-crossings might not be too hard. You might try it. Perhaps these might be called ROOuterAttachPoint and ROInnerAttachPoint and would respectively check to see if the connecting element is a contained sub-element. Alexandre, I think this example shows what I was badly hinting at with my "ROElement>>mostSpecificParentCommonWith:" thread. This used to decide which level within a hierarchy of sub-element edges are stored. Referring to the first attachement of Cipirian's post "Figure 2(a)", I think in this case the "inner" edges should be stored as part of the "Composite" element, but I think currently they would be stored in the parent of "Composite". Also I had been thinking for a while that it would be nice to be able to have AttachPoints rendered - both as permanently-visible and also visible-on-hover-only, so that when I re-implement the edge rubber-banding to interactive draw lines between elements (which I demoed to you a while ago on Mondrian) the user could drop the edge-end onto a specific AttachPoint. > The second, and third attachement are the same (only the format differs pdf > vs png). They show a detailed example of the hierarchical structure that I > imagine. The main elements of this graphs are: the leaf nodes, the edges, > the hierarchical nodes, the pins, and the ports. > The leaf nodes are just the typical graph nodes. The edges are just links > between nodes. > The hierarchical nodes are graphs themselves, but they can be connected one > to another using edges. However these connections between hierarchical > nodes are done through the pins present on their interface. If such a > hierarchical node wants to be connected to the exterior it has to have pins > so that the layout algorithm can be constrained to route the edges to these > pins (which can be either free or have fixed positions). > The ports in my figure are just ways to group together a number of pins. > > In the figure you will see three graphs (corresponding to three views on > the leftmost graph). > The first one (on the left) just represents the top-level graph with all > hierarchical nodes collapsed. This graph itself has a number of ports so > that it can be embedded in another one. > The second one (in the middle) shows an expanded view of the central > hierarchical node in the top-level graph. This one is expanded into another > view. > The third one (in the right) shows yet another expanded view, this time of > a node in the middle graph. This last graph contains two hierarchical nodes > itself that are expanded in place. > > Now the idea of edges crossing hierarchy boundaries through pins is that > the inner-most hierarchical nodes can be layed out separately and then > collapsed, their containers can be layed out just like a simple graph (in > the case their nodes are collapsed). However if one node is a hierarchical > one, and is expanded, the layout algorithm does not have to layout the > contents inside this hierarchical node, it just layouts the whole graph > considering the pins as fixed nodes to which it will route the links. This > way when expanded the hierarchical nodes retain their initial layout, > moreover this initial layout takes into account the fact that the node will > be embedded into a larger graph and thus it will place the pins on the > boundary. > What do you think of Roassal Easel > Examples > ROExample > #interaction > zooming and ROExample > #interaction > expandableNodesOn: ? > FYI the graphs shown in the last two attachements where automatically > generated from a circuit design, they were imported into the Yed diagram > editor, one by one, layed out semi-automatically (used force-based layout > initially, an then moved a number of nodes manually to align them well - ex > the straight edges were obtained by manually moving the nodes). Just > imagine how boring this process is. Moreover since I had to represent the > pins, and the ports just as plain graph nodes grouped together the layout > algorithms don't have any idea that these nodes are special, thus they > place them everywhere, even more if the groups are expanded their inner > nodes are layouted along with the embedding hierarchy... resulting in a > mess. > > Cheers, > Ciprian > * > * > *References:* > [1] Miro Sponemann, Hauke Fuhrmann, Reinhard von Hanxleden, and Petra > Mutzel. > Port constraints in hierarchical layout of data > flow<http://rtsys.informatik.uni-kiel.de/~biblio/downloads/papers/gd09.pdf> > diagrams<http://rtsys.informatik.uni-kiel.de/~biblio/downloads/papers/gd09.pdf> > . > In David Eppstein and Emden Gansner, editors, Graph Drawing, volume 5849 of > Lecture Notes in Computer Science, chapter 14. > Springer Berlin / Heidelberg, Berlin, Heidelberg, 2010. > > On Thu, Sep 27, 2012 at 3:35 PM, Ben Coman <btc(a)openinworld.com> wrote: > > >> Ciprian Teodorov wrote: >> >> >>> Another feature that I think it is missing in most (if not all) graph >>> viewers/layout systems/editors is the possibility to have connection ports >>> on the hierarchical nodes in order to preserve the connections passing >>> through the hierarchy. >>> >>> some pointers: >>> >>> http://www.slideshare.net/**teodorov/tools-and-**crossbarbased-nanocmos-* >>> *architectures<http://www.slideshare.net/teodorov/tools-and-crossbarbased-nanocmos-archite…> >>> >>> http://stiff.univ-brest.fr/~**cteodorov/manuscript-teodorov_**FINAL.pdf<http://stiff.univ-brest.fr/~cteodorov/manuscript-teodorov_FINAL.pdf> >>> >>> >>> Cheers, >>> >>> Ciprian Teodorov >>> >>> >>> On Sep 26, 2012 6:16 PM, "Vanessa Peña Araya" <van.c.pena(a)gmail.com> >>> wrote: >>> >>> >>> >>> >> Ciprian, >> >> I have skimmed through those links but can't quite understand your comment >> "in order to preserve the connections passing through the hierarchy" Can >> you expand some more on that - perhaps with a mock up in a paint program? >> >> If you are interested in following the development of Roassal, perhaps >> move your follow up to https://www.iam.unibe.ch/** >> mailman/listinfo/moose-dev<https://www.iam.unibe.ch/mailman/listinfo/moose-dev>. >> <https://www.iam.unibe.ch/**mailman/listinfo/moose-dev<https://www.iam.unibe.ch/mailman/listinfo/moose-dev> >> >> I have been very encouraged by the clean architecture and the >> responsiveness of the main developers to feature suggestions. >> >> cheers, Ben >> >> >> > > > > > ------------------------------------------------------------------------ >

1 0

Status of PetitDelphi, a first visualization
by Stephan Eggermont 06 Oct '12

06 Oct '12

Hi, We're slowly building up the parse tree of a Delphi project. Here is the first visualization: The WhiteStarUML project is a GPL tool written in Delphi. It consists of 89 units at the interface level. There might be more units that are referred to in the implementation. 4 units cannot be found to be parsed, 5 units cannot be parsed. For each unit the number of classes defined in the interface is shown as a yellow square. Cheers, Diego & Stephan

5 4

Arki demo
by Simon Denier 05 Oct '12

05 Oct '12

Hello guys Is there any demo of Arki in the standard Moose distribution? I would like to give a demo of Moose, including an example with a user browsing custom concerns. I did not see any sample for Arki in Moose 4.6 -- Simon

2 2

Re: Issue 361 in moose-technology: Glamour status bar should take into account Mondrian window status
by moose-technology＠googlecode.com 04 Oct '12

04 Oct '12

Updates: Status: WontFix Comment #1 on issue 361 by alexandr...(a)gmail.com: Glamour status bar should take into account Mondrian window status http://code.google.com/p/moose-technology/issues/detail?id=361 In Roassal, we should instead add an element about this. It should not take that long to do it.

4 5

Fwd: [Esug-list] Call for PhD candidates in the Software Composition Group, U Bern
by Tudor Girba 04 Oct '12

04 Oct '12

FYI Doru ---------- Forwarded message ---------- From: Oscar Nierstrasz <oscar.nierstrasz(a)gmail.com> Date: Thu, Oct 4, 2012 at 2:06 PM Subject: [Esug-list] Call for PhD candidates in the Software Composition Group, U Bern To: esug-list(a)lists.esug.org Applications are invited for PhD candidates at the Software Composition Group, University of Bern, Switzerland, to contribute to the SNSF project "Agile Software Assessment". The Software Composition Group carries out research in software analysis and programming language design and implementation, with a view to enabling software evolution. The SCG is led by Prof. Oscar Nierstrasz and is part of the Institute of Computer Science and Applied Mathematics (IAM) at the University of Berne. Details about the research project can be found here: http://scg.unibe.ch/research/snf13 The candidate must have a MSc in Computer Science (equivalent to a Swiss MSc), should demonstrate strong programming skills, and have research interests in several of the following areas: - software evolution - program understanding - software modeling - model-driven engineering - reverse engineering - domain specific languages - dynamic analysis - integrated development environments - programming language design - virtual machine technology To apply, please send an email including your CV to Prof. Oscar Nierstrasz (oscar(a)iam.unibe.ch). --- Prof. Dr. O. Nierstrasz -- oscar(a)iam.unibe.ch Software Composition Group -- http://scg.unibe.ch/oscar University of Bern -- Tel/Fax +41 31 631.4618/3355 _______________________________________________ Esug-list mailing list Esug-list(a)lists.esug.org http://lists.esug.org/mailman/listinfo/esug-list_lists.esug.org -- www.tudorgirba.com "Every thing has its own flow"

1 0

Issue 835 in moose-technology: MooseGroup symbolsUsedInName uses deprecated methods
by moose-technology＠googlecode.com 03 Oct '12

03 Oct '12

Status: New Owner: ---- Labels: Type-Defect Priority-Medium New issue 835 by step...(a)stack.nl: MooseGroup symbolsUsedInName uses deprecated methods http://code.google.com/p/moose-technology/issues/detail?id=835 String withoutTrailingBlanks and withoutLeadingBlanks Fixed in Moose-MondrianPaintings-Stephan.Eggermont.170 in http://www.squeaksource.com/Moose Additional information: platform, context which may impact the problem Please fill in the labels with the following information: * Type-Defect * Component-Mondrian

1 1

Re: Issue 396 in moose-technology: Mondrian should provide teh start and end nodes in the edge action
by moose-technology＠googlecode.com 03 Oct '12

03 Oct '12

Updates: Cc: tudor.girba Comment #1 on issue 396 by alexandre.bergel: Mondrian should provide teh start and end nodes in the edge action http://code.google.com/p/moose-technology/issues/detail?id=396 I started to work on this (testHandlerOnEdge). However, I am unsure for few things. view interaction on: MOMouseDown do: [ :v | ... ] What v is supposed to be? The announcement or the value on which one has clicked? It has to be the value I believe. However, it may brake already existing code. We could leave it like this, and introduce on:withValueDo: What do you think? Cheers, Alexandre

1 1

Re: Issue 398 in moose-technology: From and To positions need extension
by moose-technology＠googlecode.com 03 Oct '12

03 Oct '12

Updates: Status: WontFix Comment #1 on issue 398 by alexandr...(a)gmail.com: From and To positions need extension http://code.google.com/p/moose-technology/issues/detail?id=398 fromPositions: and toPositions: have disapeared in Roassal. Objects have to be used instead of selectors

1 0

Issue 698 in moose-technology: Mondrian does not properly raise MOElementSelection
by moose-technology＠googlecode.com 03 Oct '12

03 Oct '12

Status: New Owner: ---- CC: alexandr...(a)gmail.com Labels: Type-Defect Priority-High Component-Mondrian Milestone-4.6 New issue 698 by tudor.gi...(a)gmail.com: Mondrian does not properly raise MOElementSelection http://code.google.com/p/moose-technology/issues/detail?id=698 When in Glamour, often when selecting a Mondrian element does not populate the selection because the MOCanvas does not raise MOElementSelection. The reason for this seems to be a race condition due to changes in the announcement framework. In the new announcement framework from Pharo 1.3, the order of announcements is not guaranteed. The issue seems to be due to the logic of the announcement: MOCanvas>>mouseUp: .. (lastEnteredGraphElement isNil not and: [ (lastEnteredGraphElement class ~~ MORoot and: [ lastEnteredGraphElement isNotSelected ])]) ifTrue: [ selectionEvent := MOElementSelection event: anEvent on: lastEnteredGraphElement. anEvent commandKeyPressed ifTrue: [ selectionEvent setAsMultiple ]. self announce: selectionEvent. anEvent wasHandled: true. ^ self ]. Sometimes, "lastEnteredGraphElement isNotSelected" returns false because somehow the element gets selected beforehand. This is most likely related to the fact that the selection of a node actually happens by handling the same MOElementSelection announcement: MOCanvas>>announce: anAnnouncement ... anAnnouncement element isNil ifFalse: [ anAnnouncement element announcer announce: anAnnouncement ]. self announcer announce: anAnnouncement. MOViewRenderer>>setUsefulHandlersForNodes ... self interaction on: MOElementSelection do: [:ann | ann isUnique ifTrue: [ self root allSelectedNodes do: [ :node | node deselect; announce: (MOElementDeselection new) ] ]. ann element select. self updateWindow ].

4 15

Re: Issue 113 in moose-technology: Lazy edges in Mondrian
by moose-technology＠googlecode.com 03 Oct '12

03 Oct '12

Updates: Labels: -Milestone-4.2 Comment #5 on issue 113 by tudor.gi...(a)gmail.com: Lazy edges in Mondrian http://code.google.com/p/moose-technology/issues/detail?id=113 Should we postpone this one until later?

2 5

Jump to page:

2025

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

Moose-dev October 2012