diff --git a/bug-string-reviewnb.ipynb b/bug-string-reviewnb.ipynb new file mode 100644 index 000000000..eedd72b44 --- /dev/null +++ b/bug-string-reviewnb.ipynb @@ -0,0 +1,72 @@ +{ + "cells": [ + { + "cell_type": "code", + "execution_count": 2, + "metadata": {}, + "outputs": [ + { + "name": "stdout", + "output_type": "stream", + "text": [ + "\n", + " select name\n", + " from table\n", + " where app_id = 'test_id'\n", + " and event_time > 20200310\n", + " group by 1\n", + " \n", + "101\n" + ] + } + ], + "source": [ + "import datetime\n", + "app_id = 'test_id'\n", + "sql = \"\"\"\n", + " select name\n", + " from table\n", + " where app_id = {app_id}\n", + " and event_time > {datetime.datetime.now().strftime('%Y%m%d')}\n", + " group by 1\n", + " \"\"\"\n", + " \n", + "print(sql)\n", + "\n", + "a = 100\n", + "a = a + 1\n", + "print(a)" + ] + }, + { + "cell_type": "code", + "execution_count": null, + "metadata": {}, + "outputs": [], + "source": [ + "# new code cell - v6" + ] + } + ], + "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.8" + } + }, + "nbformat": 4, + "nbformat_minor": 4 +} diff --git a/notebooks/02.08-Sorting.ipynb b/notebooks/02.08-Sorting.ipynb index fdb02d56c..1e70029db 100644 --- a/notebooks/02.08-Sorting.ipynb +++ b/notebooks/02.08-Sorting.ipynb @@ -30,7 +30,7 @@ "cell_type": "markdown", "metadata": {}, "source": [ - "Up to this point we have been concerned mainly with tools to access and operate on array data with NumPy.\n", + "--Change-v6--Up to this point we have been concerned mainly with tools to access and operate on array data with NumPy.\n", "This section covers algorithms related to sorting values in NumPy arrays.\n", "These algorithms are a favorite topic in introductory computer science courses: if you've ever taken one, you probably have had dreams (or, depending on your temperament, nightmares) about *insertion sorts*, *selection sorts*, *merge sorts*, *quick sorts*, *bubble sorts*, and many, many more.\n", "All are means of accomplishing a similar task: sorting the values in a list or array.\n", @@ -729,9 +729,9 @@ "name": "python", "nbconvert_exporter": "python", "pygments_lexer": "ipython3", - "version": "3.6.4" + "version": "3.6.8" } }, "nbformat": 4, - "nbformat_minor": 1 + "nbformat_minor": 4 }