boostorg/unordered
1
0
Fork 1
mirror of https://github.com/boostorg/unordered.git synced 2025-07-31 03:47:16 +02:00
Code Issues Packages Projects Releases Wiki Activity

Avoid -Wconversion warnings in unordered & hash.

Browse Source 
[SVN r67170]
This commit is contained in:
Daniel James
2010-12-11 14:43:00 +00:00
parent 5a81ca6ffe
commit 3d7abd9cbe
4 changed files with 14 additions and 13 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
test/unordered/Jamfile.v2
View File

@ -9,8 +9,8 @@ project unordered-test/unordered
: requirements : requirements
<warnings>all <warnings>all
<toolset>intel:<warnings>on <toolset>intel:<warnings>on
<toolset>gcc:<cxxflags>"-pedantic -Wstrict-aliasing -fstrict-aliasing -Wextra -Wsign-promo -Wunused-parameter" <toolset>gcc:<cxxflags>"-pedantic -Wstrict-aliasing -fstrict-aliasing -Wextra -Wsign-promo -Wunused-parameter -Wconversion"
<toolset>darwin:<cxxflags>"-pedantic -Wstrict-aliasing -fstrict-aliasing -Wextra -Wsign-promo -Wunused-parameter" <toolset>darwin:<cxxflags>"-pedantic -Wstrict-aliasing -fstrict-aliasing -Wextra -Wsign-promo -Wunused-parameter -Wconversion"
<toolset>gcc:<define>_GLIBCXX_DEBUG <toolset>gcc:<define>_GLIBCXX_DEBUG
#<toolset>darwin:<define>_GLIBCXX_DEBUG #<toolset>darwin:<define>_GLIBCXX_DEBUG
<toolset>msvc:<warnings-as-errors>on <toolset>msvc:<warnings-as-errors>on

18
test/unordered/insert_tests.cpp
View File

@ -52,7 +52,7 @@ void unique_insert_tests1(X*,
tracker.compare_key(x, *it); tracker.compare_key(x, *it);
if(x.size() < b * old_bucket_count) if(static_cast<double>(x.size()) < b * static_cast<double>(old_bucket_count))
BOOST_TEST(x.bucket_count() == old_bucket_count); BOOST_TEST(x.bucket_count() == old_bucket_count);
} }
@ -83,7 +83,7 @@ void equivalent_insert_tests1(X*,
tracker.compare_key(x, *it); tracker.compare_key(x, *it);
if(x.size() < b * old_bucket_count) if(static_cast<double>(x.size()) < b * static_cast<double>(old_bucket_count))
BOOST_TEST(x.bucket_count() == old_bucket_count); BOOST_TEST(x.bucket_count() == old_bucket_count);
} }
@ -118,7 +118,7 @@ void insert_tests2(X*,
BOOST_TEST(*r1 == *r2); BOOST_TEST(*r1 == *r2);
tracker.compare_key(x, *it); tracker.compare_key(x, *it);
if(x.size() < b * old_bucket_count) if(static_cast<double>(x.size()) < b * static_cast<double>(old_bucket_count))
BOOST_TEST(x.bucket_count() == old_bucket_count); BOOST_TEST(x.bucket_count() == old_bucket_count);
} }
@ -145,7 +145,7 @@ void insert_tests2(X*,
BOOST_TEST(*r1 == *r2); BOOST_TEST(*r1 == *r2);
tracker.compare_key(x, *it); tracker.compare_key(x, *it);
if(x.size() < b * old_bucket_count) if(static_cast<double>(x.size()) < b * static_cast<double>(old_bucket_count))
BOOST_TEST(x.bucket_count() == old_bucket_count); BOOST_TEST(x.bucket_count() == old_bucket_count);
} }
@ -172,7 +172,7 @@ void insert_tests2(X*,
BOOST_TEST(*pos == *r2); BOOST_TEST(*pos == *r2);
tracker.compare_key(x, *it); tracker.compare_key(x, *it);
if(x.size() < b * old_bucket_count) if(static_cast<double>(x.size()) < b * static_cast<double>(old_bucket_count))
BOOST_TEST(x.bucket_count() == old_bucket_count); BOOST_TEST(x.bucket_count() == old_bucket_count);
} }
@ -197,7 +197,7 @@ void insert_tests2(X*,
tracker.insert(*it); tracker.insert(*it);
tracker.compare_key(x, *it); tracker.compare_key(x, *it);
if(x.size() < b * old_bucket_count) if(static_cast<double>(x.size()) < b * static_cast<double>(old_bucket_count))
BOOST_TEST(x.bucket_count() == old_bucket_count); BOOST_TEST(x.bucket_count() == old_bucket_count);
} }
@ -275,7 +275,7 @@ void unique_emplace_tests1(X*,
tracker.compare_key(x, *it); tracker.compare_key(x, *it);
if(x.size() < b * old_bucket_count) if(static_cast<double>(x.size()) < b * static_cast<double>(old_bucket_count))
BOOST_TEST(x.bucket_count() == old_bucket_count); BOOST_TEST(x.bucket_count() == old_bucket_count);
} }
@ -306,7 +306,7 @@ void equivalent_emplace_tests1(X*,
tracker.compare_key(x, *it); tracker.compare_key(x, *it);
if(x.size() < b * old_bucket_count) if(static_cast<double>(x.size()) < b * static_cast<double>(old_bucket_count))
BOOST_TEST(x.bucket_count() == old_bucket_count); BOOST_TEST(x.bucket_count() == old_bucket_count);
} }
@ -335,7 +335,7 @@ void map_tests(X*, test::random_generator generator = test::default_generator)
tracker.compare_key(x, *it); tracker.compare_key(x, *it);
if(x.size() < b * old_bucket_count) if(static_cast<double>(x.size()) < b * static_cast<double>(old_bucket_count))
BOOST_TEST(x.bucket_count() == old_bucket_count); BOOST_TEST(x.bucket_count() == old_bucket_count);
} }

2
test/unordered/load_factor_tests.cpp
View File

@ -51,7 +51,7 @@ void insert_test(X*, float mlf,
BOOST_DEDUCED_TYPENAME X::size_type old_size = x.size(), BOOST_DEDUCED_TYPENAME X::size_type old_size = x.size(),
old_bucket_count = x.bucket_count(); old_bucket_count = x.bucket_count();
x.insert(*it); x.insert(*it);
if(old_size + 1 < b * old_bucket_count) if(static_cast<double>(old_size + 1) < b * static_cast<double>(old_bucket_count))
BOOST_TEST(x.bucket_count() == old_bucket_count); BOOST_TEST(x.bucket_count() == old_bucket_count);
} }
} }

3
test/unordered/rehash_tests.cpp
View File

@ -19,7 +19,8 @@ test::seed_t seed(2974);
template <class X> template <class X>
bool postcondition(X const& x, BOOST_DEDUCED_TYPENAME X::size_type n) bool postcondition(X const& x, BOOST_DEDUCED_TYPENAME X::size_type n)
{ {
return x.bucket_count() > x.size() / x.max_load_factor() && return static_cast<double>(x.bucket_count()) >
static_cast<double>(x.size()) / x.max_load_factor() &&
x.bucket_count() >= n; x.bucket_count() >= n;
} }