> Looking at your benchmark, random.choice(letters) has probably less overhead > than letters[random.randint(...)]. You might even try to inline it as
Right... random.choice()... I'm a bit new to python, always something to learn. But anyway in that benchmark (from http://bugs.python.org/issue9520 ) the code that generate 'words' takes 90% of the time. And I'm really looking at deltas between different methods, not the absolute value. I was also using different code to get benchmarks for my previous message... Here's the code: #!/usr/bin/python # -*- coding: utf-8 -*- import os, time, re, array start = time.time() d = dict() for i in xrange(0, 1000000): d[unicode(i).encode('utf-8')] = array.array('i', (i, i+1, i+2, i+3, i+4, i+5, i+6)) dt = time.time() - start vm = re.findall("(VmPeak.*|VmSize.*)", open('/proc/%d/status' % os.getpid()).read()) print "%d keys, %s, %f seconds, %f keys per second" % (len(d), vm, dt, len(d) / dt) -- http://mail.python.org/mailman/listinfo/python-list
