Jhx set #12
There are no files selected for viewing
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
|
|
@@ -21,6 +21,7 @@ check: | |
| @bin/deque_demo | ||
| @bin/list_demo | ||
| @bin/Rb_tree_test | ||
| @bin/set_test | ||
| clean: | ||
| @rm -r bin | ||
| distclean: clean | ||
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,162 @@ | ||
| /** | ||
| * file: set.h | ||
| * date: 2018/05/16 | ||
| * author: F_TD5X(jhx) | ||
| **/ | ||
|
|
||
| #ifndef _CUSTL_SET_H | ||
| #define _CUSTL_SET_H | ||
|
|
||
| #include "tree.h" | ||
|
|
||
| namespace custl { | ||
|
|
||
| template <typename _Key, typename _Compare = std::less<_Key>, | ||
| typename _Alloc = _Key> | ||
| class set; | ||
|
|
||
| template <typename _Key, typename _Compare, class _Alloc> | ||
| class set { | ||
| public: | ||
| typedef _Key key_type; | ||
| typedef _Key value_type; | ||
| typedef _Compare key_compare; | ||
| typedef _Compare value_compare; | ||
|
|
||
| private: | ||
| typedef _Rb_tree<key_type, value_type, std::_Identity<value_type>, key_compare, | ||
| _Alloc> | ||
| _Rep_type; | ||
| _Rep_type _M_t; | ||
|
|
||
| public: | ||
| typedef typename _Rep_type::const_pointer pointer; | ||
| typedef typename _Rep_type::const_pointer const_pointer; | ||
| typedef typename _Rep_type::const_reference reference; | ||
| typedef typename _Rep_type::const_reference const_reference; | ||
| typedef typename _Rep_type::const_iterator iterator; | ||
| typedef typename _Rep_type::const_iterator const_iterator; | ||
| typedef typename _Rep_type::size_type size_type; | ||
| typedef typename _Rep_type::difference_type difference_type; | ||
| typedef typename _Rep_type::allocator_type allocator_type; | ||
| set() : _M_t(_Compare(), allocator_type()) {} | ||
| explicit set(const _Compare& __comp, | ||
| const allocator_type& __a = allocator_type()) | ||
| : _M_t(__comp, __a) {} | ||
|
|
||
| set(const set<_Key, _Compare, _Alloc>& __x) : _M_t(__x._M_t) {} | ||
| set<_Key, _Compare, _Alloc>& operator=( | ||
| const set<_Key, _Compare, _Alloc>& __x) { | ||
| _M_t = __x._M_t; | ||
| return *this; | ||
| } | ||
| template <typename _InputIterator> | ||
| set(_InputIterator __first, _InputIterator __last) | ||
| : _M_t(_Compare(), allocator_type()) { | ||
| _M_t.insert_unique(__first, __last); | ||
| } | ||
|
|
||
| template <typename _InputIterator> | ||
| set(_InputIterator __first, _InputIterator __last, const _Compare& __comp, | ||
| const allocator_type& __a = allocator_type()) | ||
| : _M_t(__comp, __a) { | ||
| _M_t.insert_unique(__first, __last); | ||
| } | ||
|
|
||
| key_compare key_comp() const { return _M_t.key_comp(); } | ||
| value_compare value_comp() const { return _M_t.key_comp(); } | ||
| allocator_type get_allocator() const { return _M_t.get_allocator(); } | ||
|
|
||
| iterator begin() const { return _M_t.begin(); } | ||
| iterator end() const { return _M_t.end(); } | ||
| //reverse_iterator rbegin() const { return _M_t.rbegin(); } | ||
| //reverse_iterator rend() const { return _M_t.rend(); } | ||
| bool empty() const { return _M_t.empty(); } | ||
| size_type size() const { return _M_t.size(); } | ||
| size_type max_size() const { return _M_t.max_size(); } | ||
| void swap(set<_Key, _Compare, _Alloc>& __x) { _M_t.swap(__x._M_t); } | ||
|
|
||
| std::pair<iterator, bool> insert(const value_type& __x) { | ||
| std::pair<typename _Rep_type::iterator, bool> __p = | ||
| _M_t.insert_unique(__x); | ||
| return std::pair<iterator, bool>(__p.first, __p.second); | ||
| } | ||
| iterator insert(iterator __position, const value_type& __x) { | ||
| typedef typename _Rep_type::iterator _Rep_iterator; | ||
| return _M_t.insert_unique((_Rep_iterator&)__position, __x); | ||
| } | ||
| template <class _InputIterator> | ||
| void insert(_InputIterator __first, _InputIterator __last) { | ||
| _M_t.insert_unique(__first, __last); | ||
| } | ||
| void erase(iterator __position) { | ||
| typedef typename _Rep_type::iterator _Rep_iterator; | ||
| _M_t.erase((_Rep_iterator&)__position); | ||
| } | ||
| size_type erase(const key_type& __x) { return _M_t.erase(__x); } | ||
| void erase(iterator __first, iterator __last) { | ||
| typedef typename _Rep_type::iterator _Rep_iterator; | ||
| _M_t.erase((_Rep_iterator&)__first, (_Rep_iterator&)__last); | ||
| } | ||
| void clear() { _M_t.clear(); } | ||
|
|
||
| iterator find(const key_type& __x) const { return _M_t.find(__x); } | ||
| size_type count(const key_type& __x) const { | ||
| return _M_t.find(__x) == _M_t.end() ? 0 : 1; | ||
| } | ||
| iterator lower_bound(const key_type& __x) const { | ||
| return _M_t.lower_bound(__x); | ||
| } | ||
| iterator upper_bound(const key_type& __x) const { | ||
| return _M_t.upper_bound(__x); | ||
| } | ||
| std::pair<iterator, iterator> equal_range(const key_type& __x) const { | ||
| return _M_t.equal_range(__x); | ||
| } | ||
| }; | ||
|
|
||
| template <typename _Key, typename _Compare, typename _Alloc> | ||
| inline bool operator==(const set<_Key, _Compare, _Alloc>& __x, | ||
| const set<_Key, _Compare, _Alloc>& __y) { | ||
| return __x._M_t == __y._M_t; | ||
| } | ||
|
|
||
| template <typename _Key, typename _Compare, typename _Alloc> | ||
| inline bool operator<(const set<_Key, _Compare, _Alloc>& __x, | ||
| const set<_Key, _Compare, _Alloc>& __y) { | ||
| return __x._M_t < __y._M_t; | ||
| } | ||
|
|
||
| template <typename _Key, typename _Compare, typename _Alloc> | ||
| inline bool operator!=(const set<_Key, _Compare, _Alloc>& __x, | ||
| const set<_Key, _Compare, _Alloc>& __y) { | ||
| return !(__x == __y); | ||
| } | ||
|
|
||
| template <typename _Key, typename _Compare, typename _Alloc> | ||
| inline bool operator>(const set<_Key, _Compare, _Alloc>& __x, | ||
| const set<_Key, _Compare, _Alloc>& __y) { | ||
| return __y < __x; | ||
| } | ||
|
|
||
| template <typename _Key, typename _Compare, typename _Alloc> | ||
| inline bool operator<=(const set<_Key, _Compare, _Alloc>& __x, | ||
| const set<_Key, _Compare, _Alloc>& __y) { | ||
| return !(__y < __x); | ||
| } | ||
|
|
||
| template <typename _Key, typename _Compare, typename _Alloc> | ||
| inline bool operator>=(const set<_Key, _Compare, _Alloc>& __x, | ||
| const set<_Key, _Compare, _Alloc>& __y) { | ||
| return !(__x < __y); | ||
| } | ||
|
|
||
| template <typename _Key, typename _Compare, typename _Alloc> | ||
| inline void swap(set<_Key, _Compare, _Alloc>& __x, | ||
| set<_Key, _Compare, _Alloc>& __y) { | ||
| __x.swap(__y); | ||
| } | ||
|
|
||
| } // namespace custl | ||
|
|
||
| #endif | ||
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
std是什么鬼