* to the first is returned.
*
* Insertion requires logarithmic time (if the hint is not taken).
+ *
+ * @{
*/
template <typename... _Args>
iterator
__i = iterator(__true_hint.first);
return __i;
}
-#endif
#ifdef __glibcxx_associative_heterogeneous_insertion // C++26
template <__heterogeneous_tree_key<map> _Kt, typename ..._Args>
return __i;
}
#endif
+ /// @}
+#endif // __glibcxx_map_try_emplace
/**
* @brief Attempts to insert a std::pair into the %map.
insert(_InputIterator __first, _InputIterator __last)
{ _M_t._M_insert_range_unique(__first, __last); }
-#if __cplusplus > 201402L
+#ifdef __glibcxx_map_try_emplace // >= C++17 && HOSTED
/**
* @brief Attempts to insert or assign a std::pair into the %map.
* @param __k Key to use for finding a possibly existing pair in
}
#endif
///@}
-#endif
-#if __cplusplus > 201402L
///@{
/**
* @brief Attempts to insert or assign a std::pair into the %map.
}
#endif
///@}
-#endif
+#endif // __glibcxx_map_try_emplace
#if __cplusplus >= 201103L
// _GLIBCXX_RESOLVE_LIB_DEFECTS