Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 481 - 490 of 571 for calling (0.05 seconds)

The search processing time has exceeded the limit. The displayed results may be partial.

  1. src/main/java/org/codelibs/fess/crawler/FessCrawlerThread.java

     * This class extends the base CrawlerThread and provides Fess-specific functionality for
     * crawling and indexing documents, including incremental crawling capabilities, content
     * modification checking, and integration with the Fess search engine backend.
     *
     * <p>Key features include:</p>
     * <ul>
     * <li>Incremental crawling support with last-modified timestamp checking</li>
     * <li>Document expiration handling</li>
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Thu Dec 11 09:47:03 GMT 2025
    - 19.5K bytes
    - Click Count (0)
  2. guava/src/com/google/common/collect/MapMaker.java

       * WeakReference} (by default, strong references are used).
       *
       * <p>Weak values will be garbage collected once they are weakly reachable. This makes them a poor
       * candidate for caching.
       *
       * <p><b>Warning:</b> when this method is used, the resulting map will use identity ({@code ==})
       * comparison to determine equality of values. This technically violates the specifications of the
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Aug 07 16:05:33 GMT 2025
    - 12.8K bytes
    - Click Count (0)
  3. internal/ioutil/ioutil.go

    	if fi1.Mode() != fi2.Mode() {
    		return false
    	}
    	return fi1.Size() == fi2.Size()
    }
    
    // DirectioAlignSize - DirectIO alignment needs to be 4K. Defined here as
    // directio.AlignSize is defined as 0 in MacOS causing divide by 0 error.
    const DirectioAlignSize = 4096
    
    // CopyAligned - copies from reader to writer using the aligned input
    // buffer, it is expected that input buffer is page aligned to
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Tue Feb 18 16:25:55 GMT 2025
    - 11.1K bytes
    - Click Count (0)
  4. guava/src/com/google/common/collect/RegularImmutableSortedSet.java

      }
    
      @Override
      public @Nullable E floor(E element) {
        int index = headIndex(element, true) - 1;
        return (index == -1) ? null : elements.get(index);
      }
    
      @Override
      public @Nullable E ceiling(E element) {
        int index = tailIndex(element, true);
        return (index == size()) ? null : elements.get(index);
      }
    
      @Override
      public @Nullable E higher(E element) {
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Sep 22 21:07:18 GMT 2025
    - 9K bytes
    - Click Count (0)
  5. src/main/java/jcifs/smb1/smb1/Dfs.java

    import java.util.HashMap;
    import java.util.Iterator;
    
    import jcifs.smb1.Config;
    import jcifs.smb1.UniAddress;
    import jcifs.smb1.util.LogStream;
    
    /**
     * Implements DFS (Distributed File System) referral caching and resolution.
     * This class manages DFS referral cache and provides DFS path resolution functionality.
     */
    public class Dfs {
    
        /**
         * Default constructor for Dfs.
         * Initializes the DFS referral system.
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Sat Aug 16 01:32:48 GMT 2025
    - 14.2K bytes
    - Click Count (0)
  6. okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/cache/CacheInterceptor.kt

            "Content-Type".equals(fieldName, ignoreCase = true)
      }
    }
    
    private fun Request.requestForCache(): Request {
      val cacheUrlOverride = cacheUrlOverride
    
      // Allow POST and QUERY caching only when there is a cacheUrlOverride
      return if (cacheUrlOverride != null && (HttpMethod.isCacheable(method) || method == "POST")) {
        newBuilder()
          .get()
          .url(cacheUrlOverride)
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Sun Jan 11 12:06:21 GMT 2026
    - 10.3K bytes
    - Click Count (0)
  7. android/guava/src/com/google/common/util/concurrent/FuturesGetChecked.java

      }
    
      /**
       * Provides a check of whether an exception type is valid for use with {@link
       * FuturesGetChecked#getChecked(Future, Class)}, possibly using caching.
       *
       * <p>Uses reflection to gracefully fall back to when certain implementations aren't available.
       */
      private static final class GetCheckedTypeValidatorHolder {
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Sat Aug 09 01:14:59 GMT 2025
    - 10.2K bytes
    - Click Count (0)
  8. src/test/java/jcifs/internal/smb1/trans2/Trans2QueryPathInformationResponseTest.java

            byte[] buffer = new byte[0];
            response.setDataCount(0);
    
            // The implementation will try to decode even with an empty buffer, causing ArrayIndexOutOfBoundsException
            assertThrows(ArrayIndexOutOfBoundsException.class, () -> {
                response.readDataWireFormat(buffer, 0, 0);
            });
        }
    
        @Test
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Thu Aug 14 05:31:44 GMT 2025
    - 11.9K bytes
    - Click Count (0)
  9. compat/maven-plugin-api/src/main/java/org/apache/maven/plugin/AbstractMojo.java

         * gets injected by the Plexus container after the mojo has been constructed. Therefore, simply call this
         * method directly whenever you need the logger, it is fast enough and needs no caching.
         *
         * @see org.apache.maven.plugin.Mojo#getLog()
         * @deprecated Use SLF4J directly
         */
        @Deprecated
        @Override
        public Log getLog() {
            if (log == null) {
    Created: Sun Apr 05 03:35:12 GMT 2026
    - Last Modified: Sat Apr 05 11:52:05 GMT 2025
    - 7.4K bytes
    - Click Count (0)
  10. guava/src/com/google/common/collect/TopKSelector.java

        // The leftmost position at which the greatest of the k lower elements
        // -- the new value of threshold -- might be found.
    
        int iterations = 0;
        int maxIterations = IntMath.log2(right - left, RoundingMode.CEILING) * 3;
        while (left < right) {
          int pivotIndex = (left + right + 1) >>> 1;
    
          int pivotNewIndex = partition(left, right, pivotIndex);
    
          if (pivotNewIndex > k) {
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Sun Aug 31 13:15:26 GMT 2025
    - 11.4K bytes
    - Click Count (0)
Back to Top