/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 | IntIntMap.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) 111 final Entry [] buckets = m_buckets; 115 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) 130 final Entry [] buckets = m_buckets; 134 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) 153 for (Entry entry = m_buckets [b]; entry != null; entry = entry.m_next) 170 Entry currentKeyEntry = null; 178 Entry [] bucket 264 private static final class Entry class in class:IntIntMap 266 Entry (final int key, final int value, final Entry next) method in class:IntIntMap.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/v8/src/ |
H A D | hashmap.h | 66 struct Entry { struct in class:v8::internal::HashMap 77 Entry* Lookup(void* key, uint32_t hash, bool insert); 95 // for (Entry* p = map.Start(); p != NULL; p = map.Next(p)) { 101 Entry* Start() const; 102 Entry* Next(Entry* p) const; 107 Entry* map_; 111 Entry* map_end() const { return map_ + capacity_; } 112 Entry* Probe(void* key, uint32_t hash);
|
H A D | hashmap.cc | 60 HashMap::Entry* HashMap::Lookup(void* key, uint32_t hash, bool insert) { 62 Entry* p = Probe(key, hash); 90 Entry* p = Probe(key, hash); 113 Entry* q = p; // Start at the entry to remove. 129 Entry* r = map_ + (q->hash & (capacity_ - 1)); 149 const Entry* end = map_end(); 150 for (Entry* p = map_; p < end; p++) { 157 HashMap::Entry* HashMap::Start() const { 162 HashMap::Entry* HashMap::Next(Entry* [all...] |
/external/guava/src/com/google/common/collect/ |
H A D | AbstractMapEntry.java | 22 import java.util.Map.Entry; 28 * methods of {@code Entry}. 33 abstract class AbstractMapEntry<K, V> implements Entry<K, V> { 44 if (object instanceof Entry) { 45 Entry<?, ?> that = (Entry<?, ?>) object;
|
H A D | Multisets.java | 86 transient Set<Multiset.Entry<E>> entrySet; 89 @Override public Set<Multiset.Entry<E>> entrySet() { 90 Set<Multiset.Entry<E>> es = entrySet; 92 // Safe because the returned set is made unmodifiable and Entry 154 public static <E> Multiset.Entry<E> 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< [all...] |
H A D | ConstrainedMap.java | 38 private volatile Set<Entry<K, V>> entrySet; 49 @Override public Set<Entry<K, V>> entrySet() { 60 for (Entry<? extends K, ? extends V> entry : map.entrySet()) { 65 private static <K, V> Entry<K, V> constrainedEntry( argument 66 final Entry<K, V> entry, 71 @Override protected Entry<K, V> delegate() { 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< [all...] |
H A D | Maps.java | 40 import java.util.Map.Entry; 298 for (Entry<? extends K, ? extends V> entry : left.entrySet()) { 489 * Entry#setValue} operation throws an {@link UnsupportedOperationException}. 496 public static <K, V> Entry<K, V> immutableEntry( 503 * Entry#setValue} operation throws an {@link UnsupportedOperationException}, 509 static <K, V> Set<Entry<K, V>> unmodifiableEntrySet( 510 final Set<Entry<K, V>> entrySet) { 517 * Entry#setValue} operation throws an {@link UnsupportedOperationException}. 519 * the Entry contract, to avoid a possible nefarious implementation of 525 private static <K, V> Entry< argument 946 filterEntries( Map<K, V> unfiltered, Predicate<? super Entry<K, V>> entryPredicate) argument 958 filterFiltered( AbstractFilteredMap<K, V> map, Predicate<? super Entry<K, V>> entryPredicate) argument 972 AbstractFilteredMap(Map<K, V> unfiltered, Predicate<? super Entry<K, V>> predicate) argument 1142 FilteredEntryMap(Map<K, V> unfiltered, Predicate<? super Entry<K, V>> entryPredicate) argument [all...] |
H A D | RegularImmutableMap.java | 34 private final transient Entry<K, V>[] entries; // entries in insertion order 40 RegularImmutableMap(Entry<?, ?>... immutableEntries) { 41 // each of our 6 callers carefully put only Entry<K, V>s into the array! 44 Entry<K, V>[] tmp = (Entry<K, V>[]) checkNotNull(immutableEntries); 52 for (Entry<K, V> entry : this.entries) { 104 for (Entry<K, V> entry : entries) { 117 private transient ImmutableSet<Entry<K, V>> entrySet; 119 @Override public ImmutableSet<Entry<K, V>> entrySet() { 120 ImmutableSet<Entry< [all...] |
H A D | AbstractMapBasedMultiset.java | 84 * <p>Invoking {@link Multiset.Entry#getCount} on an entry in the returned 88 @Override public Set<Multiset.Entry<E>> entrySet() { 96 private class EntrySet extends AbstractSet<Multiset.Entry<E>> { 97 @Override public Iterator<Multiset.Entry<E>> iterator() { 98 final Iterator<Map.Entry<E, AtomicInteger>> backingEntries 100 return new Iterator<Multiset.Entry<E>>() { 101 Map.Entry<E, AtomicInteger> toRemove; 107 public Multiset.Entry<E> next() { 108 final Map.Entry<E, AtomicInteger> mapEntry = backingEntries.next(); 152 if (o instanceof Entry) { [all...] |
H A D | ConcurrentHashMultiset.java | 160 for (Multiset.Entry<E> entry : entrySet()) { 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< [all...] |
H A D | ImmutableMultiset.java | 113 for (Entry<? extends E> entry : multiset.entrySet()) { 173 final Iterator<Map.Entry<E, Integer>> mapIterator 186 Map.Entry<E, Integer> entry = mapIterator.next(); 249 for (Entry<?> entry : that.entrySet()) { 276 private transient ImmutableSet<Entry<E>> entrySet; 278 public Set<Entry<E>> entrySet() { 279 ImmutableSet<Entry<E>> es = entrySet; 283 private static class EntrySet<E> extends ImmutableSet<Entry<E>> { 290 @Override public UnmodifiableIterator<Entry<E>> iterator() { 291 final Iterator<Map.Entry< [all...] |
H A D | ForwardingMapEntry.java | 37 extends ForwardingObject implements Map.Entry<K, V> { 39 @Override protected abstract Map.Entry<K, V> delegate();
|
H A D | SingletonImmutableMap.java | 39 private transient Entry<K, V> entry; 46 SingletonImmutableMap(Entry<K, V> entry) { 52 private Entry<K, V> entry() { 53 Entry<K, V> e = entry; 78 private transient ImmutableSet<Entry<K, V>> entrySet; 80 @Override public ImmutableSet<Entry<K, V>> entrySet() { 81 ImmutableSet<Entry<K, V>> es = entrySet; 133 Entry<?, ?> entry = that.entrySet().iterator().next();
|
H A D | ImmutableSortedMap.java | 65 private static final Entry<?, ?>[] EMPTY_ARRAY = new Entry<?, ?>[0]; 94 Entry<?, ?>[] entries = { entryOf(k1, v1) }; 230 List<Entry<?, ?>> list = Lists.newArrayListWithCapacity(map.size()); 231 for (Entry<? extends K, ? extends V> entry : map.entrySet()) { 234 Entry<?, ?>[] entryArray = list.toArray(new Entry<?, ?>[list.size()]); 244 private static void sortEntries(Entry<?, ?>[] entryArray, 246 Comparator<Entry<?, ?>> entryComparator = new Comparator<Entry< [all...] |
H A D | LinkedHashMultimap.java | 81 transient Collection<Map.Entry<K, V>> linkedEntries; 128 linkedEntries = new LinkedHashSet<Map.Entry<K, V>>( 136 = new LinkedHashSet<Map.Entry<K, V>>(Maps.capacity(multimap.size())); 180 <E> Map.Entry<K, E> createEntry(@Nullable E value) { 184 <E> Collection<Map.Entry<K, E>> createEntries(Collection<E> values) { 186 Collection<Map.Entry<K, E>> entries 281 @Override Iterator<Map.Entry<K, V>> createEntryIterator() { 282 final Iterator<Map.Entry<K, V>> delegateIterator = linkedEntries.iterator(); 284 return new Iterator<Map.Entry<K, V>>() { 285 Map.Entry< [all...] |
H A D | AbstractBiMap.java | 141 for (Entry<? extends K, ? extends V> entry : map.entrySet()) { 190 final Iterator<Entry<K, V>> iterator = delegate.entrySet().iterator(); 192 Entry<K, V> entry; 262 private transient Set<Entry<K, V>> entrySet; 264 @Override public Set<Entry<K, V>> entrySet() { 265 Set<Entry<K, V>> result = entrySet; 269 private class EntrySet extends ForwardingSet<Entry<K, V>> { 270 final Set<Entry<K, V>> esDelegate = delegate.entrySet(); 272 @Override protected Set<Entry<K, V>> delegate() { 284 Entry< [all...] |
H A D | AbstractMultiset.java | 53 public abstract Set<Entry<E>> entrySet(); 59 for (Entry<E> entry : entrySet()) { 78 private final Iterator<Entry<E>> entryIterator; 79 private Entry<E> currentEntry; 121 for (Entry<E> entry : entrySet()) { 169 for (Entry<? extends E> entry : that.entrySet()) { 188 Iterator<Entry<E>> entries = entrySet().iterator(); 191 Entry<E> entry = entries.next(); 226 final Iterator<Entry<E>> entryIterator = entrySet().iterator(); 268 for (Entry< [all...] |
/external/skia/src/gl/ |
H A D | SkTextureCache.h | 85 class Entry { class in class:SkTextureCache 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* fHas [all...] |
H A D | SkTextureCache.cpp | 6 SkTextureCache::Entry::Entry(const SkBitmap& bitmap) function in class:SkTextureCache::Entry 13 SkTextureCache::Entry::~Entry() { 32 Entry* entry = fHead; 44 Entry* entry = fHead; 46 Entry* next = entry->fNext; 73 Entry** sorted = fSorted.begin(); 86 const Entry* entry = sorted[hi]; 103 SkTextureCache::Entry* SkTextureCach [all...] |
/external/srec/tools/thirdparty/OpenFst/fst/lib/ |
H A D | register.h | 47 struct Entry { struct in class:fst::FstRegister 50 Entry() : reader(0), converter(0) {} function in struct:fst::FstRegister::Entry 66 void SetEntry(const string &type, const Entry &entry) { 77 Entry LookupEntry(const string &type) const { 79 typename map<string, Entry>::const_iterator it = fst_table_.find(type); 83 return Entry(); 86 Entry GetEntry(const string &type) const { 88 Entry entry = LookupEntry(type); 113 map<string, Entry> fst_table_; 132 typedef typename FstRegister<Arc>::Entry Entr typedef in class:fst::FstRegisterer [all...] |
/external/skia/include/core/ |
H A D | SkDescriptor.h | 27 return sizeof(SkDescriptor) + entryCount * sizeof(Entry); 56 Entry* entry = (Entry*)((char*)this + fLength); 63 fLength += sizeof(Entry) + length; 81 const Entry* entry = (const Entry*)(this + 1); 92 entry = (const Entry*)((const char*)(entry + 1) + entry->fLen); 123 struct Entry { struct in class:SkDescriptor 177 + sizeof(SkDescriptor::Entry) + sizeof(SkScalerContext::Rec) // for rec 178 + sizeof(SkDescriptor::Entry) [all...] |
/external/apache-http/src/org/apache/commons/logging/impl/ |
H A D | WeakHashtable.java | 161 Map.Entry entry = (Map.Entry) it.next(); 166 Entry dereferencedEntry = new Entry(key, value); 252 Map.Entry entry = (Map.Entry) it.next(); 343 /** Entry implementation */ 344 private final static class Entry implements Map.Entry { class in class:WeakHashtable 349 private Entry(Objec method in class:WeakHashtable.Entry [all...] |