[Bf-committers] Faster listbase lookups

Joe Eagar joeedh at gmail.com
Sun Oct 22 03:41:50 CEST 2006

Campbell Barton wrote:
> Hey Ed,
> a Hash table could be an interesting way to do name lookups, and worth 
> researching...
Ton suggested this on irc once. . .

Apparently all ID library lists are alphanumerically sorted most of the 
time.  Therefor you could try writing a binary search algorithm.  Or 
just skip ahead through the list four or five entries at a time, until 
you hit a name alphanumerically greater the the name your searching 
for.  then go backwards.


More information about the Bf-committers mailing list