| /external/libxml2/include/libxml/ |
| tree.h | 225 struct _xmlAttribute *nexth; /* next in hash table */
379 void *notations; /* Hash table for notations if any */
380 void *elements; /* Hash table for elements if any */
381 void *attributes; /* Hash table for attributes if any */
382 void *entities; /* Hash table for entities if any */
385 void *pentities; /* Hash table for param entities if any */
536 void *ids; /* Hash table for ID attributes if any */
537 void *refs; /* Hash table for IDREFs attributes if any */
[all...] |
| /external/openssl/crypto/dsa/ |
| dsa_depr.c | 64 #define HASH EVP_sha()
69 #define HASH EVP_sha1()
|
| /external/openssl/crypto/evp/ |
| names.c | 125 hash table, but not the hash table itself. The following line
|
| /external/openssl/crypto/rsa/ |
| rsa_x931.c | 73 * nibble and 2 trailer bytes: but 1 hash if is already in 'from'.
156 /* Translate between X931 hash ids and NIDs */
|
| /external/ppp/pppd/ |
| tdb.h | 83 u32 hash_size; /* number of hash entries */
96 u32 hash; member in struct:tdb_traverse_lock
|
| /external/qemu/ |
| alpha.ld | 11 .hash : { *(.hash) }
|
| arm.ld | 11 .hash : { *(.hash) }
|
| cpu-defs.h | 70 /* Only the bottom TB_JMP_PAGE_BITS of the jump cache hash bits vary for
72 TLB invalidation to quickly clear a subset of the hash table. */
|
| i386-vl.ld | 13 .hash : { *(.hash) }
|
| i386.ld | 13 .hash : { *(.hash) }
|
| sparc.ld | 11 .hash : { *(.hash) }
|
| /external/qemu/docs/ |
| CPU-EMULATION.TXT | 13 instruction pointer changes (i.e. at the end of TB execution), a hash
65 Each TLB is also implemented as a global per-emulated-CPU hash-table.
|
| /external/srec/tools/grxmlcompile/ |
| testhashmap.cpp | 39 // (INT,INT) hash
64 // (INT,STRING) hash
|
| /external/stlport/etc/ |
| ReleaseNote.txt | 72 if a < b && b < a. Same for equivalent functor used in hash container implementation,
125 * unordered_set, unordered_multiset, unordered_map, unordered_multimap hash
|
| /external/stlport/test/unit/ |
| unordered_test.cpp | 69 typedef unordered_set<int, hash<int>, equal_to<int> > usettype;
119 typedef unordered_multiset<int, hash<int>, equal_to<int> > usettype;
158 typedef unordered_map<int, int, hash<int>, equal_to<int> > umaptype;
227 typedef unordered_multimap<int, int, hash<int>, equal_to<int> > umaptype;
389 //We are going to add at least 20 values, to get a stable hash container while doing that
406 //Now we put some more elements until hash container is resized:
418 // Now we remove some elements until hash container is resized:
452 cout << "Hash container dump: Nb elems: " << hum.size() << ", Nb buckets: " << hum.bucket_count() << "\n";
|
| /external/webkit/WebCore/platform/cf/ |
| BinaryPropertyList.h | 54 // string will be written twice in the same property list; this saves hash
64 // returns, because these lists are put into a hash table without copying
|
| /external/webkit/WebKitTools/android/flex-2.5.4a/ |
| sym.c | 154 /* hashfunct - compute the hash value for "str" and hash size "hash_size" */
|
| /frameworks/base/awt/java/awt/ |
| Insets.java | 85 * Returns a hash code of the Insets object.
87 * @return a hash code of the Insets object.
|
| /frameworks/base/awt/java/awt/font/ |
| TextHitInfo.java | 136 * Returns the hash code value of this TextHitInfo instance.
138 * @return the hash code value.
|
| /packages/providers/ContactsProvider/src/com/android/providers/contacts/ |
| ContactLookupKey.java | 52 * Returns a short hash code that functions as an additional precaution against the exceedingly
119 // Parse account hash code
|
| /prebuilt/darwin-x86/toolchain/arm-eabi-4.2.1/arm-eabi/lib/ldscripts/ |
| armelf.xr | 14 .hash 0 : { *(.hash) }
|
| armelf.xu | 14 .hash 0 : { *(.hash) }
|
| /prebuilt/linux-x86/toolchain/arm-eabi-4.2.1/arm-eabi/lib/ldscripts/ |
| armelf.xr | 14 .hash 0 : { *(.hash) }
|
| armelf.xu | 14 .hash 0 : { *(.hash) }
|
| /prebuilt/linux-x86/toolchain/i686-unknown-linux-gnu-4.2.1/i686-unknown-linux-gnu/lib/ldscripts/ |
| elf_i386.xr | 14 .hash 0 : { *(.hash) }
|
