Searched refs:hash (Results 1 - 25 of 39) sorted by relevance

12

/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;
H A DIdentity.java319 * Returns the hash code value for this {@code Identity}. Returns the same
320 * hash code for {@code Identity}s that are equal to each other as required
323 * @return the hash code value for this {@code Identity}.
329 int hash = 0;
331 hash += name.hashCode();
334 hash += scope.hashCode();
336 return hash;
/libcore/luni/src/main/java/java/security/cert/
H A DCertPath.java98 * @return the hash code for this instance.
101 int hash = getType().hashCode();
102 hash = hash*31 + getCertificates().hashCode();
103 return hash;
H A DCertificate.java93 * Returns an integer hash code for the certificate. Any two objects which
97 * @return the certificate's hash
103 int hash = 0;
105 hash += i*encoded[i];
107 return hash;
/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/io/
H A DSerializationHandleMap.java126 int index, next, hash;
148 hash = getModuloHash(object, length);
149 hashedOk = hash > index;
151 hashedOk = hashedOk || (hash <= next);
153 hashedOk = hashedOk && (hash <= next);
/libcore/luni/src/main/java/libcore/reflect/
H A DAnnotationMember.java251 * Computes hash code of this element. The formula is as follows:
255 * @return the hash code
260 int hash = name.hashCode() * 127;
264 return hash ^ Arrays.hashCode((int[])value);
266 return hash ^ Arrays.hashCode((byte[])value);
268 return hash ^ Arrays.hashCode((short[])value);
270 return hash ^ Arrays.hashCode((long[])value);
272 return hash ^ Arrays.hashCode((char[])value);
274 return hash ^ Arrays.hashCode((boolean[])value);
276 return hash
[all...]
/libcore/luni/src/main/java/java/util/
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...]
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...]
/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/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/test/java/libcore/java/util/
H A DObjectsTest.java65 assertEquals(Arrays.hashCode(new Object[0]), Objects.hash());
66 assertEquals(31, Objects.hash((Object) null));
67 assertEquals(0, Objects.hash((Object[]) null));
68 assertEquals(-1107615551, Objects.hash("hello", "world"));
69 assertEquals(23656287, Objects.hash("hello", "world", null));
/libcore/luni/src/main/java/java/nio/
H A DDoubleBuffer.java294 * Calculates this buffer's hash code from the remaining chars. The
295 * position, limit, capacity and mark don't affect the hash code.
297 * @return the hash code calculated from the remaining chars.
302 int hash = 0;
306 hash = hash + ((int) l) ^ ((int) (l >> 32));
308 return hash;
H A DFloatBuffer.java295 * Calculates this buffer's hash code from the remaining chars. The
296 * position, limit, capacity and mark don't affect the hash code.
298 * @return the hash code calculated from the remaining floats.
303 int hash = 0;
305 hash = hash + Float.floatToIntBits(get(myPosition++));
307 return hash;
H A DIntBuffer.java281 * Calculates this buffer's hash code from the remaining chars. The
282 * position, limit, capacity and mark don't affect the hash code.
284 * @return the hash code calculated from the remaining ints.
289 int hash = 0;
291 hash = hash + get(myPosition++);
293 return hash;
H A DLongBuffer.java283 * Calculates this buffer's hash code from the remaining chars. The
284 * position, limit, capacity and mark don't affect the hash code.
286 * @return the hash code calculated from the remaining longs.
291 int hash = 0;
295 hash = hash + ((int) l) ^ ((int) (l >> 32));
297 return hash;
H A DShortBuffer.java284 * Calculates this buffer's hash code from the remaining chars. The
285 * position, limit, capacity and mark don't affect the hash code.
287 * @return the hash code calculated from the remaining shorts.
292 int hash = 0;
294 hash = hash + get(myPosition++);
296 return hash;
H A DByteBuffer.java593 * Calculates this buffer's hash code from the remaining chars. The
594 * position, limit, capacity and mark don't affect the hash code.
596 * @return the hash code calculated from the remaining bytes.
601 int hash = 0;
603 hash = hash + get(myPosition++);
605 return hash;
H A DCharBuffer.java340 * Calculates this buffer's hash code from the remaining chars. The
341 * position, limit, capacity and mark don't affect the hash code.
343 * @return the hash code calculated from the remaining chars.
348 int hash = 0;
350 hash = hash + get(myPosition++);
352 return hash;
/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/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;
/libcore/luni/src/main/java/java/net/
H A DURL.java98 * The cached hash code, or 0 if it hasn't been computed yet. Unlike the RI,
99 * this implementation's hashCode is transient because the hash code is
253 int hash = file.indexOf("#");
254 if (hash != -1) {
255 this.file = file.substring(0, hash);
256 this.ref = file.substring(hash + 1);

Completed in 1593 milliseconds

12