public class Rational
extends java.lang.Number
implements java.io.Serializable
numerator/denominator.
| Constructor and Description |
|---|
Rational(int numerator,
int denominator)
Creates a new instance of Rational.
|
| Modifier and Type | Method and Description |
|---|---|
byte |
byteValue()
Returns the value of the specified number as a
byte. |
double |
doubleValue()
Returns the value of the specified number as a
double. |
boolean |
equals(java.lang.Object obj)
Compares two
Rational instances, returning true if they are mathematically
equivalent. |
float |
floatValue()
Returns the value of the specified number as a
float. |
int |
getDenominator()
Returns the denominator.
|
int |
getNumerator()
Returns the numerator.
|
Rational |
getReciprocal()
Returns the reciprocal value of this obejct as a new Rational.
|
Rational |
getSimplifiedInstance()
Simplifies the Rational number.
|
int |
intValue()
Returns the value of the specified number as an
int. |
boolean |
isInteger()
Checks if this rational number is an Integer, either positive or negative.
|
long |
longValue()
Returns the value of the specified number as a
long. |
short |
shortValue()
Returns the value of the specified number as a
short. |
java.lang.String |
toSimpleString(boolean allowDecimal)
Returns the simplest represenation of this Rational's value possible.
|
java.lang.String |
toString()
Returns a string representation of the object of form
numerator/denominator. |
public Rational(int numerator,
int denominator)
public double doubleValue()
double.
This may involve rounding.doubleValue in class java.lang.Numberdouble.public float floatValue()
float.
This may involve rounding.floatValue in class java.lang.Numberfloat.public final byte byteValue()
byte.
This may involve rounding or truncation. This implementation simply
casts the result of doubleValue() to byte.byteValue in class java.lang.Numberbyte.public final int intValue()
int.
This may involve rounding or truncation. This implementation simply
casts the result of doubleValue() to int.intValue in class java.lang.Numberint.public final long longValue()
long.
This may involve rounding or truncation. This implementation simply
casts the result of doubleValue() to long.longValue in class java.lang.Numberlong.public final short shortValue()
short.
This may involve rounding or truncation. This implementation simply
casts the result of doubleValue() to short.shortValue in class java.lang.Numbershort.public final int getDenominator()
public final int getNumerator()
public Rational getReciprocal()
public boolean isInteger()
public java.lang.String toString()
numerator/denominator.toString in class java.lang.Objectpublic java.lang.String toSimpleString(boolean allowDecimal)
public boolean equals(java.lang.Object obj)
Rational instances, returning true if they are mathematically
equivalent.equals in class java.lang.Objectobj - the Rational to compare this instance to.obj is not an instance of Rational.public Rational getSimplifiedInstance()
Simplifies the Rational number.
Prime number series: 1, 2, 3, 5, 7, 9, 11, 13, 17
To reduce a rational, need to see if both numerator and denominator are divisible by a common factor. Using the prime number series in ascending order guarantees the minimun number of checks required.
However, generating the prime number series seems to be a hefty task. Perhaps it's simpler to check if both d & n are divisible by all numbers from 2 -> (Math.min(denominator, numerator) / 2). In doing this, one can check for 2 and 5 once, then ignore all even numbers, and all numbers ending in 0 or 5. This leaves four numbers from every ten to check.
Therefore, the max number of pairs of modulus divisions required will be:
4 Math.min(denominator, numerator) - 1
-- * ------------------------------------ + 2
10 2
Math.min(denominator, numerator) - 1
= ------------------------------------ + 2
5
Copyright © 2006 Drew Noakes. All Rights Reserved.