diff options
Diffstat (limited to 'libcxx/include/unordered_set')
| -rw-r--r-- | libcxx/include/unordered_set | 38 |
1 files changed, 19 insertions, 19 deletions
diff --git a/libcxx/include/unordered_set b/libcxx/include/unordered_set index 913cd70d455..2798a618a83 100644 --- a/libcxx/include/unordered_set +++ b/libcxx/include/unordered_set @@ -408,11 +408,11 @@ public: template <class... _Args> _LIBCPP_INLINE_VISIBILITY pair<iterator, bool> emplace(_Args&&... __args) - {return __table_.__emplace_unique(_STD::forward<_Args>(__args)...);} + {return __table_.__emplace_unique(_VSTD::forward<_Args>(__args)...);} template <class... _Args> _LIBCPP_INLINE_VISIBILITY iterator emplace_hint(const_iterator, _Args&&... __args) - {return __table_.__emplace_unique(_STD::forward<_Args>(__args)...).first;} + {return __table_.__emplace_unique(_VSTD::forward<_Args>(__args)...).first;} #endif // !defined(_LIBCPP_HAS_NO_RVALUE_REFERENCES) && !defined(_LIBCPP_HAS_NO_VARIADICS) _LIBCPP_INLINE_VISIBILITY pair<iterator, bool> insert(const value_type& __x) @@ -420,7 +420,7 @@ public: #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES _LIBCPP_INLINE_VISIBILITY pair<iterator, bool> insert(value_type&& __x) - {return __table_.__insert_unique(_STD::move(__x));} + {return __table_.__insert_unique(_VSTD::move(__x));} #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES _LIBCPP_INLINE_VISIBILITY iterator insert(const_iterator, const value_type& __x) @@ -428,7 +428,7 @@ public: #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES _LIBCPP_INLINE_VISIBILITY iterator insert(const_iterator, value_type&& __x) - {return insert(_STD::move(__x)).first;} + {return insert(_VSTD::move(__x)).first;} #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES template <class _InputIterator> void insert(_InputIterator __first, _InputIterator __last); @@ -583,20 +583,20 @@ inline _LIBCPP_INLINE_VISIBILITY unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set( unordered_set&& __u) _NOEXCEPT_(is_nothrow_move_constructible<__table>::value) - : __table_(_STD::move(__u.__table_)) + : __table_(_VSTD::move(__u.__table_)) { } template <class _Value, class _Hash, class _Pred, class _Alloc> unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set( unordered_set&& __u, const allocator_type& __a) - : __table_(_STD::move(__u.__table_), __a) + : __table_(_VSTD::move(__u.__table_), __a) { if (__a != __u.get_allocator()) { iterator __i = __u.begin(); while (__u.size() != 0) - __table_.__insert_unique(_STD::move(__u.__table_.remove(__i++)->__value_)); + __table_.__insert_unique(_VSTD::move(__u.__table_.remove(__i++)->__value_)); } } @@ -637,7 +637,7 @@ unordered_set<_Value, _Hash, _Pred, _Alloc>& unordered_set<_Value, _Hash, _Pred, _Alloc>::operator=(unordered_set&& __u) _NOEXCEPT_(is_nothrow_move_assignable<__table>::value) { - __table_ = _STD::move(__u.__table_); + __table_ = _VSTD::move(__u.__table_); return *this; } @@ -801,17 +801,17 @@ public: template <class... _Args> _LIBCPP_INLINE_VISIBILITY iterator emplace(_Args&&... __args) - {return __table_.__emplace_multi(_STD::forward<_Args>(__args)...);} + {return __table_.__emplace_multi(_VSTD::forward<_Args>(__args)...);} template <class... _Args> _LIBCPP_INLINE_VISIBILITY iterator emplace_hint(const_iterator __p, _Args&&... __args) - {return __table_.__emplace_hint_multi(__p, _STD::forward<_Args>(__args)...);} + {return __table_.__emplace_hint_multi(__p, _VSTD::forward<_Args>(__args)...);} #endif // !defined(_LIBCPP_HAS_NO_RVALUE_REFERENCES) && !defined(_LIBCPP_HAS_NO_VARIADICS) _LIBCPP_INLINE_VISIBILITY iterator insert(const value_type& __x) {return __table_.__insert_multi(__x);} #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES _LIBCPP_INLINE_VISIBILITY - iterator insert(value_type&& __x) {return __table_.__insert_multi(_STD::move(__x));} + iterator insert(value_type&& __x) {return __table_.__insert_multi(_VSTD::move(__x));} #endif _LIBCPP_INLINE_VISIBILITY iterator insert(const_iterator __p, const value_type& __x) @@ -819,7 +819,7 @@ public: #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES _LIBCPP_INLINE_VISIBILITY iterator insert(const_iterator __p, value_type&& __x) - {return __table_.__insert_multi(__p, _STD::move(__x));} + {return __table_.__insert_multi(__p, _VSTD::move(__x));} #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES template <class _InputIterator> void insert(_InputIterator __first, _InputIterator __last); @@ -975,20 +975,20 @@ inline _LIBCPP_INLINE_VISIBILITY unordered_multiset<_Value, _Hash, _Pred, _Alloc>::unordered_multiset( unordered_multiset&& __u) _NOEXCEPT_(is_nothrow_move_constructible<__table>::value) - : __table_(_STD::move(__u.__table_)) + : __table_(_VSTD::move(__u.__table_)) { } template <class _Value, class _Hash, class _Pred, class _Alloc> unordered_multiset<_Value, _Hash, _Pred, _Alloc>::unordered_multiset( unordered_multiset&& __u, const allocator_type& __a) - : __table_(_STD::move(__u.__table_), __a) + : __table_(_VSTD::move(__u.__table_), __a) { if (__a != __u.get_allocator()) { iterator __i = __u.begin(); while (__u.size() != 0) - __table_.__insert_multi(_STD::move(__u.__table_.remove(__i++)->__value_)); + __table_.__insert_multi(_VSTD::move(__u.__table_.remove(__i++)->__value_)); } } @@ -1030,7 +1030,7 @@ unordered_multiset<_Value, _Hash, _Pred, _Alloc>::operator=( unordered_multiset&& __u) _NOEXCEPT_(is_nothrow_move_assignable<__table>::value) { - __table_ = _STD::move(__u.__table_); + __table_ = _VSTD::move(__u.__table_); return *this; } @@ -1081,9 +1081,9 @@ operator==(const unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __x, { _EqRng __xeq = __x.equal_range(*__i); _EqRng __yeq = __y.equal_range(*__i); - if (_STD::distance(__xeq.first, __xeq.second) != - _STD::distance(__yeq.first, __yeq.second) || - !_STD::is_permutation(__xeq.first, __xeq.second, __yeq.first)) + if (_VSTD::distance(__xeq.first, __xeq.second) != + _VSTD::distance(__yeq.first, __yeq.second) || + !_VSTD::is_permutation(__xeq.first, __xeq.second, __yeq.first)) return false; __i = __xeq.second; } |
