| /external/emma/core/java12/com/vladium/util/ |
| D | IntIntMap.java | 61 m_buckets = new Entry [initialCapacity]; in IntIntMap()
87 final Entry [] buckets = m_buckets; in contains()
91 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in contains()
111 final Entry [] buckets = m_buckets; in get()
115 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in get()
130 final Entry [] buckets = m_buckets; in get()
134 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in get()
153 for (Entry entry = m_buckets [b]; entry != null; entry = entry.m_next) in keys()
170 Entry currentKeyEntry = null; in put()
178 Entry [] buckets = m_buckets; in put()
[all …]
|
| D | IntObjectMap.java | 61 m_buckets = new Entry [initialCapacity]; in IntObjectMap()
87 final Entry [] buckets = m_buckets; in contains()
91 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in contains()
112 final Entry [] buckets = m_buckets; in get()
116 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in get()
136 for (Entry entry = m_buckets [b]; entry != null; entry = entry.m_next) in keys()
156 Entry currentKeyEntry = null; in put()
164 Entry [] buckets = m_buckets; in put()
165 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in put()
191 final Entry bucketListHead = buckets [bucketIndex]; in put()
[all …]
|
| D | IntSet.java | 59 m_buckets = new Entry [initialCapacity]; in IntSet()
85 final Entry [] buckets = m_buckets; in contains()
89 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in contains()
109 for (Entry entry = m_buckets [b]; entry != null; entry = entry.m_next) in values()
127 for (Entry entry = m_buckets [b]; entry != null; entry = entry.m_next) in values()
137 Entry currentKeyEntry = null; in add()
145 Entry [] buckets = m_buckets; in add()
146 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in add()
163 final Entry bucketListHead = buckets [bucketIndex]; in add()
164 final Entry newEntry = new Entry (key, bucketListHead); in add()
[all …]
|
| D | ObjectIntMap.java | 63 m_buckets = new Entry [initialCapacity]; in ObjectIntMap()
91 final Entry [] buckets = m_buckets; in contains()
96 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in contains()
119 final Entry [] buckets = m_buckets; in get()
124 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in get()
143 for (Entry entry = m_buckets [b]; entry != null; entry = entry.m_next) in keys()
162 Entry currentKeyEntry = null; in put()
171 Entry [] buckets = m_buckets; in put()
172 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in put()
195 final Entry bucketListHead = buckets [bucketIndex]; in put()
[all …]
|
| /external/v8/src/ |
| D | hashmap.cc | 64 HashMap::Entry* HashMap::Lookup(void* key, uint32_t hash, bool insert) { in Lookup()
66 Entry* p = Probe(key, hash); in Lookup()
94 Entry* p = Probe(key, hash); in Remove()
117 Entry* q = p; // Start at the entry to remove. in Remove()
133 Entry* r = map_ + (q->hash & (capacity_ - 1)); in Remove()
153 const Entry* end = map_end(); in Clear()
154 for (Entry* p = map_; p < end; p++) { in Clear()
161 HashMap::Entry* HashMap::Start() const { in Start()
166 HashMap::Entry* HashMap::Next(Entry* p) const { in Next()
167 const Entry* end = map_end(); in Next()
[all …]
|
| D | hashmap.h | 67 struct Entry { struct
78 Entry* Lookup(void* key, uint32_t hash, bool insert); argument
102 Entry* Start() const;
103 Entry* Next(Entry* p) const;
108 Entry* map_;
112 Entry* map_end() const { return map_ + capacity_; } in map_end()
113 Entry* Probe(void* key, uint32_t hash);
|
| /external/webkit/Source/WebCore/html/parser/ |
| D | HTMLFormattingElementList.h | 47 class Entry {
50 explicit Entry(Element* element) in Entry() function
56 Entry(MarkerEntryType) in Entry() function
60 ~Entry() {} in ~Entry()
83 Bookmark(Entry* entry) in Bookmark()
89 void moveToAfter(Entry* before) in moveToAfter()
96 Entry* mark() const { return m_mark; } in mark()
100 Entry* m_mark;
108 Entry* find(Element*);
120 const Entry& at(size_t i) const { return m_entries[i]; } in at()
[all …]
|
| /external/guava/src/com/google/common/collect/ |
| D | ConstrainedMap.java | 38 private volatile Set<Entry<K, V>> entrySet;
49 @Override public Set<Entry<K, V>> entrySet() { in entrySet()
60 for (Entry<? extends K, ? extends V> entry : map.entrySet()) { in putAll()
65 private static <K, V> Entry<K, V> constrainedEntry( in constrainedEntry()
66 final Entry<K, V> entry, in constrainedEntry()
71 @Override protected Entry<K, V> delegate() { in constrainedEntry()
81 private static <K, V> Set<Entry<K, V>> constrainedEntrySet(
82 Set<Entry<K, V>> entries,
88 extends ForwardingCollection<Entry<K, V>> {
90 final Collection<Entry<K, V>> entries;
[all …]
|
| D | Maps.java | 40 import java.util.Map.Entry;
298 for (Entry<? extends K, ? extends V> entry : left.entrySet()) { in difference()
496 public static <K, V> Entry<K, V> immutableEntry( in immutableEntry()
509 static <K, V> Set<Entry<K, V>> unmodifiableEntrySet( in unmodifiableEntrySet()
510 final Set<Entry<K, V>> entrySet) { in unmodifiableEntrySet()
525 private static <K, V> Entry<K, V> unmodifiableEntry(final Entry<K, V> entry) { in unmodifiableEntry()
539 extends ForwardingCollection<Entry<K, V>> {
540 private final Collection<Entry<K, V>> entries;
542 UnmodifiableEntries(Collection<Entry<K, V>> entries) {
546 @Override protected Collection<Entry<K, V>> delegate() {
[all …]
|
| D | Multisets.java | 86 transient Set<Multiset.Entry<E>> entrySet;
89 @Override public Set<Multiset.Entry<E>> entrySet() { in entrySet()
90 Set<Multiset.Entry<E>> es = entrySet; in entrySet()
154 public static <E> Multiset.Entry<E> immutableEntry( in immutableEntry()
224 transient Set<Entry<E>> entrySet;
226 public Set<Entry<E>> entrySet() {
227 Set<Entry<E>> es = entrySet;
288 class EntrySet extends AbstractSet<Entry<E>> {
292 @Override public Iterator<Entry<E>> iterator() {
293 return new Iterator<Entry<E>>() {
[all …]
|
| D | RegularImmutableMap.java | 34 private final transient Entry<K, V>[] entries; // entries in insertion order
40 RegularImmutableMap(Entry<?, ?>... immutableEntries) { in RegularImmutableMap() argument
44 Entry<K, V>[] tmp = (Entry<K, V>[]) checkNotNull(immutableEntries); in RegularImmutableMap()
52 for (Entry<K, V> entry : this.entries) { in RegularImmutableMap()
104 for (Entry<K, V> entry : entries) { in containsValue()
117 private transient ImmutableSet<Entry<K, V>> entrySet;
119 @Override public ImmutableSet<Entry<K, V>> entrySet() { in entrySet()
120 ImmutableSet<Entry<K, V>> es = entrySet; in entrySet()
125 private static class EntrySet<K, V> extends ArrayImmutableSet<Entry<K, V>> {
134 if (target instanceof Entry) { in contains()
[all …]
|
| D | ImmutableSortedMap.java | 65 private static final Entry<?, ?>[] EMPTY_ARRAY = new Entry<?, ?>[0];
94 Entry<?, ?>[] entries = { entryOf(k1, v1) }; in of()
230 List<Entry<?, ?>> list = Lists.newArrayListWithCapacity(map.size()); in copyOfInternal()
231 for (Entry<? extends K, ? extends V> entry : map.entrySet()) { in copyOfInternal()
234 Entry<?, ?>[] entryArray = list.toArray(new Entry<?, ?>[list.size()]); in copyOfInternal()
244 private static void sortEntries(Entry<?, ?>[] entryArray, in sortEntries() argument
246 Comparator<Entry<?, ?>> entryComparator = new Comparator<Entry<?, ?>>() { in sortEntries()
247 public int compare(Entry<?, ?> entry1, Entry<?, ?> entry2) { in sortEntries()
255 private static void validateEntries(Entry<?, ?>[] entryArray, in validateEntries() argument
353 for (Entry<? extends K, ? extends V> entry : map.entrySet()) { in putAll()
[all …]
|
| /external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/util/ |
| D | SimpleEntryTest.java | 23 import java.util.Map.Entry;
40 Entry entryToPut = (Entry)map.entrySet().iterator().next(); in test_SimpleEntry_Constructor_LEntry()
41 Entry testEntry = new AbstractMap.SimpleEntry(entryToPut); in test_SimpleEntry_Constructor_LEntry()
46 entryToPut = (Entry)map.entrySet().iterator().next(); in test_SimpleEntry_Constructor_LEntry()
60 Entry entry = new AbstractMap.SimpleEntry<Integer, String>(1,"test"); in test_SimpleEntry_getKey()
67 Entry entry = new AbstractMap.SimpleEntry<Integer, String>(1,"test"); in test_SimpleEntry_getValue()
74 Entry entry = new AbstractMap.SimpleEntry<Integer, String>(1,"test"); in test_SimpleEntry_setValue()
83 Entry entry = new AbstractMap.SimpleEntry<Integer, String>(1,"test"); in test_SimpleEntry_equals()
86 Entry entryToPut = (Entry)map.entrySet().iterator().next(); in test_SimpleEntry_equals()
87 Entry testEntry = new AbstractMap.SimpleEntry(entryToPut); in test_SimpleEntry_equals()
[all …]
|
| D | SimpleImmutableEntryTest.java | 24 import java.util.Map.Entry;
41 Entry entryToPut = (Entry)map.entrySet().iterator().next(); in test_SimpleImmutableEntry_Constructor_LEntry()
42 Entry testEntry = new AbstractMap.SimpleImmutableEntry(entryToPut); in test_SimpleImmutableEntry_Constructor_LEntry()
47 entryToPut = (Entry)map.entrySet().iterator().next(); in test_SimpleImmutableEntry_Constructor_LEntry()
61 Entry entry = new AbstractMap.SimpleImmutableEntry<Integer, String>(1,"test"); in test_SimpleImmutableEntry_getKey()
68 Entry entry = new AbstractMap.SimpleImmutableEntry<Integer, String>(1,"test"); in test_SimpleImmutableEntry_getValue()
75 Entry entry = new AbstractMap.SimpleImmutableEntry<Integer, String>(1,"test"); in test_SimpleImmutableEntry_setValue()
93 Entry entry = new AbstractMap.SimpleImmutableEntry<Integer, String>(1,"test"); in test_SimpleImmutableEntry_equals()
96 Entry entryToPut = (Entry)map.entrySet().iterator().next(); in test_SimpleImmutableEntry_equals()
97 Entry testEntry = new AbstractMap.SimpleImmutableEntry(entryToPut); in test_SimpleImmutableEntry_equals()
[all …]
|
| /external/skia/src/effects/ |
| D | SkBitmapCache.cpp | 19 struct SkBitmapCache::Entry { struct in SkBitmapCache
20 Entry* fPrev; argument
21 Entry* fNext; argument
27 Entry(const void* buffer, size_t size, const SkBitmap& bm) : fBitmap(bm) { in Entry() argument
33 ~Entry() { sk_free(fBuffer); } in ~Entry() argument
50 Entry* entry = fHead; in ~SkBitmapCache()
52 Entry* next = entry->fNext; in ~SkBitmapCache()
58 SkBitmapCache::Entry* SkBitmapCache::detach(Entry* entry) const { in detach() argument
76 void SkBitmapCache::attachToHead(Entry* entry) const { in attachToHead()
90 Entry* entry = fHead; in find()
[all …]
|
| /external/llvm/lib/VMCore/ |
| D | Value.cpp | 451 ValueHandleBase *&Entry = pImpl->ValueHandles[VP]; in AddToUseList() local
452 assert(Entry != 0 && "Value doesn't have any handles?"); in AddToUseList()
453 AddToExistingUseList(&Entry); in AddToUseList()
465 ValueHandleBase *&Entry = Handles[VP]; in AddToUseList() local
466 assert(Entry == 0 && "Value really did already have handles?"); in AddToUseList()
467 AddToExistingUseList(&Entry); in AddToUseList()
518 ValueHandleBase *Entry = pImpl->ValueHandles[V]; in ValueIsDeleted() local
519 assert(Entry && "Value bit set but no entries exist"); in ValueIsDeleted()
530 for (ValueHandleBase Iterator(Assert, *Entry); Entry; Entry = Iterator.Next) { in ValueIsDeleted()
532 Iterator.AddToExistingUseListAfter(Entry); in ValueIsDeleted()
[all …]
|
| /external/llvm/lib/Target/ARM/ |
| D | Thumb2SizeReduction.cpp | 151 bool VerifyPredAndCC(MachineInstr *MI, const ReduceEntry &Entry,
156 const ReduceEntry &Entry);
159 const ReduceEntry &Entry, bool LiveCPSR,
165 const ReduceEntry &Entry,
171 const ReduceEntry &Entry,
242 Thumb2SizeReduce::VerifyPredAndCC(MachineInstr *MI, const ReduceEntry &Entry, in VerifyPredAndCC() argument
245 if ((is2Addr && Entry.PredCC2 == 0) || in VerifyPredAndCC()
246 (!is2Addr && Entry.PredCC1 == 0)) { in VerifyPredAndCC()
265 } else if ((is2Addr && Entry.PredCC2 == 2) || in VerifyPredAndCC()
266 (!is2Addr && Entry.PredCC1 == 2)) { in VerifyPredAndCC()
[all …]
|
| /external/chromium/net/base/ |
| D | host_cache.cc | 14 HostCache::Entry::Entry(int error, in Entry() function in net::HostCache::Entry
20 HostCache::Entry::~Entry() { in ~Entry()
36 const HostCache::Entry* HostCache::Lookup(const Key& key, in Lookup()
46 Entry* entry = it->second.get(); in Lookup()
53 HostCache::Entry* HostCache::Set(const Key& key, in Set()
64 scoped_refptr<Entry>& entry = entries_[key]; in Set()
67 Entry* ptr = new Entry(error, addrlist, expiration); in Set()
116 bool HostCache::CanUseEntry(const Entry* entry, const base::TimeTicks now) { in CanUseEntry()
120 void HostCache::Compact(base::TimeTicks now, const Entry* pinned_entry) { in Compact()
123 Entry* entry = (it->second).get(); in Compact()
[all …]
|
| D | host_cache.h | 25 struct Entry : public base::RefCounted<Entry> { struct
26 Entry(int error, const AddressList& addrlist, base::TimeTicks expiration);
36 friend class base::RefCounted<Entry>; argument
38 ~Entry();
73 typedef std::map<Key, scoped_refptr<Entry> > EntryMap;
86 const Entry* Lookup(const Key& key, base::TimeTicks now) const;
92 Entry* Set(const Key& key,
118 static bool CanUseEntry(const Entry* entry, const base::TimeTicks now);
122 void Compact(base::TimeTicks now, const Entry* pinned_entry);
|
| /external/llvm/lib/Object/ |
| D | MachOObjectFile.cpp | 150 InMemoryStruct<macho::Symbol64TableEntry> Entry; in getSymbolName() local
151 getSymbol64TableEntry(DRI, Entry); in getSymbolName()
152 Result = MachOObj->getStringAtIndex(Entry->StringIndex); in getSymbolName()
154 InMemoryStruct<macho::SymbolTableEntry> Entry; in getSymbolName() local
155 getSymbolTableEntry(DRI, Entry); in getSymbolName()
156 Result = MachOObj->getStringAtIndex(Entry->StringIndex); in getSymbolName()
164 InMemoryStruct<macho::Symbol64TableEntry> Entry; in getSymbolAddress() local
165 getSymbol64TableEntry(DRI, Entry); in getSymbolAddress()
166 Result = Entry->Value; in getSymbolAddress()
168 InMemoryStruct<macho::SymbolTableEntry> Entry; in getSymbolAddress() local
[all …]
|
| /external/skia/gpu/include/ |
| D | GrTLList.h | 25 class Entry {
26 Entry* fPrev;
27 Entry* fNext;
46 Entry* fHead;
47 Entry* fTail;
49 friend class Entry; variable
57 class Child : public GrTLList::Entry<Child> {
|
| /external/javassist/src/main/javassist/bytecode/analysis/ |
| D | IntQueue.java | 20 private static class Entry { class in IntQueue
21 private IntQueue.Entry next;
23 private Entry(int value) { in Entry() method in IntQueue.Entry
27 private IntQueue.Entry head;
29 private IntQueue.Entry tail;
32 IntQueue.Entry entry = new Entry(value); in add()
|
| /external/chromium/chrome/browser/notifications/ |
| D | notification_exceptions_table_model.cc | 18 struct NotificationExceptionsTableModel::Entry { struct in NotificationExceptionsTableModel
19 Entry(const GURL& origin, ContentSetting setting);
20 bool operator<(const Entry& b) const;
48 Entry* entry = &entries_[row]; in RemoveRows()
75 const Entry& entry = entries_[row]; in GetText()
119 entries_.push_back(Entry(allowed[i], CONTENT_SETTING_ALLOW)); in LoadEntries()
121 entries_.push_back(Entry(blocked[i], CONTENT_SETTING_BLOCK)); in LoadEntries()
125 NotificationExceptionsTableModel::Entry::Entry( in Entry() function in NotificationExceptionsTableModel::Entry
132 bool NotificationExceptionsTableModel::Entry::operator<( in operator <()
133 const NotificationExceptionsTableModel::Entry& b) const { in operator <()
|
| /external/chromium/chrome/browser/sessions/ |
| D | tab_restore_service.h | 52 struct Entry { struct
53 Entry();
54 explicit Entry(Type type);
55 virtual ~Entry();
74 struct Tab : public Entry { argument
104 struct Window : public Entry {
115 typedef std::list<Entry*> Entries;
170 std::vector<Entry*>* entries);
210 void AddEntry(Entry* entry, bool prune, bool to_front);
259 std::vector<Entry*>* loaded_entries);
[all …]
|
| /external/llvm/lib/MC/ |
| D | MCContext.cpp | 73 StringMapEntry<MCSymbol*> &Entry = Symbols.GetOrCreateValue(Name); in GetOrCreateSymbol() local
74 MCSymbol *Sym = Entry.getValue(); in GetOrCreateSymbol()
80 Entry.setValue(Sym); in GetOrCreateSymbol()
179 const MCSectionMachO *&Entry = Map[Name.str()]; in getMachOSection() local
180 if (Entry) return Entry; in getMachOSection()
183 return Entry = new (*this) MCSectionMachO(Segment, Section, TypeAndAttributes, in getMachOSection()
201 StringMapEntry<const MCSectionELF*> &Entry = Map.GetOrCreateValue(Section); in getELFSection() local
202 if (Entry.getValue()) return Entry.getValue(); in getELFSection()
213 MCSectionELF *Result = new (*this) MCSectionELF(Entry.getKey(), Type, Flags, in getELFSection()
215 Entry.setValue(Result); in getELFSection()
[all …]
|