feedc0de/boost_unordered
1
0
Fork 0
forked from boostorg/unordered
Code Pull Requests Activity

Use Boost.Test's minimal test library for unordered & hash. It's closer to

Browse Source 
Boster.Test which makes it easier to switch to take advantage of Boost.Test's
extra testing facilities.

Merged revisions 44420 via svnmerge from 
https://svn.boost.org/svn/boost/branches/unordered/trunk

........
  r44420 | danieljames | 2008-04-14 19:02:03 +0100 (Mon, 14 Apr 2008) | 1 line
  
  Use Boost.Test's minimal test library.
........


[SVN r44487]
This commit is contained in:
Daniel James
2008-04-17 07:39:24 +00:00
parent cf529e496a
commit 9cfee57633
23 changed files with 282 additions and 285 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
test/unordered/compile_tests.hpp
View File

@@ -86,10 +86,10 @@ void container_test(X& r, T&)
// I'm not sure about either of these tests...
size_type max_diff((std::numeric_limits<difference_type>::max)());
difference_type converted_diff(max_diff);
BOOST_TEST((std::numeric_limits<difference_type>::max)()
BOOST_CHECK((std::numeric_limits<difference_type>::max)()
== converted_diff);
BOOST_TEST(
BOOST_CHECK(
static_cast<comparison_type>(
(std::numeric_limits<size_type>::max)()) >
static_cast<comparison_type>(
@@ -97,8 +97,8 @@ void container_test(X& r, T&)
// I don't test the runtime post-conditions here.
X u;
BOOST_TEST(u.size() == 0);
BOOST_TEST(X().size() == 0);
BOOST_CHECK(u.size() == 0);
BOOST_CHECK(X().size() == 0);
X a,b;
@@ -263,7 +263,7 @@ void unordered_test(X&, Key& k, T& t, Hash& hf, Pred& eq)
a.insert(i, j);
test::check_return_type<size_type>::equals(a.erase(k));
BOOST_TEST(a.empty());
BOOST_CHECK(a.empty());
if(a.empty()) {
a.insert(t);
q = a.cbegin();