- Sort Score
- Result 10 results
- Languages All
Results 1 - 1 of 1 for CRC (0.16 sec)
-
android/guava/src/com/google/common/hash/Crc32cHashFunction.java
/* * The striding algorithm works roughly as follows: it is universally the case that * CRC(x ^ y) == CRC(x) ^ CRC(y). The approach we take is to break the message as follows, * with each letter representing a 4-byte word: ABCDABCDABCDABCD... and to calculate * CRC(A000A000A000...), CRC(0B000B000B...), CRC(00C000C000C...), CRC(000D000D000D...) * and then to XOR them together. The STRIDE_TABLE enables us to hash an int followed by 12
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Apr 20 18:43:59 GMT 2021 - 21.3K bytes - Viewed (0)