/external/chromium_org/third_party/WebKit/Source/platform/fonts/ |
H A D | WidthCache.h | 193 typedef HashMap<uint32_t, WidthCacheEntry, DefaultHash<uint32_t>::Hash, WTF::UnsignedWithZeroKeyHashTraits<uint32_t> > SingleCharMap;
|
/external/chromium_org/third_party/WebKit/Source/platform/weborigin/ |
H A D | KURL.h | 274 typedef blink::KURLHash Hash; typedef in struct:WTF::DefaultHash
|
/external/chromium_org/third_party/WebKit/Source/wtf/ |
H A D | HashSetTest.cpp | 45 HashSet<int, DefaultHash<int>::Hash, InitialCapacityTestHashTraits<initialCapacity> > testSet;
|
/external/chromium_org/third_party/skia/src/gpu/ |
H A D | GrResourceCache.h | 37 static uint32_t Hash(const GrResourceKey& key) { return key.getHash(); } function in class:GrResourceCacheEntry
|
/external/llvm/include/llvm/Support/ |
H A D | OnDiskHashTable.h | 1 //===--- OnDiskHashTable.h - On-Disk Hash Table Implementation --*- C++ -*-===// 65 const typename Info::hash_value_type Hash; member in class:llvm::OnDiskChainedHashTableGenerator::Item 69 : Key(Key), Data(Data), Next(nullptr), Hash(InfoObj.ComputeHash(Key)) {} 92 Bucket &B = Buckets[E->Hash & (Size - 1)]; 164 LE.write<typename Info::hash_value_type>(I->Hash);
|
/external/chromium_org/third_party/WebKit/Source/core/dom/ |
H A D | NodeListsNodeData.h | 85 return DefaultHash<StringImpl*>::Hash::hash(entry.second) + entry.first; 88 static const bool safeToCompareToEmptyOrDeleted = DefaultHash<StringImpl*>::Hash::safeToCompareToEmptyOrDeleted;
|
/external/chromium_org/third_party/sqlite/src/src/ |
H A D | callback.c | 266 FuncDefHash *pHash, /* Hash table to search */ 267 int h, /* Hash of the name */ 336 int h; /* Hash value */ 409 Hash temp1; 410 Hash temp2;
|
/external/llvm/lib/IR/ |
H A D | LLVMContextImpl.h | 201 if (X.Hash != IDHash) 209 return X.Hash; // Return cached hash.
|
/external/llvm/lib/Support/ |
H A D | FoldingSet.cpp | 1 //===-- Support/FoldingSet.cpp - Uniquing Hash Set --------------*- C++ -*-===// 206 /// GetBucketFor - Hash the specified node ID and return the hash bucket for 208 static void **GetBucketFor(unsigned Hash, void **Buckets, unsigned NumBuckets) { argument 210 unsigned BucketNum = Hash & (NumBuckets-1);
|
/external/openfst/src/include/fst/ |
H A D | tuple-weight.h | 108 size_t Hash() const { function in class:fst::TupleWeight 111 hash = 5 * hash + values_[i].Hash();
|
H A D | state-table.h | 155 using VectorHashBiTable<StateId, T, S, FP, H>::Hash; 249 t.filter_state.Hash() * kPrime1; 308 tuple.filter_state.Hash() * mult2_;
|
/external/clang/lib/CodeGen/ |
H A D | CodeGenPGO.cpp | 225 /// \brief Hash values for AST nodes. 271 PGOHash Hash; member in struct:__anon17861::MapRegionCounters 308 Hash.combine(Type); 746 assert(Type && "Hash is invalid: unexpected type 0"); 747 assert(unsigned(Type) < TooBig && "Hash is invalid: too many types"); 860 FunctionHash = Walker.Hash.finalize(); 920 uint64_t Hash; local 921 if (PGOReader->getFunctionCounts(getFuncName(), Hash, *RegionCounts)) { 924 } else if (Hash != FunctionHash ||
|
/external/llvm/lib/Target/AArch64/AsmParser/ |
H A D | AArch64AsmParser.cpp | 1985 bool Hash = Tok.is(AsmToken::Hash); local 1986 if (Hash || Tok.is(AsmToken::Integer)) { 1987 if (Hash) 2032 if (Parser.getTok().is(AsmToken::Hash)) { 2082 if (Parser.getTok().is(AsmToken::Hash)) { 2100 bool Hash = false; local 2101 if (Parser.getTok().is(AsmToken::Hash)) { 2103 Hash = true; 2150 if (!Hash) 2301 bool Hash = getLexer().is(AsmToken::Hash); local 2596 bool Hash = Tok.is(AsmToken::Hash); local [all...] |
/external/llvm/lib/MC/MCParser/ |
H A D | ELFAsmParser.cpp | 354 while (getLexer().is(AsmToken::Hash)) { 439 || getLexer().isNot(AsmToken::Hash)) 614 getLexer().isNot(AsmToken::Hash) && getLexer().isNot(AsmToken::At) &&
|
H A D | AsmLexer.cpp | 477 // If this comment starts with a '#', then return the Hash token and let 481 return AsmToken(AsmToken::Hash, StringRef(TokStart, 1)); 560 case '#': return AsmToken(AsmToken::Hash, StringRef(TokStart, 1));
|
/external/skia/src/core/ |
H A D | SkScaledImageCache.cpp | 119 static uint32_t Hash(const Key& key) { return key.fHash; } function in struct:SkScaledImageCache::Rec 140 class SkScaledImageCache::Hash : class in class:SkScaledImageCache 164 fHash = new Hash;
|
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/ |
H A D | task.rb | 50 options = Hash === grammar_files.last ? grammar_files.pop : {} 67 Hash === grammar_files.last ? grammar_files.pop : {}
|
/external/chromium_org/chrome/browser/favicon/ |
H A D | favicon_service.cc | 329 MissingFaviconURLHash url_hash = base::Hash(icon_url.spec()); 334 MissingFaviconURLHash url_hash = base::Hash(icon_url.spec());
|
/external/chromium_org/third_party/skia/src/core/ |
H A D | SkResourceCache.cpp | 34 class SkResourceCache::Hash : class in class:SkResourceCache 43 fHash = new Hash;
|
/external/chromium_org/v8/src/ |
H A D | ast-value-factory.cc | 66 virtual uint32_t Hash() OVERRIDE { 71 return String::cast(key)->Hash();
|
/external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/ |
H A D | Antlr.Runtime.Tools.pas | 257 function Hash(const Key: TKey): Integer; 631 function TDictionary<TKey,TValue>.Hash(const Key: TKey): Integer; 645 index := GetBucketIndex(Key, Hash(Key)); 656 index := GetBucketIndex(Key, Hash(Key)); 752 hc := Hash(Key); 772 hc := Hash(Key); 840 index := GetBucketIndex(Key, Hash(Key)); 871 Result := GetBucketIndex(Key, Hash(Key)) >= 0;
|
/external/chromium_org/net/disk_cache/blockfile/ |
H A D | storage_block-inl.h | 200 return base::Hash(reinterpret_cast<char*>(data_), offsetof(T, self_hash));
|
/external/chromium_org/ppapi/proxy/ |
H A D | interface_list.cc | 414 uint32 data = base::Hash(name.c_str(), name.size());
|
/external/chromium_org/sdch/open-vcdiff/src/ |
H A D | blockhash.cc | 221 // The Hash function extends (kBlockSize - 1) bytes past the index, 230 AddBlock(RollingHash<kBlockSize>::Hash(block_ptr));
|
/external/chromium_org/third_party/WebKit/Source/core/svg/ |
H A D | SVGElement.h | 264 return DefaultHash<QualifiedName>::Hash::hash(key);
|