Package de.mhus.lib.core

Class MBigMath

java.lang.Object

de.mhus.lib.core.MBigMath

public class MBigMath
extends Object

Field Summary

Fields

Modifier and Type	Field	Description
static char[]	BASE_62_CHARS
static char[]	BASE_91_CHARS
static BigDecimal	BD_MINUS_ONE
static BigDecimal	BD_ONE_HUNDRED
static BigDecimal	BD_TEN
static BigDecimal	BD_TWO
static BigInteger	NINE_ONE
static BigInteger	SIXTY_TWO
static BigInteger	TWO

Constructor Summary

Constructors

Constructor	Description
MBigMath()

Method Summary

Modifier and Type	Method	Description
static BigDecimal	bigSqrt(BigDecimal c)	Uses Newton Raphson to compute the square root of a BigDecimal.
static BigInteger	binaryPow(BigInteger base, BigInteger pow, BigInteger mod)	Calculate a pow with modulo using the binary algorithm.
static BigInteger	computeDfromE(BigInteger e, BigInteger z)	Compute D from E using baghdad algorithm.
static BigInteger	dividePow(BigInteger base, BigInteger pow, BigInteger mod)	Calculate the pow with modulo using divide algorithm.
static BigInteger	fromBase62(String in)
static BigInteger	fromBase62(String in, boolean ignoreWhitespace)
static BigInteger[]	fromBase62Array(String in)
static BigInteger	fromBase91(String in)
static BigInteger	fromBase91(String in, boolean ignoreWhitespace)
static BigInteger[]	fromBase91Array(String in)
static BigDecimal	log10(BigDecimal b, int dp)	Calculate a log10
static BigDecimal	max(BigDecimal a, BigDecimal b)
static BigDecimal	min(BigDecimal a, BigDecimal b)
static BigInteger	splitPow(BigInteger base, BigInteger pow, BigInteger mod)
static BigDecimal	sqrt(BigDecimal x, int scale)
static BigInteger	straightPow(BigInteger base, BigInteger pow, BigInteger mod)	Calculate the pow with modulo using the simple mathematics straight forward method.
static String	toBase62(BigInteger in)
static String	toBase62(BigInteger[] in)
static String	toBase91(BigInteger in)
static String	toBase91(BigInteger[] in)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

BASE_62_CHARS

public static final char[] BASE_62_CHARS

BASE_91_CHARS

public static final char[] BASE_91_CHARS

TWO

public static final BigInteger TWO

SIXTY_TWO

public static final BigInteger SIXTY_TWO

NINE_ONE

public static final BigInteger NINE_ONE

BD_MINUS_ONE

public static final BigDecimal BD_MINUS_ONE

BD_TWO

public static final BigDecimal BD_TWO

BD_TEN

public static final BigDecimal BD_TEN

BD_ONE_HUNDRED

public static final BigDecimal BD_ONE_HUNDRED

Constructor Detail

MBigMath

public MBigMath()

Method Detail

binaryPow

public static BigInteger binaryPow(BigInteger base,
                                   BigInteger pow,
                                   BigInteger mod)
                            throws IOException

Calculate a pow with modulo using the binary algorithm.

Parameters:

base -

pow -

mod -

Returns:

the pow

Throws:

IOException

dividePow

public static BigInteger dividePow(BigInteger base,
                                   BigInteger pow,
                                   BigInteger mod)

Calculate the pow with modulo using divide algorithm. Using the binaryPow is the fastest!

Parameters:

base -

pow -

mod -

Returns:

the pow

straightPow

public static BigInteger straightPow(BigInteger base,
                                     BigInteger pow,
                                     BigInteger mod)

Calculate the pow with modulo using the simple mathematics straight forward method. Do not use this method! Use the binaryPow for good performance.

Parameters:

base -

pow -

mod -

Returns:

the pow

splitPow

public static BigInteger splitPow(BigInteger base,
                                  BigInteger pow,
                                  BigInteger mod)

log10

public static BigDecimal log10(BigDecimal b,
                               int dp)

Calculate a log10

Parameters:

b -

dp -

Returns:

log 10

computeDfromE

public static BigInteger computeDfromE(BigInteger e,
                                       BigInteger z)

Compute D from E using baghdad algorithm.

Parameters:

e -

z -

Returns:

D

sqrt

public static BigDecimal sqrt(BigDecimal x,
                              int scale)

bigSqrt

public static BigDecimal bigSqrt(BigDecimal c)

Uses Newton Raphson to compute the square root of a BigDecimal.

Parameters:

c -

Returns:

square root

toBase62

public static String toBase62(BigInteger in)

fromBase62

public static BigInteger fromBase62(String in)

fromBase62

public static BigInteger fromBase62(String in,
                                    boolean ignoreWhitespace)

toBase62

public static String toBase62(BigInteger[] in)

fromBase62Array

public static BigInteger[] fromBase62Array(String in)

toBase91

public static String toBase91(BigInteger in)

fromBase91

public static BigInteger fromBase91(String in)

fromBase91

public static BigInteger fromBase91(String in,
                                    boolean ignoreWhitespace)

toBase91

public static String toBase91(BigInteger[] in)

fromBase91Array

public static BigInteger[] fromBase91Array(String in)

min

public static BigDecimal min(BigDecimal a,
                             BigDecimal b)

max

public static BigDecimal max(BigDecimal a,
                             BigDecimal b)