| /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 | 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 …]
|
| 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 …]
|
| /external/chromium/net/base/ |
| D | load_log_util_unittest.cc | 16 log->Add(LoadLog::Entry(MakeTime(1), in TEST()
20 LoadLog::Entry( in TEST()
25 LoadLog::Entry( in TEST()
30 log->Add(LoadLog::Entry(MakeTime(12), in TEST()
34 log->Add(LoadLog::Entry(MakeTime(131), in TEST()
49 log->Add(LoadLog::Entry(MakeTime(1), in TEST()
53 log->Add(LoadLog::Entry(MakeTime(12), "Sup foo")); in TEST()
54 log->Add(LoadLog::Entry(MakeTime(12), ERR_UNEXPECTED)); in TEST()
55 log->Add(LoadLog::Entry(MakeTime(14), "Multiline\nString")); in TEST()
57 log->Add(LoadLog::Entry(MakeTime(131), in TEST()
[all …]
|
| 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()
45 Entry* entry = it->second.get(); in Lookup()
52 HostCache::Entry* HostCache::Set(const Key& key, in Set()
62 scoped_refptr<Entry>& entry = entries_[key]; in Set()
65 Entry* ptr = new Entry(error, addrlist, expiration); in Set()
83 bool HostCache::CanUseEntry(const Entry* entry, const base::TimeTicks now) { in CanUseEntry()
87 void HostCache::Compact(base::TimeTicks now, const Entry* pinned_entry) { in Compact()
90 Entry* entry = (it->second).get(); in Compact()
[all …]
|
| D | load_log_unittest.cc | 29 log->Add(LoadLog::Entry(MakeTime(0), in TEST()
32 log->Add(LoadLog::Entry(MakeTime(2), in TEST()
36 LoadLog::Entry( in TEST()
63 log->Add(LoadLog::Entry(MakeTime(i), in TEST()
76 log->Add(LoadLog::Entry(MakeTime(0), in TEST()
79 log->Add(LoadLog::Entry(MakeTime(1), in TEST()
82 log->Add(LoadLog::Entry(MakeTime(2), in TEST()
98 log1->Add(LoadLog::Entry(MakeTime(0), in TEST()
102 log2->Add(LoadLog::Entry(MakeTime(3), in TEST()
105 log2->Add(LoadLog::Entry(MakeTime(9), in TEST()
[all …]
|
| D | load_log.h | 50 struct Entry { struct
65 Entry(base::TimeTicks time, int error_code) in Entry() argument
69 Entry(base::TimeTicks time, const Event& event) in Entry() function
73 Entry(base::TimeTicks time, const std::string& string) in Entry() argument
77 Entry(base::TimeTicks time, const char* literal) in Entry() argument
94 typedef std::vector<Entry> EntryList; argument
116 log->Add(Entry(base::TimeTicks::Now(), Event(event_type, PHASE_NONE))); in AddEvent()
123 log->Add(Entry(base::TimeTicks::Now(), Event(event_type, PHASE_BEGIN))); in BeginEvent()
131 log->Add(Entry(base::TimeTicks::Now(), Event(event_type, PHASE_END))); in EndEvent()
137 log->Add(Entry(base::TimeTicks::Now(), literal)); in AddStringLiteral()
[all …]
|
| D | host_cache.h | 23 struct Entry : public base::RefCounted<Entry> { struct
24 Entry(int error, const AddressList& addrlist, base::TimeTicks expiration);
34 friend class base::RefCounted<Entry>; argument
36 ~Entry();
58 typedef std::map<Key, scoped_refptr<Entry> > EntryMap;
71 const Entry* Lookup(const Key& key, base::TimeTicks now) const;
77 Entry* Set(const Key& key,
119 static bool CanUseEntry(const Entry* entry, const base::TimeTicks now);
123 void Compact(base::TimeTicks now, const Entry* pinned_entry);
|
| D | load_log_util.cc | 73 struct Entry { struct in net::__anonce7e5ca00111::FormatHelper
74 explicit Entry(const LoadLog::Entry* log_entry) in Entry() argument
78 return log_entry->type == LoadLog::Entry::TYPE_EVENT && in IsBeginEvent()
83 return log_entry->type == LoadLog::Entry::TYPE_EVENT && in IsEndEvent()
87 const LoadLog::Entry* log_entry; argument
96 Entry entry(&log->entries()[i]); in PopulateEntries()
123 int FindStartOfBlockIndex(const Entry& entry) { in FindStartOfBlockIndex()
143 if (entries_[i].log_entry->type == LoadLog::Entry::TYPE_EVENT) in GetMaxExtent()
171 const LoadLog::Entry* entry = entries_[index].log_entry; in GetEntryString()
176 case LoadLog::Entry::TYPE_EVENT: in GetEntryString()
[all …]
|
| /external/guava/src/com/google/common/collect/ |
| 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 | 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 | 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 …]
|
| D | AbstractMultimap.java | 255 for (Map.Entry<? extends K, ? extends V> entry : multimap.entries()) { in putAll()
854 final Iterator<Map.Entry<K, Collection<V>>> entryIterator in iterator()
856 Map.Entry<K, Collection<V>> entry; in iterator()
987 transient Set<Multiset.Entry<K>> entrySet;
989 @Override public Set<Multiset.Entry<K>> entrySet() { in entrySet()
990 Set<Multiset.Entry<K>> result = entrySet; in entrySet()
994 private class EntrySet extends AbstractSet<Multiset.Entry<K>> {
995 @Override public Iterator<Multiset.Entry<K>> iterator() { in iterator()
1005 if (!(o instanceof Multiset.Entry)) { in contains()
1008 Multiset.Entry<?> entry = (Multiset.Entry<?>) o; in contains()
[all …]
|
| D | ImmutableMultiset.java | 113 for (Entry<? extends E> entry : multiset.entrySet()) { in copyOfInternal()
173 final Iterator<Map.Entry<E, Integer>> mapIterator in iterator()
186 Map.Entry<E, Integer> entry = mapIterator.next(); in iterator()
249 for (Entry<?> entry : that.entrySet()) { in equals()
276 private transient ImmutableSet<Entry<E>> entrySet;
278 public Set<Entry<E>> entrySet() { in entrySet()
279 ImmutableSet<Entry<E>> es = entrySet; in entrySet()
283 private static class EntrySet<E> extends ImmutableSet<Entry<E>> {
290 @Override public UnmodifiableIterator<Entry<E>> iterator() { in iterator()
291 final Iterator<Map.Entry<E, Integer>> mapIterator in iterator()
[all …]
|
| D | ConcurrentHashMultiset.java | 160 for (Multiset.Entry<E> entry : entrySet()) { in snapshot()
366 @Override public Set<Multiset.Entry<E>> entrySet() {
374 private class EntrySet extends AbstractSet<Multiset.Entry<E>> {
384 if (object instanceof Multiset.Entry) {
385 Multiset.Entry<?> entry = (Multiset.Entry<?>) object;
393 @Override public Iterator<Multiset.Entry<E>> iterator() {
394 final Iterator<Map.Entry<E, Integer>> backingIterator
396 return new Iterator<Multiset.Entry<E>>() {
401 public Multiset.Entry<E> next() {
402 Map.Entry<E, Integer> backingEntry = backingIterator.next();
[all …]
|
| D | AbstractMapBasedMultiset.java | 88 @Override public Set<Multiset.Entry<E>> entrySet() { in entrySet()
96 private class EntrySet extends AbstractSet<Multiset.Entry<E>> {
97 @Override public Iterator<Multiset.Entry<E>> iterator() { in iterator()
98 final Iterator<Map.Entry<E, AtomicInteger>> backingEntries in iterator()
100 return new Iterator<Multiset.Entry<E>>() { in iterator()
101 Map.Entry<E, AtomicInteger> toRemove; in iterator()
107 public Multiset.Entry<E> next() { in iterator()
108 final Map.Entry<E, AtomicInteger> mapEntry = backingEntries.next(); in iterator()
152 if (o instanceof Entry) {
153 Entry<?> entry = (Entry<?>) o;
[all …]
|
| /external/v8/src/ |
| D | hashmap.cc | 60 HashMap::Entry* HashMap::Lookup(void* key, uint32_t hash, bool insert) { in Lookup()
62 Entry* p = Probe(key, hash); in Lookup()
90 Entry* p = Probe(key, hash); in Remove()
113 Entry* q = p; // Start at the entry to remove. in Remove()
129 Entry* r = map_ + (q->hash & (capacity_ - 1)); in Remove()
149 const Entry* end = map_end(); in Clear()
150 for (Entry* p = map_; p < end; p++) { in Clear()
157 HashMap::Entry* HashMap::Start() const { in Start()
162 HashMap::Entry* HashMap::Next(Entry* p) const { in Next()
163 const Entry* end = map_end(); in Next()
[all …]
|
| D | hashmap.h | 66 struct Entry { struct
77 Entry* Lookup(void* key, uint32_t hash, bool insert); argument
101 Entry* Start() const;
102 Entry* Next(Entry* p) const;
107 Entry* map_;
111 Entry* map_end() const { return map_ + capacity_; } in map_end()
112 Entry* Probe(void* key, uint32_t hash);
|
| /external/skia/src/gl/ |
| D | SkTextureCache.cpp | 6 SkTextureCache::Entry::Entry(const SkBitmap& bitmap) in Entry() function in SkTextureCache::Entry
13 SkTextureCache::Entry::~Entry() { in ~Entry()
32 Entry* entry = fHead; in ~SkTextureCache()
44 Entry* entry = fHead; in deleteAllCaches()
46 Entry* next = entry->fNext; in deleteAllCaches()
73 Entry** sorted = fSorted.begin(); in findInSorted()
86 const Entry* entry = sorted[hi]; in findInSorted()
103 SkTextureCache::Entry* SkTextureCache::find(const Key& key, int* insert) const { in find()
112 Entry* entry = fHash[hashIndex]; in find()
135 SkTextureCache::Entry* SkTextureCache::lock(const SkBitmap& bitmap) { in lock()
[all …]
|
| D | SkTextureCache.h | 85 class Entry {
97 Entry(const SkBitmap& bitmap);
98 ~Entry();
116 Entry* fPrev;
117 Entry* fNext;
122 Entry* lock(const SkBitmap&);
123 void unlock(Entry*);
134 Entry* fHead;
135 Entry* fTail;
150 mutable Entry* fHash[kHashCount];
[all …]
|
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| D | register.h | 47 struct Entry { struct
50 Entry() : reader(0), converter(0) {} in Entry() function
66 void SetEntry(const string &type, const Entry &entry) { in SetEntry()
77 Entry LookupEntry(const string &type) const { in LookupEntry()
79 typename map<string, Entry>::const_iterator it = fst_table_.find(type); in LookupEntry()
83 return Entry(); in LookupEntry()
86 Entry GetEntry(const string &type) const { in GetEntry()
88 Entry entry = LookupEntry(type); in GetEntry()
113 map<string, Entry> fst_table_;
132 typedef typename FstRegister<Arc>::Entry Entry; typedef
[all …]
|
| /external/chromium/net/tools/dump_cache/ |
| D | cache_dumper.h | 29 disk_cache::Entry** entry) = 0;
33 virtual bool WriteEntry(disk_cache::Entry* entry, int stream, int offset,
37 virtual void CloseEntry(disk_cache::Entry* entry, base::Time last_used,
46 virtual bool CreateEntry(const std::string& key, disk_cache::Entry** entry);
47 virtual bool WriteEntry(disk_cache::Entry* entry, int stream, int offset,
49 virtual void CloseEntry(disk_cache::Entry* entry, base::Time last_used,
62 virtual bool CreateEntry(const std::string& key, disk_cache::Entry** entry);
63 virtual bool WriteEntry(disk_cache::Entry* entry, int stream, int offset,
65 virtual void CloseEntry(disk_cache::Entry* entry, base::Time last_used,
|