| /external/chromium_org/net/disk_cache/simple/ |
| simple_index.cc | 54 typedef disk_cache::SimpleIndex::EntrySet EntrySet;
56 explicit CompareHashesForTimestamp(const EntrySet& set);
60 const EntrySet& entry_set_;
63 CompareHashesForTimestamp::CompareHashesForTimestamp(const EntrySet& set)
68 EntrySet::const_iterator it1 = entry_set_.find(hash1);
70 EntrySet::const_iterator it2 = entry_set_.find(hash2);
223 for (EntrySet::iterator it = entries_set_.begin(), end = entries_set_.end();
256 EntrySet::iterator it = entries_set_.find(entry_hash);
277 EntrySet::iterator it = entries_set_.find(entry_hash)
[all...] |
| simple_index.h | 109 typedef base::hash_map<uint64, EntryMetadata> EntrySet;
113 EntrySet* entry_set);
146 void UpdateEntryIteratorSize(EntrySet::iterator* it, int entry_size);
160 EntrySet entries_set_;
|
| simple_index_file.h | 38 SimpleIndex::EntrySet entries;
89 virtual void WriteToDisk(const SimpleIndex::EntrySet& entry_set,
111 // Load the index file from disk returning an EntrySet.
122 const SimpleIndex::EntrySet& entries);
131 // the corresponding EntrySet. Returns NULL on error.
154 // Scan the index directory for entries, returning an EntrySet of all entries
|
| simple_index_file.cc | 79 void ProcessEntryFile(SimpleIndex::EntrySet* entries,
113 SimpleIndex::EntrySet::iterator it = entries->find(hash_key);
263 void SimpleIndexFile::WriteToDisk(const SimpleIndex::EntrySet& entry_set,
355 const SimpleIndex::EntrySet& entries) {
359 for (SimpleIndex::EntrySet::const_iterator it = entries.begin();
374 SimpleIndex::EntrySet* entries = &out_result->entries;
439 SimpleIndex::EntrySet* entries = &out_result->entries;
|
| simple_index_file_unittest.cc | 123 SimpleIndex::EntrySet entries;
149 const SimpleIndex::EntrySet& new_entries = deserialize_result.entries;
153 SimpleIndex::EntrySet::const_iterator it = new_entries.find(kHashes[i]);
197 SimpleIndex::EntrySet entries;
|
| simple_index_unittest.cc | 69 virtual void WriteToDisk(const SimpleIndex::EntrySet& entry_set,
77 void GetAndResetDiskWriteEntrySet(SimpleIndex::EntrySet* entry_set) {
91 SimpleIndex::EntrySet disk_write_entry_set_;
134 SimpleIndex::EntrySet::iterator it = index_->entries_set_.find(key);
594 SimpleIndex::EntrySet entry_set;
|
| /external/chromium_org/net/disk_cache/blockfile/ |
| index_table_v3.h | 108 struct NET_EXPORT_PRIVATE EntrySet {
109 EntrySet();
110 ~EntrySet();
185 EntrySet LookupEntries(uint32 hash);
|
| index_table_v3.cc | 403 EntrySet::EntrySet() : evicted_count(0), current(0) {
406 EntrySet::~EntrySet() {
577 EntrySet IndexTable::LookupEntries(uint32 hash) {
578 EntrySet entries;
[all...] |
| index_table_v3_unittest.cc | 293 disk_cache::EntrySet found_entries = index.LookupEntries(hash);
315 disk_cache::EntrySet found_entries = index.LookupEntries(hash);
348 disk_cache::EntrySet found_entries = index.LookupEntries(hash);
609 disk_cache::EntrySet found_entries = index.LookupEntries(entries[i].hash);
661 disk_cache::EntrySet found_entries = index.LookupEntries(entries[i].hash);
|
| /external/guava/guava/src/com/google/common/collect/ |
| AbstractMultiset.java | 34 * this class and implementing the {@link Multiset#entrySet()} method, plus
39 * the set returned by {@link Multiset#entrySet()}, as do many methods acting on
56 return entrySet().isEmpty();
69 for (Entry<E> entry : entrySet()) {
164 private transient Set<Entry<E>> entrySet;
166 @Override public Set<Entry<E>> entrySet() {
167 Set<Entry<E>> result = entrySet;
168 return (result == null) ? entrySet = createEntrySet() : result;
171 class EntrySet extends Multisets.EntrySet<E>
[all...] |
| ConcurrentHashMultiset.java | 200 for (Multiset.Entry<E> entry : entrySet()) {
463 private transient EntrySet entrySet;
465 @Override public Set<Multiset.Entry<E>> entrySet() {
466 EntrySet result = entrySet;
468 entrySet = result = new EntrySet();
486 private Iterator<Map.Entry<E, AtomicInteger>> mapEntries = countMap.entrySet().iterator();
526 private class EntrySet extends AbstractMultiset<E>.EntrySet
[all...] |
| RegularImmutableMap.java | 190 private transient ImmutableSet<Entry<K, V>> entrySet;
192 @Override public ImmutableSet<Entry<K, V>> entrySet() {
193 ImmutableSet<Entry<K, V>> es = entrySet;
194 return (es == null) ? (entrySet = new EntrySet<K, V>(this)) : es;
198 private static class EntrySet<K, V> extends ArrayImmutableSet<Entry<K, V>> {
201 EntrySet(RegularImmutableMap<K, V> map) {
|
| ImmutableMultiset.java | 204 return copyFromEntries(multiset.entrySet());
330 for (Entry<?> entry : that.entrySet()) {
341 return Sets.hashCodeImpl(entrySet());
345 return entrySet().toString();
348 private transient ImmutableSet<Entry<E>> entrySet;
351 public Set<Entry<E>> entrySet() {
352 ImmutableSet<Entry<E>> es = entrySet;
353 return (es == null) ? (entrySet = createEntrySet()) : es;
361 return new EntrySet<E>(this);
364 static class EntrySet<E> extends ImmutableSet<Entry<E>>
[all...] |
| ForwardingMap.java | 124 public Set<Entry<K, V>> entrySet() {
125 return delegate().entrySet();
150 * the {@code iterator} method of {@link #entrySet}. If you override {@link
151 * #entrySet}, you may wish to override {@link #remove} to forward to this
161 Iterator<Entry<K, V>> entryIterator = entrySet().iterator();
175 * method of {@link #entrySet}. In many cases, you may wish to override
181 Iterator<Entry<K, V>> entryIterator = entrySet().iterator();
193 * ForwardingMap#entrySet}. In many cases, you may wish to override {@link
211 * of the {@code iterator} method of {@link #entrySet}. If you override {@link
212 * #entrySet}, you may wish to override {@link #containsKey} to forward t
[all...] |
| SortedMultisets.java | 157 private transient Set<Entry<E>> entrySet;
159 @Override public Set<Entry<E>> entrySet() {
160 Set<Entry<E>> result = entrySet;
161 return (result == null) ? entrySet = createEntrySet() : result;
165 return new Multisets.EntrySet<E>() {
175 return forwardMultiset().entrySet().size();
193 return entrySet().toString();
|
| ImmutableSortedMap.java | 251 Entry<K, V>[] entries = map.entrySet().toArray(new Entry[0]);
393 for (Entry<? extends K, ? extends V> entry : map.entrySet()) {
459 private transient ImmutableSet<Entry<K, V>> entrySet;
465 @Override public ImmutableSet<Entry<K, V>> entrySet() {
466 ImmutableSet<Entry<K, V>> es = entrySet;
467 return (es == null) ? (entrySet = createEntrySet()) : es;
472 : new EntrySet<K, V>(this);
476 private static class EntrySet<K, V> extends ImmutableSet<Entry<K, V>> {
479 EntrySet(ImmutableSortedMap<K, V> map) {
516 return map.entrySet();
[all...] |
| Multimaps.java | 518 Set<Entry<K, Collection<V>>> entrySet;
520 @Override public Set<Map.Entry<K, Collection<V>>> entrySet() {
521 Set<Entry<K, Collection<V>>> result = entrySet;
523 ? entrySet
524 = unmodifiableAsMapEntries(unmodifiableMap.entrySet())
[all...] |
| AbstractBiMap.java | 144 for (Entry<? extends K, ? extends V> entry : map.entrySet()) {
194 final Iterator<Entry<K, V>> iterator = delegate.entrySet().iterator();
269 private transient Set<Entry<K, V>> entrySet;
271 @Override public Set<Entry<K, V>> entrySet() {
272 Set<Entry<K, V>> result = entrySet;
273 return (result == null) ? entrySet = new EntrySet() : result;
276 private class EntrySet extends ForwardingSet<Entry<K, V>> {
277 final Set<Entry<K, V>> esDelegate = delegate.entrySet();
|
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| CostAllocator.h | 100 typedef std::set<PoolEntry*, EntryComparator> EntrySet;
102 EntrySet entrySet;
104 void removeEntry(PoolEntry *p) { entrySet.erase(p); }
110 typename EntrySet::iterator itr =
111 std::lower_bound(entrySet.begin(), entrySet.end(), costKey,
114 if (itr != entrySet.end() && costKey == (*itr)->getCost())
118 entrySet.insert(itr, p);
|
| /external/chromium_org/third_party/protobuf/java/src/main/java/com/google/protobuf/ |
| SmallSortedMap.java | 64 * object returned by {@link #entrySet()} adheres to the same contract but is
144 // The EntrySet is a stateless view of the Map. It's initialized the first
146 private volatile EntrySet lazyEntrySet;
197 overflowEntries.entrySet();
302 getOverflowEntriesMutable().entrySet().iterator();
352 public Set<Map.Entry<K, V>> entrySet() {
354 lazyEntrySet = new EntrySet();
470 private class EntrySet extends AbstractSet<Map.Entry<K, V>> {
578 lazyOverflowIterator = overflowEntries.entrySet().iterator();
|
| /frameworks/base/core/java/android/util/ |
| MapCollections.java | 33 EntrySet mEntrySet;
165 final class EntrySet implements Set<Map.Entry<K, V>> {
531 mEntrySet = new EntrySet();
|
| /frameworks/support/v4/java/android/support/v4/util/ |
| MapCollections.java | 31 EntrySet mEntrySet;
163 final class EntrySet implements Set<Map.Entry<K, V>> {
530 mEntrySet = new EntrySet();
|
| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| AbstractBiMap.java | 140 for (Entry<? extends K, ? extends V> entry : map.entrySet()) {
190 final Iterator<Entry<K, V>> iterator = delegate.entrySet().iterator();
265 private transient Set<Entry<K, V>> entrySet;
267 @Override public Set<Entry<K, V>> entrySet() {
268 Set<Entry<K, V>> result = entrySet;
269 return (result == null) ? entrySet = new EntrySet() : result;
272 private class EntrySet extends ForwardingSet<Entry<K, V>> {
273 final Set<Entry<K, V>> esDelegate = delegate.entrySet();
|
| Multimaps.java | 429 Set<Entry<K, Collection<V>>> entrySet;
431 @Override public Set<Map.Entry<K, Collection<V>>> entrySet() {
432 Set<Entry<K, Collection<V>>> result = entrySet;
434 ? entrySet
435 = unmodifiableAsMapEntries(unmodifiableMap.entrySet())
[all...] |
| /external/smack/src/org/jivesoftware/smack/util/collections/ |
| AbstractHashedMap.java | 31 * without the need to replace the KeySet, EntrySet and Values view classes.
99 protected transient EntrySet<K, V> entrySet;
311 for (Iterator it = map.entrySet().iterator(); it.hasNext();) {
715 * It avoids the need to create an entrySet/keySet/values object.
767 * Gets the entrySet view of the map.
771 * @return the entrySet view
773 public Set<Map.Entry<K, V>> entrySet() {
774 if (entrySet == null) {
775 entrySet = new EntrySet<K, V>(this)
[all...] |
