Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 10 of 84 for padlen (0.09 seconds)

  1. src/main/java/jcifs/smb1/util/MD4.java

            count += len; // update number of bytes
            final int partLen = BLOCK_LENGTH - bufferNdx;
            int i = 0;
            if (len >= partLen) {
                System.arraycopy(input, offset, buffer, bufferNdx, partLen);
    
                transform(buffer, 0);
    
                for (i = partLen; i + BLOCK_LENGTH - 1 < len; i += BLOCK_LENGTH) {
                    transform(input, offset + i);
                }
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Sat Aug 16 01:32:48 GMT 2025
    - 9.6K bytes
    - Click Count (0)
  2. lib/fips140/v1.26.0.zip

    0x80 var t uint64 if len%128 < 112 { t = 112 - len%128 } else { t = 128 + 112 - len%128 } // Length in bits. len <<= 3 padlen := tmp[:t+16] // Upper 64 bits are always zero, because len variable has type uint64, // and tmp is already zeroed at that index, so we can skip updating it. // byteorder.BEPutUint64(padlen[t+0:], 0) byteorder.BEPutUint64(padlen[t+8:], len) d.Write(padlen) if d.nx != 0 { panic("d.nx != 0") } var digest [size512]byte byteorder.BEPutUint64(digest[0:], d.h[0]) byteorder.BEPutUint64(digest[8:],...
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Thu Jan 08 17:58:32 GMT 2026
    - 660.3K bytes
    - Click Count (0)
  3. lib/fips140/v1.0.0-c2097c7c.zip

    0x80 var t uint64 if len%128 < 112 { t = 112 - len%128 } else { t = 128 + 112 - len%128 } // Length in bits. len <<= 3 padlen := tmp[:t+16] // Upper 64 bits are always zero, because len variable has type uint64, // and tmp is already zeroed at that index, so we can skip updating it. // byteorder.BEPutUint64(padlen[t+0:], 0) byteorder.BEPutUint64(padlen[t+8:], len) d.Write(padlen) if d.nx != 0 { panic("d.nx != 0") } var digest [size512]byte byteorder.BEPutUint64(digest[0:], d.h[0]) byteorder.BEPutUint64(digest[8:],...
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Thu Sep 25 19:53:19 GMT 2025
    - 642.7K bytes
    - Click Count (0)
  4. android/guava/src/com/google/common/base/Strings.java

       * with as many copies of {@code padChar} as are necessary to reach that length. For example,
       *
       * <ul>
       *   <li>{@code padEnd("4.", 5, '0')} returns {@code "4.000"}
       *   <li>{@code padEnd("2010", 3, '!')} returns {@code "2010"}
       * </ul>
       *
       * <p>See {@link java.util.Formatter} for a richer set of formatting capabilities.
       *
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Jan 29 22:14:05 GMT 2026
    - 12.2K bytes
    - Click Count (0)
  5. guava/src/com/google/common/base/Strings.java

       * with as many copies of {@code padChar} as are necessary to reach that length. For example,
       *
       * <ul>
       *   <li>{@code padEnd("4.", 5, '0')} returns {@code "4.000"}
       *   <li>{@code padEnd("2010", 3, '!')} returns {@code "2010"}
       * </ul>
       *
       * <p>See {@link java.util.Formatter} for a richer set of formatting capabilities.
       *
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Jan 29 22:14:05 GMT 2026
    - 12.5K bytes
    - Click Count (0)
  6. docs/de/docs/tutorial/query-params.md

    {* ../../docs_src/query_params/tutorial001_py310.py hl[9] *}
    
    Die <abbr title="Abfrage">Query</abbr> ist die Menge von Schlüssel-Wert-Paaren, die nach dem `?` in einer URL folgen und durch `&`-Zeichen getrennt sind.
    
    Zum Beispiel sind in der URL:
    
    ```
    http://127.0.0.1:8000/items/?skip=0&limit=10
    ```
    
    ... die Query-Parameter:
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 19 17:58:09 GMT 2026
    - 4.9K bytes
    - Click Count (0)
  7. guava-tests/test/com/google/common/base/StringsTest.java

        assertThat(Strings.padEnd("", 2, '-')).isEqualTo("--");
        assertThat(Strings.padEnd("x", 2, '-')).isEqualTo("x-");
        assertThat(Strings.padEnd("x", 3, '-')).isEqualTo("x--");
        assertThat(Strings.padEnd("xx", 3, '-')).isEqualTo("xx-");
      }
    
      public void testPadEnd_negativeMinLength() {
        assertThat(Strings.padEnd("x", -1, '-')).isSameInstanceAs("x");
      }
    
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Mar 16 15:59:55 GMT 2026
    - 11.4K bytes
    - Click Count (0)
  8. src/main/java/jcifs/http/NetworkExplorer.java

                        break;
                    }
                }
                sorted.add(j, dirents[i]);
            }
            if (maxLen > 50) {
                maxLen = 50;
            }
            maxLen *= 9; /* convert to px */
    
            resp.setContentType("text/html");
    
            out.println("<!DOCTYPE HTML PUBLIC \"-//W3C//DTD HTML 4.01 Transitional//EN\">");
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Sat Aug 16 01:32:48 GMT 2025
    - 23.4K bytes
    - Click Count (0)
  9. src/main/java/jcifs/util/Strings.java

         * @param maxLen the maximum length to search
         * @return position of terminating null byte
         */
        public static int findTermination(final byte[] buffer, final int bufferIndex, final int maxLen) {
            int len = 0;
            while (buffer[bufferIndex + len] != (byte) 0x00) {
                len++;
                if (len > maxLen) {
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Sat Aug 16 01:32:48 GMT 2025
    - 6.5K bytes
    - Click Count (0)
  10. src/test/java/jcifs/smb/MIENameTest.java

            int oidLen = oidDer.length;
            int nameLen = nameBytes.length;
    
            byte[] buf = new byte[2 + 2 + oidLen + 4 + nameLen];
            int i = 0;
            // TOK_ID
            buf[i++] = tokId[0];
            buf[i++] = tokId[1];
            // MECH_OID_LEN (2 bytes big-endian)
            buf[i++] = (byte) ((oidLen >>> 8) & 0xFF);
            buf[i++] = (byte) (oidLen & 0xFF);
            // MECH_OID
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Thu Aug 14 05:31:44 GMT 2025
    - 8.6K bytes
    - Click Count (0)
Back to Top