From d046875baed722648d9c641fe74215c34bfc0e21 Mon Sep 17 00:00:00 2001
From: Bas Nijholt <basnijholt@gmail.com>
Date: Fri, 13 Sep 2019 16:01:11 +0200
Subject: [PATCH] use listings

---
 Makefile | 2 +-
 paper.md | 4 ++++
 2 files changed, 5 insertions(+), 1 deletion(-)

diff --git a/Makefile b/Makefile
index de70501..cb93e6a 100755
--- a/Makefile
+++ b/Makefile
@@ -7,4 +7,4 @@ bbl: paper.tex
 	bibtex paper.aux
 
 paper.tex:
-	pandoc -s --filter pandoc-fignos --filter pandoc-citeproc --filter pandoc-crossref --natbib paper.md -o paper.tex --bibliography paper.bib --template revtex.template
+	pandoc -s --filter pandoc-fignos --filter pandoc-citeproc --filter pandoc-crossref --natbib paper.md -o paper.tex --bibliography paper.bib --listings -H listings-setup.tex --template revtex.template
diff --git a/paper.md b/paper.md
index cf61644..231d6ac 100755
--- a/paper.md
+++ b/paper.md
@@ -144,6 +144,10 @@ When querying $n>1$ points, the former procedure simply repeats $n$ times.
 
 #### A failure mode of such algorithms is sampling only a small neighborhood of one point.
 <!-- example of distance loss on singularities -->
+```python
+import adaptive
+
+```
 
 #### A solution is to regularize the loss such that this would be avoided.
 <!-- like resolution loss which limits the size of an interval -->
-- 
GitLab