Python Generator Demo
def f(n):
x = n
while True:
yield x
x = x+1
def take(xs, n):
if n == 0:
return []
else:
return [next(xs)] + take(xs, n-1)
print(take(f(2), 10))INFO
def f(n):
x = n
while True:
yield x
x = x+1
def take(xs, n):
if n == 0:
return []
else:
return [next(xs)] + take(xs, n-1)
print(take(f(2), 10))