Searched defs:hash (Results 1 - 17 of 17) sorted by relevance

/libcore/luni/src/main/java/java/security/
H A DCodeSigner.java34 // Cached hash code value
35 private transient int hash; field in class:CodeSigner
104 * Returns the hash code value for this {@code CodeSigner}. Returns the same
105 * hash code for {@code CodeSigner}s that are equal to each other as
108 * @return the hash code value for this {@code CodeSigner}.
114 if (hash == 0) {
115 hash = signerCertPath.hashCode()
118 return hash;
H A DTimestamp.java36 // Cached hash
37 private transient int hash; field in class:Timestamp
109 * Returns the hash code value for this {@code Timestamp}. Returns the same
110 * hash code for {@code Timestamp}s that are equal to each other as
113 * @return the hash code value for this {@code Timestamp}.
119 if (hash == 0) {
120 hash = timestamp.hashCode() ^ signerCertPath.hashCode();
122 return hash;
/libcore/luni/src/main/java/java/security/spec/
H A DEllipticCurve.java42 private volatile int hash; field in class:EllipticCurve
189 // hash init is delayed
190 if (hash == 0) {
202 hash = hash0;
204 return hash;
/libcore/luni/src/main/java/java/util/
H A DObjects.java79 * This can be used to compute a hash code for an object's fields as follows:
80 * {@code Objects.hash(a, b, c)}.
82 public static int hash(Object... values) { method in class:Objects
H A DUUID.java55 private transient int hash; field in class:UUID
78 // setup hash field
81 hash = msbHash ^ lsbHash;
155 private static UUID makeUuid(byte[] hash, int version) { argument
156 long msb = Memory.peekLong(hash, 0, ByteOrder.BIG_ENDIAN);
157 long lsb = Memory.peekLong(hash, 8, ByteOrder.BIG_ENDIAN);
371 * Returns a hash value for this UUID that is consistent with the
378 return hash;
H A DLinkedHashMap.java105 * the initial capacity of this hash map.
154 LinkedEntry(K key, V value, int hash, HashMapEntry<K, V> next, argument
156 super(key, value, hash, next);
177 * to the hash table (which is properly the province of our superclass).
182 * the resulting hash table corrupt.
184 @Override void addNewEntry(K key, V value, int hash, int index) { argument
196 key, value, hash, table[index], header, oldTail);
220 K key, V value, int hash, HashMapEntry<K, V> next) {
224 = new LinkedEntry<K,V>(key, value, hash, next, header, oldTail);
250 int hash
219 constructorNewEntry( K key, V value, int hash, HashMapEntry<K, V> next) argument
[all...]
H A DWeakHashMap.java58 final int hash; field in class:WeakHashMap.Entry
73 hash = isNull ? 0 : Collections.secondaryHash(key);
106 return hash + (value == null ? 0 : value.hashCode());
557 int index = (toRemove.hash & 0x7FFFFFFF) % elementData.length;
630 int index = entry.isNull ? 0 : (entry.hash & 0x7FFFFFFF)
H A DHashMap.java87 * The hash table. If this hash map contains a mapping for null, it is
88 * not represented this hash table.
98 * The number of mappings in this hash map.
134 * the initial capacity of this hash map.
166 * the initial capacity of this hash map.
300 int hash = Collections.secondaryHash(key);
302 for (HashMapEntry<K, V> e = tab[hash & (tab.length - 1)];
305 if (eKey == key || (e.hash == hash
470 addNewEntry(K key, V value, int hash, int index) argument
488 constructorNewEntry( K key, V value, int hash, HashMapEntry<K, V> first) argument
721 final int hash; field in class:HashMap.HashMapEntry
724 HashMapEntry(K key, V value, int hash, HashMapEntry<K, V> next) argument
[all...]
H A DHashtable.java72 * The hash table.
77 * The number of mappings in this hash map.
265 int hash = Collections.secondaryHash(key);
267 for (HashtableEntry<K, V> e = tab[hash & (tab.length - 1)];
270 if (eKey == key || (e.hash == hash && key.equals(eKey))) {
289 int hash = Collections.secondaryHash(key);
291 for (HashtableEntry<K, V> e = tab[hash & (tab.length - 1)];
294 if (eKey == key || (e.hash == hash
662 final int hash; field in class:Hashtable.HashtableEntry
665 HashtableEntry(K key, V value, int hash, HashtableEntry<K, V> next) argument
[all...]
/libcore/luni/src/main/java/org/apache/harmony/security/utils/
H A DObjectIdentifier.java45 //hash code
46 private int hash = -1; field in class:ObjectIdentifier
175 if (hash == -1) {
176 hash = hashIntArray(oid);
178 return hash;
206 * Returns hash code for array of integers
/libcore/luni/src/main/java/java/lang/
H A DThreadLocal.java57 int index = hash & values.mask;
132 * Internal hash. We deliberately don't bother with #hashCode().
134 * (hash & (table.length - 1)) points to a key and not a value.
139 private final int hash = hashCounter.getAndAdd(0x61c88647 * 2); field in class:ThreadLocal
366 for (int index = key.hash & mask;; index = next(index)) {
387 for (int index = key.hash & mask;; index = next(index)) {
426 int index = key.hash & mask;
507 for (int index = key.hash & mask;; index = next(index)) {
/libcore/luni/src/main/java/java/util/jar/
H A DJarVerifier.java78 * Stores and a hash and a message digest and verifies that massage digest
79 * matches the hash.
87 private final byte[] hash; field in class:JarVerifier.VerifierEntry
93 VerifierEntry(String name, MessageDigest digest, byte[] hash, argument
97 this.hash = hash;
131 if (!MessageDigest.isEqual(d, Base64.decode(hash))) {
164 * which contains the certificates used to sign the entry and its hash value
210 final String hash = attributes.getValue(algorithm + "-Digest");
211 if (hash
[all...]
/libcore/luni/src/main/java/java/util/concurrent/
H A DExchanger.java178 * tried) to use randomized, prime-value-stepped, or double-hash
283 int hash; // Pseudo-random for spins field in class:Exchanger.Node
350 for (int h = p.hash, spins = SPINS;;) {
355 p.hash = h;
360 if (h == 0) // initialize hash
383 p.hash = h;
456 int h = p.hash;
486 p.hash = h;
H A DConcurrentHashMap.java35 * A hash table supporting full concurrency of retrievals and
56 * the hash table at some point at or since the creation of the
68 * collisions (i.e., keys that have distinct hash codes but fall into
74 * hash tables. However, resizing this or any other kind of hash
86 * hash table. To ameliorate impact, when keys are {@link Comparable},
110 * The primary design goal of this hash table is to maintain
117 * This map usually acts as a binned (bucketed) hash table. Each
119 * of the basic Node class with hash, key, value, and next
128 * because they have negative hash field
457 final int hash; field in class:ConcurrentHashMap.Node
462 Node(int hash, K key, V val, Node<K,V> next) argument
1920 TreeNode(int hash, K key, V val, Node<K,V> next, TreeNode<K,V> parent) argument
[all...]
/libcore/luni/src/main/java/java/net/
H A DURI.java194 private transient int hash = -1; field in class:URI
1043 if (hash == -1) {
1044 hash = getHashString().hashCode();
1046 return hash;
/libcore/luni/src/main/native/
H A Dorg_apache_harmony_xml_ExpatParser.cpp56 int hash; member in struct:InternedString
230 * Calculates a hash code for a null-terminated string. This is *not* equivalent
234 * @param s null-terminated string to hash
235 * @returns hash code
238 int hash = 0; local
241 hash = hash * 31 + *s++;
244 return hash;
252 * @param hash of bytes
255 static InternedString* newInternedString(JNIEnv* env, const char* bytes, int hash) { argument
349 findInternedString(InternedString** bucket, const char* s, int hash) argument
367 int hash = hashString(s); local
[all...]
/libcore/benchmarks/libs/
H A Dcaliper.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/caliper/ com/google/caliper/AllocationMeasurer ...

Completed in 1144 milliseconds