Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 10 of 252 for choose (0.04 seconds)

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

  1. docs/distributed/DESIGN.md

            serverPools := z.getServerPoolsAvailableSpace(ctx)
            total := serverPools.TotalAvailable()
            // choose when we reach this many
            choose := rand.Uint64() % total
            atTotal := uint64(0)
            for _, pool := range serverPools {
                    atTotal += pool.Available
                    if atTotal > choose && pool.Available > 0 {
                            return pool.Index
                    }
            }
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Wed Feb 26 09:25:50 GMT 2025
    - 8K bytes
    - Click Count (2)
  2. okhttp-brotli/README.md

    ============================
    
    This module is an implementation of [Brotli][1] compression.
    It enables Brotli support in addition to tranparent Gzip support,
    provided Accept-Encoding is not set previously.  Modern web servers
    must choose to return Brotli responses.  n.b. It is not used for
    sending requests.
    
    ```java
    OkHttpClient client = new OkHttpClient.Builder()
      .addInterceptor(BrotliInterceptor.INSTANCE)
      .build();
    ```
    
    ```kotlin
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Thu Oct 30 21:39:59 GMT 2025
    - 571 bytes
    - Click Count (0)
  3. ci/official/README.md

    #
    # Here is how to choose your TFCI value:
    # 1. A Python version must come first, because other scripts reference it.
    #      Ex. py39  -- Python 3.9
    #      Ex. py310 -- Python 3.10
    #      Ex. py311 -- Python 3.11
    #      Ex. py312 -- Python 3.12
    # 2. Choose the platform, which corresponds to the version of TensorFlow to
    #    build. This should also match the system you're using--you cannot build
    Created: Tue Apr 07 12:39:13 GMT 2026
    - Last Modified: Thu Feb 01 03:21:19 GMT 2024
    - 8K bytes
    - Click Count (0)
  4. guava-tests/test/com/google/common/math/QuantilesAlgorithm.java

              // Exactly two elements left.
              swap(array, from, to);
            }
            return array[k];
          } else {
            int midIndex = (from + to) >>> 1;
            // Choose the median of the elements at the from, to and mid indexes,
            // and rearrange so that array[from]<=array[from+1], and
            // array[to] => array[from + 1].
    
            swap(array, midIndex, from + 1);
    
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Mar 03 05:21:26 GMT 2026
    - 7.3K bytes
    - Click Count (0)
  5. docs/uk/llm-prompt.md

    - string: строка
    - tag: мітка
    - wildcard: дика карта
    
    ### `///` admonitions
    
    - Keep the admonition keyword in English (do not translate `note`, `tip`, etc.).
    - If a title is present, prefer these canonical titles (choose one canonical form where variants exist):
    
    - `/// note | Примітка`
    - `/// note | Технічні деталі`
    - `/// tip | Порада`
    - `/// warning | Попередження`
    - `/// info | Інформація`
    - `/// danger | Обережно`
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Wed Feb 04 16:47:51 GMT 2026
    - 4K bytes
    - Click Count (0)
  6. android/guava/pom.xml

              <!-- We add the link ourselves so that we can choose Java 25 over the version that -source suggests. -->
              <detectJavaApiLink>false</detectJavaApiLink>
              <offlineLinks>
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Nov 17 21:36:50 GMT 2025
    - 9.8K bytes
    - Click Count (0)
  7. android/guava-tests/test/com/google/common/math/QuantilesAlgorithm.java

              // Exactly two elements left.
              swap(array, from, to);
            }
            return array[k];
          } else {
            int midIndex = (from + to) >>> 1;
            // Choose the median of the elements at the from, to and mid indexes,
            // and rearrange so that array[from]<=array[from+1], and
            // array[to] => array[from + 1].
    
            swap(array, midIndex, from + 1);
    
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Mar 03 05:21:26 GMT 2026
    - 7.3K bytes
    - Click Count (0)
  8. docs/en/docs/deployment/fastapicloud.md

    ## Deploy to other cloud providers { #deploy-to-other-cloud-providers }
    
    FastAPI is open source and based on standards. You can deploy FastAPI apps to any cloud provider you choose.
    
    Follow your cloud provider's guides to deploy FastAPI apps with them. 🤓
    
    ## Deploy your own server { #deploy-your-own-server }
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 05 18:13:19 GMT 2026
    - 1.9K bytes
    - Click Count (0)
  9. guava/src/com/google/common/collect/MapMaker.java

       * without contention. Because assignment of entries to these partitions is not necessarily
       * uniform, the actual concurrency observed may vary. Ideally, you should choose a value to
       * accommodate as many threads as will ever concurrently modify the table. Using a significantly
       * higher value than you need can waste space and time, and a significantly lower value can lead
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Aug 07 16:05:33 GMT 2025
    - 12.8K bytes
    - Click Count (0)
  10. android/guava/src/com/google/common/math/BigDecimalMath.java

      /**
       * Returns {@code x}, rounded to a {@code double} with the specified rounding mode. If {@code x}
       * is precisely representable as a {@code double}, its {@code double} value will be returned;
       * otherwise, the rounding will choose between the two nearest representable values with {@code
       * mode}.
       *
       * <p>For the case of {@link RoundingMode#HALF_DOWN}, {@code HALF_UP}, and {@code HALF_EVEN},
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Jul 17 15:26:41 GMT 2025
    - 3K bytes
    - Click Count (0)
Back to Top