{ "cells": [ { "cell_type": "markdown", "metadata": {}, "source": [ "___\n", "\n", "\n", "___\n", "
Content Copyright by Pierian Data
" ] }, { "cell_type": "markdown", "metadata": {}, "source": [ "# Iterators and Generators" ] }, { "cell_type": "markdown", "metadata": {}, "source": [ "In this section of the course we will be learning the difference between iteration and generation in Python and how to construct our own Generators with the *yield* statement. Generators allow us to generate as we go along, instead of holding everything in memory. \n", "\n", "We've touched on this topic in the past when discussing certain built-in Python functions like **range()**, **map()** and **filter()**.\n", "\n", "Let's explore a little deeper. We've learned how to create functions with def and the return statement. Generator functions allow us to write a function that can send back a value and then later resume to pick up where it left off. This type of function is a generator in Python, allowing us to generate a sequence of values over time. The main difference in syntax will be the use of a yield statement.\n", "\n", "In most aspects, a generator function will appear very similar to a normal function. The main difference is when a generator function is compiled they become an object that supports an iteration protocol. That means when they are called in your code they don't actually return a value and then exit. Instead, generator functions will automatically suspend and resume their execution and state around the last point of value generation. The main advantage here is that instead of having to compute an entire series of values up front, the generator computes one value and then suspends its activity awaiting the next instruction. This feature is known as *state suspension*.\n", "\n", "\n", "To start getting a better understanding of generators, let's go ahead and see how we can create some." ] }, { "cell_type": "code", "execution_count": 1, "metadata": { "collapsed": true }, "outputs": [], "source": [ "# Generator function for the cube of numbers (power of 3)\n", "def gencubes(n):\n", " for num in range(n):\n", " yield num**3" ] }, { "cell_type": "code", "execution_count": 2, "metadata": {}, "outputs": [ { "name": "stdout", "output_type": "stream", "text": [ "0\n", "1\n", "8\n", "27\n", "64\n", "125\n", "216\n", "343\n", "512\n", "729\n" ] } ], "source": [ "for x in gencubes(10):\n", " print(x)" ] }, { "cell_type": "markdown", "metadata": {}, "source": [ "Great! Now since we have a generator function we don't have to keep track of every single cube we created.\n", "\n", "Generators are best for calculating large sets of results (particularly in calculations that involve loops themselves) in cases where we don’t want to allocate the memory for all of the results at the same time. \n", "\n", "Let's create another example generator which calculates [fibonacci](https://en.wikipedia.org/wiki/Fibonacci_number) numbers:" ] }, { "cell_type": "code", "execution_count": 3, "metadata": { "collapsed": true }, "outputs": [], "source": [ "def genfibon(n):\n", " \"\"\"\n", " Generate a fibonnaci sequence up to n\n", " \"\"\"\n", " a = 1\n", " b = 1\n", " for i in range(n):\n", " yield a\n", " a,b = b,a+b" ] }, { "cell_type": "code", "execution_count": 4, "metadata": {}, "outputs": [ { "name": "stdout", "output_type": "stream", "text": [ "1\n", "1\n", "2\n", "3\n", "5\n", "8\n", "13\n", "21\n", "34\n", "55\n" ] } ], "source": [ "for num in genfibon(10):\n", " print(num)" ] }, { "cell_type": "markdown", "metadata": {}, "source": [ "What if this was a normal function, what would it look like?" ] }, { "cell_type": "code", "execution_count": 5, "metadata": { "collapsed": true }, "outputs": [], "source": [ "def fibon(n):\n", " a = 1\n", " b = 1\n", " output = []\n", " \n", " for i in range(n):\n", " output.append(a)\n", " a,b = b,a+b\n", " \n", " return output" ] }, { "cell_type": "code", "execution_count": 6, "metadata": {}, "outputs": [ { "data": { "text/plain": [ "[1, 1, 2, 3, 5, 8, 13, 21, 34, 55]" ] }, "execution_count": 6, "metadata": {}, "output_type": "execute_result" } ], "source": [ "fibon(10)" ] }, { "cell_type": "markdown", "metadata": {}, "source": [ "Notice that if we call some huge value of n (like 100000) the second function will have to keep track of every single result, when in our case we actually only care about the previous result to generate the next one!\n", "\n", "## next() and iter() built-in functions\n", "A key to fully understanding generators is the next() function and the iter() function.\n", "\n", "The next() function allows us to access the next element in a sequence. Lets check it out:" ] }, { "cell_type": "code", "execution_count": 7, "metadata": { "collapsed": true }, "outputs": [], "source": [ "def simple_gen():\n", " for x in range(3):\n", " yield x" ] }, { "cell_type": "code", "execution_count": 8, "metadata": { "collapsed": true }, "outputs": [], "source": [ "# Assign simple_gen \n", "g = simple_gen()" ] }, { "cell_type": "code", "execution_count": 9, "metadata": {}, "outputs": [ { "name": "stdout", "output_type": "stream", "text": [ "0\n" ] } ], "source": [ "print(next(g))" ] }, { "cell_type": "code", "execution_count": 10, "metadata": {}, "outputs": [ { "name": "stdout", "output_type": "stream", "text": [ "1\n" ] } ], "source": [ "print(next(g))" ] }, { "cell_type": "code", "execution_count": 11, "metadata": {}, "outputs": [ { "name": "stdout", "output_type": "stream", "text": [ "2\n" ] } ], "source": [ "print(next(g))" ] }, { "cell_type": "code", "execution_count": 12, "metadata": {}, "outputs": [ { "ename": "StopIteration", "evalue": "", "output_type": "error", "traceback": [ "\u001b[1;31m---------------------------------------------------------------------------\u001b[0m", "\u001b[1;31mStopIteration\u001b[0m Traceback (most recent call last)", "\u001b[1;32m\u001b[0m in \u001b[0;36m\u001b[1;34m()\u001b[0m\n\u001b[1;32m----> 1\u001b[1;33m \u001b[0mprint\u001b[0m\u001b[1;33m(\u001b[0m\u001b[0mnext\u001b[0m\u001b[1;33m(\u001b[0m\u001b[0mg\u001b[0m\u001b[1;33m)\u001b[0m\u001b[1;33m)\u001b[0m\u001b[1;33m\u001b[0m\u001b[0m\n\u001b[0m", "\u001b[1;31mStopIteration\u001b[0m: " ] } ], "source": [ "print(next(g))" ] }, { "cell_type": "markdown", "metadata": {}, "source": [ "After yielding all the values next() caused a StopIteration error. What this error informs us of is that all the values have been yielded. \n", "\n", "You might be wondering that why don’t we get this error while using a for loop? A for loop automatically catches this error and stops calling next(). \n", "\n", "Let's go ahead and check out how to use iter(). You remember that strings are iterables:" ] }, { "cell_type": "code", "execution_count": 13, "metadata": {}, "outputs": [ { "name": "stdout", "output_type": "stream", "text": [ "h\n", "e\n", "l\n", "l\n", "o\n" ] } ], "source": [ "s = 'hello'\n", "\n", "#Iterate over string\n", "for let in s:\n", " print(let)" ] }, { "cell_type": "markdown", "metadata": {}, "source": [ "But that doesn't mean the string itself is an *iterator*! We can check this with the next() function:" ] }, { "cell_type": "code", "execution_count": 14, "metadata": {}, "outputs": [ { "ename": "TypeError", "evalue": "'str' object is not an iterator", "output_type": "error", "traceback": [ "\u001b[1;31m---------------------------------------------------------------------------\u001b[0m", "\u001b[1;31mTypeError\u001b[0m Traceback (most recent call last)", "\u001b[1;32m\u001b[0m in \u001b[0;36m\u001b[1;34m()\u001b[0m\n\u001b[1;32m----> 1\u001b[1;33m \u001b[0mnext\u001b[0m\u001b[1;33m(\u001b[0m\u001b[0ms\u001b[0m\u001b[1;33m)\u001b[0m\u001b[1;33m\u001b[0m\u001b[0m\n\u001b[0m", "\u001b[1;31mTypeError\u001b[0m: 'str' object is not an iterator" ] } ], "source": [ "next(s)" ] }, { "cell_type": "markdown", "metadata": {}, "source": [ "Interesting, this means that a string object supports iteration, but we can not directly iterate over it as we could with a generator function. The iter() function allows us to do just that!" ] }, { "cell_type": "code", "execution_count": 15, "metadata": { "collapsed": true }, "outputs": [], "source": [ "s_iter = iter(s)" ] }, { "cell_type": "code", "execution_count": 16, "metadata": {}, "outputs": [ { "data": { "text/plain": [ "'h'" ] }, "execution_count": 16, "metadata": {}, "output_type": "execute_result" } ], "source": [ "next(s_iter)" ] }, { "cell_type": "code", "execution_count": 17, "metadata": {}, "outputs": [ { "data": { "text/plain": [ "'e'" ] }, "execution_count": 17, "metadata": {}, "output_type": "execute_result" } ], "source": [ "next(s_iter)" ] }, { "cell_type": "markdown", "metadata": {}, "source": [ "Great! Now you know how to convert objects that are iterable into iterators themselves!\n", "\n", "The main takeaway from this lecture is that using the yield keyword at a function will cause the function to become a generator. This change can save you a lot of memory for large use cases. For more information on generators check out:\n", "\n", "[Stack Overflow Answer](http://stackoverflow.com/questions/1756096/understanding-generators-in-python)\n", "\n", "[Another StackOverflow Answer](http://stackoverflow.com/questions/231767/what-does-the-yield-keyword-do-in-python)" ] } ], "metadata": { "kernelspec": { "display_name": "Python 3", "language": "python", "name": "python3" }, "language_info": { "codemirror_mode": { "name": "ipython", "version": 3 }, "file_extension": ".py", "mimetype": "text/x-python", "name": "python", "nbconvert_exporter": "python", "pygments_lexer": "ipython3", "version": "3.6.6" } }, "nbformat": 4, "nbformat_minor": 1 }