feedc0de/boost_intrusive
1
0
Fork 0
forked from boostorg/intrusive
Code Pull Requests Activity

Fixed GCC 4.8 unused typedefs warnings

Browse Source 
[SVN r85309]
This commit is contained in:
Ion Gaztañaga
2013-08-11 22:15:57 +00:00
parent b85b40e851
commit 1edf4c995e
10 changed files with 12 additions and 16 deletions
Download Patch File Download Diff File Expand all files Collapse all files

1
example/doc_avl_set.cpp
View File

@@ -47,7 +47,6 @@ typedef avl_multiset< MyClass, MemberOption> MemberMultiset;
int main()
{
typedef std::vector<MyClass>::iterator VectIt;
typedef std::vector<MyClass>::reverse_iterator VectRit;
//Create several MyClass objects, each one with a different value
std::vector<MyClass> values;

1
example/doc_list.cpp
View File

@@ -39,7 +39,6 @@ typedef list< MyClass
int main()
{
typedef std::vector<MyClass>::iterator VectIt;
typedef std::vector<MyClass>::reverse_iterator VectRit;
//Create several MyClass objects, each one with a different value
std::vector<MyClass> values;

1
example/doc_set.cpp
View File

@@ -47,7 +47,6 @@ typedef multiset< MyClass, MemberOption> MemberMultiset;
int main()
{
typedef std::vector<MyClass>::iterator VectIt;
typedef std::vector<MyClass>::reverse_iterator VectRit;
//Create several MyClass objects, each one with a different value
std::vector<MyClass> values;

1
example/doc_sg_set.cpp
View File

@@ -48,7 +48,6 @@ typedef sg_multiset< MyClass, MemberOption> MemberMultiset;
int main()
{
typedef std::vector<MyClass>::iterator VectIt;
typedef std::vector<MyClass>::reverse_iterator VectRit;
//Create several MyClass objects, each one with a different value
std::vector<MyClass> values;

1
example/doc_splay_set.cpp
View File

@@ -53,7 +53,6 @@ typedef splay_multiset< MyClass, MemberOption> MemberSplayMultiset;
int main()
{
typedef std::vector<MyClass>::iterator VectIt;
typedef std::vector<MyClass>::reverse_iterator VectRit;
//Create several MyClass objects, each one with a different value
std::vector<MyClass> values;

1
example/doc_unordered_set.cpp
View File

@@ -46,7 +46,6 @@ typedef unordered_multiset< MyClass, MemberOption> MemberMultiSet;
int main()
{
typedef std::vector<MyClass>::iterator VectIt;
typedef std::vector<MyClass>::reverse_iterator VectRit;
//Create a vector with 100 different MyClass objects
std::vector<MyClass> values;

2
test/generic_assoc_test.hpp
View File

@@ -184,7 +184,6 @@ void test_generic_assoc<ValueTraits, ContainerDefiner>::test_insert_erase_burst(
template<class ValueTraits, template <class = void, class = void, class = void, class = void> class ContainerDefiner>
void test_generic_assoc<ValueTraits, ContainerDefiner>::test_all(std::vector<typename ValueTraits::value_type>& values)
{
typedef typename ValueTraits::value_type value_type;
test_clone(values);
test_container_from_end(values);
test_splay_up(values);
@@ -356,7 +355,6 @@ void test_generic_assoc<ValueTraits, ContainerDefiner>::test_rebalance
, constant_time_size<value_type::constant_time_size>
>::type assoc_type;
typedef std::vector<value_type> orig_set_t;
typedef typename orig_set_t::iterator iterator_t;
orig_set_t original_testset;
{
assoc_type testset (values.begin(), values.end());

1
test/generic_multiset_test.hpp
View File

@@ -206,7 +206,6 @@ void test_generic_multiset<ValueTraits, ContainerDefiner>::test_find(std::vector
>::type multiset_type;
multiset_type testset (values.begin(), values.end());
typedef typename multiset_type::iterator iterator;
typedef typename multiset_type::const_iterator const_iterator;
{
value_type cmp_val;

1
test/generic_set_test.hpp
View File

@@ -277,7 +277,6 @@ void test_generic_set<ValueTraits, ContainerDefiner>::test_find(std::vector<type
>::type set_type;
set_type testset (values.begin(), values.end());
typedef typename set_type::iterator iterator;
typedef typename set_type::const_iterator const_iterator;
{
value_type cmp_val;

18
test/test_container.hpp
View File

@@ -27,8 +27,8 @@ struct is_unordered
static const bool value = false;
};
template< class Container >
void test_container( Container & c )
template<class Container>
struct test_container_typedefs
{
typedef typename Container::value_type value_type;
typedef typename Container::iterator iterator;
@@ -39,10 +39,17 @@ void test_container( Container & c )
typedef typename Container::const_pointer const_pointer;
typedef typename Container::difference_type difference_type;
typedef typename Container::size_type size_type;
typedef typename Container::difference_type difference_type;
typedef typename Container::size_type size_type;
typedef typename Container::value_traits value_traits;
};
template< class Container >
void test_container( Container & c )
{
typedef typename Container::const_iterator const_iterator;
typedef typename Container::iterator iterator;
typedef typename Container::size_type size_type;
{test_container_typedefs<Container> dummy; (void)dummy;}
const size_type num_elem = c.size();
BOOST_TEST( c.empty() == (num_elem == 0) );
{
@@ -56,7 +63,7 @@ void test_container( Container & c )
}
//Check iterator conversion
BOOST_TEST( const_iterator(c.begin()) == c.cbegin() );
BOOST_TEST(const_iterator(c.begin()) == c.cbegin() );
{
const_iterator it(c.cbegin()), itend(c.cend());
size_type i;
@@ -313,7 +320,6 @@ void test_associative_container_invariants(Container & c, Data & d)
template< class Container, class Data >
void test_associative_container(Container & c, Data & d)
{
typedef typename Container::const_iterator const_iterator;
assert( d.size() > 2 );
c.clear();