boostorg/unordered
1
0
Fork 1
mirror of https://github.com/boostorg/unordered.git synced 2025-10-04 11:41:03 +02:00
Code Issues Packages Projects Releases Wiki 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

14
test/exception/insert_exception_tests.cpp
View File

@@ -109,10 +109,10 @@ struct insert_test_rehash1 : public insert_test_base<T>
size_type bucket_count = x.bucket_count();
size_type initial_elements = static_cast<size_type>(
ceil(bucket_count * (double) x.max_load_factor()) - 1);
UNORDERED_REQUIRE(initial_elements < this->values.size());
BOOST_REQUIRE(initial_elements < this->values.size());
x.insert(this->values.begin(),
boost::next(this->values.begin(), initial_elements));
UNORDERED_REQUIRE(bucket_count == x.bucket_count());
BOOST_REQUIRE(bucket_count == x.bucket_count());
return x;
}
@@ -131,7 +131,7 @@ struct insert_test_rehash1 : public insert_test_base<T>
// This isn't actually a failure, but it means the test isn't doing its
// job.
UNORDERED_REQUIRE(x.bucket_count() != bucket_count);
BOOST_REQUIRE(x.bucket_count() != bucket_count);
}
};
@@ -154,7 +154,7 @@ struct insert_test_rehash2 : public insert_test_rehash1<T>
// This isn't actually a failure, but it means the test isn't doing its
// job.
UNORDERED_REQUIRE(x.bucket_count() != bucket_count);
BOOST_REQUIRE(x.bucket_count() != bucket_count);
}
};
@@ -178,10 +178,10 @@ struct insert_test_rehash3 : public insert_test_base<T>
size_type initial_elements = rehash_bucket_count - 5;
UNORDERED_REQUIRE(initial_elements < this->values.size());
BOOST_REQUIRE(initial_elements < this->values.size());
x.insert(this->values.begin(),
boost::next(this->values.begin(), initial_elements));
UNORDERED_REQUIRE(original_bucket_count == x.bucket_count());
BOOST_REQUIRE(original_bucket_count == x.bucket_count());
return x;
}
@@ -193,7 +193,7 @@ struct insert_test_rehash3 : public insert_test_base<T>
// This isn't actually a failure, but it means the test isn't doing its
// job.
UNORDERED_REQUIRE(x.bucket_count() != bucket_count);
BOOST_REQUIRE(x.bucket_count() != bucket_count);
}
void check(T const& x) const {