sparse QuadTree_get_nearest_internal: remove redundant branch

diff --git a/lib/sparse/QuadTree.c b/lib/sparse/QuadTree.c
index d27722e39b7857e287a320ea7ecb7ed375dbc2a8..297354c026a141433dbb87532537395aca9a505a 100644 (file)
--- a/lib/sparse/QuadTree.c
+++ b/lib/sparse/QuadTree.c
@@ -665,17 +665,15 @@ static void QuadTree_get_nearest_internal(QuadTree qt, double *x, double *y, dou
   if (!qt) return;
   dim = qt->dim;
   l = qt->l;
-  if (l){
-    while (l){
-      coord = node_data_get_coord(SingleLinkedList_get_data(l));
-      dist = point_distance(x, coord, dim);
-      if(*min < 0 || dist < *min) {
-       *min = dist;
-       *imin = node_data_get_id(SingleLinkedList_get_data(l));
-       for (i = 0; i < dim; i++) y[i] = coord[i];
-      }
-      l = SingleLinkedList_get_next(l);
+  while (l){
+    coord = node_data_get_coord(SingleLinkedList_get_data(l));
+    dist = point_distance(x, coord, dim);
+    if(*min < 0 || dist < *min) {
+      *min = dist;
+      *imin = node_data_get_id(SingleLinkedList_get_data(l));
+      for (i = 0; i < dim; i++) y[i] = coord[i];
     }
+    l = SingleLinkedList_get_next(l);
   }
   
   if (qt->qts){