| // Profiling set implementation -*- C++ -*- |
| |
| // Copyright (C) 2009-2016 Free Software Foundation, Inc. |
| // |
| // This file is part of the GNU ISO C++ Library. This library is free |
| // software; you can redistribute it and/or modify it under the |
| // terms of the GNU General Public License as published by the |
| // Free Software Foundation; either version 3, or (at your option) |
| // any later version. |
| |
| // This library is distributed in the hope that it will be useful, |
| // but WITHOUT ANY WARRANTY; without even the implied warranty of |
| // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| // GNU General Public License for more details. |
| |
| // Under Section 7 of GPL version 3, you are granted additional |
| // permissions described in the GCC Runtime Library Exception, version |
| // 3.1, as published by the Free Software Foundation. |
| |
| // You should have received a copy of the GNU General Public License and |
| // a copy of the GCC Runtime Library Exception along with this program; |
| // see the files COPYING3 and COPYING.RUNTIME respectively. If not, see |
| // <http://www.gnu.org/licenses/>. |
| |
| /** @file profile/set.h |
| * This file is a GNU profile extension to the Standard C++ Library. |
| */ |
| |
| #ifndef _GLIBCXX_PROFILE_SET_H |
| #define _GLIBCXX_PROFILE_SET_H 1 |
| |
| #include <profile/base.h> |
| #include <profile/ordered_base.h> |
| |
| namespace std _GLIBCXX_VISIBILITY(default) |
| { |
| namespace __profile |
| { |
| /// Class std::set wrapper with performance instrumentation. |
| template<typename _Key, typename _Compare = std::less<_Key>, |
| typename _Allocator = std::allocator<_Key> > |
| class set |
| : public _GLIBCXX_STD_C::set<_Key,_Compare,_Allocator>, |
| public _Ordered_profile<set<_Key, _Compare, _Allocator> > |
| { |
| typedef _GLIBCXX_STD_C::set<_Key, _Compare, _Allocator> _Base; |
| |
| typedef typename _Base::iterator _Base_iterator; |
| typedef typename _Base::const_iterator _Base_const_iterator; |
| |
| public: |
| // types: |
| typedef _Key key_type; |
| typedef _Key value_type; |
| typedef _Compare key_compare; |
| typedef _Compare value_compare; |
| typedef typename _Base::reference reference; |
| typedef typename _Base::const_reference const_reference; |
| |
| typedef __iterator_tracker<_Base_iterator, set> iterator; |
| typedef __iterator_tracker<_Base_const_iterator, |
| set> const_iterator; |
| typedef std::reverse_iterator<iterator> reverse_iterator; |
| typedef std::reverse_iterator<const_iterator> const_reverse_iterator; |
| |
| typedef typename _Base::size_type size_type; |
| typedef typename _Base::difference_type difference_type; |
| |
| // 23.3.3.1 construct/copy/destroy: |
| #if __cplusplus < 201103L |
| set() |
| : _Base() { } |
| set(const set& __x) |
| : _Base(__x) { } |
| ~set() { } |
| #else |
| set() = default; |
| set(const set&) = default; |
| set(set&&) = default; |
| ~set() = default; |
| #endif |
| |
| explicit set(const _Compare& __comp, |
| const _Allocator& __a = _Allocator()) |
| : _Base(__comp, __a) { } |
| |
| #if __cplusplus >= 201103L |
| template<typename _InputIterator, |
| typename = std::_RequireInputIter<_InputIterator>> |
| #else |
| template<typename _InputIterator> |
| #endif |
| set(_InputIterator __first, _InputIterator __last, |
| const _Compare& __comp = _Compare(), |
| const _Allocator& __a = _Allocator()) |
| : _Base(__first, __last, __comp, __a) { } |
| |
| #if __cplusplus >= 201103L |
| set(initializer_list<value_type> __l, |
| const _Compare& __comp = _Compare(), |
| const _Allocator& __a = _Allocator()) |
| : _Base(__l, __comp, __a) { } |
| |
| explicit |
| set(const _Allocator& __a) |
| : _Base(__a) { } |
| |
| set(const set& __x, const _Allocator& __a) |
| : _Base(__x, __a) { } |
| |
| set(set&& __x, const _Allocator& __a) |
| noexcept( noexcept(_Base(std::move(__x), __a)) ) |
| : _Base(std::move(__x), __a) { } |
| |
| set(initializer_list<value_type> __l, const _Allocator& __a) |
| : _Base(__l, __a) { } |
| |
| template<typename _InputIterator> |
| set(_InputIterator __first, _InputIterator __last, |
| const _Allocator& __a) |
| : _Base(__first, __last, __a) { } |
| #endif |
| |
| set(const _Base& __x) |
| : _Base(__x) { } |
| |
| #if __cplusplus < 201103L |
| set& |
| operator=(const set& __x) |
| { |
| this->_M_profile_destruct(); |
| _M_base() = __x; |
| this->_M_profile_construct(); |
| return *this; |
| } |
| #else |
| set& |
| operator=(const set&) = default; |
| |
| set& |
| operator=(set&&) = default; |
| |
| set& |
| operator=(initializer_list<value_type> __l) |
| { |
| this->_M_profile_destruct(); |
| _M_base() = __l; |
| this->_M_profile_construct(); |
| return *this; |
| } |
| #endif |
| |
| // iterators |
| iterator |
| begin() _GLIBCXX_NOEXCEPT |
| { return iterator(_Base::begin(), this); } |
| |
| const_iterator |
| begin() const _GLIBCXX_NOEXCEPT |
| { return const_iterator(_Base::begin(), this); } |
| |
| iterator |
| end() _GLIBCXX_NOEXCEPT |
| { return iterator(_Base::end(), this); } |
| |
| const_iterator |
| end() const _GLIBCXX_NOEXCEPT |
| { return const_iterator(_Base::end(), this); } |
| |
| #if __cplusplus >= 201103L |
| const_iterator |
| cbegin() const noexcept |
| { return const_iterator(_Base::cbegin(), this); } |
| |
| const_iterator |
| cend() const noexcept |
| { return const_iterator(_Base::cend(), this); } |
| #endif |
| |
| reverse_iterator |
| rbegin() _GLIBCXX_NOEXCEPT |
| { |
| __profcxx_map2umap_invalidate(this->_M_map2umap_info); |
| return reverse_iterator(end()); |
| } |
| |
| const_reverse_iterator |
| rbegin() const _GLIBCXX_NOEXCEPT |
| { |
| __profcxx_map2umap_invalidate(this->_M_map2umap_info); |
| return const_reverse_iterator(end()); |
| } |
| |
| reverse_iterator |
| rend() _GLIBCXX_NOEXCEPT |
| { |
| __profcxx_map2umap_invalidate(this->_M_map2umap_info); |
| return reverse_iterator(begin()); |
| } |
| |
| const_reverse_iterator |
| rend() const _GLIBCXX_NOEXCEPT |
| { |
| __profcxx_map2umap_invalidate(this->_M_map2umap_info); |
| return const_reverse_iterator(begin()); |
| } |
| |
| #if __cplusplus >= 201103L |
| const_reverse_iterator |
| crbegin() const noexcept |
| { |
| __profcxx_map2umap_invalidate(this->_M_map2umap_info); |
| return const_reverse_iterator(cend()); |
| } |
| |
| const_reverse_iterator |
| crend() const noexcept |
| { |
| __profcxx_map2umap_invalidate(this->_M_map2umap_info); |
| return const_reverse_iterator(cbegin()); |
| } |
| #endif |
| |
| void |
| swap(set& __x) |
| _GLIBCXX_NOEXCEPT_IF( noexcept(declval<_Base&>().swap(__x)) ) |
| { |
| _Base::swap(__x); |
| this->_M_swap(__x); |
| } |
| |
| // modifiers: |
| #if __cplusplus >= 201103L |
| template<typename... _Args> |
| std::pair<iterator, bool> |
| emplace(_Args&&... __args) |
| { |
| __profcxx_map2umap_insert(this->_M_map2umap_info, this->size(), 1); |
| auto __base_ret = _Base::emplace(std::forward<_Args>(__args)...); |
| return std::make_pair(iterator(__base_ret.first, this), |
| __base_ret.second); |
| } |
| |
| template<typename... _Args> |
| iterator |
| emplace_hint(const_iterator __pos, _Args&&... __args) |
| { |
| auto size_before = this->size(); |
| auto __res |
| = _Base::emplace_hint(__pos.base(), std::forward<_Args>(__args)...); |
| __profcxx_map2umap_insert(this->_M_map2umap_info, |
| size_before, _M_hint_used(__pos.base(), __res) ? 0 : 1); |
| return iterator(__res, this); |
| } |
| #endif |
| |
| std::pair<iterator, bool> |
| insert(const value_type& __x) |
| { |
| __profcxx_map2umap_insert(this->_M_map2umap_info, this->size(), 1); |
| std::pair<_Base_iterator, bool> __base_ret = _Base::insert(__x); |
| return std::make_pair(iterator(__base_ret.first, this), |
| __base_ret.second); |
| } |
| |
| #if __cplusplus >= 201103L |
| std::pair<iterator, bool> |
| insert(value_type&& __x) |
| { |
| __profcxx_map2umap_insert(this->_M_map2umap_info, this->size(), 1); |
| std::pair<_Base_iterator, bool> __base_ret |
| = _Base::insert(std::move(__x)); |
| return std::make_pair(iterator(__base_ret.first, this), |
| __base_ret.second); |
| } |
| #endif |
| |
| iterator |
| insert(const_iterator __pos, const value_type& __x) |
| { |
| size_type size_before = this->size(); |
| _Base_iterator __res = _Base::insert(__pos.base(), __x); |
| __profcxx_map2umap_insert(this->_M_map2umap_info, |
| size_before, _M_hint_used(__pos.base(), __res) ? 0 : 1); |
| return iterator(__res, this); |
| } |
| |
| #if __cplusplus >= 201103L |
| iterator |
| insert(const_iterator __pos, value_type&& __x) |
| { return iterator(_Base::insert(__pos.base(), std::move(__x)), this); } |
| #endif |
| |
| template<typename _InputIterator> |
| void |
| insert(_InputIterator __first, _InputIterator __last) |
| { |
| for (; __first != __last; ++__first) |
| insert(*__first); |
| } |
| |
| #if __cplusplus >= 201103L |
| void |
| insert(initializer_list<value_type> __l) |
| { insert(__l.begin(), __l.end()); } |
| #endif |
| |
| #if __cplusplus >= 201103L |
| iterator |
| erase(const_iterator __pos) |
| { |
| __profcxx_map2umap_erase(this->_M_map2umap_info, this->size(), 1); |
| return iterator(_Base::erase(__pos.base()), this); |
| } |
| #else |
| void |
| erase(iterator __pos) |
| { |
| __profcxx_map2umap_erase(this->_M_map2umap_info, this->size(), 1); |
| _Base::erase(__pos.base()); |
| } |
| #endif |
| |
| size_type |
| erase(const key_type& __x) |
| { |
| __profcxx_map2umap_find(this->_M_map2umap_info, this->size()); |
| __profcxx_map2umap_erase(this->_M_map2umap_info, this->size(), 1); |
| return _Base::erase(__x); |
| } |
| |
| #if __cplusplus >= 201103L |
| iterator |
| erase(const_iterator __first, const_iterator __last) |
| { |
| if (__first != __last) |
| { |
| iterator __ret; |
| for (; __first != __last;) |
| __ret = erase(__first++); |
| return __ret; |
| } |
| |
| return iterator(_Base::erase(__first.base(), __last.base()), this); |
| } |
| #else |
| void |
| erase(iterator __first, iterator __last) |
| { |
| for (; __first != __last;) |
| erase(__first++); |
| } |
| #endif |
| |
| void |
| clear() _GLIBCXX_NOEXCEPT |
| { |
| this->_M_profile_destruct(); |
| _Base::clear(); |
| this->_M_profile_construct(); |
| } |
| |
| size_type |
| count(const key_type& __x) const |
| { |
| __profcxx_map2umap_find(this->_M_map2umap_info, this->size()); |
| return _Base::count(__x); |
| } |
| |
| #if __cplusplus > 201103L |
| template<typename _Kt, |
| typename _Req = |
| typename __has_is_transparent<_Compare, _Kt>::type> |
| size_type |
| count(const _Kt& __x) const |
| { |
| __profcxx_map2umap_find(this->_M_map2umap_info, this->size()); |
| return _Base::count(__x); |
| } |
| #endif |
| |
| // set operations: |
| iterator |
| find(const key_type& __x) |
| { |
| __profcxx_map2umap_find(this->_M_map2umap_info, this->size()); |
| return iterator(_Base::find(__x), this); |
| } |
| |
| const_iterator |
| find(const key_type& __x) const |
| { |
| __profcxx_map2umap_find(this->_M_map2umap_info, this->size()); |
| return const_iterator(_Base::find(__x), this); |
| } |
| |
| #if __cplusplus > 201103L |
| template<typename _Kt, |
| typename _Req = |
| typename __has_is_transparent<_Compare, _Kt>::type> |
| iterator |
| find(const _Kt& __x) |
| { |
| __profcxx_map2umap_find(this->_M_map2umap_info, this->size()); |
| return { _Base::find(__x), this }; |
| } |
| |
| template<typename _Kt, |
| typename _Req = |
| typename __has_is_transparent<_Compare, _Kt>::type> |
| const_iterator |
| find(const _Kt& __x) const |
| { |
| __profcxx_map2umap_find(this->_M_map2umap_info, this->size()); |
| return { _Base::find(__x), this }; |
| } |
| #endif |
| |
| iterator |
| lower_bound(const key_type& __x) |
| { |
| __profcxx_map2umap_find(this->_M_map2umap_info, this->size()); |
| __profcxx_map2umap_invalidate(this->_M_map2umap_info); |
| return iterator(_Base::lower_bound(__x), this); |
| } |
| |
| const_iterator |
| lower_bound(const key_type& __x) const |
| { |
| __profcxx_map2umap_find(this->_M_map2umap_info, this->size()); |
| __profcxx_map2umap_invalidate(this->_M_map2umap_info); |
| return const_iterator(_Base::lower_bound(__x), this); |
| } |
| |
| #if __cplusplus > 201103L |
| template<typename _Kt, |
| typename _Req = |
| typename __has_is_transparent<_Compare, _Kt>::type> |
| iterator |
| lower_bound(const _Kt& __x) |
| { |
| __profcxx_map2umap_find(this->_M_map2umap_info, this->size()); |
| __profcxx_map2umap_invalidate(this->_M_map2umap_info); |
| return { _Base::lower_bound(__x), this }; |
| } |
| |
| template<typename _Kt, |
| typename _Req = |
| typename __has_is_transparent<_Compare, _Kt>::type> |
| const_iterator |
| lower_bound(const _Kt& __x) const |
| { |
| __profcxx_map2umap_find(this->_M_map2umap_info, this->size()); |
| __profcxx_map2umap_invalidate(this->_M_map2umap_info); |
| return { _Base::lower_bound(__x), this }; |
| } |
| #endif |
| |
| iterator |
| upper_bound(const key_type& __x) |
| { |
| __profcxx_map2umap_find(this->_M_map2umap_info, this->size()); |
| __profcxx_map2umap_invalidate(this->_M_map2umap_info); |
| return iterator(_Base::upper_bound(__x), this); |
| } |
| |
| const_iterator |
| upper_bound(const key_type& __x) const |
| { |
| __profcxx_map2umap_find(this->_M_map2umap_info, this->size()); |
| __profcxx_map2umap_invalidate(this->_M_map2umap_info); |
| return const_iterator(_Base::upper_bound(__x), this); |
| } |
| |
| #if __cplusplus > 201103L |
| template<typename _Kt, |
| typename _Req = |
| typename __has_is_transparent<_Compare, _Kt>::type> |
| iterator |
| upper_bound(const _Kt& __x) |
| { |
| __profcxx_map2umap_find(this->_M_map2umap_info, this->size()); |
| __profcxx_map2umap_invalidate(this->_M_map2umap_info); |
| return { _Base::upper_bound(__x), this }; |
| } |
| |
| template<typename _Kt, |
| typename _Req = |
| typename __has_is_transparent<_Compare, _Kt>::type> |
| const_iterator |
| upper_bound(const _Kt& __x) const |
| { |
| __profcxx_map2umap_find(this->_M_map2umap_info, this->size()); |
| __profcxx_map2umap_invalidate(this->_M_map2umap_info); |
| return { _Base::upper_bound(__x), this }; |
| } |
| #endif |
| |
| std::pair<iterator, iterator> |
| equal_range(const key_type& __x) |
| { |
| __profcxx_map2umap_find(this->_M_map2umap_info, this->size()); |
| std::pair<_Base_iterator, _Base_iterator> __base_ret |
| = _Base::equal_range(__x); |
| return std::make_pair(iterator(__base_ret.first, this), |
| iterator(__base_ret.second, this)); |
| } |
| |
| std::pair<const_iterator, const_iterator> |
| equal_range(const key_type& __x) const |
| { |
| __profcxx_map2umap_find(this->_M_map2umap_info, this->size()); |
| std::pair<_Base_const_iterator, _Base_const_iterator> __base_ret |
| = _Base::equal_range(__x); |
| return std::make_pair(const_iterator(__base_ret.first, this), |
| const_iterator(__base_ret.second, this)); |
| } |
| |
| #if __cplusplus > 201103L |
| template<typename _Kt, |
| typename _Req = |
| typename __has_is_transparent<_Compare, _Kt>::type> |
| std::pair<iterator, iterator> |
| equal_range(const _Kt& __x) |
| { |
| __profcxx_map2umap_find(this->_M_map2umap_info, this->size()); |
| auto __res = _Base::equal_range(__x); |
| return { { __res.first, this }, { __res.second, this } }; |
| } |
| |
| template<typename _Kt, |
| typename _Req = |
| typename __has_is_transparent<_Compare, _Kt>::type> |
| std::pair<const_iterator, const_iterator> |
| equal_range(const _Kt& __x) const |
| { |
| __profcxx_map2umap_find(this->_M_map2umap_info, this->size()); |
| auto __res = _Base::equal_range(__x); |
| return { { __res.first, this }, { __res.second, this } }; |
| } |
| #endif |
| |
| _Base& |
| _M_base() _GLIBCXX_NOEXCEPT { return *this; } |
| |
| const _Base& |
| _M_base() const _GLIBCXX_NOEXCEPT { return *this; } |
| |
| private: |
| /** If hint is used we consider that the map and unordered_map |
| * operations have equivalent insertion cost so we do not update metrics |
| * about it. |
| * Note that to find out if hint has been used is libstdc++ |
| * implementation dependent. |
| */ |
| bool |
| _M_hint_used(_Base_const_iterator __hint, _Base_iterator __res) |
| { |
| return (__hint == __res |
| || (__hint == _M_base().end() && ++__res == _M_base().end()) |
| || (__hint != _M_base().end() && (++__hint == __res |
| || ++__res == --__hint))); |
| } |
| |
| template<typename _K1, typename _C1, typename _A1> |
| friend bool |
| operator==(const set<_K1, _C1, _A1>&, const set<_K1, _C1, _A1>&); |
| |
| template<typename _K1, typename _C1, typename _A1> |
| friend bool |
| operator<(const set<_K1, _C1, _A1>&, const set<_K1, _C1, _A1>&); |
| }; |
| |
| template<typename _Key, typename _Compare, typename _Allocator> |
| inline bool |
| operator==(const set<_Key, _Compare, _Allocator>& __lhs, |
| const set<_Key, _Compare, _Allocator>& __rhs) |
| { |
| __profcxx_map2umap_invalidate(__lhs._M_map2umap_info); |
| __profcxx_map2umap_invalidate(__rhs._M_map2umap_info); |
| return __lhs._M_base() == __rhs._M_base(); |
| } |
| |
| template<typename _Key, typename _Compare, typename _Allocator> |
| inline bool |
| operator<(const set<_Key, _Compare, _Allocator>& __lhs, |
| const set<_Key, _Compare, _Allocator>& __rhs) |
| { |
| __profcxx_map2umap_invalidate(__lhs._M_map2umap_info); |
| __profcxx_map2umap_invalidate(__rhs._M_map2umap_info); |
| return __lhs._M_base() < __rhs._M_base(); |
| } |
| |
| template<typename _Key, typename _Compare, typename _Allocator> |
| inline bool |
| operator!=(const set<_Key, _Compare, _Allocator>& __lhs, |
| const set<_Key, _Compare, _Allocator>& __rhs) |
| { return !(__lhs == __rhs); } |
| |
| template<typename _Key, typename _Compare, typename _Allocator> |
| inline bool |
| operator<=(const set<_Key, _Compare, _Allocator>& __lhs, |
| const set<_Key, _Compare, _Allocator>& __rhs) |
| { return !(__rhs < __lhs); } |
| |
| template<typename _Key, typename _Compare, typename _Allocator> |
| inline bool |
| operator>=(const set<_Key, _Compare, _Allocator>& __lhs, |
| const set<_Key, _Compare, _Allocator>& __rhs) |
| { return !(__lhs < __rhs); } |
| |
| template<typename _Key, typename _Compare, typename _Allocator> |
| inline bool |
| operator>(const set<_Key, _Compare, _Allocator>& __lhs, |
| const set<_Key, _Compare, _Allocator>& __rhs) |
| { return __rhs < __lhs; } |
| |
| template<typename _Key, typename _Compare, typename _Allocator> |
| void |
| swap(set<_Key, _Compare, _Allocator>& __x, |
| set<_Key, _Compare, _Allocator>& __y) |
| _GLIBCXX_NOEXCEPT_IF(noexcept(__x.swap(__y))) |
| { return __x.swap(__y); } |
| |
| } // namespace __profile |
| } // namespace std |
| |
| #endif |