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

Remove some minor TODOs. These were more notes to myself than anything.

Browse Source 
[SVN r41779]
This commit is contained in:
Daniel James
2007-12-06 11:40:11 +00:00
parent 32450a0b18
commit c013d15c16
2 changed files with 0 additions and 7 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
test/container/compile_tests.hpp
View File

@@ -50,9 +50,7 @@ void container_test(X& r, T&)
// reference_type / const_reference_type
// TODO: 'lvalue of T'
BOOST_MPL_ASSERT((boost::is_same<T&, reference>));
// TODO: 'const lvalue of T'
BOOST_MPL_ASSERT((boost::is_same<T const&, const_reference>));
// iterator
@@ -63,7 +61,6 @@ void container_test(X& r, T&)
// const_iterator
// TODO: Test that it's a constant iterator?
boost::function_requires<boost::InputIteratorConcept<const_iterator> >();
BOOST_MPL_ASSERT((boost::is_same<T, const_iterator_value_type>));

4
test/unordered/compile_tests.cpp
View File

@@ -113,8 +113,6 @@ void unordered_test(X&, Key& k, T& t, Hash& hf, Pred& eq)
BOOST_MPL_ASSERT((boost::is_same<Pred, key_equal>));
test::check_return_type<bool>::convertible(eq(k, k));
// TODO: Pred is an equivalence relation. Doesn't really matter for these
// tests.
boost::function_requires<boost::InputIteratorConcept<local_iterator> >();
BOOST_MPL_ASSERT((boost::is_same<local_iterator_category, iterator_category>));
@@ -160,7 +158,6 @@ void unordered_test(X&, Key& k, T& t, Hash& hf, Pred& eq)
const_iterator q = a.cbegin();
test::check_return_type<iterator>::equals(a.insert(q, t));
// TODO: void return?
a.insert(i, j);
test::check_return_type<size_type>::equals(a.erase(k));
@@ -174,7 +171,6 @@ void unordered_test(X&, Key& k, T& t, Hash& hf, Pred& eq)
const_iterator q1 = a.cbegin(), q2 = a.cend();
test::check_return_type<iterator>::equals(a.erase(q1, q2));
// TODO: void return?
a.clear();
test::check_return_type<iterator>::equals(a.find(k));