/external/v8/test/cctest/ |
test-heap.cc | 733 non_ascii_str->Hash(); 737 ascii_str->Hash();
|
/external/webkit/JavaScriptCore/runtime/ |
UString.h | 254 static unsigned hash(const RefPtr<JSC::UString::Rep>& key) { return key->existingHash(); } function in struct:JSC::IdentifierRepHash 255 static unsigned hash(JSC::UString::Rep* key) { return key->existingHash(); } function in struct:JSC::IdentifierRepHash 604 static unsigned hash(const JSC::UString::Rep* key) { return key->hash(); } function in struct:WTF::StrHash 610 using StrHash<JSC::UString::Rep*>::hash; 611 static unsigned hash(const RefPtr<JSC::UString::Rep>& key) { return key->hash(); } function in struct:WTF::StrHash 621 typedef StrHash<JSC::UString::Rep*> Hash; 625 typedef StrHash<RefPtr<JSC::UString::Rep> > Hash;
|
/external/webkit/SunSpider/tests/parse-only/ |
prototype-1.6.0.3.js | 183 return object instanceof Hash; 423 return match[1].split(separator || '&').inject({ }, function(hash, pair) { 429 if (key in hash) { 430 if (!Object.isArray(hash[key])) hash[key] = [hash[key]]; 431 hash[key].push(value); 433 else hash[key] = value; 435 return hash; 994 return new Hash(object) [all...] |
/external/srec/tools/thirdparty/OpenFst/fst/lib/ |
determinize.h | 265 // if the subset is not found in the subset hash. FindState takes 423 // Hash function for Subset to Fst states. Subset elements are not 424 // sorted in this implementation, so the hash must be invariant 429 size_t hash = 0; local 436 hash ^= element.state_id << lshift ^ 438 element.weight.Hash(); 440 return hash;
|
map.h | 834 return x.Hash();
|
/external/v8/src/ |
debug.h | 172 // Calculate the hash value from the key (script id). 173 static uint32_t Hash(int key) { return ComputeIntegerHash(key); }
|
serialize.cc | 471 const_cast<HashMap &>(encodings_).Lookup(key, Hash(key), false); 479 HashMap::Entry* entry = encodings_.Lookup(key, Hash(key), true); [all...] |
d8.cc | 351 int CounterMap::Hash(const char* name) {
|
heap.cc | 1701 int hash; local 1721 int hash; local [all...] |
objects-debug.cc | 1303 uint32_t hash = GetKey(i)->Hash(); local [all...] |
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...] |
objects-inl.h | [all...] |
/external/webkit/JavaScriptCore/wtf/ |
HashMap.h | 30 template<typename KeyArg, typename MappedArg, typename HashArg = typename DefaultHash<KeyArg>::Hash, 89 // static unsigned hash(const T&); 98 // static unsigned hash(const T&); 120 static unsigned hash(const KeyType& key) { return HashFunctions::hash(key); } function in struct:WTF::HashMapTranslator 134 static unsigned hash(const T& key) { return Translator::hash(key); } function in struct:WTF::HashMapTranslatorAdapter
|
ListHashSet.h | 54 template<typename ValueArg, typename HashArg = typename DefaultHash<ValueArg>::Hash> class ListHashSet : public FastAllocBase { 226 static unsigned hash(Node* const& key) { return HashArg::hash(key->m_value); } function in struct:WTF::ListHashSetNodeHashFunctions 350 static unsigned hash(const ValueType& key) { return HashFunctions::hash(key); } function in struct:WTF::ListHashSetTranslator
|
/external/chromium/net/disk_cache/ |
backend_impl.cc | 21 #include "net/disk_cache/hash.h" 359 uint32 hash = Hash(key); local 361 EntryImpl* cache_entry = MatchEntry(key, hash, false); 399 uint32 hash = Hash(key); local 402 Addr entry_address(data_->table[hash & mask_]); 405 // a hash conflict. 406 EntryImpl* old_entry = MatchEntry(key, hash, false); 410 EntryImpl* parent_entry = MatchEntry(key, hash, true) 757 uint32 hash = entry->GetHash(); local [all...] |
/external/webkit/WebCore/bindings/js/ |
SerializedScriptValue.cpp | 86 typedef HashMap<unsigned, SerializedScriptValueData, DefaultHash<unsigned>::Hash, WTF::UnsignedWithZeroKeyHashTraits<unsigned> > SparseMap;
|
/external/webkit/WebCore/html/ |
HTMLElement.cpp | 67 // the string on a hit in the hash. 89 typedef HashMap<AtomicStringImpl*, int, DefaultHash<AtomicStringImpl*>::Hash, HashTraits<AtomicStringImpl*>, Empty1IntHashTraits> TagPriorityMap; [all...] |
/external/sqlite/dist/ |
sqlite3.c | 628 ** hash of the entire source tree. 13289 u32 size, hash; local 13323 u32 size, hash; local 13501 int hash = nBlock % N_HASH; local 17776 Hash hash; \/* A set is just a hash table *\/ member in struct:Set 31978 u32 hash = 0; local [all...] |
sqlite3.c.orig | 628 ** hash of the entire source tree. [all...] |
/external/dropbear/libtomcrypt/ |
crypt.tex | 125 block cipher and hash function to ensure that they compile and execute to the published design specifications. The library 254 related issue is if you use the same symmetric cipher, hash or public key state data in multiple threads. Normally [all...] |
/external/blktrace/doc/ |
blktrace.tex | 491 -h & --hash-by-name & Hash processes by name, not by PID\\ \hline [all...] |
/external/webkit/SunSpider/tests/sunspider-0.9/ |
string-unpack-code.js | [all...] |
/external/webkit/SunSpider/tests/sunspider-0.9.1/ |
string-unpack-code.js | [all...] |