forked from OSchip/llvm-project
Remove names of unreferenced parameters. Patch from STL@microsoft.com
llvm-svn: 267852
This commit is contained in:
parent
fbe85ae12e
commit
7626f778a5
|
@ -21,7 +21,7 @@
|
||||||
|
|
||||||
#include "counting_predicates.hpp"
|
#include "counting_predicates.hpp"
|
||||||
|
|
||||||
bool all_equal(int a, int b) { return false; } // everything is equal
|
bool all_equal(int, int) { return false; } // everything is equal
|
||||||
|
|
||||||
#ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS
|
#ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS
|
||||||
void test_all_equal(std::initializer_list<int> il)
|
void test_all_equal(std::initializer_list<int> il)
|
||||||
|
|
|
@ -37,7 +37,7 @@ test(Iterator first, Iterator last, const A& a)
|
||||||
template <class T>
|
template <class T>
|
||||||
struct implicit_conv_allocator : min_allocator<T>
|
struct implicit_conv_allocator : min_allocator<T>
|
||||||
{
|
{
|
||||||
implicit_conv_allocator(void* p) {}
|
implicit_conv_allocator(void*) {}
|
||||||
implicit_conv_allocator(const implicit_conv_allocator&) = default;
|
implicit_conv_allocator(const implicit_conv_allocator&) = default;
|
||||||
};
|
};
|
||||||
|
|
||||||
|
|
|
@ -18,7 +18,7 @@
|
||||||
|
|
||||||
int called = 0;
|
int called = 0;
|
||||||
|
|
||||||
void* my_alloc(std::size_t n)
|
void* my_alloc(std::size_t)
|
||||||
{
|
{
|
||||||
static char buf[10000];
|
static char buf[10000];
|
||||||
++called;
|
++called;
|
||||||
|
|
|
@ -26,7 +26,7 @@ class test1
|
||||||
public:
|
public:
|
||||||
constexpr test1() = default; // won't compile if error_category() is not constexpr
|
constexpr test1() = default; // won't compile if error_category() is not constexpr
|
||||||
virtual const char* name() const noexcept {return nullptr;}
|
virtual const char* name() const noexcept {return nullptr;}
|
||||||
virtual std::string message(int ev) const {return std::string();}
|
virtual std::string message(int) const {return std::string();}
|
||||||
};
|
};
|
||||||
|
|
||||||
#endif // _LIBCPP_STD_VER > 11
|
#endif // _LIBCPP_STD_VER > 11
|
||||||
|
|
|
@ -40,7 +40,7 @@ public:
|
||||||
CharT* egptr() const {return base::egptr();}
|
CharT* egptr() const {return base::egptr();}
|
||||||
protected:
|
protected:
|
||||||
typename base::pos_type seekoff(typename base::off_type off,
|
typename base::pos_type seekoff(typename base::off_type off,
|
||||||
std::ios_base::seekdir way,
|
std::ios_base::seekdir,
|
||||||
std::ios_base::openmode which)
|
std::ios_base::openmode which)
|
||||||
{
|
{
|
||||||
assert(which == std::ios_base::in);
|
assert(which == std::ios_base::in);
|
||||||
|
|
|
@ -25,7 +25,7 @@ struct test
|
||||||
test() {}
|
test() {}
|
||||||
|
|
||||||
protected:
|
protected:
|
||||||
std::streamsize xsgetn(char_type* s, std::streamsize n)
|
std::streamsize xsgetn(char_type*, std::streamsize)
|
||||||
{
|
{
|
||||||
++xsgetn_called;
|
++xsgetn_called;
|
||||||
return 10;
|
return 10;
|
||||||
|
|
|
@ -32,7 +32,7 @@ struct test
|
||||||
}
|
}
|
||||||
|
|
||||||
protected:
|
protected:
|
||||||
int_type pbackfail(int_type c = traits_type::eof())
|
int_type pbackfail(int_type = traits_type::eof())
|
||||||
{
|
{
|
||||||
++pbackfail_called;
|
++pbackfail_called;
|
||||||
return 'a';
|
return 'a';
|
||||||
|
|
|
@ -32,7 +32,7 @@ struct test
|
||||||
}
|
}
|
||||||
|
|
||||||
protected:
|
protected:
|
||||||
int_type pbackfail(int_type c = traits_type::eof())
|
int_type pbackfail(int_type = traits_type::eof())
|
||||||
{
|
{
|
||||||
++pbackfail_called;
|
++pbackfail_called;
|
||||||
return 'a';
|
return 'a';
|
||||||
|
|
|
@ -36,7 +36,7 @@ struct test
|
||||||
}
|
}
|
||||||
|
|
||||||
protected:
|
protected:
|
||||||
int_type overflow(int_type c = traits_type::eof())
|
int_type overflow(int_type = traits_type::eof())
|
||||||
{
|
{
|
||||||
++overflow_called;
|
++overflow_called;
|
||||||
return 'a';
|
return 'a';
|
||||||
|
|
|
@ -25,7 +25,7 @@ struct test
|
||||||
test() {}
|
test() {}
|
||||||
|
|
||||||
protected:
|
protected:
|
||||||
std::streamsize xsputn(const char_type* s, std::streamsize n)
|
std::streamsize xsputn(const char_type*, std::streamsize)
|
||||||
{
|
{
|
||||||
++xsputn_called;
|
++xsputn_called;
|
||||||
return 5;
|
return 5;
|
||||||
|
|
|
@ -23,7 +23,7 @@
|
||||||
struct Fun
|
struct Fun
|
||||||
{
|
{
|
||||||
template<typename T, typename U>
|
template<typename T, typename U>
|
||||||
void operator()(T && t, U && u) const
|
void operator()(T &&, U &&) const
|
||||||
{
|
{
|
||||||
static_assert(std::is_same<U, int &>::value, "");
|
static_assert(std::is_same<U, int &>::value, "");
|
||||||
}
|
}
|
||||||
|
|
|
@ -23,7 +23,7 @@
|
||||||
struct DummyUnaryFunction
|
struct DummyUnaryFunction
|
||||||
{
|
{
|
||||||
template <typename S>
|
template <typename S>
|
||||||
int operator()(S const & s) const { return 0; }
|
int operator()(S const &) const { return 0; }
|
||||||
};
|
};
|
||||||
|
|
||||||
struct BadUnaryFunction
|
struct BadUnaryFunction
|
||||||
|
@ -39,7 +39,7 @@ struct BadUnaryFunction
|
||||||
}
|
}
|
||||||
};
|
};
|
||||||
|
|
||||||
int main(int argc, char* argv[])
|
int main()
|
||||||
{
|
{
|
||||||
// Check that BadUnaryFunction::operator()(S const &) is not
|
// Check that BadUnaryFunction::operator()(S const &) is not
|
||||||
// instantiated when checking if BadUnaryFunction is a nested bind
|
// instantiated when checking if BadUnaryFunction is a nested bind
|
||||||
|
|
|
@ -19,7 +19,7 @@
|
||||||
#if _LIBCPP_STD_VER > 11
|
#if _LIBCPP_STD_VER > 11
|
||||||
|
|
||||||
template <typename AtContainer, typename T, T... I>
|
template <typename AtContainer, typename T, T... I>
|
||||||
auto extract ( const AtContainer &t, const std::integer_sequence<T, I...> idx )
|
auto extract ( const AtContainer &t, const std::integer_sequence<T, I...> )
|
||||||
-> decltype ( std::make_tuple ( std::get<I>(t)... ))
|
-> decltype ( std::make_tuple ( std::get<I>(t)... ))
|
||||||
{ return std::make_tuple ( std::get<I>(t)... ); }
|
{ return std::make_tuple ( std::get<I>(t)... ); }
|
||||||
|
|
||||||
|
|
|
@ -20,7 +20,7 @@
|
||||||
|
|
||||||
template <class Tuple>
|
template <class Tuple>
|
||||||
void
|
void
|
||||||
test0(const Tuple& t)
|
test0(const Tuple&)
|
||||||
{
|
{
|
||||||
static_assert(std::tuple_size<Tuple>::value == 0, "");
|
static_assert(std::tuple_size<Tuple>::value == 0, "");
|
||||||
}
|
}
|
||||||
|
@ -57,7 +57,7 @@ test2a(const Tuple& t)
|
||||||
#if _LIBCPP_STD_VER > 11
|
#if _LIBCPP_STD_VER > 11
|
||||||
template <class Tuple>
|
template <class Tuple>
|
||||||
constexpr int
|
constexpr int
|
||||||
test3(const Tuple& t)
|
test3(const Tuple&)
|
||||||
{
|
{
|
||||||
return std::tuple_size<Tuple>::value;
|
return std::tuple_size<Tuple>::value;
|
||||||
}
|
}
|
||||||
|
|
|
@ -101,7 +101,7 @@ public:
|
||||||
A2& operator=(const A2& a) TEST_NOEXCEPT { id_ = a.id(); copy_called = true; return *this;}
|
A2& operator=(const A2& a) TEST_NOEXCEPT { id_ = a.id(); copy_called = true; return *this;}
|
||||||
A2& operator=(A2&& a) TEST_NOEXCEPT { id_ = a.id(); move_called = true; return *this;}
|
A2& operator=(A2&& a) TEST_NOEXCEPT { id_ = a.id(); move_called = true; return *this;}
|
||||||
|
|
||||||
T* allocate(std::size_t n, const void* hint)
|
T* allocate(std::size_t, const void* hint)
|
||||||
{
|
{
|
||||||
allocate_called = true;
|
allocate_called = true;
|
||||||
return (T*)hint;
|
return (T*)hint;
|
||||||
|
|
|
@ -76,7 +76,7 @@ public:
|
||||||
++alloc_count;
|
++alloc_count;
|
||||||
return (pointer)::operator new(n * sizeof(T));
|
return (pointer)::operator new(n * sizeof(T));
|
||||||
}
|
}
|
||||||
void deallocate(pointer p, size_type n)
|
void deallocate(pointer p, size_type)
|
||||||
{assert(data_ >= 0); --alloc_count; ::operator delete((void*)p);}
|
{assert(data_ >= 0); --alloc_count; ::operator delete((void*)p);}
|
||||||
size_type max_size() const throw()
|
size_type max_size() const throw()
|
||||||
{return UINT_MAX / sizeof(T);}
|
{return UINT_MAX / sizeof(T);}
|
||||||
|
@ -136,7 +136,7 @@ public:
|
||||||
++alloc_count;
|
++alloc_count;
|
||||||
return (pointer)::operator new (n * sizeof(T));
|
return (pointer)::operator new (n * sizeof(T));
|
||||||
}
|
}
|
||||||
void deallocate(pointer p, size_type n)
|
void deallocate(pointer p, size_type)
|
||||||
{assert(data_ >= 0); --alloc_count; ::operator delete((void*)p); }
|
{assert(data_ >= 0); --alloc_count; ::operator delete((void*)p); }
|
||||||
size_type max_size() const throw()
|
size_type max_size() const throw()
|
||||||
{return UINT_MAX / sizeof(T);}
|
{return UINT_MAX / sizeof(T);}
|
||||||
|
@ -201,7 +201,7 @@ public:
|
||||||
: data_(a.data_) {}
|
: data_(a.data_) {}
|
||||||
T* allocate(std::size_t n)
|
T* allocate(std::size_t n)
|
||||||
{return (T*)::operator new(n * sizeof(T));}
|
{return (T*)::operator new(n * sizeof(T));}
|
||||||
void deallocate(T* p, std::size_t n)
|
void deallocate(T* p, std::size_t)
|
||||||
{::operator delete((void*)p);}
|
{::operator delete((void*)p);}
|
||||||
|
|
||||||
other_allocator select_on_container_copy_construction() const
|
other_allocator select_on_container_copy_construction() const
|
||||||
|
|
Loading…
Reference in New Issue