On Aug 26, 2008, at 5:01 AM, Ales Hvezda wrote: > > [snip] >> There is some concern over performance calculating distances to all >> objects within a complex or text object. On my test machine, I did >> not notice any performance problems with the algorithm searching >> through all objects on the page, including all the objects within >> those objects. (1.6 GHz Celeron Laptop) The initial bounding box >> test in this patch should improve O(n). > > I'm curious to hear if anybody notices this performance difference. > >> >> Some may not like the new "feel" of the selection mechanism. For >> instance, to select a component, the user must click on an actual >> object of the component (line, box, text, etc...) to select it. >> Clicking in the middle of the component where no object exists will >> not work. Some may prefer this mechanism, such as engineers that put >> text in the middle of their components, like "BOOT EEPROM," or "BANK >> 0," etc... > > I noticed this as well, but I don't think it is too much of a problem > (different yes, but I got used to it). Time will tell. > > One change I would like to see though, if a circle or rectangle are > filled > (either full or hatch), clicking anywhere inside should select that > object. > Right now you have to click on the edge of a filled shape to select > it and > that is kind of odd.
This would be an easy modification. I'll can do it fairly quickly. > Thanks, > -Ales Cheers, Ed _______________________________________________ geda-dev mailing list [email protected] http://www.seul.org/cgi-bin/mailman/listinfo/geda-dev
