<feed xmlns='http://www.w3.org/2005/Atom'>
<title>suspect-devices/circuitpython/tests/bench/arrayop-2-list_map.py, branch 5.3.1</title>
<subtitle>CircuitPython - a Python implementation for teaching coding with microcontrollers</subtitle>
<id>https://git.suspectdevices.com/suspect-devices/circuitpython/atom?h=5.3.1</id>
<link rel='self' href='https://git.suspectdevices.com/suspect-devices/circuitpython/atom?h=5.3.1'/>
<link rel='alternate' type='text/html' href='https://git.suspectdevices.com/suspect-devices/circuitpython/'/>
<updated>2014-06-19T19:19:24+00:00</updated>
<entry>
<title>bench: Add test for map() vs inplace operations in array-likes.</title>
<updated>2014-06-19T19:19:24+00:00</updated>
<author>
<name>Paul Sokolovsky</name>
<email>pfalcon@users.sourceforge.net</email>
</author>
<published>2014-06-19T18:54:51+00:00</published>
<link rel='alternate' type='text/html' href='https://git.suspectdevices.com/suspect-devices/circuitpython/commit/?id=59ced651b542941f893293099a932252e498eb7c'/>
<id>urn:sha1:59ced651b542941f893293099a932252e498eb7c</id>
<content type='text'>
map() is 5 times slower. That's mostly because of inefficiency of creating
containers from iterables of unknown length (like map()).
</content>
</entry>
</feed>
