qr1->StartCounting(&counter, 100);
  TF_ASSERT_OK(coord.RegisterRunner(std::move(qr1)));

  std::unique_ptr<MockQueueRunner> qr2(new MockQueueRunner(&coord));
  qr2->StartCounting(&counter, 100);
  TF_ASSERT_OK(coord.RegisterRunner(std::move(qr2)));

  // Wait until the counting has started
  while (counter.load() == 0)
    ;
  TF_EXPECT_OK(coord.RequestStop());

	return 1 + r/s
}

// For x >= 8, the asymptotic expansions of qone is
//      3/8 s - 105/1024 s**3 - ..., where s = 1/x.
// We approximate qone by
//      qone(x) = s*(0.375 + (R/S))
// where R = qr1*s**2 + qr2*s**4 + ... + qr5*s**10
//       S = 1 + qs1*s**2 + ... + qs6*s**12
// and
//      | qone(x)/s -0.375-R/S | <= 2**(-61.13)

// for x in [inf, 8] = 1/[0,0.125]
var q1R8 = [6]float64{

}

// For x >= 8, the asymptotic expansions of qzero is
//      -1/8 s + 75/1024 s**3 - ..., where s = 1/x.
// We approximate pzero by
//      qzero(x) = s*(-1.25 + (R/S))
// where R = qR0 + qR1*s**2 + qR2*s**4 + ... + qR5*s**10
//       S = 1 + qS0*s**2 + ... + qS5*s**12
// and
//      | qzero(x)/s +1.25-R/S | <= 2**(-61.22)

// for x in [inf, 8]=1/[0,0.125]
var q0R8 = [6]float64{

ZuNVtzqiAzs6xPKu7mhkY4n6glT4z3+aH8arcDKtx9TxzpsvalpxfDKUwTiXHLh8
EHsGwyiA9deKmVnZdEftGaVmIB8se/dK3FUHVGstdVyN2eog7aC5VisrqbEf1Ywb
guc4a9ydhN8a1Z7ESY0DmXwg5KCwr4ifAAMFCADTftyUMWLddZpkFVey3sh+RTps
qr2+GamFLh+4HHjCnswEDraTSQYOZlZxuKdlafJvKmKWL2KFhIeWncRjMI1NtQxa
VuFz999ge6+tmwhPYPEw9vaIKeM+7kcwZ6BMzyJNOi1bjFiYlSwQMi+BBTPT9Q2w
8dNfldTT1Khwvdg4/kzFwRuA7QWmOfLdfvqtz4RMB31OYMmLsc6bbiCsp05BcdAm