Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 6 of 6 for isPrime (0.07 seconds)

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

        tester.testAllPublicStaticMethods(LongMath.class);
      }
    
      @GwtIncompatible // isPrime is GWT-incompatible
      public void testIsPrimeSmall() {
        // Check the first 1000 integers
        for (int i = 2; i < 1000; i++) {
          assertEquals(BigInteger.valueOf(i).isProbablePrime(100), LongMath.isPrime(i));
        }
      }
    
      @GwtIncompatible // isPrime is GWT-incompatible
      public void testIsPrimeManyConstants() {
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Oct 30 14:15:36 GMT 2025
    - 31.4K bytes
    - Click Count (0)
  2. android/guava/src/com/google/common/math/IntMath.java

       * factored into smaller positive integers).
       *
       * <p>To test larger numbers, use {@link LongMath#isPrime} or {@link BigInteger#isProbablePrime}.
       *
       * @throws IllegalArgumentException if {@code n} is negative
       * @since 20.0
       */
      @GwtIncompatible // TODO
      public static boolean isPrime(int n) {
        return LongMath.isPrime(n);
      }
    
      /**
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Jan 29 22:14:05 GMT 2026
    - 26.1K bytes
    - Click Count (0)
  3. android/guava/src/com/google/common/math/LongMath.java

       * <p>To test larger numbers, use {@link BigInteger#isProbablePrime}.
       *
       * @throws IllegalArgumentException if {@code n} is negative
       * @since 20.0
       */
      @GwtIncompatible // TODO
      public static boolean isPrime(long n) {
        if (n < 2) {
          checkNonNegative("n", n);
          return false;
        }
        if (n < 66) {
          // Encode all primes less than 66 into mask without 0 and 1.
          long mask =
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Mar 09 23:01:02 GMT 2026
    - 46.8K bytes
    - Click Count (0)
  4. lib/fips140/v1.26.0.zip

    the end of key // generation and return an error if it fails. See [checkPrivateKey]. if isPrime(b) { return b, nil } } } // isPrime runs the Miller-Rabin Probabilistic Primality Test from // FIPS 186-5, Appendix B.3.1. // // w must be a random odd integer greater than three in big-endian order. // isPrime might return false positives for adversarially chosen values. // // isPrime is not constant-time. func isPrime(w []byte) bool { mr, err := millerRabinSetup(w) if err != nil { // w is zero, one, or...
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Thu Jan 08 17:58:32 GMT 2026
    - 660.3K bytes
    - Click Count (0)
  5. docs/pt/docs/tutorial/handling-errors.md

    {* ../../docs_src/handling_errors/tutorial006_py310.py hl[2:5,15,21] *}
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 19 18:20:43 GMT 2026
    - 10.1K bytes
    - Click Count (0)
  6. docs/es/docs/_llm-test.md

    ... Sin embargo, las comillas dentro de fragmentos de código deben quedarse tal cual.
    
    ////
    
    ## bloques de código { #code-blocks }
    
    //// tab | Prueba
    
    Un ejemplo de código Bash...
    
    ```bash
    # Imprime un saludo al universo
    echo "Hello universe"
    ```
    
    ...y un ejemplo de código de consola...
    
    ```console
    $ <font color="#4E9A06">fastapi</font> run <u style="text-decoration-style:solid">main.py</u>
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 19 18:15:55 GMT 2026
    - 12.2K bytes
    - Click Count (0)
Back to Top