speedup up dictionary access

[Courageous]

On Sat, 12 May 2001 17:21:32 -0400, Roy Smith <roy at panix.com> wrote:

>One of the big time consumers in an application I'm writing is a cache 
>lookup in the inner loop of the program.  Right now, it looks something 
>like this:
>
>   if (self.cache.has_key (name) and self.cache[name]) or self.check (name):
>      do stuff

Try
	cache = self.cache
                   if (cache.has_key (name) and cache[name]) or self.check (name):
                        do stuff

You may also wish to ask yourself how likely the self.check() function is to
resolve to be true; if it's likely, put the check() call first.



C//