fixup kung

Author: MLopez-Ibanez

c/nondominated.h

@@ -362,11 +362,12 @@ find_nondominated_3d_impl_sorted(const double ** restrict rows, size_t size,
     avl_insert_after(&tree, node - 1, node);
 
     // In this context, size means "no dominated solution found".
-    size_t new_size = size, j = 1;
+    size_t new_size = size, j = 1, k = 0;
     const double * last_dom = NULL;
     const double * restrict pk = rows[0];
     do {
         bool dominated;
+        size_t pos_dom = j;
         const double * restrict pj = rows[j];
         DEBUG2(printf_point("pj = [ ", pj, 3, " ], "));
         if (pk[0] > pj[0] || pk[1] > pj[1]) {
@@ -416,8 +417,10 @@ find_nondominated_3d_impl_sorted(const double ** restrict rows, size_t size,
             const bool k_eq_j = (pk[0] == pj[0]) & (pk[1] == pj[1]) & (pk[2] == pj[2]);
             if (!keep_weakly) { // We don't keep duplicates;
                 dominated = true;
-                if (unlikely(k_eq_j) && pj < pk) // Only the first duplicated point is kept.
-                    SWAP(pk, pj);
+                if (unlikely(k_eq_j) && pj < pk) { // Only the first duplicated point is kept.
+                    pos_dom = k;
+                    pj = pk;
+                }
             } else { // or it is not a duplicate, so it is non-weakly dominated;
                 dominated = likely(!k_eq_j)
                     // or pk was dominated, then this one is also dominated.
@@ -428,14 +431,15 @@ find_nondominated_3d_impl_sorted(const double ** restrict rows, size_t size,
         if (dominated) { // pj is dominated by a point in the tree or by prev.
             if (find_one_dominated) {
                 // In this context, it means "position of the first dominated solution found".
-                new_size = j;
+                new_size = pos_dom;
                 goto early_end;
             }
             last_dom = pj;
-            rows[j] = NULL;
+            rows[pos_dom] = NULL;
             new_size--;
         } else {
             pk = pj;
+            k = j;
         }
         j++;
     } while (j < size);