0% found this document useful (0 votes)

9 views51 pages

Chapter2 2

The document discusses the importance of timing Python code to optimize performance and provides methods for measuring runtime using the IPython magic command %timeit. It explains how to specify the number of runs and loops, as well as how to save output and compare execution times of different coding approaches. Additionally, it covers code profiling for runtime and memory usage using the line_profiler and memory_profiler packages.

Uploaded by

Ousmane

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as PDF, TXT or read online on Scribd

0% found this document useful (0 votes)

9 views51 pages

Chapter2 2

Uploaded by

Ousmane

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as PDF, TXT or read online on Scribd

You are on page 1/ 51

Examining runtime

W RITIN G EF F ICIEN T P YTH ON CODE

Logan Thomas
Senior Data Scientist, Protection
Engineering Consultants
Why should we time our code?
Allows us to pick the optimal coding approach

Faster code == more ef cient code!

WRITING EFFICIENT PYTHON CODE

How can we time our code?
Calculate runtime with IPython magic command %timeit

Magic commands: enhancements on top of normal Python syntax

Pre xed by the "%" character

Link to docs (here)

See all available magic commands with %lsmagic

WRITING EFFICIENT PYTHON CODE

Using %timeit
Code to be timed

import numpy as np

rand_nums = np.random.rand(1000)

Timing with %timeit

%timeit rand_nums = np.random.rand(1000)

8.61 µs ± 69.1 ns per loop (mean ± std. dev. of 7 runs, 100000 loops each)

WRITING EFFICIENT PYTHON CODE

%timeit output

WRITING EFFICIENT PYTHON CODE

%timeit output

WRITING EFFICIENT PYTHON CODE

%timeit output

WRITING EFFICIENT PYTHON CODE

Specifying number of runs/loops
Setting the number of runs ( -r ) and/or loops ( -n )

# Set number of runs to 2 (-r2)

# Set number of loops to 10 (-n10)

%timeit -r2 -n10 rand_nums = np.random.rand(1000)

16.9 µs ± 5.14 µs per loop (mean ± std. dev. of 2 runs, 10 loops each)

WRITING EFFICIENT PYTHON CODE

Using %timeit in line magic mode
Line magic ( %timeit )

# Single line of code

%timeit nums = [x for x in range(10)]

914 ns ± 7.33 ns per loop (mean ± std. dev. of 7 runs, 1000000 loops each)

WRITING EFFICIENT PYTHON CODE

Using %timeit in cell magic mode
Cell magic ( %%timeit )

# Multiple lines of code

%%timeit
nums = []
for x in range(10):
nums.append(x)

1.17 µs ± 3.26 ns per loop (mean ± std. dev. of 7 runs, 1000000 loops each)

WRITING EFFICIENT PYTHON CODE

Saving output
Saving the output to a variable ( -o )

times = %timeit -o rand_nums = np.random.rand(1000)

8.69 µs ± 91.4 ns per loop (mean ± std. dev. of 7 runs, 100000 loops each)

WRITING EFFICIENT PYTHON CODE

times.timings

[8.697893059998023e-06,
8.651204760008113e-06,
8.634270530001232e-06,
8.66847825998775e-06,
8.619398139999247e-06,
8.902550710008654e-06,
8.633500570012985e-06]

times.best

8.619398139999247e-06

times.worst

8.902550710008654e-06

WRITING EFFICIENT PYTHON CODE

Comparing times
Python data structures can be created using formal name

formal_list = list()
formal_dict = dict()
formal_tuple = tuple()

Python data structures can be created using literal syntax

literal_list = []
literal_dict = {}
literal_tuple = ()

WRITING EFFICIENT PYTHON CODE

f_time = %timeit -o formal_dict = dict()

145 ns ± 1.5 ns per loop (mean ± std. dev. of 7 runs, 10000000 loops each)

l_time = %timeit -o literal_dict = {}

93.3 ns ± 1.88 ns per loop (mean ± std. dev. of 7 runs, 10000000 loops each)

diff = (f_time.average - l_time.average) * (10**9)

print('l_time better than f_time by {} ns'.format(diff))

l_time better than f_time by 51.90819192857814 ns

WRITING EFFICIENT PYTHON CODE

Comparing times
%timeit formal_dict = dict()

145 ns ± 1.5 ns per loop (mean ± std. dev. of 7 runs, 10000000 loops each)

%timeit literal_dict = {}

93.3 ns ± 1.88 ns per loop (mean ± std. dev. of 7 runs, 10000000 loops each)

WRITING EFFICIENT PYTHON CODE

Off to the races!
W RITIN G EF F ICIEN T P YTH ON CODE
Code pro ling for
runtime
W RITIN G EF F ICIEN T P YTH ON CODE

Logan Thomas
Senior Data Scientist, Protection
Engineering Consultants
Code pro ling
Detailed stats on frequency and duration of function calls

Line-by-line analyses

Package used: line_profiler

pip install line_profiler

WRITING EFFICIENT PYTHON CODE

Code pro ling: runtime
heroes = ['Batman', 'Superman', 'Wonder Woman']

hts = np.array([188.0, 191.0, 183.0])

wts = np.array([ 95.0, 101.0, 74.0])

WRITING EFFICIENT PYTHON CODE

def convert_units(heroes, heights, weights):

new_hts = [ht * 0.39370 for ht in heights]

new_wts = [wt * 2.20462 for wt in weights]

hero_data = {}

for i,hero in enumerate(heroes):

hero_data[hero] = (new_hts[i], new_wts[i])

return hero_data

convert_units(heroes, hts, wts)

{'Batman': (74.0156, 209.4389),

'Superman': (75.1967, 222.6666),
'Wonder Woman': (72.0471, 163.1419)}

WRITING EFFICIENT PYTHON CODE

Code pro ling: runtime
%timeit convert_units(heroes, hts, wts)

3 µs ± 32 ns per loop (mean ± std. dev. of 7 runs, 100000 loops each)

WRITING EFFICIENT PYTHON CODE

%timeit new_hts = [ht * 0.39370 for ht in hts]

1.09 µs ± 11 ns per loop (mean ± std. dev. of 7 runs, 1000000 loops each)

%timeit new_wts = [wt * 2.20462 for wt in wts]

1.08 µs ± 6.42 ns per loop (mean ± std. dev. of 7 runs, 1000000 loops each)

%%timeit
hero_data = {}
for i,hero in enumerate(heroes):
hero_data[hero] = (new_hts[i], new_wts[i])

634 ns ± 9.29 ns per loop (mean ± std. dev. of 7 runs, 1000000 loops each)

WRITING EFFICIENT PYTHON CODE

Code pro ling: line_pro ler
Using line_profiler package

%load_ext line_profiler

Magic command for line-by-line times

%lprun -f

WRITING EFFICIENT PYTHON CODE

Code pro ling: line_pro ler
Using line_profiler package

%load_ext line_profiler

Magic command for line-by-line times

%lprun -f convert_units

WRITING EFFICIENT PYTHON CODE

Code pro ling: line_pro ler
Using line_profiler package

%load_ext line_profiler