| /external/guava/guava-tests/test/com/google/common/collect/ |
| ConstrainedSetMultimapTest.java | 31 import java.util.Map.Entry;
55 protected SetMultimap<String, String> create(Entry<String, String>[] entries) {
57 for (Entry<String, String> entry : entries) {
58 multimap.put(entry.getKey(), entry.getValue());
|
| MultisetsImmutableEntryTest.java | 20 import com.google.common.collect.Multiset.Entry;
35 private static <E> Entry<E> entry(final E element, final int count) { method in class:MultisetsImmutableEntryTest
39 private static <E> Entry<E> control(E element, int count) {
45 assertEquals("foo", entry("foo", 1).toString());
46 assertEquals("bar x 2", entry("bar", 2).toString());
50 assertEquals("null", entry(NE, 1).toString());
51 assertEquals("null x 2", entry(NE, 2).toString());
55 assertEquals(control("foo", 1), entry("foo", 1));
56 assertEquals(control("bar", 2), entry("bar", 2))
64 assertEquals(control(NE, 1), entry(NE, 1)); method
[all...] |
| AbstractMapEntryTest.java | 24 import java.util.Map.Entry;
36 private static <K, V> Entry<K, V> entry(final K key, final V value) { method in class:AbstractMapEntryTest
47 private static <K, V> Entry<K, V> control(K key, V value) {
52 assertEquals("foo=1", entry("foo", 1).toString());
56 assertEquals("null=1", entry(NK, 1).toString());
57 assertEquals("foo=null", entry("foo", NV).toString());
58 assertEquals("null=null", entry(NK, NV).toString());
62 Entry<String, Integer> foo1 = entry("foo", 1)
[all...] |
| FilteredMultimapTest.java | 26 import java.util.Map.Entry;
36 private static final Predicate<Map.Entry<String, Integer>> ENTRY_PREDICATE
37 = new Predicate<Map.Entry<String, Integer>>() {
38 @Override public boolean apply(Entry<String, Integer> entry) {
39 return !"badkey".equals(entry.getKey()) && !((Integer) 55556).equals(entry.getValue());
|
| /external/llvm/lib/Analysis/ |
| MemoryDependenceAnalysis.cpp | 69 /// If the set becomes empty, remove Inst's entry.
216 // No dependence found. If this is the entry block of the function, it is
670 // No dependence found. If this is the entry block of the function, it is
683 // If the cached entry is non-dirty, just return it. Note that this depends
688 // Otherwise, if we have a dirty entry, we know we can start the scan at that
700 // No dependence found. If this is the entry block of the function, it is
760 // Okay, we have a cache entry. If we know it is not dirty, just return it
769 for (auto &Entry : Cache)
770 if (Entry.getResult().isDirty())
771 DirtyBlocks.push_back(Entry.getBB())
[all...] |
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Analysis/ |
| MemoryDependenceAnalysis.cpp | 98 /// If the set becomes empty, remove Inst's entry.
235 // No dependence found. If this is the entry block of the function, it is
706 // No dependence found. If this is the entry block of the function, it is
719 // If the cached entry is non-dirty, just return it. Note that this depends
724 // Otherwise, if we have a dirty entry, we know we can start the scan at that
736 // No dependence found. If this is the entry block of the function, it is
796 // Okay, we have a cache entry. If we know it is not dirty, just return it
805 for (auto &Entry : Cache)
806 if (Entry.getResult().isDirty())
807 DirtyBlocks.push_back(Entry.getBB())
[all...] |
| SyntheticCountsUtils.cpp | 26 // Given an SCC, propagate entry counts along the edge of the SCC nodes.
71 for (auto &Entry : AdditionalCounts)
72 AddCount(Entry.first, Entry.second);
87 /// Propgate synthetic entry counts on a callgraph \p CG.
90 /// SCC, it first propagates the entry counts to the nodes within the SCC
91 /// through call edges and updates them in one shot. Then the entry counts are
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Transforms/Vectorize/ |
| VPlanVerifier.cpp | 99 const VPBlockBase *Entry = Region->getEntry();
102 // Entry and Exit shouldn't have any predecessor/successor, respectively.
103 assert(!Entry->getNumPredecessors() && "Region entry has predecessors.");
105 (void)Entry;
|
| /external/testng/src/main/java/org/testng/internal/ |
| ResultMap.java | 11 import java.util.Map.Entry;
31 for (Map.Entry<ITestResult, ITestNGMethod> entry : m_map.entrySet()) {
32 if (entry.getValue().equals(method)) {
33 result.add(entry.getKey());
42 for (Entry<ITestResult, ITestNGMethod> entry : m_map.entrySet()) {
43 if (entry.getValue().equals(m)) {
44 m_map.remove(entry.getKey());
|
| /frameworks/av/media/libnblog/include/media/nblog/ |
| Writer.h | 37 class Entry;
85 // Writes a single Entry to the FIFO if the writer is enabled.
88 virtual void log(const Entry &entry, bool trusted = false);
92 // Log a single Entry with corresponding event, data, and length.
97 // helper functions for logging parts of a formatted entry
131 void log(const Entry &entry, bool trusted = false) override;
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/X86/ |
| X86TargetTransformInfo.cpp | 192 if (const auto *Entry = CostTableLookup(GLMCostTable, ISD,
194 return LT.first * Entry->Cost;
241 if (const auto *Entry = CostTableLookup(SLMCostTable, ISD,
243 return LT.first * Entry->Cost;
302 if (const auto *Entry = CostTableLookup(AVX512BWUniformConstCostTable, ISD,
304 return LT.first * Entry->Cost;
320 if (const auto *Entry = CostTableLookup(AVX512UniformConstCostTable, ISD,
322 return LT.first * Entry->Cost;
344 if (const auto *Entry = CostTableLookup(AVX2UniformConstCostTable, ISD,
346 return LT.first * Entry->Cost
[all...] |
| /cts/tools/release-parser/src/com/android/cts/releaseparser/ |
| BuildPropParser.java | 30 private Entry.EntryType mType;
38 public Entry.EntryType getType() {
103 mType = Entry.EntryType.BUILD_PROP;
128 Entry.Builder fileEntryBuilder = aParser.getFileEntryBuilder();
|
| DepPrinter.java | 35 private TreeMap<String, Entry> mTreeEntryMap;
49 mTreeEntryMap = new TreeMap<String, Entry>(mRelContent.getEntries());
59 for (Entry entry : mRelContent.getEntries().values()) {
60 if (entry.getType() == Entry.EntryType.EXE) {
61 String exeName = entry.getName();
63 writeDigraph(entry, fileName);
75 for (Entry entry : mRelContent.getEntries().values())
[all...] |
| /developers/build/prebuilts/gradle/BasicSyncAdapter/Application/src/main/java/com/example/android/basicsyncadapter/provider/ |
| FeedContract.java | 42 * Path component for "entry"-type resources..
49 public static class Entry implements BaseColumns {
59 ContentResolver.CURSOR_ITEM_BASE_TYPE + "/vnd.basicsyncadapter.entry";
62 * Fully qualified URI for "entry" resources.
68 * Table name where records are stored for "entry" resources.
70 public static final String TABLE_NAME = "entry";
|
| /developers/samples/android/connectivity/sync/BasicSyncAdapter/Application/src/main/java/com/example/android/basicsyncadapter/provider/ |
| FeedContract.java | 42 * Path component for "entry"-type resources..
49 public static class Entry implements BaseColumns {
59 ContentResolver.CURSOR_ITEM_BASE_TYPE + "/vnd.basicsyncadapter.entry";
62 * Fully qualified URI for "entry" resources.
68 * Table name where records are stored for "entry" resources.
70 public static final String TABLE_NAME = "entry";
|
| /development/samples/browseable/BasicSyncAdapter/src/com.example.android.basicsyncadapter/provider/ |
| FeedContract.java | 42 * Path component for "entry"-type resources..
49 public static class Entry implements BaseColumns {
59 ContentResolver.CURSOR_ITEM_BASE_TYPE + "/vnd.basicsyncadapter.entry";
62 * Fully qualified URI for "entry" resources.
68 * Table name where records are stored for "entry" resources.
70 public static final String TABLE_NAME = "entry";
|
| /device/linaro/bootloader/edk2/ArmPlatformPkg/ArmJunoPkg/Drivers/ArmJunoDxe/ |
| AcpiTables.c | 27 EFI_ACPI_MEMORY_MAPPED_ENHANCED_CONFIGURATION_SPACE_BASE_ADDRESS_ALLOCATION_STRUCTURE Entry;
|
| /device/linaro/bootloader/edk2/EmbeddedPkg/Drivers/AndroidFastbootTransportTcpDxe/ |
| FastbootTransportTcp.c | 218 // Fatal receive error. Put an entry with NULL in the queue, signifying
470 FASTBOOT_TCP_PACKET_LIST *Entry;
514 Entry = (FASTBOOT_TCP_PACKET_LIST *) GetFirstNode (&mPacketListHead);
515 while (!IsNull (&mPacketListHead, &Entry->Link)) {
516 NextEntry = (FASTBOOT_TCP_PACKET_LIST *) GetNextNode (&mPacketListHead, &Entry->Link);
518 RemoveEntryList (&Entry->Link);
519 if (Entry->Buffer) {
520 FreePool (Entry->Buffer);
522 FreePool (Entry);
524 Entry = NextEntry;
[all...] |
| /external/cldr/tools/java/org/unicode/cldr/util/ |
| VariableAndPathParser.java | 30 * Given a node, extract a variable definition, and return it as a Map.Entry
32 * @return a Map.Entry with the variable name as key, and its value as value
34 Map.Entry<String, String> extractVariable(Node aNode);
52 Map.Entry<E, F> extractPath(Node aNode);
101 Map.Entry<String, String> curVar = variableExtractor.extractVariable(aNode);
128 Map.Entry<E, F> p = pathExtractor.extractPath(aNode);
|
| /external/guava/guava/src/com/google/common/collect/ |
| AbstractBiMap.java | 161 for (Entry<? extends K, ? extends V> entry : map.entrySet()) {
162 put(entry.getKey(), entry.getValue());
250 private transient Set<Entry<K, V>> entrySet;
252 @Override public Set<Entry<K, V>> entrySet() {
253 Set<Entry<K, V>> result = entrySet;
257 private class EntrySet extends ForwardingSet<Entry<K, V>> {
258 final Set<Entry<K, V>> esDelegate = delegate.entrySet();
260 @Override protected Set<Entry<K, V>> delegate()
274 Entry<?, ?> entry = (Entry<?, ?>) object; local
[all...] |
| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| ImmutableEnumMap.java | 31 for (Map.Entry<K, V> entry : checkNotNull(map).entrySet()) {
32 checkNotNull(entry.getKey());
33 checkNotNull(entry.getValue());
|
| /external/guava/guava-testlib/src/com/google/common/collect/testing/google/ |
| MultisetTestSuiteBuilder.java | 22 import com.google.common.collect.Multiset.Entry;
197 static class EntrySetGenerator<E> implements TestSetGenerator<Multiset.Entry<E>> {
205 public SampleElements<Multiset.Entry<E>> samples() {
207 return new SampleElements<Multiset.Entry<E>>(
216 public Set<Multiset.Entry<E>> create(Object... entries) {
221 Multiset.Entry<E> entry = (Entry<E>) o; local
222 checkArgument(elements.add(entry.getElement()),
224 for (int i = 0; i < entry.getCount(); i++)
242 map.put(entry.getElement(), entry); local
[all...] |
| TestBiMapGenerator.java | 32 extends TestContainerGenerator<BiMap<K, V>, Map.Entry<K, V>> {
|
| /external/llvm/lib/CodeGen/ |
| MachineRegionInfo.cpp | 24 MachineRegion::MachineRegion(MachineBasicBlock *Entry, MachineBasicBlock *Exit,
27 RegionBase<RegionTraits<MachineFunction>>(Entry, Exit, RI, DT, Parent) {
62 MachineBasicBlock *Entry = GraphTraits<MachineFunction*>::getEntryNode(&F);
64 TopLevelRegion = new MachineRegion(Entry, nullptr, this, DT, nullptr);
124 "Detect single entry single exit regions", true, true)
129 "Detect single entry single exit regions", true, true)
|
| /external/llvm/tools/llvm-dwp/ |
| llvm-dwp.cpp | 184 DWARFUnitIndex::Entry::SectionContribution Contributions[8];
191 const DWARFUnitIndex::Entry &Entry,
193 const auto *Off = Entry.getOffset(Kind);
204 for (const DWARFUnitIndex::Entry &E : TUIndex.getRows()) {
211 auto &Entry = P.first->second;
213 Entry.Contributions[0] = {};
215 auto &C = Entry.Contributions[Kind - DW_SECT_INFO];
220 auto &C = Entry.Contributions[DW_SECT_TYPES - DW_SECT_INFO];
239 UnitIndexEntry Entry = CUEntry
[all...] |
