Search Options

Results per page
Sort
Preferred Languages
Advance

Results 251 - 260 of 621 for takeIf (0.04 sec)

  1. docs/en/docs/history-design-future.md

    </blockquote>
    
    ## Investigation { #investigation }
    
    By using all the previous alternatives I had the chance to learn from all of them, take ideas, and combine them in the best way I could find for myself and the teams of developers I have worked with.
    
    For example, it was clear that ideally it should be based on standard Python type hints.
    
    Registered: Sun Dec 28 07:19:09 UTC 2025
    - Last Modified: Sat Oct 11 17:48:49 UTC 2025
    - 4.2K bytes
    - Viewed (0)
  2. src/main/java/org/codelibs/fess/indexer/IndexUpdater.java

         * This marks the access results as processed and clears the list.
         *
         * @param accessResultList the list of access results to clean up
         * @return the time taken for the cleanup operation in milliseconds, or -1 if no cleanup was needed
         */
        private long cleanupAccessResults(final List<OpenSearchAccessResult> accessResultList) {
            if (!accessResultList.isEmpty()) {
    Registered: Sat Dec 20 09:19:18 UTC 2025
    - Last Modified: Fri Nov 28 16:29:12 UTC 2025
    - 32.9K bytes
    - Viewed (0)
  3. okhttp/src/jvmTest/kotlin/okhttp3/FakeRoutePlanner.kt

        require(nextPlanIndex < plans.size) {
          "not enough plans! call addPlan() or set autoGeneratePlans=true in the test to set this up"
        }
        val result = plans[nextPlanIndex++]
        events += "take plan ${result.id}"
    
        if (result.yieldBeforePlanReturns) {
          taskFaker.yield()
        }
    
        val planningThrowable = result.planningThrowable
        if (planningThrowable != null) throw planningThrowable
    
    Registered: Fri Dec 26 11:42:13 UTC 2025
    - Last Modified: Tue Oct 07 21:55:03 UTC 2025
    - 6.1K bytes
    - Viewed (0)
  4. android/guava-tests/test/com/google/common/collect/ComparatorsTest.java

        assertThat(max(1, 2, reverse)).isEqualTo(1);
        assertThat(max(2, 1, reverse)).isEqualTo(1);
      }
    
      /**
       * Fails compilation if the signature of min and max is changed to take {@code Comparator<T>}
       * instead of {@code Comparator<? super T>}.
       */
      public void testMinMaxWithSupertypeComparator() {
        Comparator<Number> numberComparator = comparing(Number::intValue);
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Sat Apr 12 15:07:59 UTC 2025
    - 6.4K bytes
    - Viewed (0)
  5. android/guava/src/com/google/common/hash/Hashing.java

       * generated using this are byte-wise identical to those created using the C++ version, but note
       * that this uses unsigned integers (see {@link com.google.common.primitives.UnsignedInts}).
       * Comparisons between the two should take this into account.
       *
       * <p>Fingerprint2011() is a form of Murmur2 on strings up to 32 bytes and a form of CityHash for
       * longer strings. It could have been one or the other throughout. The main advantage of the
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Thu Jul 17 15:26:41 UTC 2025
    - 29.8K bytes
    - Viewed (0)
  6. tensorflow/BUILD

    )
    
    # This condition takes precedence over :linux_x86_64
    config_setting(
        name = "linux_x86_64_no_sse",
        constraint_values =
            [
                "@platforms//cpu:x86_64",
                "@platforms//os:linux",
            ],
        values = {
            "copt": "-mno-sse4.2",
        },
        visibility = ["//visibility:public"],
    )
    
    # This condition takes precedence over :linux_x86_64
    Registered: Tue Dec 30 12:39:10 UTC 2025
    - Last Modified: Wed Nov 12 19:21:56 UTC 2025
    - 53.1K bytes
    - Viewed (0)
  7. cmd/metacache-manager.go

    	m.init.Do(m.initManager)
    	m.mu.Lock()
    	b, ok := m.buckets[bucket]
    	if !ok {
    		m.mu.Unlock()
    		return
    	}
    	delete(m.buckets, bucket)
    	m.mu.Unlock()
    
    	// Since deletes may take some time we try to do it without
    	// holding lock to m all the time.
    	b.mu.Lock()
    	defer b.mu.Unlock()
    	for k, v := range b.caches {
    		if time.Since(v.lastUpdate) > metacacheMaxRunningAge {
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Tue Oct 25 00:44:15 UTC 2022
    - 5.2K bytes
    - Viewed (0)
  8. docs/compression/README.md

    ### 2. Run MinIO with compression
    
    Compression can be enabled by updating the `compress` config settings for MinIO server config.
    Config `compress` settings take extensions and mime-types to be compressed.
    
    ```bash
    ~ mc admin config get myminio compression
    compression extensions=".txt,.log,.csv,.json,.tar,.xml,.bin" mime_types="text/*,application/json,application/xml"
    ```
    
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Tue Aug 12 18:20:36 UTC 2025
    - 5.2K bytes
    - Viewed (0)
  9. docs/en/docs/tutorial/query-params-str-validations.md

    # Query Parameters and String Validations { #query-parameters-and-string-validations }
    
    **FastAPI** allows you to declare additional information and validation for your parameters.
    
    Let's take this application as example:
    
    {* ../../docs_src/query_params_str_validations/tutorial001_py310.py hl[7] *}
    
    Registered: Sun Dec 28 07:19:09 UTC 2025
    - Last Modified: Sat Dec 20 15:55:38 UTC 2025
    - 16.7K bytes
    - Viewed (0)
  10. okhttp/src/jvmTest/kotlin/okhttp3/internal/http2/HttpOverHttp2Test.kt

        val response1 = responses.take()
        assertThat(response1).isEqualTo("")
        assertThat(server.takeRequest().exchangeIndex).isEqualTo(0)
    
        // Now make the second request which will restrict the first HTTP/2 connection from creating new
        // streams.
        client.newCall(request).enqueue(callback)
        val response2 = responses.take()
        assertThat(response2).isEqualTo("DEF")
    Registered: Fri Dec 26 11:42:13 UTC 2025
    - Last Modified: Sat Nov 01 12:18:11 UTC 2025
    - 67.4K bytes
    - Viewed (0)
Back to top