Danny Robson
52f53caee5
HARD vs SOFT assertions were never very well defined or supported. Currently they just imply a level of functionality that isn't present; it's better to remove them instead of expending the effort at this point.
60 lines
1.7 KiB
C++
60 lines
1.7 KiB
C++
#include "../debug.hpp"
|
|
#include "../maths.hpp"
|
|
|
|
#include <cstdlib>
|
|
#include <cmath>
|
|
#include <limits>
|
|
|
|
using std::sqrt;
|
|
using std::numeric_limits;
|
|
|
|
int
|
|
main (int, char **) {
|
|
std::cerr.precision (15);
|
|
std::cout.precision (15);
|
|
|
|
CHECK (!almost_equal (-2.0, 0.0));
|
|
CHECK (!almost_equal (-2.f, 0.f));
|
|
CHECK ( almost_equal ( 0.0, 0.0));
|
|
//CHECK_HARD ( almost_equal ( 0.0, numeric_limits<double>::min ()));
|
|
CHECK ( almost_equal (numeric_limits<double>::infinity (),
|
|
numeric_limits<double>::infinity ()));
|
|
CHECK (!almost_equal (numeric_limits<double>::infinity (), 0.0));
|
|
CHECK (!almost_equal (numeric_limits<double>::quiet_NaN (),
|
|
numeric_limits<double>::quiet_NaN ()));
|
|
|
|
|
|
CHECK_EQ (min (-2, 0, 2), -2);
|
|
CHECK_EQ (max (-2, 0, 2), 2);
|
|
|
|
CHECK_EQ (pow2 (2), 4);
|
|
CHECK_EQ (pow2 (4), 16);
|
|
|
|
CHECK_EQ (rootsquare (2, 2), sqrt (8));
|
|
|
|
double pos_zero = 1.0 / numeric_limits<double>::infinity ();
|
|
double neg_zero = -1.0 / numeric_limits<double>::infinity ();
|
|
|
|
CHECK_EQ (sign (-1), -1);
|
|
CHECK_EQ (sign ( 1), 1);
|
|
CHECK_EQ (sign (pos_zero), 1);
|
|
CHECK_EQ (sign (neg_zero), -1);
|
|
CHECK_EQ (sign ( numeric_limits<double>::infinity ()), 1);
|
|
CHECK_EQ (sign (-numeric_limits<double>::infinity ()), -1);
|
|
|
|
CHECK_EQ (to_degrees (PI_d), 180.0);
|
|
CHECK_EQ (to_degrees (PI_f), 180.f);
|
|
CHECK_EQ (to_radians (180.f), PI_f);
|
|
CHECK_EQ (to_radians (180.0), PI_d);
|
|
|
|
CHECK_EQ (log2 (8u), 3);
|
|
CHECK_EQ (log2 (1u), 0);
|
|
|
|
CHECK_EQ (log2 (9u), 3);
|
|
CHECK_EQ (log2up (9u), 4);
|
|
CHECK_EQ (log2up (8u), 3);
|
|
CHECK_EQ (log2up (1u), 0);
|
|
|
|
return EXIT_SUCCESS;
|
|
}
|