forked from DaltonCole/ACM_python_intermediate
-
Notifications
You must be signed in to change notification settings - Fork 0
/
generators.py
76 lines (58 loc) · 1.2 KB
/
generators.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
# Generators
# More info: http://stackoverflow.com/questions/1756096/understanding-generators-in-python
### Fibonacci Sequence
def fib():
a, b = 0, 1
while True:
yield a # Key part of a generator
a, b = b, a + b
f = fib()
for i in range(100):
print(next(f), end=', ')
print('\n\n')
### Prime
import itertools
import math
def is_prime(number):
if number > 1:
if number == 2:
return True
if number % 2 == 0:
return False
for current in range(3, int(math.sqrt(number) + 1), 2):
if number % current == 0:
return False
return True
return False
prime = (n for n in itertools.count() if is_prime(n)) # generator expression
# This is similar to List Comprehensions
# prime = [n for n in range(1000) if is_prime(n)]
# print(prime)
for i in range(100):
print(next(prime), end=', ')
print('\n\n')
### With a return
def with_return():
i = 0
while i != 100:
i += 1
yield i
return i
r = with_return()
'''
for i in range(101):
print(next(r), end=', ')
'''
'''
### Send the generator a value
def get_primes(number):
print(number)
while True:
print(number)
if is_prime(number):
number = yield number
number += 1
p = get_primes(1)
for i in range(100):
print(next(p), end=', ')
'''