Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 31 - 40 of 201 for hasher (0.04 seconds)

  1. guava-tests/test/com/google/common/hash/HashingTest.java

        HashCode hash31 = HashCode.fromInt(31);
        HashCode hash32 = HashCode.fromInt(32);
        assertEquals(hash32, Hashing.combineUnordered(ImmutableList.of(hash32)));
        assertEquals(HashCode.fromInt(64), Hashing.combineUnordered(ImmutableList.of(hash32, hash32)));
        assertEquals(
            HashCode.fromInt(96), Hashing.combineUnordered(ImmutableList.of(hash32, hash32, hash32)));
        assertEquals(
    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
    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. guava-tests/test/com/google/common/hash/HashTestUtils.java

          RandomHasherAction.pickAtRandom(random2).performAction(random2, ImmutableSet.of(hasher2));
        }
    
        Assert.assertEquals(expected1, hasher1.hash());
        Assert.assertEquals(expected2, hasher2.hash());
      }
    
      static HashCode randomHash(HashFunction hashFunction, Random random, int numActions) {
        Hasher hasher = hashFunction.newHasher();
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Oct 28 18:19:59 GMT 2025
    - 25.6K bytes
    - Click Count (0)
  4. doc/next/6-stdlib/99-minor/hash/maphash/70471.md

    The [Hasher] interface type defines the contract between values of a
    particular type and future hash-based data structures such as hash
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Fri Apr 03 15:21:15 GMT 2026
    - 191 bytes
    - Click Count (0)
  5. guava-tests/test/com/google/common/hash/Murmur3Hash32Test.java

        // https://github.com/aappleby/smhasher/blob/master/src/main.cpp
        HashTestUtils.verifyHashFunction(hf, 32, 0xB0F57EE3);
      }
    
      public void testParanoid() {
        HashFn hf =
            new HashFn() {
              @Override
              public byte[] hash(byte[] input, int seed) {
                Hasher hasher = murmur3_32(seed).newHasher();
                byteArrayFunnel().funnel(input, hasher);
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Mar 19 18:53:45 GMT 2026
    - 8.4K bytes
    - Click Count (0)
  6. internal/logger/target/kafka/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
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 3.3K bytes
    - Click Count (0)
  7. internal/hash/checksum.go

    func (c ChecksumType) CanMerge() bool {
    	return c.Is(ChecksumCRC64NVME) || c.Is(ChecksumCRC32C) || c.Is(ChecksumCRC32)
    }
    
    // Hasher returns a hasher corresponding to the checksum type.
    // Returns nil if no checksum.
    func (c ChecksumType) Hasher() hash.Hash {
    	switch {
    	case c.Is(ChecksumCRC32):
    		return crc32.NewIEEE()
    	case c.Is(ChecksumCRC32C):
    		return crc32.New(crc32.MakeTable(crc32.Castagnoli))
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri Aug 22 14:15:21 GMT 2025
    - 18.3K bytes
    - Click Count (0)
  8. android/guava-tests/benchmark/com/google/common/hash/HashFunctionBenchmark.java

      void setUp() {
        testBytes = new byte[size];
        random.nextBytes(testBytes);
      }
    
      @Benchmark
      int hasher(int reps) {
        HashFunction hashFunction = hashFunctionEnum.getHashFunction();
        int result = 37;
        for (int i = 0; i < reps; i++) {
          result ^= hashFunction.newHasher().putBytes(testBytes).hash().asBytes()[0];
        }
        return result;
      }
    
      @Benchmark
      int hashFunction(int reps) {
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Dec 19 18:03:30 GMT 2024
    - 2.4K bytes
    - Click Count (0)
  9. android/guava/src/com/google/common/hash/AbstractHashFunction.java

      }
    
      @Override
      public HashCode hashBytes(ByteBuffer input) {
        return newHasher(input.remaining()).putBytes(input).hash();
      }
    
      @Override
      public Hasher newHasher(int expectedInputSize) {
        checkArgument(
            expectedInputSize >= 0, "expectedInputSize must be >= 0 but was %s", expectedInputSize);
        return newHasher();
      }
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Sun Dec 22 03:38:46 GMT 2024
    - 2.4K bytes
    - Click Count (0)
  10. guava-tests/benchmark/com/google/common/hash/HashFunctionBenchmark.java

      void setUp() {
        testBytes = new byte[size];
        random.nextBytes(testBytes);
      }
    
      @Benchmark
      int hasher(int reps) {
        HashFunction hashFunction = hashFunctionEnum.getHashFunction();
        int result = 37;
        for (int i = 0; i < reps; i++) {
          result ^= hashFunction.newHasher().putBytes(testBytes).hash().asBytes()[0];
        }
        return result;
      }
    
      @Benchmark
      int hashFunction(int reps) {
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Dec 19 18:03:30 GMT 2024
    - 2.4K bytes
    - Click Count (0)
Back to Top