Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 475 for choose (0.15 sec)

  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
                    }
            }
    Plain Text
    - Registered: Sun May 05 19:28:20 GMT 2024
    - Last Modified: Tue Aug 15 23:04:20 GMT 2023
    - 8K bytes
    - Viewed (0)
  2. docs/integrations/veeam/README.md

    For Veeam Backup with Immutability, choose the amount of days you want to make backups immutable for
    
    ![Choose Immutability Days for Object Store](https://raw.githubusercontent.com/minio/minio/master/docs/integrations/veeam/screenshots/object_store_immutable_days.png)
    
    Plain Text
    - Registered: Sun May 05 19:28:20 GMT 2024
    - Last Modified: Thu Sep 29 04:28:45 GMT 2022
    - 5.4K bytes
    - Viewed (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
    Plain Text
    - Registered: Tue May 07 12:40:20 GMT 2024
    - Last Modified: Thu Feb 01 03:21:19 GMT 2024
    - 8K bytes
    - Viewed (0)
  4. cmd/speedtest.go

    			// if we have less drives than concurrency then choose
    			// only the concurrency to be number of drives to start
    			// with - since default '32' might be big and may not
    			// complete in total time of 10s.
    			if globalEndpoints.NEndpoints() < concurrency {
    				concurrency = globalEndpoints.NEndpoints()
    			}
    
    			// Check if we have local disks per pool less than
    			// the concurrency make sure we choose only the "start"
    Go
    - Registered: Sun May 05 19:28:20 GMT 2024
    - Last Modified: Sun Jan 28 18:04:17 GMT 2024
    - 9K bytes
    - Viewed (0)
  5. 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
    Plain Text
    - Registered: Fri May 03 11:42:14 GMT 2024
    - Last Modified: Sun Dec 17 15:34:10 GMT 2023
    - 572 bytes
    - Viewed (0)
  6. analysis/analysis-api-fir/src/org/jetbrains/kotlin/analysis/api/fir/symbols/KtFirArrayOfSymbolProvider.kt

        internal fun KtFirAnalysisSession.arrayOfSymbol(identifier: Name): KtFirFunctionSymbol? {
            val firSymbol = useSiteSession.symbolProvider.getTopLevelCallableSymbols(kotlinPackage, identifier).firstOrNull {
                /* choose (for byte array)
                 * public fun byteArrayOf(vararg elements: kotlin.Byte): kotlin.ByteArray
                 */
                (it as? FirFunctionSymbol<*>)?.fir?.valueParameters?.singleOrNull()?.isVararg == true
    Plain Text
    - Registered: Fri Mar 22 08:18:09 GMT 2024
    - Last Modified: Fri Feb 03 14:29:54 GMT 2023
    - 1.8K bytes
    - Viewed (0)
  7. android/guava/pom.xml

                </tag>
              </tags>
    
              <!-- TODO(cpovirk): Move this to the parent after making the package-list files available there. -->
              <!-- We add the link ourselves, both so that we can choose Java 9 over the version that -source suggests and so that we can solve the JSR305 problem described below. -->
              <detectJavaApiLink>false</detectJavaApiLink>
              <offlineLinks>
    XML
    - Registered: Fri May 03 12:43:13 GMT 2024
    - Last Modified: Mon Mar 11 16:37:45 GMT 2024
    - 8.9K bytes
    - Viewed (0)
  8. 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},
    Java
    - Registered: Fri Apr 26 12:43:10 GMT 2024
    - Last Modified: Thu Feb 23 18:45:50 GMT 2023
    - 3.1K bytes
    - Viewed (0)
  9. 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);
    
    Java
    - Registered: Fri Apr 12 12:43:09 GMT 2024
    - Last Modified: Tue Feb 01 16:30:37 GMT 2022
    - 7.1K bytes
    - Viewed (0)
  10. 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);
    
    Java
    - Registered: Fri May 03 12:43:13 GMT 2024
    - Last Modified: Tue Feb 01 16:30:37 GMT 2022
    - 7.1K bytes
    - Viewed (0)
Back to top