* c/nondominated.h (find_nondominated_3d_impl): Delete and inline in callers.

 (find_dominated_3d_): Rename as find_dominated_3d_impl.
 (find_nondominated_set_3d_): Rename as find_nondominated_set_3d_impl.
 * hv3d_priv.h: Update comment.
 * pareto.c: Update comment.

Author: MLopez-Ibanez

c/hv3d_priv.h

@@ -37,7 +37,7 @@ new_avl_node(dlnode_t * restrict p, avl_node_t * restrict node)
 
   The main difference is that the order of the points in 2D is tracked by p->cnext/p->closest.
 
-  See also find_nondominated_set_3d_helper().
+  See also find_nondominated_set_3d_impl().
 */
 static inline void
 hv3d_preprocessing(dlnode_t * restrict list, size_t n)

c/nondominated.h

@@ -451,24 +451,14 @@ find_nondominated_3d_impl_sorted(const double ** rows, size_t size,
     return new_size;
 }
 
-static __force_inline__ size_t
-find_nondominated_3d_impl(const double ** restrict rows, size_t size,
-                          const bool keep_weakly,
-                          const bool find_dominated)
-{
-    // Sort in ascending lexicographic order from the last dimension.
-    qsort_typesafe(rows, size, cmp_ppdouble_asc_rev_3d);
-    // Help GCC generate all possible specializations of this function.
-    return keep_weakly
-        ? find_nondominated_3d_impl_sorted(rows, size,  true, find_dominated)
-        : find_nondominated_3d_impl_sorted(rows, size, false, find_dominated);
-}
-
 static inline size_t
-find_dominated_3d_(const double * restrict points, size_t size, bool keep_weakly)
+find_dominated_3d_impl(const double * restrict points, size_t size, bool keep_weakly)
 {
-    const double ** rows = generate_row_pointers(points, size, 3);
-    size_t pos = find_nondominated_3d_impl(rows, size, keep_weakly, /* find_dominated=*/true);
+    // Sort in ascending lexicographic order from the last dimension.
+    const double ** rows = generate_row_pointers_asc_rev_3d(points, size);
+    size_t pos = keep_weakly
+        ? find_nondominated_3d_impl_sorted(rows, size,  true, /* find_dominated=*/true)
+        : find_nondominated_3d_impl_sorted(rows, size, false, /* find_dominated=*/true);
     if (pos < size)
         pos = row_index_from_ptr(points, rows[pos], 3);
     free(rows);
@@ -480,12 +470,14 @@ find_dominated_3d_(const double * restrict points, size_t size, bool keep_weakly
    nondominated points.
 */
 static inline size_t
-find_nondominated_set_3d_(const double * restrict points, size_t size,
-                          const bool keep_weakly, boolvec * restrict nondom)
+find_nondominated_set_3d_impl(const double * restrict points, size_t size,
+                              const bool keep_weakly, boolvec * restrict nondom)
 {
     ASSUME(nondom != NULL);
-    const double ** rows = generate_row_pointers(points, size, 3);
-    size_t new_size = find_nondominated_3d_impl(rows, size, keep_weakly, /* find_dominated=*/false);
+    const double ** rows = generate_row_pointers_asc_rev_3d(points, size);
+    size_t new_size = keep_weakly
+        ? find_nondominated_3d_impl_sorted(rows, size,  true, /* find_dominated=*/false)
+        : find_nondominated_3d_impl_sorted(rows, size, false, /* find_dominated=*/false);
 
     if (new_size < size) {
         memset(nondom, false, size * sizeof(*nondom));
@@ -652,7 +644,7 @@ find_dominated_point_(const double * restrict points, size_t size, dimension_t d
         if (dim == 2) {
             res = find_dominated_2d_(pp, size, keep_weakly);
         } else {
-            res = find_dominated_3d_(pp, size, keep_weakly);
+            res = find_dominated_3d_impl(pp, size, keep_weakly);
         }
         if (pp != points)
             free((void *) pp);
@@ -696,7 +688,7 @@ find_nondominated_set_(const double * restrict points, size_t size, dimension_t
         if (dim == 2) {
             new_size = find_nondominated_set_2d_(pp, size, keep_weakly, nondom);
         } else if (dim == 3) {
-            new_size = find_nondominated_set_3d_(pp, size, keep_weakly, nondom);
+            new_size = find_nondominated_set_3d_impl(pp, size, keep_weakly, nondom);
         } else {
             new_size = find_nondominated_set_kung(pp, size, dim, keep_weakly, nondom);
         }

c/pareto.c

@@ -7,7 +7,7 @@
 /**
    Nondominated sorting in 3D in O(k * n log n), where k is the number of fronts.
 
-   Uses the same algorithm as find_nondominated_set_3d_helper().
+   Uses the same algorithm as find_nondominated_set_3d_impl().
 */
 
 static void