Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 68 for chooser (0.06 sec)

  1. android/guava-tests/test/com/google/common/math/MathBenchmarking.java

        } while (result.signum() == 0);
        return result;
      }
    
      /**
       * Generates a number in [0, 2^numBits) with an exponential distribution. The floor of the log2 of
       * the result is chosen uniformly at random in [0, numBits), and then the result is chosen in that
       * range uniformly at random. Zero is treated as having log2 == 0.
       */
      static BigInteger randomNonNegativeBigInteger(int numBits) {
        int digits = RANDOM_SOURCE.nextInt(numBits);
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sun Aug 10 19:54:19 UTC 2025
    - 4.2K bytes
    - Viewed (0)
  2. guava-tests/test/com/google/common/math/MathBenchmarking.java

        } while (result.signum() == 0);
        return result;
      }
    
      /**
       * Generates a number in [0, 2^numBits) with an exponential distribution. The floor of the log2 of
       * the result is chosen uniformly at random in [0, numBits), and then the result is chosen in that
       * range uniformly at random. Zero is treated as having log2 == 0.
       */
      static BigInteger randomNonNegativeBigInteger(int numBits) {
        int digits = RANDOM_SOURCE.nextInt(numBits);
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sun Aug 10 19:54:19 UTC 2025
    - 4.2K bytes
    - Viewed (0)
  3. docs/distributed/README.md

    - **MinIO creates erasure-coding sets of _2_ to _16_ drives per set.  The number of drives you provide in total must be a multiple of one of those numbers.**
    - **MinIO chooses the largest EC set size which divides into the total number of drives or total number of nodes given - making sure to keep the uniform distribution i.e each node participates equal number of drives per set**.
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Tue Aug 12 18:20:36 UTC 2025
    - 8.9K bytes
    - Viewed (0)
  4. 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)
    
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Tue Aug 12 18:20:36 UTC 2025
    - 5.5K bytes
    - Viewed (0)
  5. docs/fr/docs/async.md

    * **Coroutines**
    
    ## Code asynchrone
    
    Faire du code asynchrone signifie que le langage 💬 est capable de dire à l'ordinateur / au programme 🤖 qu'à un moment du code, il 🤖 devra attendre que *quelque chose d'autre* se termine autre part. Disons que ce *quelque chose d'autre* est appelé "fichier-lent" 📝.
    
    Donc, pendant ce temps, l'ordinateur pourra effectuer d'autres tâches, pendant que "fichier-lent" 📝 se termine.
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Sun Aug 31 09:56:21 UTC 2025
    - 25.4K bytes
    - Viewed (0)
  6. docs/fr/docs/help-fastapi.md

    Vous pouvez alors essayer de les aider à résoudre ces problèmes.
    
    ## Créer une Issue
    
    Vous pouvez <a href="https://github.com/fastapi/fastapi/issues/new/choose" class="external-link" target="_blank">créer une Issue</a> dans le dépôt GitHub, par exemple pour :
    
    * Poser une question ou s'informer sur un problème.
    * Suggérer une nouvelle fonctionnalité.
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Sun Aug 31 10:49:48 UTC 2025
    - 5.7K bytes
    - Viewed (0)
  7. guava/src/com/google/common/math/LongMath.java

       * otherwise, the rounding will choose between the two nearest representable values with {@code
       * mode}.
       *
       * <p>For the case of {@link RoundingMode#HALF_EVEN}, this implementation uses the IEEE 754
       * default rounding mode: if the two nearest representable values are equally near, the one with
       * the least significant bit zero is chosen. (In such cases, both of the nearest representable
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Fri Aug 29 16:20:07 UTC 2025
    - 46.8K bytes
    - Viewed (0)
  8. guava/src/com/google/common/math/BigIntegerMath.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},
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Aug 07 16:05:33 UTC 2025
    - 18.8K bytes
    - Viewed (0)
  9. docs/pt/docs/help-fastapi.md

    Assim podendo tentar ajudar a resolver essas questões.
    
    ## Faça perguntas
    
    É possível <a href="https://github.com/fastapi/fastapi/issues/new/choose" class="external-link" target="_blank">criar uma nova pergunta</a> no repositório do GitHub, por exemplo:
    
    * Faça uma **pergunta** ou pergunte sobre um **problema**.
    * Sugira novos **recursos**.
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Sun Aug 31 10:49:48 UTC 2025
    - 8.4K bytes
    - Viewed (0)
  10. android/guava/src/com/google/common/util/concurrent/ClosingFuture.java

     *
     * {@snippet :
     * FluentFuture<UserName> userName =
     *     ClosingFuture.submit(
     *             closer -> closer.eventuallyClose(database.newTransaction(), closingExecutor),
     *             executor)
     *         .transformAsync((closer, transaction) -> transaction.queryClosingFuture("..."), executor)
     *         .transform((closer, result) -> result.get("userName"), directExecutor())
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Wed Jul 23 15:26:56 UTC 2025
    - 97.8K bytes
    - Viewed (0)
Back to top