Lines Matching +defs:val +defs:buf
120 char[] buf = new char[65];
129 buf[charPos--] = Integer.digits[(int)(-(i % radix))];
132 buf[charPos] = Integer.digits[(int)(-i)];
135 buf[--charPos] = '-';
138 return new String(buf, charPos, (65 - charPos));
242 char[] buf = new char[64];
247 buf[--charPos] = Integer.digits[(int)(i & mask)];
250 return new String(buf, charPos, (64 - charPos));
267 char[] buf = new char[size];
268 getChars(i, size, buf);
269 return new String(buf, true);
274 * character array buf. The characters are placed into
281 static void getChars(long i, int index, char[] buf) {
298 buf[--charPos] = Integer.DigitOnes[r];
299 buf[--charPos] = Integer.DigitTens[r];
310 buf[--charPos] = Integer.DigitOnes[r];
311 buf[--charPos] = Integer.DigitTens[r];
319 buf[--charPos] = Integer.digits[r];
324 buf[--charPos] = sign;
856 * {@code getLong(nm, new Long(val))}
863 * return (result == null) ? new Long(val) : result;
870 * @param val default value.
875 public static Long getLong(String nm, long val) {
877 return (result == null) ? Long.valueOf(val) : result;
917 * @param val default value.
923 public static Long getLong(String nm, Long val) {
936 return val;
1113 * right rotation: {@code rotateLeft(val, -distance) == rotateRight(val,
1116 * ignored, even if the distance is negative: {@code rotateLeft(val,
1117 * distance) == rotateLeft(val, distance & 0x3F)}.
1135 * left rotation: {@code rotateRight(val, -distance) == rotateLeft(val,
1138 * ignored, even if the distance is negative: {@code rotateRight(val,
1139 * distance) == rotateRight(val, distance & 0x3F)}.