Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 475 for Fast (0.02 sec)

  1. CHANGELOG.md

    
    ## Version 5.0.0-alpha.4
    
    _2022-02-01_
    
    **This release introduces fast fallback to better support mixed IPv4+IPv6 networks.** Fast fallback
    is what we're calling our implementation of Happy Eyeballs, [RFC 8305][rfc_8305]. With this
    feature OkHttp will attempt both IPv6 and IPv4 connections concurrently, keeping whichever connects
    first. Fast fallback gives IPv6 connections a 250 ms head start so IPv6 is preferred on networks
    Registered: Fri Nov 01 11:42:11 UTC 2024
    - Last Modified: Thu Apr 18 01:31:39 UTC 2024
    - 21.4K bytes
    - Viewed (0)
  2. docs/bigdata/README.md

    fs.s3a.committer.threads=2048 # Number of threads writing to MinIO
    fs.s3a.connection.maximum=8192 # Maximum number of concurrent conns
    fs.s3a.fast.upload.active.blocks=2048 # Number of parallel uploads
    fs.s3a.fast.upload.buffer=disk # Use disk as the buffer for uploads
    fs.s3a.fast.upload=true # Turn on fast upload mode
    fs.s3a.max.total.tasks=2048 # Maximum number of parallel tasks
    fs.s3a.multipart.size=512M # Size of each multipart chunk
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Thu Sep 29 04:28:45 UTC 2022
    - 14.7K bytes
    - Viewed (0)
  3. okhttp/src/test/resources/web-platform-test-urltestdata.txt

    # FORMAT NOT DOCUMENTED YET (parser is urltestparser.js)
    
    # Based on http://trac.webkit.org/browser/trunk/LayoutTests/fast/url/script-tests/segments.js
    http://example\t.\norg http://example.org/foo/bar s:http h:example.org p:/
    http://user:pass@foo:21/bar;par?b#c  s:http u:user pass:pass h:foo port:21 p:/bar;par q:?b f:#c
    http:foo.com  s:http h:example.org p:/foo/foo.com
    \t\s\s\s:foo.com\s\s\s\n  s:http h:example.org p:/foo/:foo.com
    Registered: Fri Nov 01 11:42:11 UTC 2024
    - Last Modified: Wed Dec 20 23:27:07 UTC 2023
    - 14.3K bytes
    - Viewed (0)
  4. build-logic/documentation/src/main/groovy/gradlebuild/docs/ReleaseNotesTransformer.java

    "<details> \n" +
    "  <summary>📺 Watch the $1</summary> \n" +
    "  <div class=\"wistia-video\"> \n" +
    "    <div class=\"wistia-player\"> \n" +
    "      <script src=\"https://fast.wistia.com/embed/medias/$2.jsonp\" async></script> \n" +
    "      <script src=\"https://fast.wistia.com/assets/external/E-v1.js\" async></script> \n" +
    "        <div class=\"wistia_responsive_padding\" style=\"padding:55.94% 0 0 0;position:relative;\"> \n" +
    Registered: Wed Nov 06 11:36:14 UTC 2024
    - Last Modified: Thu Oct 03 05:02:20 UTC 2024
    - 9.9K bytes
    - Viewed (0)
  5. guava/src/com/google/common/hash/LittleEndianByteArray.java

       */
      static long load64(byte[] input, int offset) {
        // We don't want this in production code as this is the most critical part of the loop.
        assert input.length >= offset + 8;
        // Delegates to the fast (unsafe) version or the fallback.
        return byteArray.getLongLittleEndian(input, offset);
      }
    
      /**
       * Similar to load64, but allows offset + 8 > input.length, padding the result with zeroes. This
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Sat Oct 19 00:26:48 UTC 2024
    - 9.8K bytes
    - Viewed (0)
  6. android/guava/src/com/google/common/collect/MinMaxPriorityQueue.java

      @CheckForNull
      private MoveDesc<E> fillHole(int index, E toTrickle) {
        Heap heap = heapForIndex(index);
        // We consider elementData(index) a "hole", and we want to fill it
        // with the last element of the heap, toTrickle.
        // Since the last element of the heap is from the bottom level, we
        // optimistically fill index position with elements from lower levels,
        // moving the hole down. In most cases this reduces the number of
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 30 16:15:19 UTC 2024
    - 34.1K bytes
    - Viewed (0)
  7. docs/en/docs/async.md

    Anyway, in any of the cases above, FastAPI will still work asynchronously and be extremely fast.
    
    But by following the steps above, it will be able to do some performance optimizations.
    
    ## Technical Details
    
    Registered: Sun Nov 03 07:19:11 UTC 2024
    - Last Modified: Wed Aug 28 23:33:37 UTC 2024
    - 23.5K bytes
    - Viewed (0)
  8. README.md

    ---
    
    FastAPI is a modern, fast (high-performance), web framework for building APIs with Python based on standard Python type hints.
    
    The key features are:
    
    * **Fast**: Very high performance, on par with **NodeJS** and **Go** (thanks to Starlette and Pydantic). [One of the fastest Python frameworks available](#performance).
    * **Fast to code**: Increase the speed to develop features by about 200% to 300%. *
    Registered: Sun Nov 03 07:19:11 UTC 2024
    - Last Modified: Thu Oct 31 09:13:26 UTC 2024
    - 23.6K bytes
    - Viewed (0)
  9. docs/en/docs/index.md

    ---
    
    FastAPI is a modern, fast (high-performance), web framework for building APIs with Python based on standard Python type hints.
    
    The key features are:
    
    * **Fast**: Very high performance, on par with **NodeJS** and **Go** (thanks to Starlette and Pydantic). [One of the fastest Python frameworks available](#performance).
    * **Fast to code**: Increase the speed to develop features by about 200% to 300%. *
    Registered: Sun Nov 03 07:19:11 UTC 2024
    - Last Modified: Sun Oct 20 19:20:23 UTC 2024
    - 20.4K bytes
    - Viewed (0)
  10. guava/src/com/google/common/collect/MinMaxPriorityQueue.java

      @CheckForNull
      private MoveDesc<E> fillHole(int index, E toTrickle) {
        Heap heap = heapForIndex(index);
        // We consider elementData(index) a "hole", and we want to fill it
        // with the last element of the heap, toTrickle.
        // Since the last element of the heap is from the bottom level, we
        // optimistically fill index position with elements from lower levels,
        // moving the hole down. In most cases this reduces the number of
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 30 16:15:19 UTC 2024
    - 34.1K bytes
    - Viewed (0)
Back to top