Effective implementation of algorithms (Master Thesis)
Effective and error-free implementation of algorithms
|
#include <multmod_simple.h>
Static Public Member Functions | |
template<typename T > | |
static T | max_argument (T UNUSED(x)) |
static BaseType | multmod (BaseType a, BaseType b, BaseType modulo) |
Private Types | |
typedef int | BaseType |
typedef long long | DoubleType |
Private Member Functions | |
STATIC_ASSERT (std::numeric_limits< BaseType >::digits *2<=std::numeric_limits< DoubleType >::digits,"The long long is not enough for temporary ""computations") |
typedef int math::powermod::MultmodSimple::BaseType [private] |
typedef long long math::powermod::MultmodSimple::DoubleType [private] |
static T math::powermod::MultmodSimple::max_argument | ( | T | UNUSEDx | ) | [inline, static] |
static BaseType math::powermod::MultmodSimple::multmod | ( | BaseType | a, |
BaseType | b, | ||
BaseType | modulo | ||
) | [inline, static] |
math::powermod::MultmodSimple::STATIC_ASSERT | ( | std::numeric_limits< BaseType >::digits *2<=std::numeric_limits< DoubleType >::digits | , |
"The long long is not enough for temporary ""computations" | |||
) | [private] |