boostorg/integer
1
0
Fork 1
mirror of https://github.com/boostorg/integer.git synced 2025-07-29 20:27:14 +02:00
Code Issues Packages Projects Releases Wiki Activity

[ci skip] Add test of short int to see if there's any obvious places for overflow (none are obvious, but no guarantees they still aren't there). Print basic information about the test to console so that failures are easier to track down.

Browse Source
This commit is contained in:
Nick Thompson
2018-02-10 13:56:11 -06:00
parent 8c415f77b1
commit b3966428c4
4 changed files with 11 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
test/mod_inverse_test.cpp
View File

@ -4,19 +4,21 @@
* 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 modular_multiplicative_inverse_test
#define BOOST_TEST_MODULE mod_inverse_test
#include <boost/test/included/unit_test.hpp>
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/integer/common_factor.hpp>
#include <boost/integer/mod_inverse.hpp>
using boost::multiprecision::int128_t;
using boost::multiprecision::int256_t;
using boost::integer::mod_inverse;
using boost::integer::gcd;
template<class Z>
void test_mod_inverse()
{
std::cout << "Testing the modular multiplicative inverse on type " << boost::typeindex::type_id<Z>().pretty_name() << "\n";
Z max_arg = 1000;
for (Z modulus = 2; modulus < max_arg; ++modulus)
{
@ -39,10 +41,12 @@ void test_mod_inverse()
}
}
BOOST_AUTO_TEST_CASE(extended_euclidean_test)
BOOST_AUTO_TEST_CASE(mod_inverse_test)
{
test_mod_inverse<short int>();
test_mod_inverse<int>();
test_mod_inverse<long>();
test_mod_inverse<long long>();
test_mod_inverse<int128_t>();
test_mod_inverse<int256_t>();
}