From 08e1f4e0852d51fcfc0dfe33289ff028ba277036 Mon Sep 17 00:00:00 2001
From: Dirkjan Ochtman <dirkjan@ochtman.nl>
Date: Tue, 19 Jan 2021 10:47:59 +0100
Subject: [PATCH] Fix formatting

---
 src/lib.rs | 8 +++++++-
 1 file changed, 7 insertions(+), 1 deletion(-)

diff --git a/src/lib.rs b/src/lib.rs
index c8fcf69..0938254 100644
--- a/src/lib.rs
+++ b/src/lib.rs
@@ -489,7 +489,13 @@ trait Layer {
     /// M * 2 links per node), but for performance reasons we often call this function on the data
     /// representation matching the zero layer even when we're referring to a higher layer. In that
     /// case, we use `links` to constrain the number of per-candidate links we consider for search.
-    fn search<P: Point>(&self, point: &P, search: &mut Search, points: &[P], links: usize) {
+    fn search<P: Point>(
+        &self,
+        point: &P,
+        search: &mut Search,
+        points: &[P],
+        links: usize,
+    ) {
         while let Some(Reverse(candidate)) = search.candidates.pop() {
             if let Some(furthest) = search.nearest.last() {
                 if candidate.distance > furthest.distance {