com.hurlant.util.der.Integer

	Property	Defined By
		t : int	BigInteger

Property

Defined By

t : int

BigInteger

	Method	Defined By
		Integer(type:uint, length:uint, b:ByteArray)	Integer
		abs():BigInteger \|this\|	BigInteger
		add(a:BigInteger):BigInteger	BigInteger
		and(a:BigInteger):BigInteger	BigInteger
		andNot(a:BigInteger):BigInteger	BigInteger
		bitCount():int	BigInteger
		bitLength():int returns the number of bits in this	BigInteger
		byteValue():int	BigInteger
		clearBit(n:int):BigInteger	BigInteger
		clone():BigInteger	BigInteger
		compareTo(v:BigInteger):int return + if this > v, - if this < v, 0 if equal	BigInteger
		dispose():void	BigInteger
		divide(a:BigInteger):BigInteger	BigInteger
		divideAndRemainder(a:BigInteger):Array	BigInteger
		equals(a:BigInteger):Boolean	BigInteger
		flipBit(n:int):BigInteger	BigInteger
		gcd(a:BigInteger):BigInteger	BigInteger
		getLength():uint	Integer
		getLowestSetBit():int	BigInteger
		getType():uint	Integer
		intValue():int	BigInteger
		isProbablePrime(t:int):Boolean	BigInteger
		max(a:BigInteger):BigInteger	BigInteger
		min(a:BigInteger):BigInteger	BigInteger
		mod(v:BigInteger):BigInteger	BigInteger
		modInverse(m:BigInteger):BigInteger	BigInteger
		modPow(e:BigInteger, m:BigInteger):BigInteger	BigInteger
		modPowInt(e:int, m:BigInteger):BigInteger this^e % m, 0 <= e < 2^32	BigInteger
		multiply(a:BigInteger):BigInteger	BigInteger
		nbv(value:int):BigInteger [static] return bigint initialized to value	BigInteger
		negate():BigInteger -this	BigInteger
		not():BigInteger	BigInteger
		or(a:BigInteger):BigInteger	BigInteger
		pow(e:int):BigInteger	BigInteger
		primify(bits:int, t:int):void Tweak our BigInteger until it looks prime enough	BigInteger
		remainder(a:BigInteger):BigInteger	BigInteger
		setBit(n:int):BigInteger	BigInteger
		shiftLeft(n:int):BigInteger	BigInteger
		shiftRight(n:int):BigInteger	BigInteger
		shortValue():int	BigInteger
		sigNum():int	BigInteger
		subtract(a:BigInteger):BigInteger	BigInteger
		testBit(n:int):Boolean	BigInteger
		toArray(array:ByteArray):uint	BigInteger
		toByteArray():ByteArray	BigInteger
		toDER():ByteArray	Integer
		toString(radix:Number = 0):String [override]	Integer
		valueOf():Number best-effort attempt to fit into a Number.	BigInteger
		xor(a:BigInteger):BigInteger	BigInteger

Method

Defined By

Integer(type:uint, length:uint, b:ByteArray)

Integer

abs():BigInteger

|this|

BigInteger

add(a:BigInteger):BigInteger

BigInteger

and(a:BigInteger):BigInteger

BigInteger

andNot(a:BigInteger):BigInteger

BigInteger

bitCount():int

BigInteger

bitLength():int

returns the number of bits in this

BigInteger

byteValue():int

BigInteger

clearBit(n:int):BigInteger

BigInteger

clone():BigInteger

BigInteger

compareTo(v:BigInteger):int

return + if this > v, - if this < v, 0 if equal

BigInteger

dispose():void

BigInteger

divide(a:BigInteger):BigInteger

BigInteger

divideAndRemainder(a:BigInteger):Array

BigInteger

equals(a:BigInteger):Boolean

BigInteger

flipBit(n:int):BigInteger

BigInteger

gcd(a:BigInteger):BigInteger

BigInteger

getLength():uint

Integer

getLowestSetBit():int

BigInteger

getType():uint

Integer

intValue():int

BigInteger

isProbablePrime(t:int):Boolean

BigInteger

max(a:BigInteger):BigInteger

BigInteger

min(a:BigInteger):BigInteger

BigInteger

mod(v:BigInteger):BigInteger

BigInteger

modInverse(m:BigInteger):BigInteger

BigInteger

modPow(e:BigInteger, m:BigInteger):BigInteger

BigInteger

modPowInt(e:int, m:BigInteger):BigInteger

this^e % m, 0 <= e < 2^32

BigInteger

multiply(a:BigInteger):BigInteger

BigInteger

nbv(value:int):BigInteger

[static] return bigint initialized to value

-this

or(a:BigInteger):BigInteger

BigInteger

pow(e:int):BigInteger

BigInteger

primify(bits:int, t:int):void

Tweak our BigInteger until it looks prime enough

BigInteger

remainder(a:BigInteger):BigInteger

BigInteger

setBit(n:int):BigInteger

BigInteger

shiftLeft(n:int):BigInteger

BigInteger

shiftRight(n:int):BigInteger

BigInteger

shortValue():int

BigInteger

sigNum():int

BigInteger

subtract(a:BigInteger):BigInteger

BigInteger

testBit(n:int):Boolean

BigInteger

toArray(array:ByteArray):uint

BigInteger

toByteArray():ByteArray

BigInteger

toDER():ByteArray

Integer

toString(radix:Number = 0):String

[override]

Integer

valueOf():Number

best-effort attempt to fit into a Number.

BigInteger

xor(a:BigInteger):BigInteger

BigInteger

	Method	Defined By
		addTo(a:BigInteger, r:BigInteger):void	BigInteger
		bitwiseTo(a:BigInteger, op:Function, r:BigInteger):void	BigInteger
		changeBit(n:int, op:Function):BigInteger	BigInteger
		chunkSize(r:Number):int	BigInteger
		fromRadix(s:String, b:int = 10):void	BigInteger
		millerRabin(t:int):Boolean	BigInteger
		modInt(n:int):int	BigInteger
		nbi():*	BigInteger
		toRadix(b:uint = 10):String	BigInteger

Method

Defined By

addTo(a:BigInteger, r:BigInteger):void

BigInteger

bitwiseTo(a:BigInteger, op:Function, r:BigInteger):void

BigInteger

changeBit(n:int, op:Function):BigInteger

BigInteger

chunkSize(r:Number):int

BigInteger

fromRadix(s:String, b:int = 10):void

BigInteger

millerRabin(t:int):Boolean

BigInteger

modInt(n:int):int

BigInteger

nbi():*

BigInteger

toRadix(b:uint = 10):String

BigInteger

	Constant	Defined By
		BI_FP : int = 52 [static]	BigInteger
		DB : int = 30 [static]	BigInteger
		DM : int [static]	BigInteger
		DV : int [static]	BigInteger
		F1 : int = 22.0 [static]	BigInteger
		F2 : int = 8.0 [static]	BigInteger
		FV : Number [static]	BigInteger
		lowprimes : Array [static]	BigInteger
		lplim : int [static]	BigInteger
		ONE : BigInteger [static]	BigInteger
		ZERO : BigInteger [static]	BigInteger

Constant

Defined By

BI_FP : int = 52

[static]

BigInteger

DB : int = 30

[static]

BigInteger

DM : int

[static]

BigInteger

DV : int