/libcore/luni/src/test/java/libcore/java/lang/ |
H A D | StringBufferTest.java | 34 char high = '\uD83D', low = '\uDE02'; 35 StringBuffer surrogateCP = new StringBuffer().append(new char[]{high, low, low}); 36 assertTrue(Arrays.equals(new int[]{high, low, low}, surrogateCP.chars().toArray())); 48 char high = '\uD83D', low = '\uDE02'; 49 StringBuffer surrogateCP = new StringBuffer().append(new char[]{high, low, low, '0'}); 50 assertEquals(Character.toCodePoint(high, low), surrogateCP.codePoints().toArray()[0]);
|
H A D | StringBuilderTest.java | 144 char high = '\uD83D', low = '\uDE02'; 145 StringBuilder surrogateCP = new StringBuilder().append(new char[]{high, low, low}); 146 assertTrue(Arrays.equals(new int[]{high, low, low}, surrogateCP.chars().toArray())); 158 char high = '\uD83D', low = '\uDE02'; 159 StringBuilder surrogateCP = new StringBuilder().append(new char[]{high, low, low, '0'}); 160 assertEquals(Character.toCodePoint(high, low), surrogateCP.codePoints().toArray()[0]);
|
H A D | StringTest.java | 161 // A high surrogate at end of string is an error replaced with '?'. 163 // A high surrogate not followed by a low surrogate is an error replaced with '?'. 530 char high = '\uD83D', low = '\uDE02'; 531 String surrogateCP = new String(new char[]{high, low, low}); 532 assertTrue(Arrays.equals(new int[]{high, low, low}, surrogateCP.chars().toArray())); 544 char high = '\uD83D', low = '\uDE02'; 545 String surrogateCP = new String(new char[]{high, low, low, '0'}); 546 assertEquals(Character.toCodePoint(high, low), surrogateCP.codePoints().toArray()[0]);
|
/libcore/luni/src/test/java/libcore/java/nio/ |
H A D | CharBufferTest.java | 49 char high = '\uD83D', low = '\uDE02'; 50 String surrogateCP = new String(new char[]{high, low, low, '0'}); 53 assertEquals(Character.toCodePoint(high, low), cb.codePoints().toArray()[0]);
|
/libcore/ojluni/src/main/java/java/util/ |
H A D | Arrays.java | 1347 * high is the end index in dest to end sorting 1348 * off is the offset to generate corresponding low, high in src 1354 int high, 1356 int length = high - low; 1360 for (int i=low; i<high; i++) 1369 int destHigh = high; 1371 high += off; 1372 int mid = (low + high) >>> 1; 1374 mergeSort(dest, src, mid, high, -off); 1385 if (q >= high || 1351 mergeSort(Object[] src, Object[] dest, int low, int high, int off) argument 1546 mergeSort(Object[] src, Object[] dest, int low, int high, int off, Comparator c) argument [all...] |
H A D | Collections.java | 294 int high = list.size()-1; 296 while (low <= high) { 297 int mid = (low + high) >>> 1; 304 high = mid - 1; 315 int high = list.size()-1; 318 while (low <= high) { 319 int mid = (low + high) >>> 1; 326 high = mid - 1; 400 int high = l.size()-1; 402 while (low <= high) { [all...] |
/libcore/ojluni/src/main/java/sun/misc/ |
H A D | FormattedFloatingDecimal.java | 99 * count number of bits from high-order 1 bit to low-order 1 bit, 233 * We now know where the high-order 1 bit is, 507 // Insert assumed high-order bit for normalized numbers. 574 // Insert assumed high-order bit for normalized numbers. 757 boolean low, high; 767 * as it makes our fist guess (quotient of high-order words) 787 * was too high, our first quotient will be zero. In this 795 high = (b+m > tens ); 797 if ( (q == 0) && ! high ){ 810 high [all...] |
/libcore/ojluni/src/main/java/java/lang/ |
H A D | FloatingDecimal.java | 82 * count number of bits from high-order 1 bit to low-order 1 bit, 216 * We now know where the high-order 1 bit is, 442 // Insert assumed high-order bit for normalized numbers. 506 // Insert assumed high-order bit for normalized numbers. 690 boolean low, high; 700 * as it makes our fist guess (quotient of high-order words) 720 * was too high, our first quotient will be zero. In this 728 high = (b+m > tens ); 730 if ( (q == 0) && ! high ){ 743 high [all...] |
H A D | Integer.java | 620 * During VM initialization, java.lang.Integer.IntegerCache.high property 627 static final int high; field in class:Integer.IntegerCache 631 // high value may be configured by property 634 sun.misc.VM.getSavedProperty("java.lang.Integer.IntegerCache.high"); 641 high = h; 643 cache = new Integer[(high - low) + 1]; 668 assert IntegerCache.high >= 127; 669 if (i >= IntegerCache.low && i <= IntegerCache.high) 1206 * high-order, side reenter on the right, or low-order.) 1228 * low-order, side reenter on the left, or high [all...] |
H A D | Character.java | 79 * of {@code char} values, the first from the <em>high-surrogates</em> 500 * Unicode high-surrogate code unit</a> 502 * A high-surrogate is also known as a <i>leading-surrogate</i>. 511 * Unicode high-surrogate code unit</a> 513 * A high-surrogate is also known as a <i>leading-surrogate</i>. 1752 * This block represents codepoint values in the high surrogate 1765 * This block represents codepoint values in the private use high 4553 * Unicode high-surrogate code unit</a> 4609 * a {@linkplain #isHighSurrogate(char) high-surrogate code unit}. 4630 * isHighSurrogate(high) 4640 isSurrogatePair(char high, char low) argument 4676 toCodePoint(char high, char low) argument [all...] |
/libcore/libart/src/main/java/java/lang/ |
H A D | StringFactory.java | 48 public static String newStringFromBytes(byte[] data, int high) { argument 49 return newStringFromBytes(data, high, 0, data.length); 56 public static native String newStringFromBytes(byte[] data, int high, int offset, int byteCount); argument
|
/libcore/xml/src/main/java/org/kxml2/io/ |
H A D | KXmlSerializer.java | 603 private void writeSurrogate(char high, char low) throws IOException { argument 605 throw new IllegalArgumentException("Bad surrogate pair (U+" + Integer.toHexString((int) high) + 611 int codePoint = Character.toCodePoint(high, low);
|
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/regex/ |
H A D | Pattern2Test.java | 832 * UBlocks[i].high; j++) { m = 834 * if (UBlocks[i].high < 0xFFFF) { m = 835 * p.matcher(Character.toString((char)(UBlocks[i].high+1))); 843 * UBlocks[i].high; j++) { m = 845 * if (UBlocks[i].high < 0xFFFF) { m = 846 * p.matcher(Character.toString((char)(UBlocks[i].high+1))); 856 for (j = UBlocks[i].low; j <= UBlocks[i].high; j++) { 860 if (UBlocks[i].high < 0xFFFF) { 861 m = p.matcher(Character.toString((char) (UBlocks[i].high + 1))); 871 for (j = UBlocks[i].low; j < UBlocks[i].high; 1080 UBInfo(int low, int high, String name) argument 1088 public int low, high; field in class:Pattern2Test.UBInfo [all...] |
/libcore/ojluni/src/main/java/sun/security/x509/ |
H A D | X509CertImpl.java | 2008 int high = ((b & 0xf0) >> 4); 2010 buf.append(hexChars[high]);
|