Understanding performance characteristics of common python constructs
Project description
perf-py
A library that personally helps me understand the performance of common python code (and in turn, it might help you understand it too!)
Todo
- Does mapping over an iterator perform better than using generators?
- Does chunking a generator affect performance?
- Does composing generators affect performance?
- Make a table of the performance of each function ...
- Open this up in a notebook!
Personal Reminders
- To publish to pypi w/o an alpha version, push a commit with
Publish To PYPI
in its commit message.
TODO
Chunking and garbage collecting simultaneously
l = list(range(100))
batchsize = 11
while len(l) > 0: print(l) print(l[:batchsize]) del l[:batchsize]
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
perf-py-0.0.1a4.tar.gz
(3.1 kB
view hashes)
Built Distribution
Close
Hashes for perf_py-0.0.1a4-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | d089d344a0a1881afb1b70e57510405ed2dbc19402862f2c2d379e4641a31d2b |
|
MD5 | 4eb429535506158b27e077d0a0eafbf0 |
|
BLAKE2b-256 | e35638cdbc3afc549df8f3ff954d338d45e4ad55fa7fa26d66efdba180e9f0f5 |