micropython/tests/bench/var-8.1-namedtuple-5th.py

import bench
from _collections import namedtuple

T = namedtuple("Tup", ["foo1", "foo2", "foo3", "foo4", "num"])

def test(num):
    t = T(0, 0, 0, 0, 20000000)
    i = 0
    while i < t.num:
        i += 1

bench.run(test)
tests/bench: Add testcases for lookup in 5-el instance and namedtuple. ... and we have not that bad mapping type after all - lookup time is ~ the same as in one-attr instance. My namedtuple implementation on the other hand degrades awfully. So, need to rework it. First observation is that named tuple fields are accessed as attributes, so all names are interned at the program start. Then, really should store field array as qstr[], and do quick 32/64 bit scan thru it. 2014-05-07 18:33:36 +00:00			`import bench`
			`from _collections import namedtuple`

py: Use sequence of strings for named tuple initialization - remove single string initialization style - take list of strings instead - store list in the type for fast lookup 2014-12-20 15:37:40 +00:00			`T = namedtuple("Tup", ["foo1", "foo2", "foo3", "foo4", "num"])`
tests/bench: Add testcases for lookup in 5-el instance and namedtuple. ... and we have not that bad mapping type after all - lookup time is ~ the same as in one-attr instance. My namedtuple implementation on the other hand degrades awfully. So, need to rework it. First observation is that named tuple fields are accessed as attributes, so all names are interned at the program start. Then, really should store field array as qstr[], and do quick 32/64 bit scan thru it. 2014-05-07 18:33:36 +00:00
			`def test(num):`
			`t = T(0, 0, 0, 0, 20000000)`
			`i = 0`
			`while i < t.num:`
			`i += 1`

			`bench.run(test)`