* include/bits/algorithmfwd.h: Change C++0x to C++11 in comments.
* include/bits/move.h: Likewise.
* include/bits/postypes.h: Likewise.
* include/debug/bitset: Likewise.
* include/ext/pb_ds/detail/type_utils.hpp: Likewise.
* include/ext/string_conversions.h: Change C++0x to __cxx11 in
comment.
* testsuite/27_io/fpos/14320-1.cc: Change C++0x to C++11 in comment.
* testsuite/util/thread/all.h: Likewise.
From-SVN: r238402
2016-07-15 Jonathan Wakely <jwakely@redhat.com>
+ * include/bits/algorithmfwd.h: Change C++0x to C++11 in comments.
+ * include/bits/move.h: Likewise.
+ * include/bits/postypes.h: Likewise.
+ * include/debug/bitset: Likewise.
+ * include/ext/pb_ds/detail/type_utils.hpp: Likewise.
+ * include/ext/string_conversions.h: Change C++0x to __cxx11 in
+ comment.
+ * testsuite/27_io/fpos/14320-1.cc: Change C++0x to C++11 in comment.
+ * testsuite/util/thread/all.h: Likewise.
+
* include/bits/stl_algo.h (for_each): Remove redundant _GLIBCXX_MOVE
and adjust comment.
/*
adjacent_find
- all_of (C++0x)
- any_of (C++0x)
+ all_of (C++11)
+ any_of (C++11)
binary_search
clamp (C++17)
copy
copy_backward
- copy_if (C++0x)
- copy_n (C++0x)
+ copy_if (C++11)
+ copy_n (C++11)
count
count_if
equal
find_end
find_first_of
find_if
- find_if_not (C++0x)
+ find_if_not (C++11)
for_each
generate
generate_n
includes
inplace_merge
- is_heap (C++0x)
- is_heap_until (C++0x)
- is_partitioned (C++0x)
- is_sorted (C++0x)
- is_sorted_until (C++0x)
+ is_heap (C++11)
+ is_heap_until (C++11)
+ is_partitioned (C++11)
+ is_sorted (C++11)
+ is_sorted_until (C++11)
iter_swap
lexicographical_compare
lower_bound
merge
min
min_element
- minmax (C++0x)
- minmax_element (C++0x)
+ minmax (C++11)
+ minmax_element (C++11)
mismatch
next_permutation
- none_of (C++0x)
+ none_of (C++11)
nth_element
partial_sort
partial_sort_copy
partition
- partition_copy (C++0x)
- partition_point (C++0x)
+ partition_copy (C++11)
+ partition_point (C++11)
pop_heap
prev_permutation
push_heap
set_intersection
set_symmetric_difference
set_union
- shuffle (C++0x)
+ shuffle (C++11)
sort
sort_heap
stable_partition
-// Move, forward and identity for C++0x + swap -*- C++ -*-
+// Move, forward and identity for C++11 + swap -*- C++ -*-
// Copyright (C) 2007-2016 Free Software Foundation, Inc.
//
// XXX If <stdint.h> is really needed, make sure to define the macros
// before including it, in order not to break <tr1/cstdint> (and <cstdint>
-// in C++0x). Reconsider all this as soon as possible...
+// in C++11). Reconsider all this as soon as possible...
#if (defined(_GLIBCXX_HAVE_INT64_T) && !defined(_GLIBCXX_HAVE_INT64_T_LONG) \
&& !defined(_GLIBCXX_HAVE_INT64_T_LONG_LONG))
typedef _GLIBCXX_STD_C::bitset<_Nb> _Base;
public:
- // In C++0x we rely on normal reference type to preserve the property
+ // In C++11 we rely on normal reference type to preserve the property
// of bitset to be use as a literal.
// TODO: Find another solution.
#if __cplusplus >= 201103L
};
};
- // Use C++0x's static_assert if possible.
+ // Use C++11's static_assert if possible.
#if __cplusplus >= 201103L
#define PB_DS_STATIC_ASSERT(UNIQUE, E) static_assert(E, #UNIQUE)
#else
__builtin_va_list), std::size_t __n,
const _CharT* __fmt, ...)
{
- // XXX Eventually the result will be constructed in place in
- // the C++0x string, likely with the help of internal hooks.
+ // XXX Eventually the result should be constructed in-place in
+ // the __cxx11 string, likely with the help of internal hooks.
_CharT* __s = static_cast<_CharT*>(__builtin_alloca(sizeof(_CharT)
* __n));
bool found = false;
// The C++ standard didn't originally have "long long", however that
- // type will be in the C++0x standard and testing for it allows
+ // type is in the C++11 standard and testing for it allows
// ilp32 targets to pass this test when `Distance' is 64 bits.
if (typeid(Distance) == typeid(long long int))
found = true;
#include <stdexcept>
#include <type_traits>
-// C++0x only.
+// C++11 only.
namespace __gnu_test
{
// Assume _Tp::native_handle_type.