'ifdZddlZddlmZddlmZeedZGddej Zy) zUTests to show that the benchmarks we based our speed optimizations on are still validN)partial)timeiti )numberceZdZdZdZdZy)TestBenchmarkschtdd}tdd}|j||k|d|y)z4See what's faster at int key lookup: dicts or lists.zitem = l[9000]zl = [0] * 10000zitem = d[9000]z d = {x: 0 for x in range(10000)}z < Nr assertTrue)self list_time dict_times S/var/www/br/venv/lib/python3.12/site-packages/parsimonious/tests/test_benchmarks.pytest_lists_vs_dictsz"TestBenchmarks.test_lists_vs_dicts s8+->? +-OP   I-Iy/QRcjtdd}tdd}|j||k|d|dy)zHow bad is the calling penalty?z l[0] += 1zl = [0]zadd(); l[0] += 1zl = [0] def add(): passz (no call) < z (call)Nr )r no_callcalls rtest_call_vs_inlinez"TestBenchmarks.test_call_vs_inlines9i0(+56 $gt(TUrcjtdd}tdd}|j||k|d|dy)z;Can I beat the speed of regexes by special-casing literals?zr.match(t, 19)zEimport re r = re.compile('hello') t = 'this is the finest hello ever'zt.startswith('hello', 19)z#t = 'this is the finest hello ever'z (startswith) < z (re)Nr )r re_timestartswith_times rtest_startswith_vs_regexz'TestBenchmarks.test_startswith_vs_regexsE  23 !!r!s3  '"FX&&"Fr