micropython

Commit Graph

Author	SHA1	Message	Date
Paul Sokolovsky	e918fc5e37	tests/bench: Add testcase to compare bytes(N) vs b"\0" * N. Based on python-dev discussion regarding PEP467.	9 years ago
Paul Sokolovsky	8c35f3979c	tests: Update for _io/_collections module having been renamed.	9 years ago
stijn	12340147b0	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	10 years ago
Paul Sokolovsky	74c710187c	bench: Three ways to process a byte buffer.	11 years ago
Paul Sokolovsky	59ced651b5	bench: Add test for map() vs inplace operations in array-likes. map() is 5 times slower. That's mostly because of inefficiency of creating containers from iterables of unknown length (like map()).	11 years ago
Paul Sokolovsky	17db096505	bench: Add tests for constructing various containers from iterator. Both "bound" (like, length known) and "unbound" (length unknown) are tested. All of list, tuple, bytes, bytesarray offer approximately the same performance, with "unbound" case being 30 times slower.	11 years ago
Paul Sokolovsky	e53d2197e4	bench: Add test for function call overhead. For a trivial operation, calling a function is 5 times slower than doing operation inline.	11 years ago
Paul Sokolovsky	69cbec4afb	tests/bench: Add testcase for positional/kwargs to enumerate(). Inspired by discussion in #577. So, in this case of builtin function, passing args by keyword has less than 1% overhead.	11 years ago
Paul Sokolovsky	2a05f05f44	tests/bench: Add tests for various ways to pass function args. Passing 3 args with keywords is for example 50% slower than via positional args.	11 years ago
Paul Sokolovsky	1695151267	tests/bench: Add variation on loop_count/while_down_ne test.	11 years ago
Paul Sokolovsky	6638ea9ca3	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.	11 years ago
Paul Sokolovsky	52b25293e2	tests/bench: Time namedtuple field access. That's higher than instance field access - behold the power of hashing.	11 years ago
Paul Sokolovsky	f01fa458d8	tests/bench/var: Add tests for class/instance var access. Also compared with method abstraction for accessing instance vars - it's more than 3 times slower than accessing var directly.	11 years ago
Paul Sokolovsky	aaff82afe5	tests: Add framework for comparative benchmarking. Motivation is optimizing handling of various constructs as well as understanding which constructs are more efficient in MicroPython. More info: http://forum.micropython.org/viewtopic.php?f=3&t=77 Results are wildly unexpected. For example, "optimization" of range iteration into while loop makes it twice as slow. Generally, the more bytecodes, the slower the code.	11 years ago

14 Commits (3b3612c65b2de4fdb2d21945e98d1dad7e46b6d6)