Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 491 - 500 of 2,286 for lengths (0.06 seconds)

  1. src/main/java/jcifs/ntlmssp/Type1Message.java

                if ((flags & NTLMSSP_NEGOTIATE_VERSION) == 0 && suppliedDomainString != null && suppliedDomainString.length() != 0) {
                    flags |= NTLMSSP_NEGOTIATE_OEM_DOMAIN_SUPPLIED;
                    domain = suppliedDomainString.toUpperCase().getBytes(getOEMEncoding());
                    size += domain.length;
                } else {
                    flags &= NTLMSSP_NEGOTIATE_OEM_DOMAIN_SUPPLIED ^ 0xffffffff;
                }
    
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Thu Aug 14 07:14:38 GMT 2025
    - 7.8K bytes
    - Click Count (0)
  2. src/main/java/jcifs/smb1/dcerpc/DcerpcMessage.java

            }
    
            encode_in(buf);
            length = buf.getIndex() - start;
    
            if (ptype == 0) {
                buf.setIndex(alloc_hint_index);
                alloc_hint = length - alloc_hint_index;
                buf.enc_ndr_long(alloc_hint);
            }
    
            buf.setIndex(start);
            encode_header(buf);
            buf.setIndex(start + length);
        }
    
        @Override
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Sat Aug 16 01:32:48 GMT 2025
    - 6K bytes
    - Click Count (0)
  3. android/guava/src/com/google/common/math/Quantiles.java

          // Since index and (dataset.length - 1) are non-negative ints, their product can be expressed
          // as a long, without risk of overflow:
          long numerator = (long) index * (dataset.length - 1);
          // Since scale is a positive int, index is in [0, scale], and (dataset.length - 1) is a
          // non-negative int, we can do long-arithmetic on index * (dataset.length - 1) / scale to get
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Mar 23 21:06:42 GMT 2026
    - 30.1K bytes
    - Click Count (0)
  4. android/guava/src/com/google/common/base/Splitter.java

       * length, CEILING)}. To avoid this behavior, use {@code omitEmptyStrings}.
       *
       * @param length the desired length of pieces after splitting, a positive integer
       * @return a splitter, with default settings, that can split into fixed sized pieces
       * @throws IllegalArgumentException if {@code length} is zero or negative
       */
      public static Splitter fixedLength(int length) {
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Feb 23 19:19:10 GMT 2026
    - 23.8K bytes
    - Click Count (0)
  5. guava-testlib/src/com/google/common/collect/testing/TestStringQueueGenerator.java

        String[] array = new String[elements.length];
        int i = 0;
        for (Object e : elements) {
          array[i++] = (String) e;
        }
        return create(array);
      }
    
      protected abstract Queue<String> create(String[] elements);
    
      @Override
      public String[] createArray(int length) {
        return new String[length];
      }
    
      /** Returns the original element list, unchanged. */
      @Override
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Sat Dec 21 14:50:24 GMT 2024
    - 1.6K bytes
    - Click Count (0)
  6. src/test/java/org/codelibs/fess/chat/ChatClientTest.java

            final String tail = result.substring(omitIdx + omitMarker.length());
            // Verify 60/40 ratio: head=289, tail=194
            assertEquals(289, head.length());
            assertEquals(194, tail.length());
            // Head should be ~60% of bodyBudget
            final double headRatio = (double) head.length() / (head.length() + tail.length());
            assertTrue(headRatio > 0.55 && headRatio < 0.65);
        }
    
        @Test
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Sat Mar 21 06:04:58 GMT 2026
    - 40.6K bytes
    - Click Count (0)
  7. src/main/java/jcifs/dcerpc/UUID.java

                }
                count++;
            }
    
            return value;
        }
    
        static final char[] HEXCHARS = { '0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'A', 'B', 'C', 'D', 'E', 'F' };
    
        private static String bin_to_hex(int value, final int length) {
            final char[] arr = new char[length];
            int ai = arr.length;
            while (ai-- > 0) {
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Sat Aug 16 01:32:48 GMT 2025
    - 4.7K bytes
    - Click Count (0)
  8. android/guava/src/com/google/common/primitives/UnsignedBytes.java

        checkNotNull(separator);
        if (array.length == 0) {
          return "";
        }
    
        // For pre-sizing a builder, just get the right order of magnitude
        StringBuilder builder = new StringBuilder(array.length * (3 + separator.length()));
        builder.append(toUnsignedInt(array[0]));
        for (int i = 1; i < array.length; i++) {
          builder.append(separator).append(toString(array[i]));
        }
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Mar 23 16:38:16 GMT 2026
    - 21K bytes
    - Click Count (0)
  9. src/main/java/jcifs/internal/smb1/trans/TransCallNamedPipeResponse.java

            return ("TransCallNamedPipeResponse[" + super.toString() + "]");
        }
    
        /**
         * Gets the length of the response data received from the named pipe.
         *
         * @return response data length
         */
        public int getResponseLength() {
            return getDataCount();
        }
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Sat Aug 16 01:32:48 GMT 2025
    - 3K bytes
    - Click Count (0)
  10. src/main/java/jcifs/smb/BufferCacheImpl.java

            // better safe than sorry: prevent leaks if there is some out of bound access
            Arrays.fill(buf, (byte) 0);
            synchronized (this.cache) {
                if (this.freeBuffers < this.cache.length) {
                    for (int i = 0; i < this.cache.length; i++) {
                        if (this.cache[i] == null) {
                            this.cache[i] = buf;
                            this.freeBuffers++;
                            return;
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Sat Aug 16 01:32:48 GMT 2025
    - 3.2K bytes
    - Click Count (0)
Back to Top