Examples of HashCode

com.google.common.hash.HashCode
An immutable hash code of arbitrary bit length. @author Dimitris Andreou @author Kurt Alfred Kluever @since 11.0
com.itextpdf.awt.geom.misc.HashCode
This class is a convenience method to sequentially calculate hash code of the object based on the field values. The result depends on the order of elements appended. The exact formula is the same as for java.util.List.hashCode. If you need order independent hash code just summate, multiply or XOR all elements.
Suppose we have class:
```
 class Thing { long id; String name; float weight; } 
```
The hash code calculation can be expressed in 2 forms.
For maximum performance:
```
 public int hashCode() { int hashCode = HashCode.EMPTY_HASH_CODE; hashCode = HashCode.combine(hashCode, id); hashCode = HashCode.combine(hashCode, name); hashCode = HashCode.combine(hashCode, weight); return hashCode; } 
```
For convenience:
```
 public int hashCode() { return new HashCode().append(id).append(name).append(weight).hashCode(); } 
```
@see java.util.List#hashCode()
org.apache.harmony.misc.HashCode
This class is a convenience method to sequentaly calculate hash code of the object based on the field values. The result depends on the order of elements appended. The exact formula is the same as for java.util.List.hashCode. If you need order independent hash code just summate, multiply or XOR all elements.
Suppose we have class:
```
 class Thing { long id; String name; float weight; } 
```
The hash code calulation can be expressed in 2 forms.
For maximum performance:
```
 public int hashCode() { int hashCode = HashCode.EMPTY_HASH_CODE; hashCode = HashCode.combine(hashCode, id); hashCode = HashCode.combine(hashCode, name); hashCode = HashCode.combine(hashCode, weight); return hashCode; } 
```
For convenience:
```
 public int hashCode() { return new HashCode().append(id).append(name).append(weight).hashCode(); } 
```
@see java.util.List#hashCode()
org.gwt.mosaic.core.client.util.HashCode
pache.org/ @author georgopoulos.georgios(at)gmail.com

Examples of com.google.common.hash.HashCode

    public void testLessThan16Bytes()
            throws Exception
    {
        byte[] data = randomBytes(ThreadLocalRandom.current().nextInt(16));


        HashCode expected = Hashing.murmur3_128().hashBytes(data);
        Slice actual = Murmur3.hash(Slices.wrappedBuffer(data));


        assertEquals(actual.getBytes(), expected.asBytes());
    }

View Full Code Here

Examples of com.google.common.hash.HashCode

    public void testMoreThan16Bytes()
            throws Exception
    {
        byte[] data = randomBytes(131);


        HashCode expected = Hashing.murmur3_128().hashBytes(data);
        Slice actual = Murmur3.hash(Slices.wrappedBuffer(data));


        assertEquals(actual.getBytes(), expected.asBytes());
    }

View Full Code Here

Examples of com.google.common.hash.HashCode

        byte[] data = randomBytes(131);


        int offset = 13;
        int length = 55;


        HashCode expected = Hashing.murmur3_128().hashBytes(data, offset, length);
        Slice actual = Murmur3.hash(Slices.wrappedBuffer(data), offset, length);


        assertEquals(actual.getBytes(), expected.asBytes());
    }

View Full Code Here

Examples of com.google.common.hash.HashCode

    {
        byte[] data = randomBytes(131);


        int seed = 123456789;


        HashCode expected = Hashing.murmur3_128(seed).hashBytes(data);
        Slice actual = Murmur3.hash(seed, Slices.wrappedBuffer(data), 0, data.length);


        assertEquals(actual.getBytes(), expected.asBytes());
    }

View Full Code Here

Examples of com.google.common.hash.HashCode

            throws Exception
    {
        for (int i = 0; i < 16; i++) {
            byte[] data = randomBytes(50 + i);


            HashCode expected = Hashing.murmur3_128().hashBytes(data);
            Slice actual = Murmur3.hash(Slices.wrappedBuffer(data));


            assertEquals(actual.getBytes(), expected.asBytes());
        }
    }

View Full Code Here

Examples of com.google.common.hash.HashCode

   @Test
   public void testBuildTreeHashFromMap() throws IOException {
      Builder<Integer, HashCode> map = ImmutableMap.<Integer, HashCode>builder();
      map.put(2, HashCode.fromString("9bc1b2a288b26af7257a36277ae3816a7d4f16e89c1e7e77d0a5c48bad62b360"));
      map.put(1, HashCode.fromString("9bc1b2a288b26af7257a36277ae3816a7d4f16e89c1e7e77d0a5c48bad62b360"));
      HashCode treehash = TreeHash.buildTreeHashFromMap(map.build());
      assertThat(treehash).isEqualTo(HashCode.fromString("560c2c9333c719cb00cfdffee3ba293db17f58743cdd1f7e4055373ae6300afa"));
   }

View Full Code Here

Examples of com.google.common.hash.HashCode

      String date = request.getFirstHeaderOrNull(GlacierHeaders.ALTERNATE_DATE);
      String dateWithoutTimestamp = formatDateWithoutTimestamp(date);
      String method = request.getMethod();
      String endpoint = request.getEndpoint().getRawPath();
      String credentialScope = buildCredentialScope(dateWithoutTimestamp);
      HashCode hashedPayload = buildHashedPayload(request);


      // Task 1: Create a Canonical Request For Signature Version 4.
      HashCode hashedCanonicalRequest = buildHashedCanonicalRequest(method, endpoint, hashedPayload,
            canonicalizedHeadersString, signedHeaders);


      // Task 2: Create a String to Sign for Signature Version 4.
      String stringToSign = createStringToSign(date, credentialScope, hashedCanonicalRequest);

View Full Code Here

Examples of com.google.common.hash.HashCode

   private static HashCode hashList(Collection<HashCode> hashList) {
      Builder<HashCode> result = ImmutableList.builder();
      while (hashList.size() > 1) {
         //Hash pairs of values and add them to the result list.
         for (Iterator<HashCode> it = hashList.iterator(); it.hasNext();) {
            HashCode hc1 = it.next();
            if (it.hasNext()) {
                HashCode hc2 = it.next();
                result.add(Hashing.sha256().newHasher()
                      .putBytes(hc1.asBytes())
                      .putBytes(hc2.asBytes())
                      .hash());
            } else {
               result.add(hc1);
            }
         }

View Full Code Here

Examples of com.google.common.hash.HashCode

      long partSizeInMb = 1;
      String uploadId = api.initiateMultipartUpload(VAULT_NAME1, partSizeInMb);
      try {
         assertThat(api.listMultipartUploads(VAULT_NAME1)).extracting("multipartUploadId").contains(uploadId);


         HashCode part1 = api.uploadPart(VAULT_NAME1, uploadId,
               ContentRange.fromPartNumber(0, partSizeInMb), buildPayload(partSizeInMb * MiB));
         HashCode part2 = api.uploadPart(VAULT_NAME1, uploadId,
               ContentRange.fromPartNumber(1, partSizeInMb), buildPayload(partSizeInMb * MiB));
         assertThat(part1).isNotNull();
         assertThat(part2).isNotNull();
         assertThat(api.listParts(VAULT_NAME1, uploadId)).extracting("treeHash").containsExactly(part1, part2);
      } finally {

View Full Code Here

Examples of com.google.common.hash.HashCode

      MockResponse mr = buildBaseResponse(201);
      mr.addHeader(HttpHeaders.LOCATION, ARCHIVE_LOCATION);
      mr.addHeader(GlacierHeaders.ARCHIVE_ID, ARCHIVE_ID);
      server.enqueue(mr);


      HashCode partHashcode = HashCode.fromString("9bc1b2a288b26af7257a36277ae3816a7d4f16e89c1e7e77d0a5c48bad62b360");
      ImmutableMap<Integer, HashCode> map = ImmutableMap.of(
            1, partHashcode,
            2, partHashcode,
            3, partHashcode,
            4, partHashcode);

View Full Code Here

0 1 2 3 4 5

TOP

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.