Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 81 - 90 of 458 for chiar (0.02 seconds)

  1. src/main/java/jcifs/smb1/dcerpc/UnicodeString.java

                buffer[i] = (short) 0;
            }
        }
    
        @Override
        public String toString() {
            final int len = length / 2 - (zterm ? 1 : 0);
            final char[] ca = new char[len];
            for (int i = 0; i < len; i++) {
                ca[i] = (char) buffer[i];
            }
            return new String(ca, 0, len);
        }
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Sat Aug 16 01:32:48 GMT 2025
    - 2.7K bytes
    - Click Count (0)
  2. android/guava/src/com/google/common/escape/Platform.java

       * going and grow as needed.
       */
      private static final ThreadLocal<char[]> DEST_TL =
          new ThreadLocal<char[]>() {
            @Override
            protected char[] initialValue() {
              return new char[1024];
            }
          };
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Aug 07 16:05:33 GMT 2025
    - 1.5K bytes
    - Click Count (0)
  3. src/test/java/org/codelibs/opensearch/extension/analysis/NGramSynonymTokenizer.java

        private final BytesRef scratchBytes = new BytesRef();
    
        private final CharsRef scratchChars = new CharsRef();
    
        private int longestMatchEndOffset;
    
        private int ch;
    
        private final char[] readBuffer;
    
        private int readBufferIndex;
    
        private int readBufferLen;
    
        StringBuilder block;
    
        int blkStart;
    
        int nextBlkStart;
    
        private int finalOffset;
    
    Created: Fri Apr 17 09:08:13 GMT 2026
    - Last Modified: Sat Mar 15 06:51:20 GMT 2025
    - 17K bytes
    - Click Count (0)
  4. guava/src/com/google/common/base/Ascii.java

       */
      public static char toLowerCase(char c) {
        return isUpperCase(c) ? (char) (c ^ CASE_MASK) : c;
      }
    
      /**
       * Returns a copy of the input string in which all {@linkplain #isLowerCase(char) lowercase ASCII
       * characters} have been converted to uppercase. All other characters are copied without
       * modification.
       */
      public static String toUpperCase(String string) {
        int length = string.length();
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Mar 17 20:26:29 GMT 2025
    - 21.7K bytes
    - Click Count (0)
  5. src/test/java/jcifs/smb1/util/HexdumpTest.java

            // Test integer conversion
            char[] dst1 = new char[8];
            Hexdump.toHexChars(0x1234ABCD, dst1, 0, 8);
            assertEquals("1234ABCD", new String(dst1));
    
            // Test with smaller size
            char[] dst2 = new char[4];
            Hexdump.toHexChars(0xABCD, dst2, 0, 4);
            assertEquals("ABCD", new String(dst2));
    
            // Test with offset
            char[] dst3 = new char[10];
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Thu Aug 14 05:31:44 GMT 2025
    - 11.4K bytes
    - Click Count (0)
  6. android/guava/src/com/google/common/io/AppendableWriter.java

       */
      AppendableWriter(Appendable target) {
        this.target = checkNotNull(target);
      }
    
      /*
       * Abstract methods from Writer
       */
    
      @Override
      public void write(char[] cbuf, int off, int len) throws IOException {
        checkNotClosed();
        // It turns out that creating a new String is usually as fast, or faster
        // than wrapping cbuf in a light-weight CharSequence.
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Aug 07 16:37:28 GMT 2025
    - 3.4K bytes
    - Click Count (0)
  7. guava-tests/test/com/google/common/hash/HashTestUtils.java

            hashFunction.newHasher().putUnencodedChars(string).hash());
      }
    
      static char randomLowSurrogate(Random random) {
        return (char)
            (Character.MIN_LOW_SURROGATE
                + random.nextInt(Character.MAX_LOW_SURROGATE - Character.MIN_LOW_SURROGATE + 1));
      }
    
      static char randomHighSurrogate(Random random) {
        return (char)
            (Character.MIN_HIGH_SURROGATE
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Oct 28 18:19:59 GMT 2025
    - 25.6K bytes
    - Click Count (0)
  8. guava-tests/test/com/google/common/io/CharSourceTester.java

        this.source = factory.createSource(data);
      }
    
      public void testOpenStream() throws IOException {
        Reader reader = source.openStream();
    
        StringWriter writer = new StringWriter();
        char[] buf = new char[64];
        int read;
        while ((read = reader.read(buf)) != -1) {
          writer.write(buf, 0, read);
        }
        reader.close();
        writer.close();
    
        assertExpectedString(writer.toString());
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Mar 12 17:47:10 GMT 2026
    - 7.4K bytes
    - Click Count (0)
  9. tensorflow/c/eager/c_api_unified_experimental.h

    void TF_AbstractOpSetOpType(TF_AbstractOp* op, const char* const op_type,
                                TF_Status* s);
    // `op_name` must outlive `op`.
    void TF_AbstractOpSetOpName(TF_AbstractOp* op, const char* const op_name,
                                TF_Status* s);
    // `attr_name` must outlive `op`.
    void TF_AbstractOpSetAttrType(TF_AbstractOp* op, const char* const attr_name,
    Created: Tue Apr 07 12:39:13 GMT 2026
    - Last Modified: Sun Oct 24 11:27:00 GMT 2021
    - 7K bytes
    - Click Count (0)
  10. docs/pt/docs/how-to/custom-request-and-route.md

    Vamos ver como usar uma subclasse personalizada de `Request` para descomprimir requisições gzip.
    
    E uma subclasse de `APIRoute` para usar essa classe de requisição personalizada.
    
    ### Criar uma classe `GzipRequest` personalizada { #create-a-custom-gziprequest-class }
    
    /// tip | Dica
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 19 18:20:43 GMT 2026
    - 4.9K bytes
    - Click Count (0)
Back to Top