-
Notifications
You must be signed in to change notification settings - Fork 0
/
ordered_set.hpp
72 lines (61 loc) · 2.54 KB
/
ordered_set.hpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
#ifndef _ASP_ORDERED_SET_HPP_
#define _ASP_ORDERED_SET_HPP_
#include <functional>
#include "basic_param.hpp"
#include "rb_tree.hpp"
namespace asp {
template <typename _Tp,
typename _Compare = std::less<_Tp>,
typename _Alloc = std::allocator<_Tp>
> class ordered_set;
template <typename _Tp, typename _Compare, typename _Alloc>
class ordered_set {
typedef ordered_set<_Tp, _Compare, _Alloc> self;
typedef rb_tree<_Tp, _Tp, _select_self, true, _Compare, _Alloc> set_rbt;
set_rbt _r;
public:
typedef typename set_rbt::key_type key_type;
typedef typename set_rbt::value_type value_type;
typedef typename set_rbt::mapped_type mapped_type;
typedef typename set_rbt::key_compare key_compare;
typedef typename set_rbt::iterator iterator;
typedef typename set_rbt::const_iterator const_iterator;
typedef typename set_rbt::ireturn_type ireturn_type;
typedef typename set_rbt::insert_status insert_status;
typedef typename set_rbt::ext_iterator ext_iterator;
typedef typename set_rbt::ext_key ext_key;
typedef typename set_rbt::ext_value ext_value;
/// (de)constructor
ordered_set() = default;
ordered_set(const self& _x) : _r(_x._r) {}
virtual ~ordered_set() = default;
/// implement
size_type size() const { return _r.size(); }
bool empty() const { return _r.empty(); }
iterator begin() { return _r.begin(); }
iterator end() { return _r.end(); }
const_iterator cbegin() const { return _r.cbegin(); }
const_iterator cend() const { return _r.cend(); }
ireturn_type insert(const value_type& _v) { return _r.insert(_v); }
ireturn_type set(const key_type& _k, const mapped_type& _m) { return _r.insert(value_type(_k, _m)); }
size_type erase(const key_type& _k) { return _r.erase(_k); }
size_type count(const key_type& _k) const { return _r.count(_k); }
void clear() { _r.clear(); }
iterator find(const key_type& _k) { return _r.find(_k); }
const_iterator find(const key_type& _k) const { return _r.find(_k); }
#ifdef _CONTAINER_CHECK_
int check() const { return _r.check(); }
#endif // _CONTAINER_CHECK_
/// output
template <typename _T, typename _C, typename _A>
friend std::ostream& operator<<(std::ostream& os, const ordered_set<_T, _C, _A>& _um);
// friend std::ostream& operator<<(std::ostream& os, const const_iterator& _i);
};
template <typename _Tp, typename _Comp, typename _Alloc> auto
operator<<(std::ostream& os, const ordered_set<_Tp, _Comp, _Alloc>& _um)
-> std::ostream& {
os << _um._r;
return os;
};
};
#endif // _ASP_ORDERED_SET_HPP_