| /dalvik/libcore/luni-kernel/src/main/java/java/lang/ |
| System.java | 509 * Returns an integer hash code for the parameter. The hash code returned is
512 * overridden hashCode(). The hash code for {@code null} is {@code 0}.
515 * the object to calculate the hash code.
516 * @return the hash code for the given object.
|
| Object.java | 170 * Returns an integer hash code for this object. By contract, any two
172 * the same hash code value. This means that subclasses of {@code Object}
175 * @return this object's hash code.
|
| /dalvik/libcore/security/src/test/java/org/apache/harmony/security/tests/java/security/ |
| MessageDigest2Test.java | 109 assertTrue("cloned hash differs from original for algorithm "
183 byte[] hash = sha.digest(data);
184 assertTrue("SHA_DATA_2 NOT ok", Arrays.equals(hash, SHA_DATA_2));
233 byte[] hash = sha.digest(data);
234 assertTrue("SHA_DATA_1 NOT ok", Arrays.equals(hash, SHA_DATA_1));
|
| /dalvik/libcore/text/src/test/java/org/apache/harmony/text/tests/java/text/ |
| StringCharacterIteratorTest.java | 591 assertTrue("Hash is equal", it1.hashCode() != it2.hashCode());
594 assertTrue("Hash equal1", it1.hashCode() != it3.hashCode());
596 assertTrue("Hash equal2", it1.hashCode() != it3.hashCode());
598 assertTrue("Hash equal3", it1.hashCode() != it3.hashCode());
600 assertTrue("Hash equal4", it1.hashCode() != it3.hashCode());
|
| /dalvik/libcore/x-net/src/main/java/org/apache/harmony/xnet/provider/jsse/ |
| ServerHandshakeImpl.java | 510 byte[] hash = null;
605 hash = ds.sign();
615 rsakey.getPublicExponent(), null, hash);
618 g, dhkeySpec.getY(), hash);
675 // find sesssion in the session hash
|
| /dalvik/libcore/xml/src/main/java/javax/xml/namespace/ |
| QName.java | 49 * QName.hashCode()}. Equality and the hash code are defined using
338 * <p>Generate the hash code for this <code>QName</code>.</p>
340 * <p>The hash code is calculated using both the Namespace URI and
342 * <strong><em>NOT</em></strong> used to calculate the hash
348 * @return hash code for this <code>QName</code> <code>Object</code>
|
| /dalvik/vm/compiler/ |
| Frontend.c | 208 CompilerMethodStats dummyMethodEntry; // For hash table lookup
209 CompilerMethodStats *realMethodEntry; // For hash table storage
224 * First time to compile this method - set up a new entry in the hash table
384 * partial signature stored in the hash table.
387 * full and partial signature stored in the hash table.
|
| /external/clearsilver/util/ |
| neo_hdf.h | 63 /* the following HASH is used when we reach more than FORCE_HASH_AT
65 NE_HASH *hash; member in struct:_hdf
66 /* When using the HASH, we need to know where to append new children */
313 * If a list of nodes exceeds FORCE_HASH_AT, then a HASH
315 * be added to the hash for faster lookup times.
|
| /external/guava/javadoc/com/google/common/base/ |
| Objects.html | 158 Generates a hash code for multiple values.</TD>
222 <DD>Generates a hash code for multiple values. The hash code is generated by
233 <b>Warning</b>: When a single object is supplied, the returned hash code
234 does not equal the hash code of that object.
|
| /external/icu4c/i18n/ |
| bmsearch.cpp | 27 #include "hash.h"
423 static int32_t hash(uint32_t ce);
479 badCharacterTable[hash(patternCEs[p])] = minLengthCache[p + 1];
492 return badCharacterTable[hash(ce)];
505 int32_t BadCharacterTable::hash(uint32_t ce) function in class:BadCharacterTable
|
| dtitvinf.cpp | 27 #include "hash.h"
30 #include "hash.h"
572 * set hash table value comparator
|
| /external/iproute2/lib/ |
| utils.c | 554 unsigned hash; local
565 hash = *(__u32 *)(addr + len - 4) % NHASH;
567 for (n = nht[hash]; n; n = n->next) {
579 n->next = nht[hash];
580 nht[hash] = n;
|
| /external/ipsec-tools/src/racoon/ |
| gssapi.c | 538 if (gssapi_vm2gssbuf(iph1->hash, hash_in) < 0) {
546 gssapi_error(min_stat, LOCATION, "wrapping hash value\n");
554 plog(LLV_DEBUG, LOCATION, NULL, "wrapped HASH, ilen %zu olen %zu\n",
596 plog(LLV_DEBUG, LOCATION, NULL, "unwrapping HASH of len %zu\n",
602 gssapi_error(min_stat, LOCATION, "unwrapping hash value\n");
|
| isakmp.h | 84 #define ISAKMP_NPTYPE_HASH 8 /* Hash */
292 /* 3.11 Hash Payload */
295 /* Hash Data */
|
| /external/iptables/libiptc/ |
| linux_list.h | 504 * Mostly useful for hash tables where the two pointer list head is
549 * hlist_del_rcu - deletes entry from hash list without re-initialization
550 * @n: the element to delete from the hash list.
557 * pointers that may still be used for walking the hash list.
597 * @n: the element to add to the hash list.
|
| /external/v8/src/ |
| scopeinfo.cc | 535 int ContextSlotCache::Hash(Code* code, String* name) {
539 return static_cast<int>((addr_hash ^ name->Hash()) % kLength);
546 int index = Hash(code, name);
564 int index = Hash(code, symbol);
596 int index = Hash(code, name);
|
| /frameworks/base/tools/preload/ |
| sorttable.js | 380 // create a hash table of event types for the element
382 // create a hash table of event handlers for each element/event pair
391 // store the event handler in the hash table
404 // delete the event handler from the hash table
415 // get a reference to the hash table of event handlers
|
| /system/vold/ |
| VolumeManager.cpp | 72 SLOGE("Target hash buffer size < %d bytes (%d)", MD5_ASCII_LENGTH, len);
259 SLOGE("Hash of '%s' failed (%s)", id, strerror(errno));
384 SLOGE("Hash of '%s' failed (%s)", id, strerror(errno));
459 SLOGE("Hash of '%s' failed (%s)", id, strerror(errno));
585 SLOGE("Hash of '%s' failed (%s)", id, strerror(errno));
|
| /dalvik/libcore/math/src/test/java/tests/api/java/math/ |
| BigDecimalTest.java | 486 BigDecimal hash = new BigDecimal("1.00"); local
489 hash.hashCode() != hash2.hashCode() && !hash.equals(hash2));
492 hash.hashCode() != hash2.hashCode() && !hash.equals(hash2));
495 assertTrue("hashCode of 1.00 and 1.00(bigInteger) is not equal", hash
497 && hash.equals(hash2));
498 hash = new BigDecimal(value, 2);
500 assertTrue("hashCode of 123459.08 and -1233456.0000 is not equal", hash
502 && !hash.equals(hash2))
[all...] |
| /dalvik/libcore/security/src/main/java/org/bouncycastle/jce/ |
| PKCS7SignedData.java | 291 throw new NoSuchAlgorithmException("Unknown Hash Algorithm "+hashAlgorithm);
489 // Create the set of Hash algorithms. I've assumed this is the
490 // set of all hash agorithms used to created the digest in the
|
| /dalvik/vm/ |
| IndirectRefTable.h | 72 * For example, if objects don't move, we can use a hash of the original
75 * secondary check on the preserved hash value; this implies that creating
76 * a global/local ref queries the hash value and forces it to be saved.)
|
| /external/bison/build-aux/ |
| Makefile | 50 $(top_srcdir)/m4/hash.m4 $(top_srcdir)/m4/iconv.m4 \
124 LIBOBJS = dirname$U.o exitfail$U.o hard-locale$U.o hash$U.o quote$U.o quotearg$U.o fopen-safer$U.o dup-safer$U.o fd-safer$U.o pipe-safer$U.o xmalloc$U.o
128 LTLIBOBJS = dirname$U.lo exitfail$U.lo hard-locale$U.lo hash$U.lo quote$U.lo quotearg$U.lo fopen-safer$U.lo dup-safer$U.lo fd-safer$U.lo pipe-safer$U.lo xmalloc$U.lo
|
| /external/guava/src/com/google/common/collect/ |
| ImmutableMap.java | 31 * An immutable, hash-based {@link Map} with reliable user-specified iteration
338 // not caching hash code since it could change if map values are mutable
339 // in a way that modifies their hash codes
|
| /external/icu4c/test/intltest/ |
| g7coll.cpp | 72 /* new table collation with rules "& Question-mark ; ? & Hash-mark ; # & Ampersand ; '&' " loop to TOTALTESTSET */
228 logln("Demo Test 3 : Create a new table collation with rules \"& Question'-'mark ; '?' & Hash'-'mark ; '#' & Ampersand ; '&'\"");
237 UnicodeString newRules = "& Question'-'mark ; '?' & Hash'-'mark ; '#' & Ampersand ; '&'";
|
| /external/kernel-headers/original/linux/ |
| ext2_fs.h | 189 #define EXT2_INDEX_FL 0x00001000 /* hash-indexed directory */
404 __u32 s_hash_seed[4]; /* HTREE hash seed */
405 __u8 s_def_hash_version; /* Default hash version to use */
|
