GEF session

Randy and Pratik are presenting again, this time in the big room (where the keynotes/plenaries are held.)

New in 3.1:

ShortestPathConnectionRouter – cool on a computer science standpoint, but also useful if you want to automatically route connections around shapes without having the user maintain them (or actually the bends in them.) Algorithm details: they have an “optimistic oval” and then use Djikstra. Then there are additional steps needed to resolve problems with multiple connections that are very close to each other, which causes the user to lose track of them at the crossover points.

During the demo, the routing is very quick. Turning it on and off is instantaneous. Nice. Kudos also for running a demo without crashing. :)

EDiagram Example. This is EMF integration with GEF. Cool. I downloaded this on Monday via CVS while I was grabbing the other GEF examples. This example let me create a UML diagram with packages, classes with operations and attributes, and notes. I wonder how long before someone does diagram reverse engineering of their Java code with this.

They’re looking for help with the EDiagram example. Look for the keyword: helpwanted in Bugzilla. You can find this from a link on the GEF home page.

Another new feature in GEF: WYSIWYG rich text editing, which lets you have structured text, multiple fonts, non-textual elements like bullets, numbered lists, etc. This is implemented in org.eclipse.draw2d.text.

Randy was calling for participation, specifically with reporting bugs and submitting patches, but listed a bunch of other ways you can participate. Thinking back to the Google keynote, data via the way of use cases would probably be good too.