boost/multiprecision
2
0
Fork 0
mirror of https://github.com/boostorg/multiprecision.git synced 2026-01-19 04:22:11 +00:00
Code Issues Projects Releases Wiki Activity

Correct inspect issues.

Browse Source
This commit is contained in:
jzmaddock
2021-01-11 13:21:26 +00:00
parent 3d8f1529df
commit f7ae8e869a
1 changed files with 6 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

9
performance/mixed_equivalent_types_bench.cpp
View File

@@ -75,7 +75,8 @@ using namespace boost::multiprecision;
//[dot_prod_1
cpp_int dot_product_1(const std::vector<cpp_int>& v1, const std::vector<cpp_int>& v2)
{
assert(v1.size() == v2.size()); // we should really do better than an assert here!
if (v1.size() != v2.size())
throw std::domain_error("Mismatched arguments");
cpp_int result;
for (std::size_t i = 0; i < v1.size(); ++i)
@@ -89,7 +90,8 @@ cpp_int dot_product_1(const std::vector<cpp_int>& v1, const std::vector<cpp_int>
//[dot_prod_2
cpp_int dot_product_2(const std::vector<cpp_int>& v1, const std::vector<cpp_int>& v2)
{
assert(v1.size() == v2.size()); // we should really do better than an assert here!
if (v1.size() != v2.size())
throw std::domain_error("Mismatched arguments");
//
// If we know that most of our data is of a certain range of values, then we can use a cpp_int type
// with an internal cache large enough to *probably* not require an allocation:
@@ -109,7 +111,8 @@ cpp_int dot_product_2(const std::vector<cpp_int>& v1, const std::vector<cpp_int>
//[dot_prod_3
cpp_int dot_product_3(const std::vector<cpp_int>& v1, const std::vector<cpp_int>& v2)
{
assert(v1.size() == v2.size()); // we should really do better than an assert here!
if (v1.size() != v2.size())
throw std::domain_error("Mismatched arguments");
cpp_int result, term;
for (std::size_t i = 0; i < v1.size(); ++i)