Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 11 - 20 of 380 for hashing (0.04 seconds)

  1. 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(),
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Fri Mar 13 13:01:07 GMT 2026
    - 26.7K bytes
    - Click Count (2)
  2. internal/event/target/kafka_scram_client_contrib.go

    // KafkaSHA256 is a function that returns a crypto/sha256 hasher and should be used
    // to create Client objects configured for SHA-256 hashing.
    var KafkaSHA256 scram.HashGeneratorFcn = sha256.New
    
    // KafkaSHA512 is a function that returns a crypto/sha512 hasher and should be used
    // to create Client objects configured for SHA-512 hashing.
    var KafkaSHA512 scram.HashGeneratorFcn = sha512.New
    
    // XDGSCRAMClient implements the client-side of an authentication
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 3.2K bytes
    - Click Count (0)
  3. cmd/erasure-sets_test.go

    		{"a/b/c/", 159},
    		{"/a/b/c", 96},
    		{string([]byte{0xff, 0xfe, 0xfd}), 147},
    	}
    
    	// Tests hashing order to be consistent.
    	for i, testCase := range testCases {
    		if sipHashElement := hashKey("SIPMOD", testCase.objectName, 200, testUUID); sipHashElement != testCase.sipHash {
    			t.Errorf("Test case %d: Expected \"%v\" but failed \"%v\"", i+1, testCase.sipHash, sipHashElement)
    		}
    	}
    
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 6.8K bytes
    - Click Count (0)
  4. 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
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Mar 19 18:53:45 GMT 2026
    - 10.7K bytes
    - Click Count (0)
  5. android/guava/src/com/google/common/hash/Hasher.java

     * little-endian order.
     *
     * <p><b>Warning:</b> The result of calling any methods after calling {@link #hash} is undefined.
     *
     * <p><b>Warning:</b> Using a specific character encoding when hashing a {@link CharSequence} with
     * {@link #putString(CharSequence, Charset)} is generally only useful for cross-language
     * compatibility (otherwise prefer {@link #putUnencodedChars}). However, the character encodings
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Mar 17 20:26:29 GMT 2025
    - 5.5K bytes
    - Click Count (0)
  6. android/guava/src/com/google/common/hash/package-info.java

     */
    
    // TODO(user): when things stabilize, flesh this out
    /**
     * Hash functions and related structures.
     *
     * <p>See the Guava User Guide article on <a
     * href="https://github.com/google/guava/wiki/HashingExplained">hashing</a>.
     */
    @CheckReturnValue
    @NullMarked
    package com.google.common.hash;
    
    import com.google.errorprone.annotations.CheckReturnValue;
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Sat Dec 21 14:50:24 GMT 2024
    - 991 bytes
    - Click Count (0)
  7. src/test/java/jcifs/util/CryptoTest.java

        }
    
        @ParameterizedTest
        @ValueSource(strings = { "", "a", "short", "medium length text", "very long text that exceeds typical block sizes" })
        @DisplayName("Should handle various input sizes for hashing")
        void testHashVariousInputSizes(String input) {
            // Given
            byte[] data = input.getBytes();
    
            // When
            MessageDigest md4 = Crypto.getMD4();
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Thu Aug 14 05:31:44 GMT 2025
    - 7.4K bytes
    - Click Count (0)
  8. docs/en/docs/project-generation.md

      - 🧪 [Playwright](https://playwright.dev) for End-to-End testing.
      - 🦇 Dark mode support.
    - 🐋 [Docker Compose](https://www.docker.com) for development and production.
    - 🔒 Secure password hashing by default.
    - 🔑 JWT (JSON Web Token) authentication.
    - 📫 Email based password recovery.
    - ✅ Tests with [Pytest](https://pytest.org).
    - 📞 [Traefik](https://traefik.io) as a reverse proxy / load balancer.
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 05 18:13:19 GMT 2026
    - 1.9K bytes
    - Click Count (0)
  9. docs/zh-hant/docs/tutorial/security/simple-oauth2.md

    先把那些資料放進 Pydantic 的 `UserInDB` 模型。
    
    你絕對不要以純文字儲存密碼,所以我們會使用(假的)密碼雜湊系統。
    
    如果密碼不匹配,我們回傳同樣的錯誤。
    
    #### 密碼雜湊(hashing) { #password-hashing }
    
    「雜湊」的意思是:把一些內容(這裡是密碼)轉換成一串看起來像亂碼的位元組序列(就是字串)。
    
    只要你輸入完全相同的內容(完全相同的密碼),就會得到完全相同的亂碼。
    
    但你無法從這串亂碼還原回原本的密碼。
    
    ##### 為何要做密碼雜湊 { #why-use-password-hashing }
    
    如果你的資料庫被竊取,攻擊者拿到的不是使用者的純文字密碼,而只是雜湊值。
    
    因此攻擊者無法嘗試把那些密碼用在其他系統上(因為很多使用者在各處都用同一組密碼,這會很危險)。
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Fri Mar 20 17:05:38 GMT 2026
    - 9.1K bytes
    - Click Count (0)
  10. cmd/erasure-metadata-utils_test.go

    	}
    
    	// Tests hashing order to be consistent.
    	for i, testCase := range testCases {
    		hashedOrder := hashOrder(testCase.objectName, 16)
    		if !reflect.DeepEqual(testCase.hashedOrder, hashedOrder) {
    			t.Errorf("Test case %d: Expected \"%v\" but failed \"%v\"", i+1, testCase.hashedOrder, hashedOrder)
    		}
    	}
    
    	// Tests hashing order to fail for when order is '-1'.
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 7.3K bytes
    - Click Count (0)
Back to Top