Examples of Hash

abstrasy.Hash
com.bitsofproof.supernode.common.Hash
com.cedarsoft.crypt.Hash
Represents a hash value @author Johannes Schneider (js@cedarsoft.com)
com.flaptor.hounder.indexer.util.Hash
This class implements a utility to calculate a uniform hash based on md5. @author Flaptor Development Team
com.hp.hpl.jena.tdb.store.Hash
Hash values.
com.maverick.crypto.digests.Hash

Useful utility class that provides a wrapper around a digest with methods to update the digest with many of the common parameter types used throughout the API.
@author Lee David Painter
com.sshtools.j2ssh.util.Hash
@author $author$ @version $Revision: 1.13 $
com.torrent4j.util.Hash
org.apache.hadoop.hbase.util.Hash
This class represents a common API for hashing functions.
org.apache.hadoop.util.hash.Hash
This class represents a common API for hashing functions.
org.apache.shiro.crypto.hash.Hash
A Cryptographic {@code Hash} represents a one-way conversion algorithm that transforms an input source to anunderlying byte array. @author Les Hazlewood @see AbstractHash @see Md2Hash @see Md5Hash @see Sha1Hash @see Sha256Hash @see Sha384Hash @see Sha512Hash @since 0.9
org.auraframework.util.text.Hash
A wrapper around an MD5 hash. This functions as a future, being created before the hash value is actually computed.
org.cx4a.rsense.typing.runtime.Hash
org.infinispan.commons.hash.Hash
Interface that governs implementations @author Manik Surtani @author Patrick McFarland @see MurmurHash2 @see MurmurHash3
org.infinispan.util.hash.Hash
Interface that governs implementations @author Manik Surtani @author Patrick McFarland @see MurmurHash2 @see MurmurHash3
org.jboss.seam.wiki.util.Hash
Not super safe, should use a random salt, prepended later on the digest. Should also iterate the hashing a few thousand times to make brute force attacks more difficult. Oh well, probably good enough for storing things in an internal database.
org.jruby.compiler.ir.operands.Hash
org.jruby.ir.operands.Hash
org.moparscape.msc.gs.util.Hash
org.moparscape.msc.ls.util.Hash

org.rendersnake.Hash

Usage:

new Hash("key","value","bool",true,"int,42,....) toJavascript() {key:'value',bool:true,int:42} toAttributesString() key="value" bool="true" int="42"

@author e.micklei

org.rometools.feed.module.mediarss.types.Hash
<media:hash>

This is the hash of the binary media file. It can appear multiple times as long as each instance is a different algo. It has 1 optional attribute.
```
        <media:hash algo="md5">dfdec888b72151965a34b4b59031290a</media:hash>
```
algo indicates the algorithm used to create the hash. Possible values are 'md5' and 'sha-1'. Default value is 'md5'. It is an optional attribute. @author cooper
org.telehash.Hash
org.vngx.jsch.hash.Hash

Interface to define a cryptographic hash algorithm. A cryptographic hash function is a deterministic procedure that takes an arbitrary block of data and returns a fixed-size bit string, the (cryptographic) hash value, such that an accidental or intentional change to the data will change the hash value. The data to be encoded is often called the "message", and the hash value is sometimes called the message digest or simply digest.

Note: Implementations may not be thread-safe and should be externally synchronized.

Note: Instances should be created using the {@code HashManager} factory.
@see org.vngx.jsch.hash.HashManager @author Michael Laudati
rocks.xmpp.extensions.hashes.model.Hash
xtensions/xep-0300.html">XEP-0300: Use of Cryptographic Hash Functions in XMPP @see XML Schema

Examples of org.apache.hadoop.hbase.util.Hash


    Path inputFile = new Path(inputDir, "input.txt");
    PrintStream out = new PrintStream(fs.create(inputFile));
    // Make input random.
    Map<Integer, String> m = new TreeMap<Integer, String>();
    Hash h = MurmurHash.getInstance();
    int perClientRows = (this.R / this.N);
    try {
      for (int i = 0; i < 10; i++) {
        for (int j = 0; j < N; j++) {
          String s = "tableName=" + this.tableName +
          ", startRow=" + ((j * perClientRows) + (i * (perClientRows/10))) +
          ", perClientRunRows=" + (perClientRows / 10) +
          ", totalRows=" + this.R +
          ", clients=" + this.N +
          ", flushCommits=" + this.flushCommits +
          ", writeToWAL=" + this.writeToWAL;
          int hash = h.hash(Bytes.toBytes(s));
          m.put(hash, s);
        }
      }
      for (Map.Entry<Integer, String> e: m.entrySet()) {
        out.println(e.getValue());

View Full Code Here

Examples of org.apache.hadoop.hbase.util.Hash

    fs.mkdirs(subdir);
    Path inputFile = new Path(subdir, "input.txt");
    PrintStream out = new PrintStream(fs.create(inputFile));
    // Make input random.
    Map<Integer, String> m = new TreeMap<Integer, String>();
    Hash h = MurmurHash.getInstance();
    int perClientRows = (this.R / this.N);
    try {
      for (int i = 0; i < 10; i++) {
        for (int j = 0; j < N; j++) {
          String s = "startRow=" + ((j * perClientRows) + (i * (perClientRows/10))) +
          ", perClientRunRows=" + (perClientRows / 10) +
          ", totalRows=" + this.R +
          ", sampleRate=" + this.sampleRate +
          ", clients=" + this.N +
          ", flushCommits=" + this.flushCommits +
          ", writeToWAL=" + this.writeToWAL +
          ", reportLatency=" + this.reportLatency +
          ", filterAll=" + this.filterAll;
          int hash = h.hash(Bytes.toBytes(s));
          m.put(hash, s);
        }
      }
      for (Map.Entry<Integer, String> e: m.entrySet()) {
        out.println(e.getValue());

View Full Code Here

Examples of org.apache.hadoop.hbase.util.Hash


    Path inputFile = new Path(inputDir, "input.txt");
    PrintStream out = new PrintStream(fs.create(inputFile));
    // Make input random.
    Map<Integer, String> m = new TreeMap<Integer, String>();
    Hash h = MurmurHash.getInstance();
    int perClientRows = (opts.totalRows / opts.numClientThreads);
    ObjectMapper mapper = new ObjectMapper();
    mapper.configure(SORT_PROPERTIES_ALPHABETICALLY, true);
    try {
      for (int i = 0; i < 10; i++) {
        for (int j = 0; j < opts.numClientThreads; j++) {
          TestOptions next = new TestOptions(opts);
          next.startRow = (j * perClientRows) + (i * (perClientRows/10));
          next.perClientRunRows = perClientRows / 10;
          String s = mapper.writeValueAsString(next);
          int hash = h.hash(Bytes.toBytes(s));
          m.put(hash, s);
        }
      }
      for (Map.Entry<Integer, String> e: m.entrySet()) {
        out.println(e.getValue());

View Full Code Here

Examples of org.apache.hadoop.hbase.util.Hash


    Path inputFile = new Path(inputDir, "input.txt");
    PrintStream out = new PrintStream(fs.create(inputFile));
    // Make input random.
    Map<Integer, String> m = new TreeMap<Integer, String>();
    Hash h = MurmurHash.getInstance();
    int perClientRows = (this.R / this.N);
    try {
      for (int i = 0; i < 10; i++) {
        for (int j = 0; j < N; j++) {
          String s = "tableName=" + this.tableName +
          ", startRow=" + ((j * perClientRows) + (i * (perClientRows/10))) +
          ", perClientRunRows=" + (perClientRows / 10) +
          ", totalRows=" + this.R +
          ", sampleRate=" + this.sampleRate +
          ", clients=" + this.N +
          ", flushCommits=" + this.flushCommits +
          ", writeToWAL=" + this.writeToWAL +
          ", useTags=" + this.useTags +
          ", noOfTags=" + this.noOfTags +
          ", reportLatency=" + this.reportLatency;
          int hash = h.hash(Bytes.toBytes(s));
          m.put(hash, s);
        }
      }
      for (Map.Entry<Integer, String> e: m.entrySet()) {
        out.println(e.getValue());

View Full Code Here

Examples of org.apache.hadoop.hbase.util.Hash

    fs.mkdirs(subdir);
    Path inputFile = new Path(subdir, "input.txt");
    PrintStream out = new PrintStream(fs.create(inputFile));
    // Make input random.
    Map<Integer, String> m = new TreeMap<Integer, String>();
    Hash h = MurmurHash.getInstance();
    int perClientRows = (this.R / this.N);
    try {
      for (int i = 0; i < 10; i++) {
        for (int j = 0; j < N; j++) {
          String s = "startRow=" + ((j * perClientRows) + (i * (perClientRows/10))) +
          ", perClientRunRows=" + (perClientRows / 10) +
          ", totalRows=" + this.R +
          ", clients=" + this.N;
          int hash = h.hash(Bytes.toBytes(s));
          m.put(hash, s);
        }
      }
      for (Map.Entry<Integer, String> e: m.entrySet()) {
        out.println(e.getValue());

View Full Code Here

Examples of org.apache.hadoop.hbase.util.Hash

    fs.mkdirs(subdir);
    Path inputFile = new Path(subdir, "input.txt");
    PrintStream out = new PrintStream(fs.create(inputFile));
    // Make input random.
    Map<Integer, String> m = new TreeMap<Integer, String>();
    Hash h = MurmurHash.getInstance();
    int perClientRows = (this.R / this.N);
    try {
      for (int i = 0; i < 10; i++) {
        for (int j = 0; j < N; j++) {
          String s = "startRow=" + ((j * perClientRows) + (i * (perClientRows/10))) +
          ", perClientRunRows=" + (perClientRows / 10) +
          ", totalRows=" + this.R +
          ", sampleRate=" + this.sampleRate +
          ", clients=" + this.N +
          ", flushCommits=" + this.flushCommits +
          ", writeToWAL=" + this.writeToWAL +
          ", reportLatency=" + this.reportLatency;
          int hash = h.hash(Bytes.toBytes(s));
          m.put(hash, s);
        }
      }
      for (Map.Entry<Integer, String> e: m.entrySet()) {
        out.println(e.getValue());

View Full Code Here

Examples of org.apache.hadoop.hbase.util.Hash

    fs.mkdirs(subdir);
    Path inputFile = new Path(subdir, "input.txt");
    PrintStream out = new PrintStream(fs.create(inputFile));
    // Make input random.
    Map<Integer, String> m = new TreeMap<Integer, String>();
    Hash h = MurmurHash.getInstance();
    int perClientRows = (R / N);
    try {
      for (int i = 0; i < 10; i++) {
        for (int j = 0; j < N; j++) {
          String s = "startRow=" + ((j * perClientRows) + (i * (perClientRows/10))) +
          ", perClientRunRows=" + (perClientRows / 10) +
          ", totalRows=" + R +
          ", clients=" + N +
          ", rowsPerPut=" + B;
          int hash = h.hash(Bytes.toBytes(s));
          m.put(hash, s);
        }
      }
      for (Map.Entry<Integer, String> e: m.entrySet()) {
        out.println(e.getValue());

View Full Code Here

Examples of org.apache.hadoop.hbase.util.Hash

    fs.mkdirs(subdir);
    Path inputFile = new Path(subdir, "input.txt");
    PrintStream out = new PrintStream(fs.create(inputFile));
    // Make input random.
    Map<Integer, String> m = new TreeMap<Integer, String>();
    Hash h = MurmurHash.getInstance();
    int perClientRows = (this.R / this.N);
    try {
      for (int i = 0; i < 10; i++) {
        for (int j = 0; j < N; j++) {
          String s = "startRow=" + ((j * perClientRows) + (i * (perClientRows/10))) +
          ", perClientRunRows=" + (perClientRows / 10) +
          ", totalRows=" + this.R +
          ", clients=" + this.N +
          ", flushCommits=" + this.flushCommits +
          ", writeToWAL=" + this.writeToWAL;
          int hash = h.hash(Bytes.toBytes(s));
          m.put(hash, s);
        }
      }
      for (Map.Entry<Integer, String> e: m.entrySet()) {
        out.println(e.getValue());

View Full Code Here

Examples of org.apache.hadoop.hbase.util.Hash

    fs.mkdirs(subdir);
    Path inputFile = new Path(subdir, "input.txt");
    PrintStream out = new PrintStream(fs.create(inputFile));
    // Make input random.
    Map<Integer, String> m = new TreeMap<Integer, String>();
    Hash h = MurmurHash.getInstance();
    int perClientRows = (this.R / this.N);
    try {
      for (int i = 0; i < 10; i++) {
        for (int j = 0; j < N; j++) {
          String s = "startRow=" + ((j * perClientRows) + (i * (perClientRows/10))) +
          ", perClientRunRows=" + (perClientRows / 10) +
          ", totalRows=" + this.R +
          ", clients=" + this.N;
          int hash = h.hash(Bytes.toBytes(s));
          m.put(hash, s);
        }
      }
      for (Map.Entry<Integer, String> e: m.entrySet()) {
        out.println(e.getValue());

View Full Code Here

Examples of org.apache.hadoop.hbase.util.Hash


    Path inputFile = new Path(inputDir, "input.txt");
    PrintStream out = new PrintStream(fs.create(inputFile));
    // Make input random.
    Map<Integer, String> m = new TreeMap<Integer, String>();
    Hash h = MurmurHash.getInstance();
    int perClientRows = (this.R / this.N);
    try {
      for (int i = 0; i < 10; i++) {
        for (int j = 0; j < N; j++) {
          String s = "tableName=" + this.tableName +
          ", startRow=" + ((j * perClientRows) + (i * (perClientRows/10))) +
          ", perClientRunRows=" + (perClientRows / 10) +
          ", totalRows=" + this.R +
          ", sampleRate=" + this.sampleRate +
          ", clients=" + this.N +
          ", flushCommits=" + this.flushCommits +
          ", writeToWAL=" + this.writeToWAL +
          ", reportLatency=" + this.reportLatency;
          int hash = h.hash(Bytes.toBytes(s));
          m.put(hash, s);
        }
      }
      for (Map.Entry<Integer, String> e: m.entrySet()) {
        out.println(e.getValue());

View Full Code Here

0 1 2 3 4 5 6

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.