Use extracted pickNearestRational; ensure the max rational is actually the max for both num and denom

src/common/BQResampler.cpp

@@ -31,6 +31,8 @@
 #include "Allocators.h"
 #include "VectorOps.h"
 
+#include "mathmisc.h"
+
 #define BQ_R__ R__
 
 using std::vector;
@@ -376,41 +378,18 @@ BQResampler::fill_params(double ratio, double numd, double denomd) const
 BQResampler::params
 BQResampler::pick_params(double ratio) const
 {
-    // Farey algorithm, see
-    // https://www.johndcook.com/blog/2010/10/20/best-rational-approximation/
     int max_denom;
     if (m_dynamism == RatioMostlyFixed) {
         max_denom = 192000;
     } else {
         max_denom = m_qparams.rational_max;
-    }
+        if (ratio > 1.0) {
-    double a = 0.0, b = 1.0, c = 1.0, d = 0.0;
+            max_denom = int(ceil(max_denom / ratio));
-    double pa = a, pb = b, pc = c, pd = d;
-    double eps = 1e-9;
-    while (b <= max_denom && d <= max_denom) {
-        double mediant = (a + c) / (b + d);
-        if (fabs(ratio - mediant) < eps) {
-            if (b + d <= max_denom) {
-                return fill_params(ratio, a + c, b + d);
-            } else if (d > b) {
-                return fill_params(ratio, c, d);
-            } else {
-                return fill_params(ratio, a, b);
         }
     }
-        if (ratio > mediant) {
+    int num, denom;
-            pa = a; pb = b;
+    pickNearestRational(ratio, max_denom, num, denom);
-            a += c; b += d;
+    return fill_params(ratio, num, denom);
-        } else {
-            pc = c; pd = d;
-            c += a; d += b;
-        }
-    }
-    if (fabs(ratio - (pc / pd)) < fabs(ratio - (pa / pb))) {
-        return fill_params(ratio, pc, pd);
-    } else {
-        return fill_params(ratio, pa, pb);
-    }
 }
 
 void