Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 70 for chooser (0.04 sec)

  1. .github/ISSUE_TEMPLATE/config.yml

    #  limitations under the License.
    #
    
    # https://docs.github.com/en/communities/using-templates-to-encourage-useful-issues-and-pull-requests/configuring-issue-templates-for-your-repository#configuring-the-template-chooser
    
    blank_issues_enabled: false
    
    contact_links:
    
      - name: Project Mailing Lists
        url: https://maven.apache.org/mailing-lists.html
    Registered: Sun Sep 07 03:35:12 UTC 2025
    - Last Modified: Tue Jul 08 17:15:07 UTC 2025
    - 1.1K bytes
    - Viewed (0)
  2. 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
                    }
            }
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Wed Feb 26 09:25:50 UTC 2025
    - 8K bytes
    - Viewed (2)
  3. 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)
  4. 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)
  5. 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},
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Jul 17 15:26:41 UTC 2025
    - 3K bytes
    - Viewed (0)
  6. 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},
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Jul 17 15:26:41 UTC 2025
    - 3K bytes
    - Viewed (0)
  7. 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)
  8. 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)
  9. 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)
  10. 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"
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Tue May 27 15:19:03 UTC 2025
    - 9.2K bytes
    - Viewed (0)
Back to top