HomeSort by relevance Sort by last modified time
    Searched refs:EntrySet (Results 1 - 25 of 245) sorted by null

1 2 3 4 5 6 7 8 910

  /external/llvm/include/llvm/CodeGen/PBQP/
CostAllocator.h 91 EntrySetT EntrySet;
93 void removeEntry(PoolEntry *P) { EntrySet.erase(P); }
97 typename EntrySetT::iterator I = EntrySet.find_as(ValueKey);
99 if (I != EntrySet.end())
103 EntrySet.insert(P.get());
  /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/CodeGen/PBQP/
CostAllocator.h 91 EntrySetT EntrySet;
93 void removeEntry(PoolEntry *P) { EntrySet.erase(P); }
97 typename EntrySetT::iterator I = EntrySet.find_as(ValueKey);
99 if (I != EntrySet.end())
103 EntrySet.insert(P.get());
  /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/CodeGen/PBQP/
CostAllocator.h 91 EntrySetT EntrySet;
93 void removeEntry(PoolEntry *P) { EntrySet.erase(P); }
97 typename EntrySetT::iterator I = EntrySet.find_as(ValueKey);
99 if (I != EntrySet.end())
103 EntrySet.insert(P.get());
  /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/CodeGen/PBQP/
CostAllocator.h 91 EntrySetT EntrySet;
93 void removeEntry(PoolEntry *P) { EntrySet.erase(P); }
97 typename EntrySetT::iterator I = EntrySet.find_as(ValueKey);
99 if (I != EntrySet.end())
103 EntrySet.insert(P.get());
  /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/CodeGen/PBQP/
CostAllocator.h 91 EntrySetT EntrySet;
93 void removeEntry(PoolEntry *P) { EntrySet.erase(P); }
97 typename EntrySetT::iterator I = EntrySet.find_as(ValueKey);
99 if (I != EntrySet.end())
103 EntrySet.insert(P.get());
  /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/CodeGen/PBQP/
CostAllocator.h 91 EntrySetT EntrySet;
93 void removeEntry(PoolEntry *P) { EntrySet.erase(P); }
97 typename EntrySetT::iterator I = EntrySet.find_as(ValueKey);
99 if (I != EntrySet.end())
103 EntrySet.insert(P.get());
  /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/CodeGen/PBQP/
CostAllocator.h 91 EntrySetT EntrySet;
93 void removeEntry(PoolEntry *P) { EntrySet.erase(P); }
97 typename EntrySetT::iterator I = EntrySet.find_as(ValueKey);
99 if (I != EntrySet.end())
103 EntrySet.insert(P.get());
  /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/CodeGen/PBQP/
CostAllocator.h 91 EntrySetT EntrySet;
93 void removeEntry(PoolEntry *P) { EntrySet.erase(P); }
97 typename EntrySetT::iterator I = EntrySet.find_as(ValueKey);
99 if (I != EntrySet.end())
103 EntrySet.insert(P.get());
  /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/CodeGen/PBQP/
CostAllocator.h 91 EntrySetT EntrySet;
93 void removeEntry(PoolEntry *P) { EntrySet.erase(P); }
97 typename EntrySetT::iterator I = EntrySet.find_as(ValueKey);
99 if (I != EntrySet.end())
103 EntrySet.insert(P.get());
  /external/guava/guava/src/com/google/common/collect/
WellBehavedMap.java 29 * intention of using its {@code entrySet()} method, you should
39 private Set<Entry<K, V>> entrySet;
47 * intercepts its {@code entrySet()} method by taking the
59 @Override public Set<Entry<K, V>> entrySet() {
60 Set<Entry<K, V>> es = entrySet;
64 return entrySet = new EntrySet();
67 private final class EntrySet extends Maps.EntrySet<K, V> {
FilteredKeySetMultimap.java 67 return new EntrySet();
70 class EntrySet extends Entries implements Set<Entry<K, V>> {
RegularImmutableSortedMap.java 51 return new EntrySet();
54 private class EntrySet extends ImmutableMapEntrySet<K, V> {
73 return EntrySet.this;
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;
169 entrySet = result = createEntrySet();
174 class EntrySet extends Multisets.EntrySet<E>
    [all...]
DescendingMultiset.java 102 private transient Set<Entry<E>> entrySet;
104 @Override public Set<Entry<E>> entrySet() {
105 Set<Entry<E>> result = entrySet;
106 return (result == null) ? entrySet = createEntrySet() : result;
110 return new Multisets.EntrySet<E>() {
120 return forwardMultiset().entrySet().size();
138 return entrySet().toString();
AbstractMultimap.java 113 return new EntrySet();
131 private class EntrySet extends Entries implements Set<Entry<K, V>> {
RegularImmutableMap.java 185 return new EntrySet();
189 private class EntrySet extends ImmutableMapEntrySet<K, V> {
ConcurrentHashMultiset.java 191 for (Multiset.Entry<E> entry : entrySet()) {
476 return new EntrySet();
492 private Iterator<Map.Entry<E, AtomicInteger>> mapEntries = countMap.entrySet().iterator();
532 private class EntrySet extends AbstractMultiset<E>.EntrySet {
ImmutableMultiset.java 195 return copyFromEntries(multiset.entrySet());
239 final Iterator<Entry<E>> entryIterator = entrySet().iterator();
323 for (Multiset.Entry<E> entry : entrySet()) {
335 return Sets.hashCodeImpl(entrySet());
339 return entrySet().toString();
342 private transient ImmutableSet<Entry<E>> entrySet;
345 public ImmutableSet<Entry<E>> entrySet() {
346 ImmutableSet<Entry<E>> es = entrySet;
347 return (es == null) ? (entrySet = createEntrySet()) : es;
351 return isEmpty() ? ImmutableSet.<Entry<E>>of() : new EntrySet();
    [all...]
  /external/guava/guava-tests/benchmark/com/google/common/collect/
ConcurrentHashMultisetBenchmark.java 227 for (Multiset.Entry<E> entry : entrySet()) {
431 private transient EntrySet entrySet;
433 @Override public Set<Multiset.Entry<E>> entrySet() {
434 EntrySet result = entrySet;
436 entrySet = result = new EntrySet();
451 countMap.entrySet().iterator();
473 private class EntrySet extends AbstractMultiset<E>.EntrySet
    [all...]
  /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
DescendingMultiset.java 102 private transient Set<Entry<E>> entrySet;
104 @Override public Set<Entry<E>> entrySet() {
105 Set<Entry<E>> result = entrySet;
106 return (result == null) ? entrySet = createEntrySet() : result;
110 return new Multisets.EntrySet<E>() {
120 return forwardMultiset().entrySet().size();
138 return entrySet().toString();
ImmutableMultiset.java 194 return copyFromEntries(multiset.entrySet());
238 final Iterator<Entry<E>> entryIterator = entrySet().iterator();
324 return Sets.hashCodeImpl(entrySet());
328 return entrySet().toString();
331 private transient ImmutableSet<Entry<E>> entrySet;
334 public ImmutableSet<Entry<E>> entrySet() {
335 ImmutableSet<Entry<E>> es = entrySet;
336 return (es == null) ? (entrySet = createEntrySet()) : es;
340 return isEmpty() ? ImmutableSet.<Entry<E>>of() : new EntrySet();
345 private final class EntrySet extends ImmutableSet<Entry<E>>
    [all...]
ImmutableSetMultimap.java 222 : multimap.asMap().entrySet()) {
264 builderMultimap.asMap().entrySet());
317 : multimap.asMap().entrySet()) {
415 ? (entries = new EntrySet<K, V>(this))
419 private static final class EntrySet<K, V> extends ImmutableSet<Entry<K, V>> {
422 EntrySet(ImmutableSetMultimap<K, V> multimap) {
  /external/protobuf/java/core/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();
640 return entrySet().equals(other.entrySet())
    [all...]
  /frameworks/base/core/java/android/util/
MapCollections.java 34 EntrySet mEntrySet;
168 final class EntrySet implements Set<Map.Entry<K, V>> {
534 mEntrySet = new EntrySet();
  /frameworks/support/compat/java/android/support/v4/util/
MapCollections.java 31 EntrySet mEntrySet;
165 final class EntrySet implements Set<Map.Entry<K, V>> {
532 mEntrySet = new EntrySet();

Completed in 4885 milliseconds

1 2 3 4 5 6 7 8 910