* include/bits/alloc_traits.h: Add feature-test macro.
* include/bits/allocator.h: Likewise.
* include/bits/range_access.h: Likewise.
* include/bits/stl_map.h: Likewise.
* include/bits/unordered_map.h: Likewise.
From-SVN: r226864
+2015-08-13 Jonathan Wakely <jwakely@redhat.com>
+
+ * include/bits/alloc_traits.h: Add feature-test macro.
+ * include/bits/allocator.h: Likewise.
+ * include/bits/range_access.h: Likewise.
+ * include/bits/stl_map.h: Likewise.
+ * include/bits/unordered_map.h: Likewise.
+
2015-08-13 Jonathan Wakely <jwakely@redhat.com>
* testsuite/30_threads/mutex/unlock/2.cc: New.
#include <bits/ptr_traits.h>
#include <ext/numeric_traits.h>
+#define __cpp_lib_allocator_traits_is_always_equal 201411
+
namespace std _GLIBCXX_VISIBILITY(default)
{
_GLIBCXX_BEGIN_NAMESPACE_VERSION
// 2103. std::allocator propagate_on_container_move_assignment
typedef true_type propagate_on_container_move_assignment;
+#define __cpp_lib_allocator_is_always_equal 201411
typedef true_type is_always_equal;
#endif
};
#endif // C++14
#if __cplusplus > 201402L
+#define __cpp_lib_nonmember_container_access 201411
/**
* @brief Return the size of a container.
std::forward<_Args>(__args)...);
}
#endif
+
#if __cplusplus > 201402L
+#define __cpp_lib_map_try_emplace 201411
/**
* @brief Attempts to build and insert a std::pair into the %map.
*
return __i;
}
#endif
+
/**
* @brief Attempts to insert a std::pair into the %map.
{ _M_t._M_insert_unique(__first, __last); }
#if __cplusplus > 201402L
+#define __cpp_lib_map_insertion 201411
/**
* @brief Attempts to insert or assign a std::pair into the %map.
* @param __k Key to use for finding a possibly existing pair in
#if __cplusplus > 201402L
+#define __cpp_lib_unordered_map_try_emplace 201411
/**
* @brief Attempts to build and insert a std::pair into the
* %unordered_map.
#if __cplusplus > 201402L
+#define __cpp_lib_unordered_map_insertion 201411
/**
* @brief Attempts to insert a std::pair into the %unordered_map.
* @param __k Key to use for finding a possibly existing pair in