Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 11 for primul (0.13 sec)

  1. docs/es/docs/python-types.md

    ¿Era `upper`? ¿Era `uppercase`? `first_uppercase`? `capitalize`?
    
    Entonces, pruebas con el amigo del viejo programador, el autocompletado del editor.
    
    Escribes el primer parámetro de la función, `first_name`, luego un punto (`.`) y luego presionas `Ctrl+Espacio` para activar el autocompletado.
    
    Pero, tristemente, no obtienes nada útil:
    
    <img src="/img/python-types/image01.png">
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Mon Dec 30 17:46:44 UTC 2024
    - 17.6K bytes
    - Viewed (1)
  2. docs/en/data/github_sponsors.yml

        avatarUrl: https://avatars.githubusercontent.com/u/29543316?u=44357eb2a93bccf30fb9d389b8befe94a3d00985&v=4
        url: https://github.com/alixlahuec
    - - login: primer-io
        avatarUrl: https://avatars.githubusercontent.com/u/62146168?v=4
        url: https://github.com/primer-io
    - - login: upciti
        avatarUrl: https://avatars.githubusercontent.com/u/43346262?v=4
        url: https://github.com/upciti
      - login: giunio-prc
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Fri Sep 05 08:58:22 UTC 2025
    - 21.3K bytes
    - Viewed (0)
  3. guava/src/com/google/common/math/LongMath.java

       */
      @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 =
              (1L << (2 - 2))
                  | (1L << (3 - 2))
                  | (1L << (5 - 2))
                  | (1L << (7 - 2))
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Fri Aug 29 16:20:07 UTC 2025
    - 46.8K bytes
    - Viewed (0)
  4. android/guava-tests/test/com/google/common/math/MathTesting.java

        // Add boundary values manually to avoid over/under flow (this covers 2^N for 0 and 31).
        intValues.add(Integer.MAX_VALUE - 1, Integer.MAX_VALUE);
        // Add values up to 40. This covers cases like "square of a prime" and such.
        for (int i = 1; i <= 40; i++) {
          intValues.add(i);
        }
        // Now add values near 2^N for lots of values of N.
        for (int exponent : asList(2, 3, 4, 9, 15, 16, 17, 24, 25, 30)) {
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sun Aug 10 19:54:19 UTC 2025
    - 11.3K bytes
    - Viewed (0)
  5. guava/src/com/google/common/collect/DiscreteDomain.java

     * #minValue} and {@link #maxValue} should also be overridden for bounded types.
     *
     * <p>A discrete domain always represents the <i>entire</i> set of values of its type; it cannot
     * represent partial domains such as "prime integers" or "strings of length 5."
     *
     * <p>See the Guava User Guide section on <a href=
     * "https://github.com/google/guava/wiki/RangesExplained#discrete-domains">{@code
     * DiscreteDomain}</a>.
     *
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Feb 13 17:34:21 UTC 2025
    - 10.4K bytes
    - Viewed (0)
  6. android/guava/src/com/google/common/collect/DiscreteDomain.java

     * #minValue} and {@link #maxValue} should also be overridden for bounded types.
     *
     * <p>A discrete domain always represents the <i>entire</i> set of values of its type; it cannot
     * represent partial domains such as "prime integers" or "strings of length 5."
     *
     * <p>See the Guava User Guide section on <a href=
     * "https://github.com/google/guava/wiki/RangesExplained#discrete-domains">{@code
     * DiscreteDomain}</a>.
     *
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Feb 13 17:34:21 UTC 2025
    - 10.4K bytes
    - Viewed (0)
  7. docs/es/docs/advanced/generate-clients.md

    Puedes personalizar esa función. Toma un `APIRoute` y retorna un string.
    
    Por ejemplo, aquí está usando el primer tag (probablemente tendrás solo un tag) y el nombre de la *path operation* (el nombre de la función).
    
    Puedes entonces pasar esa función personalizada a **FastAPI** como el parámetro `generate_unique_id_function`:
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Tue Jun 17 11:53:56 UTC 2025
    - 10.9K bytes
    - Viewed (0)
  8. docs/es/docs/advanced/security/oauth2-scopes.md

    {* ../../docs_src/security/tutorial005_an_py310.py hl[5,9,13,47,65,106,108:116,122:125,129:135,140,156] *}
    
    Ahora revisemos esos cambios paso a paso.
    
    ## Esquema de seguridad OAuth2
    
    El primer cambio es que ahora estamos declarando el esquema de seguridad OAuth2 con dos scopes disponibles, `me` y `items`.
    
    El parámetro `scopes` recibe un `dict` con cada scope como clave y la descripción como valor:
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Sun Aug 31 10:49:48 UTC 2025
    - 13.8K bytes
    - Viewed (0)
  9. android/guava/src/com/google/common/hash/Hashing.java

        hashFunctions[0] = Murmur3_128HashFunction.GOOD_FAST_HASH_128;
        int seed = GOOD_FAST_HASH_SEED;
        for (int i = 1; i < hashFunctionsNeeded; i++) {
          seed += 1500450271; // a prime; shouldn't matter
          hashFunctions[i] = murmur3_128(seed);
        }
        return new ConcatenatedHashFunction(hashFunctions);
      }
    
      /**
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Jul 17 15:26:41 UTC 2025
    - 29.8K bytes
    - Viewed (0)
  10. android/guava/src/com/google/common/primitives/Ints.java

        //     ends up at a[d], which in turn ends up at a[2d], and so on until we get back to a[0].
        //     (All indices taken mod n.) If d and n are mutually prime, all elements will have been
        //     moved at that point. Otherwise, we can rotate the cycle a[1], a[1 + d], a[1 + 2d], etc,
        //     then a[2] etc, and so on until we have rotated all elements. There are gcd(d, n) cycles
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Aug 07 16:05:33 UTC 2025
    - 31.4K bytes
    - Viewed (0)
Back to top