Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 10 of 12 for sufficient (0.07 seconds)

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

  1. android/guava/src/com/google/common/collect/HashBiMap.java

          int expectedSize) {
        return new HashBiMap<>(expectedSize);
      }
    
      /**
       * Constructs a new bimap containing initial values from {@code map}. The bimap is created with an
       * initial capacity sufficient to hold the mappings in the specified map.
       */
      public static <K extends @Nullable Object, V extends @Nullable Object> HashBiMap<K, V> create(
          Map<? extends K, ? extends V> map) {
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Tue Dec 16 14:46:34 GMT 2025
    - 37.1K bytes
    - Click Count (0)
  2. CHANGELOG/CHANGELOG-1.35.md

    - Improved the `FreeDiskSpaceFailed` warning event to provide more actionable details when image garbage collection fails to free enough disk space. Example: `Insufficient free disk space on the node's image filesystem (95.0% of 10.0 GiB used). Failed to free sufficient space by deleting unused images. Consider resizing the disk or deleting unused files.`. ([#132578](https://github.com/kubernetes/kubernetes/pull/132578), [@drigz](https://github.com/drigz))
    Created: Fri Dec 26 09:05:12 GMT 2025
    - Last Modified: Wed Dec 17 13:01:55 GMT 2025
    - 228.5K bytes
    - Click Count (0)
  3. guava/src/com/google/common/collect/LinkedHashMultiset.java

        return new LinkedHashMultiset<>(distinctElements);
      }
    
      /**
       * Creates a new {@code LinkedHashMultiset} containing the specified elements.
       *
       * <p>This implementation is highly efficient when {@code elements} is itself a {@link Multiset}.
       *
       * @param elements the elements that the multiset should contain
       */
      public static <E extends @Nullable Object> LinkedHashMultiset<E> create(
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Fri Dec 05 23:15:58 GMT 2025
    - 3.8K bytes
    - Click Count (0)
  4. docs/pt/docs/tutorial/query-params.md

    {* ../../docs_src/query_params/tutorial002_py310.py hl[7] *}
    
    Nesse caso, o parâmetro da função `q` será opcional, e `None` será o padrão.
    
    /// check | Verifique
    
    Você também pode notar que o **FastAPI** é esperto o suficiente para perceber que o parâmetro da rota `item_id` é um parâmetro da rota, e `q` não é, portanto, `q` é o parâmetro de consulta.
    
    ///
    
    ## Conversão dos tipos de parâmetros de consulta { #query-parameter-type-conversion }
    
    Created: Sun Dec 28 07:19:09 GMT 2025
    - Last Modified: Wed Dec 17 20:41:43 GMT 2025
    - 5K bytes
    - Click Count (0)
  5. docs/pt/docs/tutorial/response-model.md

    ```Python hl_lines="3  5-6"
    {
        "name": "Baz",
        "description": None,
        "price": 50.2,
        "tax": 10.5,
        "tags": []
    }
    ```
    
    O FastAPI é inteligente o suficiente (na verdade, o Pydantic é inteligente o suficiente) para perceber que, embora `description`, `tax` e `tags` tenham os mesmos valores que os padrões, eles foram definidos explicitamente (em vez de retirados dos padrões).
    
    Created: Sun Dec 28 07:19:09 GMT 2025
    - Last Modified: Wed Dec 17 20:41:43 GMT 2025
    - 17.3K bytes
    - Click Count (0)
  6. docs/es/docs/tutorial/schema-extra-example.md

    ///
    
    /// warning | Advertencia
    
    Estos son detalles muy técnicos sobre los estándares **JSON Schema** y **OpenAPI**.
    
    Si las ideas anteriores ya funcionan para ti, eso podría ser suficiente, y probablemente no necesites estos detalles, siéntete libre de omitirlos.
    
    ///
    
    Antes de OpenAPI 3.1.0, OpenAPI usaba una versión más antigua y modificada de **JSON Schema**.
    
    Created: Sun Dec 28 07:19:09 GMT 2025
    - Last Modified: Tue Dec 16 16:33:45 GMT 2025
    - 10.3K bytes
    - Click Count (0)
  7. android/guava/src/com/google/common/collect/ConcurrentHashMultiset.java

      /**
       * Creates a new {@code ConcurrentHashMultiset} containing the specified elements, using the
       * default initial capacity, load factor, and concurrency settings.
       *
       * <p>This implementation is highly efficient when {@code elements} is itself a {@link Multiset}.
       *
       * @param elements the elements that the multiset should contain
       */
      public static <E> ConcurrentHashMultiset<E> create(Iterable<? extends E> elements) {
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Mon Dec 08 22:42:14 GMT 2025
    - 22.3K bytes
    - Click Count (0)
  8. docs/es/docs/deployment/concepts.md

    En este caso, sería mejor obtener **un servidor extra** y ejecutar algunos procesos en él para que todos tengan **suficiente RAM y tiempo de CPU**.
    
    Created: Sun Dec 28 07:19:09 GMT 2025
    - Last Modified: Tue Dec 16 16:33:45 GMT 2025
    - 20.1K bytes
    - Click Count (0)
  9. android/guava/src/com/google/common/collect/TreeMultiset.java

      }
    
      /**
       * Creates an empty multiset containing the given initial elements, sorted according to the
       * elements' natural order.
       *
       * <p>This implementation is highly efficient when {@code elements} is itself a {@link Multiset}.
       *
       * <p>The type specification is {@code <E extends Comparable>}, instead of the more specific
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Tue Dec 09 15:58:48 GMT 2025
    - 33.9K bytes
    - Click Count (0)
  10. guava/src/com/google/common/collect/TreeMultiset.java

      }
    
      /**
       * Creates an empty multiset containing the given initial elements, sorted according to the
       * elements' natural order.
       *
       * <p>This implementation is highly efficient when {@code elements} is itself a {@link Multiset}.
       *
       * <p>The type specification is {@code <E extends Comparable>}, instead of the more specific
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Tue Dec 09 15:58:48 GMT 2025
    - 34.3K bytes
    - Click Count (0)
Back to Top