--- title: "What does the yield keyword do in Python?" description: "What does the yield keyword do in Python?" author: "Anonymous User" published: 2015-05-11 updated: 2023-06-19 canonical: https://www.mindstick.com/forum/23206/what-does-the-yield-keyword-do-in-python category: "python" tags: ["python"] reading_time: 10 minutes --- # What does the yield keyword do in Python? What is the use of the [yield keyword](https://www.mindstick.com/forum/159057/what-is-the-use-of-the-yield-keyword-in-c-sharp) in [Python](https://www.mindstick.com/articles/75378/simple-yet-useful-tips-when-using-python)? What does it do?\ For example, I'm [trying](https://answers.mindstick.com/qa/93698/6-mistakes-couples-are-trying-to-save-money) to understand this [code](https://yourviews.mindstick.com/view/85458/alan-turing-the-mastermind-behind-cracking-the-enigma-code-during-world-war-ii) (**): ``` def node._get_child_candidates(self, distance, min_dist, max_dist):    if self._leftchild and distance - max_dist < self._median:        yield self._leftchild    if self._rightchild and distance + max_dist >= self._median:        yield self._rightchild   ``` And this is the caller:\ ``` result, candidates = list(), [self]while candidates:    node = candidates.pop()    distance = node._get_dist(obj)    if distance <= max_dist and distance >= min_dist:        result.extend(node._values)    candidates.extend(node._get_child_candidates(distance, min_dist, max_dist))return result ``` What happens when the [method](https://www.mindstick.com/forum/166/webservice-method) _get_child_candidates is called? A list is returned? A [single element](https://www.mindstick.com/forum/2097/understanding-single) is returned? Is it called again? When subsequent calls do stop? ## Replies ### Reply by Aryan Kumar The yield keyword in Python is used to create generators. Generators are a special type of function that can be used to produce a sequence of values. When a generator function is called, it does not immediately return a value. Instead, it returns a generator object. The generator object can then be used to iterate over the sequence of values produced by the generator function. The yield keyword works by suspending the execution of the generator function and returning a value. The state of the generator function is then saved, and the generator object is returned. When the generator object is next iterated over, the execution of the generator function resumes from where it left off. The yield keyword can be used to create generators that produce any kind of sequence of values. For example, the following code defines a generator function that produces the Fibonacci sequence: Python ```plaintext def fibonacci(n): """ Generates the Fibonacci sequence up to the nth term. Args: n: The nth term of the Fibonacci sequence. Yields: The Fibonacci numbers up to the nth term. """ a, b = 0, 1 for i in range(n): yield a a, b = b, a + b if __name__ == "__main__": for i in fibonacci(10): print(i) ``` This code first defines a function called `fibonacci()`. The function takes a number as input and returns a generator object that produces the Fibonacci sequence up to the nth term. The function works by first initializing two variables called `a` and `b` to 0 and 1, respectively. Then, the function iterates through the numbers from 0 to `n`. For each number, the function yields the value of `a`. Then, the function updates the values of `a` and `b`. The code then defines a variable called `n` and assigns it the value of 10. The code then calls the `fibonacci()` function and stores the result in a variable called `fibonacci_generator`. Finally, the code iterates through the generator object and prints each value to the console. To run the code, you can save it as a Python file and then run it from the command line. For example, if you save the code as `fibonacci.py`, you can run it by typing the following command into the command line: Code snippet ```plaintext python fibonacci.py ``` This will print the Fibonacci sequence up to the 10th term to the console. ### Reply by Anonymous User To understand what yield does, you must understand what generators are. And before generators come iterables.\ **Iterables**\ When you create a list, you can read its items one by one, and it's called iteration:\ ``` >>> mylist = [1, 2, 3]>>> for i in mylist:...    print(i)123 ``` Mylist is an iterable. When you use a list comprehension, you create a list, and so an iterable:\ ``` >>> mylist = [x*x for x in range(3)]>>> for i in mylist:...    print(i)014 ``` Everything you can use "for... in..." on is an iterable: lists, strings, files... These iterables are handy because you can read them as much as you wish, but you store all the values in memory and it's not always what you want when you have a lot of values.\ **Generators**Generators are iterators, but you can only iterate over them once. It's because they do not store all the values in memory, they generate the values on the fly:\ ``` >>> mygenerator = (x*x for x in range(3))>>> for i in mygenerator:...    print(i)014 ``` It is just the same except you used () instead of []. BUT, you can not perform for i in mygenerator a second time since generators can only be used once: they calculate 0, then forget about it and calculate 1, and end calculating 4, one by one.\ **Yield**Yield is a [keyword](https://www.mindstick.com/forum/33572/sql-inner-join-keyword) that is used like return, except the function will return a generator.\ ``` >>> def createGenerator():...    mylist = range(3)...    for i in mylist:...        yield i*i...>>> mygenerator = createGenerator() # create a generator>>> print(mygenerator) # mygenerator is an object!>>> for i in mygenerator:...     print(i)014 ``` Here it's a useless example, but it's handy when you know your function will return a huge set of values that you will only need to read once.\ To master yield, you must understand that when you call the function, the code you have written in the function body does not run. The function only returns the generator object, this is a bit tricky :-)\ Then, your code will be run each time the for uses the generator.\ Now the hard part:\ The first time the for calls the generator object created from your function, it will run the code in your function from the beginning until it hits yield, then it'll return the first value of the loop. Then, each other call will run the loop you have written in the function one more time, and return the next value, until there is no value to return.\ The generator is considered empty once the function runs but does not hit yield anymore. It can be because the loop had come to an end, or because you do not satisfy a "if/else" anymore.\ **Code Explanation**Generator:# Here you create the method of the node object that will return the generatordef node._get_child_candidates(self, distance, min_dist, max_dist):\ # Here is the code that will be called each time you use the generator object:\ # If there is still a child of the node object on its left # AND if distance is ok, return the next child if self._leftchild and distance - max_dist < self._median: yield self._leftchild\ # If there is still a child of the node object on its right # AND if distance is ok, return the next child if self._rightchild and distance + max_dist >= self._median: yield self._rightchild\ # If the function arrives here, the generator will be considered empty # there is no more than two values: the left and the right childrenCaller:\ # Create an empty list and a list with the current object referenceresult, candidates = list(), [self]\ # Loop on candidates (they contain only one element at the beginning)while candidates:\ # Get the last candidate and remove it from the list node = candidates.pop()\ # Get the distance between obj and the candidate distance = node._get_dist(obj)\ # If distance is ok, then you can fill the result if distance <= max_dist and distance >= min_dist: result.extend(node._values)\ # Add the children of the candidate in the candidates list # so the loop will keep running until it will have looked # at all the children of the children of the children, etc. of the candidate candidates.extend(node._get_child_candidates(distance, min_dist, max_dist))\ return resultThis code contains several smart parts:\ The loop iterates on a list but the list expands while the loop is being iterated :-) It's a concise way to go through all these nested data even if it's a bit dangerous since you can end up with an infinite loop. In this case, candidates.extend(node._get_child_candidates(distance, min_dist, max_dist)) exhausts all the values of the generator, but while keeps creating new generator objects which will produce different values from the previous ones since it's not applied on the same node.\ The extend() method is a list object method that expects an iterable and adds its values to the list.\ Usually we pass a list to it: ``` >>> a = [1, 2]>>> b = [3, 4]>>> a.extend(b)>>> print(a)[1, 2, 3, 4] ``` But in your code it gets a generator, which is good because:\ You don't need to read the values twice.You can have a lot of children and you don't want them all stored in memory.And it works because Python does not care if the argument of a method is a list or not. Python expects iterables so it will work with strings, lists, tuples and generators! This is called duck typing and is one of the reason why Python is so cool. But this is another story, for another question...\ You can stop here, or read a little bit to see a advanced use of generator:\ **Controlling a generator exhaustion** ``` >>> class Bank(): # let's create a bank, building ATMs...    crisis = False...    def create_atm(self):...        while not self.crisis:...            yield "$100">>> hsbc = Bank() # when everything's ok the ATM gives you as much as you want>>> corner_street_atm = hsbc.create_atm()>>> print(corner_street_atm.next())$100>>> print(corner_street_atm.next())$100>>> print([corner_street_atm.next() for cash in range(5)])['$100', '$100', '$100', '$100', '$100']>>> hsbc.crisis = True # crisis is coming, no more money!>>> print(corner_street_atm.next())>>> wall_street_atm = hsbc.create_atm() # it's even true for new ATMs>>> print(wall_street_atm.next())>>> hsbc.crisis = False # trouble is, even post-crisis the ATM remains empty>>> print(corner_street_atm.next())>>> brand_new_atm = hsbc.create_atm() # build a new one to get back in business>>> for cash in brand_new_atm:...    print cash$100$100$100$100$100$100$100$100$100... ``` It can be useful for various things like controlling access to a resource.\ Itertools, your best friend\ The itertools module contains special functions to manipulate iterables. Ever wish to duplicate a generator? Chain two generators? Group values in a nested list with a one liner? Map / Zip without creating another list?\ Then just import itertools.\ An example? Let's see the possible orders of arrival for a 4 horse race:\ ``` >>> horses = [1, 2, 3, 4]>>> races = itertools.permutations(horses)>>> print(races)>>> print(list(itertools.permutations(horses)))[(1, 2, 3, 4), (1, 2, 4, 3), (1, 3, 2, 4), (1, 3, 4, 2), (1, 4, 2, 3), (1, 4, 3, 2), (2, 1, 3, 4), (2, 1, 4, 3), (2, 3, 1, 4), (2, 3, 4, 1), (2, 4, 1, 3), (2, 4, 3, 1), (3, 1, 2, 4), (3, 1, 4, 2), (3, 2, 1, 4), (3, 2, 4, 1), (3, 4, 1, 2), (3, 4, 2, 1), (4, 1, 2, 3), (4, 1, 3, 2), (4, 2, 1, 3), (4, 2, 3, 1), (4, 3, 1, 2), (4, 3, 2, 1)] ``` Understanding the inner mechanisms of iterationIteration is a process implying iterables (implementing the __iter__() method) and iterators (implementing the __next__() method). Iterables are any objects you can get an iterator from. Iterators are objects that let you iterate on iterables.\ --- Original Source: https://www.mindstick.com/forum/23206/what-does-the-yield-keyword-do-in-python Copyright © MindStick Software Pvt. Ltd. This Markdown version is provided for developers, AI systems, and offline reading.