Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 118 for hashing (0.08 sec)

  1. guava/src/com/google/common/hash/Hashing.java

       * specific length.
       *
       * <p>For example, if you need 1024-bit hash codes, you could join two {@link Hashing#sha512} hash
       * functions together: {@code Hashing.concatenating(Hashing.sha512(), Hashing.sha512())}.
       *
       * @since 19.0
       */
      public static HashFunction concatenating(
          HashFunction first, HashFunction second, HashFunction... rest) {
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Aug 11 22:06:57 UTC 2025
    - 31.1K bytes
    - Viewed (0)
  2. android/guava/src/com/google/common/hash/Hashing.java

       * specific length.
       *
       * <p>For example, if you need 1024-bit hash codes, you could join two {@link Hashing#sha512} hash
       * functions together: {@code Hashing.concatenating(Hashing.sha512(), Hashing.sha512())}.
       *
       * @since 19.0
       */
      public static HashFunction concatenating(
          HashFunction first, HashFunction second, HashFunction... rest) {
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Jul 17 15:26:41 UTC 2025
    - 29.8K bytes
    - Viewed (0)
  3. android/guava-tests/test/com/google/common/hash/HashingTest.java

            Hashing.md5().bits() + Hashing.md5().bits(),
            Hashing.concatenating(Hashing.md5(), Hashing.md5()).bits());
        assertEquals(
            Hashing.md5().bits() + Hashing.murmur3_32().bits(),
            Hashing.concatenating(Hashing.md5(), Hashing.murmur3_32()).bits());
        assertEquals(
            Hashing.md5().bits() + Hashing.murmur3_32().bits() + Hashing.murmur3_128().bits(),
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Tue May 13 17:27:14 UTC 2025
    - 26.4K bytes
    - Viewed (0)
  4. guava-tests/test/com/google/common/hash/HashingTest.java

            Hashing.md5().bits() + Hashing.md5().bits(),
            Hashing.concatenating(Hashing.md5(), Hashing.md5()).bits());
        assertEquals(
            Hashing.md5().bits() + Hashing.murmur3_32().bits(),
            Hashing.concatenating(Hashing.md5(), Hashing.murmur3_32()).bits());
        assertEquals(
            Hashing.md5().bits() + Hashing.murmur3_32().bits() + Hashing.murmur3_128().bits(),
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Tue May 13 17:27:14 UTC 2025
    - 26.4K bytes
    - Viewed (2)
  5. guava-tests/test/com/google/common/hash/MacHashFunctionTest.java

        assertEquals(
            "Hashing.hmacMd5(Key[algorithm=HmacMD5, format=RAW])", Hashing.hmacMd5(MD5_KEY).toString());
        assertEquals(
            "Hashing.hmacMd5(Key[algorithm=HmacMD5, format=RAW])", Hashing.hmacMd5(keyData).toString());
    
        assertEquals(
            "Hashing.hmacSha1(Key[algorithm=HmacSHA1, format=RAW])",
            Hashing.hmacSha1(SHA1_KEY).toString());
        assertEquals(
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Fri Dec 27 16:19:35 UTC 2024
    - 13.8K bytes
    - Viewed (0)
  6. docs/pt/docs/tutorial/security/oauth2-jwt.md

    # OAuth2 com Senha (e hashing), Bearer com tokens JWT
    
    Agora que temos todo o fluxo de segurança, vamos tornar a aplicação realmente segura, usando tokens <abbr title="JSON Web Tokens">JWT</abbr> e hashing de senhas seguras.
    
    Este código é algo que você pode realmente usar na sua aplicação, salvar os hashes das senhas no seu banco de dados, etc.
    
    Vamos começar de onde paramos no capítulo anterior e incrementá-lo.
    
    ## Sobre o JWT
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Sun Aug 31 10:49:48 UTC 2025
    - 11K bytes
    - Viewed (0)
  7. docs/en/docs/tutorial/security/oauth2-jwt.md

    ///
    
    ## Password hashing { #password-hashing }
    
    "Hashing" means converting some content (a password in this case) into a sequence of bytes (just a string) that looks like gibberish.
    
    Whenever you pass exactly the same content (exactly the same password) you get exactly the same gibberish.
    
    But you cannot convert from the gibberish back to the password.
    
    ### Why use password hashing { #why-use-password-hashing }
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Sun Aug 31 10:49:48 UTC 2025
    - 10.5K bytes
    - Viewed (0)
  8. android/guava/src/com/google/common/collect/HashBiMap.java

        }
    
        if (hashTableKToV.length < minCapacity) {
          int newTableSize = Hashing.closedTableSize(minCapacity, 1.0);
          hashTableKToV = createFilledWithAbsent(newTableSize);
          hashTableVToK = createFilledWithAbsent(newTableSize);
    
          for (int entryToRehash = 0; entryToRehash < size; entryToRehash++) {
            int keyHash = Hashing.smearedHash(keys[entryToRehash]);
            int keyBucket = bucket(keyHash);
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Aug 11 19:31:30 UTC 2025
    - 36.2K bytes
    - Viewed (0)
  9. docs/pt/docs/tutorial/security/simple-oauth2.md

    Vamos colocar esses dados primeiro no modelo `UserInDB` do Pydantic.
    
    Você nunca deve salvar senhas em texto simples, portanto, usaremos o sistema de hashing de senhas (falsas).
    
    Se as senhas não corresponderem, retornaremos o mesmo erro.
    
    #### Hashing de senha
    
    "Hashing" significa: converter algum conteúdo (uma senha neste caso) em uma sequência de bytes (apenas uma string) que parece algo sem sentido.
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Mon Nov 18 02:25:44 UTC 2024
    - 10K bytes
    - Viewed (0)
  10. android/guava/src/com/google/common/hash/BloomFilterStrategies.java

            }
            if (!bits.get(combinedHash % bitSize)) {
              return false;
            }
          }
          return true;
        }
      },
      /**
       * This strategy uses all 128 bits of {@link Hashing#murmur3_128} when hashing. It looks different
       * from the implementation in MURMUR128_MITZ_32 because we're avoiding the multiplication in the
       * loop and doing a (much simpler) += hash2. We're also changing the index to a positive number by
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sun Dec 22 03:38:46 UTC 2024
    - 10.6K bytes
    - Viewed (0)
Back to top