Cross Reference: /openjdk7/jdk/test/java/io/Serializable/enum/unshared/Test.java

Lines Matching defs:in
9  * by Oracle in the LICENSE file that accompanied this code.
11  * This code is distributed in the hope that it will be useful, but WITHOUT
14  * version 2 for more details (a copy is included in the LICENSE file that
51      * Holds the magnitude of this MutableBigInteger in big endian order.
260      * Return the index of the lowest set bit in this MutableBigInteger. If the
276      * Return the int in use in this MutableBigInteger at the specified
285      * Return a long which is equal to the unsigned value of the int in
286      * use in this MutableBigInteger at the specified index. This method is
294      * Ensure that the MutableBigInteger is in normal form, specifically
342      * Sets the int at index+offset in this MutableBigInteger to val.
415      * Returns true iff this MutableBigInteger is in normal form. A
416      * MutableBigInteger is in normal form if it has no leading zeros
428      * Returns a String representation of this MutableBigInteger in radix 10.
437      * in normal form.
461          * If there is enough storage space in this MutableBigInteger already
463          * ints in the value array is faster to utilize, so the extra space
509      * A primitive used for division. This method adds in one multiple of the
618         if (carry > 0) { // Result must grow in length
691      * into the larger. Returns 1 if the answer is in a, -1 if in b, 0 if no
871      * Calculates the quotient of this div b and places the quotient in the
874      * Uses Algorithm D in Knuth section 4.3.1.
920      * quotient in the provided MutableBigInteger object and the remainder is
983         // Must insert leading 0 in rem if its length did not change
1319      * ("Montgomery Form").  The algorithm is described in an unpublished