Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 31 - 40 of 201 for whenever (0.05 seconds)

  1. docs/erasure/README.md

    ![Erasure](https://github.com/minio/minio/blob/master/docs/screenshots/erasure-code.jpg?raw=true)
    
    ## What is Bit Rot protection?
    
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Tue Aug 12 18:20:36 GMT 2025
    - 4.2K bytes
    - Click Count (0)
  2. android/guava/src/com/google/common/util/concurrent/JdkFutureAdapters.java

    import java.util.concurrent.atomic.AtomicBoolean;
    import org.jspecify.annotations.Nullable;
    
    /**
     * Utilities necessary for working with libraries that supply plain {@link Future} instances. Note
     * that, whenever possible, it is strongly preferred to modify those libraries to return {@code
     * ListenableFuture} directly.
     *
     * <p>For interoperability between {@code ListenableFuture} and <b>{@code CompletableFuture}</b>,
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Jul 17 15:26:41 GMT 2025
    - 7.5K bytes
    - Click Count (0)
  3. docs/en/docs/tutorial/testing.md

    ### Extended testing file { #extended-testing-file }
    
    You could then update `test_main.py` with the extended tests:
    
    {* ../../docs_src/app_testing/app_b_an_py310/test_main.py *}
    
    
    Whenever you need the client to pass information in the request and you don't know how to, you can search (Google) how to do it in `httpx`, or even how to do it with `requests`, as HTTPX's design is based on Requests' design.
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 05 18:13:19 GMT 2026
    - 5.7K bytes
    - Click Count (0)
  4. docs/en/docs/async.md

    Then the computer / program 🤖 will come back every time it has a chance because it's waiting again, or whenever it 🤖 finished all the work it had at that point. And it 🤖 will see if any of the tasks it was waiting for have already finished, doing whatever it had to do.
    
    Next, it 🤖 takes the first task to finish (let's say, our "slow-file" 📝) and continues whatever it had to do with it.
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 05 18:13:19 GMT 2026
    - 23.4K bytes
    - Click Count (0)
  5. docs/en/docs/tutorial/body-multiple-params.md

    }
    ```
    
    Again, it will convert the data types, validate, document, etc.
    
    ## Multiple body params and query { #multiple-body-params-and-query }
    
    Of course, you can also declare additional query parameters whenever you need, additional to any body parameters.
    
    As, by default, singular values are interpreted as query parameters, you don't have to explicitly add a `Query`, you can just do:
    
    ```Python
    q: str | None = None
    ```
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Wed Feb 11 18:32:12 GMT 2026
    - 4.8K bytes
    - Click Count (0)
  6. CODE_OF_CONDUCT.md

    organization, or any other official TensorFlow web presence allowing for community interactions, as well as at all official TensorFlow events, whether offline or online.
    
    The Code of Conduct also applies within project spaces and in public spaces whenever an individual is representing TensorFlow or its community. Examples of representing a project or community include using an official project e-mail address, posting via an official social media account, or acting as an appointed or de facto representative...
    Created: Tue Apr 07 12:39:13 GMT 2026
    - Last Modified: Fri Feb 05 18:43:16 GMT 2021
    - 5.2K bytes
    - Click Count (0)
  7. docs/en/docs/tutorial/body-nested-models.md

    {* ../../docs_src/body_nested_models/tutorial003_py310.py hl[12] *}
    
    With this, even if you receive a request with duplicate data, it will be converted to a set of unique items.
    
    And whenever you output that data, even if the source had duplicates, it will be output as a set of unique items.
    
    And it will be annotated / documented accordingly too.
    
    ## Nested Models { #nested-models }
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 05 18:13:19 GMT 2026
    - 6.6K bytes
    - Click Count (0)
  8. impl/maven-core/src/main/java/org/apache/maven/internal/aether/ReverseTreeRepositoryListener.java

                    break;
                }
                trace = trace.getParent();
            }
            return collectStepTrace;
        }
    
        /**
         * The event "artifact resolved" if fired WHENEVER an artifact is resolved, BUT it happens also when an artifact
         * descriptor (model, the POM) is being built, and parent (and parent of parent...) is being asked for. Hence, this
    Created: Sun Apr 05 03:35:12 GMT 2026
    - Last Modified: Wed Jan 29 08:17:07 GMT 2025
    - 10.1K bytes
    - Click Count (0)
  9. android/guava/src/com/google/common/escape/Escapers.java

          this.unsafeReplacement = unsafeReplacement;
          return this;
        }
    
        /**
         * Adds a replacement string for the given input character. The specified character will be
         * replaced by the given string whenever it occurs in the input, irrespective of whether it lies
         * inside or outside the 'safe' range.
         *
         * @param c the character to be replaced
         * @param replacement the string to replace the given character
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Sun Dec 22 03:38:46 GMT 2024
    - 6.9K bytes
    - Click Count (0)
  10. android/guava/src/com/google/common/util/concurrent/AbstractCatchingFuture.java

    import java.util.concurrent.ExecutionException;
    import java.util.concurrent.Executor;
    import org.jspecify.annotations.Nullable;
    
    /** Implementations of {@code Futures.catching*}. */
    @GwtCompatible
    // Whenever both tests are cheap and functional, it's faster to use &, | instead of &&, ||
    @SuppressWarnings("ShortCircuitBoolean")
    abstract class AbstractCatchingFuture<
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Sep 11 18:28:58 GMT 2025
    - 9K bytes
    - Click Count (0)
Back to Top