1
0
mirror of https://github.com/vlang/v.git synced 2023-08-10 21:13:21 +03:00
v/vlib/math/fraction.v

104 lines
2.3 KiB
Go
Raw Normal View History

2019-07-03 13:12:36 +03:00
// Copyright (c) 2019 Alexander Medvednikov. All rights reserved.
// Use of this source code is governed by an MIT license
// that can be found in the LICENSE file.
module math
// Fraction Struct
struct Fraction {
n i64
d i64
2019-07-03 13:12:36 +03:00
}
// A factory function for creating a Fraction, adds a boundary condition
pub fn fraction(n i64,d i64) Fraction{
2019-07-03 13:12:36 +03:00
if d != 0 {
return Fraction{n,d}
}
else {
panic('Denominator cannot be zero')
}
}
// To String method
pub fn (f Fraction) str() string {
return '$f.n/$f.d'
}
// Fraction add using operator overloading
pub fn (f1 Fraction) + (f2 Fraction) Fraction {
if f1.d == f2.d {
return Fraction{f1.n + f2.n,f1.d}
}
else {
return Fraction{(f1.n * f2.d) + (f2.n * f1.d),f1.d * f2.d}
}
}
// Fraction substract using operator overloading
pub fn (f1 Fraction) - (f2 Fraction) Fraction {
if f1.d == f2.d {
return Fraction{f1.n - f2.n,f1.d}
}
else {
return Fraction{(f1.n * f2.d) - (f2.n * f1.d),f1.d * f2.d}
}
}
// Fraction multiply using operator overloading
// pub fn (f1 Fraction) * (f2 Fraction) Fraction {
// return Fraction{f1.n * f2.n,f1.d * f2.d}
// }
// Fraction divide using operator overloading
// pub fn (f1 Fraction) / (f2 Fraction) Fraction {
// return Fraction{f1.n * f2.d,f1.d * f2.n}
// }
// Fraction add method
pub fn (f1 Fraction) add(f2 Fraction) Fraction {
return f1 + f2
}
// Fraction subtract method
pub fn (f1 Fraction) subtract(f2 Fraction) Fraction {
2019-07-03 13:12:36 +03:00
return f1 - f2
}
// Fraction multiply method
pub fn (f1 Fraction) multiply(f2 Fraction) Fraction {
return Fraction{f1.n * f2.n,f1.d * f2.d}
}
// Fraction divide method
pub fn (f1 Fraction) divide(f2 Fraction) Fraction {
return Fraction{f1.n * f2.d,f1.d * f2.n}
}
// Fraction reciprocal method
pub fn (f1 Fraction) reciprocal() Fraction {
return Fraction{f1.d,f1.n}
}
// Fraction method which gives greatest common divisor of numerator and denominator
pub fn (f1 Fraction) gcd() i64 {
2019-07-03 13:12:36 +03:00
return gcd(f1.n,f1.d)
}
// Fraction method which reduces the fraction
pub fn (f1 Fraction) reduce() Fraction {
cf := gcd(f1.n,f1.d)
return Fraction{f1.n/cf,f1.d/cf}
}
// Converts Fraction to decimal
pub fn (f1 Fraction) f64() f64 {
2019-07-03 13:12:36 +03:00
return f64(f1.n)/f64(f1.d)
}
// Compares two Fractions
pub fn (f1 Fraction) equals(f2 Fraction) bool {
r1 := f1.reduce()
r2 := f2.reduce()
return (r1.n == r2.n) && (r1.d == r2.d)
2019-07-03 13:12:36 +03:00
}