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
|
/**
* @file
* @brief Source file for Fraction class
* @author Jonathan Thomas <jonathan@openshot.org>
*
* @section LICENSE
*
* Copyright (c) 2008-2014 OpenShot Studios, LLC
* <http://www.openshotstudios.com/>. This file is part of
* OpenShot Library (libopenshot), an open-source project dedicated to
* delivering high quality video editing and animation solutions to the
* world. For more information visit <http://www.openshot.org/>.
*
* OpenShot Library (libopenshot) is free software: you can redistribute it
* and/or modify it under the terms of the GNU Lesser General Public License
* as published by the Free Software Foundation, either version 3 of the
* License, or (at your option) any later version.
*
* OpenShot Library (libopenshot) is distributed in the hope that it will be
* useful, but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with OpenShot Library. If not, see <http://www.gnu.org/licenses/>.
*/
#include "../include/Fraction.h"
using namespace openshot;
// Constructor
Fraction::Fraction() :
num(1), den(1) {
}
Fraction::Fraction(int num, int den) :
num(num), den(den) {
}
// Return this fraction as a float (i.e. 1/2 = 0.5)
float Fraction::ToFloat() {
return float(num) / float(den);
}
// Return this fraction as a double (i.e. 1/2 = 0.5)
double Fraction::ToDouble() {
return double(num) / double(den);
}
// Return a rounded integer of the frame rate (for example 30000/1001 returns 30 fps)
int Fraction::ToInt() {
return round((double) num / den);
}
// Calculate the greatest common denominator
int Fraction::GreatestCommonDenominator() {
int first = num;
int second = den;
// Find the biggest whole number that will divide into both the numerator
// and denominator
int t;
while (second != 0) {
t = second;
second = first % second;
first = t;
}
return first;
}
void Fraction::Reduce() {
// Get the greatest common denominator
int GCD = GreatestCommonDenominator();
// Reduce this fraction to the smallest possible whole numbers
num = num / GCD;
den = den / GCD;
}
// Return the reciprocal as a new Fraction
Fraction Fraction::Reciprocal()
{
// flip the fraction
return Fraction(den, num);
}
|
