Examples of Hasher

cascading.tuple.Hasher
The Hasher allows a {@link java.util.Comparator} implementation to also be delegated to during hashCode generationduring grouping partitioning.
If a Comparator is used to compare two types during grouping, its likely the {@code hashCode} value betweenthe two objects will not be consistent. This allows to objects being equal to hash to the same bucket (reducer) during partitioning.
com.boundlessgeo.geoserver.util.Hasher
ds.org/.
com.cloudhopper.commons.util.Hasher
.com/jjlauer" target=window>http://twitter.com/jjlauer)
com.facebook.presto.jdbc.internal.guava.hash.Hasher
A {@link PrimitiveSink} that can compute a hash code after reading the input. Each hasher shouldtranslate all multibyte values ( {@link #putInt(int)}, {@link #putLong(long)}, etc) to bytes in little-endian order.
Warning: The result of calling any methods after calling {@link #hash} is undefined.
Warning: Using a specific character encoding when hashing a {@link CharSequence} with{@link #putString(CharSequence,Charset)} is generally only useful for cross-languagecompatibility (otherwise prefer {@link #putUnencodedChars}). However, the character encodings must be identical across languages. Also beware that {@link Charset} definitions may occasionallychange between Java releases.
Warning: Chunks of data that are put into the {@link Hasher} are not delimited.The resulting {@link HashCode} is dependent only on the bytes inserted, and the order in whichthey were inserted, not how those bytes were chunked into discrete put() operations. For example, the following three expressions all generate colliding hash codes:
```
    {@code newHasher().putByte(b1).putByte(b2).putByte(b3).hash()}newHasher().putByte(b1).putBytes(new byte[]  b2, b3 }).hash() newHasher().putBytes(new byte[] { b1, b2, b3 }).hash()}
```
If you wish to avoid this, you should either prepend or append the size of each chunk. Keep in mind that when dealing with char sequences, the encoded form of two concatenated char sequences is not equivalent to the concatenation of their encoded form. Therefore, {@link #putString(CharSequence,Charset)} should only be used consistently with completesequences and not broken into chunks. @author Kevin Bourrillion @since 11.0
com.findwise.tools.Hasher
Helper class to get Message Digests in a lightweight fashion. Primarily useful because it lets you get a hex string of the digests instead of the raw bytes. @author joel.westberg
com.google.common.hash.Hasher
A {@link PrimitiveSink} that can compute a hash code after reading the input. Each hasher shouldtranslate all multibyte values ( {@link #putInt(int)}, {@link #putLong(long)}, etc) to bytes in little-endian order.
Warning: The result of calling any methods after calling {@link #hash} is undefined.
Warning: Using a specific character encoding when hashing a {@link CharSequence} with{@link #putString(CharSequence,Charset)} is generally only useful for cross-languagecompatibility (otherwise prefer {@link #putUnencodedChars}). However, the character encodings must be identical across languages. Also beware that {@link Charset} definitions may occasionallychange between Java releases.
Warning: Chunks of data that are put into the {@link Hasher} are not delimited.The resulting {@link HashCode} is dependent only on the bytes inserted, and the order in whichthey were inserted, not how those bytes were chunked into discrete put() operations. For example, the following three expressions all generate colliding hash codes:
```
    {@code newHasher().putByte(b1).putByte(b2).putByte(b3).hash()}newHasher().putByte(b1).putBytes(new byte[]  b2, b3 }).hash() newHasher().putBytes(new byte[] { b1, b2, b3 }).hash()}
```
If you wish to avoid this, you should either prepend or append the size of each chunk. Keep in mind that when dealing with char sequences, the encoded form of two concatenated char sequences is not equivalent to the concatenation of their encoded form. Therefore, {@link #putString(CharSequence,Charset)} should only be used consistently with completesequences and not broken into chunks. @author Kevin Bourrillion @since 11.0
com.google_voltpatches.common.hash.Hasher
A {@link PrimitiveSink} that can compute a hash code after reading the input. Each hasher shouldtranslate all multibyte values ( {@link #putInt(int)}, {@link #putLong(long)}, etc) to bytes in little-endian order.
Warning: The result of calling any methods after calling {@link #hash} is undefined.
Warning: Using a specific character encoding when hashing a {@link CharSequence} with{@link #putString(CharSequence,Charset)} is generally only useful for cross-languagecompatibility (otherwise prefer {@link #putUnencodedChars}). However, the character encodings must be identical across languages. Also beware that {@link Charset} definitions may occasionallychange between Java releases.
Warning: Chunks of data that are put into the {@link Hasher} are not delimited.The resulting {@link HashCode} is dependent only on the bytes inserted, and the order in whichthey were inserted, not how those bytes were chunked into discrete put() operations. For example, the following three expressions all generate colliding hash codes:
```
    {@code newHasher().putByte(b1).putByte(b2).putByte(b3).hash()}newHasher().putByte(b1).putBytes(new byte[]  b2, b3 }).hash() newHasher().putBytes(new byte[] { b1, b2, b3 }).hash()}
```
If you wish to avoid this, you should either prepend or append the size of each chunk. Keep in mind that when dealing with char sequences, the encoded form of two concatenated char sequences is not equivalent to the concatenation of their encoded form. Therefore, {@link #putString(CharSequence,Charset)} should only be used consistently with completesequences and not broken into chunks. @author Kevin Bourrillion @since 11.0
jersey.repackaged.com.google.common.hash.Hasher
A {@link PrimitiveSink} that can compute a hash code after reading the input. Each hasher shouldtranslate all multibyte values ( {@link #putInt(int)}, {@link #putLong(long)}, etc) to bytes in little-endian order.
The result of calling any methods after calling {@link #hash} is undefined.
Warning: Chunks of data that are put into the {@link Hasher} are not delimited.The resulting {@link HashCode} is dependent only on the bytes inserted, and the order in whichthey were inserted, not how those bytes were chunked into discrete put() operations. For example, the following three expressions all generate colliding hash codes:
```
    {@code newHasher().putString("ab").putString("c").hash() newHasher().putString("a").putString("bc").hash() newHasher().putChar('a').putChar('b').putChar('c').hash()}
```
If you wish to avoid this, you should either prepend or append the size of each chunk. For example:
```
    {@code newHasher().putInt(s1.length()).putString(s1).putInt(s2.length()).putString(s2).hash()}
```
@author Kevin Bourrillion @since 11.0
org.eclipse.jgit.treewalk.filter.ByteArraySet.Hasher
org.gradle.api.internal.hash.Hasher
org.openbel.framework.common.util.Hasher

Examples of com.google.common.hash.Hasher

        }


        try (TempFile tempFile = TempFile.create()) {
            FileRange.Builder c = FileRange.newBuilder();


            Hasher md5 = Hashing.md5().newHasher();
            try (OutputStream fos = new HashingOutputStream(new FileOutputStream(tempFile.getFile()), md5)) {
                for (int i = bestStart; i < bestEnd; i++) {
                    FileRange range = file.getRanges(i);
                    if (i == bestStart) {
                        c.setStart(range.getStart());
                    }
                    if (i == (bestEnd - 1)) {
                        c.setEnd(range.getEnd());
                    }


                    final BlobData blob = blobStore.find(range.getContentKey());
                    if (blob == null) {
                        throw new IOException("Unable to open storage for range: " + range);
                    }


                    blob.copyTo(fos);
                }
            }


            if (!c.hasStart() || !c.hasEnd()) {
                throw new IllegalStateException();
            }


            ByteString hash = ByteString.copyFrom(md5.hash().asBytes());
            BlobData blobData = new BlobData(tempFile.getFile(), hash);
            blobStore.put(blobData);


            if (PARANOID) {
                BlobData blob = blobStore.find(blobData.getHash());

View Full Code Here

Examples of com.google.common.hash.Hasher

        storeDirectory(getDirectoryStorage(project), newDir);
        return true;
    }


    public static void sanityCheck(BlobStore blobStore, FileData.Builder file) {
        Hasher md5 = Hashing.md5().newHasher();
        try (HashingOutputStream hos = new HashingOutputStream(ByteStreams.nullOutputStream(), md5)) {
            List<FileRange> ranges = file.getRangesList();
            for (int i = 0; i < ranges.size(); i++) {
                FileRange range = ranges.get(i);


                BlobData blob = blobStore.find(range.getContentKey());
                if (blob == null) {
                    throw new IllegalStateException("Unable to find blob for range: " + range);
                }


                log.debug("Sanity check: fetch blob {}", Hex.toHex(range.getContentKey().toByteArray()));
                if (blob.size() != (range.getEnd() - range.getStart())) {
                    throw new IllegalStateException();
                }


                blob.copyTo(hos);


                if (i != 0) {
                    FileRange prev = ranges.get(i - 1);


                    if (prev.getEnd() != range.getStart()) {
                        throw new IllegalStateException();
                    }
                } else {
                    if (range.getStart() != 0) {
                        throw new IllegalStateException();
                    }
                }


                if (i == (ranges.size() - 1)) {
                    if (range.getEnd() != file.getLength()) {
                        throw new IllegalStateException();
                    }
                }
            }
        } catch (IOException e) {
            throw new IllegalStateException("Error checking file: " + file, e);
        }


        ByteString hash = ByteString.copyFrom(md5.hash().asBytes());


        if (!file.getHash().equals(hash)) {
            log.warn("Hash mismatch: {} vs {}", Hex.toHex(file.getHash().toByteArray()), Hex.toHex(hash.toByteArray()));
            throw new IllegalStateException("Hash mismatch");
        }

View Full Code Here

Examples of com.google.common.hash.Hasher

        // TODO: Any more for the mix??


        material.add(computeFileHash("/proc/cpuinfo"));
        Collections.sort(material);


        Hasher hasher = Hashing.md5().newHasher();
        for (String s : material) {
            hasher.putString(s);
            hasher.putByte((byte) 0);
        }


        return hostname + "_" + hasher.hash().toString();
    }

View Full Code Here

Examples of com.google.common.hash.Hasher

            try (TempFile localTemp = TempFile.in(this.localCacheDirTmp)) {
                HashCode md5;


                try (Sftp sftp = buildSftp(); InputStream is = sftp.open(remoteFile.getSshPath())) {
                    try (OutputStream os = new FileOutputStream(localTemp.getFile())) {
                        Hasher hasher = Hashing.md5().newHasher();
                        byte[] buffer = new byte[8192];
                        while (true) {
                            int n = is.read(buffer);
                            if (n == -1) {
                                break;
                            }


                            hasher.putBytes(buffer, 0, n);
                            os.write(buffer, 0, n);
                        }
                        md5 = hasher.hash();
                    }
                } catch (FileNotFoundException e) {
                    // Unable to find sftp file
                    return null;
                }

View Full Code Here

Examples of com.google.common.hash.Hasher

   * Hashes the contents of this byte source using the given hash function.
   *
   * @throws IOException if an I/O error occurs in the process of reading from this source
   */
  public HashCode hash(HashFunction hashFunction) throws IOException {
    Hasher hasher = hashFunction.newHasher();
    copyTo(Funnels.asOutputStream(hasher));
    return hasher.hash();
  }

View Full Code Here

Examples of com.google.common.hash.Hasher

   * @since 12.0
   */
  public static HashCode hash(
      InputSupplier<? extends InputStream> supplier, HashFunction hashFunction)
      throws IOException {
    Hasher hasher = hashFunction.newHasher();
    copy(supplier, Funnels.asOutputStream(hasher));
    return hasher.hash();
  }

View Full Code Here

Examples of com.google.common.hash.Hasher


    @Test
    public void testZoneKeyData()
            throws Exception
    {
        Hasher hasher = Hashing.murmur3_128().newHasher();


        SortedSet<TimeZoneKey> timeZoneKeysSortedByKey = ImmutableSortedSet.copyOf(new Comparator<TimeZoneKey>()
        {
            @Override
            public int compare(TimeZoneKey left, TimeZoneKey right)
            {
                return Short.compare(left.getKey(), right.getKey());
            }
        }, TimeZoneKey.getTimeZoneKeys());


        for (TimeZoneKey timeZoneKey : timeZoneKeysSortedByKey) {
            hasher.putShort(timeZoneKey.getKey());
            hasher.putString(timeZoneKey.getId(), StandardCharsets.UTF_8);
        }
        // Zone file should not (normally) be changed, so let's make is more difficult
        assertEquals(hasher.hash().asLong(), 7273867108989103529L, "zone-index.properties file contents changed!");
    }

View Full Code Here

Examples of com.google.common.hash.Hasher

    }


    @Override
    public int hashCode() {
        HashFunction hf = Hashing.murmur3_32();
        Hasher hc = hf.newHasher();
        for (String key : fields.keySet()) {
            hc.putString(key);
        }
        return hc.hash().asInt();
    }

View Full Code Here

Examples of com.google.common.hash.Hasher

  private static final HashFunction hashFn = Hashing.murmur3_128();
  public static final char SEPARATOR = '\u0001';


  protected static void hashRow(List<DimensionSelector> selectorList, HyperLogLogCollector collector)
  {
    final Hasher hasher = hashFn.newHasher();
    for (int k = 0; k < selectorList.size(); ++k) {
      if (k != 0) {
        hasher.putByte((byte) 0);
      }
      final DimensionSelector selector = selectorList.get(k);
      final IndexedInts row = selector.getRow();
      final int size = row.size();
      // nothing to add to hasher if size == 0, only handle size == 1 and size != 0 cases.
      if (size == 1) {
        final String value = selector.lookupName(row.get(0));
        hasher.putUnencodedChars(value != null ? value : NULL_STRING);
      } else if (size != 0) {
        final String[] values = new String[size];
        for (int i = 0; i < size; ++i) {
          final String value = selector.lookupName(row.get(i));
          values[i] = value != null ? value : NULL_STRING;
        }
        // Values need to be sorted to ensure consistent multi-value ordering across different segments
        Arrays.sort(values);
        for (int i = 0; i < size; ++i) {
          if (i != 0) {
            hasher.putChar(SEPARATOR);
          }
          hasher.putUnencodedChars(values[i]);
        }
      }
    }
    collector.add(hasher.hash().asBytes());
  }

View Full Code Here

Examples of com.google.common.hash.Hasher

    }


    @Override
    public int hashCode() {
        HashFunction hf = Hashing.goodFastHash(32);
        Hasher h = hf.newHasher();
        h.putInt(slots.size());
        for (int i=0; i<slots.size(); i++) {
            h.putInt(slots.get(i).size());
            for (int j=0; j<slots.size(); j++) {
                h.putBytes(slots.get(i).get(j).getLowerRange());
                h.putBytes(slots.get(i).get(j).getUpperRange());
            }
        }
        return h.hash().asInt();
    }

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.