-
-
Save josephmosby/deed574acae4012c6f5e to your computer and use it in GitHub Desktop.
Dynamic testing of mypy
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
import itertools | |
import time | |
def iter_primes(): | |
# An iterator of all numbers between 2 and | |
# +infinity | |
numbers = itertools.count(2) | |
# Generate primes forever | |
while True: | |
# Get the first number from the iterator | |
# (always a prime) | |
prime = next(numbers) | |
yield prime | |
# This code iteratively builds up a chain | |
# of filters... | |
numbers = filter(prime.__rmod__, | |
numbers) | |
print("dyn_test.py") | |
time_start = time.time() | |
for p in iter_primes(): | |
if p > 100000: | |
print(p) | |
break | |
time_end = time.time() | |
print("Time one") | |
print(time_end - time_start) | |
time_start = time.time() | |
for p in iter_primes(): | |
if p > 100000: | |
print(p) | |
break | |
time_end = time.time() | |
print("Time two") | |
print(time_end - time_start) | |
time_start = time.time() | |
for p in iter_primes(): | |
if p > 100000: | |
print(p) | |
break | |
time_end = time.time() | |
print("Time three") | |
print(time_end - time_start) | |
time_start = time.time() | |
for p in iter_primes(): | |
if p > 100000: | |
print(p) | |
break | |
time_end = time.time() | |
print("Time four") | |
print(time_end - time_start) | |
time_start = time.time() | |
for p in iter_primes(): | |
if p > 100000: | |
print(p) | |
break | |
time_end = time.time() | |
print("Time five") | |
print(time_end - time_start) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment