#include "cl_LF.h"
#include "cln/integer.h"
#include "cl_alloca.h"
-#include "cln/abort.h"
+#include "cln/exception.h"
#undef floor
#include <cmath>
{
{ Mutable(cl_I,p);
var uintE lp = integer_length(p); // now |p| < 2^lp.
- if (!(lp <= lq)) cl_abort();
+ if (!(lp <= lq)) throw runtime_exception();
lp = lq - lp; // now |p/2^lq| < 2^-lp.
// Minimize lq (saves computation time).
{
#else // TRIVIAL_SPEEDUP
var cl_LF cossum = sqrt(cl_I_to_LF(1,actuallen) - square(sinsum));
#endif
- return cl_LF_cos_sin_t(shorten(cossum,len),shorten(sinsum,len)); // verkürzen und fertig
+ return cl_LF_cos_sin_t(shorten(cossum,len),shorten(sinsum,len)); // verkürzen und fertig
}}
// Bit complexity (N = len, and if p has length O(log N) and ql = O(log N)):
// O(log(N)*M(N)).