Class BigInteger
java.lang.Object
com.codename1.util.BigInteger
A simplified version of big integer from the bouncy castle implementation
-
Field Summary
Fields -
Constructor Summary
ConstructorsConstructorDescriptionBigInteger(byte[] bval) BigInteger(int sign, byte[] mag) BigInteger(int bitLength, int certainty, Random rnd) BigInteger(int numBits, Random rnd) BigInteger(String sval) BigInteger(String sval, int rdx) -
Method Summary
Modifier and TypeMethodDescriptionabs()add(BigInteger val) and(BigInteger value) andNot(BigInteger value) intbitCount()intbyteclearBit(int n) intcompareTo(BigInteger val) intdivide(BigInteger val) booleanIndicates whether some other object is "equal to" this one.flipBit(int n) gcd(BigInteger val) intinthashCode()Returns a hash code value for the object.intintValue()booleanisProbablePrime(int certainty) return whether or not a BigInteger is probably prime with a probability of 1 - (1/2)**certainty.longmax(BigInteger val) min(BigInteger val) mod(BigInteger m) modPow(BigInteger exponent, BigInteger m) multiply(BigInteger val) negate()not()or(BigInteger value) pow(int exp) static BigIntegerprobablePrime(int bitLength, Random random) setBit(int n) shiftLeft(int n) shiftRight(int n) intsignum()subtract(BigInteger val) booleantestBit(int n) byte[]toString()Returns a string representation of the object.toString(int rdx) static BigIntegervalueOf(long val) xor(BigInteger val)
-
Field Details
-
ZERO
-
ONE
-
-
Constructor Details
-
BigInteger
- Throws:
NumberFormatException
-
BigInteger
- Throws:
NumberFormatException
-
BigInteger
- Throws:
NumberFormatException
-
BigInteger
- Throws:
NumberFormatException
-
BigInteger
- Throws:
IllegalArgumentException
-
BigInteger
- Throws:
ArithmeticException
-
-
Method Details
-
probablePrime
-
valueOf
-
abs
-
add
- Throws:
ArithmeticException
-
and
-
andNot
-
bitCount
public int bitCount() -
bitLength
public int bitLength() -
compareTo
-
compareTo
-
divide
- Throws:
ArithmeticException
-
divideAndRemainder
- Throws:
ArithmeticException
-
equals
Description copied from class:ObjectIndicates whether some other object is "equal to" this one. The equals method implements an equivalence relation: It is reflexive: for any reference value x, x.equals(x) should return true. It is symmetric: for any reference values x and y, x.equals(y) should return true if and only if y.equals(x) returns true. It is transitive: for any reference values x, y, and z, if x.equals(y) returns true and y.equals(z) returns true, then x.equals(z) should return true. It is consistent: for any reference values x and y, multiple invocations of x.equals(y) consistently return true or consistently return false, provided no information used in equals comparisons on the object is modified. For any non-null reference value x, x.equals(null) should return false. The equals method for class Object implements the most discriminating possible equivalence relation on objects; that is, for any reference values x and y, this method returns true if and only if x and y refer to the same object (x==y has the value true). -
gcd
-
hashCode
public int hashCode()Description copied from class:ObjectReturns a hash code value for the object. This method is supported for the benefit of hashtables such as those provided by java.util.Hashtable. The general contract of hashCode is: Whenever it is invoked on the same object more than once during an execution of a Java application, the hashCode method must consistently return the same integer, provided no information used in equals comparisons on the object is modified. This integer need not remain consistent from one execution of an application to another execution of the same application. If two objects are equal according to the equals(Object) method, then calling the hashCode method on each of the two objects must produce the same integer result. It is not required that if two objects are unequal according to the equals(java.lang.Object) method, then calling the hashCode method on each of the two objects must produce distinct integer results. However, the programmer should be aware that producing distinct integer results for unequal objects may improve the performance of hashtables. As much as is reasonably practical, the hashCode method defined by class Object does return distinct integers for distinct objects. (This is typically implemented by converting the internal address of the object into an integer, but this implementation technique is not required by the JavaTM programming language.) -
intValue
public int intValue() -
byteValue
public byte byteValue() -
isProbablePrime
public boolean isProbablePrime(int certainty) return whether or not a BigInteger is probably prime with a probability of 1 - (1/2)**certainty.
From Knuth Vol 2, pg 395.
-
longValue
public long longValue() -
max
-
min
-
mod
- Throws:
ArithmeticException
-
modInverse
- Throws:
ArithmeticException
-
modPow
- Throws:
ArithmeticException
-
multiply
-
negate
-
not
-
pow
- Throws:
ArithmeticException
-
remainder
- Throws:
ArithmeticException
-
shiftLeft
-
shiftRight
-
signum
public int signum() -
subtract
-
toByteArray
public byte[] toByteArray() -
xor
-
or
-
setBit
- Throws:
ArithmeticException
-
clearBit
- Throws:
ArithmeticException
-
flipBit
- Throws:
ArithmeticException
-
toString
Description copied from class:ObjectReturns a string representation of the object. In general, the toString method returns a string that "textually represents" this object. The result should be a concise but informative representation that is easy for a person to read. It is recommended that all subclasses override this method. The toString method for class Object returns a string consisting of the name of the class of which the object is an instance, the at-sign character `@', and the unsigned hexadecimal representation of the hash code of the object. In other words, this method returns a string equal to the value of: getClass().getName() + '@' + Integer.toHexString(hashCode()) -
toString
-
getLowestSetBit
public int getLowestSetBit() -
testBit
- Throws:
ArithmeticException
-