-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathrational.hpp
92 lines (77 loc) · 1.46 KB
/
rational.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
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
// This file is covered by the LICENSE file in the root of this project.
#pragma once
#include <cassert>
#include <cmath>
#include <utility>
template<typename T>
class Rational
{
public:
Rational() = default;
Rational(T numerator, T denominator = 1)
{
numerator_ = numerator;
denominator_ = denominator;
reduce();
}
T numerator() const
{
return numerator_;
}
T denominator() const
{
return denominator_;
}
bool is_zero() const
{
return numerator_ == 0;
}
private:
static T exchange(T& value, T new_value)
{
auto old_value = value;
value = new_value;
return old_value;
}
static T gcd(T x, T y)
{
// x = std::abs(x);
// y = std::abs(y);
while (y != 0)
x = exchange(y, x % y);
return x;
}
void reduce()
{
const auto d = gcd(numerator_, denominator_);
numerator_ /= d;
denominator_ /= d;
}
private:
T numerator_;
T denominator_;
};
template<typename T>
class Rational_hash
{
public:
std::size_t operator()(const Rational<T>& r) const
{
std::hash<T> h;
auto h1 = h(r.numerator());
auto h2 = h(r.denominator());
return h1 ^ h2;
}
};
template<typename T>
bool operator<(const Rational<T>& r1, const Rational<T>& r2)
{
if (r1.numerator() != r2.numerator())
return r1.numerator() < r2.numerator();
return r1.denominator() < r2.denominator();
}
template<typename T>
bool operator==(const Rational<T>& r1, const Rational<T>& r2)
{
return r1.numerator() == r2.numerator() && r1.denominator() == r2.denominator();
}