micropython/tests/perf_bench/bm_wordcount.py

46 wiersze
1.6 KiB
Python

# This tests using string as dictionary keys when they are not qstrs
ZEN = "the zen of python beautiful is better than ugly explicit is better than implicit simple is better than complex complex is better than complicated flat is better than nested sparse is better than dense readability counts special cases arent special enough to break the rules although practicality beats purity errors should never pass silently unless explicitly silenced in the face of ambiguity refuse the temptation to guess there should be one and preferably only one obvious way to do it although that way may not be obvious at first unless youre dutch now is better than never although never is often better than right now if the implementation is hard to explain its a bad idea if the implementation is easy to explain it may be a good idea namespaces are one honking great idea lets do more of those"
def test(niter):
words = ZEN.split(" ")
for _ in range(niter):
counts = {}
for _ in range(niter):
for word in words:
counts[word] = counts.get(word, 0) + 1
return (
counts["python"],
counts["is"],
counts["than"],
)
###########################################################################
# Benchmark interface
bm_params = {
(32, 10): (2,),
(50, 10): (4,),
(100, 10): (8,),
(500, 10): (40,),
(1000, 10): (80,),
(5000, 10): (400,),
}
def bm_setup(params):
(niter,) = params
state = None
def run():
nonlocal state
state = test(niter)
def result():
return niter, state
return run, result