feedc0de/boost_integer
1
0
Fork 0
forked from boostorg/integer
Code Pull Requests Activity

Just use asserts, omg.

Browse Source
This commit is contained in:
Nick Thompson
2018-10-26 18:42:39 -06:00
parent f21a8e301a
commit 0c6ec8088d
4 changed files with 18 additions and 17 deletions
Download Patch File Download Diff File Expand all files Collapse all files

14
test/mod_inverse_test.cpp
View File

@ -4,8 +4,8 @@
* Boost Software License, Version 1.0. (See accompanying file
* LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
*/
#define BOOST_TEST_MODULE mod_inverse_test
#include <boost/test/included/unit_test.hpp>
#include <cassert>
#include <boost/type_index.hpp>
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/integer/common_factor.hpp>
#include <boost/integer/mod_inverse.hpp>
@ -34,26 +34,28 @@ void test_mod_inverse()
// Should fail if gcd(a, mod) != 1:
if (gcdam > 1)
{
BOOST_CHECK(!inv_a);
assert(!inv_a);
}
else
{
BOOST_CHECK(inv_a.value() > 0);
assert(inv_a.value() > 0);
// Cast to a bigger type so the multiplication won't overflow.
int256_t a_inv = inv_a.value();
int256_t big_a = a;
int256_t m = modulus;
int256_t outta_be_one = (a_inv*big_a) % m;
BOOST_CHECK_EQUAL(outta_be_one, 1);
assert(outta_be_one == 1);
}
}
}
}
BOOST_AUTO_TEST_CASE(mod_inverse_test)
int main()
{
test_mod_inverse<int16_t>();
test_mod_inverse<int32_t>();
test_mod_inverse<int64_t>();
test_mod_inverse<int128_t>();
return 0;
}