/external/guava/guava-testlib/src/com/google/common/collect/testing/google/ |
H A D | BiMapGenerators.java | 29 import java.util.Map.Entry; 70 @Override public Set<Entry<String, String>> createFromEntries( argument 71 Entry<String, String>[] entries) { 73 for (Entry<String, String> entry : entries) { 109 @Override public Set<Entry<String, String>> createFromEntries( argument 110 Entry<String, String>[] entries) { 112 for (Entry<String, String> entry : entries) {
|
H A D | MapGenerators.java | 34 import java.util.Map.Entry; 106 @Override public Set<Entry<String, String>> createFromEntries( argument 107 Entry<String, String>[] entries) { 109 for (Entry<String, String> entry : entries) {
|
H A D | SortedMapGenerators.java | 33 import java.util.Map.Entry; 47 public static final Comparator<Entry<String, String>> ENTRY_COMPARATOR 48 = new Comparator<Entry<String, String>>() { 51 Entry<String, String> o1, Entry<String, String> o2) { 107 @Override public Set<Entry<String, String>> createFromEntries( argument 108 Entry<String, String>[] entries) { 112 for (Entry<String, String> entry : entries) { 119 @Override public List<Entry<String, String>> order( 120 List<Entry<Strin 179 createFromEntries( Entry<String, String>[] entries) argument [all...] |
/external/lldb/source/DataFormatters/ |
H A D | FormatCache.cpp | 24 FormatCache::Entry::Entry () : function in class:FormatCache::Entry 31 FormatCache::Entry::Entry (const Entry& rhs) : function in class:FormatCache::Entry 38 FormatCache::Entry::Entry (lldb::TypeSummaryImplSP summary_sp) : function in class:FormatCache::Entry 45 FormatCache::Entry::Entry (lldb::SyntheticChildrenSP synthetic_sp) : function in class:FormatCache::Entry 52 FormatCache::Entry function in class:FormatCache::Entry [all...] |
/external/lldb/source/Plugins/SymbolFile/DWARF/ |
H A D | DWARFDeclContext.h | 33 struct Entry struct in class:DWARFDeclContext 35 Entry () : function in struct:DWARFDeclContext::Entry 40 Entry (dw_tag_t t, const char *n) : function in struct:DWARFDeclContext::Entry 47 NameMatches (const Entry& rhs) const 74 m_entries.push_back(Entry(tag, name)); 86 Entry & 93 const Entry & 104 typedef std::vector<Entry> collection;
|
/external/llvm/include/llvm/ADT/ |
H A D | UniqueVector.h | 41 unsigned insert(const T &Entry) { argument 43 unsigned &Val = Map[Entry]; 52 Vector.push_back(Entry); 58 unsigned idFor(const T &Entry) const { 60 typename std::map<T, unsigned>::const_iterator MI = Map.find(Entry);
|
/external/llvm/lib/DebugInfo/ |
H A D | DWARFDebugLoc.h | 23 struct Entry { struct in class:llvm::DWARFDebugLoc 38 SmallVector<Entry, 2> Entries; 60 struct Entry { struct in class:llvm::DWARFDebugLocDWO 68 SmallVector<Entry, 2> Entries;
|
/external/llvm/lib/Support/ |
H A D | PrettyStackTrace.cpp | 33 static unsigned PrintStack(const PrettyStackTraceEntry *Entry, raw_ostream &OS){ argument 35 if (Entry->getNextEntry()) 36 NextID = PrintStack(Entry->getNextEntry(), OS); 40 Entry->print(OS);
|
/external/skia/src/core/ |
H A D | SkQuadTree.h | 76 struct Entry { struct in class:SkQuadTree 77 Entry() : fData(NULL) {} function in struct:SkQuadTree::Entry 80 SK_DECLARE_INTERNAL_SLIST_INTERFACE(Entry); 91 SkTInternalSList<Entry> fEntries; 98 SkTObjectPool<Entry> fEntryPool; 102 SkTInternalSList<Entry> fDeferred; 104 void insert(Node* node, Entry* entry);
|
/external/skia/tests/ |
H A D | DynamicHashTest.cpp | 13 struct Entry { struct in namespace:__anon30785 17 static const int& GetKey(const Entry& entry) { return entry.key; } 22 class Hash : public SkTDynamicHash<Entry, int> { 31 typedef SkTDynamicHash<Entry, int> INHERITED; 39 Entry a = { 1, 2.0 }; 40 Entry b = { 2, 3.0 }; 41 Entry c = { 3, 4.0 }; 42 Entry d = { 4, 5.0 }; 43 Entry e = { 5, 6.0 }; 68 Entry [all...] |
/external/chromium_org/chrome/browser/sessions/ |
H A D | tab_restore_service.h | 56 struct Entry { struct in class:TabRestoreService 57 Entry(); 58 explicit Entry(Type type); 59 virtual ~Entry(); 78 struct Tab : public Entry { 111 struct Window : public Entry { 125 typedef std::list<Entry*> Entries;
|
/external/chromium_org/chrome/browser/ui/views/toolbar/ |
H A D | wrench_menu.h | 116 typedef std::pair<ui::MenuModel*,int> Entry; typedef in class:WrenchMenu 117 typedef std::map<int,Entry> CommandIDToEntry;
|
/external/chromium_org/net/http/ |
H A D | http_auth_cache.h | 22 // HttpAuthCache::Entry, which holds: 30 class NET_EXPORT_PRIVATE Entry { class in class:net::HttpAuthCache 32 ~Entry(); 71 Entry(); 123 Entry* Lookup(const GURL& origin, 134 Entry* LookupByPath(const GURL& origin, const std::string& path); 147 Entry* Add(const GURL& origin, 183 typedef std::list<Entry> EntryList;
|
/external/chromium_org/third_party/WebKit/Source/web/ |
H A D | ContextFeaturesClientImpl.cpp | 45 class Entry { class in class:blink::FINAL 53 Entry() function in class:blink::FINAL::Entry 83 Entry& entryFor(ContextFeatures::FeatureType type) 94 Entry m_entries[ContextFeatures::FeatureTypeSize]; 120 m_entries[i] = Entry(); 126 ContextFeaturesCache::Entry& cache = ContextFeaturesCache::from(*document).entryFor(type);
|
/external/chromium_org/third_party/skia/tests/ |
H A D | DynamicHashTest.cpp | 13 struct Entry { struct in namespace:__anon15378 17 static const int& GetKey(const Entry& entry) { return entry.key; } 22 class Hash : public SkTDynamicHash<Entry, int> { 31 typedef SkTDynamicHash<Entry, int> INHERITED; 39 Entry a = { 1, 2.0 }; 40 Entry b = { 2, 3.0 }; 41 Entry c = { 3, 4.0 }; 42 Entry d = { 4, 5.0 }; 43 Entry e = { 5, 6.0 }; 68 Entry [all...] |
/external/dexmaker/src/dx/java/com/android/dx/dex/code/ |
H A D | CatchHandlerList.java | 48 public Entry get(int n) { 49 return (Entry) get0(n); 75 Entry entry = get(i); 110 Entry last = get(size - 1); 122 set0(n, new Entry(exceptionType, handler)); 131 public void set(int n, Entry entry) { 147 Entry thisEntry = get(i); 148 Entry otherEntry = other.get(i); 165 * Entry in the list. 167 public static class Entry implement class in class:CatchHandlerList 180 public Entry(CstType exceptionType, int handler) { method in class:CatchHandlerList.Entry [all...] |
H A D | CatchTable.java | 49 public Entry get(int n) { 50 return (Entry) get0(n); 59 public void set(int n, Entry entry) { 75 Entry thisEntry = get(i); 76 Entry otherEntry = other.get(i); 93 * Entry in a catch list. 95 public static class Entry implements Comparable<Entry> { class in class:CatchTable 112 public Entry(int start, int end, CatchHandlerList handlers) { method in class:CatchTable.Entry 141 if (other instanceof Entry) { [all...] |
H A D | PositionList.java | 76 PositionList.Entry[] arr = new PositionList.Entry[sz]; 99 arr[at] = new PositionList.Entry(insn.getAddress(), pos); 131 public Entry get(int n) { 132 return (Entry) get0(n); 141 public void set(int n, Entry entry) { 146 * Entry in a position list. 148 public static class Entry { class in class:PositionList 161 public Entry (int address, SourcePosition position) { method in class:PositionList.Entry
|
/external/emma/core/java12/com/vladium/util/ |
H A D | IntObjectMap.java | 61 m_buckets = new Entry [initialCapacity]; 87 final Entry [] buckets = m_buckets; 91 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) 112 final Entry [] buckets = m_buckets; 116 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) 136 for (Entry entry = m_buckets [b]; entry != null; entry = entry.m_next) 156 Entry currentKeyEntry = null; 164 Entry [] buckets = m_buckets; 165 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) 191 final Entry bucketListHea 222 private static final class Entry implements Serializable class in class:IntObjectMap 224 Entry (final int key, final Object value, final Entry next) method in class:IntObjectMap.Entry [all...] |
H A D | IntSet.java | 59 m_buckets = new Entry [initialCapacity]; 85 final Entry [] buckets = m_buckets; 89 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) 109 for (Entry entry = m_buckets [b]; entry != null; entry = entry.m_next) 127 for (Entry entry = m_buckets [b]; entry != null; entry = entry.m_next) 137 Entry currentKeyEntry = null; 145 Entry [] buckets = m_buckets; 146 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) 163 final Entry bucketListHead = buckets [bucketIndex]; 164 final Entry newEntr 196 private static final class Entry class in class:IntSet 198 Entry (final int key, final Entry next) method in class:IntSet.Entry [all...] |
H A D | ObjectIntMap.java | 63 m_buckets = new Entry [initialCapacity]; 91 final Entry [] buckets = m_buckets; 96 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) 119 final Entry [] buckets = m_buckets; 124 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) 143 for (Entry entry = m_buckets [b]; entry != null; entry = entry.m_next) 162 Entry currentKeyEntry = null; 171 Entry [] buckets = m_buckets; 172 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) 195 final Entry bucketListHea 260 private static final class Entry class in class:ObjectIntMap 262 Entry (final Object key, final int value, final Entry next) method in class:ObjectIntMap.Entry [all...] |
/external/llvm/include/llvm/Support/ |
H A D | ArrayRecycler.h | 48 FreeList *Entry = Bucket[Idx]; 49 if (!Entry) 51 Bucket[Idx] = Entry->Next; 52 return reinterpret_cast<T*>(Entry); 58 FreeList *Entry = reinterpret_cast<FreeList*>(Ptr); local 61 Entry->Next = Bucket[Idx]; 62 Bucket[Idx] = Entry;
|
/external/llvm/lib/CodeGen/AsmPrinter/ |
H A D | ARMException.cpp | 116 int Entry = 0; local 121 Entry = TypeInfos.size(); 128 Asm->OutStreamer.AddComment("TypeInfo " + Twine(Entry--)); 136 Entry = 0; 142 --Entry; 144 Asm->OutStreamer.AddComment("FilterInfo " + Twine(Entry));
|
/external/llvm/lib/Target/AArch64/ |
H A D | AArch64SelectionDAGInfo.cpp | 45 TargetLowering::ArgListEntry Entry; local 46 Entry.Node = Dst; 47 Entry.Ty = IntPtrTy; 48 Args.push_back(Entry); 49 Entry.Node = Size; 50 Args.push_back(Entry);
|
/external/llvm/lib/Target/XCore/ |
H A D | XCoreSelectionDAGInfo.cpp | 38 TargetLowering::ArgListEntry Entry; local 39 Entry.Ty = TLI.getDataLayout()->getIntPtrType(*DAG.getContext()); 40 Entry.Node = Dst; Args.push_back(Entry); 41 Entry.Node = Src; Args.push_back(Entry); 42 Entry.Node = Size; Args.push_back(Entry);
|