How to use the xxhashjs.h32 function in xxhashjs

To help you get started, we’ve selected a few xxhashjs examples, based on popular ways it is used in public projects.

Secure your code as it's written. Use Snyk Code to scan source code in minutes - no build needed - and fix issues immediately.

github wisnuc / appifi / test / individuals / iblt.js View on Github external
it('xxhashjs, xxhash, twice, expect 2847076442', function() {

    let js1 = XXH.h32("abcd", 0x01020304).toNumber()
    let js2 = XXH.h32("abcd", js1).toNumber()

    let buf = new Buffer("abcd")
    let ntv1 = xxhash.hash(buf, 0x01020304)
    let ntv2 = xxhash.hash(buf, ntv1)

    let enc = new Buffer(4)
    let enc2 = new Buffer(4)
    xxhash.hash(buf, 0x01020304, enc)

    expect(enc.equals(new Buffer('b5bfecd1', 'hex'))).to.be.true

    xxhash.hash(buf, enc.readUInt32LE(), enc)
    expect(enc.readUInt32LE()).to.equal(2847076642)
  })
})
github wisnuc / appifi / test / individuals / iblt.js View on Github external
it('xxhashjs, xxhash, twice, expect 2847076442', function() {

    let js1 = XXH.h32("abcd", 0x01020304).toNumber()
    let js2 = XXH.h32("abcd", js1).toNumber()

    let buf = new Buffer("abcd")
    let ntv1 = xxhash.hash(buf, 0x01020304)
    let ntv2 = xxhash.hash(buf, ntv1)

    let enc = new Buffer(4)
    let enc2 = new Buffer(4)
    xxhash.hash(buf, 0x01020304, enc)

    expect(enc.equals(new Buffer('b5bfecd1', 'hex'))).to.be.true

    xxhash.hash(buf, enc.readUInt32LE(), enc)
    expect(enc.readUInt32LE()).to.equal(2847076642)
  })
})
github LukeLin / js-stl / src / Search / BloomFilter.js View on Github external
remove(item){
        if(!Buffer.isBuffer(item)) item = Buffer.from(item);

        for(let i = 0; i < this.seeds.length; ++i){
            let hash = xxhash(item, this.seeds[i]).toString();
            let bit = hash % this.bits;

            this._unSetBit(bit);
        }
    }
}
github stricter / stricter / src / utils / index.ts View on Github external
export const getHashFunction = (): HashFunction => {
    const hasher = h32();
    hasher.init(123);

    return contents =>
        hasher
            .update(contents)
            .digest()
            .toString(16);
};
github streamlit / streamlit / frontend / src / lib / utils.ts View on Github external
export function hashString(s: string): string {
  return xxhash.h32(s, 0xdeadbeef).toString(16)
}
github pierrec / node-lz4 / lib / utils-js.js View on Github external
exports.descriptorChecksum = function (d) {
	return (XXH(d, CHECKSUM_SEED).toNumber() >> 8) & 0xFF
}
github farism / elm-factory / gulpfile.js View on Github external
const getHash = contents =>
    xxh.h32(0).update(String(contents)).digest().toString(16).substr(0, 8)
github Callidon / bloom-filters / src / utils.js View on Github external
function hashAsInt (elem, seed = getDefaultSeed(), length = 64) {
  switch (length) {
    case 32:
      return XXH.h32(elem, seed).toNumber()
    case 64:
      return XXH.h64(elem, seed).toNumber()
    default:
      return XXH.h64(elem, seed).toNumber()
  }
}
github pierrec / node-lz4 / lib / utils-js.js View on Github external
exports.streamChecksum = function (d, c) {
	if (d === null)
		return c.digest().toNumber()

	if (c === null)
		c = XXH(CHECKSUM_SEED)

	return c.update(d)
}
github Callidon / bloom-filters / src / utils.js View on Github external
function hashAsString (elem, seed = getDefaultSeed(), base = 16, length = 64) {
  let hash
  switch (length) {
    case 32:
      hash = XXH.h32(elem, seed)
      break
    case 64:
      hash = XXH.h64(elem, seed)
      break
    default:
      hash = XXH.h64(elem, seed)
      break
  }
  let string
  if (base === 16) {
    string = hash.toString(base)
    if (string.length < (length / 4)) {
      string = '0'.repeat((length / 4) - string.length) + string
    }
  } else if (base === 2) {
    string = hex2bin(hash.toString(16))

xxhashjs

xxHash in Javascript

MIT
Latest version published 7 years ago

Package Health Score

65 / 100
Full package analysis

Popular xxhashjs functions