Website build

Author: dham

0_introduction.html

@@ -97,7 +97,7 @@
 and abstraction produce software which is easier to write, easier to
 understand, easier to debug and easier to extend. Indeed, as with
 abstraction in mathematics, abstraction in coding is a form of
-constructive laziness: it simultaniously allows the mathematician to
+constructive laziness: it simultaneously allows the mathematician to
 achieve more and do less work.</p>
 <p>This course is a second course in programming, building a previously
 acquired basic understanding of programming in Python. In covering
@@ -125,7 +125,7 @@ <h3><span class="section-number">1.1.1. </span>The notes<a class="headerlink" hr
 <p>All of the new material we cover in this course is presented in the notes. They
 always the starting point for your work. Each chapter will introduce new
 concepts in programming, often tied back to related mathematical concepts, and
-always illustraded by practical code examples. Python has excellent <a class="reference external" href="https://docs.python.org/3/">official
+always illustrated by practical code examples. Python has excellent <a class="reference external" href="https://docs.python.org/3/">official
 online documentation</a>, and we link to that
 throughout the text. External links show up in orange while <a class="reference internal" href="#introduction"><span class="std std-ref">internal links
 to other parts of the notes</span></a> are red. Sometimes we introduce
@@ -164,14 +164,14 @@ <h3><span class="section-number">1.1.2. </span>The videos<a class="headerlink" h
 practice, often by showing live coding sessions. Usually you’ll want to watch
 the video for a given section <em>after</em> reading the corresponding notes.</p>
 </div>
-<div class="section" id="the-quizes">
-<h3><span class="section-number">1.1.3. </span>The quizes<a class="headerlink" href="#the-quizes" title="Permalink to this headline">¶</a></h3>
+<div class="section" id="the-quizzes">
+<h3><span class="section-number">1.1.3. </span>The quizzes<a class="headerlink" href="#the-quizzes" title="Permalink to this headline">¶</a></h3>
 <p>Towards the end of each chapter is a link back to a quiz on Imperial’s
-Blackboard system. The quizes are designed to allow you to convince yourself
+Blackboard system. The quizzes are designed to allow you to convince yourself
 that you’ve understood the material in the chapter. Sometimes they will simply
 be multiple choice questions testing your understanding of the material, but
 sometimes you will need to open up Python and try things out in order to work
-out the right answer. The quizes do not contribute to your module grade, but how
+out the right answer. The quizzes do not contribute to your module grade, but how
 well you are doing on them is an indication of your progress on the module.</p>
 </div>
 <div class="section" id="the-exercises">

1_programs_in_files.html

@@ -621,7 +621,7 @@ <h2><span class="section-number">2.7. </span>Testing frameworks<a class="headerl
 the practical details of including tests in your code here.</p>
 <p>There are a number of Python packages which support code testing. The
 concepts are largely similar so rather than get bogged down in the
-details of multiple frameworks, we will introduce <a class="reference external" href="https://docs.pytest.org/en/latest/index.html" title="(in pytest v6.0.1.dev152+g91dbdb60)"><span class="xref std std-doc">pytest</span></a>, which is one of the most widely used.</p>
+details of multiple frameworks, we will introduce <a class="reference external" href="https://docs.pytest.org/en/latest/index.html" title="(in pytest v6.0.1.dev168+g4df39e3a)"><span class="xref std std-doc">pytest</span></a>, which is one of the most widely used.</p>
 <div class="section" id="pytest-tests">
 <h3><span class="section-number">2.7.1. </span>Pytest tests<a class="headerlink" href="#pytest-tests" title="Permalink to this headline">¶</a></h3>
 <p>A Pytest test is simply a function whose name starts with <code class="xref py py-obj docutils literal notranslate"><span class="pre">test_</span></code>. In

4_abstract_data_types.html

@@ -50,7 +50,7 @@
           <div class="body" role="main">
 
   <div class="section" id="abstract-data-types">
-<h1><span class="section-number">5. </span>Abstract data types<a class="headerlink" href="#abstract-data-types" title="Permalink to this headline">¶</a></h1>
+<span id="id1"></span><h1><span class="section-number">5. </span>Abstract data types<a class="headerlink" href="#abstract-data-types" title="Permalink to this headline">¶</a></h1>
 <p>In <a class="reference internal" href="2_objects.html#objects"><span class="std std-numref">Section 3</span></a>, we introduced the concept of <a class="reference internal" href="2_objects.html#term-type"><span class="xref std std-term">type</span></a> as an
 <a class="reference internal" href="2_objects.html#term-abstraction"><span class="xref std std-term">abstraction</span></a> comprising a set of possible values, and a set of
 operations. All types in Python are abstractions in this sense
@@ -59,7 +59,7 @@ <h1><span class="section-number">5. </span>Abstract data types<a class="headerli
 define purely mathematical types, distinct from their concrete
 realisation in code. Indeed, there are typically multiple possible
 concrete realisations of a mathematical idea.</p>
-<div class="proof proof-type-definition" id="id2">
+<div class="proof proof-type-definition" id="id3">
 
     <div class="proof-title">
         <span class="proof-type">Definition 5.1</span>
@@ -72,7 +72,7 @@ <h1><span class="section-number">5. </span>Abstract data types<a class="headerli
 </div></div><p>That said, it will frequently be helpful in understanding abstract
 data types to refer to the ways in which they might be implemented.</p>
 <div class="section" id="stacks">
-<span id="id1"></span><h2><span class="section-number">5.1. </span>Stacks<a class="headerlink" href="#stacks" title="Permalink to this headline">¶</a></h2>
+<span id="id2"></span><h2><span class="section-number">5.1. </span>Stacks<a class="headerlink" href="#stacks" title="Permalink to this headline">¶</a></h2>
 <p>Possibly the simplest abstract data type which is not synonymous with
 a Python type is the <a class="reference internal" href="#term-stack"><span class="xref std std-term">stack</span></a>. A stack is a sequence of objects
 in which only the most recently added object is accessible. The image
@@ -200,9 +200,9 @@ <h3><span class="section-number">5.1.1. </span>An example: reverse Polish notati
 calculation, the result of the calculation is on the top of the stack.
 <a class="reference internal" href="#rpcalc"><span class="std std-numref">Listing 5.1</span></a> shows <a class="reference internal" href="2_objects.html#term-pseudocode"><span class="xref std std-term">pseudocode</span></a>, for a reverse Polish
 calculator.</p>
-<div class="literal-block-wrapper docutils container" id="id3">
+<div class="literal-block-wrapper docutils container" id="id4">
 <span id="rpcalc"></span><div class="code-block-caption"><span class="caption-number">Listing 5.1 </span><span class="caption-text">Pseudocode for a reverse Polish calculator implemented
-using a <a class="reference internal" href="#term-stack"><span class="xref std std-term">stack</span></a></span><a class="headerlink" href="#id3" title="Permalink to this code">¶</a></div>
+using a <a class="reference internal" href="#term-stack"><span class="xref std std-term">stack</span></a></span><a class="headerlink" href="#id4" title="Permalink to this code">¶</a></div>
 <div class="highlight-python3 notranslate"><div class="highlight"><pre><span></span><span class="k">for</span> <span class="n">item</span> <span class="ow">in</span> <span class="n">inputs</span><span class="p">:</span>
     <span class="k">if</span> <span class="n">item</span> <span class="ow">is</span> <span class="n">number</span><span class="p">:</span>
         <span class="n">stack</span><span class="o">.</span><span class="n">push</span><span class="p">(</span><span class="n">number</span><span class="p">)</span>
@@ -218,10 +218,10 @@ <h3><span class="section-number">5.1.1. </span>An example: reverse Polish notati
 because <span class="math notranslate nohighlight">\(4\ 2\ -\)</span> means <span class="math notranslate nohighlight">\(4 - 2\)</span>, not <span class="math notranslate nohighlight">\(2 - 4\)</span>.
 <a class="reference internal" href="#rptable"><span class="std std-numref">Table 5.1</span></a> Shows how a reverse Polish calculator would evaluate
 an arithmetic expression.</p>
-<span id="rptable"></span><table class="colwidths-given docutils align-default" id="id4">
+<span id="rptable"></span><table class="colwidths-given docutils align-default" id="id5">
 <caption><span class="caption-number">Table 5.1 </span><span class="caption-text">Evaluation of the reverse Polish expression
              <code class="xref py py-obj docutils literal notranslate"><span class="pre">6</span> <span class="pre">2</span> <span class="pre">/</span> <span class="pre">2</span> <span class="pre">4</span> <span class="pre">**</span> <span class="pre">+</span></code> using a stack
-             (equivalent to <span class="math notranslate nohighlight">\(6/2 + 2^4 = 3 + 16 = 19\)</span>).</span><a class="headerlink" href="#id4" title="Permalink to this table">¶</a></caption>
+             (equivalent to <span class="math notranslate nohighlight">\(6/2 + 2^4 = 3 + 16 = 19\)</span>).</span><a class="headerlink" href="#id5" title="Permalink to this table">¶</a></caption>
 <colgroup>
 <col style="width: 46%" />
 <col style="width: 15%" />
@@ -274,10 +274,10 @@ <h3><span class="section-number">5.1.2. </span>Implementing stacks in Python<a c
 <p>While it is strictly true that Python does not have a stack type, the
 <a class="reference external" href="https://docs.python.org/3/library/stdtypes.html#list" title="(in Python v3.8)"><code class="xref py py-class docutils literal notranslate"><span class="pre">list</span></code></a> class functions as a perfectly good stack. The
 relationship between the two is shown in <a class="reference internal" href="#list-stack"><span class="std std-numref">Table 5.2</span></a>.</p>
-<span id="list-stack"></span><table class="colwidths-given docutils align-default" id="id5">
+<span id="list-stack"></span><table class="colwidths-given docutils align-default" id="id6">
 <caption><span class="caption-number">Table 5.2 </span><span class="caption-text">Correspondence between abstract stack operations, and
              Python list operations. We assume a list called
-             <code class="xref py py-obj docutils literal notranslate"><span class="pre">my_list</span></code></span><a class="headerlink" href="#id5" title="Permalink to this table">¶</a></caption>
+             <code class="xref py py-obj docutils literal notranslate"><span class="pre">my_list</span></code></span><a class="headerlink" href="#id6" title="Permalink to this table">¶</a></caption>
 <colgroup>
 <col style="width: 33%" />
 <col style="width: 33%" />
@@ -358,7 +358,7 @@ <h2><span class="section-number">5.3. </span>Algorithmic complexity<a class="hea
 optimal algorithmic complexity, expressed in big ‘O’ notation, of
 operations on abstract data types will be known. Recall the definition
 of big ‘O’:</p>
-<div class="proof proof-type-definition" id="id6">
+<div class="proof proof-type-definition" id="id7">
 <span id="bigo"></span>
     <div class="proof-title">
         <span class="proof-type">Definition 5.2</span>
@@ -393,10 +393,10 @@ <h2><span class="section-number">5.3. </span>Algorithmic complexity<a class="hea
 complexity, which measures the peak memory usage of an algorithm or
 data structure.</p>
 <div class="badcode docutils container" id="badstack">
-<div class="literal-block-wrapper docutils container" id="id7">
+<div class="literal-block-wrapper docutils container" id="id8">
 <div class="code-block-caption"><span class="caption-number">Listing 5.3 </span><span class="caption-text">A poorly designed stack implementation in which push and pop cost
 <span class="math notranslate nohighlight">\(O(n)\)</span> operations, where <span class="math notranslate nohighlight">\(n\)</span> is the current
-number of objects on the stack.</span><a class="headerlink" href="#id7" title="Permalink to this code">¶</a></div>
+number of objects on the stack.</span><a class="headerlink" href="#id8" title="Permalink to this code">¶</a></div>
 <div class="highlight-python3 notranslate"><div class="highlight"><pre><span></span><span class="k">class</span> <span class="nc">BadStack</span><span class="p">:</span>
     <span class="k">def</span> <span class="fm">__init__</span><span class="p">(</span><span class="bp">self</span><span class="p">):</span>
         <span class="bp">self</span><span class="o">.</span><span class="n">data</span> <span class="o">=</span> <span class="p">()</span>
@@ -767,8 +767,8 @@ <h3><span class="section-number">5.4.4. </span>Dictionaries<a class="headerlink"
 iteration. <a class="reference internal" href="#iterating-linked-list"><span class="std std-numref">Listing 5.4</span></a> shows the code. The helper
 class <code class="xref py py-class docutils literal notranslate"><span class="pre">LinkIterator</span></code> is never seen by the user, it’s just there
 to keep track of the iteration.</p>
-<div class="literal-block-wrapper docutils container" id="id8">
-<span id="iterating-linked-list"></span><div class="code-block-caption"><span class="caption-number">Listing 5.4 </span><span class="caption-text">A simple linked list implementation that supports the iterator protocol.</span><a class="headerlink" href="#id8" title="Permalink to this code">¶</a></div>
+<div class="literal-block-wrapper docutils container" id="id9">
+<span id="iterating-linked-list"></span><div class="code-block-caption"><span class="caption-number">Listing 5.4 </span><span class="caption-text">A simple linked list implementation that supports the iterator protocol.</span><a class="headerlink" href="#id9" title="Permalink to this code">¶</a></div>
 <div class="highlight-python3 notranslate"><div class="highlight"><pre><span></span><span class="k">class</span> <span class="nc">Link</span><span class="p">:</span>
     <span class="k">def</span> <span class="fm">__init__</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">value</span><span class="p">,</span> <span class="nb">next</span><span class="o">=</span><span class="kc">None</span><span class="p">):</span>
         <span class="bp">self</span><span class="o">.</span><span class="n">value</span> <span class="o">=</span> <span class="n">value</span>

_modules/example_code/euclid.html

@@ -0,0 +1,71 @@
+
+<!DOCTYPE html>
+
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <meta name="viewport" content="width=device-width, initial-scale=1.0" />
+    <title>example_code.euclid &#8212; Object oriented programming in Python for mathematicians 2020.0 documentation</title>
+    <link rel="stylesheet" href="../../_static/fenics.css" type="text/css" />
+    <link rel="stylesheet" href="../../_static/pygments.css" type="text/css" />
+    <link rel="stylesheet" type="text/css" href="../../_static/proof.css" />
+    <link rel="stylesheet" type="text/css" href="../../_static/graphviz.css" />
+    <script id="documentation_options" data-url_root="../../" src="../../_static/documentation_options.js"></script>
+    <script src="../../_static/jquery.js"></script>
+    <script src="../../_static/underscore.js"></script>
+    <script src="../../_static/doctools.js"></script>
+    <script src="../../_static/language_data.js"></script>
+    <script src="../../_static/proof.js"></script>
+    <script async="async" src="https://cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS-MML_HTMLorMML"></script>
+    <link rel="index" title="Index" href="../../genindex.html" />
+    <link rel="search" title="Search" href="../../search.html" />
+<!--[if lte IE 6]>
+<link rel="stylesheet" href="../../_static/ie6.css" type="text/css" media="screen" charset="utf-8" />
+<![endif]-->
+
+<link rel="stylesheet" href="../../_static/featured.css">
+
+
+<link rel="shortcut icon" href="../../_static/icon.ico" />
+
+
+  </head><body>
+<div class="wrapper">
+  <a href="../../index.html"><img src="../../_static/banner.png" width="900px" alt="FInAT Project Banner" /></a>
+  <div id="access">
+    <div class="menu">
+      <ul>
+          <li class="page_item"><a href="https://github.com/finite-element/finite-element-course" title="GitHub">GitHub</a></li>
+      </ul>
+    </div><!-- .menu -->
+  </div><!-- #access -->
+</div><!-- #wrapper -->
+
+
+    <div class="document">
+      <div class="documentwrapper">
+        <div class="bodywrapper">
+          <div class="body" role="main">
+            
+  <h1>Source code for example_code.euclid</h1><div class="highlight"><pre>
+<div class="viewcode-block" id="gcd"><a class="viewcode-back" href="../../example_code.html#example_code.euclid.gcd">[docs]</a><span></span><span class="k">def</span> <span class="nf">gcd</span><span class="p">(</span><span class="n">a</span><span class="p">,</span> <span class="n">b</span><span class="p">):</span>
+    <span class="sd">&quot;&quot;&quot;Return the greatest common divisor of a and b using a recursive</span>
+<span class="sd">    implementation of Euclid&#39;s algorithm.&quot;&quot;&quot;</span>
+    <span class="k">try</span><span class="p">:</span>
+        <span class="k">return</span> <span class="n">gcd</span><span class="p">(</span><span class="n">b</span><span class="p">,</span> <span class="n">a</span> <span class="o">%</span> <span class="n">b</span><span class="p">)</span>
+    <span class="k">except</span> <span class="ne">ZeroDivisionError</span><span class="p">:</span>
+        <span class="k">return</span> <span class="n">a</span></div>
+</pre></div>
+
+            <div class="clearer"></div>
+          </div>
+        </div>
+      </div>
+      <div class="clearer"></div>
+    </div>
+    <div class="footer" role="contentinfo">
+        &#169; Copyright 2019-2020, David A. Ham.
+      Created using <a href="https://www.sphinx-doc.org/">Sphinx</a> 3.2.1.
+    </div>
+  </body>
+</html>