-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathpair.hpp
More file actions
71 lines (69 loc) · 1.67 KB
/
pair.hpp
File metadata and controls
71 lines (69 loc) · 1.67 KB
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
#ifndef _PAIR_H__
#define _PAIR_H__
namespace ft
{
template <class T1, class T2>
struct pair
{
public:
typedef T1 first_type;
typedef T2 second_type;
pair() : first() , second()
{
return;
}
template <class U, class V>
pair (const pair<U,V>& pr) : first(pr.first)
{
this->second = pr.second;
}
pair (const first_type& a, const second_type& b) : first(a)
{
second = b;
}
pair& operator= (const pair& pr)
{
this->first = pr.first;
this->second = pr.second;
return (*this);
}
first_type first;
second_type second;
};
template <class T1, class T2>
bool operator== (const pair<T1,T2>& lhs, const pair<T1,T2>& rhs)
{
return (lhs.first == rhs.first && lhs.second == rhs.second);
}
template <class T1, class T2>
bool operator!= (const pair<T1,T2>& lhs, const pair<T1,T2>& rhs)
{
return (lhs.first != rhs.first && lhs.second != rhs.second);
}
template <class T1, class T2>
bool operator< (const pair<T1,T2>& lhs, const pair<T1,T2>& rhs)
{
return (lhs.first < rhs.first && lhs.second < rhs.second);
}
template <class T1, class T2>
bool operator<= (const pair<T1,T2>& lhs, const pair<T1,T2>& rhs)
{
return (lhs.first <= rhs.first && lhs.second <= rhs.second);
}
template <class T1, class T2>
bool operator> (const pair<T1,T2>& lhs, const pair<T1,T2>& rhs)
{
return (lhs.first > rhs.first && lhs.second > rhs.second);
}
template <class T1, class T2>
bool operator>= (const pair<T1,T2>& lhs, const pair<T1,T2>& rhs)
{
return (lhs.first >= rhs.first && lhs.second >= rhs.second);
}
template <class T1,class T2>
pair<T1,T2> make_pair (T1 x, T2 y)
{
return ( pair<T1,T2>(x,y) );
};
}
#endif