#### /cln-1.3.2/src/rational/division/cl_RA_ceil22.cc

#
C++ | 74 lines | 53 code | 8 blank | 13 comment | 6 complexity | 3435e2f7a807636355f282c13656fd5d MD5 | raw file
``````
// ceiling2().

// General includes.
#include "base/cl_sysdep.h"

// Specification.
#include "cln/rational.h"

// Implementation.

#include "rational/cl_RA.h"
#include "cln/integer.h"

namespace cln {

const cl_RA_div_t ceiling2 (const cl_RA& x, const cl_RA& y)
{
#if 1 // Ist das wirklich schneller??
// Methode:
// x = a/b, y = c/d ->
//   (ceiling (* a d) (* b c)) liefert q und r.
//   Liefere q und r/(b*d).
// x Integer -> dito mit b=1.
// y Integer -> dito mit d=1.
// x und y Integer -> bekannt.
if (integerp(x)) {
DeclareType(cl_I,x);
if (integerp(y)) {
DeclareType(cl_I,y);
var cl_I_div_t q_r = ceiling2(x,y);
var cl_I& q = q_r.quotient;
var cl_I& r = q_r.remainder;
return cl_RA_div_t(q,r);
} else {
DeclareType(cl_RT,y);
var const cl_I& c = numerator(y);
var const cl_I& d = denominator(y);
var cl_I_div_t q_r = ceiling2(x*d,c);
var cl_I& q = q_r.quotient;
var cl_I& r = q_r.remainder;
return cl_RA_div_t(q,I_posI_div_RA(r,d));
}
} else {
DeclareType(cl_RT,x);
var const cl_I& a = numerator(x);
var const cl_I& b = denominator(x);
if (integerp(y)) {
DeclareType(cl_I,y);
var cl_I_div_t q_r = ceiling2(a,b*y);
var cl_I& q = q_r.quotient;
var cl_I& r = q_r.remainder;
return cl_RA_div_t(q,I_posI_div_RA(r,b));
} else {
DeclareType(cl_RT,y);
var const cl_I& c = numerator(y);
var const cl_I& d = denominator(y);
var cl_I_div_t q_r = ceiling2(a*d,b*c);
var cl_I& q = q_r.quotient;
var cl_I& r = q_r.remainder;
return cl_RA_div_t(q,I_posI_div_RA(r,b*d));
}
}
#else
// Methode:
// ceiling2(x/y) -> (q,r). Liefere q und x-y*q=y*r.
var cl_RA_div_t q_r = ceiling2(x/y);
var cl_I& q = q_r.quotient;
var cl_RA& r = q_r.remainder;
return cl_RA_div_t(q,y*r);
#endif
}

}  // namespace cln

``````