From d19ea80d908775bf5e3fdfad9cf5a70e64cf4689 Mon Sep 17 00:00:00 2001
From: Bas Nijholt <basnijholt@gmail.com>
Date: Fri, 13 Sep 2019 16:25:53 +0200
Subject: [PATCH] simplify code

---
 paper.md | 7 ++-----
 1 file changed, 2 insertions(+), 5 deletions(-)

diff --git a/paper.md b/paper.md
index f55b7a1..9d49ff1 100755
--- a/paper.md
+++ b/paper.md
@@ -146,12 +146,9 @@ When querying $n>1$ points, the former procedure simply repeats $n$ times.
 <!-- example of distance loss on singularities -->
 ```python
 from adaptive import Learner1D, Runner
-from module import complicated_function
+from module import complicated_function as f
 
-learner = Learner1D(
-	complicated_function,
-	bounds=(-1, 1),
-)
+learner = Learner1D(f, bounds=(-1, 1))
 
 def goal(learner):
 	return learner.loss() < 0.01
-- 
GitLab