| /external/e2fsprogs/po/ |
| nl.po | [all...] |
| sv.po | [all...] |
| /external/elfutils/src/ |
| ldgeneric.c | 999 /* Add to the hash table and possibly overwrite existing value. */
[all...] |
| /bionic/linker/ |
| linker.c | 394 static Elf32_Sym *_elf_lookup(soinfo *si, unsigned hash, const char *name)
402 name, si->name, si->base, hash, hash % si->nbucket);
403 n = hash % si->nbucket;
405 for(n = si->bucket[hash % si->nbucket]; n != 0; n = si->chain[n]){
[all...] |
| /dalvik/libcore/luni/src/main/java/java/lang/ |
| String.java | 1024 int hash = hashCode; local
[all...] |
| /external/bluetooth/glib/ |
| ChangeLog.pre-2-16 | 807 * glib/ghash.[hc]: Add hash table iterators. (#500507,
810 * tests/hash-test.c: Test iterators.
922 the hash table in g_hash_table_unref.
[all...] |
| /external/bluetooth/glib/glib/ |
| gutils.c | 1226 * our own parallel array or hash table.
[all...] |
| /external/guava/javadoc/com/google/common/collect/ |
| HashMultimap.html | 107 Implementation of <A HREF="../../../../com/google/common/collect/Multimap.html" title="interface in com.google.common.collect"><CODE>Multimap</CODE></A> using hash tables.
262 Returns the hash code for this multimap.</TD>
[all...] |
| ForwardingMultiset.html | 226 Returns the hash code for this multiset.</TD>
[all...] |
| MapMaker.html | 122 The returned map is implemented as a hash table with similar performance
333 any other kind of hash table is a relatively slow operation, so,
355 contention. Because placement in hash tables is essentially random,
[all...] |
| /external/icu4c/test/intltest/ |
| apicoll.cpp | 498 doAssert(col1->hashCode() != col2->hashCode(), "Hash test1 result incorrect" );
499 doAssert(!(col1->hashCode() == col2->hashCode()), "Hash test2 result incorrect" );
500 doAssert(col1->hashCode() == col3->hashCode(), "Hash result not equal" );
516 doAssert(sortk1.hashCode() != sortk2.hashCode(), "Hash test1 result incorrect");
517 doAssert(sortk2.hashCode() == sortk3.hashCode(), "Hash result not equal" );
[all...] |
| /external/iproute2/misc/ |
| ss.c | 535 int hash = (port^(((unsigned long)dg_proto)>>2))&255; local
537 for (c = &cache[hash]; c; c = c->next) {
550 c = &cache[hash];
559 c->next = cache[hash].next;
560 cache[hash].next = c;
[all...] |
| /external/v8/src/ |
| debug.cc | 559 // Create an entry in the hash map for the script.
562 HashMap::Lookup(reinterpret_cast<void*>(id), Hash(id), true);
569 // global handle as the value in the hash map.
609 // Clear the content of the hash map.
623 script_cache->Remove(reinterpret_cast<void*>(id), Hash(id));
[all...] |
| /external/webkit/WebKitTools/Scripts/ |
| run-webkit-tests | 602 # Try to read expected hash file for pixel tests
611 # Format expected hash into a suffix string that is appended to the path / URL passed to DRT
743 printFailureMessageForTest($test, "WARNING: actual pixel hash is missing!");
745 printFailureMessageForTest($test, "WARNING: expected pixel hash is missing!");
780 printFailureMessageForTest($test, "pixel hash failed (but pixel test still passes)");
[all...] |
| /dalvik/libcore/math/src/main/java/java/math/ |
| BigInteger.java | 173 /** Cache for the hash code. */
[all...] |
| /external/bluetooth/bluez/lib/ |
| hci.c | [all...] |
| /external/guava/javadoc/com/google/common/primitives/ |
| Chars.html | 214 Returns a hash code for <code>value</code>; equal to the result of invoking
357 <DD>Returns a hash code for <code>value</code>; equal to the result of invoking
362 <DT><B>Returns:</B><DD>a hash code for the value</DL>
[all...] |
| Floats.html | 179 Returns a hash code for <code>value</code>; equal to the result of invoking
286 <DD>Returns a hash code for <code>value</code>; equal to the result of invoking
291 <DT><B>Returns:</B><DD>a hash code for the value</DL>
[all...] |
| Ints.html | 214 Returns a hash code for <code>value</code>; equal to the result of invoking
357 <DD>Returns a hash code for <code>value</code>; equal to the result of invoking
362 <DT><B>Returns:</B><DD>a hash code for the value</DL>
[all...] |
| Longs.html | 206 Returns a hash code for <code>value</code>; equal to the result of invoking
341 <DD>Returns a hash code for <code>value</code>; equal to the result of invoking
346 <DT><B>Returns:</B><DD>a hash code for the value</DL>
[all...] |
| Shorts.html | 214 Returns a hash code for <code>value</code>; equal to the result of invoking
357 <DD>Returns a hash code for <code>value</code>; equal to the result of invoking
362 <DT><B>Returns:</B><DD>a hash code for the value</DL>
[all...] |
| /external/icu4c/common/ |
| rbbiscan.cpp | 659 // Maintain a hash table of uset nodes, so the same one is always used
662 // add the provided set to the hash table.
718 // Add the new set to the set hash table.
[all...] |
| /external/ipsec-tools/src/racoon/ |
| cfparse.y | [all...] |
| /external/libxml2/ |
| relaxng.c | 26 #include <libxml/hash.h>
165 xmlRelaxNGDefinePtr nextHash; /* next define in defs/refs hash tables */
286 xmlHashTablePtr triage; /* hash table used to direct nodes to the
[all...] |
| /external/stlport/stlport/stl/ |
| _rope.h | 2325 _STLP_TEMPLATE_NULL struct hash<crope> { struct
2335 _STLP_TEMPLATE_NULL struct hash<wrope> { struct
[all...] |
