Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1581 - 1590 of 1,922 for LENGTH (0.04 seconds)

  1. src/test/java/jcifs/dcerpc/UUIDTest.java

                // Act
                UUID uuid = new UUID(rpcUuid);
    
                // Assert
                assertNotNull(uuid.node);
                assertEquals(6, uuid.node.length);
                assertArrayEquals(new byte[6], uuid.node, "Empty node array should be copied");
            }
        }
    
        @Nested
        @DisplayName("toString() Tests")
        class ToStringTests {
    
            @Test
    Created: Sat Dec 20 13:44:44 GMT 2025
    - Last Modified: Thu Aug 14 05:31:44 GMT 2025
    - 13.2K bytes
    - Click Count (0)
  2. src/test/java/jcifs/util/ServerResponseValidatorTest.java

            // Test exact buffer boundaries
            byte[] buffer = new byte[100];
            validator.validateBufferAccess(buffer, 0, 100); // Exactly full buffer
            validator.validateBufferAccess(buffer, 100, 0); // Zero length at end
        }
    Created: Sat Dec 20 13:44:44 GMT 2025
    - Last Modified: Sat Aug 30 05:58:03 GMT 2025
    - 14.2K bytes
    - Click Count (0)
  3. build-logic/documentation/src/main/groovy/gradlebuild/docs/GradleJavadocsPlugin.java

                var javaApiLink = javadocs.getJavaApi().map(URI::toString).map(v -> {
                    if (v.endsWith("/")) {
                        return v.substring(0, v.length() - 1);
                    }
                    return v;
                }).get();
                options.linksOffline(javaApiLink, javadocs.getJavaPackageListLoc().map(Directory::getAsFile).get().getAbsolutePath());
    Created: Wed Dec 31 11:36:14 GMT 2025
    - Last Modified: Thu Oct 02 14:18:24 GMT 2025
    - 10.4K bytes
    - Click Count (0)
  4. android/guava/src/com/google/common/collect/CompactLinkedHashMap.java

       * high 32 bits of each long is the "prev" pointer, whereas the low 32 bits is the "succ" pointer
       * (pointing to the next entry in the linked list). The pointers in [size(), entries.length) are
       * all "null" (UNSET).
       *
       * <p>A node with "prev" pointer equal to {@code ENDPOINT} is the first node in the linked list,
       * and a node with "next" pointer equal to {@code ENDPOINT} is the last node.
       */
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Wed Aug 06 14:59:07 GMT 2025
    - 8.4K bytes
    - Click Count (0)
  5. src/main/java/org/codelibs/fess/helper/RelatedContentHelper.java

                    relatedContentMap.put(key, pair);
                }
                if (entity.getTerm().startsWith(regexPrefix)) {
                    final String regex = entity.getTerm().substring(regexPrefix.length());
                    if (StringUtil.isBlank(regex)) {
                        logger.warn("Unknown regex pattern: {}", entity.getTerm());
                    } else {
    Created: Sat Dec 20 09:19:18 GMT 2025
    - Last Modified: Fri Nov 28 16:29:12 GMT 2025
    - 8.2K bytes
    - Click Count (0)
  6. src/main/java/jcifs/util/SmbCircuitBreaker.java

                long[] sortedTimes = responseTimeHistory.stream().mapToLong(Long::longValue).sorted().toArray();
                int p95Index = (int) Math.ceil(0.95 * sortedTimes.length) - 1;
                p95Index = Math.max(0, Math.min(p95Index, sortedTimes.length - 1));
                p95ResponseTime.set(sortedTimes[p95Index]);
            }
        }
    
        /**
         * Exception thrown when circuit breaker is open
         */
    Created: Sat Dec 20 13:44:44 GMT 2025
    - Last Modified: Sat Aug 30 05:58:03 GMT 2025
    - 33.4K bytes
    - Click Count (0)
  7. src/main/java/jcifs/util/transport/Transport.java

         */
        public static int readn(final InputStream in, final byte[] b, final int off, final int len) throws IOException {
            int i = 0, n = -5;
    
            if (off + len > b.length) {
                throw new IOException("Buffer too short, bufsize " + b.length + " read " + len);
            }
    
            while (i < len) {
                n = in.read(b, off + i, len - i);
                if (n <= 0) {
                    break;
                }
    Created: Sat Dec 20 13:44:44 GMT 2025
    - Last Modified: Sun Aug 31 08:00:57 GMT 2025
    - 27.8K bytes
    - Click Count (0)
  8. src/main/java/jcifs/SmbResource.java

        /**
         * Returns the length of this <code>SmbResource</code> in bytes. If this object
         * is a <code>TYPE_SHARE</code> the total capacity of the disk shared in
         * bytes is returned. If this object is a directory or a type other than
         * <code>TYPE_SHARE</code>, 0L is returned.
         *
         * @return The length of the file in bytes or 0 if this
    Created: Sat Dec 20 13:44:44 GMT 2025
    - Last Modified: Sat Aug 16 01:32:48 GMT 2025
    - 28K bytes
    - Click Count (1)
  9. cmd/bucket-policy-handlers_test.go

    	// test cases with sample input and expected output.
    	testCases := []struct {
    		bucketName string
    		// bucket policy to be set,
    		// set as request body.
    		bucketPolicyReader io.ReadSeeker
    		// length in bytes of the bucket policy being set.
    		policyLen int
    		accessKey string
    		secretKey string
    		// expected Response.
    		expectedRespStatus int
    	}{
    		// Test case - 1.
    		{
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 32.9K bytes
    - Click Count (0)
  10. src/main/java/org/codelibs/fess/FessBoot.java

         */
        @Override
        protected void setupWebappContext() {
            super.setupWebappContext();
            String contextPath = getContextPath();
            if (contextPath.length() > 0 && contextPath.endsWith("/")) {
                contextPath = contextPath.replaceAll("/+$", StringUtil.EMPTY);
            }
            final Context context = (Context) server.getHost().findChild(contextPath);
    Created: Sat Dec 20 09:19:18 GMT 2025
    - Last Modified: Thu Jul 17 08:28:31 GMT 2025
    - 11.3K bytes
    - Click Count (0)
Back to Top