Search Options

Results per page
Sort
Preferred Languages
Advance

Results 581 - 590 of 699 for whether (0.05 sec)

  1. src/main/java/org/codelibs/fess/exec/Crawler.java

        /** Thread name for data store crawling process. */
        private static final String DATA_CRAWLING_PROCESS = "DataStoreCrawler";
    
        /** Atomic flag indicating whether the crawler is currently running. */
        private static AtomicBoolean running = new AtomicBoolean(false);
    
        /** Thread-safe queue for collecting error messages during crawling operations. */
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Thu Aug 07 03:06:29 UTC 2025
    - 31K bytes
    - Viewed (0)
  2. android/guava/src/com/google/common/graph/Graphs.java

         * the node.
         */
        @Nullable Queue<N> remainingSuccessors;
    
        NodeAndRemainingSuccessors(N node) {
          this.node = node;
        }
      }
    
      /**
       * Determines whether an edge has already been used during traversal. In the directed case a cycle
       * is always detected before reusing an edge, so no special logic is required. In the undirected
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Fri Aug 01 00:26:14 UTC 2025
    - 22.7K bytes
    - Viewed (0)
  3. android/guava/src/com/google/common/collect/ImmutableRangeSet.java

      /**
       * Returns {@code true} if this immutable range set's implementation contains references to
       * user-created objects that aren't accessible via this range set's methods. This is generally
       * used to determine whether {@code copyOf} implementations should make an explicit copy to avoid
       * memory leaks.
       */
      boolean isPartialView() {
        return ranges.isPartialView();
      }
    
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Aug 11 19:31:30 UTC 2025
    - 27.4K bytes
    - Viewed (0)
  4. guava/src/com/google/common/graph/Graphs.java

         * the node.
         */
        @Nullable Queue<N> remainingSuccessors;
    
        NodeAndRemainingSuccessors(N node) {
          this.node = node;
        }
      }
    
      /**
       * Determines whether an edge has already been used during traversal. In the directed case a cycle
       * is always detected before reusing an edge, so no special logic is required. In the undirected
    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. api/maven-api-plugin/src/main/mdo/plugin.mdo

              </description>
            </field>
            <field>
              <name>required</name>
              <version>1.0.0+</version>
              <type>boolean</type>
              <description>
                Whether this parameter is required for the Mojo to function. This is used to validate the configuration
                for a Mojo before it is injected, and before the Mojo is executed from some half-state.
              </description>
    Registered: Sun Sep 07 03:35:12 UTC 2025
    - Last Modified: Tue Feb 25 08:28:41 UTC 2025
    - 24.8K bytes
    - Viewed (0)
  6. cmd/object-api-listobjects_test.go

    		delimiter  string
    		maxKeys    int
    		versioned  bool
    		// Expected output of ListObjects.
    		resultL ListObjectsInfo
    		resultV ListObjectVersionsInfo
    		err     error
    		// Flag indicating whether the test is expected to pass or not.
    		shouldPass bool
    	}{
    		{testBuckets[0], "unique/", "", "/", 1000, false, resultCases[0], ListObjectVersionsInfo{}, nil, true},
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 76.1K bytes
    - Viewed (0)
  7. src/main/java/org/codelibs/fess/ds/callback/FileListIndexUpdateCallbackImpl.java

                            logger.warn("Failed to access {}.", crawlRequest, e);
                        }
                    }
                }
            }
        }
    
        /**
         * Determines whether the specified URL is crawlable based on the exclusion pattern
         * provided in the {@code paramMap}. If the {@code URL_EXCLUDE_PATTERN} key exists in
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Thu Aug 07 03:06:29 UTC 2025
    - 28.9K bytes
    - Viewed (0)
  8. cmd/bucket-replication-utils.go

    	Arn                   string
    	Size                  int64
    	Duration              time.Duration
    	ReplicationAction     replicationAction // full or metadata only
    	OpType                replication.Type  // whether incoming replication, existing object, healing etc..
    	ReplicationStatus     replication.StatusType
    	PrevReplicationStatus replication.StatusType
    	VersionPurgeStatus    VersionPurgeStatusType
    	ResyncTimestamp       string
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 26K bytes
    - Viewed (0)
  9. src/main/java/jcifs/smb/NtlmPasswordAuthenticator.java

            return new String(out, 0, j);
        }
    
        /**
         * Check if the given mechanism is preferred for this credential
         *
         * @param mechanism the mechanism to check
         * @return whether the given mechanism is the preferred one for this credential
         */
        public boolean isPreferredMech(ASN1ObjectIdentifier mechanism) {
            return NtlmContext.NTLMSSP_OID.equals(mechanism);
        }
    
        /**
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Sun Aug 31 08:00:57 UTC 2025
    - 30.3K bytes
    - Viewed (0)
  10. src/archive/zip/zip_test.go

    	}
    	for len(p) > 0 {
    		n := copy(ss.buf[ss.start:], p)
    		p = p[n:]
    		ss.start += n
    		if ss.start == ss.keep {
    			ss.start = 0
    		}
    	}
    	return
    }
    
    // generatesZip64 reports whether f wrote a zip64 file.
    // f is also responsible for closing w.
    func generatesZip64(t *testing.T, f func(w *Writer)) bool {
    	ss := &suffixSaver{keep: 10 << 20}
    	w := NewWriter(ss)
    	f(w)
    	return suffixIsZip64(t, ss)
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Thu May 23 01:00:11 UTC 2024
    - 19.6K bytes
    - Viewed (0)
Back to top