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_voltpatches.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 jersey.repackaged.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 org.eclipse.jgit.treewalk.filter.ByteArraySet.Hasher

      // egit/jgit: 8
      // git: 5
      // linux kernel: 13
      // eclipse.platform.ui: 7
      max = pathFilters[0].pathRaw;
      Hasher hasher = new Hasher(null, 0);
      for (PathFilter pf : pathFilters) {
        hasher.init(pf.pathRaw, pf.pathRaw.length);
        while (hasher.hasNext()) {
          int hash = hasher.nextHash();
          if (hasher.hasNext())
            prefixes.addIfAbsent(pf.pathRaw, hasher.length(), hash);
        }
        fullpaths.addIfAbsent(pf.pathRaw, pf.pathRaw.length,
            hasher.getHash());
        if (compare(max, pf.pathRaw) < 0)
          max = pf.pathRaw;
      }
      // Adjust max for the git sort order. A path we compare
      // with may end with a slash at any position (but the

View Full Code Here

Examples of org.eclipse.jgit.treewalk.filter.ByteArraySet.Hasher


    @Override
    public boolean include(final TreeWalk walker) {


      byte[] rp = walker.getRawPath();
      Hasher hasher = new Hasher(rp, walker.getPathLength());
      while (hasher.hasNext()) {
        int hash = hasher.nextHash();
        if (fullpaths.contains(rp, hasher.length(), hash))
          return true;
        if (!hasher.hasNext())
          if (prefixes.contains(rp, hasher.length(), hash))
            return true;
      }


      final int cmp = walker.isPathPrefix(max, max.length);
      if (cmp > 0)

View Full Code Here

Examples of org.gradle.api.internal.hash.Hasher


    public IncrementalCompilerFactory(FileOperations fileOperations, String compileDisplayName, CleaningJavaCompiler cleaningJavaCompiler,
                                      List<Object> source, CompileCaches compileCaches, IncrementalTaskInputsInternal inputs) {
        this.inputs = inputs;
        //bunch of services that enable incremental java compilation.
        Hasher hasher = new DefaultHasher(); //TODO SF use caching hasher
        ClassDependenciesAnalyzer analyzer = new CachingClassDependenciesAnalyzer(new DefaultClassDependenciesAnalyzer(), hasher, compileCaches.getClassAnalysisCache());
        JarSnapshotter jarSnapshotter = new CachingJarSnapshotter(hasher, analyzer, compileCaches.getJarSnapshotCache(), inputs.getInputFilesSnapshot());


        JarClasspathSnapshotMaker jarClasspathSnapshotMaker = new JarClasspathSnapshotMaker(compileCaches.getLocalJarClasspathSnapshotStore(), new JarClasspathSnapshotFactory(jarSnapshotter), new ClasspathJarFinder(fileOperations));
        CompilationSourceDirs sourceDirs = new CompilationSourceDirs(source);

View Full Code Here

Examples of org.openbel.framework.common.util.Hasher

            reportable.error("Unable to read file");
            reportable.error("Reason: " + e.getMessage());
            bail(GENERAL_FAILURE);
        }


        Hasher hasher = Hasher.INSTANCE;
        try {
            String generatedhash = hasher.hashValue(hashContents);
            reportable.output("Checksum: " + generatedhash);
        } catch (Exception e) {
            reportable.error("Unable to created checksum");
            reportable.error("Reason: " + e.getMessage());
            bail(GENERAL_FAILURE);

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.