Searched refs:low (Results 1 - 12 of 12) sorted by relevance

/libcore/luni/src/main/java/java/io/
H A DStreamTokenizer.java499 * Specifies that the characters in the range from {@code low} to {@code hi}
504 * @param low
509 public void ordinaryChars(int low, int hi) { argument
510 if (low < 0) {
511 low = 0;
516 for (int i = low; i <= hi; i++) {
634 * Specifies that the characters in the range from {@code low} to {@code hi}
637 * @param low
642 public void whitespaceChars(int low, int hi) { argument
643 if (low <
664 wordChars(int low, int hi) argument
[all...]
/libcore/luni/src/main/java/java/lang/
H A DCharacter.java42 * range of 0xD800 to 0xDBFF and a <i>low surrogate</i> with a value range of
445 * The minimum value of a low surrogate or trailing surrogate unit in UTF-16
453 * The maximum value of a low surrogate or trailing surrogate unit in UTF-16
875 * code point values in the low surrogate range 0xDC00 to 0xDFFF
1652 * Indicates whether {@code ch} is a low- (or trailing-) surrogate code unit
1658 * @return {@code true} if {@code ch} is a low-surrogate code unit;
1668 * Returns true if the given character is a high or low surrogate.
1680 * @param low
1681 * the low surrogate unit to test.
1683 * {@code low} i
1689 isSurrogatePair(char high, char low) argument
1727 toCodePoint(char high, char low) argument
[all...]
H A DRealToString.java287 boolean low, high;
300 low = R < M; // was M_minus
303 if (low || high) {
310 if (low && !high) {
312 } else if (high && !low) {
H A DIntegralToString.java337 int low = (int) (n % 1000000000); // Extract low-order 9 digits
338 int cursor = intIntoCharArray(buf, bufLen, low);
346 * The remaining digits are (n - low) / 1,000,000,000. This
350 n = ((n - low) >>> 9) * 0x8E47CE423A2E9C6DL;
355 * low-order digit, put it in buf, and then call intIntoCharArray
H A DLong.java591 int low = (int) v;
592 return low !=0 ? Integer.numberOfTrailingZeros(low)
H A DAbstractStringBuilder.java513 char low = value[i + 1];
514 if (low >= 0xdc00 && low <= 0xdfff) {
515 newData[--end] = low;
/libcore/luni/src/main/native/
H A Djava_lang_RealToString.cpp67 int high, low, i; local
195 low = compareHighPrecision (R, RLength, mminus, mminus_Length) <= 0;
204 if (low || high)
221 if (low && !high)
223 else if (high && !low)
H A Djava_nio_charset_Charsets.cpp210 jchar low = (i + 1 != end) ? chars[i + 1] : 0; local
211 if (!U16_IS_SURROGATE_LEAD(high) || !U16_IS_SURROGATE_TRAIL(low)) {
217 // Now we know we have a *valid* surrogate pair, we can consume the low surrogate.
219 ch = U16_GET_SUPPLEMENTARY(high, low);
/libcore/benchmarks/src/benchmarks/regression/
H A DCharsetBenchmark.java108 char low = (i + 1 != end) ? chars[i + 1] : '\u0000';
109 if (!Character.isSurrogatePair(high, low)) {
113 // Now we know we have a *valid* surrogate pair, we can consume the low surrogate.
115 ch = Character.toCodePoint(high, low);
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/regex/
H A DPattern2Test.java829 * if (UBlocks[i].low > 0) { m =
830 * p.matcher(Character.toString((char)(UBlocks[i].low-1)));
831 * assertFalse(m.matches()); } for (j=UBlocks[i].low; j <=
840 * if (UBlocks[i].low > 0) { m =
841 * p.matcher(Character.toString((char)(UBlocks[i].low-1)));
842 * assertTrue(m.matches()); } for (j=UBlocks[i].low; j <
852 if (UBlocks[i].low > 0) {
853 m = p.matcher(Character.toString((char) (UBlocks[i].low - 1)));
856 for (j = UBlocks[i].low; j <= UBlocks[i].high; j++) {
867 if (UBlocks[i].low >
1080 UBInfo(int low, int high, String name) argument
1088 public int low, high; field in class:Pattern2Test.UBInfo
[all...]
/libcore/luni/src/main/java/java/util/
H A DDualPivotQuicksort.java1608 * @param low the index of the first element, inclusive, to be searched
1611 private static int findAnyZero(float[] a, int low, int high) { argument
1613 int middle = (low + high) >>> 1;
1617 low = middle + 1;
1981 * @param low the index of the first element, inclusive, to be searched
1984 private static int findAnyZero(double[] a, int low, int high) { argument
1986 int middle = (low + high) >>> 1;
1990 low = middle + 1;
H A DCollections.java1436 int low = 0, mid = list.size(), high = mid - 1, result = -1;
1437 while (low <= high) {
1438 mid = (low + high) >>> 1;
1440 low = mid + 1;
1491 int low = 0, mid = list.size(), high = mid - 1, result = -1;
1492 while (low <= high) {
1493 mid = (low + high) >>> 1;
1495 low = mid + 1;

Completed in 136 milliseconds