-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathpair.hpp
More file actions
75 lines (59 loc) · 1.75 KB
/
pair.hpp
File metadata and controls
75 lines (59 loc) · 1.75 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
72
73
74
75
#ifndef PAIR_HPP
#define PAIR_HPP
#include <iostream>
#include <memory>
namespace ft{
template <class T1, class T2>
struct pair{
typedef T1 first_type;
typedef T2 second_type;
T1 first;
T2 second;
pair() : first(), second() {};
pair(T1 const& t1, T2 const& t2) : first(t1), second(t2) {};
template <typename U1, typename U2>
pair(const pair<U1, U2>& p) : first(p.first), second(p.second) {};
pair& operator=(pair const& p)
{
first = p.first;
second = p.second;
return (*this);
}
};
template <typename U1, typename U2>
bool operator==(const pair<U1, U2>& lhs, const pair<U1, U2>& rhs)
{
return (lhs.first == rhs.first && lhs.second == rhs.second);
};
template <typename U1, typename U2>
bool operator!=(const pair<U1, U2>& lhs, const pair<U1, U2>& rhs)
{
return !(lhs == rhs);
};
template <typename U1, typename U2>
bool operator<(const pair<U1, U2>& lhs, const pair<U1, U2>& rhs)
{
return (lhs.first < rhs.first || (!(lhs.first < rhs.first) && lhs.second < rhs.second));
};
template <typename U1, typename U2>
bool operator>(const pair<U1, U2>& lhs, const pair<U1, U2>& rhs)
{
return (rhs < lhs);
};
template <typename U1, typename U2>
bool operator>=(const pair<U1, U2>& lhs, const pair<U1, U2>& rhs)
{
return !(lhs < rhs);
};
template <typename U1, typename U2>
bool operator<=(const pair<U1, U2>& lhs, const pair<U1, U2>& rhs)
{
return !(rhs < lhs);
};
template <typename T1, typename T2>
pair<T1, T2> make_pair(T1 t, T2 u)
{
return (pair<T1, T2>(t, u));
};
}
#endif