On Mon, 14 Feb 2011 02:03:55 -0500 Stefan Monnier <monn...@iro.umontreal.ca> wrote:
>>> IMO the cycling should only be based on scores. That would, I think, >>> accomplish all your items and produce less "DWIM but that's not it." SM> Currently, the cycling code is fairly naive and it uses a fixed ordering SM> based on string length (shorter first). Patches to make it more SM> customizable (by the completion table, not just by the end-user) would SM> be very welcome (e.g. for file completion, it could first cycle through SM> VCS-managed files). Maybe accept the score as a property to the candidate strings and use that property, if it exists, instead of the string length? That would side-step the current completion mechanism nicely, requiring little extra code except in the final sort of candidates. If the strings aren't mangled by the completion mechanism, of course--but I don't think they are after a quick scan. Ted ------------------------------------------------------------------------------ The ultimate all-in-one performance toolkit: Intel(R) Parallel Studio XE: Pinpoint memory and threading errors before they happen. Find and fix more than 250 security defects in the development cycle. Locate bottlenecks in serial and parallel code that limit performance. http://p.sf.net/sfu/intel-dev2devfeb _______________________________________________ bbdb-info@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/bbdb-info BBDB Home Page: http://bbdb.sourceforge.net/
