Search Options

Results per page
Sort
Preferred Languages
Advance

Results 391 - 400 of 1,060 for Each (0.02 sec)

  1. docs/tls/kubernetes/README.md

    community/minio-object-store/operations/deployments/kubernetes.html), where there are multiple pods with different domain names expected to run, you will either need wildcard certificates valid for all the domains or have specific certificates for each domain. If you are going to use specific certificates, make sure to create Kubernetes secrets accordingly.
    
    For testing purposes, here is [how to create self-signed certificates](https://github.com/minio/minio/tree/master/docs/tls#3-genera...
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Tue Aug 12 18:20:36 UTC 2025
    - 3K bytes
    - Viewed (0)
  2. guava/src/com/google/common/collect/ImmutableSortedMultiset.java

       * occurrence in encounter order appears in the resulting multiset, with count equal to the sum of
       * the outputs of {@code countFunction.applyAsInt(t)} for each {@code t} mapped to that element.
       *
       * @since 22.0
       */
      public static <T extends @Nullable Object, E>
          Collector<T, ?, ImmutableSortedMultiset<E>> toImmutableSortedMultiset(
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Tue May 13 17:27:14 UTC 2025
    - 29.5K bytes
    - Viewed (0)
  3. src/main/java/org/codelibs/fess/indexer/IndexUpdater.java

         *
         * <p>The method performs the following operations in a loop:
         * <ul>
         * <li>Retrieves access results from the data service</li>
         * <li>Processes each document through transformers</li>
         * <li>Applies document boosting and metadata enhancements</li>
         * <li>Sends processed documents to the search engine</li>
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Tue Aug 19 14:09:36 UTC 2025
    - 32.7K bytes
    - Viewed (0)
  4. okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/connection/FastFallbackExchangeFinder.kt

    import okhttp3.internal.concurrent.TaskRunner
    import okhttp3.internal.connection.RoutePlanner.ConnectResult
    import okhttp3.internal.connection.RoutePlanner.Plan
    import okhttp3.internal.okHttpName
    
    /**
     * Speculatively connects to each IP address of a target address, returning as soon as one of them
     * connects successfully. This kicks off new attempts every 250 ms until a connect succeeds.
     */
    internal class FastFallbackExchangeFinder(
    Registered: Fri Sep 05 11:42:10 UTC 2025
    - Last Modified: Fri Dec 27 13:39:56 UTC 2024
    - 5.8K bytes
    - Viewed (0)
  5. okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/connection/RoutePlanner.kt

     *
     * It is possible to cancel the finding process by canceling its call.
     *
     * Implementations of this interface are not thread-safe. Each instance is thread-confined to the
     * thread executing the call.
     */
    interface RoutePlanner {
      val address: Address
    
      /** Follow-ups for failed plans and plans that lost a race. */
    Registered: Fri Sep 05 11:42:10 UTC 2025
    - Last Modified: Tue May 27 14:58:02 UTC 2025
    - 4.2K bytes
    - Viewed (0)
  6. cmd/os_windows.go

    	return err
    }
    
    func osMkdirAll(dirPath string, perm os.FileMode, _ string) error {
    	// baseDir is not honored in windows platform
    	return os.MkdirAll(dirPath, perm)
    }
    
    // readDirFn applies the fn() function on each entries at dirPath, doesn't recurse into
    // the directory itself, if the dirPath doesn't exist this function doesn't return
    // an error.
    func readDirFn(dirPath string, filter func(name string, typ os.FileMode) error) error {
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Tue Feb 18 16:25:55 UTC 2025
    - 5K bytes
    - Viewed (0)
  7. src/main/java/org/codelibs/fess/util/ThreadDumpUtil.java

            }
        }
    
        /**
         * Processes all thread information and sends it to the provided consumer.
         *
         * @param writer the consumer that will handle each line of thread dump output
         */
        public static void processThreadDump(final Consumer<String> writer) {
            for (final Map.Entry<Thread, StackTraceElement[]> entry : Thread.getAllStackTraces().entrySet()) {
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Thu Jul 17 08:28:31 UTC 2025
    - 3.3K bytes
    - Viewed (0)
  8. src/cmd/asm/internal/asm/testdata/386.s

    // This input was created by taking the instruction productions in
    // the old assembler's (8a's) grammar and hand-writing complete
    // instructions for each rule, to guarantee we cover the same space.
    
    #include "../../../../../runtime/textflag.h"
    
    TEXT foo(SB), DUPOK|NOSPLIT, $0
    
    // LTYPE1 nonrem	{ outcode(int($1), &$2); }
    	SETCC	AX
    	SETCC	foo+4(SB)
    
    // LTYPE2 rimnon	{ outcode(int($1), &$2); }
    	DIVB	AX
    	DIVB	foo+4(SB)
    	PUSHL	$foo+4(SB)
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Tue Apr 09 18:57:21 UTC 2019
    - 2K bytes
    - Viewed (0)
  9. fess-crawler/src/main/java/org/codelibs/fess/crawler/client/smb/SmbAuthenticationHolder.java

    /**
     * Holds a map of SMB authentication configurations, allowing retrieval of the appropriate
     * authentication based on a given path.
     *
     * <p>This class manages a collection of {@link SmbAuthentication} objects, each associated
     * with a specific path prefix. When a path is provided, it iterates through the stored
     * authentications to find the one whose path prefix matches the beginning of the given path.
    Registered: Sun Sep 21 03:50:09 UTC 2025
    - Last Modified: Sun Jul 06 02:13:03 UTC 2025
    - 3.1K bytes
    - Viewed (0)
  10. android/guava/src/com/google/common/collect/Sets.java

          return super.equals(obj);
        }
    
        @Override
        public int hashCode() {
          /*
           * The sum of the sums of the hash codes in each subset is just the sum of
           * each input element's hash code times the number of sets that element
           * appears in. Each element appears in exactly half of the 2^n sets, so:
           */
          return inputSet.keySet().hashCode() << (inputSet.size() - 1);
        }
    
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Aug 07 16:05:33 UTC 2025
    - 81.6K bytes
    - Viewed (0)
Back to top