import Fraction from 'konpeito/src/math/core/Fraction.js'

public class | source

Fraction

Extends:

KonpeitoInteger → Fraction

Fraction class (immutable).

Static Member Summary

Static Public Members
public static get	HALF: Fraction: * 0.5
public static get	MINUS_ONE: Fraction: * -1
public static get	NEGATIVE_INFINITY: Fraction: * Negative Infinity.
public static get	NaN: Fraction: * Not a Number.
public static get	ONE: Fraction: * 1
public static get	POSITIVE_INFINITY: Fraction: * Positive infinity.
public static get	TEN: Fraction: * 10
public static get	TWO: Fraction: * 2
public static get	ZERO: Fraction: * 0

Static Method Summary

Static Public Methods
public static	create(number: KFractionInputData): Fraction Create an entity object of this class.
public static	valueOf(number: KFractionInputData): Fraction Convert number to Fraction type.

Constructor Summary

Public Constructor
public	constructor(number: KFractionInputData) Create an fraction.

Member Summary

Public Members
public get	booleanValue: boolean: * boolean value.
public	denominator: BigInteger denominator
public get	doubleValue: number: * floating point.
public get	intValue: number: * integer value.
public	numerator: BigInteger numerator

Method Summary

Public Methods
public	abs(): Fraction Absolute value.
public	add(num: KFractionInputData): Fraction Add.
public	and(number: KFractionInputData): Fraction Logical AND.
public	ceil(): Fraction Ceil.
public	clip(min: KFractionInputData, max: KFractionInputData): Fraction Clip number within range.
public	clone(): Fraction Deep copy.
public	compareTo(num: KFractionInputData): number Compare values.
public	div(num: KFractionInputData): Fraction Divide.
public	divide(number: KFractionInputData): Fraction Divide.
public	equals(num: KFractionInputData): boolean Equals.
public	equalsState(number: KFractionInputData): boolean Numeric type match.
public	extgcd(number: KFractionInputData): Array<Fraction> Extended Euclidean algorithm.
public	factor(): Fraction[] Factorization.
public	factorial(): Fraction Factorial function, x!.
public	fix(): Fraction To integer rounded down to the nearest.
public	floor(): Fraction Floor.
public	fract(): Fraction Fraction.
public	gcd(number: KFractionInputData): Fraction Euclidean algorithm.
public	inv(): Fraction Inverse number of this value.
public	isFinite(): boolean Return true if the value is finite number.
public	isInfinite(): boolean this === Infinity or -Infinity
public	isInteger(): boolean Return true if the value is integer.
public	isNaN(): boolean this === NaN
public	isNegative(): boolean this < 0
public	isNegativeInfinity(): boolean this === -Infinity
public	isNotNegative(): boolean this >= 0
public	isOne(): boolean this === 1
public	isPositive(): boolean this > 0
public	isPositiveInfinity(): boolean this === Infinity
public	isPrime(): boolean Return true if the value is prime number.
public	isProbablePrime(certainty: KFractionInputData): boolean Return true if the value is prime number by Miller-Labin prime number determination method.
public	isRepeatingDecimal(): boolean Return true if the value is repeating decimal.
public	isZero(): boolean this === 0
public	lcm(number: KFractionInputData): Fraction Least common multiple.
public	max(number: KFractionInputData): Fraction Maximum number.
public	min(number: KFractionInputData): Fraction Minimum number.
public	mod(num: KFractionInputData): Fraction Modulo, positive remainder of division.
public	modInverse(m: KFractionInputData): Fraction Modular multiplicative inverse.
public	modPow(exponent: KFractionInputData, m: KFractionInputData): Fraction Modular exponentiation.
public	mul(num: KFractionInputData): Fraction Multiply.
public	multiply(number: KFractionInputData): Fraction Multiply.
public	negate(): Fraction this * -1
public	nextProbablePrime(certainty: KFractionInputData, search_max: KFractionInputData): Fraction Next prime.
public	not(): Fraction Logical Not.
public	or(number: KFractionInputData): Fraction Logical OR.
public	pow(num: KFractionInputData): Fraction Power function.
public	rem(num: KFractionInputData): Fraction Modulo, positive remainder of division.
public	remainder(number: KFractionInputData): Fraction Remainder of division.
public	round(): Fraction Rounding to the nearest integer.
public	scaleByPowerOfTen(n: KFractionInputData): Fraction Multiply a multiple of ten.
public	shift(n: KFractionInputData): Fraction this << n Calculated as an integer.
public	sign(): number The positive or negative sign of this number.
public	signum(): number The positive or negative sign of this number.
public	square(): Fraction Square.
public	sub(num: KFractionInputData): Fraction Subtract.
public	subtract(number: KFractionInputData): Fraction Subtract.
public	toBigDecimal(mc: MathContext): BigDecimal return BigDecimal.
public	toBigInteger(): BigInteger return BigInteger.
public	toComplex(): Complex return Complex.
public	toFraction(): Fraction return Fraction.
public	toFractionString(): string Convert to string.
public	toJSON(): string Convert to JSON.
public	toMatrix(): Matrix return Matrix.
public	toPlainString(depth_max: KFractionInputData): string Convert to string.
public	toString(): string Convert to string.
public	xor(number: KFractionInputData): Fraction Logical Exclusive-OR.

Inherited Summary

From class KonpeitoInteger
public static get	MINUS_ONE: KonpeitoInteger: * -1
public static get	NEGATIVE_INFINITY: KonpeitoInteger: * Negative Infinity.
public static get	NaN: KonpeitoInteger: * Not a Number.
public static get	ONE: KonpeitoInteger: * 1
public static get	POSITIVE_INFINITY: KonpeitoInteger: * Positive infinity.
public static get	TEN: KonpeitoInteger: * 10
public static get	TWO: KonpeitoInteger: * 2
public static get	ZERO: KonpeitoInteger: * 0
public static	create(number: any): KonpeitoInteger Create an entity object of this class.
public static	valueOf(number: any): KonpeitoInteger Create number.
public get	booleanValue: boolean: * boolean value.
public get	doubleValue: number: * floating point.
public get	intValue: number: * integer value.
public	abs(): KonpeitoInteger Absolute value.
public	add(number: any): KonpeitoInteger Add.
public	and(number: any): KonpeitoInteger Logical AND.
public	ceil(): KonpeitoInteger Ceil.
public	clone(): KonpeitoInteger Deep copy.
public	compareTo(number: any): number Compare values.
public	div(number: any): KonpeitoInteger Divide.
public	divide(number: any): KonpeitoInteger Divide.
public	equals(number: any): boolean Equals.
public	extgcd(number: any): KonpeitoInteger[] Extended Euclidean algorithm.
public	factor(): KonpeitoInteger[] Factorization.
public	factorial(): KonpeitoInteger Factorial function, x!.
public	fix(): KonpeitoInteger To integer rounded down to the nearest.
public	floor(): KonpeitoInteger Floor.
public	fract(): KonpeitoInteger Fraction.
public	gcd(number: any): KonpeitoInteger Euclidean algorithm.
public	inv(): KonpeitoInteger Inverse number of this value.
public	isFinite(): boolean Return true if the value is finite number.
public	isInfinite(): boolean this === Infinity or -Infinity
public	isNaN(): boolean this === NaN
public	isNegative(): boolean this < 0
public	isNegativeInfinity(): boolean this === -Infinity
public	isNotNegative(): boolean this >= 0
public	isOne(): boolean this === 1
public	isPositive(): boolean this > 0
public	isPositiveInfinity(): boolean this === Infinity
public	isPrime(): boolean Return true if the value is prime number.
public	isProbablePrime(certainty: any): boolean Return true if the value is prime number by Miller-Labin prime number determination method.
public	isZero(): boolean this === 0
public	lcm(number: any): KonpeitoInteger Least common multiple.
public	mod(number: any): KonpeitoInteger Modulo, positive rem of division.
public	modInverse(m: any): KonpeitoInteger Modular multiplicative inverse.
public	modPow(exponent: any, m: any): KonpeitoInteger Modular exponentiation.
public	mul(number: any): KonpeitoInteger Multiply.
public	multiply(number: any): KonpeitoInteger Multiply.
public	negate(): KonpeitoInteger this * -1
public	nextProbablePrime(certainty: any, search_max: any): KonpeitoInteger Next prime.
public	not(): KonpeitoInteger Logical Not.
public	or(number: any): KonpeitoInteger Logical OR.
public	pow(exponent: any): KonpeitoInteger Power function.
public	rem(number: any): KonpeitoInteger Remainder of division.
public	remainder(number: any): KonpeitoInteger Remainder of division.
public	round(): KonpeitoInteger Rounding to the nearest integer.
public	scaleByPowerOfTen(n: any): KonpeitoInteger Multiply a multiple of ten.
public	shift(n: any): KonpeitoInteger this << n
public	sign(): any The positive or negative sign of this number.
public	signum(): any The positive or negative sign of this number.
public	square(): KonpeitoInteger Square.
public	sub(number: any): KonpeitoInteger Subtract.
public	subtract(number: any): KonpeitoInteger Subtract.
public	toBigDecimal(mc: MathContext): BigDecimal return BigDecimal.
public	toBigInteger(): BigInteger return BigInteger.
public	toComplex(): Complex return Complex.
public	toFraction(): Fraction return Fraction.
public	toJSON(): string Convert to JSON.
public	toMatrix(): Matrix return Matrix.
public	toString(): string Convert to string.
public	xor(number: any): KonpeitoInteger Logical Exclusive-OR.

Static Public Members

public static get HALF: Fraction: * source

0.5

Return:

Fraction

0.5

public static get MINUS_ONE: Fraction: * source

-1

Override:

KonpeitoInteger#MINUS_ONE

Return:

Fraction

public static get NEGATIVE_INFINITY: Fraction: * source

Negative Infinity.

Override:

KonpeitoInteger#NEGATIVE_INFINITY

Return:

Fraction

Infinity

public static get NaN: Fraction: * source

Not a Number.

Override:

KonpeitoInteger#NaN

Return:

Fraction

NaN

public static get ONE: Fraction: * source

Override:

KonpeitoInteger#ONE

Return:

Fraction

public static get POSITIVE_INFINITY: Fraction: * source

Positive infinity.

Override:

KonpeitoInteger#POSITIVE_INFINITY

Return:

Fraction

Infinity

public static get TEN: Fraction: * source

Override:

KonpeitoInteger#TEN

Return:

Fraction

public static get TWO: Fraction: * source

Override:

KonpeitoInteger#TWO

Return:

Fraction

public static get ZERO: Fraction: * source

Override:

KonpeitoInteger#ZERO

Return:

Fraction

Static Public Methods

public static create(number: KFractionInputData): Fraction source

Create an entity object of this class.

Override:

KonpeitoInteger#create

Params:

Name	Type	Attribute	Description
number	KFractionInputData

Return:

Fraction

public static valueOf(number: KFractionInputData): Fraction source

Convert number to Fraction type.

Override:

KonpeitoInteger#valueOf

Params:

Name	Type	Attribute	Description
number	KFractionInputData

Return:

Fraction

Public Constructors

public constructor(number: KFractionInputData) source

Create an fraction.

Initialization can be performed as follows.

10, "10", "10/1", "10.0/1.0", ["10", "1"], [10, 1]
0.01, "0.01", "0.1e-1", "1/100", [1, 100], [2, 200], ["2", "200"]
"1/3", "0.[3]", "0.(3)", "0.'3'", "0."3"", [1, 3], [2, 6]
"3.555(123)" = 3.555123123123..., "147982 / 41625"

Override:

KonpeitoInteger#constructor

Params:

Name	Type	Attribute	Description
number	KFractionInputData	optional	Fraction data. See how to use the function.

Public Members

public get booleanValue: boolean: * source

boolean value.

Override:

KonpeitoInteger#booleanValue

Return:

boolean

public denominator: BigInteger source

denominator

public get doubleValue: number: * source

floating point.

Override:

KonpeitoInteger#doubleValue

Return:

number

public get intValue: number: * source

integer value.

Override:

KonpeitoInteger#intValue

Return:

number

public numerator: BigInteger source

numerator

Public Methods

public abs(): Fraction source

Absolute value.

Override:

KonpeitoInteger#abs

Return:

Fraction

abs(A)

public add(num: KFractionInputData): Fraction source

Add.

Override:

KonpeitoInteger#add

Params:

Name	Type	Attribute	Description
num	KFractionInputData

Return:

Fraction

A + B

public and(number: KFractionInputData): Fraction source

Logical AND.

Calculated as an integer.

Override:

KonpeitoInteger#and

Params:

Name	Type	Attribute	Description
number	KFractionInputData

Return:

Fraction

A & B

public ceil(): Fraction source

Ceil.

Override:

KonpeitoInteger#ceil

Return:

Fraction

ceil(A)

public clip(min: KFractionInputData, max: KFractionInputData): Fraction source

Clip number within range.

Params:

Name	Type	Attribute	Description
min	KFractionInputData
max	KFractionInputData

Return:

Fraction

min(max(x, min), max)

public clone(): Fraction source

Deep copy.

Override:

KonpeitoInteger#clone

Return:

Fraction

public compareTo(num: KFractionInputData): number source

Compare values.

Override:

KonpeitoInteger#compareTo

Params:

Name	Type	Attribute	Description
num	KFractionInputData

Return:

number

A > B ? 1 : (A === B ? 0 : -1)

public div(num: KFractionInputData): Fraction source

Divide.

Override:

KonpeitoInteger#div

Params:

Name	Type	Attribute	Description
num	KFractionInputData

Return:

Fraction

A / B

public divide(number: KFractionInputData): Fraction source

Divide.

Override:

KonpeitoInteger#divide

Params:

Name	Type	Attribute	Description
number	KFractionInputData

Return:

Fraction

fix(A / B)

public equals(num: KFractionInputData): boolean source

Equals.

Override:

KonpeitoInteger#equals

Params:

Name	Type	Attribute	Description
num	KFractionInputData

Return:

boolean

A === B

public equalsState(number: KFractionInputData): boolean source

Numeric type match.

Params:

Name	Type	Attribute	Description
number	KFractionInputData

Return:

boolean

public extgcd(number: KFractionInputData): Array<Fraction> source

Extended Euclidean algorithm.

Calculated as an integer.

Override:

KonpeitoInteger#extgcd

Params:

Name	Type	Attribute	Description
number	KFractionInputData

Return:

Array<Fraction>

[a, b, gcd(x, y)], Result of calculating ax + by = gcd(x, y).

public factor(): Fraction[] source

Factorization.

Calculated as an integer.
Calculate up to 9007199254740991.

Override:

KonpeitoInteger#factor

Return:

Fraction[]

factor

public factorial(): Fraction source

Factorial function, x!.

Supports only integers.

Override:

KonpeitoInteger#factorial

Return:

Fraction

public fix(): Fraction source

To integer rounded down to the nearest.

Override:

KonpeitoInteger#fix

Return:

Fraction

fix(A), trunc(A)

public floor(): Fraction source

Floor.

Override:

KonpeitoInteger#floor

Return:

Fraction

floor(A)

public fract(): Fraction source

Fraction.

Override:

KonpeitoInteger#fract

Return:

Fraction

fract(A)

public gcd(number: KFractionInputData): Fraction source

Euclidean algorithm.

Calculated as an integer.

Override:

KonpeitoInteger#gcd

Params:

Name	Type	Attribute	Description
number	KFractionInputData

Return:

Fraction

gcd(x, y)

public inv(): Fraction source

Inverse number of this value.

Override:

KonpeitoInteger#inv

Return:

Fraction

1 / A

public isFinite(): boolean source

Return true if the value is finite number.

Override:

KonpeitoInteger#isFinite

Return:

boolean

!isNaN(A) && !isInfinite(A)

public isInfinite(): boolean source

this === Infinity or -Infinity

Override:

KonpeitoInteger#isInfinite

Return:

boolean

isPositiveInfinity(A) || isNegativeInfinity(A)

public isInteger(): boolean source

Return true if the value is integer.

Return:

boolean

public isNaN(): boolean source

this === NaN

Override:

KonpeitoInteger#isNaN

Return:

boolean

isNaN(A)

public isNegative(): boolean source

this < 0

Override:

KonpeitoInteger#isNegative

Return:

boolean

public isNegativeInfinity(): boolean source

this === -Infinity

Override:

KonpeitoInteger#isNegativeInfinity

Return:

boolean

isNegativeInfinity(A)

public isNotNegative(): boolean source

this >= 0

Override:

KonpeitoInteger#isNotNegative

Return:

boolean

public isOne(): boolean source

this === 1

Override:

KonpeitoInteger#isOne

Return:

boolean

A === 1

public isPositive(): boolean source

this > 0

Override:

KonpeitoInteger#isPositive

Return:

boolean

public isPositiveInfinity(): boolean source

this === Infinity

Override:

KonpeitoInteger#isPositiveInfinity

Return:

boolean

isPositiveInfinity(A)

public isPrime(): boolean source

Return true if the value is prime number.

Calculated as an integer.
Calculate up to 9007199254740991.

Override:

KonpeitoInteger#isPrime

Return:

boolean

If the calculation range is exceeded, null is returned.

public isProbablePrime(certainty: KFractionInputData): boolean source

Return true if the value is prime number by Miller-Labin prime number determination method.

Attention : it takes a very long time to process.

Calculated as an integer.

Override:

KonpeitoInteger#isProbablePrime

Params:

Name	Type	Attribute	Description
certainty	KFractionInputData	optional default: 100	Repeat count (prime precision).

Return:

boolean

public isRepeatingDecimal(): boolean source

Return true if the value is repeating decimal.

Return:

boolean

public isZero(): boolean source

this === 0

Override:

KonpeitoInteger#isZero

Return:

boolean

A === 0

public lcm(number: KFractionInputData): Fraction source

Least common multiple.

Calculated as an integer.

Override:

KonpeitoInteger#lcm

Params:

Name	Type	Attribute	Description
number	KFractionInputData

Return:

Fraction

lcm(x, y)

public max(number: KFractionInputData): Fraction source

Maximum number.

Params:

Name	Type	Attribute	Description
number	KFractionInputData

Return:

Fraction

max([A, B])

public min(number: KFractionInputData): Fraction source

Minimum number.

Params:

Name	Type	Attribute	Description
number	KFractionInputData

Return:

Fraction

min([A, B])

public mod(num: KFractionInputData): Fraction source

Modulo, positive remainder of division.

Result has same sign as the Divisor.

Override:

KonpeitoInteger#mod

Params:

Name	Type	Attribute	Description
num	KFractionInputData

Return:

Fraction

A mod B

public modInverse(m: KFractionInputData): Fraction source

Modular multiplicative inverse.

Calculated as an integer.

Override:

KonpeitoInteger#modInverse

Params:

Name	Type	Attribute	Description
m	KFractionInputData

Return:

Fraction

A^(-1) mod m

public modPow(exponent: KFractionInputData, m: KFractionInputData): Fraction source

Modular exponentiation.

Calculated as an integer.

Override:

KonpeitoInteger#modPow

Params:

Name	Type	Attribute	Description
exponent	KFractionInputData
m	KFractionInputData

Return:

Fraction

A^B mod m

public mul(num: KFractionInputData): Fraction source

Multiply.

Override:

KonpeitoInteger#mul

Params:

Name	Type	Attribute	Description
num	KFractionInputData

Return:

Fraction

A * B

public multiply(number: KFractionInputData): Fraction source

Multiply.

Override:

KonpeitoInteger#multiply

Params:

Name	Type	Attribute	Description
number	KFractionInputData

Return:

Fraction

A * B

public negate(): Fraction source

this * -1

Override:

KonpeitoInteger#negate

Return:

Fraction

public nextProbablePrime(certainty: KFractionInputData, search_max: KFractionInputData): Fraction source

Next prime.

Override:

KonpeitoInteger#nextProbablePrime

Params:

Name	Type	Attribute	Description
certainty	KFractionInputData	optional default: 100	Repeat count (prime precision).
search_max	KFractionInputData	optional default: 100000	Search range of next prime.