A tech talk by Mitchell Vitez for Michigan Hackers about some useful features of Python

1. Python Tidbits
Mitchell Vitez

2. ● Learn new constructs
● Play with them in the interpreter
● Learn how to apply them to your own code
● Become a better Python programmer
Goals

3. import this

4. import antigravity

5. from __future__ import braces

6. if condition:
pass
#{
#}

7. # -*- coding: rot13 -*-
cevag 'Clguba vf sha!'

8. Chained comparisons

9. if 12 < x < 144:
print x
3 != x < y == 24 < z < 1000 > pi

10. Swapping

11. Temporary Variable
a, b = 1, 2
temp = a
a = b
b = temp

12. XOR
a, b = 1, 2
a ^= b
b ^= a
a ^= b

13. Problem
a, b = 'Python', 'Tidbits'

14. Solution
a, b = b, a

15. Tuple packing
a, b = 'it will', 'consume you'
a, b = b, a
(a, b) = (b, a)
(a, b) = ('consume you', 'it will')

16. temp = a
a = b
b = temp
a, b = b, a

17. point = (1, 2, 3)
x, y, z = point
nums = 1, 2, 3, 4, 5
sum(nums)

18. Slices

19. [start:end:step]

20. 'Michigan Hackers'[6:13]

21. 'Michigan Hackers'[6:13]
0123456789abcdef

22. 'Michigan Hackers'[:-5]
0123456789abcdef

23. 'Michigan Hackers'[-5:]
0123456789abcdef

24. 'Michigan Hackers'[::2]
0123456789abcdef

25. [::-1]
reversed()

26. List comprehensions

27. Make a list of cubes
of the first 100
numbers

28. Imperative
cubes = []
for x in range(100):
cubes.append(x ** 3)

29. Functional
cubes = map(lambda x: x ** 3, range(100))

30. List comprehension
cubes = [x ** 3 for x in range(100)]

31. With a predicate
cubes = []
for x in range(100):
if x % 2:
cubes.append(x ** 3)
cubes = map(lambda x: x ** 3,
filter(lambda x: x % 2, range(100)))
cubes = [x ** 3 for x in range(100) if x % 2]
cubes = [x ** 3 for x in range(100)][1::2]

32. Sum of two dice
table = []
for i in range(1, 7):
row = []
for j in range(1, 7):
row.append(i + j)
table.append(row)
[[i + j for i in range(1, 7)]
for j in range(1, 7)]

33. word = 'abracadabra'
[word[:i] for i in range(len(word), 0, -1)]

34. Splat operator

35. Named arguments
def increase(num, how_much=1, multiply=False):
if multiply:
return num * how_much
return num + how_much
increase(1)
increase(10, 10, False)
increase(25, multiply=True, how_much=2)

36. Unpack dictionaries to arguments
options = {
'is_the_splab_door_open': True,
'is_it_hack_night_yet': False,
'students_enrolled_at_umich': 43651,
'fishythefish_status': 'savage'
}
func(**options)

37. Unpack argument lists
def add(a, b):
return a + b
nums = [1, 2]
add(*nums)

38. Variadic functions
def sum(*nums):
result = 0
for num in nums:
result += num
return result
sum(1, 2, 3, 4)

39. Args and kwargs
def function(arg1, arg2, *args, **kwargs):
pass

40. Decomposition
x, xs = things[0], things[1:]
x, *xs = things

41. Iterators

42. for _ in _
for item in list
for character in string
for key in dictionary
for line in file

43. __iter__
nums = [1, 2, 3, 4, 5]
iterator = iter(nums)
iterator.next()

44. Implementing range
class simple_range:
def __init__(self, n):
self.n = n
self.data = [i for i in range(n)]
def __iter__(self):
return iter(self.data)

45. Performance
import time
class simple_range:
def __init__(self, n):
t0 = time.time()
self.n = n
self.data = [i for i in range(n)]
print 'Time taken:', time.time() - t0
def __iter__(self):
return iter(self.data)
simple_range(100000000)
# Time taken: 7.59687685966

46. Improved Performance
class simple_range:
def __init__(self, n):
self.n = n
self.i = 0
def __iter__(self):
return self
def next(self):
if self.i < self.n:
result = self.i
self.i += 1
return result
else:
raise StopIteration()

47. range, xrange, Python 3 range
simple_range(100000000)
# Time taken: 7.59687685966
# Time taken: 0.00002408027

48. Generators

49. Functions returning sequences
def simple_range(n):
i = 0
while i < n:
yield i
i += 1
yielding

50. Generator expressions
cubes = (x ** 3 for x in range(100))

51. How many 3-letter strings are
alphabetically between 'foo' and 'bar'?

52. A more complicated generator
def alphagen(start, end=None):
s = list(reversed(start))
while end is None or s != list(reversed(end)):
yield ''.join(reversed(s))
if s == list('z' * len(s)):
s = list('a' * (len(s) + 1))
else:
for i, ch in enumerate(s):
if ch is 'z':
s[i] = 'a'
else:
s[i] = chr(ord(ch) + 1)
break

53. Solution
i = 0
for a in alphagen('bar', 'foo'):
i += 1
print i - 1
# Time taken to create generator: .00000596046

54. Decorators

55. Tracing
def fibonacci(n):
t0 = time.time()
print 'fib started'
if n is 0 or n is 1:
print 'fib finished in', time.time() - t0,
'seconds returning', 1
return 1
else:
x = fibonacci(n - 1) + fibonacci(n - 2)
print 'fib finished in', time.time() - t0,
'seconds returning', x
return x

56. Tracing
def trace(f):
def f_prime(n):
t0 = time.time()
print f.__name__, 'started'
value = f(n)
print f.__name__, 'finished in', time.time() -
t0, 'seconds returning', value
return value
return f_prime
def fibonacci(n):
if n is 0 or n is 1:
return 1
else:
return fibonacci(n - 1) + fibonacci(n - 2)
fibonacci = trace(fibonacci)

57. Syntactic sugar
@trace
def fibonacci(n):
if n is 0 or n is 1:
return 1
else:
return fibonacci(n - 1) + fibonacci(n - 2)

58. Tidbits

59. s = u'Hallelujah Bovay Alabama Δ'
words = s.split()
s = ', '.join(words)
print s

60. ' '.join([''.join(reversed(word)) for word in s.split()])
' '.join(reversed(s.split()))
reversed(s)

61. import random
random.choice(['Ankit', 'Abby', 'Edward',
'Andrew', 'Omkar', 'Jason'])

62. Interested in more? Check out these
dis
pdb
flask
pydoc
pygame
itertools
functools
exec, eval
beautiful soup
dict comprehensions