当一个函数中,不同逻辑混杂在一起的时候,程序的可读性会大打折扣。这个时候,可以考虑用一种叫做“装饰器”的东西来重新整理代码。
# 判断一个数是不是质数
def is_prime(num):
if num < 2:
return False
elif num == 2:
return True
else:
for i in range(2, num):
if num % i == 0:
return False
return True
# 打印10000以内的素数,统计运行耗时
def prime_num():
start_time = time.time()
for i in range(2, 10000):
if is_prime(i):
print(i)
end_time = time.time()
print("运行耗时:{}".format(end_time-start_time))
prime_num()
prime_num中既有打印质素,又有打印运行耗时,可读性差;为了把功能分开,引入装饰器
import time
# 装饰器,打印运行时间
def display_time(func):
def wrapper():
start_time = time.time()
func()
end_time = time.time()
print("运行耗时:{}".format(end_time - start_time))
return wrapper
# 判断一个数是不是质数
def is_prime(num):
if num < 2:
return False
elif num == 2:
return True
else:
for i in range(2, num):
if num % i == 0:
return False
return True
# 打印2000以内的素数
@display_time
def prime_num():
for i in range(2, 10000):
if is_prime(i):
print(i)
prime_num()
如果求10000以内的质数,程序修改为
import time
# 装饰器,打印运行时间
def display_time(func):
def wrapper():
start_time = time.time()
func()
end_time = time.time()
print("运行耗时:{}".format(end_time - start_time))
return wrapper
# 判断一个数是不是质数
def is_prime(num):
if num < 2:
return False
elif num == 2:
return True
else:
for i in range(2, num):
if num % i == 0:
return False
return True
# 打印2000以内的素数
@display_time
def prime_num():
count = 0
for i in range(2, 10000):
if is_prime(i):
count = count + 1
print(count)
return count
count = prime_num()
print(count)
返回结果:
1229
运行耗时:0.428713321685791
None
count并没有输出来,因为函数返回的值并没有返回到wrapper中,在装饰器中加入返回值
import time
# 装饰器,打印运行时间
def display_time(func):
def wrapper():
start_time = time.time()
result = func()
end_time = time.time()
print("运行耗时:{}".format(end_time - start_time))
return result
return wrapper
# 判断一个数是不是质数
def is_prime(num):
if num < 2:
return False
elif num == 2:
return True
else:
for i in range(2, num):
if num % i == 0:
return False
return True
# 打印2000以内的素数
@display_time
def prime_num():
count = 0
for i in range(2, 10000):
if is_prime(i):
count = count + 1
print(count)
return count
count = prime_num()
print(count)
打印结果:
1229
运行耗时:0.6667366027832031
1229
若要计算2~X之间的质数,函数带有参数,那么如何带到装饰器wrapper中?
*args表示可传入多个参数
import time
# 装饰器,打印运行时间
def display_time(func):
def wrapper(*args): # 可多个参数
start_time = time.time()
result = func(*args)
end_time = time.time()
print("运行耗时:{:.4}".format(end_time - start_time))
return result
return wrapper
# 判断一个数是不是质数
def is_prime(num):
if num < 2:
return False
elif num == 2:
return True
else:
for i in range(2, num):
if num % i == 0:
return False
return True
# 打印2000以内的素数
@display_time
def prime_num(maxnum):
count = 0
for i in range(2, maxnum):
if is_prime(i):
count = count + 1
print(count)
return count
count = prime_num(10000)
print(count)
运行结果
1229
运行耗时:0.4028
1229