学ぶ Introduction to Generator Functions | Generator Functions and Expressions

メニューを表示するにはスワイプしてください

Generator functions are a special type of function in Python that allow you to produce a sequence of values over time, instead of computing them all at once and returning them in a list. You define a generator function just like a normal function, but instead of using the return statement to send a value back, you use the yield keyword. When Python encounters yield, it pauses the function, saves its state, and sends the yielded value to the caller. The next time you ask for a value, the function resumes right where it left off. This technique is called lazy evaluation, because values are produced only when you need them, not in advance. This makes generator functions very memory efficient, especially when working with large or infinite sequences.


              1234567
            
def square_numbers(n):
    for i in range(1, n + 1):
        yield i * i

# Using the generator function
for square in square_numbers(5):
    print(square)

1. Which of the following best describes the role of the `yield` keyword in a generator function?

2. Which statements are true about the differences between `return` and `yield` in Python functions?

すべて明確でしたか？

フィードバックありがとうございます！

セクション 2. 章 1

AIに質問する

何でも質問するか、提案された質問の1つを試してチャットを始めてください

セクション 2. 章 1

Introduction to Generator Functions

1. Which of the following best describes the role of the yield keyword in a generator function?

2. Which statements are true about the differences between return and yield in Python functions?

1. Which of the following best describes the role of the `yield` keyword in a generator function?

2. Which statements are true about the differences between `return` and `yield` in Python functions?