# -*- coding: utf-8 -*-
# @File  : 返回函數(shù)的高階函數(shù).py
# @author: Flyme awei 
# @email : Flymeawei@163.com
# @Time  : 2022/8/21 14:48

def sum_fun(*args):

    def add_fun():
        s = 0
        for i in args:
            s += i
        return s
    return add_fun

f = sum_fun(1, 2, 3, 4, 5, 6, 7, 8, 9)
add = f()
print(add)  # 45

def odd_num():  # 奇數(shù)生成器函數(shù)
    n = 1
    while True:
        n += 2
        yield n

def un_divisible(n):  # 判斷是否為可整除數(shù)
    return lambda x: x % n > 0

def primes():  # 素數(shù)生成器函數(shù)
    yield 2
    it = odd_num()
    while True:
        n = next(it)
        yield n
        it = filter(un_divisible(n), it)  # 過濾出不可以整除的數(shù)

for i in primes():  # 打印小于100的素數(shù)
    if i < 100:
        print(i)
    else:
        break  

# -*- coding: utf-8 -*-
# @File  : 返回函數(shù)計算質(zhì)數(shù).py
# @author: Flyme awei 
# @email : Flymeawei@163.com
# @Time  : 2022/8/21 15:17

# 得到所有的質(zhì)數(shù)，打印小于100的所有的質(zhì)數(shù)
# 最小的質(zhì)數(shù)是2， 質(zhì)數(shù):只能被1和它本身整除的數(shù)
# 思路:先得到所有大于1的奇數(shù)， --> 生成器，在把生成器中的所有元素過濾去掉: 那些可以被小于元素本身的質(zhì)數(shù)整除的數(shù)

# 1.得到所有的大于1奇數(shù)的生
def odd_num():
    n = 1
    while True:
        n += 2
        yield n

def un_divisible(n):  # 判斷是否能夠整除的函數(shù)，n代表從生成器中拿到的一個大于1的質(zhì)數(shù)
    return lambda x: x % n > 0  # x是某一個奇數(shù)，n:小于當(dāng)前x的一個質(zhì)數(shù)

# 2.創(chuàng)建一個質(zhì)數(shù)的生成器，最小的質(zhì)數(shù)是2
def primes():
    yield 2
    n = odd_num()  # g為大于1的奇數(shù)生成器
    while True:
        x = next(n)
        g = filter(un_divisible(n), n)
        yield x

for i in primes():
    if i < 100:
        print(i, end=' ')
    else:
        break