Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1611 - 1620 of 1,875 for length (0.03 sec)

  1. 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
        }
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Sat Aug 30 05:58:03 UTC 2025
    - 14.2K bytes
    - Viewed (0)
  2. src/main/java/org/codelibs/fess/exec/Crawler.java

                final StringBuilder buf = new StringBuilder(500);
                for (final Map.Entry<String, String> entry : infoMap.entrySet()) {
                    if (buf.length() != 0) {
                        buf.append(',');
                    }
                    buf.append(entry.getKey()).append('=').append(entry.getValue());
                }
                if (logger.isInfoEnabled()) {
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Thu Aug 07 03:06:29 UTC 2025
    - 31K bytes
    - Viewed (0)
  3. android/guava/src/com/google/common/graph/Graphs.java

       * of edges in a graph arranged to form a path (a sequence of adjacent outgoing edges) starting
       * and ending with the same node.
       *
       * <p>This method will detect any non-empty cycle, including self-loops (a cycle of length 1).
       */
      public static <N> boolean hasCycle(Graph<N> graph) {
        int numEdges = graph.edges().size();
        if (numEdges == 0) {
          return false; // An edge-free graph is acyclic by definition.
        }
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Fri Aug 01 00:26:14 UTC 2025
    - 22.7K bytes
    - Viewed (0)
  4. guava/src/com/google/common/graph/Graphs.java

       * of edges in a graph arranged to form a path (a sequence of adjacent outgoing edges) starting
       * and ending with the same node.
       *
       * <p>This method will detect any non-empty cycle, including self-loops (a cycle of length 1).
       */
      public static <N> boolean hasCycle(Graph<N> graph) {
        int numEdges = graph.edges().size();
        if (numEdges == 0) {
          return false; // An edge-free graph is acyclic by definition.
        }
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Fri Aug 01 00:26:14 UTC 2025
    - 23.3K bytes
    - Viewed (0)
  5. 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
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Sat Aug 16 01:32:48 UTC 2025
    - 28K bytes
    - Viewed (1)
  6. 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.
    		{
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 32.9K bytes
    - Viewed (0)
  7. src/main/java/org/codelibs/fess/thumbnail/ThumbnailManager.java

         * @return the generated image filename
         */
        protected String getImageFilename(final String docid) {
            final StringBuilder buf = new StringBuilder(50);
            for (int i = 0; i < docid.length(); i += splitSize) {
                int hash = docid.substring(i).hashCode() % splitHashSize;
                if (hash < 0) {
                    hash *= -1;
                }
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Tue Aug 19 14:09:36 UTC 2025
    - 26.9K bytes
    - Viewed (0)
  8. android/guava-testlib/src/com/google/common/collect/testing/google/MultisetNavigationTester.java

        assertTrue(multiset.isEmpty());
        assertEquals(0, multiset.size());
        assertEquals(0, multiset.toArray().length);
        assertTrue(multiset.entrySet().isEmpty());
        assertFalse(multiset.iterator().hasNext());
        assertEquals(0, multiset.entrySet().size());
        assertEquals(0, multiset.entrySet().toArray().length);
        assertFalse(multiset.entrySet().iterator().hasNext());
      }
    
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Dec 19 20:14:36 UTC 2024
    - 26K bytes
    - Viewed (0)
  9. compat/maven-compat/src/main/java/org/apache/maven/repository/legacy/LegacyRepositorySystem.java

            if (!url.startsWith("file:")) {
                url = "file://" + url;
            } else if (url.startsWith("file:") && !url.startsWith("file://")) {
                url = "file://" + url.substring("file:".length());
            }
    
            // So now we have an url of the form file://<path>
    
            // We want to eliminate any relative path nonsense and lock down the path so we
    Registered: Sun Sep 07 03:35:12 UTC 2025
    - Last Modified: Fri Jun 06 14:28:57 UTC 2025
    - 31.2K bytes
    - Viewed (0)
  10. guava-tests/test/com/google/common/collect/Collections2Test.java

        return suite;
      }
    
      static final Predicate<@Nullable String> NOT_YYY_ZZZ =
          input -> !Objects.equals(input, "yyy") && !Objects.equals(input, "zzz");
    
      static final Predicate<String> LENGTH_1 = input -> input.length() == 1;
    
      @J2ktIncompatible
      @GwtIncompatible // suite
      @AndroidIncompatible // test-suite builders
      private static Test testsForFilter() {
        return CollectionTestSuiteBuilder.using(
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Aug 07 16:05:33 UTC 2025
    - 20.1K bytes
    - Viewed (0)
Back to top