| /external/llvm/lib/Target/X86/ |
| X86TargetTransformInfo.cpp | 129 if (const auto *Entry = CostTableLookup(AVX2UniformConstCostTable, ISD,
131 return LT.first * Entry->Cost;
144 if (const auto *Entry = CostTableLookup(AVX512CostTable, ISD, LT.second))
145 return LT.first * Entry->Cost;
172 if (const auto *Entry = CostTableLookup(AVX2CostTable, ISD, LT.second))
173 return LT.first * Entry->Cost;
207 if (const auto *Entry = CostTableLookup(XOPCostTable, ISD, LT.second))
208 return LT.first * Entry->Cost;
236 if (const auto *Entry = CostTableLookup(AVX2CustomCostTable, ISD,
238 return LT.first * Entry->Cost
[all...] |
| /developers/build/prebuilts/gradle/DisplayingBitmaps/Application/src/main/java/com/example/android/displayingbitmaps/util/ |
| DiskLruCache.java | 59 * entry has a string key and a fixed number of values. Values are byte
75 * <p>Clients call {@link #edit} to create or update the values of an entry. An
76 * entry may have only one editor at one time; if a value is not available to be
79 * <li>When an entry is being <strong>created</strong> it is necessary to
82 * <li>When an entry is being <strong>edited</strong>, it is not necessary
90 * <p>Clients call {@link #get} to read a snapshot of an entry. The read will
136 * cache entry. Each line contains space-separated values: a state, a key,
138 * o DIRTY lines track that an entry is actively being created or updated.
142 * o CLEAN lines track a cache entry that has been successfully published
162 private final LinkedHashMap<String, Entry> lruEntrie
380 Entry entry = lruEntries.get(key); local
406 Entry entry = i.next(); local
476 Entry entry = lruEntries.get(key); local
520 Entry entry = lruEntries.get(key); local
566 Entry entry = editor.entry; local
634 Entry entry = lruEntries.get(key); local
775 private final Entry entry; field in class:DiskLruCache.Editor
[all...] |
| /developers/samples/android/ui/graphics/DisplayingBitmaps/Application/src/main/java/com/example/android/displayingbitmaps/util/ |
| DiskLruCache.java | 59 * entry has a string key and a fixed number of values. Values are byte
75 * <p>Clients call {@link #edit} to create or update the values of an entry. An
76 * entry may have only one editor at one time; if a value is not available to be
79 * <li>When an entry is being <strong>created</strong> it is necessary to
82 * <li>When an entry is being <strong>edited</strong>, it is not necessary
90 * <p>Clients call {@link #get} to read a snapshot of an entry. The read will
136 * cache entry. Each line contains space-separated values: a state, a key,
138 * o DIRTY lines track that an entry is actively being created or updated.
142 * o CLEAN lines track a cache entry that has been successfully published
162 private final LinkedHashMap<String, Entry> lruEntrie
380 Entry entry = lruEntries.get(key); local
406 Entry entry = i.next(); local
476 Entry entry = lruEntries.get(key); local
520 Entry entry = lruEntries.get(key); local
566 Entry entry = editor.entry; local
634 Entry entry = lruEntries.get(key); local
775 private final Entry entry; field in class:DiskLruCache.Editor
[all...] |
| /development/samples/browseable/DisplayingBitmaps/src/com.example.android.displayingbitmaps/util/ |
| DiskLruCache.java | 59 * entry has a string key and a fixed number of values. Values are byte
75 * <p>Clients call {@link #edit} to create or update the values of an entry. An
76 * entry may have only one editor at one time; if a value is not available to be
79 * <li>When an entry is being <strong>created</strong> it is necessary to
82 * <li>When an entry is being <strong>edited</strong>, it is not necessary
90 * <p>Clients call {@link #get} to read a snapshot of an entry. The read will
136 * cache entry. Each line contains space-separated values: a state, a key,
138 * o DIRTY lines track that an entry is actively being created or updated.
142 * o CLEAN lines track a cache entry that has been successfully published
162 private final LinkedHashMap<String, Entry> lruEntrie
380 Entry entry = lruEntries.get(key); local
406 Entry entry = i.next(); local
476 Entry entry = lruEntries.get(key); local
520 Entry entry = lruEntries.get(key); local
566 Entry entry = editor.entry; local
634 Entry entry = lruEntries.get(key); local
775 private final Entry entry; field in class:DiskLruCache.Editor
[all...] |
| /external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/interpolation/ |
| MicrosphereInterpolatingFunction.java | 73 private Map.Entry<RealVector, Double> brightestSample;
105 final Map.Entry<RealVector, Double> sample) {
124 Map.Entry<RealVector, Double> sample() {
198 for (Map.Entry<RealVector, Double> sd : samples.entrySet()) {
222 final Map.Entry<RealVector, Double> sd = md.sample();
|
| /external/glide/third_party/disklrucache/src/main/java/com/bumptech/glide/disklrucache/ |
| DiskLruCache.java | 43 * entry has a string key and a fixed number of values. Each key must match
60 * <p>Clients call {@link #edit} to create or update the values of an entry. An
61 * entry may have only one editor at one time; if a value is not available to be
64 * <li>When an entry is being <strong>created</strong> it is necessary to
67 * <li>When an entry is being <strong>edited</strong>, it is not necessary
75 * <p>Clients call {@link #get} to read a snapshot of an entry. The read will
119 * cache entry. Each line contains space-separated values: a state, a key,
121 * o DIRTY lines track that an entry is actively being created or updated.
125 * o CLEAN lines track a cache entry that has been successfully published
146 private final LinkedHashMap<String, Entry> lruEntries
300 Entry entry = lruEntries.get(key); local
327 Entry entry = i.next(); local
408 Entry entry = lruEntries.get(key); local
446 Entry entry = lruEntries.get(key); local
502 Entry entry = editor.entry; local
582 Entry entry = lruEntries.get(key); local
706 private final Entry entry; field in class:DiskLruCache.Editor
[all...] |
| /external/guava/guava/src/com/google/common/collect/ |
| ImmutableMultimap.java | 34 import java.util.Map.Entry;
74 * Returns an immutable multimap containing a single entry.
175 * Adds an entry to the built multimap.
179 public Builder<K, V> put(Entry<? extends K, ? extends V> entry) {
180 return put(entry.getKey(), entry.getValue());
193 "null key in entry: null=" + Iterables.toString(values));
223 for (Entry<? extends K, ? extends Collection<? extends V>> entry
523 Entry<?, ?> entry = (Entry<?, ?>) object; local
[all...] |
| TreeRangeSet.java | 28 import java.util.Map.Entry;
99 Entry<Cut<C>, Range<C>> floorEntry = rangesByLowerBound.floorEntry(Cut.belowValue(value));
111 Entry<Cut<C>, Range<C>> floorEntry = rangesByLowerBound.floorEntry(range.lowerBound);
118 Entry<Cut<C>, Range<C>> floorEntry = rangesByLowerBound.floorEntry(range.lowerBound);
126 Entry<Cut<C>, Range<C>> firstEntry = rangesByLowerBound.firstEntry();
127 Entry<Cut<C>, Range<C>> lastEntry = rangesByLowerBound.lastEntry();
147 Entry<Cut<C>, Range<C>> entryBelowLB = rangesByLowerBound.lowerEntry(lbToAdd);
165 Entry<Cut<C>, Range<C>> entryBelowUB = rangesByLowerBound.floorEntry(ubToAdd);
192 Entry<Cut<C>, Range<C>> entryBelowLB = rangesByLowerBound.lowerEntry(rangeToRemove.lowerBound);
209 Entry<Cut<C>, Range<C>> entryBelowUB = rangesByLowerBound.floorEntry(rangeToRemove.upperBound)
[all...] |
| /external/guava/guava-testlib/src/com/google/common/collect/testing/google/ |
| ListMultimapTestSuiteBuilder.java | 36 import java.util.Map.Entry;
69 OneSizeTestContainerGenerator<ListMultimap<K, V>, Entry<K, V>>> parentBuilder) {
81 OneSizeTestContainerGenerator<ListMultimap<K, V>, Entry<K, V>>> parentBuilder) {
112 OneSizeTestContainerGenerator<ListMultimap<K, V>, Entry<K, V>> multimapGenerator) {
127 OneSizeTestContainerGenerator<ListMultimap<K, V>, Entry<K, V>> multimapGenerator) {
|
| MultisetEntrySetTester.java | 55 Iterator<Multiset.Entry<E>> iterator = getMultiset().entrySet().iterator();
59 assertEquals("multiset.entrySet() iterator.next() returned incorrect entry",
79 "multiset contains element after removing its entry",
91 "multiset didn't contain element after removing a missing entry",
103 "multiset contains element after removing its entry",
115 "multiset didn't contain element after removing a missing entry",
127 "multiset doesn't contains element after retaining its entry",
139 "multiset contains element after retaining a different entry",
149 Multiset.Entry<E> entry = Iterables.getOnlyElement(getMultiset().entrySet()) local
163 Multiset.Entry<E> entry = Iterables.getOnlyElement(getMultiset().entrySet()); local
182 Multiset.Entry<E> entry = Iterables.getOnlyElement(getMultiset().entrySet()); local
194 Multiset.Entry<E> entry = Iterables.getOnlyElement(getMultiset().entrySet()); local
207 Multiset.Entry<E> entry = entryItr.next(); local
218 Multiset.Entry<E> entry = Iterables.getOnlyElement(getMultiset().entrySet()); local
230 Multiset.Entry<E> entry = Iterables.getOnlyElement(getMultiset().entrySet()); local
244 Multiset.Entry<E> entry = Iterables.getOnlyElement(getMultiset().entrySet()); local
[all...] |
| /external/guava/guava-tests/test/com/google/common/collect/ |
| LinkedListMultimapTest.java | 50 import java.util.Map.Entry;
67 protected ListMultimap<String, String> create(Entry<String, String>[] entries) {
69 for (Entry<String, String> entry : entries) {
70 multimap.put(entry.getKey(), entry.getValue());
281 Iterator<Map.Entry<String, Integer>> entries = map.entries().iterator();
282 Map.Entry<String, Integer> entry = entries.next(); local
283 assertEquals("bar", entry.getKey())
304 Map.Entry<String, Collection<Integer>> entry = entries.next(); local
[all...] |
| SimpleAbstractMultisetTest.java | 110 Iterator<Entry<E>> entryIterator() {
111 final Iterator<Map.Entry<E, Integer>> backingEntries = backingMap.entrySet().iterator();
112 return new UnmodifiableIterator<Multiset.Entry<E>>() {
119 public Multiset.Entry<E> next() {
120 final Map.Entry<E, Integer> mapEntry = backingEntries.next();
|
| TreeRangeMapTest.java | 34 import java.util.Map.Entry;
49 public SampleElements<Entry<Range<Integer>, String>> samples() {
50 return new SampleElements<Entry<Range<Integer>, String>>(
63 Entry<Range<Integer>, String> entry = (Entry<Range<Integer>, String>) o;
64 rangeMap.put(entry.getKey(), entry.getValue());
71 public Entry<Range<Integer>, String>[] createArray(int length) {
72 return new Entry[length]
453 Map.Entry<Range<Integer>, Integer> entry = test.getEntry(i); local
[all...] |
| /external/llvm/test/MC/ARM/ |
| eh-directive-unwind_raw.s | 61 @ CHECK: Entry {
69 @ CHECK: Entry {
78 @ CHECK: Entry {
90 @ CHECK: Entry {
98 @ CHECK: Entry {
|
| /external/oauth/core/src/main/java/net/oauth/http/ |
| HttpMessage.java | 58 public final List<Map.Entry<String, String>> headers = new ArrayList<Map.Entry<String, String>>();
68 for (Map.Entry<String, String> header : headers) {
85 for (Iterator<Map.Entry<String, String>> i = headers.iterator(); i.hasNext();) {
86 Map.Entry<String, String> header = i.next();
146 /** The name of a dump entry whose value is the HTTP request. */
149 /** The name of a dump entry whose value is the HTTP response. */
|
| /external/protobuf/java/src/test/java/com/google/protobuf/ |
| SmallSortedMapTest.java | 50 private static class SimpleEntry<K, V> implements Map.Entry<K, V> {
79 if (!(o instanceof Map.Entry))
81 Map.Entry e = (Map.Entry) o;
216 Map.Entry<Integer, Integer> entry = map.getArrayEntryAt(i); local
217 assertEquals(new Integer(i), entry.getKey());
218 assertEquals(new Integer(i + 1), entry.getValue());
220 Iterator<Map.Entry<Integer, Integer>> it =
224 Map.Entry<Integer, Integer> entry = it.next() local
249 Map.Entry<Integer, Integer> entry = local
269 Map.Entry<Integer, Integer> entry = local
300 Map.Entry<Integer, Integer> entry = it.next(); local
329 Map.Entry<Integer, Integer> entry = it.next(); local
381 Map.Entry<Integer, Integer> entry = it.next(); local
[all...] |
| /external/robolectric/v1/src/main/java/com/xtremelabs/robolectric/util/ |
| SQLite.java | 10 import java.util.Map.Entry;
149 Iterator<Entry<String, Object>> itemEntries = values.valueSet().iterator();
151 Entry<String, Object> entry = itemEntries.next(); local
152 clause.append(entry.getKey());
156 columnValues.add(entry.getValue());
178 Iterator<Entry<String, Object>> itemsEntries = values.valueSet().iterator();
180 Entry<String, Object> entry = itemsEntries.next(); local
181 clause.append(entry.getKey())
[all...] |
| /frameworks/base/tests/Camera2Tests/SmartCamera/SimpleCamera/src/androidx/media/filterfw/ |
| Signature.java | 22 import java.util.Map.Entry;
146 for (Entry<String, PortInfo> entry : mInputPorts.entrySet()) {
147 stringBuffer.append(entry.getValue().toString("input", entry.getKey()) + "\n");
149 for (Entry<String, PortInfo> entry : mOutputPorts.entrySet()) {
150 stringBuffer.append(entry.getValue().toString("output", entry.getKey()) + "\n");
175 for (Entry<String, PortInfo> entry : mInputPorts.entrySet())
[all...] |
| /packages/apps/Gallery2/src/com/android/gallery3d/gadget/ |
| PhotoAppWidgetProvider.java | 33 import com.android.gallery3d.gadget.WidgetDatabaseHelper.Entry;
40 static RemoteViews buildWidget(Context context, int id, Entry entry) {
42 switch (entry.type) {
45 return buildStackWidget(context, id, entry);
47 return buildFrameWidget(context, id, entry);
49 throw new RuntimeException("invalid type - " + entry.type);
64 Entry entry = helper.getEntry(id); local
65 if (entry != null)
[all...] |
| /external/guice/extensions/multibindings/src/com/google/inject/multibindings/ |
| MapBinder.java | 67 import java.util.Map.Entry;
232 @SuppressWarnings("unchecked") // a provider entry <K, V> is safely a Map.Entry<K, Provider<V>>
233 static <K, V> TypeLiteral<Map.Entry<K, Provider<V>>> entryOfProviderOf(
235 return (TypeLiteral<Entry<K, Provider<V>>>) TypeLiteral.get(newParameterizedTypeWithOwner(
236 Map.class, Entry.class, keyType.getType(), Types.providerOf(valueType.getType())));
253 Multibinder<Entry<K, Provider<V>>> entrySetBinder) {
278 * Returns a binding builder used to add a new entry in the map. Each
298 * a corresponding map whose values are providers. It uses the entry set
308 * <p>Rather than binding a single Map.Entry<K, V>, the map binde
[all...] |
| /external/guava/guava-testlib/src/com/google/common/collect/testing/ |
| MapTestSuiteBuilder.java | 61 TestMapGenerator<K, V>, Map<K, V>, Map.Entry<K, V>> {
92 ? extends OneSizeTestContainerGenerator<Map<K, V>, Map.Entry<K, V>>>
135 protected SetTestSuiteBuilder<Map.Entry<K, V>> createDerivedEntrySetSuite(
136 TestSetGenerator<Map.Entry<K, V>> entrySetGenerator) {
232 private final OneSizeTestContainerGenerator<Map<K, V>, Map.Entry<K, V>>
237 Map<K, V>, Map.Entry<K, V>> mapGenerator) {
242 public SampleElements<Map.Entry<K, V>> samples() {
247 public Map.Entry<K, V>[] createArray(int length) {
252 public Iterable<Map.Entry<K, V>> order(
253 List<Map.Entry<K, V>> insertionOrder)
[all...] |
| Helpers.java | 42 import java.util.Map.Entry;
75 public static <K, V> Entry<K, V> mapEntry(K key, V value) {
170 public static <K, V> Comparator<Entry<K, V>> entryComparator(
172 return new Comparator<Entry<K, V>>() {
175 public int compare(Entry<K, V> a, Entry<K, V> b) {
253 * Returns a "nefarious" map entry with the specified key and value,
254 * meaning an entry that is suitable for testing that map entries cannot be
257 * possible to access the raw (modifiable) map entry via a nefarious equals
260 public static <K, V> Map.Entry<K, V> nefariousMapEntry(final K key
[all...] |
| /external/clang/include/clang/Basic/ |
| IdentifierTable.h | 75 llvm::StringMapEntry<IdentifierInfo*> *Entry;
98 if (Entry) return Entry->getKeyData();
111 if (Entry) return Entry->getKeyLength();
144 /// moment. In this case there should be an entry for the identifier in the
462 auto &Entry = *HashTable.insert(std::make_pair(Name, nullptr)).first;
464 IdentifierInfo *&II = Entry.second;
467 // No entry; if we have an external lookup, look there first.
480 II->Entry = &Entry
[all...] |
| /external/clang/lib/Serialization/ |
| ModuleManager.cpp | 32 const FileEntry *Entry = FileMgr.getFile(Name, /*openFile=*/false,
34 if (Entry)
35 return lookup(Entry);
51 const FileEntry *Entry = FileMgr.getFile(Name, /*openFile=*/false,
53 return std::move(InMemoryBuffers[Entry]);
67 // Look for the file entry. This only fails if the expected size or
69 const FileEntry *Entry;
77 if (lookupModuleFile(FileName, ExpectedSize, ExpectedModTime, Entry)) {
82 if (!Entry && FileName != "-") {
88 ModuleFile *&ModuleEntry = Modules[Entry];
[all...] |
| /external/guava/guava-gwt/test-super/com/google/common/collect/testing/super/com/google/common/collect/testing/ |
| Helpers.java | 40 import java.util.Map.Entry;
73 public static <K, V> Entry<K, V> mapEntry(K key, V value) {
168 public static <K, V> Comparator<Entry<K, V>> entryComparator(
170 return new Comparator<Entry<K, V>>() {
173 public int compare(Entry<K, V> a, Entry<K, V> b) {
251 * Returns a "nefarious" map entry with the specified key and value,
252 * meaning an entry that is suitable for testing that map entries cannot be
255 * possible to access the raw (modifiable) map entry via a nefarious equals
258 public static <K, V> Map.Entry<K, V> nefariousMapEntry(final K key
[all...] |
