| /external/chromium_org/third_party/WebKit/Source/core/dom/ |
| DOMNamedFlowCollection.cpp | 77 static unsigned hash(PassRefPtr<NamedFlow> key) { return DefaultHash<String>::Hash::hash(key->name()); } function in struct:WebCore::DOMNamedFlowCollection::DOMNamedFlowHashFunctions
84 static unsigned hash(const String& key) { return DefaultHash<String>::Hash::hash(key); } function in struct:WebCore::DOMNamedFlowCollection::DOMNamedFlowHashTranslator
|
| CustomElementDescriptor.h | 94 typedef WebCore::CustomElementDescriptorHash Hash;
|
| NamedFlowCollection.cpp | 122 static unsigned hash(NamedFlow* key) { return DefaultHash<String>::Hash::hash(key->name()); } function in struct:WebCore::NamedFlowCollection::NamedFlowHashFunctions
129 static unsigned hash(const String& key) { return DefaultHash<String>::Hash::hash(key); } function in struct:WebCore::NamedFlowCollection::NamedFlowHashTranslator
|
| /external/chromium_org/third_party/WebKit/Source/core/platform/graphics/chromium/ |
| SkSizeHash.h | 37 static unsigned hash(const SkSize& key) { return pairIntHash(key.width(), key.height()); } function in struct:WTF::IntHash
43 typedef IntHash<SkSize> Hash;
61 static unsigned hash(const SkISize& key) { return pairIntHash(key.width(), key.height()); } function in struct:WTF::IntHash
67 typedef IntHash<SkISize> Hash;
|
| /external/chromium_org/third_party/WebKit/Source/wtf/tests/ |
| HashMap.cpp | 57 typedef HashMap<double, int64_t, DefaultHash<double>::Hash, TestDoubleHashTraits> DoubleHashMap;
61 return DefaultHash<double>::Hash::hash(key) & (TestDoubleHashTraits::minimumTableSize - 1);
|
| HashSet.cpp | 42 HashSet<int, DefaultHash<int>::Hash, InitialCapacityTestHashTraits<initialCapacity> > testSet;
|
| /external/chromium_org/third_party/skia/src/core/ |
| SkScaledImageCache.h | 97 class Hash;
98 Hash* fHash;
|
| /external/chromium_org/third_party/sqlite/src/src/ |
| hash.c | 12 ** This is the implementation of generic hash-tables
18 /* Turn bulk memory into a hash table object by initializing the
19 ** fields of the Hash structure.
21 ** "pNew" is a pointer to the hash table that is to be initialized.
23 void sqlite3HashInit(Hash *pNew){
31 /* Remove all entries from a hash table. Reclaim all memory.
32 ** Call this routine to delete a hash table or to reset a hash table
35 void sqlite3HashClear(Hash *pH){
66 /* Link pNew element into the hash table pH. If pEntry!=0 then als
[all...] |
| /external/skia/src/core/ |
| SkScaledImageCache.h | 97 class Hash;
98 Hash* fHash;
|
| /external/chromium_org/google_apis/cup/ |
| client_update_protocol.cc | 33 std::vector<uint8> Hash(const std::vector<uint8>& data) {
41 std::vector<uint8> Hash(const base::StringPiece& sdata) {
114 std::vector<uint8> digest = Hash(result);
210 // Compute the challenge hash:
211 // hw = HASH(HASH(v|w)|HASH(request_url)|HASH(body)).
212 // Keep the challenge hash for later to validate the server's response.
216 h = Hash(GetVersionedSecret())
[all...] |
| /external/chromium_org/v8/test/mjsunit/ |
| call-stub.js | 28 function Hash() {
36 Hash.prototype.m = function() {
40 var h = new Hash();
55 Hash.prototype.wwwww = Hash.prototype.m;
|
| /external/v8/test/mjsunit/ |
| call-stub.js | 28 function Hash() {
36 Hash.prototype.m = function() {
40 var h = new Hash();
55 Hash.prototype.wwwww = Hash.prototype.m;
|
| /external/llvm/lib/CodeGen/ |
| BranchFolding.h | 34 unsigned Hash;
38 : Hash(h), Block(b) {}
40 unsigned getHash() const { return Hash; }
|
| /external/chromium_org/chrome/common/metrics/ |
| metrics_log_base.cc | 37 // Converts the 8-byte prefix of an MD5 hash into a uint64 value.
38 inline uint64 HashToUInt64(const std::string& hash) {
40 DCHECK_GE(hash.size(), sizeof(value));
41 memcpy(&value, hash.data(), sizeof(value));
73 uma_proto_.set_client_id(Hash(client_id));
85 uint64 MetricsLogBase::Hash(const std::string& value) {
86 // Create an MD5 hash of the given |value|, represented as a byte buffer
96 uint64 hash = HashToUInt64(hash_str); local
100 // that happens, all we get to see (server side) is a hash of the histogram
104 DVLOG(1) << "Metrics: Hash numeric [" << value << "]=[" << hash << "]" local
[all...] |
| metrics_log_base.h | 36 // Computes the MD5 hash of the given string, and returns the first 8 bytes of
37 // the hash.
38 static uint64 Hash(const std::string& value);
|
| /external/chromium_org/third_party/sqlite/src/ext/fts1/ |
| ft_hash.c | 12 ** This is the implementation of generic hash-tables used in SQLite.
13 ** We've modified it slightly to serve as a standalone hash table
30 /* Turn bulk memory into a hash table object by initializing the
31 ** fields of the Hash structure.
33 ** "pNew" is a pointer to the hash table that is to be initialized.
36 ** determines what kind of key the hash table will use. "copyKey" is
37 ** true if the hash table should make its own private copy of keys and
42 void HashInit(Hash *pNew, int keyClass, int copyKey){
58 /* Remove all entries from a hash table. Reclaim all memory.
59 ** Call this routine to delete a hash table or to reset a hash tabl
[all...] |
| /external/chromium/chrome/browser/visitedlink/ |
| visitedlink_master.cc | 263 VisitedLinkMaster::Hash VisitedLinkMaster::TryToAddURL(const GURL& url) {
299 Hash index = TryToAddURL(url);
311 Hash index = TryToAddURL(*i);
326 // Clear the hash table.
383 VisitedLinkMaster::Hash VisitedLinkMaster::AddFingerprint(
391 Hash cur_hash = HashFingerprint(fingerprint);
392 Hash first_hash = cur_hash;
452 Hash deleted_hash = HashFingerprint(fingerprint);
454 // Find the range of "stuff" in the hash table that is adjacent to this
456 // the hash table. Since we use linear probing, anything after the delete
[all...] |
| /external/chromium_org/components/visitedlink/browser/ |
| visitedlink_master.cc | 249 VisitedLinkMaster::Hash VisitedLinkMaster::TryToAddURL(const GURL& url) {
294 Hash index = TryToAddURL(url);
308 Hash index = TryToAddURL(*i);
323 // Clear the hash table.
384 VisitedLinkMaster::Hash VisitedLinkMaster::AddFingerprint(
392 Hash cur_hash = HashFingerprint(fingerprint);
393 Hash first_hash = cur_hash;
453 Hash deleted_hash = HashFingerprint(fingerprint);
455 // Find the range of "stuff" in the hash table that is adjacent to this
457 // the hash table. Since we use linear probing, anything after the delete
[all...] |
| /development/tools/findunused/ |
| find_unused_resources.rb | 89 @@globalJavaIdUses = Hash.new
106 javaIdUses = Hash.new
107 layouts = Hash.new
108 strings = Hash.new
109 xmlIdUses = Hash.new
|
| /external/chromium_org/third_party/WebKit/Tools/Scripts/webkitruby/PrettyPatch/ |
| diff.rb | 30 @word_indices = Hash.new { |h, word| h[word] = [] }
108 match_length_at = Hash.new { |h, index| h[index] = 0 }
112 new_match_length_at = Hash.new { |h, index| h[index] = 0 }
|
| /external/chromium_org/third_party/leveldatabase/src/table/ |
| filter_block_test.cc | 9 #include "util/hash.h"
16 // For testing: emit an array with one hash value per key
25 uint32_t h = Hash(keys[i].data(), keys[i].size(), 1);
31 uint32_t h = Hash(key.data(), key.size(), 1);
|
| /external/chromium_org/v8/src/ |
| transitions.cc | 68 return key1->Hash() > key2->Hash();
|
| /frameworks/compile/mclinker/include/mcld/LD/ |
| BranchIsland.h | 123 struct Hash
128 hash::StringHash<hash::ELF> str_hasher;
154 Key::Hash,
|
| /external/chromium/sdch/open-vcdiff/src/ |
| rolling_hash_test.cc | 110 result_array[i] = hasher.Hash(&buffer[i]);
120 uint32_t running_hash = hasher.Hash(buffer);
144 uint32_t running_hash = hasher.Hash(buffer_);
146 // UpdateHash() calculates the hash value incrementally.
150 // Hash() calculates the hash value from scratch. Verify that both
151 // methods return the same hash value.
152 EXPECT_EQ(running_hash, hasher.Hash(&buffer_[i + 1 - kBlockSize]));
158 // Execution time is expected to be O(kBlockSize) per hash operation,
170 // Execution time is expected to be O(1) per hash operation
[all...] |
| /external/chromium_org/chrome/browser/policy/cloud/ |
| cloud_policy_store.cc | 7 #include "base/hash.h"
41 // Determine if the policy changed by comparing the new policy's hash value
45 new_hash_value = base::Hash(policy_->policy_value());
|
