Search Options

Results per page
Sort
Preferred Languages
Advance

Results 131 - 140 of 377 for Hatter (0.05 sec)

  1. docs/en/docs/tutorial/query-params.md

    ```
    
    or
    
    ```
    http://127.0.0.1:8000/items/foo?short=on
    ```
    
    or
    
    ```
    http://127.0.0.1:8000/items/foo?short=yes
    ```
    
    or any other case variation (uppercase, first letter in uppercase, etc), your function will see the parameter `short` with a `bool` value of `True`. Otherwise as `False`.
    
    
    ## Multiple path and query parameters { #multiple-path-and-query-parameters }
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Sun Aug 31 10:29:01 UTC 2025
    - 4.5K bytes
    - Viewed (0)
  2. docs/en/docs/history-design-future.md

    ## Future { #future }
    
    By this point, it's already clear that **FastAPI** with its ideas is being useful for many people.
    
    It is being chosen over previous alternatives for suiting many use cases better.
    
    Many developers and teams already depend on **FastAPI** for their projects (including me and my team).
    
    But still, there are many improvements and features to come.
    
    **FastAPI** has a great future ahead.
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Sun Aug 31 09:15:41 UTC 2025
    - 4.2K bytes
    - Viewed (0)
  3. docs/changelogs/changelog_4x.md

        calls and that can receive data faster than they can process it. Previously, OkHttp limited
        HTTP/2 to 16 MiB of unacknowledged data per connection. With this fix there is a limit of 16 MiB
        of unacknowledged data per stream and no per-connection limit.
    
     *  Fix: Don't operate on a connection after it's been returned to the pool. This race occurred
        on failed web socket connection attempts.
    Registered: Fri Sep 05 11:42:10 UTC 2025
    - Last Modified: Wed Apr 17 13:25:31 UTC 2024
    - 25.2K bytes
    - Viewed (0)
  4. guava/src/com/google/common/hash/AbstractStreamingHasher.java

       * copying the CharSequence to a String and then calling getBytes(Charset) on that String, in
       * reality there are optimizations that make the getBytes(Charset) approach considerably faster,
       * at least for commonly used charsets like UTF-8.
       */
    
      @Override
      @CanIgnoreReturnValue
      public final Hasher putByte(byte b) {
        buffer.put(b);
        munchIfFull();
        return this;
      }
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sat Dec 21 03:10:51 UTC 2024
    - 7.1K bytes
    - Viewed (0)
  5. guava/src/com/google/common/hash/Fingerprint2011.java

        b ^= b >>> 47;
        b *= K3;
        return b;
      }
    
      /**
       * Computes intermediate hash of 32 bytes of byte array from the given offset. Results are
       * returned in the output array - this is 12% faster than allocating new arrays every time.
       */
      private static void weakHashLength32WithSeeds(
          byte[] bytes, int offset, long seedA, long seedB, long[] output) {
        long part1 = load64(bytes, offset);
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Aug 11 19:31:30 UTC 2025
    - 6.5K bytes
    - Viewed (0)
  6. src/main/webapp/css/font-awesome.min.css

    ent:"\f02a"}.fa-bars:before{content:"\f0c9"}.fa-baseball-ball:before{content:"\f433"}.fa-basketball-ball:before{content:"\f434"}.fa-bath:before{content:"\f2cd"}.fa-battery-empty:before{content:"\f244"}.fa-battery-full:before{content:"\f240"}.fa-battery-half:before{content:"\f242"}.fa-battery-quarter:before{content:"\f243"}.fa-battery-three-quarters:before{content:"\f241"}.fa-battle-net:before{content:"\f835"}.fa-bed:before{content:"\f236"}.fa-beer:before{content:"\f0fc"}.fa-behance:before{conten...
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Sat Dec 14 21:22:25 UTC 2019
    - 55.8K bytes
    - Viewed (2)
  7. android/guava/src/com/google/common/primitives/Booleans.java

       * moved to index "distance", and the element at index {@code i} ends up at index {@code (distance
       * + i) mod array.length}. This is equivalent to {@code Collections.rotate(Booleans.asList(array),
       * distance)}, but is somewhat faster.
       *
       * <p>The provided "distance" may be negative, which will rotate left.
       *
       * @since 32.0.0
       */
      public static void rotate(boolean[] array, int distance) {
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Jul 17 15:26:41 UTC 2025
    - 20.5K bytes
    - Viewed (0)
  8. guava/src/com/google/common/primitives/Booleans.java

       * moved to index "distance", and the element at index {@code i} ends up at index {@code (distance
       * + i) mod array.length}. This is equivalent to {@code Collections.rotate(Booleans.asList(array),
       * distance)}, but is somewhat faster.
       *
       * <p>The provided "distance" may be negative, which will rotate left.
       *
       * @since 32.0.0
       */
      public static void rotate(boolean[] array, int distance) {
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Jul 17 15:26:41 UTC 2025
    - 20.5K bytes
    - Viewed (0)
  9. docs/en/docs/tutorial/query-params-str-validations.md

    You can define a <abbr title="A regular expression, regex or regexp is a sequence of characters that define a search pattern for strings.">regular expression</abbr> `pattern` that the parameter should match:
    
    {* ../../docs_src/query_params_str_validations/tutorial004_an_py310.py hl[11] *}
    
    This specific regular expression pattern checks that the received parameter value:
    
    * `^`: starts with the following characters, doesn't have characters before.
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Sun Aug 31 09:15:41 UTC 2025
    - 17.2K bytes
    - Viewed (0)
  10. docs/config/README.md

    In most setups this is sufficient to heal the content after drive replacements. Setting `max_sleep` to a *lower* value and setting `max_io` to a *higher* value would make heal go faster.
    
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Tue Aug 12 18:20:36 UTC 2025
    - 18.1K bytes
    - Viewed (1)
Back to top