| /external/dng_sdk/source/ |
| dng_opcode_list.h | 94 dng_opcode & Entry (uint32 index)
102 const dng_opcode & Entry (uint32 index) const
|
| /external/emma/core/java12/com/vladium/emma/report/html/doc/ |
| AttributeSet.java | 57 final Map.Entry entry = (Map.Entry) a.next (); local
59 final Attribute attr = (Attribute) entry.getKey ();
60 final String value = entry.getValue ().toString ();
|
| /external/guava/guava/src/com/google/common/collect/ |
| AbstractSetMultimap.java | 73 @Override public Set<Map.Entry<K, V>> entries() {
74 return (Set<Map.Entry<K, V>>) super.entries();
|
| ImmutableMapKeySet.java | 23 import java.util.Map.Entry;
58 final ImmutableList<Entry<K, V>> entryList = map.entrySet().asList();
|
| ImmutableMapValues.java | 23 import java.util.Map.Entry;
63 final ImmutableList<Entry<K, V>> entryList = map.entrySet().asList();
|
| Multiset.java | 52 * collapsed", and {@link #entrySet} is similar but contains {@link Entry
53 * Multiset.Entry} instances, each providing both a distinct element and the
205 * Multiset.Entry} instances, each providing an element of the multiset and
206 * the count of that element. This set contains exactly one entry for each
211 * <p>The entry set is backed by the same data as the multiset, so any change
213 * may or may not be reflected in any {@code Entry} instances already
214 * retrieved from the entry set (this is implementation-dependent).
216 * the entry set at all, and the {@code Entry} instances themselves don't
218 * for more details on how its entry set handles modifications
[all...] |
| RegularImmutableMultiset.java | 70 Entry<E> getEntry(int index) {
71 Map.Entry<E, Integer> mapEntry = map.entrySet().asList().get(index);
|
| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| ImmutableMapValues.java | 21 import java.util.Map.Entry;
61 final ImmutableList<Entry<K, V>> entryList = map.entrySet().asList();
|
| /external/guava/guava-testlib/src/com/google/common/collect/testing/google/ |
| MultimapAsMapTester.java | 38 import java.util.Map.Entry;
51 for (Entry<K, V> entry : getSampleElements()) {
52 if (entry.getKey().equals(key)) {
53 expectedValues.add(entry.getValue());
101 Set<Entry<K, Collection<V>>> asMapEntrySet = multimap().asMap().entrySet();
117 Set<Entry<K, Collection<V>>> asMapEntrySet = multimap().asMap().entrySet();
128 Set<Entry<K, Collection<V>>> asMapEntrySet = multimap().asMap().entrySet();
129 Entry<K, Collection<V>> asMapEntry0 = Iterables.getOnlyElement(asMapEntrySet);
142 Set<Entry<K, Collection<V>>> asMapEntrySet = multimap().asMap().entrySet()
[all...] |
| /external/guava/guava-tests/test/com/google/common/collect/ |
| AbstractBiMapTest.java | 21 import java.util.Map.Entry;
56 Iterator<Entry<Integer, String>> iterator = bimap.entrySet().iterator();
|
| /external/llvm/lib/CodeGen/ |
| SpillPlacement.h | 79 /// BorderConstraint - A basic block has separate constraints for entry and
83 PrefReg, ///< Block entry/exit prefers a register.
84 PrefSpill, ///< Block entry/exit prefers a stack slot.
85 PrefBoth, ///< Block entry prefers both register and stack.
89 /// BlockConstraint - Entry and exit constraints for a basic block.
92 BorderConstraint Entry : 8; ///< Constraint on block entry.
118 /// Entry = Exit = PrefSpill, and ChangesValue = false.
163 void setThreshold(const BlockFrequency &Entry);
|
| /external/llvm/lib/DebugInfo/DWARF/ |
| DWARFDebugMacro.cpp | 22 for (const Entry &E : Macros) {
60 // A macro list entry consists of:
61 Entry E;
73 // Push the corrupted entry to the list and halt parsing.
|
| DWARFUnitIndex.cpp | 54 Rows = llvm::make_unique<Entry[]>(Header.NumBuckets);
56 llvm::make_unique<Entry::SectionContribution *[]>(Header.NumUnits);
70 llvm::make_unique<Entry::SectionContribution[]>(Header.NumColumns);
147 const DWARFUnitIndex::Entry::SectionContribution *
148 DWARFUnitIndex::Entry::getOffset(DWARFSectionKind Sec) const {
155 const DWARFUnitIndex::Entry::SectionContribution *
156 DWARFUnitIndex::Entry::getOffset() const {
160 const DWARFUnitIndex::Entry *
|
| /external/llvm/lib/IR/ |
| Value.cpp | 169 "No name entry found!");
702 ValueHandleBase *&Entry = pImpl->ValueHandles[V];
703 assert(Entry && "Value doesn't have any handles?");
704 AddToExistingUseList(&Entry);
716 ValueHandleBase *&Entry = Handles[V];
717 assert(!Entry && "Value really did already have handles?");
718 AddToExistingUseList(&Entry);
753 // ValueHandle watching VP. If so, delete its entry from the ValueHandles
769 ValueHandleBase *Entry = pImpl->ValueHandles[V];
770 assert(Entry && "Value bit set but no entries exist")
[all...] |
| /external/mockito/src/main/java/org/mockito/internal/util/concurrent/ |
| WeakConcurrentSet.java | 111 private final Iterator<Map.Entry<V, Boolean>> iterator;
113 private ReducingIterator(Iterator<Map.Entry<V, Boolean>> iterator) {
|
| /external/mp4parser/isoparser/src/main/java/com/coremedia/iso/boxes/fragment/ |
| MovieFragmentBox.java | 43 final List<SampleDependencyTypeBox.Entry> sampleEntries = sdtp.getEntries();
45 for (SampleDependencyTypeBox.Entry sampleEntry : sampleEntries) {
|
| /external/opencensus-java/api/src/test/java/io/opencensus/trace/ |
| TracestateTest.java | 22 import io.opencensus.trace.Tracestate.Entry;
57 assertThat(firstTracestate.getEntries()).containsExactly(Entry.create(FIRST_KEY, FIRST_VALUE));
59 .containsExactly(Entry.create(SECOND_KEY, SECOND_VALUE));
62 Entry.create(FIRST_KEY, FIRST_VALUE), Entry.create(SECOND_KEY, SECOND_VALUE));
178 .set(FIRST_KEY, SECOND_VALUE) // update the existing entry
179 .set(SECOND_KEY, FIRST_VALUE) // add a new entry
183 Entry.create(FIRST_KEY, SECOND_VALUE), Entry.create(SECOND_KEY, FIRST_VALUE));
191 .set(FIRST_KEY, SECOND_VALUE) // update the existing entry
[all...] |
| /external/skia/src/gpu/mtl/ |
| GrMtlResourceProvider.h | 59 struct Entry;
67 SkLRUCache<const GrMtlPipelineStateBuilder::Desc, std::unique_ptr<Entry>, DescHash> fMap;
|
| /external/sl4a/ScriptingLayerForAndroid/src/org/connectbot/util/ |
| EncodingPreference.java | 10 import java.util.Map.Entry;
20 for (Entry<String, Charset> entry : Charset.availableCharsets().entrySet()) {
21 Charset c = entry.getValue();
23 String key = entry.getKey();
29 charsetIdsList.add(entry.getKey());
|
| /external/slf4j/slf4j-log4j12/src/main/java/org/slf4j/impl/ |
| Log4jMDCAdapter.java | 83 Map.Entry mapEntry = (Map.Entry) entrySetIterator.next();
|
| /external/spirv-llvm/lib/SPIRV/libSPIRV/ |
| SPIRVStream.cpp | 237 SPIRVEntry *Entry = SPIRVEntry::create(OpCode);
238 assert(Entry);
239 Entry->setModule(&M);
242 Entry->setScope(Scope);
243 Entry->setWordCount(WordCount);
244 IS >> *Entry;
246 M.add(Entry);
247 return Entry;
|
| /external/swiftshader/third_party/LLVM/unittests/VMCore/ |
| VerifierTest.cpp | 29 BasicBlock *Entry = BasicBlock::Create(C, "entry", F.get());
37 BranchInst *BI = BranchInst::Create(Exit, Exit, False, Entry);
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/AsmPrinter/ |
| AddressPool.cpp | 62 for (const MCExpr *Entry : Entries)
63 Asm.OutStreamer->EmitValue(Entry, Asm.getDataLayout().getPointerSize());
|
| DIEHash.h | 89 const DIE &Entry);
94 void hashShallowTypeReference(dwarf::Attribute Attribute, const DIE &Entry,
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/ |
| SpillPlacement.h | 79 /// BorderConstraint - A basic block has separate constraints for entry and
83 PrefReg, ///< Block entry/exit prefers a register.
84 PrefSpill, ///< Block entry/exit prefers a stack slot.
85 PrefBoth, ///< Block entry prefers both register and stack.
89 /// BlockConstraint - Entry and exit constraints for a basic block.
92 BorderConstraint Entry : 8; ///< Constraint on block entry.
118 /// Entry = Exit = PrefSpill, and ChangesValue = false.
163 void setThreshold(const BlockFrequency &Entry);
|
