import KonpeitoInteger from 'konpeito/src/math/core/base/KonpeitoInteger.js'

public class | source

KonpeitoInteger

Direct Subclass:

BigInteger, Fraction, KonpeitoFloat

Indirect Subclass:

BigDecimal, Complex, Matrix

Base class for numbers (immutable).

Static Member Summary

Static Public Members
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

Static Method Summary

Static Public Methods
public static	create(number: any): KonpeitoInteger Create an entity object of this class.
public static	valueOf(number: any): KonpeitoInteger Create number.

Constructor Summary

Public Constructor
public	constructor(number: any) Create an number.

Member Summary

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

Method Summary

Public Methods
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 MINUS_ONE: KonpeitoInteger: * source

-1

Return:

KonpeitoInteger

public static get NEGATIVE_INFINITY: KonpeitoInteger: * source

Negative Infinity.

Return:

KonpeitoInteger

Infinity

public static get NaN: KonpeitoInteger: * source

Not a Number.

Return:

KonpeitoInteger

NaN

public static get ONE: KonpeitoInteger: * source

Return:

KonpeitoInteger

public static get POSITIVE_INFINITY: KonpeitoInteger: * source

Positive infinity.

Return:

KonpeitoInteger

Infinity

public static get TEN: KonpeitoInteger: * source

Return:

KonpeitoInteger

public static get TWO: KonpeitoInteger: * source

Return:

KonpeitoInteger

public static get ZERO: KonpeitoInteger: * source

Return:

KonpeitoInteger

Static Public Methods

public static create(number: any): KonpeitoInteger source

Create an entity object of this class.

Params:

Name	Type	Attribute	Description
number	any

Return:

KonpeitoInteger

public static valueOf(number: any): KonpeitoInteger source

Create number.

Params:

Name	Type	Attribute	Description
number	any

Return:

KonpeitoInteger

Public Constructors

public constructor(number: any) source

Create an number.

Params:

Name	Type	Attribute	Description
number	any	optional	Numeric data. See how to use the function.

Public Members

public get booleanValue: boolean: * source

boolean value.

Return:

boolean

public get doubleValue: number: * source

floating point.

Return:

number

public get intValue: number: * source

integer value.

Return:

number

Public Methods

public abs(): KonpeitoInteger source

Absolute value.

Return:

KonpeitoInteger

abs(A)

public add(number: any): KonpeitoInteger source

Add.

Params:

Name	Type	Attribute	Description
number	any

Return:

KonpeitoInteger

A + B

public and(number: any): KonpeitoInteger source

Logical AND.

Params:

Name	Type	Attribute	Description
number	any

Return:

KonpeitoInteger

A & B

public ceil(): KonpeitoInteger source

Ceil.

Return:

KonpeitoInteger

ceil(A)

public clone(): KonpeitoInteger source

Deep copy.

Return:

KonpeitoInteger

public compareTo(number: any): number source

Compare values.

Params:

Name	Type	Attribute	Description
number	any

Return:

number

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

public div(number: any): KonpeitoInteger source

Divide.

Params:

Name	Type	Attribute	Description
number	any

Return:

KonpeitoInteger

fix(A / B)

public divide(number: any): KonpeitoInteger source

Divide.

Params:

Name	Type	Attribute	Description
number	any

Return:

KonpeitoInteger

fix(A / B)

public equals(number: any): boolean source

Equals.

Params:

Name	Type	Attribute	Description
number	any

Return:

boolean

A === B

public extgcd(number: any): KonpeitoInteger[] source

Extended Euclidean algorithm.

Params:

Name	Type	Attribute	Description
number	any

Return:

KonpeitoInteger[]

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

public factor(): KonpeitoInteger[] source

Factorization.

Calculate up to 9007199254740991.

Return:

KonpeitoInteger[]

factor

public factorial(): KonpeitoInteger source

Factorial function, x!.

Return:

KonpeitoInteger

public fix(): KonpeitoInteger source

To integer rounded down to the nearest.

Return:

KonpeitoInteger

fix(A), trunc(A)

public floor(): KonpeitoInteger source

Floor.

Return:

KonpeitoInteger

floor(A)

public fract(): KonpeitoInteger source

Fraction.

Return:

KonpeitoInteger

fract(A)

public gcd(number: any): KonpeitoInteger source

Euclidean algorithm.

Params:

Name	Type	Attribute	Description
number	any

Return:

KonpeitoInteger

gcd(x, y)

public inv(): KonpeitoInteger source

Inverse number of this value.

Return:

KonpeitoInteger

1 / A

public isFinite(): boolean source

Return true if the value is finite number.

Return:

boolean

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

public isInfinite(): boolean source

this === Infinity or -Infinity

Return:

boolean

isPositiveInfinity(A) || isNegativeInfinity(A)

public isNaN(): boolean source

this === NaN

Return:

boolean

isNaN(A)

public isNegative(): boolean source

this < 0

Return:

boolean

public isNegativeInfinity(): boolean source

this === -Infinity

Return:

boolean

isNegativeInfinity(A)

public isNotNegative(): boolean source

this >= 0

Return:

boolean

public isOne(): boolean source

this === 1

Return:

boolean

public isPositive(): boolean source

this > 0

Return:

boolean

public isPositiveInfinity(): boolean source

this === Infinity

Return:

boolean

isPositiveInfinity(A)

public isPrime(): boolean source

Return true if the value is prime number.

Calculate up to 9007199254740991.

Return:

boolean

If the calculation range is exceeded, null is returned.

public isProbablePrime(certainty: any): 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.

Params:

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

Return:

boolean

public isZero(): boolean source

this === 0

Return:

boolean

public lcm(number: any): KonpeitoInteger source

Least common multiple.

Params:

Name	Type	Attribute	Description
number	any

Return:

KonpeitoInteger

lcm(x, y)

public mod(number: any): KonpeitoInteger source

Modulo, positive rem of division.

Result has same sign as the Divisor.

Params:

Name	Type	Attribute	Description
number	any

Return:

KonpeitoInteger

A mod B

public modInverse(m: any): KonpeitoInteger source

Modular multiplicative inverse.

Params:

Name	Type	Attribute	Description
m	any

Return:

KonpeitoInteger

A^(-1) mod m

public modPow(exponent: any, m: any): KonpeitoInteger source

Modular exponentiation.

Params:

Name	Type	Attribute	Description
exponent	any
m	any

Return:

KonpeitoInteger

A^B mod m

public mul(number: any): KonpeitoInteger source

Multiply.

Params:

Name	Type	Attribute	Description
number	any

Return:

KonpeitoInteger

A * B

public multiply(number: any): KonpeitoInteger source

Multiply.

Params:

Name	Type	Attribute	Description
number	any

Return:

KonpeitoInteger

A * B

public negate(): KonpeitoInteger source

this * -1

Return:

KonpeitoInteger

public nextProbablePrime(certainty: any, search_max: any): KonpeitoInteger source

Next prime.

Params:

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