Search Options

Results per page
Sort
Preferred Languages
Advance

Results 921 - 930 of 1,258 for operator (0.12 sec)

  1. docs/features/caching.md

    cache.delete()
    ```
     
    ## Pruning the Cache
    
    Pruning the entire Cache to clear space temporarily can be done using evictAll.
    
    ```kotlin
    cache.evictAll()
    ```
    
    Removing individual items can be done using the urls iterator.
    This would be typical after a user initiates a force refresh by a pull to refresh type action.
    
    ```java
        val urlIterator = cache.urls()
        while (urlIterator.hasNext()) {
    Registered: Fri Nov 01 11:42:11 UTC 2024
    - Last Modified: Sun Feb 06 02:19:09 UTC 2022
    - 3.1K bytes
    - Viewed (0)
  2. docs/ru/docs/tutorial/metadata.md

    ```Python hl_lines="21  26"
    {!../../docs_src/metadata/tutorial004.py!}
    ```
    
    /// info | "Дополнительная информация"
    
    Узнайте больше о тегах в [Конфигурации операции пути](path-operation-configuration.md#_3){.internal-link target=_blank}.
    
    ///
    
    ### Проверьте документацию
    
    Теперь, если вы проверите документацию, вы увидите всю дополнительную информацию:
    
    Registered: Sun Nov 03 07:19:11 UTC 2024
    - Last Modified: Sun Oct 06 20:36:54 UTC 2024
    - 8.3K bytes
    - Viewed (0)
  3. docs/fr/docs/tutorial/query-params-str-validations.md

    ```Python
    q: Union[str, None] = Query(default=None, max_length=50)
    ```
    
    Cela va valider les données, montrer une erreur claire si ces dernières ne sont pas valides, et documenter le paramètre dans le schéma `OpenAPI` de cette *path operation*.
    
    ## Rajouter plus de validation
    
    Vous pouvez aussi rajouter un second paramètre `min_length` :
    
    {* ../../docs_src/query_params_str_validations/tutorial003.py hl[9] *}
    
    Registered: Sun Nov 03 07:19:11 UTC 2024
    - Last Modified: Sun Oct 27 17:14:38 UTC 2024
    - 9.5K bytes
    - Viewed (0)
  4. src/bufio/bufio.go

    // [ErrBufferFull] if n is larger than b's buffer size.
    //
    // Calling Peek prevents a [Reader.UnreadByte] or [Reader.UnreadRune] call from succeeding
    // until the next read operation.
    func (b *Reader) Peek(n int) ([]byte, error) {
    	if n < 0 {
    		return nil, ErrNegativeCount
    	}
    
    	b.lastByte = -1
    	b.lastRuneSize = -1
    
    	for b.w-b.r < n && b.w-b.r < len(b.buf) && b.err == nil {
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Thu Oct 12 14:39:08 UTC 2023
    - 21.8K bytes
    - Viewed (0)
  5. docs/ja/docs/tutorial/extra-data-types.md

    * Pydanticの全ての有効な型はこちらで確認できます: <a href="https://docs.pydantic.dev/latest/concepts/types/" class="external-link" target="_blank">Pydantic data types</a>。
    ## 例
    
    ここでは、上記の型のいくつかを使用したパラメータを持つ*path operation*の例を示します。
    
    ```Python hl_lines="1 2 12-16"
    {!../../docs_src/extra_data_types/tutorial001.py!}
    ```
    
    関数内のパラメータは自然なデータ型を持っていることに注意してください。そして、以下のように通常の日付操作を行うことができます:
    
    ```Python hl_lines="18 19"
    Registered: Sun Nov 03 07:19:11 UTC 2024
    - Last Modified: Sun Oct 06 20:36:54 UTC 2024
    - 3.2K bytes
    - Viewed (0)
  6. fastapi/utils.py

                "field (e.g. Union[Response, dict, None]) you can disable generating the "
                "response model from the type annotation with the path operation decorator "
                "parameter response_model=None. Read more: "
                "https://fastapi.tiangolo.com/tutorial/response-model/"
            ) from None
    
    
    def create_cloned_field(
        field: ModelField,
    Registered: Sun Nov 03 07:19:11 UTC 2024
    - Last Modified: Sat Aug 31 23:46:03 UTC 2024
    - 7.8K bytes
    - Viewed (0)
  7. docs/batch-jobs/README.md

    ### Type
    Type describes the job type, such as replicating objects between MinIO sites. Each job performs a single type of operation across all objects that match the job description criteria.
    
    ## Batch Jobs via Commandline
    [mc](http://github.com/minio/mc) provides 'mc batch' command to create, start and manage submitted jobs.
    
    ```
    NAME:
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Thu Oct 06 06:00:43 UTC 2022
    - 4.8K bytes
    - Viewed (0)
  8. docs/em/docs/tutorial/bigger-applications.md

    &amp; 👥 💪 🚮 📇 `dependencies` 👈 🔜 🚮 🌐 *➡ 🛠️* 📻 &amp; 🔜 🛠️/❎ 🔠 📨 ⚒ 👫.
    
    /// tip
    
    🗒 👈, 🌅 💖 [🔗 *➡ 🛠️ 👨‍🎨*](dependencies/dependencies-in-path-operation-decorators.md){.internal-link target=_blank}, 🙅‍♂ 💲 🔜 🚶‍♀️ 👆 *➡ 🛠️ 🔢*.
    
    ///
    
    🔚 🏁 👈 🏬 ➡ 🔜:
    
    * `/items/`
    * `/items/{item_id}`
    
    ...👥 🎯.
    
    * 👫 🔜 ™ ⏮️ 📇 🔖 👈 🔌 👁 🎻 `"items"`.
    Registered: Sun Nov 03 07:19:11 UTC 2024
    - Last Modified: Sun Oct 06 20:36:54 UTC 2024
    - 15.5K bytes
    - Viewed (0)
  9. fastapi/security/oauth2.py

        """
    
        def __init__(
            self,
            tokenUrl: Annotated[
                str,
                Doc(
                    """
                    The URL to obtain the OAuth2 token. This would be the *path operation*
                    that has `OAuth2PasswordRequestForm` as a dependency.
                    """
                ),
            ],
            scheme_name: Annotated[
                Optional[str],
                Doc(
    Registered: Sun Nov 03 07:19:11 UTC 2024
    - Last Modified: Wed Oct 23 18:30:18 UTC 2024
    - 21.1K bytes
    - Viewed (0)
  10. guava/src/com/google/common/graph/SuccessorsFunction.java

       *
       * <p>This is <i>not</i> the same as "all nodes reachable from {@code node} by following outgoing
       * edges". For that functionality, see {@link Graphs#reachableNodes(Graph, Object)}.
       *
       * <p>Some algorithms that operate on a {@code SuccessorsFunction} may produce undesired results
       * if the returned {@link Iterable} contains duplicate elements. Implementations of such
       * algorithms should document their behavior in the presence of duplicates.
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Mon Apr 26 17:43:39 UTC 2021
    - 4.3K bytes
    - Viewed (0)
Back to top