I'm resubmitting the selection mechanism patch. It has some whitespace corrections and one of Peter Clifton's suggested modifications, all integrated into one "perfect" patch.
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). 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... This patch replaces all previous patches from me with the titles: [PATCH] Altered point selection mechanism to use distance instead of bounding box. [PATCH] Optimized o_find() Cheers, Ed _______________________________________________ geda-dev mailing list [email protected] http://www.seul.org/cgi-bin/mailman/listinfo/geda-dev
