Home >Backend Development >Python Tutorial >Python-detailed explanation of generators
With list generation, we can directly create a list. However, due to memory constraints, the list capacity is definitely limited. Moreover, creating a list containing 1 million elements not only takes up a lot of storage space, but if we only need to access the first few elements, the space occupied by most of the subsequent elements will be wasted. So, if the elements of the list can be calculated according to a certain algorithm, can we continuously calculate the subsequent elements during the loop? This eliminates the need to create a complete list, saving a lot of space. In Python, this mechanism of looping and calculating at the same time is called a generator: generator.
There are many ways to create a generator. The first method is very simple, just change the [ ] of a list generation to ( )
The difference between creating L and G is only the outermost [ ] and ( ), L is a list, and G is a generator. We can directly print out each element of L, but how do we print out each element of G? If you want to print them out one by one, you can get the next return value of the generator through the next() function:
The generator saves the algorithm, and each time next( is called G), calculate the value of the next element of G until the last element is calculated. When there are no more elements, a StopIteration exception is thrown. Of course, this kind of continuous calling next() is really abnormal. The correct method is to use a for loop, because the generator is also an iterable object. So, after we create a generator, we basically never call next(), but iterate it through a for loop, and don't need to care about the StopIteration exception.
generator is very powerful. If the calculation algorithm is relatively complex and cannot be implemented using a for loop similar to list generation, it can also be implemented using a function.
For example, in the famous Fibonacci sequence, except for the first and second numbers, any number can be obtained by adding the first two numbers:
1 , 1, 2, 3, 5, 8, 13, 21, 34, ...
The Fibonacci sequence cannot be written using list generation, but it is easy to print it out using a function :
Looking carefully, you can see that the fib function is actually defined After understanding the calculation rules of the Fibonacci sequence, you can start from the first element and calculate any subsequent elements. This logic is actually very similar to the generator.
In other words, the above function is only one step away from the generator. To turn the fib function into a generator, just change print(b) to yield b:
#But when calling the generator using a for loop, I found that I could not get the return value of the generator's return statement. If you want to get the return value, you must capture the StopIteration error. The return value is included in the value of StopIteration:
Example: When yield is executed, the gen function is temporarily saved and returns the value of i; temp receives the value sent by c.send("python") next time, c .next() is equivalent to c.send(None)
Use next function
Use __next__() method
Use send
Run result:
Simulate multi-tasking implementation method One: Coroutine
Summary
Generator is a function that remembers the position in the function body when it last returned. The second (or nth) call to a generator function jumps to the middle of the function, leaving all local variables unchanged from the previous call.
A generator not only "remembers" the state of its data; a generator also "remembers" its position within a flow control construct (in imperative programming, this construct is not just a data value).
Features of the generator:
1. Save memory
2. When iterating to the next call, the parameters used are all retained from the first time. , that is to say, the parameters of all function calls are retained when called for the first time, rather than newly created
Iteration is to access the elements of the collection a method. An iterator is an object that remembers the position of a traversal. The iterator object starts accessing from the first element of the collection until all elements have been accessed. Iterators can only go forward and not backward.
The data types that directly act on the for loop are as follows:
The first type is collection data types, such as list, tuple, dict , set, str, etc.;
One category is generator, including generator and generator function with yield.
These objects that can be directly used in for loops are collectively called iterable objects: Iterable.
You can use isinstance() to determine whether an object is an Iterable object:
The generator can not only act on the for loop, but can also be continuously called by the next() function and return the next value, until finally a StopIteration error is thrown to indicate that it cannot Continue to return to the next value.
An object that can be called by the next() function and continuously returns the next value is called an iterator: Iterator.
Generator They are all Iterator objects, but although list, dict, and str are Iterable, they are not Iterators.
To convert list, dict, str and other Iterables into Iterator, you can use the iter() function:
Summary
·All objects that can be used in the for loop are of type Iterable;
·All objects that can be used in the next() function are of type Iterator
·Collection data types such as list, dict, str, etc. are Iterable but not Iterator, but you can obtain an Iterator object through the iter() function.
·The purpose is to reduce the occupied content when using collections.
1. Function reference
In this example, the function line and variables a and b form a closure. When creating the closure, we specify the values of these two variables through the parameters a and b of line_conf. In this way, we determine the final form of the function (y = x + 1 and y = 4x + 5). We only need to transform the parameters a and b to obtain different straight line expression functions. From this, we can see that closures also have the effect of improving code reusability.
If there is no closure, we need to specify a, b, x every time we create a straight line function. In this way, we need to pass more parameters, which also reduces the portability of the code. If you encounter any problems during the learning process or want to obtain learning resources, you are welcome to join the learning exchange group
626062078, we Learn Python together!The above is the detailed content of Python-detailed explanation of generators. For more information, please follow other related articles on the PHP Chinese website!