Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 22 for IsSurrogate (0.07 sec)

  1. android/guava-tests/benchmark/com/google/common/hash/HashStringBenchmark.java

          StringBuilder sb = new StringBuilder();
          for (int j = 0; j < charCount; j++) {
            int codePoint;
            // discard illegal surrogate "codepoints"
            do {
              codePoint = rnd.nextInt(maxCodePoint.value);
            } while (Character.isSurrogate((char) codePoint));
            sb.appendCodePoint(codePoint);
          }
          strings[i] = sb.toString();
        }
      }
    
      @Benchmark
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Tue May 13 18:46:00 UTC 2025
    - 5.3K bytes
    - Viewed (0)
  2. android/guava/src/com/google/common/base/Utf8.java

            utf8Length += (0x7f - c) >>> 31; // branch free!
          } else {
            utf8Length += 2;
            // We can't use Character.isSurrogate(c) here and below because of GWT.
            if (MIN_SURROGATE <= c && c <= MAX_SURROGATE) {
              // Check that we have a well-formed surrogate pair.
              if (Character.codePointAt(sequence, i) == c) {
                throw new IllegalArgumentException(unpairedSurrogateMsg(i));
              }
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Aug 11 19:31:30 UTC 2025
    - 7K bytes
    - Viewed (0)
  3. android/guava-tests/test/com/google/common/base/Utf8Test.java

          MAX_LOW_SURROGATE, MAX_HIGH_SURROGATE, MIN_LOW_SURROGATE, MIN_HIGH_SURROGATE,
        };
        for (char surrogate : surrogates) {
          builder.add(newString(surrogate));
          builder.add(newString(surrogate, 'n'));
          builder.add(newString('n', surrogate));
          builder.add(newString(surrogate, surrogate));
        }
        builder.add(newString(MIN_LOW_SURROGATE, MAX_HIGH_SURROGATE));
        ILL_FORMED_STRINGS = builder.build();
      }
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Aug 07 16:05:33 UTC 2025
    - 12.8K bytes
    - Viewed (0)
  4. okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/idn/Punycode.kt

        pos: Int,
        limit: Int,
      ): List<Int> {
        val result = mutableListOf<Int>()
        var i = pos
        while (i < limit) {
          val c = this[i]
          result +=
            when {
              c.isSurrogate() -> {
                val low = (if (i + 1 < limit) this[i + 1] else '\u0000')
                if (c.isLowSurrogate() || !low.isLowSurrogate()) {
                  '?'.code
                } else {
                  i++
    Registered: Fri Sep 05 11:42:10 UTC 2025
    - Last Modified: Fri Dec 27 13:39:56 UTC 2024
    - 8.5K bytes
    - Viewed (0)
  5. android/guava/src/com/google/common/escape/ArrayBasedUnicodeEscaper.java

        // into the range of surrogate characters, but if they do we must not test
        // any values in that range. To see why, consider the case where:
        // safeMin <= {hi,lo} <= safeMax
        // where {hi,lo} are characters forming a surrogate pair such that:
        // codePointOf(hi, lo) > safeMax
        // which would result in the surrogate pair being (wrongly) considered safe.
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Feb 13 15:45:16 UTC 2025
    - 8.5K bytes
    - Viewed (0)
  6. android/guava/src/com/google/common/escape/UnicodeEscaper.java

       *             surrogate is returned.</b>
       *         <li><b>If the next character was a valid low surrogate, the code point value of the
       *             high/low surrogate pair is returned.</b>
       *         <li>If the next character was not a low surrogate value, then {@link
       *             IllegalArgumentException} is thrown.
       *       </ol>
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Feb 13 15:45:16 UTC 2025
    - 13.2K bytes
    - Viewed (0)
  7. guava/src/com/google/common/escape/UnicodeEscaper.java

       *             surrogate is returned.</b>
       *         <li><b>If the next character was a valid low surrogate, the code point value of the
       *             high/low surrogate pair is returned.</b>
       *         <li>If the next character was not a low surrogate value, then {@link
       *             IllegalArgumentException} is thrown.
       *       </ol>
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Feb 13 15:45:16 UTC 2025
    - 13.2K bytes
    - Viewed (0)
  8. android/guava-tests/test/com/google/common/base/StringsTest.java

        assertEquals("abc", Strings.commonPrefix(new StringBuilder("abcdef"), "abcxyz"));
    
        // Identical valid surrogate pairs.
        assertEquals(
            "abc\uD8AB\uDCAB", Strings.commonPrefix("abc\uD8AB\uDCABdef", "abc\uD8AB\uDCABxyz"));
        // Differing valid surrogate pairs.
        assertEquals("abc", Strings.commonPrefix("abc\uD8AB\uDCABdef", "abc\uD8AB\uDCACxyz"));
        // One invalid pair.
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Wed Aug 27 17:53:41 UTC 2025
    - 10.5K bytes
    - Viewed (0)
  9. guava/src/com/google/common/escape/ArrayBasedUnicodeEscaper.java

        // into the range of surrogate characters, but if they do we must not test
        // any values in that range. To see why, consider the case where:
        // safeMin <= {hi,lo} <= safeMax
        // where {hi,lo} are characters forming a surrogate pair such that:
        // codePointOf(hi, lo) > safeMax
        // which would result in the surrogate pair being (wrongly) considered safe.
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Feb 13 15:45:16 UTC 2025
    - 8.5K bytes
    - Viewed (0)
  10. android/guava-tests/test/com/google/common/escape/UnicodeEscaperTest.java

        // Build up a range of surrogate pair characters to test
        int min = Character.MIN_SUPPLEMENTARY_CODE_POINT;
        int max = Character.MAX_CODE_POINT;
        int range = max - min;
        int s1 = min + (1 * range) / 4;
        int s2 = min + (2 * range) / 4;
        int s3 = min + (3 * range) / 4;
        char[] dst = new char[12];
    
        // Put surrogate pairs at odd indices so they can be split easily
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Tue May 13 18:46:00 UTC 2025
    - 6K bytes
    - Viewed (0)
Back to top