Hi Ales, On Dienstag, 19. Februar 2008, Ales Hvezda wrote: > > Note: The search for new connections is a linear search over all > > objects whenever the mouse is moved. I'm not sure if it's fast > > enough for large circuits. > > The tiling mechanism inside libgeda was designed just for this > purpose. With the tiling mechanism you can look only for objects that > either in the current tile (based on the mouse position) or nearby > tiles.
I've looked into the code and in my Sedgewick book. Is the tile code based on the ideas of that book? I'll play with the tile mechanism and see whether it's much faster. I'll add a function to the tile code: GList* s_tile_get_object_lists(TOPLEVEL *toplevel, int wx1, int wy1, int wx2, int wy2) The returned list will be a list of object lists of the tiles. I guess some objects are in more than one tile list, isn't it? Regards Werner _______________________________________________ geda-dev mailing list [email protected] http://www.seul.org/cgi-bin/mailman/listinfo/geda-dev
