HomeSort by relevance Sort by last modified time
    Searched refs:hash (Results 176 - 200 of 5079) sorted by null

1 2 3 4 5 6 78 91011>>

  /external/guava/guava/src/com/google/common/base/
PairwiseEquivalence.java 52 int hash = 78721; local
54 hash = hash * 24943 + elementEquivalence.hash(element);
56 return hash;
  /external/guava/guava-tests/test/com/google/common/hash/
Murmur3Hash32Test.java 17 package com.google.common.hash;
19 import static com.google.common.hash.Hashing.murmur3_32;
21 import com.google.common.hash.HashTestUtils.HashFn;
61 @Override public byte[] hash(byte[] input, int seed) {
64 return hasher.hash().asBytes();
  /external/libphonenumber/libphonenumber/src/com/google/i18n/phonenumbers/
Phonenumber.java 249 int hash = 41; local
250 hash = (53 * hash) + getCountryCode();
251 hash = (53 * hash) + Long.valueOf(getNationalNumber()).hashCode();
252 hash = (53 * hash) + getExtension().hashCode();
253 hash = (53 * hash) + (isItalianLeadingZero() ? 1231 : 1237);
254 hash = (53 * hash) + getNumberOfLeadingZeros()
    [all...]
  /external/wpa_supplicant_8/src/crypto/
sha256-prf.c 60 u8 hash[SHA256_MAC_LEN]; local
87 hash) < 0)
89 os_memcpy(&buf[pos], hash, plen);
105 os_memset(hash, 0, sizeof(hash));
sha384-prf.c 60 u8 hash[SHA384_MAC_LEN]; local
87 hash) < 0)
89 os_memcpy(&buf[pos], hash, plen);
105 os_memset(hash, 0, sizeof(hash));
sha512-prf.c 60 u8 hash[SHA512_MAC_LEN]; local
87 hash) < 0)
89 os_memcpy(&buf[pos], hash, plen);
105 os_memset(hash, 0, sizeof(hash));
  /external/wpa_supplicant_8/src/eap_common/
eap_peap_common.c 21 u8 hash[SHA1_MAC_LEN]; local
27 addr[0] = hash;
72 if (hmac_sha1_vector(key, key_len, 5, addr, len, hash) < 0)
75 os_memcpy(&buf[pos], hash, SHA1_MAC_LEN);
78 os_memcpy(&buf[pos], hash, plen);
  /prebuilts/go/darwin-x86/src/runtime/pprof/
map.go 12 hash map[uintptr]*profMapEntry
21 nextHash *profMapEntry // next in hash list
29 // Compute hash of (stk, tag).
41 for e := m.hash[h]; e != nil; last, e = e, e.nextHash {
53 e.nextHash = m.hash[h]
54 m.hash[h] = e
65 e.nextHash = m.hash[h]
77 if m.hash == nil {
78 m.hash = make(map[uintptr]*profMapEntry)
80 m.hash[h] =
    [all...]
  /prebuilts/go/linux-x86/src/runtime/pprof/
map.go 12 hash map[uintptr]*profMapEntry
21 nextHash *profMapEntry // next in hash list
29 // Compute hash of (stk, tag).
41 for e := m.hash[h]; e != nil; last, e = e, e.nextHash {
53 e.nextHash = m.hash[h]
54 m.hash[h] = e
65 e.nextHash = m.hash[h]
77 if m.hash == nil {
78 m.hash = make(map[uintptr]*profMapEntry)
80 m.hash[h] =
    [all...]
  /libcore/ojluni/src/main/java/java/util/
Hashtable.java 35 * This class implements a hash table, which maps keys to values. Any
44 * <i>capacity</i> is the number of <i>buckets</i> in the hash table, and the
45 * <i>initial capacity</i> is simply the capacity at the time the hash table
46 * is created. Note that the hash table is <i>open</i>: in the case of a "hash
48 * sequentially. The <i>load factor</i> is a measure of how full the hash
135 * The hash table data.
140 * The total number of entries in the hash table.
337 int hash = key.hashCode(); local
338 int index = (hash & 0x7FFFFFFF) % tab.length
365 int hash = key.hashCode(); local
466 int hash = key.hashCode(); local
493 int hash = key.hashCode(); local
702 int hash = key.hashCode(); local
717 int hash = key.hashCode(); local
917 int hash = key.hashCode(); local
940 int hash = key.hashCode(); local
965 int hash = key.hashCode(); local
986 int hash = key.hashCode(); local
1005 int hash = key.hashCode(); local
1029 int hash = key.hashCode(); local
1058 int hash = key.hashCode(); local
1093 int hash = key.hashCode(); local
1231 int hash = key.hashCode(); local
1266 final int hash; field in class:Hashtable.HashtableEntry
    [all...]
  /external/syslinux/gpxe/src/crypto/
md5.c 106 static void md5_transform(u32 *hash, const u32 *in)
112 a = hash[0];
113 b = hash[1];
114 c = hash[2];
115 d = hash[3];
130 hash[0] += a;
131 hash[1] += b;
132 hash[2] += c;
133 hash[3] += d;
156 md5_transform(ctx->hash, ctx->block)
    [all...]
  /frameworks/base/libs/hwui/
TextDropShadowCache.cpp 32 hash_t ShadowText::hash() const { function in class:android::uirenderer::ShadowText
33 uint32_t hash = JenkinsHashMix(0, glyphCount); local
34 hash = JenkinsHashMix(hash, android::hash_type(radius));
35 hash = JenkinsHashMix(hash, android::hash_type(textSize));
36 hash = JenkinsHashMix(hash, android::hash_type(typeface));
37 hash = JenkinsHashMix(hash, flags)
    [all...]
  /art/openjdkjvmti/
ti_breakpoint.h 55 // Get the hash code of this breakpoint.
56 size_t hash() const;
87 template<> struct hash<openjdkjvmti::Breakpoint> { struct in namespace:std
89 return b.hash();
  /art/test/920-objects/
objects.cc 48 jint hash; local
50 jvmtiError result = jvmti_env->GetObjectHashCode(object, &hash);
59 return hash;
  /external/guava/guava/src/com/google/common/hash/
HashingOutputStream.java 15 package com.google.common.hash;
26 * An {@link OutputStream} that maintains a hash of the data written to it.
64 public HashCode hash() { method in class:HashingOutputStream
65 return hasher.hash();
  /external/libvpx/libvpx/third_party/libyuv/source/
compare_gcc.cc 92 uint32 hash; local
134 "=g"(hash) // %3
143 return hash;
  /external/libyuv/files/source/
compare_gcc.cc 92 uint32 hash; local
134 "=g"(hash) // %3
143 return hash;
  /external/robolectric/v1/src/test/java/com/xtremelabs/robolectric/shadows/
ShadowEditTextTest.java 19 HashMap<String, String> hash = new HashMap<String, String>(); local
20 hash.put("android:maxLength", "5");
21 TestAttributeSet attributeSet = new TestAttributeSet(hash);
  /external/tpm2/
_TPM_Hash_End.c 51 // Complete hash and extend PCR, or if this is an HCRTM, complete
52 // the hash, reset the H-CRTM register (PCR[0]) to 0...04, and then
56 TPMI_ALG_HASH hash = CryptGetHashAlgByIndex(i); local
61 // Complete hash
62 digest.t.size = CryptGetHashDigestSize(hash);
65 PcrDrtm(pcrHandle, hash, &digest);
  /frameworks/base/cmds/statsd/src/config/
ConfigKey.h 27 using std::hash;
75 * A hash function for ConfigKey so it can be used for unordered_map/set.
83 struct hash<ConfigKey> { struct in namespace:std
85 return (7 * key.GetUid()) ^ ((hash<long long>()(key.GetId())));
  /frameworks/ml/nn/runtime/test/generated/models/
lsh_projection_weights_as_inputs.model.cpp 9 auto hash = model->addOperand(&type0); local
17 model->addOperation(ANEURALNETWORKS_LSH_PROJECTION, {hash, lookup, weight, type_param}, {output});
20 {hash, lookup, weight},
lsh_projection_weights_as_inputs_relaxed.model.cpp 9 auto hash = model->addOperand(&type0); local
17 model->addOperation(ANEURALNETWORKS_LSH_PROJECTION, {hash, lookup, weight, type_param}, {output});
20 {hash, lookup, weight},
  /hardware/interfaces/tests/hash/1.0/default/
Hash.h 4 #include <android/hardware/tests/hash/1.0/IHash.h>
11 namespace hash { namespace in namespace:android::hardware::tests
15 using ::android::hardware::tests::hash::V1_0::IHash;
26 struct Hash : public IHash {
27 // Methods from ::android::hardware::tests::hash::V1_0::IHash follow.
38 } // namespace hash
  /toolchain/binutils/binutils-2.27/opcodes/
cgen-dis.c 53 /* Add an instruction to the hash chain. */
58 unsigned int hash)
69 for (current_buf = htable[hash]; current_buf != NULL;
82 htable[hash] = hentbuf;
87 /* Subroutine of build_dis_hash_table to add INSNS to the hash table.
92 HTABLE points to the hash table.
93 HENTBUF is a pointer to sufficiently large buffer of hash entries.
112 unsigned int hash; local
121 to hash on, so set both up. */
128 hash = (* cd->dis_hash) (buf, value)
150 unsigned int hash; local
232 unsigned int hash; local
    [all...]
  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/jcajce/provider/asymmetric/util/
DSABase.java 50 byte[] hash = new byte[digest.getDigestSize()];
52 digest.doFinal(hash, 0);
56 BigInteger[] sig = signer.generateSignature(hash);
70 byte[] hash = new byte[digest.getDigestSize()];
72 digest.doFinal(hash, 0);
85 return signer.verifySignature(hash, sig[0], sig[1]);

Completed in 641 milliseconds

1 2 3 4 5 6 78 91011>>