procyberian/gcc
2
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

* many: Replace uses of __GXX_EXPERIMENTAL_CXX0X__ with __cplusplus.

Browse source 
From-SVN: r193392
This commit is contained in:
Jason Merrill 2012-11-10 12:27:22 -05:00 • committed by Jason Merrill
parent 3467ad5ce6
commit 734f50238f
174 changed files with 846 additions and 843 deletions
Download patch file Download diff file Expand all files Collapse all files

4
libstdc++-v3/ChangeLog
View file

@ -1,3 +1,7 @@
2012-11-10 Jason Merrill <jason@redhat.com>
* many: Replace uses of __GXX_EXPERIMENTAL_CXX0X__ with __cplusplus.
2012-11-08 François Dumont <fdumont@gcc.gnu.org> 2012-11-08 François Dumont <fdumont@gcc.gnu.org>
PR libstdc++/54075 PR libstdc++/54075

2
libstdc++-v3/config/allocator/bitmap_allocator_base.h
View file

@ -32,7 +32,7 @@
#include <ext/bitmap_allocator.h> #include <ext/bitmap_allocator.h>
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
namespace std namespace std
{ {
/** /**

2
libstdc++-v3/config/allocator/malloc_allocator_base.h
View file

@ -32,7 +32,7 @@
#include <ext/malloc_allocator.h> #include <ext/malloc_allocator.h>
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
namespace std namespace std
{ {
/** /**

2
libstdc++-v3/config/allocator/mt_allocator_base.h
View file

@ -32,7 +32,7 @@
#include <ext/mt_allocator.h> #include <ext/mt_allocator.h>
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
namespace std namespace std
{ {
/** /**

2
libstdc++-v3/config/allocator/new_allocator_base.h
View file

@ -32,7 +32,7 @@
#include <ext/new_allocator.h> #include <ext/new_allocator.h>
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
namespace std namespace std
{ {
/** /**

2
libstdc++-v3/config/allocator/pool_allocator_base.h
View file

@ -32,7 +32,7 @@
#include <ext/pool_allocator.h> #include <ext/pool_allocator.h>
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
namespace std namespace std
{ {
/** /**

1
libstdc++-v3/doc/doxygen/user.cfg.in
View file

@ -1701,7 +1701,6 @@ INCLUDE_FILE_PATTERNS =
PREDEFINED = __cplusplus \ PREDEFINED = __cplusplus \
__GTHREADS \ __GTHREADS \
_GLIBCXX_HAS_GTHREADS \ _GLIBCXX_HAS_GTHREADS \
__GXX_EXPERIMENTAL_CXX0X__ \
_GLIBCXX_INCLUDE_AS_CXX0X \ _GLIBCXX_INCLUDE_AS_CXX0X \
"_GLIBCXX_PURE= " \ "_GLIBCXX_PURE= " \
"_GLIBCXX_CONST= " \ "_GLIBCXX_CONST= " \

2
libstdc++-v3/doc/html/manual/status.html
View file

@ -153,7 +153,7 @@ In this implementation <code class="literal">-std=gnu++11</code> or
and library and library
features. See <a class="link" href="using.html#manual.intro.using.flags" title="Command Options">dialect</a> features. See <a class="link" href="using.html#manual.intro.using.flags" title="Command Options">dialect</a>
options. The pre-defined symbol options. The pre-defined symbol
<code class="constant">__GXX_EXPERIMENTAL_CXX0X__</code> is used to check for the <code class="constant">__cplusplus</code> is used to check for the
presence of the required flag. presence of the required flag.
</p><p> </p><p>
This page describes the C++11 support in mainline GCC SVN, not in any This page describes the C++11 support in mainline GCC SVN, not in any

2
libstdc++-v3/doc/xml/manual/status_cxx2011.xml
View file

@ -26,7 +26,7 @@ In this implementation <literal>-std=gnu++11</literal> or
and library and library
features. See <link linkend="manual.intro.using.flags">dialect</link> features. See <link linkend="manual.intro.using.flags">dialect</link>
options. The pre-defined symbol options. The pre-defined symbol
<constant>__GXX_EXPERIMENTAL_CXX0X__</constant> is used to check for the <constant>__cplusplus</constant> is used to check for the
presence of the required flag. presence of the required flag.
</para> </para>

2
libstdc++-v3/include/backward/auto_ptr.h
View file

@ -289,7 +289,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
typedef void element_type; typedef void element_type;
} _GLIBCXX_DEPRECATED; } _GLIBCXX_DEPRECATED;
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<_Lock_policy _Lp> template<_Lock_policy _Lp>
template<typename _Tp> template<typename _Tp>
inline inline

24
libstdc++-v3/include/bits/algorithmfwd.h
View file

@ -35,7 +35,7 @@
#include <bits/c++config.h> #include <bits/c++config.h>
#include <bits/stl_pair.h> #include <bits/stl_pair.h>
#include <bits/stl_iterator_base_types.h> #include <bits/stl_iterator_base_types.h>
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
#include <initializer_list> #include <initializer_list>
#endif #endif
@ -190,7 +190,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
// adjacent_find // adjacent_find
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _IIter, typename _Predicate> template<typename _IIter, typename _Predicate>
bool bool
all_of(_IIter, _IIter, _Predicate); all_of(_IIter, _IIter, _Predicate);
@ -216,7 +216,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
_BIter2 _BIter2
copy_backward(_BIter1, _BIter1, _BIter2); copy_backward(_BIter1, _BIter1, _BIter2);
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _IIter, typename _OIter, typename _Predicate> template<typename _IIter, typename _OIter, typename _Predicate>
_OIter _OIter
copy_if(_IIter, _IIter, _OIter, _Predicate); copy_if(_IIter, _IIter, _OIter, _Predicate);
@ -258,7 +258,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
// find_first_of // find_first_of
// find_if // find_if
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _IIter, typename _Predicate> template<typename _IIter, typename _Predicate>
_IIter _IIter
find_if_not(_IIter, _IIter, _Predicate); find_if_not(_IIter, _IIter, _Predicate);
@ -284,7 +284,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
void void
inplace_merge(_BIter, _BIter, _BIter, _Compare); inplace_merge(_BIter, _BIter, _BIter, _Compare);
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _RAIter> template<typename _RAIter>
bool bool
is_heap(_RAIter, _RAIter); is_heap(_RAIter, _RAIter);
@ -372,7 +372,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
// min_element // min_element
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _Tp> template<typename _Tp>
pair<const _Tp&, const _Tp&> pair<const _Tp&, const _Tp&>
minmax(const _Tp&, const _Tp&); minmax(const _Tp&, const _Tp&);
@ -424,7 +424,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
bool bool
next_permutation(_BIter, _BIter, _Compare); next_permutation(_BIter, _BIter, _Compare);
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _IIter, typename _Predicate> template<typename _IIter, typename _Predicate>
bool bool
none_of(_IIter, _IIter, _Predicate); none_of(_IIter, _IIter, _Predicate);
@ -443,7 +443,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
// partition // partition
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _IIter, typename _OIter1, template<typename _IIter, typename _OIter1,
typename _OIter2, typename _Predicate> typename _OIter2, typename _Predicate>
pair<_OIter1, _OIter2> pair<_OIter1, _OIter2>
@ -531,7 +531,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
// set_symmetric_difference // set_symmetric_difference
// set_union // set_union
#if defined(__GXX_EXPERIMENTAL_CXX0X__) && defined(_GLIBCXX_USE_C99_STDINT_TR1) #if (__cplusplus >= 201103L) && defined(_GLIBCXX_USE_C99_STDINT_TR1)
template<typename _RAIter, typename _UGenerator> template<typename _RAIter, typename _UGenerator>
void void
shuffle(_RAIter, _RAIter, _UGenerator&&); shuffle(_RAIter, _RAIter, _UGenerator&&);
@ -552,7 +552,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
template<typename _Tp> template<typename _Tp>
void void
swap(_Tp&, _Tp&) swap(_Tp&, _Tp&)
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
noexcept(__and_<is_nothrow_move_constructible<_Tp>, noexcept(__and_<is_nothrow_move_constructible<_Tp>,
is_nothrow_move_assignable<_Tp>>::value) is_nothrow_move_assignable<_Tp>>::value)
#endif #endif
@ -561,7 +561,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
template<typename _Tp, size_t _Nm> template<typename _Tp, size_t _Nm>
void void
swap(_Tp (&__a)[_Nm], _Tp (&__b)[_Nm]) swap(_Tp (&__a)[_Nm], _Tp (&__b)[_Nm])
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
noexcept(noexcept(swap(*__a, *__b))) noexcept(noexcept(swap(*__a, *__b)))
#endif #endif
; ;
@ -714,7 +714,7 @@ _GLIBCXX_BEGIN_NAMESPACE_ALGO
template<typename _RAIter, typename _Generator> template<typename _RAIter, typename _Generator>
void void
random_shuffle(_RAIter, _RAIter, random_shuffle(_RAIter, _RAIter,
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
_Generator&&); _Generator&&);
#else #else
_Generator&); _Generator&);

2
libstdc++-v3/include/bits/alloc_traits.h
View file

@ -30,7 +30,7 @@
#ifndef _ALLOC_TRAITS_H #ifndef _ALLOC_TRAITS_H
#define _ALLOC_TRAITS_H 1 #define _ALLOC_TRAITS_H 1
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
#include <bits/ptr_traits.h> #include <bits/ptr_traits.h>
#include <ext/numeric_traits.h> #include <ext/numeric_traits.h>

2
libstdc++-v3/include/bits/allocator.h
View file

@ -188,7 +188,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
{ return __one != __two; } { return __one != __two; }
}; };
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _Tp, bool template<typename _Tp, bool
= __or_<is_copy_constructible<typename _Tp::value_type>, = __or_<is_copy_constructible<typename _Tp::value_type>,
is_nothrow_move_constructible<typename _Tp::value_type>>::value> is_nothrow_move_constructible<typename _Tp::value_type>>::value>

54
libstdc++-v3/include/bits/basic_string.h
View file

@ -40,7 +40,7 @@
#include <ext/atomicity.h> #include <ext/atomicity.h>
#include <debug/debug.h> #include <debug/debug.h>
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
#include <initializer_list> #include <initializer_list>
#endif #endif
@ -498,7 +498,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
*/ */
basic_string(size_type __n, _CharT __c, const _Alloc& __a = _Alloc()); basic_string(size_type __n, _CharT __c, const _Alloc& __a = _Alloc());
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* @brief Move construct string. * @brief Move construct string.
* @param __str Source string. * @param __str Source string.
@ -522,7 +522,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
* @param __a Allocator to use (default is default allocator). * @param __a Allocator to use (default is default allocator).
*/ */
basic_string(initializer_list<_CharT> __l, const _Alloc& __a = _Alloc()); basic_string(initializer_list<_CharT> __l, const _Alloc& __a = _Alloc());
#endif // __GXX_EXPERIMENTAL_CXX0X__ #endif // C++11
/** /**
* @brief Construct string as copy of a range. * @brief Construct string as copy of a range.
@ -570,7 +570,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
return *this; return *this;
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* @brief Move assign the value of @a str to this string. * @brief Move assign the value of @a str to this string.
* @param __str Source string. * @param __str Source string.
@ -596,7 +596,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
this->assign(__l.begin(), __l.size()); this->assign(__l.begin(), __l.size());
return *this; return *this;
} }
#endif // __GXX_EXPERIMENTAL_CXX0X__ #endif // C++11
// Iterators: // Iterators:
/** /**
@ -673,7 +673,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
rend() const _GLIBCXX_NOEXCEPT rend() const _GLIBCXX_NOEXCEPT
{ return const_reverse_iterator(this->begin()); } { return const_reverse_iterator(this->begin()); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* Returns a read-only (constant) iterator that points to the first * Returns a read-only (constant) iterator that points to the first
* character in the %string. * character in the %string.
@ -755,7 +755,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
resize(size_type __n) resize(size_type __n)
{ this->resize(__n, _CharT()); } { this->resize(__n, _CharT()); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/// A non-binding request to reduce capacity() to size(). /// A non-binding request to reduce capacity() to size().
void void
shrink_to_fit() shrink_to_fit()
@ -890,7 +890,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
return _M_data()[__n]; return _M_data()[__n];
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* Returns a read/write reference to the data at the first * Returns a read/write reference to the data at the first
* element of the %string. * element of the %string.
@ -955,7 +955,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
return *this; return *this;
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* @brief Append an initializer_list of characters. * @brief Append an initializer_list of characters.
* @param __l The initializer_list of characters to be appended. * @param __l The initializer_list of characters to be appended.
@ -964,7 +964,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
basic_string& basic_string&
operator+=(initializer_list<_CharT> __l) operator+=(initializer_list<_CharT> __l)
{ return this->append(__l.begin(), __l.size()); } { return this->append(__l.begin(), __l.size()); }
#endif // __GXX_EXPERIMENTAL_CXX0X__ #endif // C++11
/** /**
* @brief Append a string to this string. * @brief Append a string to this string.
@ -1022,7 +1022,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
basic_string& basic_string&
append(size_type __n, _CharT __c); append(size_type __n, _CharT __c);
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* @brief Append an initializer_list of characters. * @brief Append an initializer_list of characters.
* @param __l The initializer_list of characters to append. * @param __l The initializer_list of characters to append.
@ -1031,7 +1031,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
basic_string& basic_string&
append(initializer_list<_CharT> __l) append(initializer_list<_CharT> __l)
{ return this->append(__l.begin(), __l.size()); } { return this->append(__l.begin(), __l.size()); }
#endif // __GXX_EXPERIMENTAL_CXX0X__ #endif // C++11
/** /**
* @brief Append a range of characters. * @brief Append a range of characters.
@ -1068,7 +1068,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
basic_string& basic_string&
assign(const basic_string& __str); assign(const basic_string& __str);
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* @brief Set value to contents of another string. * @brief Set value to contents of another string.
* @param __str Source string to use. * @param __str Source string to use.
@ -1083,7 +1083,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
this->swap(__str); this->swap(__str);
return *this; return *this;
} }
#endif // __GXX_EXPERIMENTAL_CXX0X__ #endif // C++11
/** /**
* @brief Set value to a substring of a string. * @brief Set value to a substring of a string.
@ -1159,7 +1159,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
assign(_InputIterator __first, _InputIterator __last) assign(_InputIterator __first, _InputIterator __last)
{ return this->replace(_M_ibegin(), _M_iend(), __first, __last); } { return this->replace(_M_ibegin(), _M_iend(), __first, __last); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* @brief Set value to an initializer_list of characters. * @brief Set value to an initializer_list of characters.
* @param __l The initializer_list of characters to assign. * @param __l The initializer_list of characters to assign.
@ -1168,7 +1168,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
basic_string& basic_string&
assign(initializer_list<_CharT> __l) assign(initializer_list<_CharT> __l)
{ return this->assign(__l.begin(), __l.size()); } { return this->assign(__l.begin(), __l.size()); }
#endif // __GXX_EXPERIMENTAL_CXX0X__ #endif // C++11
/** /**
* @brief Insert multiple characters. * @brief Insert multiple characters.
@ -1204,7 +1204,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
insert(iterator __p, _InputIterator __beg, _InputIterator __end) insert(iterator __p, _InputIterator __beg, _InputIterator __end)
{ this->replace(__p, __p, __beg, __end); } { this->replace(__p, __p, __beg, __end); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* @brief Insert an initializer_list of characters. * @brief Insert an initializer_list of characters.
* @param __p Iterator referencing location in string to insert at. * @param __p Iterator referencing location in string to insert at.
@ -1217,7 +1217,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
_GLIBCXX_DEBUG_PEDASSERT(__p >= _M_ibegin() && __p <= _M_iend()); _GLIBCXX_DEBUG_PEDASSERT(__p >= _M_ibegin() && __p <= _M_iend());
this->insert(__p - _M_ibegin(), __l.begin(), __l.size()); this->insert(__p - _M_ibegin(), __l.begin(), __l.size());
} }
#endif // __GXX_EXPERIMENTAL_CXX0X__ #endif // C++11
/** /**
* @brief Insert value of a string. * @brief Insert value of a string.
@ -1399,7 +1399,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
iterator iterator
erase(iterator __first, iterator __last); erase(iterator __first, iterator __last);
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* @brief Remove the last character. * @brief Remove the last character.
* *
@ -1408,7 +1408,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
void void
pop_back() pop_back()
{ erase(size()-1, 1); } { erase(size()-1, 1); }
#endif // __GXX_EXPERIMENTAL_CXX0X__ #endif // C++11
/** /**
* @brief Replace characters with value from another string. * @brief Replace characters with value from another string.
@ -1676,7 +1676,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
__k1.base(), __k2 - __k1); __k1.base(), __k2 - __k1);
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* @brief Replace range of characters with initializer_list. * @brief Replace range of characters with initializer_list.
* @param __i1 Iterator referencing start of range to replace. * @param __i1 Iterator referencing start of range to replace.
@ -1694,7 +1694,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
basic_string& replace(iterator __i1, iterator __i2, basic_string& replace(iterator __i1, iterator __i2,
initializer_list<_CharT> __l) initializer_list<_CharT> __l)
{ return this->replace(__i1, __i2, __l.begin(), __l.end()); } { return this->replace(__i1, __i2, __l.begin(), __l.end()); }
#endif // __GXX_EXPERIMENTAL_CXX0X__ #endif // C++11
private: private:
template<class _Integer> template<class _Integer>
@ -2426,7 +2426,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
return __str; return __str;
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _CharT, typename _Traits, typename _Alloc> template<typename _CharT, typename _Traits, typename _Alloc>
inline basic_string<_CharT, _Traits, _Alloc> inline basic_string<_CharT, _Traits, _Alloc>
operator+(basic_string<_CharT, _Traits, _Alloc>&& __lhs, operator+(basic_string<_CharT, _Traits, _Alloc>&& __lhs,
@ -2813,7 +2813,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
_GLIBCXX_END_NAMESPACE_VERSION _GLIBCXX_END_NAMESPACE_VERSION
} // namespace } // namespace
#if (defined(__GXX_EXPERIMENTAL_CXX0X__) && defined(_GLIBCXX_USE_C99) \ #if ((__cplusplus >= 201103L) && defined(_GLIBCXX_USE_C99) \
&& !defined(_GLIBCXX_HAVE_BROKEN_VSWPRINTF)) && !defined(_GLIBCXX_HAVE_BROKEN_VSWPRINTF))
#include <ext/string_conversions.h> #include <ext/string_conversions.h>
@ -3030,9 +3030,9 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
_GLIBCXX_END_NAMESPACE_VERSION _GLIBCXX_END_NAMESPACE_VERSION
} // namespace } // namespace
#endif /* __GXX_EXPERIMENTAL_CXX0X__ && _GLIBCXX_USE_C99 ... */ #endif /* C++11 && _GLIBCXX_USE_C99 ... */
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
#include <bits/functional_hash.h> #include <bits/functional_hash.h>
@ -3094,6 +3094,6 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
_GLIBCXX_END_NAMESPACE_VERSION _GLIBCXX_END_NAMESPACE_VERSION
} // namespace } // namespace
#endif /* __GXX_EXPERIMENTAL_CXX0X__ */ #endif // C++11
#endif /* _BASIC_STRING_H */ #endif /* _BASIC_STRING_H */

2
libstdc++-v3/include/bits/basic_string.tcc
View file

@ -231,7 +231,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
: _M_dataplus(_S_construct(__beg, __end, __a), __a) : _M_dataplus(_S_construct(__beg, __end, __a), __a)
{ } { }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _CharT, typename _Traits, typename _Alloc> template<typename _CharT, typename _Traits, typename _Alloc>
basic_string<_CharT, _Traits, _Alloc>:: basic_string<_CharT, _Traits, _Alloc>::
basic_string(initializer_list<_CharT> __l, const _Alloc& __a) basic_string(initializer_list<_CharT> __l, const _Alloc& __a)

2
libstdc++-v3/include/bits/c++0x_warning.h
View file

@ -28,7 +28,7 @@
#ifndef _CXX0X_WARNING_H #ifndef _CXX0X_WARNING_H
#define _CXX0X_WARNING_H 1 #define _CXX0X_WARNING_H 1
#ifndef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus < 201103L
#error This file requires compiler and library support for the \ #error This file requires compiler and library support for the \
ISO C++ 2011 standard. This support is currently experimental, and must be \ ISO C++ 2011 standard. This support is currently experimental, and must be \
enabled with the -std=c++11 or -std=gnu++11 compiler options. enabled with the -std=c++11 or -std=gnu++11 compiler options.

8
libstdc++-v3/include/bits/c++config
View file

@ -78,7 +78,7 @@
# define _GLIBCXX_USE_DEPRECATED 1 # define _GLIBCXX_USE_DEPRECATED 1
#endif #endif
#if defined(__DEPRECATED) && defined(__GXX_EXPERIMENTAL_CXX0X__) #if defined(__DEPRECATED) && (__cplusplus >= 201103L)
# define _GLIBCXX_DEPRECATED __attribute__ ((__deprecated__)) # define _GLIBCXX_DEPRECATED __attribute__ ((__deprecated__))
#else #else
# define _GLIBCXX_DEPRECATED # define _GLIBCXX_DEPRECATED
@ -88,7 +88,7 @@
// Macro for constexpr, to support in mixed 03/0x mode. // Macro for constexpr, to support in mixed 03/0x mode.
#ifndef _GLIBCXX_CONSTEXPR #ifndef _GLIBCXX_CONSTEXPR
# ifdef __GXX_EXPERIMENTAL_CXX0X__ # if __cplusplus >= 201103L
# define _GLIBCXX_CONSTEXPR constexpr # define _GLIBCXX_CONSTEXPR constexpr
# define _GLIBCXX_USE_CONSTEXPR constexpr # define _GLIBCXX_USE_CONSTEXPR constexpr
# else # else
@ -99,7 +99,7 @@
// Macro for noexcept, to support in mixed 03/0x mode. // Macro for noexcept, to support in mixed 03/0x mode.
#ifndef _GLIBCXX_NOEXCEPT #ifndef _GLIBCXX_NOEXCEPT
# ifdef __GXX_EXPERIMENTAL_CXX0X__ # if __cplusplus >= 201103L
# define _GLIBCXX_NOEXCEPT noexcept # define _GLIBCXX_NOEXCEPT noexcept
# define _GLIBCXX_USE_NOEXCEPT noexcept # define _GLIBCXX_USE_NOEXCEPT noexcept
# define _GLIBCXX_THROW(_EXC) # define _GLIBCXX_THROW(_EXC)
@ -180,7 +180,7 @@ namespace std
typedef __SIZE_TYPE__ size_t; typedef __SIZE_TYPE__ size_t;
typedef __PTRDIFF_TYPE__ ptrdiff_t; typedef __PTRDIFF_TYPE__ ptrdiff_t;
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
typedef decltype(nullptr) nullptr_t; typedef decltype(nullptr) nullptr_t;
#endif #endif
} }

2
libstdc++-v3/include/bits/char_traits.h
View file

@ -372,7 +372,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
_GLIBCXX_END_NAMESPACE_VERSION _GLIBCXX_END_NAMESPACE_VERSION
} // namespace } // namespace
#if (defined(__GXX_EXPERIMENTAL_CXX0X__) \ #if ((__cplusplus >= 201103L) \
&& defined(_GLIBCXX_USE_C99_STDINT_TR1)) && defined(_GLIBCXX_USE_C99_STDINT_TR1))
#include <cstdint> #include <cstdint>

4
libstdc++-v3/include/bits/cpp_type_traits.h
View file

@ -180,7 +180,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
}; };
# endif # endif
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<> template<>
struct __is_integer<char16_t> struct __is_integer<char16_t>
{ {
@ -407,7 +407,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
typedef __false_type __type; typedef __false_type __type;
}; };
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _Iterator> template<typename _Iterator>
class move_iterator; class move_iterator;

20
libstdc++-v3/include/bits/deque.tcc
View file

@ -62,7 +62,7 @@ namespace std _GLIBCXX_VISIBILITY(default)
{ {
_GLIBCXX_BEGIN_NAMESPACE_CONTAINER _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template <typename _Tp, typename _Alloc> template <typename _Tp, typename _Alloc>
void void
deque<_Tp, _Alloc>:: deque<_Tp, _Alloc>::
@ -110,7 +110,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
return *this; return *this;
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _Tp, typename _Alloc> template<typename _Tp, typename _Alloc>
template<typename... _Args> template<typename... _Args>
void void
@ -166,7 +166,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
return _M_insert_aux(__position, __x); return _M_insert_aux(__position, __x);
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _Tp, typename _Alloc> template<typename _Tp, typename _Alloc>
template<typename... _Args> template<typename... _Args>
typename deque<_Tp, _Alloc>::iterator typename deque<_Tp, _Alloc>::iterator
@ -303,7 +303,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
_M_insert_aux(__pos, __n, __x); _M_insert_aux(__pos, __n, __x);
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template <typename _Tp, typename _Alloc> template <typename _Tp, typename _Alloc>
void void
deque<_Tp, _Alloc>:: deque<_Tp, _Alloc>::
@ -430,7 +430,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
// Called only if _M_impl._M_finish._M_cur == _M_impl._M_finish._M_last - 1. // Called only if _M_impl._M_finish._M_cur == _M_impl._M_finish._M_last - 1.
template<typename _Tp, typename _Alloc> template<typename _Tp, typename _Alloc>
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename... _Args> template<typename... _Args>
void void
deque<_Tp, _Alloc>:: deque<_Tp, _Alloc>::
@ -445,7 +445,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
*(this->_M_impl._M_finish._M_node + 1) = this->_M_allocate_node(); *(this->_M_impl._M_finish._M_node + 1) = this->_M_allocate_node();
__try __try
{ {
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
this->_M_impl.construct(this->_M_impl._M_finish._M_cur, this->_M_impl.construct(this->_M_impl._M_finish._M_cur,
std::forward<_Args>(__args)...); std::forward<_Args>(__args)...);
#else #else
@ -464,7 +464,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
// Called only if _M_impl._M_start._M_cur == _M_impl._M_start._M_first. // Called only if _M_impl._M_start._M_cur == _M_impl._M_start._M_first.
template<typename _Tp, typename _Alloc> template<typename _Tp, typename _Alloc>
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename... _Args> template<typename... _Args>
void void
deque<_Tp, _Alloc>:: deque<_Tp, _Alloc>::
@ -482,7 +482,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
this->_M_impl._M_start._M_set_node(this->_M_impl._M_start._M_node this->_M_impl._M_start._M_set_node(this->_M_impl._M_start._M_node
- 1); - 1);
this->_M_impl._M_start._M_cur = this->_M_impl._M_start._M_last - 1; this->_M_impl._M_start._M_cur = this->_M_impl._M_start._M_last - 1;
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
this->_M_impl.construct(this->_M_impl._M_start._M_cur, this->_M_impl.construct(this->_M_impl._M_start._M_cur,
std::forward<_Args>(__args)...); std::forward<_Args>(__args)...);
#else #else
@ -579,7 +579,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
} }
template<typename _Tp, typename _Alloc> template<typename _Tp, typename _Alloc>
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename... _Args> template<typename... _Args>
typename deque<_Tp, _Alloc>::iterator typename deque<_Tp, _Alloc>::iterator
deque<_Tp, _Alloc>:: deque<_Tp, _Alloc>::
@ -996,7 +996,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
return __result; return __result;
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _Tp> template<typename _Tp>
_Deque_iterator<_Tp, _Tp&, _Tp*> _Deque_iterator<_Tp, _Tp&, _Tp*>
move(_Deque_iterator<_Tp, const _Tp&, const _Tp*> __first, move(_Deque_iterator<_Tp, const _Tp&, const _Tp*> __first,

2
libstdc++-v3/include/bits/forward_list.h
View file

@ -33,7 +33,7 @@
#pragma GCC system_header #pragma GCC system_header
#include <memory> #include <memory>
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
#include <initializer_list> #include <initializer_list>
#endif #endif

10
libstdc++-v3/include/bits/list.tcc
View file

@ -72,7 +72,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
{ {
_Node* __tmp = __cur; _Node* __tmp = __cur;
__cur = static_cast<_Node*>(__cur->_M_next); __cur = static_cast<_Node*>(__cur->_M_next);
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
_M_get_Node_allocator().destroy(__tmp); _M_get_Node_allocator().destroy(__tmp);
#else #else
_M_get_Tp_allocator().destroy(std::__addressof(__tmp->_M_data)); _M_get_Tp_allocator().destroy(std::__addressof(__tmp->_M_data));
@ -81,7 +81,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
} }
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _Tp, typename _Alloc> template<typename _Tp, typename _Alloc>
template<typename... _Args> template<typename... _Args>
typename list<_Tp, _Alloc>::iterator typename list<_Tp, _Alloc>::iterator
@ -114,7 +114,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
return __ret; return __ret;
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _Tp, typename _Alloc> template<typename _Tp, typename _Alloc>
void void
list<_Tp, _Alloc>:: list<_Tp, _Alloc>::
@ -285,7 +285,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
template<typename _Tp, typename _Alloc> template<typename _Tp, typename _Alloc>
void void
list<_Tp, _Alloc>:: list<_Tp, _Alloc>::
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
merge(list&& __x) merge(list&& __x)
#else #else
merge(list& __x) merge(list& __x)
@ -319,7 +319,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
template <typename _StrictWeakOrdering> template <typename _StrictWeakOrdering>
void void
list<_Tp, _Alloc>:: list<_Tp, _Alloc>::
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
merge(list&& __x, _StrictWeakOrdering __comp) merge(list&& __x, _StrictWeakOrdering __comp)
#else #else
merge(list& __x, _StrictWeakOrdering __comp) merge(list& __x, _StrictWeakOrdering __comp)

6
libstdc++-v3/include/bits/move.h
View file

@ -53,7 +53,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
_GLIBCXX_END_NAMESPACE_VERSION _GLIBCXX_END_NAMESPACE_VERSION
} // namespace } // namespace
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
#include <type_traits> // Brings in std::declval too. #include <type_traits> // Brings in std::declval too.
namespace std _GLIBCXX_VISIBILITY(default) namespace std _GLIBCXX_VISIBILITY(default)
@ -164,7 +164,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
template<typename _Tp> template<typename _Tp>
inline void inline void
swap(_Tp& __a, _Tp& __b) swap(_Tp& __a, _Tp& __b)
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
noexcept(__and_<is_nothrow_move_constructible<_Tp>, noexcept(__and_<is_nothrow_move_constructible<_Tp>,
is_nothrow_move_assignable<_Tp>>::value) is_nothrow_move_assignable<_Tp>>::value)
#endif #endif
@ -183,7 +183,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
template<typename _Tp, size_t _Nm> template<typename _Tp, size_t _Nm>
inline void inline void
swap(_Tp (&__a)[_Nm], _Tp (&__b)[_Nm]) swap(_Tp (&__a)[_Nm], _Tp (&__b)[_Nm])
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
noexcept(noexcept(swap(*__a, *__b))) noexcept(noexcept(swap(*__a, *__b)))
#endif #endif
{ {

2
libstdc++-v3/include/bits/postypes.h
View file

@ -231,7 +231,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
/// File position for wchar_t streams. /// File position for wchar_t streams.
typedef fpos<mbstate_t> wstreampos; typedef fpos<mbstate_t> wstreampos;
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/// File position for char16_t streams. /// File position for char16_t streams.
typedef fpos<mbstate_t> u16streampos; typedef fpos<mbstate_t> u16streampos;
/// File position for char32_t streams. /// File position for char32_t streams.

2
libstdc++-v3/include/bits/ptr_traits.h
View file

@ -30,7 +30,7 @@
#ifndef _PTR_TRAITS_H #ifndef _PTR_TRAITS_H
#define _PTR_TRAITS_H 1 #define _PTR_TRAITS_H 1
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
#include <type_traits> // For _GLIBCXX_HAS_NESTED_TYPE #include <type_traits> // For _GLIBCXX_HAS_NESTED_TYPE

4
libstdc++-v3/include/bits/range_access.h
View file

@ -32,7 +32,7 @@
#pragma GCC system_header #pragma GCC system_header
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
namespace std _GLIBCXX_VISIBILITY(default) namespace std _GLIBCXX_VISIBILITY(default)
{ {
@ -100,6 +100,6 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
_GLIBCXX_END_NAMESPACE_VERSION _GLIBCXX_END_NAMESPACE_VERSION
} // namespace } // namespace
#endif // __GXX_EXPERIMENTAL_CXX0X__ #endif // C++11
#endif // _GLIBCXX_RANGE_ACCESS_H #endif // _GLIBCXX_RANGE_ACCESS_H

12
libstdc++-v3/include/bits/stl_algo.h
View file

@ -63,7 +63,7 @@
#include <bits/stl_heap.h> #include <bits/stl_heap.h>
#include <bits/stl_tempbuf.h> // for _Temporary_buffer #include <bits/stl_tempbuf.h> // for _Temporary_buffer
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
#include <random> // for std::uniform_int_distribution #include <random> // for std::uniform_int_distribution
#include <functional> // for std::bind #include <functional> // for std::bind
#endif #endif
@ -737,7 +737,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
__comp); __comp);
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* @brief Checks that a predicate is true for all the elements * @brief Checks that a predicate is true for all the elements
* of a sequence. * of a sequence.
@ -954,7 +954,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
return __result; return __result;
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* @brief Copy the elements of a sequence for which a predicate is true. * @brief Copy the elements of a sequence for which a predicate is true.
* @ingroup mutating_algorithms * @ingroup mutating_algorithms
@ -3964,7 +3964,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
return __result; return __result;
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* @brief Determines whether the elements of a sequence are sorted. * @brief Determines whether the elements of a sequence are sorted.
* @ingroup sorting_algorithms * @ingroup sorting_algorithms
@ -4413,7 +4413,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
} }
#endif #endif
#endif // __GXX_EXPERIMENTAL_CXX0X__ #endif // C++11
_GLIBCXX_END_NAMESPACE_VERSION _GLIBCXX_END_NAMESPACE_VERSION
@ -5238,7 +5238,7 @@ _GLIBCXX_BEGIN_NAMESPACE_ALGO
template<typename _RandomAccessIterator, typename _RandomNumberGenerator> template<typename _RandomAccessIterator, typename _RandomNumberGenerator>
void void
random_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, random_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last,
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
_RandomNumberGenerator&& __rand) _RandomNumberGenerator&& __rand)
#else #else
_RandomNumberGenerator& __rand) _RandomNumberGenerator& __rand)

16
libstdc++-v3/include/bits/stl_algobase.h
View file

@ -74,7 +74,7 @@ namespace std _GLIBCXX_VISIBILITY(default)
{ {
_GLIBCXX_BEGIN_NAMESPACE_VERSION _GLIBCXX_BEGIN_NAMESPACE_VERSION
#ifndef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus < 201103L
// See http://gcc.gnu.org/ml/libstdc++/2004-08/msg00167.html: in a // See http://gcc.gnu.org/ml/libstdc++/2004-08/msg00167.html: in a
// nutshell, we are partially implementing the resolution of DR 187, // nutshell, we are partially implementing the resolution of DR 187,
// when it's safe, i.e., the value_types are equal. // when it's safe, i.e., the value_types are equal.
@ -125,7 +125,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
__glibcxx_function_requires(_Mutable_ForwardIteratorConcept< __glibcxx_function_requires(_Mutable_ForwardIteratorConcept<
_ForwardIterator2>) _ForwardIterator2>)
#ifndef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus < 201103L
typedef typename iterator_traits<_ForwardIterator1>::value_type typedef typename iterator_traits<_ForwardIterator1>::value_type
_ValueType1; _ValueType1;
typedef typename iterator_traits<_ForwardIterator2>::value_type typedef typename iterator_traits<_ForwardIterator2>::value_type
@ -308,7 +308,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
} }
}; };
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _Category> template<typename _Category>
struct __copy_move<true, false, _Category> struct __copy_move<true, false, _Category>
{ {
@ -341,7 +341,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
} }
}; };
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<> template<>
struct __copy_move<true, false, random_access_iterator_tag> struct __copy_move<true, false, random_access_iterator_tag>
{ {
@ -461,7 +461,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
__result)); __result));
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* @brief Moves the range [first,last) into result. * @brief Moves the range [first,last) into result.
* @ingroup mutating_algorithms * @ingroup mutating_algorithms
@ -511,7 +511,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
} }
}; };
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _Category> template<typename _Category>
struct __copy_move_backward<true, false, _Category> struct __copy_move_backward<true, false, _Category>
{ {
@ -540,7 +540,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
} }
}; };
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<> template<>
struct __copy_move_backward<true, false, random_access_iterator_tag> struct __copy_move_backward<true, false, random_access_iterator_tag>
{ {
@ -632,7 +632,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
__result)); __result));
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* @brief Moves the range [first,last) into result. * @brief Moves the range [first,last) into result.
* @ingroup mutating_algorithms * @ingroup mutating_algorithms

36
libstdc++-v3/include/bits/stl_bvector.h
View file

@ -57,7 +57,7 @@
#ifndef _STL_BVECTOR_H #ifndef _STL_BVECTOR_H
#define _STL_BVECTOR_H 1 #define _STL_BVECTOR_H 1
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
#include <initializer_list> #include <initializer_list>
#endif #endif
@ -108,7 +108,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
{ *_M_p ^= _M_mask; } { *_M_p ^= _M_mask; }
}; };
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
inline void inline void
swap(_Bit_reference __x, _Bit_reference __y) noexcept swap(_Bit_reference __x, _Bit_reference __y) noexcept
{ {
@ -421,7 +421,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
: _Bit_alloc_type(__a), _M_start(), _M_finish(), _M_end_of_storage(0) : _Bit_alloc_type(__a), _M_start(), _M_finish(), _M_end_of_storage(0)
{ } { }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
_Bvector_impl(_Bit_alloc_type&& __a) _Bvector_impl(_Bit_alloc_type&& __a)
: _Bit_alloc_type(std::move(__a)), _M_start(), _M_finish(), : _Bit_alloc_type(std::move(__a)), _M_start(), _M_finish(),
_M_end_of_storage(0) _M_end_of_storage(0)
@ -450,7 +450,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
_Bvector_base(const allocator_type& __a) _Bvector_base(const allocator_type& __a)
: _M_impl(__a) { } : _M_impl(__a) { }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
_Bvector_base(_Bvector_base&& __x) noexcept _Bvector_base(_Bvector_base&& __x) noexcept
: _M_impl(std::move(__x._M_get_Bit_allocator())) : _M_impl(std::move(__x._M_get_Bit_allocator()))
{ {
@ -520,7 +520,7 @@ template<typename _Alloc>
{ {
typedef _Bvector_base<_Alloc> _Base; typedef _Bvector_base<_Alloc> _Base;
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename> friend class hash; template<typename> friend class hash;
#endif #endif
@ -555,7 +555,7 @@ template<typename _Alloc>
vector(const allocator_type& __a) vector(const allocator_type& __a)
: _Base(__a) { } : _Base(__a) { }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
explicit explicit
vector(size_type __n, const allocator_type& __a = allocator_type()) vector(size_type __n, const allocator_type& __a = allocator_type())
: vector(__n, false, __a) : vector(__n, false, __a)
@ -588,7 +588,7 @@ template<typename _Alloc>
_M_copy_aligned(__x.begin(), __x.end(), this->_M_impl._M_start); _M_copy_aligned(__x.begin(), __x.end(), this->_M_impl._M_start);
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
vector(vector&& __x) noexcept vector(vector&& __x) noexcept
: _Base(std::move(__x)) { } : _Base(std::move(__x)) { }
@ -601,7 +601,7 @@ template<typename _Alloc>
} }
#endif #endif
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _InputIterator, template<typename _InputIterator,
typename = std::_RequireInputIter<_InputIterator>> typename = std::_RequireInputIter<_InputIterator>>
vector(_InputIterator __first, _InputIterator __last, vector(_InputIterator __first, _InputIterator __last,
@ -636,7 +636,7 @@ template<typename _Alloc>
return *this; return *this;
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
vector& vector&
operator=(vector&& __x) operator=(vector&& __x)
{ {
@ -663,7 +663,7 @@ template<typename _Alloc>
assign(size_type __n, const bool& __x) assign(size_type __n, const bool& __x)
{ _M_fill_assign(__n, __x); } { _M_fill_assign(__n, __x); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _InputIterator, template<typename _InputIterator,
typename = std::_RequireInputIter<_InputIterator>> typename = std::_RequireInputIter<_InputIterator>>
void void
@ -679,7 +679,7 @@ template<typename _Alloc>
} }
#endif #endif
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
void void
assign(initializer_list<bool> __l) assign(initializer_list<bool> __l)
{ this->assign(__l.begin(), __l.end()); } { this->assign(__l.begin(), __l.end()); }
@ -717,7 +717,7 @@ template<typename _Alloc>
rend() const _GLIBCXX_NOEXCEPT rend() const _GLIBCXX_NOEXCEPT
{ return const_reverse_iterator(begin()); } { return const_reverse_iterator(begin()); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
const_iterator const_iterator
cbegin() const noexcept cbegin() const noexcept
{ return this->_M_impl._M_start; } { return this->_M_impl._M_start; }
@ -867,7 +867,7 @@ template<typename _Alloc>
return begin() + __n; return begin() + __n;
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _InputIterator, template<typename _InputIterator,
typename = std::_RequireInputIter<_InputIterator>> typename = std::_RequireInputIter<_InputIterator>>
void void
@ -889,7 +889,7 @@ template<typename _Alloc>
insert(iterator __position, size_type __n, const bool& __x) insert(iterator __position, size_type __n, const bool& __x)
{ _M_fill_insert(__position, __n, __x); } { _M_fill_insert(__position, __n, __x); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
void insert(iterator __p, initializer_list<bool> __l) void insert(iterator __p, initializer_list<bool> __l)
{ this->insert(__p, __l.begin(), __l.end()); } { this->insert(__p, __l.begin(), __l.end()); }
#endif #endif
@ -924,7 +924,7 @@ template<typename _Alloc>
insert(end(), __new_size - size(), __x); insert(end(), __new_size - size(), __x);
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
void void
shrink_to_fit() shrink_to_fit()
{ _M_shrink_to_fit(); } { _M_shrink_to_fit(); }
@ -966,7 +966,7 @@ template<typename _Alloc>
void void
_M_reallocate(size_type __n); _M_reallocate(size_type __n);
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
bool bool
_M_shrink_to_fit(); _M_shrink_to_fit();
#endif #endif
@ -1130,7 +1130,7 @@ template<typename _Alloc>
_GLIBCXX_END_NAMESPACE_CONTAINER _GLIBCXX_END_NAMESPACE_CONTAINER
} // namespace std } // namespace std
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
#include <bits/functional_hash.h> #include <bits/functional_hash.h>
@ -1151,6 +1151,6 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
_GLIBCXX_END_NAMESPACE_VERSION _GLIBCXX_END_NAMESPACE_VERSION
}// namespace std }// namespace std
#endif // __GXX_EXPERIMENTAL_CXX0X__ #endif // C++11
#endif #endif

2
libstdc++-v3/include/bits/stl_construct.h
View file

@ -70,7 +70,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
* Constructs an object in existing memory by invoking an allocated * Constructs an object in existing memory by invoking an allocated
* object's constructor with an initializer. * object's constructor with an initializer.
*/ */
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _T1, typename... _Args> template<typename _T1, typename... _Args>
inline void inline void
_Construct(_T1* __p, _Args&&... __args) _Construct(_T1* __p, _Args&&... __args)

44
libstdc++-v3/include/bits/stl_deque.h
View file

@ -60,7 +60,7 @@
#include <bits/concept_check.h> #include <bits/concept_check.h>
#include <bits/stl_iterator_base_types.h> #include <bits/stl_iterator_base_types.h>
#include <bits/stl_iterator_base_funcs.h> #include <bits/stl_iterator_base_funcs.h>
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
#include <initializer_list> #include <initializer_list>
#endif #endif
@ -392,7 +392,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
const _Tp&, const _Tp*>(__last), const _Tp&, const _Tp*>(__last),
__result); } __result); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _Tp> template<typename _Tp>
_Deque_iterator<_Tp, _Tp&, _Tp*> _Deque_iterator<_Tp, _Tp&, _Tp*>
move(_Deque_iterator<_Tp, const _Tp&, const _Tp*>, move(_Deque_iterator<_Tp, const _Tp&, const _Tp*>,
@ -465,7 +465,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
: _M_impl(__a) : _M_impl(__a)
{ } { }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
_Deque_base(_Deque_base&& __x) _Deque_base(_Deque_base&& __x)
: _M_impl(std::move(__x._M_get_Tp_allocator())) : _M_impl(std::move(__x._M_get_Tp_allocator()))
{ {
@ -508,7 +508,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
_M_start(), _M_finish() _M_start(), _M_finish()
{ } { }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
_Deque_impl(_Tp_alloc_type&& __a) _Deque_impl(_Tp_alloc_type&& __a)
: _Tp_alloc_type(std::move(__a)), _M_map(0), _M_map_size(0), : _Tp_alloc_type(std::move(__a)), _M_map(0), _M_map_size(0),
_M_start(), _M_finish() _M_start(), _M_finish()
@ -791,7 +791,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
deque(const allocator_type& __a) deque(const allocator_type& __a)
: _Base(__a, 0) { } : _Base(__a, 0) { }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* @brief Creates a %deque with default constructed elements. * @brief Creates a %deque with default constructed elements.
* @param __n The number of elements to initially create. * @param __n The number of elements to initially create.
@ -845,7 +845,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
this->_M_impl._M_start, this->_M_impl._M_start,
_M_get_Tp_allocator()); } _M_get_Tp_allocator()); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* @brief %Deque move constructor. * @brief %Deque move constructor.
* @param __x A %deque of identical element and allocator types. * @param __x A %deque of identical element and allocator types.
@ -891,7 +891,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
* input iterators are used, then this will do at most 2N calls to the * input iterators are used, then this will do at most 2N calls to the
* copy constructor, and logN memory reallocations. * copy constructor, and logN memory reallocations.
*/ */
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _InputIterator, template<typename _InputIterator,
typename = std::_RequireInputIter<_InputIterator>> typename = std::_RequireInputIter<_InputIterator>>
deque(_InputIterator __first, _InputIterator __last, deque(_InputIterator __first, _InputIterator __last,
@ -928,7 +928,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
deque& deque&
operator=(const deque& __x); operator=(const deque& __x);
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* @brief %Deque move assignment operator. * @brief %Deque move assignment operator.
* @param __x A %deque of identical element and allocator types. * @param __x A %deque of identical element and allocator types.
@ -991,7 +991,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
* resulting %deque's size is the same as the number of elements * resulting %deque's size is the same as the number of elements
* assigned. Old data may be lost. * assigned. Old data may be lost.
*/ */
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _InputIterator, template<typename _InputIterator,
typename = std::_RequireInputIter<_InputIterator>> typename = std::_RequireInputIter<_InputIterator>>
void void
@ -1007,7 +1007,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
} }
#endif #endif
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* @brief Assigns an initializer list to a %deque. * @brief Assigns an initializer list to a %deque.
* @param __l An initializer_list. * @param __l An initializer_list.
@ -1100,7 +1100,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
rend() const _GLIBCXX_NOEXCEPT rend() const _GLIBCXX_NOEXCEPT
{ return const_reverse_iterator(this->_M_impl._M_start); } { return const_reverse_iterator(this->_M_impl._M_start); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* Returns a read-only (constant) iterator that points to the first * Returns a read-only (constant) iterator that points to the first
* element in the %deque. Iteration is done in ordinary element order. * element in the %deque. Iteration is done in ordinary element order.
@ -1148,7 +1148,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
max_size() const _GLIBCXX_NOEXCEPT max_size() const _GLIBCXX_NOEXCEPT
{ return _M_get_Tp_allocator().max_size(); } { return _M_get_Tp_allocator().max_size(); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* @brief Resizes the %deque to the specified number of elements. * @brief Resizes the %deque to the specified number of elements.
* @param __new_size Number of elements the %deque should contain. * @param __new_size Number of elements the %deque should contain.
@ -1214,7 +1214,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
} }
#endif #endif
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** A non-binding request to reduce memory use. */ /** A non-binding request to reduce memory use. */
void void
shrink_to_fit() shrink_to_fit()
@ -1368,7 +1368,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
_M_push_front_aux(__x); _M_push_front_aux(__x);
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
void void
push_front(value_type&& __x) push_front(value_type&& __x)
{ emplace_front(std::move(__x)); } { emplace_front(std::move(__x)); }
@ -1400,7 +1400,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
_M_push_back_aux(__x); _M_push_back_aux(__x);
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
void void
push_back(value_type&& __x) push_back(value_type&& __x)
{ emplace_back(std::move(__x)); } { emplace_back(std::move(__x)); }
@ -1452,7 +1452,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
_M_pop_back_aux(); _M_pop_back_aux();
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* @brief Inserts an object in %deque before specified iterator. * @brief Inserts an object in %deque before specified iterator.
* @param __position An iterator into the %deque. * @param __position An iterator into the %deque.
@ -1479,7 +1479,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
iterator iterator
insert(iterator __position, const value_type& __x); insert(iterator __position, const value_type& __x);
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* @brief Inserts given rvalue into %deque before specified iterator. * @brief Inserts given rvalue into %deque before specified iterator.
* @param __position An iterator into the %deque. * @param __position An iterator into the %deque.
@ -1530,7 +1530,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
* [__first,__last) into the %deque before the location specified * [__first,__last) into the %deque before the location specified
* by @a __position. This is known as <em>range insert</em>. * by @a __position. This is known as <em>range insert</em>.
*/ */
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _InputIterator, template<typename _InputIterator,
typename = std::_RequireInputIter<_InputIterator>> typename = std::_RequireInputIter<_InputIterator>>
void void
@ -1680,7 +1680,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
void void
_M_fill_initialize(const value_type& __value); _M_fill_initialize(const value_type& __value);
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
// called by deque(n). // called by deque(n).
void void
_M_default_initialize(); _M_default_initialize();
@ -1752,7 +1752,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
//@{ //@{
/// Helper functions for push_* and pop_*. /// Helper functions for push_* and pop_*.
#ifndef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus < 201103L
void _M_push_back_aux(const value_type&); void _M_push_back_aux(const value_type&);
void _M_push_front_aux(const value_type&); void _M_push_front_aux(const value_type&);
@ -1813,7 +1813,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
_M_fill_insert(iterator __pos, size_type __n, const value_type& __x); _M_fill_insert(iterator __pos, size_type __n, const value_type& __x);
// called by insert(p,x) // called by insert(p,x)
#ifndef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus < 201103L
iterator iterator
_M_insert_aux(iterator __pos, const value_type& __x); _M_insert_aux(iterator __pos, const value_type& __x);
#else #else
@ -1874,7 +1874,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
this->_M_impl._M_finish = __pos; this->_M_impl._M_finish = __pos;
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
// Called by resize(sz). // Called by resize(sz).
void void
_M_default_append(size_type __n); _M_default_append(size_type __n);

4
libstdc++-v3/include/bits/stl_function.h
View file

@ -496,7 +496,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
operator()(const _Pair& __x) const operator()(const _Pair& __x) const
{ return __x.first; } { return __x.first; }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _Pair2> template<typename _Pair2>
typename _Pair2::first_type& typename _Pair2::first_type&
operator()(_Pair2& __x) const operator()(_Pair2& __x) const
@ -729,7 +729,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
_GLIBCXX_END_NAMESPACE_VERSION _GLIBCXX_END_NAMESPACE_VERSION
} // namespace } // namespace
#if !defined(__GXX_EXPERIMENTAL_CXX0X__) || _GLIBCXX_USE_DEPRECATED #if (__cplusplus < 201103L) || _GLIBCXX_USE_DEPRECATED
# include <backward/binders.h> # include <backward/binders.h>
#endif #endif

2
libstdc++-v3/include/bits/stl_heap.h
View file

@ -502,7 +502,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
} }
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* @brief Search the end of a heap. * @brief Search the end of a heap.
* @param __first Start of range. * @param __first Start of range.

14
libstdc++-v3/include/bits/stl_iterator.h
View file

@ -375,7 +375,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
{ return !(__x < __y); } { return !(__x < __y); }
template<typename _IteratorL, typename _IteratorR> template<typename _IteratorL, typename _IteratorR>
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
// DR 685. // DR 685.
inline auto inline auto
operator-(const reverse_iterator<_IteratorL>& __x, operator-(const reverse_iterator<_IteratorL>& __x,
@ -426,7 +426,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
* the end, if you like). Assigning a value to the %iterator will * the end, if you like). Assigning a value to the %iterator will
* always append the value to the end of the container. * always append the value to the end of the container.
*/ */
#ifndef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus < 201103L
back_insert_iterator& back_insert_iterator&
operator=(typename _Container::const_reference __value) operator=(typename _Container::const_reference __value)
{ {
@ -516,7 +516,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
* the front, if you like). Assigning a value to the %iterator will * the front, if you like). Assigning a value to the %iterator will
* always prepend the value to the front of the container. * always prepend the value to the front of the container.
*/ */
#ifndef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus < 201103L
front_insert_iterator& front_insert_iterator&
operator=(typename _Container::const_reference __value) operator=(typename _Container::const_reference __value)
{ {
@ -627,7 +627,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
* // vector v contains A, 1, 2, 3, and Z * // vector v contains A, 1, 2, 3, and Z
* @endcode * @endcode
*/ */
#ifndef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus < 201103L
insert_iterator& insert_iterator&
operator=(typename _Container::const_reference __value) operator=(typename _Container::const_reference __value)
{ {
@ -880,7 +880,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
// operators but also operator- must accept mixed iterator/const_iterator // operators but also operator- must accept mixed iterator/const_iterator
// parameters. // parameters.
template<typename _IteratorL, typename _IteratorR, typename _Container> template<typename _IteratorL, typename _IteratorR, typename _Container>
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
// DR 685. // DR 685.
inline auto inline auto
operator-(const __normal_iterator<_IteratorL, _Container>& __lhs, operator-(const __normal_iterator<_IteratorL, _Container>& __lhs,
@ -908,7 +908,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
_GLIBCXX_END_NAMESPACE_VERSION _GLIBCXX_END_NAMESPACE_VERSION
} // namespace } // namespace
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
namespace std _GLIBCXX_VISIBILITY(default) namespace std _GLIBCXX_VISIBILITY(default)
{ {
@ -1145,6 +1145,6 @@ _GLIBCXX_END_NAMESPACE_VERSION
#else #else
#define _GLIBCXX_MAKE_MOVE_ITERATOR(_Iter) (_Iter) #define _GLIBCXX_MAKE_MOVE_ITERATOR(_Iter) (_Iter)
#define _GLIBCXX_MAKE_MOVE_IF_NOEXCEPT_ITERATOR(_Iter) (_Iter) #define _GLIBCXX_MAKE_MOVE_IF_NOEXCEPT_ITERATOR(_Iter) (_Iter)
#endif // __GXX_EXPERIMENTAL_CXX0X__ #endif // C++11
#endif #endif

4
libstdc++-v3/include/bits/stl_iterator_base_funcs.h
View file

@ -177,7 +177,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
std::__advance(__i, __d, std::__iterator_category(__i)); std::__advance(__i, __d, std::__iterator_category(__i));
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _ForwardIterator> template<typename _ForwardIterator>
inline _ForwardIterator inline _ForwardIterator
@ -197,7 +197,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
return __x; return __x;
} }
#endif // __GXX_EXPERIMENTAL_CXX0X__ #endif // C++11
_GLIBCXX_END_NAMESPACE_VERSION _GLIBCXX_END_NAMESPACE_VERSION
} // namespace } // namespace

6
libstdc++-v3/include/bits/stl_iterator_base_types.h
View file

@ -65,7 +65,7 @@
#include <bits/c++config.h> #include <bits/c++config.h>
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
# include <type_traits> // For _GLIBCXX_HAS_NESTED_TYPE, is_convertible # include <type_traits> // For _GLIBCXX_HAS_NESTED_TYPE, is_convertible
#endif #endif
@ -139,7 +139,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
* argument. Specialized versions for pointers and pointers-to-const * argument. Specialized versions for pointers and pointers-to-const
* provide tighter, more correct semantics. * provide tighter, more correct semantics.
*/ */
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
_GLIBCXX_HAS_NESTED_TYPE(iterator_category) _GLIBCXX_HAS_NESTED_TYPE(iterator_category)
@ -223,7 +223,7 @@ _GLIBCXX_HAS_NESTED_TYPE(iterator_category)
{ return __it.base(); } { return __it.base(); }
}; };
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _InIter> template<typename _InIter>
using _RequireInputIter = typename using _RequireInputIter = typename
enable_if<is_convertible<typename enable_if<is_convertible<typename

58
libstdc++-v3/include/bits/stl_list.h
View file

@ -58,7 +58,7 @@
#define _STL_LIST_H 1 #define _STL_LIST_H 1
#include <bits/concept_check.h> #include <bits/concept_check.h>
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
#include <initializer_list> #include <initializer_list>
#endif #endif
@ -109,7 +109,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
///< User's data. ///< User's data.
_Tp _M_data; _Tp _M_data;
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename... _Args> template<typename... _Args>
_List_node(_Args&&... __args) _List_node(_Args&&... __args)
: __detail::_List_node_base(), _M_data(std::forward<_Args>(__args)...) : __detail::_List_node_base(), _M_data(std::forward<_Args>(__args)...)
@ -321,7 +321,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
: _Node_alloc_type(__a), _M_node() : _Node_alloc_type(__a), _M_node()
{ } { }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
_List_impl(_Node_alloc_type&& __a) _List_impl(_Node_alloc_type&& __a)
: _Node_alloc_type(std::move(__a)), _M_node() : _Node_alloc_type(std::move(__a)), _M_node()
{ } { }
@ -365,7 +365,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
: _M_impl(__a) : _M_impl(__a)
{ _M_init(); } { _M_init(); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
_List_base(_List_base&& __x) _List_base(_List_base&& __x)
: _M_impl(std::move(__x._M_get_Node_allocator())) : _M_impl(std::move(__x._M_get_Node_allocator()))
{ {
@ -478,7 +478,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
* Allocates space for a new node and constructs a copy of * Allocates space for a new node and constructs a copy of
* @a __args in it. * @a __args in it.
*/ */
#ifndef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus < 201103L
_Node* _Node*
_M_create_node(const value_type& __x) _M_create_node(const value_type& __x)
{ {
@ -532,7 +532,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
list(const allocator_type& __a) list(const allocator_type& __a)
: _Base(_Node_alloc_type(__a)) { } : _Base(_Node_alloc_type(__a)) { }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* @brief Creates a %list with default constructed elements. * @brief Creates a %list with default constructed elements.
* @param __n The number of elements to initially create. * @param __n The number of elements to initially create.
@ -584,7 +584,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
: _Base(__x._M_get_Node_allocator()) : _Base(__x._M_get_Node_allocator())
{ _M_initialize_dispatch(__x.begin(), __x.end(), __false_type()); } { _M_initialize_dispatch(__x.begin(), __x.end(), __false_type()); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* @brief %List move constructor. * @brief %List move constructor.
* @param __x A %list of identical element and allocator types. * @param __x A %list of identical element and allocator types.
@ -619,7 +619,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
* [@a __first,@a __last). This is linear in N (where N is * [@a __first,@a __last). This is linear in N (where N is
* distance(@a __first,@a __last)). * distance(@a __first,@a __last)).
*/ */
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _InputIterator, template<typename _InputIterator,
typename = std::_RequireInputIter<_InputIterator>> typename = std::_RequireInputIter<_InputIterator>>
list(_InputIterator __first, _InputIterator __last, list(_InputIterator __first, _InputIterator __last,
@ -656,7 +656,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
list& list&
operator=(const list& __x); operator=(const list& __x);
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* @brief %List move assignment operator. * @brief %List move assignment operator.
* @param __x A %list of identical element and allocator types. * @param __x A %list of identical element and allocator types.
@ -715,7 +715,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
* that the resulting %list's size is the same as the number of * that the resulting %list's size is the same as the number of
* elements assigned. Old data may be lost. * elements assigned. Old data may be lost.
*/ */
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _InputIterator, template<typename _InputIterator,
typename = std::_RequireInputIter<_InputIterator>> typename = std::_RequireInputIter<_InputIterator>>
void void
@ -732,7 +732,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
} }
#endif #endif
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* @brief Assigns an initializer_list to a %list. * @brief Assigns an initializer_list to a %list.
* @param __l An initializer_list of value_type. * @param __l An initializer_list of value_type.
@ -822,7 +822,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
rend() const _GLIBCXX_NOEXCEPT rend() const _GLIBCXX_NOEXCEPT
{ return const_reverse_iterator(begin()); } { return const_reverse_iterator(begin()); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* Returns a read-only (constant) iterator that points to the * Returns a read-only (constant) iterator that points to the
* first element in the %list. Iteration is done in ordinary * first element in the %list. Iteration is done in ordinary
@ -879,7 +879,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
max_size() const _GLIBCXX_NOEXCEPT max_size() const _GLIBCXX_NOEXCEPT
{ return _M_get_Node_allocator().max_size(); } { return _M_get_Node_allocator().max_size(); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* @brief Resizes the %list to the specified number of elements. * @brief Resizes the %list to the specified number of elements.
* @param __new_size Number of elements the %list should contain. * @param __new_size Number of elements the %list should contain.
@ -975,7 +975,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
push_front(const value_type& __x) push_front(const value_type& __x)
{ this->_M_insert(begin(), __x); } { this->_M_insert(begin(), __x); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
void void
push_front(value_type&& __x) push_front(value_type&& __x)
{ this->_M_insert(begin(), std::move(__x)); } { this->_M_insert(begin(), std::move(__x)); }
@ -1016,7 +1016,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
push_back(const value_type& __x) push_back(const value_type& __x)
{ this->_M_insert(end(), __x); } { this->_M_insert(end(), __x); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
void void
push_back(value_type&& __x) push_back(value_type&& __x)
{ this->_M_insert(end(), std::move(__x)); } { this->_M_insert(end(), std::move(__x)); }
@ -1042,7 +1042,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
pop_back() pop_back()
{ this->_M_erase(iterator(this->_M_impl._M_node._M_prev)); } { this->_M_erase(iterator(this->_M_impl._M_node._M_prev)); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* @brief Constructs object in %list before specified iterator. * @brief Constructs object in %list before specified iterator.
* @param __position A const_iterator into the %list. * @param __position A const_iterator into the %list.
@ -1074,7 +1074,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
iterator iterator
insert(iterator __position, const value_type& __x); insert(iterator __position, const value_type& __x);
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* @brief Inserts given rvalue into %list before specified iterator. * @brief Inserts given rvalue into %list before specified iterator.
* @param __position An iterator into the %list. * @param __position An iterator into the %list.
@ -1140,7 +1140,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
* This operation is linear in the number of elements inserted and * This operation is linear in the number of elements inserted and
* does not invalidate iterators and references. * does not invalidate iterators and references.
*/ */
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _InputIterator, template<typename _InputIterator,
typename = std::_RequireInputIter<_InputIterator>> typename = std::_RequireInputIter<_InputIterator>>
#else #else
@ -1245,7 +1245,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
* Requires this != @a __x. * Requires this != @a __x.
*/ */
void void
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
splice(iterator __position, list&& __x) splice(iterator __position, list&& __x)
#else #else
splice(iterator __position, list& __x) splice(iterator __position, list& __x)
@ -1259,7 +1259,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
} }
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
void void
splice(iterator __position, list& __x) splice(iterator __position, list& __x)
{ splice(__position, std::move(__x)); } { splice(__position, std::move(__x)); }
@ -1275,7 +1275,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
* inserts it into the current list before @a __position. * inserts it into the current list before @a __position.
*/ */
void void
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
splice(iterator __position, list&& __x, iterator __i) splice(iterator __position, list&& __x, iterator __i)
#else #else
splice(iterator __position, list& __x, iterator __i) splice(iterator __position, list& __x, iterator __i)
@ -1292,7 +1292,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
this->_M_transfer(__position, __i, __j); this->_M_transfer(__position, __i, __j);
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
void void
splice(iterator __position, list& __x, iterator __i) splice(iterator __position, list& __x, iterator __i)
{ splice(__position, std::move(__x), __i); } { splice(__position, std::move(__x), __i); }
@ -1311,7 +1311,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
* Undefined if @a __position is in [__first,__last). * Undefined if @a __position is in [__first,__last).
*/ */
void void
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
splice(iterator __position, list&& __x, iterator __first, splice(iterator __position, list&& __x, iterator __first,
iterator __last) iterator __last)
#else #else
@ -1328,7 +1328,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
} }
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
void void
splice(iterator __position, list& __x, iterator __first, iterator __last) splice(iterator __position, list& __x, iterator __first, iterator __last)
{ splice(__position, std::move(__x), __first, __last); } { splice(__position, std::move(__x), __first, __last); }
@ -1401,7 +1401,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
* sorted order, leaving @a __x empty when complete. Elements in * sorted order, leaving @a __x empty when complete. Elements in
* this list precede elements in @a __x that are equal. * this list precede elements in @a __x that are equal.
*/ */
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
void void
merge(list&& __x); merge(list&& __x);
@ -1426,7 +1426,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
* in this list precede elements in @a __x that are equivalent * in this list precede elements in @a __x that are equivalent
* according to StrictWeakOrdering(). * according to StrictWeakOrdering().
*/ */
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _StrictWeakOrdering> template<typename _StrictWeakOrdering>
void void
merge(list&& __x, _StrictWeakOrdering __comp); merge(list&& __x, _StrictWeakOrdering __comp);
@ -1500,7 +1500,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
push_back(__x); push_back(__x);
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
// Called by list(n). // Called by list(n).
void void
_M_default_initialize(size_type __n) _M_default_initialize(size_type __n)
@ -1543,7 +1543,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
{ __position._M_node->_M_transfer(__first._M_node, __last._M_node); } { __position._M_node->_M_transfer(__first._M_node, __last._M_node); }
// Inserts new element at position given and with value given. // Inserts new element at position given and with value given.
#ifndef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus < 201103L
void void
_M_insert(iterator __position, const value_type& __x) _M_insert(iterator __position, const value_type& __x)
{ {
@ -1566,7 +1566,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
{ {
__position._M_node->_M_unhook(); __position._M_node->_M_unhook();
_Node* __n = static_cast<_Node*>(__position._M_node); _Node* __n = static_cast<_Node*>(__position._M_node);
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
_M_get_Node_allocator().destroy(__n); _M_get_Node_allocator().destroy(__n);
#else #else
_M_get_Tp_allocator().destroy(std::__addressof(__n->_M_data)); _M_get_Tp_allocator().destroy(std::__addressof(__n->_M_data));

26
libstdc++-v3/include/bits/stl_map.h
View file

@ -59,7 +59,7 @@
#include <bits/functexcept.h> #include <bits/functexcept.h>
#include <bits/concept_check.h> #include <bits/concept_check.h>
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
#include <initializer_list> #include <initializer_list>
#include <tuple> #include <tuple>
#endif #endif
@ -181,7 +181,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
map(const map& __x) map(const map& __x)
: _M_t(__x._M_t) { } : _M_t(__x._M_t) { }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* @brief %Map move constructor. * @brief %Map move constructor.
* @param __x A %map of identical element and allocator types. * @param __x A %map of identical element and allocator types.
@ -268,7 +268,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
return *this; return *this;
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* @brief %Map move assignment operator. * @brief %Map move assignment operator.
* @param __x A %map of identical element and allocator types. * @param __x A %map of identical element and allocator types.
@ -384,7 +384,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
rend() const _GLIBCXX_NOEXCEPT rend() const _GLIBCXX_NOEXCEPT
{ return _M_t.rend(); } { return _M_t.rend(); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* Returns a read-only (constant) iterator that points to the first pair * Returns a read-only (constant) iterator that points to the first pair
* in the %map. Iteration is done in ascending order according to the * in the %map. Iteration is done in ascending order according to the
@ -462,7 +462,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
iterator __i = lower_bound(__k); iterator __i = lower_bound(__k);
// __i->first is greater than or equivalent to __k. // __i->first is greater than or equivalent to __k.
if (__i == end() || key_comp()(__k, (*__i).first)) if (__i == end() || key_comp()(__k, (*__i).first))
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
__i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
std::tuple<const key_type&>(__k), std::tuple<const key_type&>(__k),
std::tuple<>()); std::tuple<>());
@ -472,7 +472,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
return (*__i).second; return (*__i).second;
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
mapped_type& mapped_type&
operator[](key_type&& __k) operator[](key_type&& __k)
{ {
@ -517,7 +517,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
} }
// modifiers // modifiers
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* @brief Attempts to build and insert a std::pair into the %map. * @brief Attempts to build and insert a std::pair into the %map.
* *
@ -595,7 +595,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
insert(const value_type& __x) insert(const value_type& __x)
{ return _M_t._M_insert_unique(__x); } { return _M_t._M_insert_unique(__x); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _Pair, typename = typename template<typename _Pair, typename = typename
std::enable_if<std::is_constructible<value_type, std::enable_if<std::is_constructible<value_type,
_Pair&&>::value>::type> _Pair&&>::value>::type>
@ -604,7 +604,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
{ return _M_t._M_insert_unique(std::forward<_Pair>(__x)); } { return _M_t._M_insert_unique(std::forward<_Pair>(__x)); }
#endif #endif
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* @brief Attempts to insert a list of std::pairs into the %map. * @brief Attempts to insert a list of std::pairs into the %map.
* @param __list A std::initializer_list<value_type> of pairs to be * @param __list A std::initializer_list<value_type> of pairs to be
@ -641,14 +641,14 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
* Insertion requires logarithmic time (if the hint is not taken). * Insertion requires logarithmic time (if the hint is not taken).
*/ */
iterator iterator
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
insert(const_iterator __position, const value_type& __x) insert(const_iterator __position, const value_type& __x)
#else #else
insert(iterator __position, const value_type& __x) insert(iterator __position, const value_type& __x)
#endif #endif
{ return _M_t._M_insert_unique_(__position, __x); } { return _M_t._M_insert_unique_(__position, __x); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _Pair, typename = typename template<typename _Pair, typename = typename
std::enable_if<std::is_constructible<value_type, std::enable_if<std::is_constructible<value_type,
_Pair&&>::value>::type> _Pair&&>::value>::type>
@ -671,7 +671,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
insert(_InputIterator __first, _InputIterator __last) insert(_InputIterator __first, _InputIterator __last)
{ _M_t._M_insert_unique(__first, __last); } { _M_t._M_insert_unique(__first, __last); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
// _GLIBCXX_RESOLVE_LIB_DEFECTS // _GLIBCXX_RESOLVE_LIB_DEFECTS
// DR 130. Associative erase should return an iterator. // DR 130. Associative erase should return an iterator.
/** /**
@ -726,7 +726,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
erase(const key_type& __x) erase(const key_type& __x)
{ return _M_t.erase(__x); } { return _M_t.erase(__x); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
// _GLIBCXX_RESOLVE_LIB_DEFECTS // _GLIBCXX_RESOLVE_LIB_DEFECTS
// DR 130. Associative erase should return an iterator. // DR 130. Associative erase should return an iterator.
/** /**

22
libstdc++-v3/include/bits/stl_multimap.h
View file

@ -58,7 +58,7 @@
#define _STL_MULTIMAP_H 1 #define _STL_MULTIMAP_H 1
#include <bits/concept_check.h> #include <bits/concept_check.h>
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
#include <initializer_list> #include <initializer_list>
#endif #endif
@ -178,7 +178,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
multimap(const multimap& __x) multimap(const multimap& __x)
: _M_t(__x._M_t) { } : _M_t(__x._M_t) { }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* @brief %Multimap move constructor. * @brief %Multimap move constructor.
* @param __x A %multimap of identical element and allocator types. * @param __x A %multimap of identical element and allocator types.
@ -262,7 +262,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
return *this; return *this;
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* @brief %Multimap move assignment operator. * @brief %Multimap move assignment operator.
* @param __x A %multimap of identical element and allocator types. * @param __x A %multimap of identical element and allocator types.
@ -378,7 +378,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
rend() const _GLIBCXX_NOEXCEPT rend() const _GLIBCXX_NOEXCEPT
{ return _M_t.rend(); } { return _M_t.rend(); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* Returns a read-only (constant) iterator that points to the first pair * Returns a read-only (constant) iterator that points to the first pair
* in the %multimap. Iteration is done in ascending order according to * in the %multimap. Iteration is done in ascending order according to
@ -433,7 +433,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
{ return _M_t.max_size(); } { return _M_t.max_size(); }
// modifiers // modifiers
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* @brief Build and insert a std::pair into the %multimap. * @brief Build and insert a std::pair into the %multimap.
* *
@ -502,7 +502,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
insert(const value_type& __x) insert(const value_type& __x)
{ return _M_t._M_insert_equal(__x); } { return _M_t._M_insert_equal(__x); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _Pair, typename = typename template<typename _Pair, typename = typename
std::enable_if<std::is_constructible<value_type, std::enable_if<std::is_constructible<value_type,
_Pair&&>::value>::type> _Pair&&>::value>::type>
@ -532,14 +532,14 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
* Insertion requires logarithmic time (if the hint is not taken). * Insertion requires logarithmic time (if the hint is not taken).
*/ */
iterator iterator
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
insert(const_iterator __position, const value_type& __x) insert(const_iterator __position, const value_type& __x)
#else #else
insert(iterator __position, const value_type& __x) insert(iterator __position, const value_type& __x)
#endif #endif
{ return _M_t._M_insert_equal_(__position, __x); } { return _M_t._M_insert_equal_(__position, __x); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _Pair, typename = typename template<typename _Pair, typename = typename
std::enable_if<std::is_constructible<value_type, std::enable_if<std::is_constructible<value_type,
_Pair&&>::value>::type> _Pair&&>::value>::type>
@ -563,7 +563,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
insert(_InputIterator __first, _InputIterator __last) insert(_InputIterator __first, _InputIterator __last)
{ _M_t._M_insert_equal(__first, __last); } { _M_t._M_insert_equal(__first, __last); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* @brief Attempts to insert a list of std::pairs into the %multimap. * @brief Attempts to insert a list of std::pairs into the %multimap.
* @param __l A std::initializer_list<value_type> of pairs to be * @param __l A std::initializer_list<value_type> of pairs to be
@ -576,7 +576,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
{ this->insert(__l.begin(), __l.end()); } { this->insert(__l.begin(), __l.end()); }
#endif #endif
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
// _GLIBCXX_RESOLVE_LIB_DEFECTS // _GLIBCXX_RESOLVE_LIB_DEFECTS
// DR 130. Associative erase should return an iterator. // DR 130. Associative erase should return an iterator.
/** /**
@ -631,7 +631,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
erase(const key_type& __x) erase(const key_type& __x)
{ return _M_t.erase(__x); } { return _M_t.erase(__x); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
// _GLIBCXX_RESOLVE_LIB_DEFECTS // _GLIBCXX_RESOLVE_LIB_DEFECTS
// DR 130. Associative erase should return an iterator. // DR 130. Associative erase should return an iterator.
/** /**

20
libstdc++-v3/include/bits/stl_multiset.h
View file

@ -58,7 +58,7 @@
#define _STL_MULTISET_H 1 #define _STL_MULTISET_H 1
#include <bits/concept_check.h> #include <bits/concept_check.h>
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
#include <initializer_list> #include <initializer_list>
#endif #endif
@ -190,7 +190,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
multiset(const multiset& __x) multiset(const multiset& __x)
: _M_t(__x._M_t) { } : _M_t(__x._M_t) { }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* @brief %Multiset move constructor. * @brief %Multiset move constructor.
* @param __x A %multiset of identical element and allocator types. * @param __x A %multiset of identical element and allocator types.
@ -233,7 +233,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
return *this; return *this;
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* @brief %Multiset move assignment operator. * @brief %Multiset move assignment operator.
* @param __x A %multiset of identical element and allocator types. * @param __x A %multiset of identical element and allocator types.
@ -323,7 +323,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
rend() const _GLIBCXX_NOEXCEPT rend() const _GLIBCXX_NOEXCEPT
{ return _M_t.rend(); } { return _M_t.rend(); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* Returns a read-only (constant) iterator that points to the first * Returns a read-only (constant) iterator that points to the first
* element in the %multiset. Iteration is done in ascending order * element in the %multiset. Iteration is done in ascending order
@ -392,7 +392,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
{ _M_t.swap(__x._M_t); } { _M_t.swap(__x._M_t); }
// insert/erase // insert/erase
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* @brief Builds and inserts an element into the %multiset. * @brief Builds and inserts an element into the %multiset.
* @param __args Arguments used to generate the element instance to be * @param __args Arguments used to generate the element instance to be
@ -455,7 +455,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
insert(const value_type& __x) insert(const value_type& __x)
{ return _M_t._M_insert_equal(__x); } { return _M_t._M_insert_equal(__x); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
iterator iterator
insert(value_type&& __x) insert(value_type&& __x)
{ return _M_t._M_insert_equal(std::move(__x)); } { return _M_t._M_insert_equal(std::move(__x)); }
@ -485,7 +485,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
insert(const_iterator __position, const value_type& __x) insert(const_iterator __position, const value_type& __x)
{ return _M_t._M_insert_equal_(__position, __x); } { return _M_t._M_insert_equal_(__position, __x); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
iterator iterator
insert(const_iterator __position, value_type&& __x) insert(const_iterator __position, value_type&& __x)
{ return _M_t._M_insert_equal_(__position, std::move(__x)); } { return _M_t._M_insert_equal_(__position, std::move(__x)); }
@ -504,7 +504,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
insert(_InputIterator __first, _InputIterator __last) insert(_InputIterator __first, _InputIterator __last)
{ _M_t._M_insert_equal(__first, __last); } { _M_t._M_insert_equal(__first, __last); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* @brief Attempts to insert a list of elements into the %multiset. * @brief Attempts to insert a list of elements into the %multiset.
* @param __l A std::initializer_list<value_type> of elements * @param __l A std::initializer_list<value_type> of elements
@ -517,7 +517,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
{ this->insert(__l.begin(), __l.end()); } { this->insert(__l.begin(), __l.end()); }
#endif #endif
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
// _GLIBCXX_RESOLVE_LIB_DEFECTS // _GLIBCXX_RESOLVE_LIB_DEFECTS
// DR 130. Associative erase should return an iterator. // DR 130. Associative erase should return an iterator.
/** /**
@ -567,7 +567,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
erase(const key_type& __x) erase(const key_type& __x)
{ return _M_t.erase(__x); } { return _M_t.erase(__x); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
// _GLIBCXX_RESOLVE_LIB_DEFECTS // _GLIBCXX_RESOLVE_LIB_DEFECTS
// DR 130. Associative erase should return an iterator. // DR 130. Associative erase should return an iterator.
/** /**

2
libstdc++-v3/include/bits/stl_numeric.h
View file

@ -61,7 +61,7 @@
#include <debug/debug.h> #include <debug/debug.h>
#include <bits/move.h> // For _GLIBCXX_MOVE #include <bits/move.h> // For _GLIBCXX_MOVE
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
namespace std _GLIBCXX_VISIBILITY(default) namespace std _GLIBCXX_VISIBILITY(default)
{ {

10
libstdc++-v3/include/bits/stl_pair.h
View file

@ -60,7 +60,7 @@
#include <bits/move.h> // for std::move / std::forward, and std::swap #include <bits/move.h> // for std::move / std::forward, and std::swap
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
#include <type_traits> // for std::__decay_and_strip too #include <type_traits> // for std::__decay_and_strip too
#endif #endif
@ -68,7 +68,7 @@ namespace std _GLIBCXX_VISIBILITY(default)
{ {
_GLIBCXX_BEGIN_NAMESPACE_VERSION _GLIBCXX_BEGIN_NAMESPACE_VERSION
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/// piecewise_construct_t /// piecewise_construct_t
struct piecewise_construct_t { }; struct piecewise_construct_t { };
@ -110,7 +110,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
: first(__a), second(__b) { } : first(__a), second(__b) { }
/** There is also a templated copy ctor for the @c pair class itself. */ /** There is also a templated copy ctor for the @c pair class itself. */
#ifndef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus < 201103L
template<class _U1, class _U2> template<class _U1, class _U2>
pair(const pair<_U1, _U2>& __p) pair(const pair<_U1, _U2>& __p)
: first(__p.first), second(__p.second) { } : first(__p.first), second(__p.second) { }
@ -242,7 +242,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
operator>=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) operator>=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
{ return !(__x < __y); } { return !(__x < __y); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/// See std::pair::swap(). /// See std::pair::swap().
// Note: no std::swap overloads in C++03 mode, this has performance // Note: no std::swap overloads in C++03 mode, this has performance
// implications, see, eg, libstdc++/38466. // implications, see, eg, libstdc++/38466.
@ -265,7 +265,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
*/ */
// _GLIBCXX_RESOLVE_LIB_DEFECTS // _GLIBCXX_RESOLVE_LIB_DEFECTS
// 181. make_pair() unintended behavior // 181. make_pair() unintended behavior
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
// NB: DR 706. // NB: DR 706.
template<class _T1, class _T2> template<class _T1, class _T2>
constexpr pair<typename __decay_and_strip<_T1>::__type, constexpr pair<typename __decay_and_strip<_T1>::__type,

18
libstdc++-v3/include/bits/stl_queue.h
View file

@ -131,7 +131,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
/** /**
* @brief Default constructor creates no elements. * @brief Default constructor creates no elements.
*/ */
#ifndef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus < 201103L
explicit explicit
queue(const _Sequence& __c = _Sequence()) queue(const _Sequence& __c = _Sequence())
: c(__c) { } : c(__c) { }
@ -214,7 +214,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
push(const value_type& __x) push(const value_type& __x)
{ c.push_back(__x); } { c.push_back(__x); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
void void
push(value_type&& __x) push(value_type&& __x)
{ c.push_back(std::move(__x)); } { c.push_back(std::move(__x)); }
@ -243,7 +243,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
c.pop_front(); c.pop_front();
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
void void
swap(queue& __q) swap(queue& __q)
noexcept(noexcept(swap(c, __q.c))) noexcept(noexcept(swap(c, __q.c)))
@ -312,7 +312,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
operator>=(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y) operator>=(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y)
{ return !(__x < __y); } { return !(__x < __y); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _Tp, typename _Seq> template<typename _Tp, typename _Seq>
inline void inline void
swap(queue<_Tp, _Seq>& __x, queue<_Tp, _Seq>& __y) swap(queue<_Tp, _Seq>& __x, queue<_Tp, _Seq>& __y)
@ -393,7 +393,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
/** /**
* @brief Default constructor creates no elements. * @brief Default constructor creates no elements.
*/ */
#ifndef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus < 201103L
explicit explicit
priority_queue(const _Compare& __x = _Compare(), priority_queue(const _Compare& __x = _Compare(),
const _Sequence& __s = _Sequence()) const _Sequence& __s = _Sequence())
@ -428,7 +428,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
* documentation on @link functors functor base * documentation on @link functors functor base
* classes@endlink. * classes@endlink.
*/ */
#ifndef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus < 201103L
template<typename _InputIterator> template<typename _InputIterator>
priority_queue(_InputIterator __first, _InputIterator __last, priority_queue(_InputIterator __first, _InputIterator __last,
const _Compare& __x = _Compare(), const _Compare& __x = _Compare(),
@ -501,7 +501,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
std::push_heap(c.begin(), c.end(), comp); std::push_heap(c.begin(), c.end(), comp);
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
void void
push(value_type&& __x) push(value_type&& __x)
{ {
@ -537,7 +537,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
c.pop_back(); c.pop_back();
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
void void
swap(priority_queue& __pq) swap(priority_queue& __pq)
noexcept(noexcept(swap(c, __pq.c)) && noexcept(swap(comp, __pq.comp))) noexcept(noexcept(swap(c, __pq.c)) && noexcept(swap(comp, __pq.comp)))
@ -551,7 +551,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
// No equality/comparison operators are provided for priority_queue. // No equality/comparison operators are provided for priority_queue.
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _Tp, typename _Sequence, typename _Compare> template<typename _Tp, typename _Sequence, typename _Compare>
inline void inline void
swap(priority_queue<_Tp, _Sequence, _Compare>& __x, swap(priority_queue<_Tp, _Sequence, _Compare>& __x,

20
libstdc++-v3/include/bits/stl_set.h
View file

@ -58,7 +58,7 @@
#define _STL_SET_H 1 #define _STL_SET_H 1
#include <bits/concept_check.h> #include <bits/concept_check.h>
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
#include <initializer_list> #include <initializer_list>
#endif #endif
@ -194,7 +194,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
set(const set& __x) set(const set& __x)
: _M_t(__x._M_t) { } : _M_t(__x._M_t) { }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* @brief %Set move constructor * @brief %Set move constructor
* @param __x A %set of identical element and allocator types. * @param __x A %set of identical element and allocator types.
@ -237,7 +237,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
return *this; return *this;
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* @brief %Set move assignment operator. * @brief %Set move assignment operator.
* @param __x A %set of identical element and allocator types. * @param __x A %set of identical element and allocator types.
@ -326,7 +326,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
rend() const _GLIBCXX_NOEXCEPT rend() const _GLIBCXX_NOEXCEPT
{ return _M_t.rend(); } { return _M_t.rend(); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* Returns a read-only (constant) iterator that points to the first * Returns a read-only (constant) iterator that points to the first
* element in the %set. Iteration is done in ascending order according * element in the %set. Iteration is done in ascending order according
@ -395,7 +395,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
{ _M_t.swap(__x._M_t); } { _M_t.swap(__x._M_t); }
// insert/erase // insert/erase
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* @brief Attempts to build and insert an element into the %set. * @brief Attempts to build and insert an element into the %set.
* @param __args Arguments used to generate an element. * @param __args Arguments used to generate an element.
@ -465,7 +465,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
return std::pair<iterator, bool>(__p.first, __p.second); return std::pair<iterator, bool>(__p.first, __p.second);
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
std::pair<iterator, bool> std::pair<iterator, bool>
insert(value_type&& __x) insert(value_type&& __x)
{ {
@ -498,7 +498,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
insert(const_iterator __position, const value_type& __x) insert(const_iterator __position, const value_type& __x)
{ return _M_t._M_insert_unique_(__position, __x); } { return _M_t._M_insert_unique_(__position, __x); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
iterator iterator
insert(const_iterator __position, value_type&& __x) insert(const_iterator __position, value_type&& __x)
{ return _M_t._M_insert_unique_(__position, std::move(__x)); } { return _M_t._M_insert_unique_(__position, std::move(__x)); }
@ -518,7 +518,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
insert(_InputIterator __first, _InputIterator __last) insert(_InputIterator __first, _InputIterator __last)
{ _M_t._M_insert_unique(__first, __last); } { _M_t._M_insert_unique(__first, __last); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* @brief Attempts to insert a list of elements into the %set. * @brief Attempts to insert a list of elements into the %set.
* @param __l A std::initializer_list<value_type> of elements * @param __l A std::initializer_list<value_type> of elements
@ -531,7 +531,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
{ this->insert(__l.begin(), __l.end()); } { this->insert(__l.begin(), __l.end()); }
#endif #endif
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
// _GLIBCXX_RESOLVE_LIB_DEFECTS // _GLIBCXX_RESOLVE_LIB_DEFECTS
// DR 130. Associative erase should return an iterator. // DR 130. Associative erase should return an iterator.
/** /**
@ -581,7 +581,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
erase(const key_type& __x) erase(const key_type& __x)
{ return _M_t.erase(__x); } { return _M_t.erase(__x); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
// _GLIBCXX_RESOLVE_LIB_DEFECTS // _GLIBCXX_RESOLVE_LIB_DEFECTS
// DR 130. Associative erase should return an iterator. // DR 130. Associative erase should return an iterator.
/** /**

8
libstdc++-v3/include/bits/stl_stack.h
View file

@ -127,7 +127,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
/** /**
* @brief Default constructor creates no elements. * @brief Default constructor creates no elements.
*/ */
#ifndef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus < 201103L
explicit explicit
stack(const _Sequence& __c = _Sequence()) stack(const _Sequence& __c = _Sequence())
: c(__c) { } : c(__c) { }
@ -188,7 +188,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
push(const value_type& __x) push(const value_type& __x)
{ c.push_back(__x); } { c.push_back(__x); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
void void
push(value_type&& __x) push(value_type&& __x)
{ c.push_back(std::move(__x)); } { c.push_back(std::move(__x)); }
@ -217,7 +217,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
c.pop_back(); c.pop_back();
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
void void
swap(stack& __s) swap(stack& __s)
noexcept(noexcept(swap(c, __s.c))) noexcept(noexcept(swap(c, __s.c)))
@ -287,7 +287,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
operator>=(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y) operator>=(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y)
{ return !(__x < __y); } { return !(__x < __y); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _Tp, typename _Seq> template<typename _Tp, typename _Seq>
inline void inline void
swap(stack<_Tp, _Seq>& __x, stack<_Tp, _Seq>& __y) swap(stack<_Tp, _Seq>& __x, stack<_Tp, _Seq>& __y)

48
libstdc++-v3/include/bits/stl_tree.h
View file

@ -132,7 +132,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
typedef _Rb_tree_node<_Val>* _Link_type; typedef _Rb_tree_node<_Val>* _Link_type;
_Val _M_value_field; _Val _M_value_field;
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename... _Args> template<typename... _Args>
_Rb_tree_node(_Args&&... __args) _Rb_tree_node(_Args&&... __args)
: _Rb_tree_node_base(), : _Rb_tree_node_base(),
@ -372,7 +372,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
_M_put_node(_Link_type __p) _M_put_node(_Link_type __p)
{ _M_impl._Node_allocator::deallocate(__p, 1); } { _M_impl._Node_allocator::deallocate(__p, 1); }
#ifndef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus < 201103L
_Link_type _Link_type
_M_create_node(const value_type& __x) _M_create_node(const value_type& __x)
{ {
@ -450,7 +450,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
_M_node_count(0) _M_node_count(0)
{ _M_initialize(); } { _M_initialize(); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
_Rb_tree_impl(const _Key_compare& __comp, _Node_allocator&& __a) _Rb_tree_impl(const _Key_compare& __comp, _Node_allocator&& __a)
: _Node_allocator(std::move(__a)), _M_key_compare(__comp), : _Node_allocator(std::move(__a)), _M_key_compare(__comp),
_M_header(), _M_node_count(0) _M_header(), _M_node_count(0)
@ -584,7 +584,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
_M_get_insert_hint_equal_pos(const_iterator __pos, _M_get_insert_hint_equal_pos(const_iterator __pos,
const key_type& __k); const key_type& __k);
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _Arg> template<typename _Arg>
iterator iterator
_M_insert_(_Base_ptr __x, _Base_ptr __y, _Arg&& __v); _M_insert_(_Base_ptr __x, _Base_ptr __y, _Arg&& __v);
@ -661,7 +661,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
} }
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
_Rb_tree(_Rb_tree&& __x); _Rb_tree(_Rb_tree&& __x);
#endif #endif
@ -733,7 +733,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
swap(_Rb_tree& __t); swap(_Rb_tree& __t);
// Insert/erase. // Insert/erase.
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _Arg> template<typename _Arg>
pair<iterator, bool> pair<iterator, bool>
_M_insert_unique(_Arg&& __x); _M_insert_unique(_Arg&& __x);
@ -795,7 +795,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
_M_erase_aux(const_iterator __first, const_iterator __last); _M_erase_aux(const_iterator __first, const_iterator __last);
public: public:
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
// _GLIBCXX_RESOLVE_LIB_DEFECTS // _GLIBCXX_RESOLVE_LIB_DEFECTS
// DR 130. Associative erase should return an iterator. // DR 130. Associative erase should return an iterator.
iterator iterator
@ -828,7 +828,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
size_type size_type
erase(const key_type& __x); erase(const key_type& __x);
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
// _GLIBCXX_RESOLVE_LIB_DEFECTS // _GLIBCXX_RESOLVE_LIB_DEFECTS
// DR 130. Associative erase should return an iterator. // DR 130. Associative erase should return an iterator.
iterator iterator
@ -951,7 +951,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y) _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y)
{ __x.swap(__y); } { __x.swap(__y); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _Key, typename _Val, typename _KeyOfValue, template<typename _Key, typename _Val, typename _KeyOfValue,
typename _Compare, typename _Alloc> typename _Compare, typename _Alloc>
_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
@ -1000,12 +1000,12 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
template<typename _Key, typename _Val, typename _KeyOfValue, template<typename _Key, typename _Val, typename _KeyOfValue,
typename _Compare, typename _Alloc> typename _Compare, typename _Alloc>
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _Arg> template<typename _Arg>
#endif #endif
typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
_M_insert_(_Base_ptr __x, _Base_ptr __p, _Arg&& __v) _M_insert_(_Base_ptr __x, _Base_ptr __p, _Arg&& __v)
#else #else
_M_insert_(_Base_ptr __x, _Base_ptr __p, const _Val& __v) _M_insert_(_Base_ptr __x, _Base_ptr __p, const _Val& __v)
@ -1025,12 +1025,12 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
template<typename _Key, typename _Val, typename _KeyOfValue, template<typename _Key, typename _Val, typename _KeyOfValue,
typename _Compare, typename _Alloc> typename _Compare, typename _Alloc>
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _Arg> template<typename _Arg>
#endif #endif
typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
_M_insert_lower(_Base_ptr __p, _Arg&& __v) _M_insert_lower(_Base_ptr __p, _Arg&& __v)
#else #else
_M_insert_lower(_Base_ptr __p, const _Val& __v) _M_insert_lower(_Base_ptr __p, const _Val& __v)
@ -1050,12 +1050,12 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
template<typename _Key, typename _Val, typename _KeyOfValue, template<typename _Key, typename _Val, typename _KeyOfValue,
typename _Compare, typename _Alloc> typename _Compare, typename _Alloc>
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _Arg> template<typename _Arg>
#endif #endif
typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
_M_insert_equal_lower(_Arg&& __v) _M_insert_equal_lower(_Arg&& __v)
#else #else
_M_insert_equal_lower(const _Val& __v) _M_insert_equal_lower(const _Val& __v)
@ -1355,13 +1355,13 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
template<typename _Key, typename _Val, typename _KeyOfValue, template<typename _Key, typename _Val, typename _KeyOfValue,
typename _Compare, typename _Alloc> typename _Compare, typename _Alloc>
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _Arg> template<typename _Arg>
#endif #endif
pair<typename _Rb_tree<_Key, _Val, _KeyOfValue, pair<typename _Rb_tree<_Key, _Val, _KeyOfValue,
_Compare, _Alloc>::iterator, bool> _Compare, _Alloc>::iterator, bool>
_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
_M_insert_unique(_Arg&& __v) _M_insert_unique(_Arg&& __v)
#else #else
_M_insert_unique(const _Val& __v) _M_insert_unique(const _Val& __v)
@ -1381,12 +1381,12 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
template<typename _Key, typename _Val, typename _KeyOfValue, template<typename _Key, typename _Val, typename _KeyOfValue,
typename _Compare, typename _Alloc> typename _Compare, typename _Alloc>
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _Arg> template<typename _Arg>
#endif #endif
typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
_M_insert_equal(_Arg&& __v) _M_insert_equal(_Arg&& __v)
#else #else
_M_insert_equal(const _Val& __v) _M_insert_equal(const _Val& __v)
@ -1458,12 +1458,12 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
template<typename _Key, typename _Val, typename _KeyOfValue, template<typename _Key, typename _Val, typename _KeyOfValue,
typename _Compare, typename _Alloc> typename _Compare, typename _Alloc>
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _Arg> template<typename _Arg>
#endif #endif
typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
_M_insert_unique_(const_iterator __position, _Arg&& __v) _M_insert_unique_(const_iterator __position, _Arg&& __v)
#else #else
_M_insert_unique_(const_iterator __position, const _Val& __v) _M_insert_unique_(const_iterator __position, const _Val& __v)
@ -1535,12 +1535,12 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
template<typename _Key, typename _Val, typename _KeyOfValue, template<typename _Key, typename _Val, typename _KeyOfValue,
typename _Compare, typename _Alloc> typename _Compare, typename _Alloc>
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _Arg> template<typename _Arg>
#endif #endif
typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
_M_insert_equal_(const_iterator __position, _Arg&& __v) _M_insert_equal_(const_iterator __position, _Arg&& __v)
#else #else
_M_insert_equal_(const_iterator __position, const _Val& __v) _M_insert_equal_(const_iterator __position, const _Val& __v)
@ -1556,7 +1556,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
return _M_insert_equal_lower(_GLIBCXX_FORWARD(_Arg, __v)); return _M_insert_equal_lower(_GLIBCXX_FORWARD(_Arg, __v));
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _Key, typename _Val, typename _KeyOfValue, template<typename _Key, typename _Val, typename _KeyOfValue,
typename _Compare, typename _Alloc> typename _Compare, typename _Alloc>
typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator

2
libstdc++-v3/include/bits/stl_uninitialized.h
View file

@ -444,7 +444,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
} }
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
// Extensions: __uninitialized_default, __uninitialized_default_n, // Extensions: __uninitialized_default, __uninitialized_default_n,
// __uninitialized_default_a, __uninitialized_default_n_a. // __uninitialized_default_a, __uninitialized_default_n_a.

48
libstdc++-v3/include/bits/stl_vector.h
View file

@ -60,7 +60,7 @@
#include <bits/stl_iterator_base_funcs.h> #include <bits/stl_iterator_base_funcs.h>
#include <bits/functexcept.h> #include <bits/functexcept.h>
#include <bits/concept_check.h> #include <bits/concept_check.h>
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
#include <initializer_list> #include <initializer_list>
#endif #endif
@ -92,7 +92,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
: _Tp_alloc_type(__a), _M_start(0), _M_finish(0), _M_end_of_storage(0) : _Tp_alloc_type(__a), _M_start(0), _M_finish(0), _M_end_of_storage(0)
{ } { }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
_Vector_impl(_Tp_alloc_type&& __a) _Vector_impl(_Tp_alloc_type&& __a)
: _Tp_alloc_type(std::move(__a)), : _Tp_alloc_type(std::move(__a)),
_M_start(0), _M_finish(0), _M_end_of_storage(0) _M_start(0), _M_finish(0), _M_end_of_storage(0)
@ -136,7 +136,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
: _M_impl(__a) : _M_impl(__a)
{ _M_create_storage(__n); } { _M_create_storage(__n); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
_Vector_base(_Tp_alloc_type&& __a) _Vector_base(_Tp_alloc_type&& __a)
: _M_impl(std::move(__a)) { } : _M_impl(std::move(__a)) { }
@ -257,7 +257,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
vector(const allocator_type& __a) vector(const allocator_type& __a)
: _Base(__a) { } : _Base(__a) { }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* @brief Creates a %vector with default constructed elements. * @brief Creates a %vector with default constructed elements.
* @param __n The number of elements to initially create. * @param __n The number of elements to initially create.
@ -317,7 +317,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
_M_get_Tp_allocator()); _M_get_Tp_allocator());
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* @brief %Vector move constructor. * @brief %Vector move constructor.
* @param __x A %vector of identical element and allocator types. * @param __x A %vector of identical element and allocator types.
@ -387,7 +387,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
* used, then this will do at most 2N calls to the copy * used, then this will do at most 2N calls to the copy
* constructor, and logN memory reallocations. * constructor, and logN memory reallocations.
*/ */
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _InputIterator, template<typename _InputIterator,
typename = std::_RequireInputIter<_InputIterator>> typename = std::_RequireInputIter<_InputIterator>>
vector(_InputIterator __first, _InputIterator __last, vector(_InputIterator __first, _InputIterator __last,
@ -427,7 +427,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
vector& vector&
operator=(const vector& __x); operator=(const vector& __x);
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* @brief %Vector move assignment operator. * @brief %Vector move assignment operator.
* @param __x A %vector of identical element and allocator types. * @param __x A %vector of identical element and allocator types.
@ -492,7 +492,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
* that the resulting %vector's size is the same as the number * that the resulting %vector's size is the same as the number
* of elements assigned. Old data may be lost. * of elements assigned. Old data may be lost.
*/ */
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _InputIterator, template<typename _InputIterator,
typename = std::_RequireInputIter<_InputIterator>> typename = std::_RequireInputIter<_InputIterator>>
void void
@ -509,7 +509,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
} }
#endif #endif
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* @brief Assigns an initializer list to a %vector. * @brief Assigns an initializer list to a %vector.
* @param __l An initializer_list. * @param __l An initializer_list.
@ -602,7 +602,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
rend() const _GLIBCXX_NOEXCEPT rend() const _GLIBCXX_NOEXCEPT
{ return const_reverse_iterator(begin()); } { return const_reverse_iterator(begin()); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* Returns a read-only (constant) iterator that points to the * Returns a read-only (constant) iterator that points to the
* first element in the %vector. Iteration is done in ordinary * first element in the %vector. Iteration is done in ordinary
@ -651,7 +651,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
max_size() const _GLIBCXX_NOEXCEPT max_size() const _GLIBCXX_NOEXCEPT
{ return _Alloc_traits::max_size(_M_get_Tp_allocator()); } { return _Alloc_traits::max_size(_M_get_Tp_allocator()); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* @brief Resizes the %vector to the specified number of elements. * @brief Resizes the %vector to the specified number of elements.
* @param __new_size Number of elements the %vector should contain. * @param __new_size Number of elements the %vector should contain.
@ -711,7 +711,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
} }
#endif #endif
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** A non-binding request to reduce capacity() to size(). */ /** A non-binding request to reduce capacity() to size(). */
void void
shrink_to_fit() shrink_to_fit()
@ -871,7 +871,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
* Returns a pointer such that [data(), data() + size()) is a valid * Returns a pointer such that [data(), data() + size()) is a valid
* range. For a non-empty %vector, data() == &front(). * range. For a non-empty %vector, data() == &front().
*/ */
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
_Tp* _Tp*
#else #else
pointer pointer
@ -879,7 +879,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
data() _GLIBCXX_NOEXCEPT data() _GLIBCXX_NOEXCEPT
{ return std::__addressof(front()); } { return std::__addressof(front()); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
const _Tp* const _Tp*
#else #else
const_pointer const_pointer
@ -908,14 +908,14 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
++this->_M_impl._M_finish; ++this->_M_impl._M_finish;
} }
else else
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
_M_emplace_back_aux(__x); _M_emplace_back_aux(__x);
#else #else
_M_insert_aux(end(), __x); _M_insert_aux(end(), __x);
#endif #endif
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
void void
push_back(value_type&& __x) push_back(value_type&& __x)
{ emplace_back(std::move(__x)); } { emplace_back(std::move(__x)); }
@ -941,7 +941,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
_Alloc_traits::destroy(this->_M_impl, this->_M_impl._M_finish); _Alloc_traits::destroy(this->_M_impl, this->_M_impl._M_finish);
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* @brief Inserts an object in %vector before specified iterator. * @brief Inserts an object in %vector before specified iterator.
* @param __position An iterator into the %vector. * @param __position An iterator into the %vector.
@ -973,7 +973,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
iterator iterator
insert(iterator __position, const value_type& __x); insert(iterator __position, const value_type& __x);
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* @brief Inserts given rvalue into %vector before specified iterator. * @brief Inserts given rvalue into %vector before specified iterator.
* @param __position An iterator into the %vector. * @param __position An iterator into the %vector.
@ -1038,7 +1038,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
* %vector and if it is frequently used the user should * %vector and if it is frequently used the user should
* consider using std::list. * consider using std::list.
*/ */
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _InputIterator, template<typename _InputIterator,
typename = std::_RequireInputIter<_InputIterator>> typename = std::_RequireInputIter<_InputIterator>>
void void
@ -1107,7 +1107,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
*/ */
void void
swap(vector& __x) swap(vector& __x)
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
noexcept(_Alloc_traits::_S_nothrow_swap()) noexcept(_Alloc_traits::_S_nothrow_swap())
#endif #endif
{ {
@ -1213,7 +1213,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
this->_M_impl._M_finish = this->_M_impl._M_end_of_storage; this->_M_impl._M_finish = this->_M_impl._M_end_of_storage;
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
// Called by the vector(n) constructor. // Called by the vector(n) constructor.
void void
_M_default_initialize(size_type __n) _M_default_initialize(size_type __n)
@ -1305,7 +1305,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
void void
_M_fill_insert(iterator __pos, size_type __n, const value_type& __x); _M_fill_insert(iterator __pos, size_type __n, const value_type& __x);
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
// Called by resize(n). // Called by resize(n).
void void
_M_default_append(size_type __n); _M_default_append(size_type __n);
@ -1315,7 +1315,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
#endif #endif
// Called by insert(p,x) // Called by insert(p,x)
#ifndef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus < 201103L
void void
_M_insert_aux(iterator __position, const value_type& __x); _M_insert_aux(iterator __position, const value_type& __x);
#else #else
@ -1350,7 +1350,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
this->_M_impl._M_finish = __pos; this->_M_impl._M_finish = __pos;
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
private: private:
// Constant-time move assignment when source object's memory can be // Constant-time move assignment when source object's memory can be
// moved, either because the source's allocator will move too // moved, either because the source's allocator will move too

4
libstdc++-v3/include/bits/streambuf_iterator.h
View file

@ -52,7 +52,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
class istreambuf_iterator class istreambuf_iterator
: public iterator<input_iterator_tag, _CharT, typename _Traits::off_type, : public iterator<input_iterator_tag, _CharT, typename _Traits::off_type,
_CharT*, _CharT*,
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
// LWG 445. // LWG 445.
_CharT> _CharT>
#else #else
@ -104,7 +104,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
_GLIBCXX_CONSTEXPR istreambuf_iterator() _GLIBCXX_USE_NOEXCEPT _GLIBCXX_CONSTEXPR istreambuf_iterator() _GLIBCXX_USE_NOEXCEPT
: _M_sbuf(0), _M_c(traits_type::eof()) { } : _M_sbuf(0), _M_c(traits_type::eof()) { }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
istreambuf_iterator(const istreambuf_iterator&) noexcept = default; istreambuf_iterator(const istreambuf_iterator&) noexcept = default;
~istreambuf_iterator() = default; ~istreambuf_iterator() = default;

2
libstdc++-v3/include/bits/stringfwd.h
View file

@ -70,7 +70,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
typedef basic_string<wchar_t> wstring; /// A string of @c wchar_t typedef basic_string<wchar_t> wstring; /// A string of @c wchar_t
#endif #endif
#if (defined(__GXX_EXPERIMENTAL_CXX0X__) \ #if ((__cplusplus >= 201103L) \
&& defined(_GLIBCXX_USE_C99_STDINT_TR1)) && defined(_GLIBCXX_USE_C99_STDINT_TR1))
template<> struct char_traits<char16_t>; template<> struct char_traits<char16_t>;

2
libstdc++-v3/include/bits/uses_allocator.h
View file

@ -25,7 +25,7 @@
#ifndef _USES_ALLOCATOR_H #ifndef _USES_ALLOCATOR_H
#define _USES_ALLOCATOR_H 1 #define _USES_ALLOCATOR_H 1
#ifndef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus < 201103L
# include <bits/c++0x_warning.h> # include <bits/c++0x_warning.h>
#else #else

24
libstdc++-v3/include/bits/vector.tcc
View file

@ -85,7 +85,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
} }
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _Tp, typename _Alloc> template<typename _Tp, typename _Alloc>
template<typename... _Args> template<typename... _Args>
void void
@ -117,7 +117,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
} }
else else
{ {
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
if (this->_M_impl._M_finish != this->_M_impl._M_end_of_storage) if (this->_M_impl._M_finish != this->_M_impl._M_end_of_storage)
{ {
_Tp __x_copy = __x; _Tp __x_copy = __x;
@ -163,7 +163,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
{ {
if (&__x != this) if (&__x != this)
{ {
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
if (_Alloc_traits::_S_propagate_on_copy_assign()) if (_Alloc_traits::_S_propagate_on_copy_assign())
{ {
if (!_Alloc_traits::_S_always_equal() if (!_Alloc_traits::_S_always_equal()
@ -285,7 +285,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
} }
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _Tp, typename _Alloc> template<typename _Tp, typename _Alloc>
template<typename... _Args> template<typename... _Args>
typename vector<_Tp, _Alloc>::iterator typename vector<_Tp, _Alloc>::iterator
@ -323,13 +323,13 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
_GLIBCXX_MOVE(*(this->_M_impl._M_finish _GLIBCXX_MOVE(*(this->_M_impl._M_finish
- 1))); - 1)));
++this->_M_impl._M_finish; ++this->_M_impl._M_finish;
#ifndef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus < 201103L
_Tp __x_copy = __x; _Tp __x_copy = __x;
#endif #endif
_GLIBCXX_MOVE_BACKWARD3(__position.base(), _GLIBCXX_MOVE_BACKWARD3(__position.base(),
this->_M_impl._M_finish - 2, this->_M_impl._M_finish - 2,
this->_M_impl._M_finish - 1); this->_M_impl._M_finish - 1);
#ifndef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus < 201103L
*__position = __x_copy; *__position = __x_copy;
#else #else
*__position = _Tp(std::forward<_Args>(__args)...); *__position = _Tp(std::forward<_Args>(__args)...);
@ -350,7 +350,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
// taking the element by const lvalue ref (see 23.1/13). // taking the element by const lvalue ref (see 23.1/13).
_Alloc_traits::construct(this->_M_impl, _Alloc_traits::construct(this->_M_impl,
__new_start + __elems_before, __new_start + __elems_before,
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
std::forward<_Args>(__args)...); std::forward<_Args>(__args)...);
#else #else
__x); __x);
@ -390,7 +390,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
} }
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _Tp, typename _Alloc> template<typename _Tp, typename _Alloc>
template<typename... _Args> template<typename... _Args>
void void
@ -524,7 +524,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
} }
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _Tp, typename _Alloc> template<typename _Tp, typename _Alloc>
void void
vector<_Tp, _Alloc>:: vector<_Tp, _Alloc>::
@ -788,7 +788,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
} }
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _Alloc> template<typename _Alloc>
bool bool
vector<bool, _Alloc>:: vector<bool, _Alloc>::
@ -809,7 +809,7 @@ _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
_GLIBCXX_END_NAMESPACE_CONTAINER _GLIBCXX_END_NAMESPACE_CONTAINER
} // namespace std } // namespace std
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
namespace std _GLIBCXX_VISIBILITY(default) namespace std _GLIBCXX_VISIBILITY(default)
{ {
@ -851,6 +851,6 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
_GLIBCXX_END_NAMESPACE_VERSION _GLIBCXX_END_NAMESPACE_VERSION
} // namespace std } // namespace std
#endif // __GXX_EXPERIMENTAL_CXX0X__ #endif // C++11
#endif /* _VECTOR_TCC */ #endif /* _VECTOR_TCC */

2
libstdc++-v3/include/c_compatibility/complex.h
View file

@ -28,7 +28,7 @@
#include <bits/c++config.h> #include <bits/c++config.h>
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
# include <ccomplex> # include <ccomplex>
#endif #endif

4
libstdc++-v3/include/c_compatibility/fenv.h
View file

@ -36,7 +36,7 @@
# include_next <fenv.h> # include_next <fenv.h>
#endif #endif
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
#if _GLIBCXX_USE_C99_FENV_TR1 #if _GLIBCXX_USE_C99_FENV_TR1
@ -76,6 +76,6 @@ namespace std
#endif // _GLIBCXX_USE_C99_FENV_TR1 #endif // _GLIBCXX_USE_C99_FENV_TR1
#endif // __GXX_EXPERIMENTAL_CXX0X__ #endif // C++11
#endif // _GLIBCXX_FENV_H #endif // _GLIBCXX_FENV_H

4
libstdc++-v3/include/c_compatibility/inttypes.h
View file

@ -33,7 +33,7 @@
#include <bits/c++config.h> #include <bits/c++config.h>
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
// For 8.11.1/1 (see C99, Note 184) // For 8.11.1/1 (see C99, Note 184)
# if _GLIBCXX_HAVE_INTTYPES_H # if _GLIBCXX_HAVE_INTTYPES_H
@ -86,6 +86,6 @@ namespace std
# include_next <inttypes.h> # include_next <inttypes.h>
# endif # endif
#endif // __GXX_EXPERIMENTAL_CXX0X__ #endif // C++11
#endif // _GLIBCXX_INTTYPES_H #endif // _GLIBCXX_INTTYPES_H

2
libstdc++-v3/include/c_compatibility/stdbool.h
View file

@ -28,7 +28,7 @@
#include <bits/c++config.h> #include <bits/c++config.h>
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
# include <cstdbool> # include <cstdbool>
#else #else
# if _GLIBCXX_HAVE_STDBOOL_H # if _GLIBCXX_HAVE_STDBOOL_H

4
libstdc++-v3/include/c_compatibility/stdint.h
View file

@ -33,7 +33,7 @@
#include <bits/c++config.h> #include <bits/c++config.h>
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
// For 8.22.1/1 (see C99, Notes 219, 220, 222) // For 8.22.1/1 (see C99, Notes 219, 220, 222)
# if _GLIBCXX_HAVE_STDINT_H # if _GLIBCXX_HAVE_STDINT_H
@ -105,6 +105,6 @@ namespace std
# include_next <stdint.h> # include_next <stdint.h>
# endif # endif
#endif // __GXX_EXPERIMENTAL_CXX0X__ #endif // C++11
#endif // _GLIBCXX_STDINT_H #endif // _GLIBCXX_STDINT_H

2
libstdc++-v3/include/c_compatibility/tgmath.h
View file

@ -28,7 +28,7 @@
#include <bits/c++config.h> #include <bits/c++config.h>
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
# include <ctgmath> # include <ctgmath>
#else #else
# if _GLIBCXX_HAVE_TGMATH_H # if _GLIBCXX_HAVE_TGMATH_H

2
libstdc++-v3/include/c_global/ccomplex
View file

@ -31,7 +31,7 @@
#ifndef _GLIBCXX_CCOMPLEX #ifndef _GLIBCXX_CCOMPLEX
#define _GLIBCXX_CCOMPLEX 1 #define _GLIBCXX_CCOMPLEX 1
#ifndef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus < 201103L
# include <bits/c++0x_warning.h> # include <bits/c++0x_warning.h>
#endif #endif

4
libstdc++-v3/include/c_global/cctype
View file

@ -78,7 +78,7 @@ namespace std
using ::toupper; using ::toupper;
} // namespace std } // namespace std
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
#ifdef _GLIBCXX_USE_C99_CTYPE_TR1 #ifdef _GLIBCXX_USE_C99_CTYPE_TR1
@ -91,6 +91,6 @@ namespace std
#endif // _GLIBCXX_USE_C99_CTYPE_TR1 #endif // _GLIBCXX_USE_C99_CTYPE_TR1
#endif // __GXX_EXPERIMENTAL_CXX0X__ #endif // C++11
#endif #endif

4
libstdc++-v3/include/c_global/cfenv
View file

@ -31,7 +31,7 @@
#pragma GCC system_header #pragma GCC system_header
#ifndef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus < 201103L
# include <bits/c++0x_warning.h> # include <bits/c++0x_warning.h>
#else #else
@ -79,6 +79,6 @@ namespace std
#endif // _GLIBCXX_USE_C99_FENV_TR1 #endif // _GLIBCXX_USE_C99_FENV_TR1
#endif // __GXX_EXPERIMENTAL_CXX0X__ #endif // C++11
#endif // _GLIBCXX_CFENV #endif // _GLIBCXX_CFENV

2
libstdc++-v3/include/c_global/cfloat
View file

@ -43,7 +43,7 @@
#ifndef _GLIBCXX_CFLOAT #ifndef _GLIBCXX_CFLOAT
#define _GLIBCXX_CFLOAT 1 #define _GLIBCXX_CFLOAT 1
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
# ifndef DECIMAL_DIG # ifndef DECIMAL_DIG
# define DECIMAL_DIG __DECIMAL_DIG__ # define DECIMAL_DIG __DECIMAL_DIG__
# endif # endif

4
libstdc++-v3/include/c_global/cinttypes
View file

@ -31,7 +31,7 @@
#pragma GCC system_header #pragma GCC system_header
#ifndef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus < 201103L
# include <bits/c++0x_warning.h> # include <bits/c++0x_warning.h>
#else #else
@ -76,6 +76,6 @@ namespace std
#endif // _GLIBCXX_USE_C99_INTTYPES_TR1 #endif // _GLIBCXX_USE_C99_INTTYPES_TR1
#endif // __GXX_EXPERIMENTAL_CXX0X__ #endif // C++11
#endif // _GLIBCXX_CINTTYPES #endif // _GLIBCXX_CINTTYPES

8
libstdc++-v3/include/c_global/cmath
View file

@ -413,7 +413,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
pow(long double __x, long double __y) pow(long double __x, long double __y)
{ return __builtin_powl(__x, __y); } { return __builtin_powl(__x, __y); }
#ifndef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus < 201103L
// _GLIBCXX_RESOLVE_LIB_DEFECTS // _GLIBCXX_RESOLVE_LIB_DEFECTS
// DR 550. What should the return type of pow(float,int) be? // DR 550. What should the return type of pow(float,int) be?
inline double inline double
@ -558,7 +558,7 @@ namespace std _GLIBCXX_VISIBILITY(default)
{ {
_GLIBCXX_BEGIN_NAMESPACE_VERSION _GLIBCXX_BEGIN_NAMESPACE_VERSION
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
constexpr int constexpr int
fpclassify(float __x) fpclassify(float __x)
{ return __builtin_fpclassify(FP_NAN, FP_INFINITE, FP_NORMAL, { return __builtin_fpclassify(FP_NAN, FP_INFINITE, FP_NORMAL,
@ -921,7 +921,7 @@ _GLIBCXX_END_NAMESPACE_VERSION
#endif /* _GLIBCXX_USE_C99_FP_MACROS_DYNAMIC */ #endif /* _GLIBCXX_USE_C99_FP_MACROS_DYNAMIC */
#endif #endif
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
#ifdef _GLIBCXX_USE_C99_MATH_TR1 #ifdef _GLIBCXX_USE_C99_MATH_TR1
@ -1682,6 +1682,6 @@ _GLIBCXX_END_NAMESPACE_VERSION
#endif // _GLIBCXX_USE_C99_MATH_TR1 #endif // _GLIBCXX_USE_C99_MATH_TR1
#endif // __GXX_EXPERIMENTAL_CXX0X__ #endif // C++11
#endif #endif

2
libstdc++-v3/include/c_global/cstdalign
View file

@ -31,7 +31,7 @@
#ifndef _GLIBCXX_CSTDALIGN #ifndef _GLIBCXX_CSTDALIGN
#define _GLIBCXX_CSTDALIGN 1 #define _GLIBCXX_CSTDALIGN 1
#ifndef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus < 201103L
# include <bits/c++0x_warning.h> # include <bits/c++0x_warning.h>
#else #else
# include <bits/c++config.h> # include <bits/c++config.h>

2
libstdc++-v3/include/c_global/cstdbool
View file

@ -31,7 +31,7 @@
#ifndef _GLIBCXX_CSTDBOOL #ifndef _GLIBCXX_CSTDBOOL
#define _GLIBCXX_CSTDBOOL 1 #define _GLIBCXX_CSTDBOOL 1
#ifndef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus < 201103L
# include <bits/c++0x_warning.h> # include <bits/c++0x_warning.h>
#else #else
# include <bits/c++config.h> # include <bits/c++config.h>

4
libstdc++-v3/include/c_global/cstdint
View file

@ -31,7 +31,7 @@
#pragma GCC system_header #pragma GCC system_header
#ifndef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus < 201103L
# include <bits/c++0x_warning.h> # include <bits/c++0x_warning.h>
#else #else
@ -84,6 +84,6 @@ namespace std
#endif // _GLIBCXX_USE_C99_STDINT_TR1 #endif // _GLIBCXX_USE_C99_STDINT_TR1
#endif // __GXX_EXPERIMENTAL_CXX0X__ #endif // C++11
#endif // _GLIBCXX_CSTDINT #endif // _GLIBCXX_CSTDINT

2
libstdc++-v3/include/c_global/ctgmath
View file

@ -31,7 +31,7 @@
#ifndef _GLIBCXX_CTGMATH #ifndef _GLIBCXX_CTGMATH
#define _GLIBCXX_CTGMATH 1 #define _GLIBCXX_CTGMATH 1
#ifndef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus < 201103L
# include <bits/c++0x_warning.h> # include <bits/c++0x_warning.h>
#else #else
# include <cmath> # include <cmath>

4
libstdc++-v3/include/c_global/cwchar
View file

@ -272,7 +272,7 @@ namespace std
#endif //_GLIBCXX_USE_WCHAR_T #endif //_GLIBCXX_USE_WCHAR_T
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
#ifdef _GLIBCXX_USE_WCHAR_T #ifdef _GLIBCXX_USE_WCHAR_T
@ -300,6 +300,6 @@ namespace std
#endif // _GLIBCXX_USE_WCHAR_T #endif // _GLIBCXX_USE_WCHAR_T
#endif // __GXX_EXPERIMENTAL_CXX0X__ #endif // C++11
#endif #endif

16
libstdc++-v3/include/debug/bitset
View file

@ -42,7 +42,7 @@ namespace __debug
template<size_t _Nb> template<size_t _Nb>
class bitset class bitset
: public _GLIBCXX_STD_C::bitset<_Nb> : public _GLIBCXX_STD_C::bitset<_Nb>
#ifndef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus < 201103L
, public __gnu_debug::_Safe_sequence_base , public __gnu_debug::_Safe_sequence_base
#endif #endif
{ {
@ -52,7 +52,7 @@ namespace __debug
// In C++0x we rely on normal reference type to preserve the property // In C++0x we rely on normal reference type to preserve the property
// of bitset to be use as a literal. // of bitset to be use as a literal.
// TODO: Find another solution. // TODO: Find another solution.
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
typedef typename _Base::reference reference; typedef typename _Base::reference reference;
#else #else
// bit reference: // bit reference:
@ -133,7 +133,7 @@ namespace __debug
_GLIBCXX_CONSTEXPR bitset() _GLIBCXX_NOEXCEPT _GLIBCXX_CONSTEXPR bitset() _GLIBCXX_NOEXCEPT
: _Base() { } : _Base() { }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
constexpr bitset(unsigned long long __val) noexcept constexpr bitset(unsigned long long __val) noexcept
#else #else
bitset(unsigned long __val) bitset(unsigned long __val)
@ -162,7 +162,7 @@ namespace __debug
bitset(const _Base& __x) : _Base(__x) { } bitset(const _Base& __x) : _Base(__x) { }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _CharT> template<typename _CharT>
explicit explicit
bitset(const _CharT* __str, bitset(const _CharT* __str,
@ -263,7 +263,7 @@ namespace __debug
operator[](size_t __pos) operator[](size_t __pos)
{ {
__glibcxx_check_subscript(__pos); __glibcxx_check_subscript(__pos);
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
return _M_base()[__pos]; return _M_base()[__pos];
#else #else
return reference(_M_base()[__pos], this); return reference(_M_base()[__pos], this);
@ -275,7 +275,7 @@ namespace __debug
_GLIBCXX_CONSTEXPR bool _GLIBCXX_CONSTEXPR bool
operator[](size_t __pos) const operator[](size_t __pos) const
{ {
#ifndef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus < 201103L
// TODO: Check in debug-mode too. // TODO: Check in debug-mode too.
__glibcxx_check_subscript(__pos); __glibcxx_check_subscript(__pos);
#endif #endif
@ -283,7 +283,7 @@ namespace __debug
} }
using _Base::to_ulong; using _Base::to_ulong;
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
using _Base::to_ullong; using _Base::to_ullong;
#endif #endif
@ -409,7 +409,7 @@ namespace __debug
} // namespace __debug } // namespace __debug
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
// DR 1182. // DR 1182.
/// std::hash specialization for bitset. /// std::hash specialization for bitset.
template<size_t _Nb> template<size_t _Nb>

24
libstdc++-v3/include/debug/deque
View file

@ -74,7 +74,7 @@ namespace __debug
deque(const _Allocator& __a = _Allocator()) deque(const _Allocator& __a = _Allocator())
: _Base(__a) { } : _Base(__a) { }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
explicit explicit
deque(size_type __n) deque(size_type __n)
: _Base(__n) { } : _Base(__n) { }
@ -89,7 +89,7 @@ namespace __debug
: _Base(__n, __value, __a) { } : _Base(__n, __value, __a) { }
#endif #endif
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<class _InputIterator, template<class _InputIterator,
typename = std::_RequireInputIter<_InputIterator>> typename = std::_RequireInputIter<_InputIterator>>
#else #else
@ -108,7 +108,7 @@ namespace __debug
deque(const _Base& __x) deque(const _Base& __x)
: _Base(__x) { } : _Base(__x) { }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
deque(deque&& __x) deque(deque&& __x)
: _Base(std::move(__x)) : _Base(std::move(__x))
{ this->_M_swap(__x); } { this->_M_swap(__x); }
@ -128,7 +128,7 @@ namespace __debug
return *this; return *this;
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
deque& deque&
operator=(deque&& __x) operator=(deque&& __x)
{ {
@ -149,7 +149,7 @@ namespace __debug
} }
#endif #endif
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<class _InputIterator, template<class _InputIterator,
typename = std::_RequireInputIter<_InputIterator>> typename = std::_RequireInputIter<_InputIterator>>
#else #else
@ -171,7 +171,7 @@ namespace __debug
this->_M_invalidate_all(); this->_M_invalidate_all();
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
void void
assign(initializer_list<value_type> __l) assign(initializer_list<value_type> __l)
{ {
@ -215,7 +215,7 @@ namespace __debug
rend() const _GLIBCXX_NOEXCEPT rend() const _GLIBCXX_NOEXCEPT
{ return const_reverse_iterator(begin()); } { return const_reverse_iterator(begin()); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
const_iterator const_iterator
cbegin() const noexcept cbegin() const noexcept
{ return const_iterator(_Base::begin(), this); } { return const_iterator(_Base::begin(), this); }
@ -246,7 +246,7 @@ namespace __debug
using _Base::size; using _Base::size;
using _Base::max_size; using _Base::max_size;
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
void void
resize(size_type __sz) resize(size_type __sz)
{ {
@ -287,7 +287,7 @@ namespace __debug
} }
#endif #endif
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
void void
shrink_to_fit() shrink_to_fit()
{ {
@ -358,7 +358,7 @@ namespace __debug
this->_M_invalidate_all(); this->_M_invalidate_all();
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
void void
push_front(_Tp&& __x) push_front(_Tp&& __x)
{ emplace_front(std::move(__x)); } { emplace_front(std::move(__x)); }
@ -404,7 +404,7 @@ namespace __debug
return iterator(__res, this); return iterator(__res, this);
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
iterator iterator
insert(iterator __position, _Tp&& __x) insert(iterator __position, _Tp&& __x)
{ return emplace(__position, std::move(__x)); } { return emplace(__position, std::move(__x)); }
@ -425,7 +425,7 @@ namespace __debug
this->_M_invalidate_all(); this->_M_invalidate_all();
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<class _InputIterator, template<class _InputIterator,
typename = std::_RequireInputIter<_InputIterator>> typename = std::_RequireInputIter<_InputIterator>>
#else #else

44
libstdc++-v3/include/debug/list
View file

@ -75,7 +75,7 @@ namespace __debug
list(const _Allocator& __a = _Allocator()) list(const _Allocator& __a = _Allocator())
: _Base(__a) { } : _Base(__a) { }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
explicit explicit
list(size_type __n) list(size_type __n)
: _Base(__n) { } : _Base(__n) { }
@ -90,7 +90,7 @@ namespace __debug
: _Base(__n, __value, __a) { } : _Base(__n, __value, __a) { }
#endif #endif
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<class _InputIterator, template<class _InputIterator,
typename = std::_RequireInputIter<_InputIterator>> typename = std::_RequireInputIter<_InputIterator>>
#else #else
@ -109,7 +109,7 @@ namespace __debug
list(const _Base& __x) list(const _Base& __x)
: _Base(__x) { } : _Base(__x) { }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
list(list&& __x) noexcept list(list&& __x) noexcept
: _Base(std::move(__x)) : _Base(std::move(__x))
{ this->_M_swap(__x); } { this->_M_swap(__x); }
@ -129,7 +129,7 @@ namespace __debug
return *this; return *this;
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
list& list&
operator=(list&& __x) operator=(list&& __x)
{ {
@ -157,7 +157,7 @@ namespace __debug
} }
#endif #endif
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<class _InputIterator, template<class _InputIterator,
typename = std::_RequireInputIter<_InputIterator>> typename = std::_RequireInputIter<_InputIterator>>
#else #else
@ -214,7 +214,7 @@ namespace __debug
rend() const _GLIBCXX_NOEXCEPT rend() const _GLIBCXX_NOEXCEPT
{ return const_reverse_iterator(begin()); } { return const_reverse_iterator(begin()); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
const_iterator const_iterator
cbegin() const noexcept cbegin() const noexcept
{ return const_iterator(_Base::begin(), this); } { return const_iterator(_Base::begin(), this); }
@ -237,7 +237,7 @@ namespace __debug
using _Base::size; using _Base::size;
using _Base::max_size; using _Base::max_size;
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
void void
resize(size_type __sz) resize(size_type __sz)
{ {
@ -352,7 +352,7 @@ namespace __debug
// 23.2.2.3 modifiers: // 23.2.2.3 modifiers:
using _Base::push_front; using _Base::push_front;
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
using _Base::emplace_front; using _Base::emplace_front;
#endif #endif
@ -366,7 +366,7 @@ namespace __debug
using _Base::push_back; using _Base::push_back;
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
using _Base::emplace_back; using _Base::emplace_back;
#endif #endif
@ -378,7 +378,7 @@ namespace __debug
_Base::pop_back(); _Base::pop_back();
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename... _Args> template<typename... _Args>
iterator iterator
emplace(iterator __position, _Args&&... __args) emplace(iterator __position, _Args&&... __args)
@ -396,7 +396,7 @@ namespace __debug
return iterator(_Base::insert(__position.base(), __x), this); return iterator(_Base::insert(__position.base(), __x), this);
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
iterator iterator
insert(iterator __position, _Tp&& __x) insert(iterator __position, _Tp&& __x)
{ return emplace(__position, std::move(__x)); } { return emplace(__position, std::move(__x)); }
@ -416,7 +416,7 @@ namespace __debug
_Base::insert(__position.base(), __n, __x); _Base::insert(__position.base(), __n, __x);
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<class _InputIterator, template<class _InputIterator,
typename = std::_RequireInputIter<_InputIterator>> typename = std::_RequireInputIter<_InputIterator>>
#else #else
@ -480,7 +480,7 @@ namespace __debug
// 23.2.2.4 list operations: // 23.2.2.4 list operations:
void void
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
splice(iterator __position, list&& __x) splice(iterator __position, list&& __x)
#else #else
splice(iterator __position, list& __x) splice(iterator __position, list& __x)
@ -493,14 +493,14 @@ namespace __debug
_Base::splice(__position.base(), _GLIBCXX_MOVE(__x._M_base())); _Base::splice(__position.base(), _GLIBCXX_MOVE(__x._M_base()));
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
void void
splice(iterator __position, list& __x) splice(iterator __position, list& __x)
{ splice(__position, std::move(__x)); } { splice(__position, std::move(__x)); }
#endif #endif
void void
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
splice(iterator __position, list&& __x, iterator __i) splice(iterator __position, list&& __x, iterator __i)
#else #else
splice(iterator __position, list& __x, iterator __i) splice(iterator __position, list& __x, iterator __i)
@ -525,14 +525,14 @@ namespace __debug
__i.base()); __i.base());
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
void void
splice(iterator __position, list& __x, iterator __i) splice(iterator __position, list& __x, iterator __i)
{ splice(__position, std::move(__x), __i); } { splice(__position, std::move(__x), __i); }
#endif #endif
void void
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
splice(iterator __position, list&& __x, iterator __first, splice(iterator __position, list&& __x, iterator __first,
iterator __last) iterator __last)
#else #else
@ -571,7 +571,7 @@ namespace __debug
__first.base(), __last.base()); __first.base(), __last.base());
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
void void
splice(iterator __position, list& __x, iterator __first, iterator __last) splice(iterator __position, list& __x, iterator __first, iterator __last)
{ splice(__position, std::move(__x), __first, __last); } { splice(__position, std::move(__x), __first, __last); }
@ -638,7 +638,7 @@ namespace __debug
} }
void void
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
merge(list&& __x) merge(list&& __x)
#else #else
merge(list& __x) merge(list& __x)
@ -655,7 +655,7 @@ namespace __debug
} }
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
void void
merge(list& __x) merge(list& __x)
{ merge(std::move(__x)); } { merge(std::move(__x)); }
@ -663,7 +663,7 @@ namespace __debug
template<class _Compare> template<class _Compare>
void void
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
merge(list&& __x, _Compare __comp) merge(list&& __x, _Compare __comp)
#else #else
merge(list& __x, _Compare __comp) merge(list& __x, _Compare __comp)
@ -682,7 +682,7 @@ namespace __debug
} }
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _Compare> template<typename _Compare>
void void
merge(list& __x, _Compare __comp) merge(list& __x, _Compare __comp)

20
libstdc++-v3/include/debug/map.h
View file

@ -92,7 +92,7 @@ namespace __debug
map(const _Base& __x) map(const _Base& __x)
: _Base(__x) { } : _Base(__x) { }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
map(map&& __x) map(map&& __x)
noexcept(is_nothrow_copy_constructible<_Compare>::value) noexcept(is_nothrow_copy_constructible<_Compare>::value)
: _Base(std::move(__x)) : _Base(std::move(__x))
@ -114,7 +114,7 @@ namespace __debug
return *this; return *this;
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
map& map&
operator=(map&& __x) operator=(map&& __x)
{ {
@ -172,7 +172,7 @@ namespace __debug
rend() const _GLIBCXX_NOEXCEPT rend() const _GLIBCXX_NOEXCEPT
{ return const_reverse_iterator(begin()); } { return const_reverse_iterator(begin()); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
const_iterator const_iterator
cbegin() const noexcept cbegin() const noexcept
{ return const_iterator(_Base::begin(), this); } { return const_iterator(_Base::begin(), this); }
@ -203,7 +203,7 @@ namespace __debug
using _Base::at; using _Base::at;
// modifiers: // modifiers:
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename... _Args> template<typename... _Args>
std::pair<iterator, bool> std::pair<iterator, bool>
emplace(_Args&&... __args) emplace(_Args&&... __args)
@ -232,7 +232,7 @@ namespace __debug
__res.second); __res.second);
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _Pair, typename = typename template<typename _Pair, typename = typename
std::enable_if<std::is_constructible<value_type, std::enable_if<std::is_constructible<value_type,
_Pair&&>::value>::type> _Pair&&>::value>::type>
@ -246,14 +246,14 @@ namespace __debug
} }
#endif #endif
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
void void
insert(std::initializer_list<value_type> __list) insert(std::initializer_list<value_type> __list)
{ _Base::insert(__list); } { _Base::insert(__list); }
#endif #endif
iterator iterator
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
insert(const_iterator __position, const value_type& __x) insert(const_iterator __position, const value_type& __x)
#else #else
insert(iterator __position, const value_type& __x) insert(iterator __position, const value_type& __x)
@ -263,7 +263,7 @@ namespace __debug
return iterator(_Base::insert(__position.base(), __x), this); return iterator(_Base::insert(__position.base(), __x), this);
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _Pair, typename = typename template<typename _Pair, typename = typename
std::enable_if<std::is_constructible<value_type, std::enable_if<std::is_constructible<value_type,
_Pair&&>::value>::type> _Pair&&>::value>::type>
@ -285,7 +285,7 @@ namespace __debug
__gnu_debug::__base(__last)); __gnu_debug::__base(__last));
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
iterator iterator
erase(const_iterator __position) erase(const_iterator __position)
{ {
@ -321,7 +321,7 @@ namespace __debug
} }
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
iterator iterator
erase(const_iterator __first, const_iterator __last) erase(const_iterator __first, const_iterator __last)
{ {

20
libstdc++-v3/include/debug/multimap.h
View file

@ -93,7 +93,7 @@ namespace __debug
multimap(const _Base& __x) multimap(const _Base& __x)
: _Base(__x) { } : _Base(__x) { }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
multimap(multimap&& __x) multimap(multimap&& __x)
noexcept(is_nothrow_copy_constructible<_Compare>::value) noexcept(is_nothrow_copy_constructible<_Compare>::value)
: _Base(std::move(__x)) : _Base(std::move(__x))
@ -115,7 +115,7 @@ namespace __debug
return *this; return *this;
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
multimap& multimap&
operator=(multimap&& __x) operator=(multimap&& __x)
{ {
@ -171,7 +171,7 @@ namespace __debug
rend() const _GLIBCXX_NOEXCEPT rend() const _GLIBCXX_NOEXCEPT
{ return const_reverse_iterator(begin()); } { return const_reverse_iterator(begin()); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
const_iterator const_iterator
cbegin() const noexcept cbegin() const noexcept
{ return const_iterator(_Base::begin(), this); } { return const_iterator(_Base::begin(), this); }
@ -195,7 +195,7 @@ namespace __debug
using _Base::max_size; using _Base::max_size;
// modifiers: // modifiers:
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename... _Args> template<typename... _Args>
iterator iterator
emplace(_Args&&... __args) emplace(_Args&&... __args)
@ -218,7 +218,7 @@ namespace __debug
insert(const value_type& __x) insert(const value_type& __x)
{ return iterator(_Base::insert(__x), this); } { return iterator(_Base::insert(__x), this); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _Pair, typename = typename template<typename _Pair, typename = typename
std::enable_if<std::is_constructible<value_type, std::enable_if<std::is_constructible<value_type,
_Pair&&>::value>::type> _Pair&&>::value>::type>
@ -227,14 +227,14 @@ namespace __debug
{ return iterator(_Base::insert(std::forward<_Pair>(__x)), this); } { return iterator(_Base::insert(std::forward<_Pair>(__x)), this); }
#endif #endif
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
void void
insert(std::initializer_list<value_type> __list) insert(std::initializer_list<value_type> __list)
{ _Base::insert(__list); } { _Base::insert(__list); }
#endif #endif
iterator iterator
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
insert(const_iterator __position, const value_type& __x) insert(const_iterator __position, const value_type& __x)
#else #else
insert(iterator __position, const value_type& __x) insert(iterator __position, const value_type& __x)
@ -244,7 +244,7 @@ namespace __debug
return iterator(_Base::insert(__position.base(), __x), this); return iterator(_Base::insert(__position.base(), __x), this);
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _Pair, typename = typename template<typename _Pair, typename = typename
std::enable_if<std::is_constructible<value_type, std::enable_if<std::is_constructible<value_type,
_Pair&&>::value>::type> _Pair&&>::value>::type>
@ -266,7 +266,7 @@ namespace __debug
__gnu_debug::__base(__last)); __gnu_debug::__base(__last));
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
iterator iterator
erase(const_iterator __position) erase(const_iterator __position)
{ {
@ -304,7 +304,7 @@ namespace __debug
return __count; return __count;
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
iterator iterator
erase(const_iterator __first, const_iterator __last) erase(const_iterator __first, const_iterator __last)
{ {

18
libstdc++-v3/include/debug/multiset.h
View file

@ -92,7 +92,7 @@ namespace __debug
multiset(const _Base& __x) multiset(const _Base& __x)
: _Base(__x) { } : _Base(__x) { }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
multiset(multiset&& __x) multiset(multiset&& __x)
noexcept(is_nothrow_copy_constructible<_Compare>::value) noexcept(is_nothrow_copy_constructible<_Compare>::value)
: _Base(std::move(__x)) : _Base(std::move(__x))
@ -114,7 +114,7 @@ namespace __debug
return *this; return *this;
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
multiset& multiset&
operator=(multiset&& __x) operator=(multiset&& __x)
{ {
@ -170,7 +170,7 @@ namespace __debug
rend() const _GLIBCXX_NOEXCEPT rend() const _GLIBCXX_NOEXCEPT
{ return const_reverse_iterator(begin()); } { return const_reverse_iterator(begin()); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
const_iterator const_iterator
cbegin() const noexcept cbegin() const noexcept
{ return const_iterator(_Base::begin(), this); } { return const_iterator(_Base::begin(), this); }
@ -194,7 +194,7 @@ namespace __debug
using _Base::max_size; using _Base::max_size;
// modifiers: // modifiers:
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename... _Args> template<typename... _Args>
iterator iterator
emplace(_Args&&... __args) emplace(_Args&&... __args)
@ -217,7 +217,7 @@ namespace __debug
insert(const value_type& __x) insert(const value_type& __x)
{ return iterator(_Base::insert(__x), this); } { return iterator(_Base::insert(__x), this); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
iterator iterator
insert(value_type&& __x) insert(value_type&& __x)
{ return iterator(_Base::insert(std::move(__x)), this); } { return iterator(_Base::insert(std::move(__x)), this); }
@ -230,7 +230,7 @@ namespace __debug
return iterator(_Base::insert(__position.base(), __x), this); return iterator(_Base::insert(__position.base(), __x), this);
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
iterator iterator
insert(const_iterator __position, value_type&& __x) insert(const_iterator __position, value_type&& __x)
{ {
@ -249,13 +249,13 @@ namespace __debug
__gnu_debug::__base(__last)); __gnu_debug::__base(__last));
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
void void
insert(initializer_list<value_type> __l) insert(initializer_list<value_type> __l)
{ _Base::insert(__l); } { _Base::insert(__l); }
#endif #endif
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
iterator iterator
erase(const_iterator __position) erase(const_iterator __position)
{ {
@ -289,7 +289,7 @@ namespace __debug
return __count; return __count;
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
iterator iterator
erase(const_iterator __first, const_iterator __last) erase(const_iterator __first, const_iterator __last)
{ {

4
libstdc++-v3/include/debug/safe_iterator.h
View file

@ -172,7 +172,7 @@ namespace __gnu_debug
._M_iterator(__x, "other")); ._M_iterator(__x, "other"));
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* @brief Move construction. * @brief Move construction.
* @post __x is singular and unattached * @post __x is singular and unattached
@ -229,7 +229,7 @@ namespace __gnu_debug
return *this; return *this;
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* @brief Move assignment. * @brief Move assignment.
* @post __x is singular and unattached * @post __x is singular and unattached

18
libstdc++-v3/include/debug/set.h
View file

@ -92,7 +92,7 @@ namespace __debug
set(const _Base& __x) set(const _Base& __x)
: _Base(__x) { } : _Base(__x) { }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
set(set&& __x) set(set&& __x)
noexcept(is_nothrow_copy_constructible<_Compare>::value) noexcept(is_nothrow_copy_constructible<_Compare>::value)
: _Base(std::move(__x)) : _Base(std::move(__x))
@ -114,7 +114,7 @@ namespace __debug
return *this; return *this;
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
set& set&
operator=(set&& __x) operator=(set&& __x)
{ {
@ -170,7 +170,7 @@ namespace __debug
rend() const _GLIBCXX_NOEXCEPT rend() const _GLIBCXX_NOEXCEPT
{ return const_reverse_iterator(begin()); } { return const_reverse_iterator(begin()); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
const_iterator const_iterator
cbegin() const noexcept cbegin() const noexcept
{ return const_iterator(_Base::begin(), this); } { return const_iterator(_Base::begin(), this); }
@ -194,7 +194,7 @@ namespace __debug
using _Base::max_size; using _Base::max_size;
// modifiers: // modifiers:
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename... _Args> template<typename... _Args>
std::pair<iterator, bool> std::pair<iterator, bool>
emplace(_Args&&... __args) emplace(_Args&&... __args)
@ -223,7 +223,7 @@ namespace __debug
__res.second); __res.second);
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
std::pair<iterator, bool> std::pair<iterator, bool>
insert(value_type&& __x) insert(value_type&& __x)
{ {
@ -241,7 +241,7 @@ namespace __debug
return iterator(_Base::insert(__position.base(), __x), this); return iterator(_Base::insert(__position.base(), __x), this);
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
iterator iterator
insert(const_iterator __position, value_type&& __x) insert(const_iterator __position, value_type&& __x)
{ {
@ -260,13 +260,13 @@ namespace __debug
__gnu_debug::__base(__last)); __gnu_debug::__base(__last));
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
void void
insert(initializer_list<value_type> __l) insert(initializer_list<value_type> __l)
{ _Base::insert(__l); } { _Base::insert(__l); }
#endif #endif
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
iterator iterator
erase(const_iterator __position) erase(const_iterator __position)
{ {
@ -298,7 +298,7 @@ namespace __debug
} }
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
iterator iterator
erase(const_iterator __first, const_iterator __last) erase(const_iterator __first, const_iterator __last)
{ {

38
libstdc++-v3/include/debug/string
View file

@ -113,7 +113,7 @@ namespace __gnu_debug
__gnu_debug::__base(__end), __a) __gnu_debug::__base(__end), __a)
{ } { }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
basic_string(basic_string&& __str) noexcept basic_string(basic_string&& __str) noexcept
: _Base(std::move(__str)) : _Base(std::move(__str))
{ } { }
@ -122,7 +122,7 @@ namespace __gnu_debug
const _Allocator& __a = _Allocator()) const _Allocator& __a = _Allocator())
: _Base(__l, __a) : _Base(__l, __a)
{ } { }
#endif // __GXX_EXPERIMENTAL_CXX0X__ #endif // C++11
~basic_string() _GLIBCXX_NOEXCEPT { } ~basic_string() _GLIBCXX_NOEXCEPT { }
@ -151,7 +151,7 @@ namespace __gnu_debug
return *this; return *this;
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
basic_string& basic_string&
operator=(basic_string&& __str) operator=(basic_string&& __str)
{ {
@ -168,7 +168,7 @@ namespace __gnu_debug
this->_M_invalidate_all(); this->_M_invalidate_all();
return *this; return *this;
} }
#endif // __GXX_EXPERIMENTAL_CXX0X__ #endif // C++11
// 21.3.2 iterators: // 21.3.2 iterators:
iterator iterator
@ -203,7 +203,7 @@ namespace __gnu_debug
rend() const _GLIBCXX_NOEXCEPT rend() const _GLIBCXX_NOEXCEPT
{ return const_reverse_iterator(begin()); } { return const_reverse_iterator(begin()); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
const_iterator const_iterator
cbegin() const noexcept cbegin() const noexcept
{ return const_iterator(_Base::begin(), this); } { return const_iterator(_Base::begin(), this); }
@ -237,7 +237,7 @@ namespace __gnu_debug
resize(size_type __n) resize(size_type __n)
{ this->resize(__n, _CharT()); } { this->resize(__n, _CharT()); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
void void
shrink_to_fit() shrink_to_fit()
{ {
@ -296,7 +296,7 @@ namespace __gnu_debug
using _Base::at; using _Base::at;
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
using _Base::front; using _Base::front;
using _Base::back; using _Base::back;
#endif #endif
@ -327,7 +327,7 @@ namespace __gnu_debug
return *this; return *this;
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
basic_string& basic_string&
operator+=(std::initializer_list<_CharT> __l) operator+=(std::initializer_list<_CharT> __l)
{ {
@ -335,7 +335,7 @@ namespace __gnu_debug
this->_M_invalidate_all(); this->_M_invalidate_all();
return *this; return *this;
} }
#endif // __GXX_EXPERIMENTAL_CXX0X__ #endif // C++11
basic_string& basic_string&
append(const basic_string& __str) append(const basic_string& __str)
@ -407,7 +407,7 @@ namespace __gnu_debug
return *this; return *this;
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
basic_string& basic_string&
assign(basic_string&& __x) assign(basic_string&& __x)
{ {
@ -415,7 +415,7 @@ namespace __gnu_debug
this->_M_invalidate_all(); this->_M_invalidate_all();
return *this; return *this;
} }
#endif // __GXX_EXPERIMENTAL_CXX0X__ #endif // C++11
basic_string& basic_string&
assign(const basic_string& __str, size_type __pos, size_type __n) assign(const basic_string& __str, size_type __pos, size_type __n)
@ -462,7 +462,7 @@ namespace __gnu_debug
return *this; return *this;
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
basic_string& basic_string&
assign(std::initializer_list<_CharT> __l) assign(std::initializer_list<_CharT> __l)
{ {
@ -470,7 +470,7 @@ namespace __gnu_debug
this->_M_invalidate_all(); this->_M_invalidate_all();
return *this; return *this;
} }
#endif // __GXX_EXPERIMENTAL_CXX0X__ #endif // C++11
basic_string& basic_string&
insert(size_type __pos1, const basic_string& __str) insert(size_type __pos1, const basic_string& __str)
@ -542,7 +542,7 @@ namespace __gnu_debug
this->_M_invalidate_all(); this->_M_invalidate_all();
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
void void
insert(iterator __p, std::initializer_list<_CharT> __l) insert(iterator __p, std::initializer_list<_CharT> __l)
{ {
@ -550,7 +550,7 @@ namespace __gnu_debug
_Base::insert(__p.base(), __l); _Base::insert(__p.base(), __l);
this->_M_invalidate_all(); this->_M_invalidate_all();
} }
#endif // __GXX_EXPERIMENTAL_CXX0X__ #endif // C++11
basic_string& basic_string&
erase(size_type __pos = 0, size_type __n = _Base::npos) erase(size_type __pos = 0, size_type __n = _Base::npos)
@ -581,7 +581,7 @@ namespace __gnu_debug
return iterator(__res, this); return iterator(__res, this);
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
void void
pop_back() pop_back()
{ {
@ -589,7 +589,7 @@ namespace __gnu_debug
_Base::pop_back(); _Base::pop_back();
this->_M_invalidate_all(); this->_M_invalidate_all();
} }
#endif // __GXX_EXPERIMENTAL_CXX0X__ #endif // C++11
basic_string& basic_string&
replace(size_type __pos1, size_type __n1, const basic_string& __str) replace(size_type __pos1, size_type __n1, const basic_string& __str)
@ -685,7 +685,7 @@ namespace __gnu_debug
return *this; return *this;
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
basic_string& replace(iterator __i1, iterator __i2, basic_string& replace(iterator __i1, iterator __i2,
std::initializer_list<_CharT> __l) std::initializer_list<_CharT> __l)
{ {
@ -694,7 +694,7 @@ namespace __gnu_debug
this->_M_invalidate_all(); this->_M_invalidate_all();
return *this; return *this;
} }
#endif // __GXX_EXPERIMENTAL_CXX0X__ #endif // C++11
size_type size_type
copy(_CharT* __s, size_type __n, size_type __pos = 0) const copy(_CharT* __s, size_type __n, size_type __pos = 0) const

4
libstdc++-v3/include/debug/unordered_map
View file

@ -30,7 +30,7 @@
#ifndef _GLIBCXX_DEBUG_UNORDERED_MAP #ifndef _GLIBCXX_DEBUG_UNORDERED_MAP
#define _GLIBCXX_DEBUG_UNORDERED_MAP 1 #define _GLIBCXX_DEBUG_UNORDERED_MAP 1
#ifndef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus < 201103L
# include <bits/c++0x_warning.h> # include <bits/c++0x_warning.h>
#else #else
# include <unordered_map> # include <unordered_map>
@ -941,6 +941,6 @@ namespace __debug
} // namespace __debug } // namespace __debug
} // namespace std } // namespace std
#endif // __GXX_EXPERIMENTAL_CXX0X__ #endif // C++11
#endif #endif

4
libstdc++-v3/include/debug/unordered_set
View file

@ -30,7 +30,7 @@
#ifndef _GLIBCXX_DEBUG_UNORDERED_SET #ifndef _GLIBCXX_DEBUG_UNORDERED_SET
#define _GLIBCXX_DEBUG_UNORDERED_SET 1 #define _GLIBCXX_DEBUG_UNORDERED_SET 1
#ifndef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus < 201103L
# include <bits/c++0x_warning.h> # include <bits/c++0x_warning.h>
#else #else
# include <unordered_set> # include <unordered_set>
@ -923,6 +923,6 @@ namespace __debug
} // namespace __debug } // namespace __debug
} // namespace std } // namespace std
#endif // __GXX_EXPERIMENTAL_CXX0X__ #endif // C++11
#endif #endif

34
libstdc++-v3/include/debug/vector
View file

@ -53,7 +53,7 @@ namespace __debug
typedef typename _Base::const_iterator _Base_const_iterator; typedef typename _Base::const_iterator _Base_const_iterator;
typedef __gnu_debug::_Equal_to<_Base_const_iterator> _Equal; typedef __gnu_debug::_Equal_to<_Base_const_iterator> _Equal;
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
typedef __gnu_cxx::__alloc_traits<_Allocator> _Alloc_traits; typedef __gnu_cxx::__alloc_traits<_Allocator> _Alloc_traits;
#endif #endif
@ -81,7 +81,7 @@ namespace __debug
vector(const _Allocator& __a = _Allocator()) vector(const _Allocator& __a = _Allocator())
: _Base(__a), _M_guaranteed_capacity(0) { } : _Base(__a), _M_guaranteed_capacity(0) { }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
explicit explicit
vector(size_type __n, const _Allocator& __a = _Allocator()) vector(size_type __n, const _Allocator& __a = _Allocator())
: _Base(__n, __a), _M_guaranteed_capacity(__n) { } : _Base(__n, __a), _M_guaranteed_capacity(__n) { }
@ -96,7 +96,7 @@ namespace __debug
: _Base(__n, __value, __a), _M_guaranteed_capacity(__n) { } : _Base(__n, __value, __a), _M_guaranteed_capacity(__n) { }
#endif #endif
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<class _InputIterator, template<class _InputIterator,
typename = std::_RequireInputIter<_InputIterator>> typename = std::_RequireInputIter<_InputIterator>>
#else #else
@ -117,7 +117,7 @@ namespace __debug
vector(const _Base& __x) vector(const _Base& __x)
: _Base(__x), _M_guaranteed_capacity(__x.size()) { } : _Base(__x), _M_guaranteed_capacity(__x.size()) { }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
vector(vector&& __x) noexcept vector(vector&& __x) noexcept
: _Base(std::move(__x)), : _Base(std::move(__x)),
_M_guaranteed_capacity(this->size()) _M_guaranteed_capacity(this->size())
@ -154,7 +154,7 @@ namespace __debug
return *this; return *this;
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
vector& vector&
operator=(vector&& __x) noexcept(_Alloc_traits::_S_nothrow_move()) operator=(vector&& __x) noexcept(_Alloc_traits::_S_nothrow_move())
{ {
@ -177,7 +177,7 @@ namespace __debug
} }
#endif #endif
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _InputIterator, template<typename _InputIterator,
typename = std::_RequireInputIter<_InputIterator>> typename = std::_RequireInputIter<_InputIterator>>
#else #else
@ -201,7 +201,7 @@ namespace __debug
_M_update_guaranteed_capacity(); _M_update_guaranteed_capacity();
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
void void
assign(initializer_list<value_type> __l) assign(initializer_list<value_type> __l)
{ {
@ -246,7 +246,7 @@ namespace __debug
rend() const _GLIBCXX_NOEXCEPT rend() const _GLIBCXX_NOEXCEPT
{ return const_reverse_iterator(begin()); } { return const_reverse_iterator(begin()); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
const_iterator const_iterator
cbegin() const noexcept cbegin() const noexcept
{ return const_iterator(_Base::begin(), this); } { return const_iterator(_Base::begin(), this); }
@ -268,7 +268,7 @@ namespace __debug
using _Base::size; using _Base::size;
using _Base::max_size; using _Base::max_size;
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
void void
resize(size_type __sz) resize(size_type __sz)
{ {
@ -306,7 +306,7 @@ namespace __debug
} }
#endif #endif
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
void void
shrink_to_fit() shrink_to_fit()
{ {
@ -401,7 +401,7 @@ namespace __debug
_M_update_guaranteed_capacity(); _M_update_guaranteed_capacity();
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _Up = _Tp> template<typename _Up = _Tp>
typename __gnu_cxx::__enable_if<!std::__are_same<_Up, bool>::__value, typename __gnu_cxx::__enable_if<!std::__are_same<_Up, bool>::__value,
void>::__type void>::__type
@ -428,7 +428,7 @@ namespace __debug
_Base::pop_back(); _Base::pop_back();
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename... _Args> template<typename... _Args>
iterator iterator
emplace(iterator __position, _Args&&... __args) emplace(iterator __position, _Args&&... __args)
@ -462,7 +462,7 @@ namespace __debug
return iterator(__res, this); return iterator(__res, this);
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _Up = _Tp> template<typename _Up = _Tp>
typename __gnu_cxx::__enable_if<!std::__are_same<_Up, bool>::__value, typename __gnu_cxx::__enable_if<!std::__are_same<_Up, bool>::__value,
iterator>::__type iterator>::__type
@ -488,7 +488,7 @@ namespace __debug
_M_update_guaranteed_capacity(); _M_update_guaranteed_capacity();
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<class _InputIterator, template<class _InputIterator,
typename = std::_RequireInputIter<_InputIterator>> typename = std::_RequireInputIter<_InputIterator>>
#else #else
@ -546,11 +546,11 @@ namespace __debug
void void
swap(vector& __x) swap(vector& __x)
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
noexcept(_Alloc_traits::_S_nothrow_swap()) noexcept(_Alloc_traits::_S_nothrow_swap())
#endif #endif
{ {
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
if (!_Alloc_traits::_S_propagate_on_swap()) if (!_Alloc_traits::_S_propagate_on_swap())
__glibcxx_check_equal_allocs(__x); __glibcxx_check_equal_allocs(__x);
#endif #endif
@ -638,7 +638,7 @@ namespace __debug
} // namespace __debug } // namespace __debug
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
// DR 1182. // DR 1182.
/// std::hash specialization for vector<bool>. /// std::hash specialization for vector<bool>.
template<typename _Alloc> template<typename _Alloc>

6
libstdc++-v3/include/ext/algorithm
View file

@ -427,7 +427,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
__out_last - __out_first); __out_last - __out_first);
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
using std::is_heap; using std::is_heap;
#else #else
/** /**
@ -471,7 +471,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
} }
#endif #endif
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
using std::is_sorted; using std::is_sorted;
#else #else
// is_sorted, a predicated testing whether a range is sorted in // is_sorted, a predicated testing whether a range is sorted in
@ -529,7 +529,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
return false; return false;
return true; return true;
} }
#endif // __GXX_EXPERIMENTAL_CXX0X__ #endif // C++11
/** /**
* @brief Find the median of three values. * @brief Find the median of three values.

8
libstdc++-v3/include/ext/alloc_traits.h
View file

@ -31,7 +31,7 @@
#pragma GCC system_header #pragma GCC system_header
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
# include <bits/alloc_traits.h> # include <bits/alloc_traits.h>
#else #else
# include <bits/allocator.h> // for __alloc_swap # include <bits/allocator.h> // for __alloc_swap
@ -48,7 +48,7 @@ namespace __gnu_cxx _GLIBCXX_VISIBILITY(default)
{ {
_GLIBCXX_BEGIN_NAMESPACE_VERSION _GLIBCXX_BEGIN_NAMESPACE_VERSION
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _Alloc> template<typename _Alloc>
struct __allocator_always_compares_equal struct __allocator_always_compares_equal
{ static const bool value = false; }; { static const bool value = false; };
@ -107,12 +107,12 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
*/ */
template<typename _Alloc> template<typename _Alloc>
struct __alloc_traits struct __alloc_traits
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
: std::allocator_traits<_Alloc> : std::allocator_traits<_Alloc>
#endif #endif
{ {
typedef _Alloc allocator_type; typedef _Alloc allocator_type;
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
typedef std::allocator_traits<_Alloc> _Base_type; typedef std::allocator_traits<_Alloc> _Base_type;
typedef typename _Base_type::value_type value_type; typedef typename _Base_type::value_type value_type;
typedef typename _Base_type::pointer pointer; typedef typename _Base_type::pointer pointer;

2
libstdc++-v3/include/ext/array_allocator.h
View file

@ -74,7 +74,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
max_size() const _GLIBCXX_USE_NOEXCEPT max_size() const _GLIBCXX_USE_NOEXCEPT
{ return size_t(-1) / sizeof(_Tp); } { return size_t(-1) / sizeof(_Tp); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _Up, typename... _Args> template<typename _Up, typename... _Args>
void void
construct(_Up* __p, _Args&&... __args) construct(_Up* __p, _Args&&... __args)

2
libstdc++-v3/include/ext/bitmap_allocator.h
View file

@ -1050,7 +1050,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
max_size() const _GLIBCXX_USE_NOEXCEPT max_size() const _GLIBCXX_USE_NOEXCEPT
{ return size_type(-1) / sizeof(value_type); } { return size_type(-1) / sizeof(value_type); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _Up, typename... _Args> template<typename _Up, typename... _Args>
void void
construct(_Up* __p, _Args&&... __args) construct(_Up* __p, _Args&&... __args)

2
libstdc++-v3/include/ext/extptr_allocator.h
View file

@ -101,7 +101,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
size_type max_size() const _GLIBCXX_USE_NOEXCEPT size_type max_size() const _GLIBCXX_USE_NOEXCEPT
{ return __numeric_traits<size_type>::__max / sizeof(_Tp); } { return __numeric_traits<size_type>::__max / sizeof(_Tp); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _Up, typename... _Args> template<typename _Up, typename... _Args>
void void
construct(_Up* __p, _Args&&... __args) construct(_Up* __p, _Args&&... __args)

2
libstdc++-v3/include/ext/malloc_allocator.h
View file

@ -108,7 +108,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
max_size() const _GLIBCXX_USE_NOEXCEPT max_size() const _GLIBCXX_USE_NOEXCEPT
{ return size_t(-1) / sizeof(_Tp); } { return size_t(-1) / sizeof(_Tp); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _Up, typename... _Args> template<typename _Up, typename... _Args>
void void
construct(_Up* __p, _Args&&... __args) construct(_Up* __p, _Args&&... __args)

2
libstdc++-v3/include/ext/mt_allocator.h
View file

@ -588,7 +588,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
max_size() const _GLIBCXX_USE_NOEXCEPT max_size() const _GLIBCXX_USE_NOEXCEPT
{ return size_t(-1) / sizeof(_Tp); } { return size_t(-1) / sizeof(_Tp); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _Up, typename... _Args> template<typename _Up, typename... _Args>
void void
construct(_Up* __p, _Args&&... __args) construct(_Up* __p, _Args&&... __args)

2
libstdc++-v3/include/ext/new_allocator.h
View file

@ -105,7 +105,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
max_size() const _GLIBCXX_USE_NOEXCEPT max_size() const _GLIBCXX_USE_NOEXCEPT
{ return size_t(-1) / sizeof(_Tp); } { return size_t(-1) / sizeof(_Tp); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _Up, typename... _Args> template<typename _Up, typename... _Args>
void void
construct(_Up* __p, _Args&&... __args) construct(_Up* __p, _Args&&... __args)

4
libstdc++-v3/include/ext/numeric
View file

@ -123,7 +123,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
power(_Tp __x, _Integer __n) power(_Tp __x, _Integer __n)
{ return __power(__x, __n); } { return __power(__x, __n); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
using std::iota; using std::iota;
#else #else
/** /**
@ -144,7 +144,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
while (__first != __last) while (__first != __last)
*__first++ = __value++; *__first++ = __value++;
} }
#endif // __GXX_EXPERIMENTAL_CXX0X__ #endif // C++11
_GLIBCXX_END_NAMESPACE_VERSION _GLIBCXX_END_NAMESPACE_VERSION
} // namespace } // namespace

2
libstdc++-v3/include/ext/pb_ds/detail/type_utils.hpp
View file

@ -132,7 +132,7 @@ namespace __gnu_pbds
}; };
// Use C++0x's static_assert if possible. // Use C++0x's static_assert if possible.
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
#define PB_DS_STATIC_ASSERT(UNIQUE, E) static_assert(E, #UNIQUE) #define PB_DS_STATIC_ASSERT(UNIQUE, E) static_assert(E, #UNIQUE)
#else #else
template<bool> template<bool>

4
libstdc++-v3/include/ext/pointer.h
View file

@ -42,7 +42,7 @@
#include <bits/stl_iterator_base_types.h> #include <bits/stl_iterator_base_types.h>
#include <ext/cast.h> #include <ext/cast.h>
#include <ext/type_traits.h> #include <ext/type_traits.h>
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
# include <bits/ptr_traits.h> # include <bits/ptr_traits.h>
#endif #endif
@ -562,7 +562,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
_GLIBCXX_END_NAMESPACE_VERSION _GLIBCXX_END_NAMESPACE_VERSION
} // namespace } // namespace
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
namespace std _GLIBCXX_VISIBILITY(default) namespace std _GLIBCXX_VISIBILITY(default)
{ {
_GLIBCXX_BEGIN_NAMESPACE_VERSION _GLIBCXX_BEGIN_NAMESPACE_VERSION

2
libstdc++-v3/include/ext/pool_allocator.h
View file

@ -161,7 +161,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
max_size() const _GLIBCXX_USE_NOEXCEPT max_size() const _GLIBCXX_USE_NOEXCEPT
{ return size_t(-1) / sizeof(_Tp); } { return size_t(-1) / sizeof(_Tp); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _Up, typename... _Args> template<typename _Up, typename... _Args>
void void
construct(_Up* __p, _Args&&... __args) construct(_Up* __p, _Args&&... __args)

4
libstdc++-v3/include/ext/random
View file

@ -31,7 +31,7 @@
#pragma GCC system_header #pragma GCC system_header
#ifndef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus < 201103L
# include <bits/c++0x_warning.h> # include <bits/c++0x_warning.h>
#else #else
@ -2330,6 +2330,6 @@ _GLIBCXX_END_NAMESPACE_VERSION
#endif // _GLIBCXX_USE_C99_STDINT_TR1 #endif // _GLIBCXX_USE_C99_STDINT_TR1
#endif // __GXX_EXPERIMENTAL_CXX0X__ #endif // C++11
#endif // _EXT_RANDOM #endif // _EXT_RANDOM

2
libstdc++-v3/include/ext/rc_string_base.h
View file

@ -314,7 +314,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
__rc_string_base(const __rc_string_base& __rcs); __rc_string_base(const __rc_string_base& __rcs);
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
__rc_string_base(__rc_string_base&& __rcs) __rc_string_base(__rc_string_base&& __rcs)
: _M_dataplus(__rcs._M_dataplus) : _M_dataplus(__rcs._M_dataplus)
{ __rcs._M_data(_S_empty_rep._M_refcopy()); } { __rcs._M_data(_S_empty_rep._M_refcopy()); }

4
libstdc++-v3/include/ext/sso_string_base.h
View file

@ -183,7 +183,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
__sso_string_base(const __sso_string_base& __rcs); __sso_string_base(const __sso_string_base& __rcs);
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
__sso_string_base(__sso_string_base&& __rcs); __sso_string_base(__sso_string_base&& __rcs);
#endif #endif
@ -344,7 +344,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
: _M_dataplus(__rcs._M_get_allocator(), _M_local_data) : _M_dataplus(__rcs._M_get_allocator(), _M_local_data)
{ _M_construct(__rcs._M_data(), __rcs._M_data() + __rcs._M_length()); } { _M_construct(__rcs._M_data(), __rcs._M_data() + __rcs._M_length()); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _CharT, typename _Traits, typename _Alloc> template<typename _CharT, typename _Traits, typename _Alloc>
__sso_string_base<_CharT, _Traits, _Alloc>:: __sso_string_base<_CharT, _Traits, _Alloc>::
__sso_string_base(__sso_string_base&& __rcs) __sso_string_base(__sso_string_base&& __rcs)

22
libstdc++-v3/include/ext/throw_allocator.h
View file

@ -55,7 +55,7 @@
#include <utility> #include <utility>
#include <bits/functexcept.h> #include <bits/functexcept.h>
#include <bits/move.h> #include <bits/move.h>
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
# include <functional> # include <functional>
# include <random> # include <random>
#else #else
@ -385,7 +385,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
{ engine().seed(__s); } { engine().seed(__s); }
private: private:
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
typedef std::uniform_real_distribution<double> distribution_type; typedef std::uniform_real_distribution<double> distribution_type;
typedef std::mt19937 engine_type; typedef std::mt19937 engine_type;
#else #else
@ -396,7 +396,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
static double static double
generate() generate()
{ {
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
const distribution_type distribution(0, 1); const distribution_type distribution(0, 1);
static auto generator = std::bind(distribution, engine()); static auto generator = std::bind(distribution, engine());
#else #else
@ -459,7 +459,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
throw_value_base(const throw_value_base& __v) : _M_i(__v._M_i) throw_value_base(const throw_value_base& __v) : _M_i(__v._M_i)
{ throw_conditionally(); } { throw_conditionally(); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
// Shall not throw. // Shall not throw.
throw_value_base(throw_value_base&&) = default; throw_value_base(throw_value_base&&) = default;
#endif #endif
@ -476,7 +476,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
return *this; return *this;
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
// Shall not throw. // Shall not throw.
throw_value_base& throw_value_base&
operator=(throw_value_base&&) = default; operator=(throw_value_base&&) = default;
@ -571,7 +571,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
throw_value_limit(const throw_value_limit& __other) throw_value_limit(const throw_value_limit& __other)
: base_type(__other._M_i) { } : base_type(__other._M_i) { }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
throw_value_limit(throw_value_limit&&) = default; throw_value_limit(throw_value_limit&&) = default;
#endif #endif
@ -585,7 +585,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
return *this; return *this;
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
throw_value_limit& throw_value_limit&
operator=(throw_value_limit&&) = default; operator=(throw_value_limit&&) = default;
#endif #endif
@ -602,7 +602,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
throw_value_random(const throw_value_random& __other) throw_value_random(const throw_value_random& __other)
: base_type(__other._M_i) { } : base_type(__other._M_i) { }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
throw_value_random(throw_value_random&&) = default; throw_value_random(throw_value_random&&) = default;
#endif #endif
@ -616,7 +616,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
return *this; return *this;
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
throw_value_random& throw_value_random&
operator=(throw_value_random&&) = default; operator=(throw_value_random&&) = default;
#endif #endif
@ -675,7 +675,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
return a; return a;
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _Up, typename... _Args> template<typename _Up, typename... _Args>
void void
construct(_Up* __p, _Args&&... __args) construct(_Up* __p, _Args&&... __args)
@ -771,7 +771,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
_GLIBCXX_END_NAMESPACE_VERSION _GLIBCXX_END_NAMESPACE_VERSION
} // namespace } // namespace
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
# include <bits/functional_hash.h> # include <bits/functional_hash.h>

58
libstdc++-v3/include/ext/vstring.h
View file

@ -32,7 +32,7 @@
#pragma GCC system_header #pragma GCC system_header
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
#include <initializer_list> #include <initializer_list>
#endif #endif
@ -150,7 +150,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
__versa_string(const __versa_string& __str) __versa_string(const __versa_string& __str)
: __vstring_base(__str) { } : __vstring_base(__str) { }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* @brief String move constructor. * @brief String move constructor.
* @param __str Source string. * @param __str Source string.
@ -238,7 +238,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
* @param __end End of range. * @param __end End of range.
* @param __a Allocator to use (default is default allocator). * @param __a Allocator to use (default is default allocator).
*/ */
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<class _InputIterator, template<class _InputIterator,
typename = std::_RequireInputIter<_InputIterator>> typename = std::_RequireInputIter<_InputIterator>>
#else #else
@ -261,7 +261,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
operator=(const __versa_string& __str) operator=(const __versa_string& __str)
{ return this->assign(__str); } { return this->assign(__str); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* @brief String move assignment operator. * @brief String move assignment operator.
* @param __str Source string. * @param __str Source string.
@ -386,7 +386,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
rend() const _GLIBCXX_NOEXCEPT rend() const _GLIBCXX_NOEXCEPT
{ return const_reverse_iterator(this->begin()); } { return const_reverse_iterator(this->begin()); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* Returns a read-only (constant) iterator that points to the first * Returns a read-only (constant) iterator that points to the first
* character in the %string. * character in the %string.
@ -468,7 +468,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
resize(size_type __n) resize(size_type __n)
{ this->resize(__n, _CharT()); } { this->resize(__n, _CharT()); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/// A non-binding request to reduce capacity() to size(). /// A non-binding request to reduce capacity() to size().
void void
shrink_to_fit() shrink_to_fit()
@ -604,7 +604,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
return this->_M_data()[__n]; return this->_M_data()[__n];
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* Returns a read/write reference to the data at the first * Returns a read/write reference to the data at the first
* element of the %string. * element of the %string.
@ -669,7 +669,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
return *this; return *this;
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* @brief Append an initializer_list of characters. * @brief Append an initializer_list of characters.
* @param __l The initializer_list of characters to be appended. * @param __l The initializer_list of characters to be appended.
@ -678,7 +678,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
__versa_string& __versa_string&
operator+=(std::initializer_list<_CharT> __l) operator+=(std::initializer_list<_CharT> __l)
{ return this->append(__l.begin(), __l.end()); } { return this->append(__l.begin(), __l.end()); }
#endif // __GXX_EXPERIMENTAL_CXX0X__ #endif // C++11
/** /**
* @brief Append a string to this string. * @brief Append a string to this string.
@ -748,7 +748,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
append(size_type __n, _CharT __c) append(size_type __n, _CharT __c)
{ return _M_replace_aux(this->size(), size_type(0), __n, __c); } { return _M_replace_aux(this->size(), size_type(0), __n, __c); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* @brief Append an initializer_list of characters. * @brief Append an initializer_list of characters.
* @param __l The initializer_list of characters to append. * @param __l The initializer_list of characters to append.
@ -757,7 +757,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
__versa_string& __versa_string&
append(std::initializer_list<_CharT> __l) append(std::initializer_list<_CharT> __l)
{ return this->append(__l.begin(), __l.end()); } { return this->append(__l.begin(), __l.end()); }
#endif // __GXX_EXPERIMENTAL_CXX0X__ #endif // C++11
/** /**
* @brief Append a range of characters. * @brief Append a range of characters.
@ -767,7 +767,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
* *
* Appends characters in the range [first,last) to this string. * Appends characters in the range [first,last) to this string.
*/ */
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<class _InputIterator, template<class _InputIterator,
typename = std::_RequireInputIter<_InputIterator>> typename = std::_RequireInputIter<_InputIterator>>
#else #else
@ -803,7 +803,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
return *this; return *this;
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* @brief Set value to contents of another string. * @brief Set value to contents of another string.
* @param __str Source string to use. * @param __str Source string to use.
@ -818,7 +818,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
this->swap(__str); this->swap(__str);
return *this; return *this;
} }
#endif // __GXX_EXPERIMENTAL_CXX0X__ #endif // C++11
/** /**
* @brief Set value to a substring of a string. * @brief Set value to a substring of a string.
@ -896,7 +896,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
* Sets value of string to characters in the range * Sets value of string to characters in the range
* [first,last). * [first,last).
*/ */
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<class _InputIterator, template<class _InputIterator,
typename = std::_RequireInputIter<_InputIterator>> typename = std::_RequireInputIter<_InputIterator>>
#else #else
@ -906,7 +906,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
assign(_InputIterator __first, _InputIterator __last) assign(_InputIterator __first, _InputIterator __last)
{ return this->replace(_M_ibegin(), _M_iend(), __first, __last); } { return this->replace(_M_ibegin(), _M_iend(), __first, __last); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* @brief Set value to an initializer_list of characters. * @brief Set value to an initializer_list of characters.
* @param __l The initializer_list of characters to assign. * @param __l The initializer_list of characters to assign.
@ -915,7 +915,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
__versa_string& __versa_string&
assign(std::initializer_list<_CharT> __l) assign(std::initializer_list<_CharT> __l)
{ return this->assign(__l.begin(), __l.end()); } { return this->assign(__l.begin(), __l.end()); }
#endif // __GXX_EXPERIMENTAL_CXX0X__ #endif // C++11
/** /**
* @brief Insert multiple characters. * @brief Insert multiple characters.
@ -946,7 +946,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
* thrown. The value of the string doesn't change if an error * thrown. The value of the string doesn't change if an error
* is thrown. * is thrown.
*/ */
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<class _InputIterator, template<class _InputIterator,
typename = std::_RequireInputIter<_InputIterator>> typename = std::_RequireInputIter<_InputIterator>>
#else #else
@ -956,7 +956,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
insert(iterator __p, _InputIterator __beg, _InputIterator __end) insert(iterator __p, _InputIterator __beg, _InputIterator __end)
{ this->replace(__p, __p, __beg, __end); } { this->replace(__p, __p, __beg, __end); }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* @brief Insert an initializer_list of characters. * @brief Insert an initializer_list of characters.
* @param __p Iterator referencing location in string to insert at. * @param __p Iterator referencing location in string to insert at.
@ -966,7 +966,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
void void
insert(iterator __p, std::initializer_list<_CharT> __l) insert(iterator __p, std::initializer_list<_CharT> __l)
{ this->insert(__p, __l.begin(), __l.end()); } { this->insert(__p, __l.begin(), __l.end()); }
#endif // __GXX_EXPERIMENTAL_CXX0X__ #endif // C++11
/** /**
* @brief Insert value of a string. * @brief Insert value of a string.
@ -1160,7 +1160,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
return iterator(this->_M_data() + __pos); return iterator(this->_M_data() + __pos);
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* @brief Remove the last character. * @brief Remove the last character.
* *
@ -1169,7 +1169,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
void void
pop_back() pop_back()
{ this->_M_erase(size()-1, 1); } { this->_M_erase(size()-1, 1); }
#endif // __GXX_EXPERIMENTAL_CXX0X__ #endif // C++11
/** /**
* @brief Replace characters with value from another string. * @brief Replace characters with value from another string.
@ -1387,7 +1387,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
* of result exceeds max_size(), length_error is thrown. The * of result exceeds max_size(), length_error is thrown. The
* value of the string doesn't change if an error is thrown. * value of the string doesn't change if an error is thrown.
*/ */
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<class _InputIterator, template<class _InputIterator,
typename = std::_RequireInputIter<_InputIterator>> typename = std::_RequireInputIter<_InputIterator>>
__versa_string& __versa_string&
@ -1458,7 +1458,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
__k1.base(), __k2 - __k1); __k1.base(), __k2 - __k1);
} }
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
/** /**
* @brief Replace range of characters with initializer_list. * @brief Replace range of characters with initializer_list.
* @param __i1 Iterator referencing start of range to replace. * @param __i1 Iterator referencing start of range to replace.
@ -1475,7 +1475,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
__versa_string& replace(iterator __i1, iterator __i2, __versa_string& replace(iterator __i1, iterator __i2,
std::initializer_list<_CharT> __l) std::initializer_list<_CharT> __l)
{ return this->replace(__i1, __i2, __l.begin(), __l.end()); } { return this->replace(__i1, __i2, __l.begin(), __l.end()); }
#endif // __GXX_EXPERIMENTAL_CXX0X__ #endif // C++11
private: private:
template<class _Integer> template<class _Integer>
@ -2159,7 +2159,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
operator+(const __versa_string<_CharT, _Traits, _Alloc, _Base>& __lhs, operator+(const __versa_string<_CharT, _Traits, _Alloc, _Base>& __lhs,
_CharT __rhs); _CharT __rhs);
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
template<typename _CharT, typename _Traits, typename _Alloc, template<typename _CharT, typename _Traits, typename _Alloc,
template <typename, typename, typename> class _Base> template <typename, typename, typename> class _Base>
inline __versa_string<_CharT, _Traits, _Alloc, _Base> inline __versa_string<_CharT, _Traits, _Alloc, _Base>
@ -2572,7 +2572,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
_GLIBCXX_END_NAMESPACE_VERSION _GLIBCXX_END_NAMESPACE_VERSION
} // namespace } // namespace
#if (defined(__GXX_EXPERIMENTAL_CXX0X__) && defined(_GLIBCXX_USE_C99)) #if ((__cplusplus >= 201103L) && defined(_GLIBCXX_USE_C99))
#include <ext/string_conversions.h> #include <ext/string_conversions.h>
@ -2790,7 +2790,7 @@ _GLIBCXX_END_NAMESPACE_VERSION
#endif #endif
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
#include <bits/functional_hash.h> #include <bits/functional_hash.h>
@ -2848,7 +2848,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
_GLIBCXX_END_NAMESPACE_VERSION _GLIBCXX_END_NAMESPACE_VERSION
} // namespace } // namespace
#endif /* __GXX_EXPERIMENTAL_CXX0X__ */ #endif // C++11
#include "vstring.tcc" #include "vstring.tcc"

2
libstdc++-v3/include/ext/vstring_fwd.h
View file

@ -67,7 +67,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
std::allocator<wchar_t>, __rc_string_base> __wrc_string; std::allocator<wchar_t>, __rc_string_base> __wrc_string;
#endif #endif
#if (defined(__GXX_EXPERIMENTAL_CXX0X__) \ #if ((__cplusplus >= 201103L) \
&& defined(_GLIBCXX_USE_C99_STDINT_TR1)) && defined(_GLIBCXX_USE_C99_STDINT_TR1))
typedef __versa_string<char16_t> __u16vstring; typedef __versa_string<char16_t> __u16vstring;

2
libstdc++-v3/include/parallel/algo.h
View file

@ -1674,7 +1674,7 @@ namespace __parallel
template<typename _RAIter, typename _RandomNumberGenerator> template<typename _RAIter, typename _RandomNumberGenerator>
void void
random_shuffle(_RAIter __begin, _RAIter __end, random_shuffle(_RAIter __begin, _RAIter __end,
#ifdef __GXX_EXPERIMENTAL_CXX0X__ #if __cplusplus >= 201103L
_RandomNumberGenerator&& __rand) _RandomNumberGenerator&& __rand)
#else #else
_RandomNumberGenerator& __rand) _RandomNumberGenerator& __rand)

Some files were not shown because too many files have changed in this diff Show more