diff options
author | Eric Fiselier <eric@efcs.ca> | 2016-02-11 18:21:18 +0000 |
---|---|---|
committer | Eric Fiselier <eric@efcs.ca> | 2016-02-11 18:21:18 +0000 |
commit | 614ed76c3729e837c06cd31aa638b6723cc91420 (patch) | |
tree | 29b96b07db37e2a85e91ddb904b25b8fd7bb9469 /libcxx/include | |
parent | b0ce1952b7243c17fdac23409533b4c0041f23c0 (diff) | |
download | bcm5719-llvm-614ed76c3729e837c06cd31aa638b6723cc91420.tar.gz bcm5719-llvm-614ed76c3729e837c06cd31aa638b6723cc91420.zip |
Revert r260514 because it has a bogus commit message.
llvm-svn: 260556
Diffstat (limited to 'libcxx/include')
-rw-r--r-- | libcxx/include/unordered_map | 51 |
1 files changed, 30 insertions, 21 deletions
diff --git a/libcxx/include/unordered_map b/libcxx/include/unordered_map index 372868a0df5..7e84f74d7e6 100644 --- a/libcxx/include/unordered_map +++ b/libcxx/include/unordered_map @@ -369,7 +369,6 @@ template <class Key, class T, class Hash, class Pred, class Alloc> #include <__hash_table> #include <functional> #include <stdexcept> -#include <tuple> #include <__debug> @@ -1129,7 +1128,7 @@ public: {return __table_.__equal_range_unique(__k);} mapped_type& operator[](const key_type& __k); -#ifndef _LIBCPP_CXX03_LANG +#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES mapped_type& operator[](key_type&& __k); #endif @@ -1185,10 +1184,10 @@ public: #endif // _LIBCPP_DEBUG_LEVEL >= 2 private: - -#ifdef _LIBCPP_CXX03_LANG +#ifndef _LIBCPP_CXX03_LANG + __node_holder __construct_node_with_key(key_type&& __k); +#endif // _LIBCPP_CXX03_LANG __node_holder __construct_node_with_key(const key_type& __k); -#endif }; template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc> @@ -1395,7 +1394,23 @@ unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::operator=( #endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS -#ifdef _LIBCPP_CXX03_LANG +#ifndef _LIBCPP_CXX03_LANG + +template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc> +typename unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::__node_holder +unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::__construct_node_with_key(key_type&& __k) +{ + __node_allocator& __na = __table_.__node_alloc(); + __node_holder __h(__node_traits::allocate(__na, 1), _Dp(__na)); + __node_traits::construct(__na, _VSTD::addressof(__h->__value_.__cc.first), _VSTD::move(__k)); + __h.get_deleter().__first_constructed = true; + __node_traits::construct(__na, _VSTD::addressof(__h->__value_.__cc.second)); + __h.get_deleter().__second_constructed = true; + return __h; +} + +#endif + template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc> typename unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::__node_holder unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::__construct_node_with_key(const key_type& __k) @@ -1408,7 +1423,6 @@ unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::__construct_node_with_key(const __h.get_deleter().__second_constructed = true; return _LIBCPP_EXPLICIT_MOVE(__h); // explicitly moved for C++03 } -#endif template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc> template <class _InputIterator> @@ -1421,7 +1435,6 @@ unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::insert(_InputIterator __first, __table_.__insert_unique(*__first); } -#ifdef _LIBCPP_CXX03_LANG template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc> _Tp& unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::operator[](const key_type& __k) @@ -1434,27 +1447,23 @@ unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::operator[](const key_type& __k) __h.release(); return __r.first->second; } -#else -template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc> -_Tp& -unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::operator[](const key_type& __k) -{ - return __table_.__emplace_unique_key_args(__k, - std::piecewise_construct, std::forward_as_tuple(__k), - std::forward_as_tuple()).first->__cc.second; -} +#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc> _Tp& unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::operator[](key_type&& __k) { - return __table_.__emplace_unique_key_args(__k, - std::piecewise_construct, std::forward_as_tuple(std::move(__k)), - std::forward_as_tuple()).first->__cc.second; + iterator __i = find(__k); + if (__i != end()) + return __i->second; + __node_holder __h = __construct_node_with_key(_VSTD::move(__k)); + pair<iterator, bool> __r = __table_.__node_insert_unique(__h.get()); + __h.release(); + return __r.first->second; } -#endif // !_LIBCPP_CXX03_MODE +#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc> _Tp& |