Creates an RInteger object with no associated internal (heap) storage.

All data members are initialised to zero. It is safe (although not strictly necessary) to push such an RInteger object onto the CleanupStack. This is useful, for example, if you want to pass an RInteger object by reference into a function and have it create the representation of the actual integer for you.

Note that performing any operation on such an RInteger object other than the default assignment operator or copy constructor will panic your code.

Copy constructor

This function performs a shallow copy, i.e. the memory holding the integer is not copied.

Helper function registered with the cleanup stack that just calls Close() for this RInteger object.

Zeros and then frees any memory owned by this RInteger object.

An RInteger object that has been closed can safely fall off the stack.

Creates a new integer with a preallocated internal storage of aNumWords all initialised to zero.

The resulting RInteger object is logically equivalent to RInteger::NewL(0). The only difference is that the internal storage requirements have been specified to be larger than the default. This is useful if you are about to perform an operation on this integer, that you know the resulting size requirements of, and wish to avoid a heap resize.

Creates a new integer representing 0.

Creates a new integer object representing a specified value.

Creates an exact copy of an aInteger object.

Creates a new integer from the value represented by aInteger.

Creates a new integer from the value represented by aInteger.

Finds a random prime integer in the range of [2, 2^aBits].

This is done by picking a random integer and using that as a starting point for a sequential search for a prime. To verify the primality of number, this algorithm uses a probablistic primality test. This means that it is possible, although extremely improbable, that the number returned is a pseudoprime.

Creates a random integer uniformly distributed over [0, 2^aBits].

Creates a random integer uniformly distributed over [x | min <= x <= max].

An overloaded TCleanupItem() allowing the RIntegers to be pushed, popped, and destroyed via the CleanupStack like any other CBase derived object.

Assignment operator

This function performs a shallow copy, i.e. the memory holding the integer is not copied.