/frameworks/base/core/java/com/android/internal/os/ |
IDropBoxManagerService.aidl | 35 void add(in DropBoxManager.Entry entry); 41 DropBoxManager.Entry getNextEntry(String tag, long millis);
|
/frameworks/compile/mclinker/lib/Target/X86/ |
X86GOT.h | 20 * \brief GOT Entry with size of 4 bytes 22 class X86_32GOTEntry : public GOT::Entry<4> { 25 : GOT::Entry<4>(pContent, pParent) {} 42 * \brief GOT Entry with size of 8 bytes 44 class X86_64GOTEntry : public GOT::Entry<8> { 47 : GOT::Entry<8>(pContent, pParent) {}
|
/system/keymaster/ |
operation_table.h | 32 struct Entry { 33 Entry() { 37 ~Entry(); 47 UniquePtr<Entry[]> table_;
|
/cts/tests/tests/hardware/src/android/hardware/cts/helpers/ |
ActivityResultMultiplexedLatch.java | 35 private final HashMap<Integer, Entry> mActivityEntries = new HashMap<Integer, Entry>(); 42 private Entry mEntry; 44 private Latch(Entry entry) { 45 mEntry = entry; 69 private class Entry { 75 public Entry(int requestCode) { 86 Entry entry; local 104 Entry entry; local [all...] |
/external/jacoco/org.jacoco.report/src/org/jacoco/report/internal/html/table/ |
SortIndex.java | 30 private class Entry implements Comparable<Entry> { 36 Entry(final int idx, final T item) { 41 public int compareTo(final Entry o) { 47 private final List<Entry> list = new ArrayList<Entry>(); 71 final Entry entry = new Entry(idx++, i); local 72 this.list.add(entry); [all...] |
/external/mp4parser/isoparser/src/main/java/com/coremedia/iso/boxes/ |
ProgressiveDownloadInformationBox.java | 15 List<Entry> entries = Collections.emptyList(); 29 for (Entry entry : entries) { 30 IsoTypeWriter.writeUInt32(byteBuffer, entry.getRate()); 31 IsoTypeWriter.writeUInt32(byteBuffer, entry.getInitialDelay()); 35 public List<Entry> getEntries() { 39 public void setEntries(List<Entry> entries) { 46 entries = new LinkedList<Entry>(); 48 Entry entry = new Entry(IsoTypeReader.readUInt32(content), IsoTypeReader.readUInt32(content)) local [all...] |
/external/emma/core/java12/com/vladium/util/ |
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) 93 if (key == entry.m_key) 112 final Entry [] buckets = m_buckets; 116 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next [all...] |
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) 91 if (key == entry.m_key) 109 for (Entry entry = m_buckets [b]; entry != null; entry = entry.m_next [all...] |
/external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/authoring/tracks/ |
DivideTimeScaleTrack.java | 43 public List<TimeToSampleBox.Entry> getDecodingTimeEntries() { 47 public List<CompositionTimeToSample.Entry> getCompositionTimeEntries() { 55 public List<SampleDependencyTypeBox.Entry> getSampleDependencies() { 90 List<CompositionTimeToSample.Entry> adjustCtts() { 91 List<CompositionTimeToSample.Entry> origCtts = this.source.getCompositionTimeEntries(); 93 List<CompositionTimeToSample.Entry> entries2 = new ArrayList<CompositionTimeToSample.Entry>(origCtts.size()); 94 for (CompositionTimeToSample.Entry entry : origCtts) { 95 entries2.add(new CompositionTimeToSample.Entry(entry.getCount(), entry.getOffset() / timeScaleDivisor)) [all...] |
MultiplyTimeScaleTrack.java | 49 public List<TimeToSampleBox.Entry> getDecodingTimeEntries() { 53 public List<CompositionTimeToSample.Entry> getCompositionTimeEntries() { 61 public List<SampleDependencyTypeBox.Entry> getSampleDependencies() { 96 static List<CompositionTimeToSample.Entry> adjustCtts(List<CompositionTimeToSample.Entry> source, int timeScaleFactor) { 98 List<CompositionTimeToSample.Entry> entries2 = new ArrayList<CompositionTimeToSample.Entry>(source.size()); 99 for (CompositionTimeToSample.Entry entry : source) { 100 entries2.add(new CompositionTimeToSample.Entry(entry.getCount(), timeScaleFactor * entry.getOffset())) [all...] |
/dalvik/dexgen/src/com/android/dexgen/dex/code/ |
CatchTable.java | 23 * Table of catch entries. Each entry includes a range of code 49 public Entry get(int n) { 50 return (Entry) get0(n); 54 * Sets the entry at the given index. 57 * @param entry {@code non-null;} the entry to set at {@code n} 59 public void set(int n, Entry entry) { 60 set0(n, entry); 75 Entry thisEntry = get(i) [all...] |
/dalvik/dx/src/com/android/dx/dex/code/ |
CatchTable.java | 22 * Table of catch entries. Each entry includes a range of code 48 public Entry get(int n) { 49 return (Entry) get0(n); 53 * Sets the entry at the given index. 56 * @param entry {@code non-null;} the entry to set at {@code n} 58 public void set(int n, Entry entry) { 59 set0(n, entry); 74 Entry thisEntry = get(i) [all...] |
/external/dexmaker/src/dx/java/com/android/dx/dex/code/ |
CatchTable.java | 23 * Table of catch entries. Each entry includes a range of code 49 public Entry get(int n) { 50 return (Entry) get0(n); 54 * Sets the entry at the given index. 57 * @param entry {@code non-null;} the entry to set at {@code n} 59 public void set(int n, Entry entry) { 60 set0(n, entry); 75 Entry thisEntry = get(i) [all...] |
/external/google-breakpad/src/processor/ |
map_serializers.h | 78 template<typename Addr, typename Entry> 82 size_t SizeOf(const AddressMap<Addr, Entry> &m) const { 89 char* Write(const AddressMap<Addr, Entry> &m, char *dest) const { 97 char* Serialize(const AddressMap<Addr, Entry> &m, unsigned int *size) const { 104 StdMapSerializer<Addr, Entry> std_map_serializer_; 109 template<typename Address, typename Entry> 113 size_t SizeOf(const RangeMap<Address, Entry> &m) const; 118 char* Write(const RangeMap<Address, Entry> &m, char* dest) const; 124 char* Serialize(const RangeMap<Address, Entry> &m, unsigned int *size) const; 128 typedef typename RangeMap<Address, Entry>::Range Range [all...] |
/external/protobuf/java/src/main/java/com/google/protobuf/ |
LazyField.java | 34 import java.util.Map.Entry; 91 static class LazyEntry<K> implements Entry<K, Object> { 92 private Entry<K, LazyField> entry; field in class:LazyField.LazyEntry 94 private LazyEntry(Entry<K, LazyField> entry) { 95 this.entry = entry; 100 return entry.getKey(); 105 LazyField field = entry.getValue() 142 Entry<K, ?> entry = iterator.next(); local [all...] |
/frameworks/base/libs/hwui/renderstate/ |
OffscreenBufferPool.h | 122 struct Entry { 123 Entry() {} 125 Entry(const uint32_t layerWidth, const uint32_t layerHeight) 129 Entry(OffscreenBuffer* layer) 135 static int compare(const Entry& lhs, const Entry& rhs); 137 bool operator==(const Entry& other) const { 141 bool operator!=(const Entry& other) const { 145 bool operator<(const Entry& other) const { 146 return Entry::compare(*this, other) < 0 [all...] |
/packages/apps/Gallery/src/com/android/camera/gallery/ |
LruCache.java | 28 private final HashMap<K, Entry<K, V>> mWeakMap = 29 new HashMap<K, Entry<K, V>>(); 36 protected boolean removeEldestEntry(Map.Entry<K, V> eldest) { 42 private static class Entry<K, V> extends WeakReference<V> { 45 public Entry(K key, V value, ReferenceQueue<V> queue) { 53 Entry<K, V> entry = (Entry<K, V>) mQueue.poll(); local 54 while (entry != null) { 55 mWeakMap.remove(entry.mKey) 63 Entry<K, V> entry = mWeakMap.put( local [all...] |
/external/guava/guava-testlib/src/com/google/common/collect/testing/ |
TestStringSortedMapGenerator.java | 24 import java.util.Map.Entry; 36 public Entry<String, String> belowSamplesLesser() { 41 public Entry<String, String> belowSamplesGreater() { 46 public Entry<String, String> aboveSamplesLesser() { 51 public Entry<String, String> aboveSamplesGreater() { 56 public Iterable<Entry<String, String>> order(List<Entry<String, String>> insertionOrder) { 61 protected abstract SortedMap<String, String> create(Entry<String, String>[] entries);
|
/external/llvm/include/llvm/DebugInfo/DWARF/ |
DWARFDebugMacro.h | 23 /// A single macro entry within a macro list.
24 struct Entry {
25 /// The type of the macro entry.
35 /// The string (name, value) of the macro entry.
44 typedef SmallVector<Entry, 4> MacroList;
|
/external/llvm/lib/Target/Hexagon/ |
HexagonSelectionDAGInfo.cpp | 39 TargetLowering::ArgListEntry Entry; 40 Entry.Ty = DAG.getDataLayout().getIntPtrType(*DAG.getContext()); 41 Entry.Node = Dst; 42 Args.push_back(Entry); 43 Entry.Node = Src; 44 Args.push_back(Entry); 45 Entry.Node = Size; 46 Args.push_back(Entry);
|
/external/llvm/lib/Target/XCore/ |
XCoreSelectionDAGInfo.cpp | 32 TargetLowering::ArgListEntry Entry; 33 Entry.Ty = DAG.getDataLayout().getIntPtrType(*DAG.getContext()); 34 Entry.Node = Dst; Args.push_back(Entry); 35 Entry.Node = Src; Args.push_back(Entry); 36 Entry.Node = Size; Args.push_back(Entry);
|
/external/v8/src/ |
hashmap.h | 37 struct Entry { 44 // If an entry with matching key is found, returns that entry. 46 Entry* Lookup(void* key, uint32_t hash) const; 48 // If an entry with matching key is found, returns that entry. 49 // If no matching entry is found, a new entry is inserted with 51 Entry* LookupOrInsert(void* key, uint32_t hash, 54 // Removes the entry with matching key 290 Entry* entry = LookupOrInsert(p->key, p->hash, allocator); local [all...] |
/frameworks/compile/mclinker/lib/Target/Hexagon/ |
HexagonGOT.h | 20 * \brief GOT Entry with size of 4 bytes 22 class HexagonGOTEntry : public GOT::Entry<4> { 25 : GOT::Entry<4>(pContent, pParent) {}
|
/libcore/ojluni/src/main/java/java/util/ |
NavigableMap.java | 45 * and {@link #higherEntry} return {@code Map.Entry} objects 72 * <p>Implementations of entry-returning methods are expected to 73 * return {@code Map.Entry} pairs representing snapshots of mappings 75 * support the optional {@code Entry.setValue} method. Note however 103 * @return an entry with the greatest key less than {@code key}, 110 Map.Entry<K,V> lowerEntry(K key); 132 * @return an entry with the greatest key less than or equal to 139 Map.Entry<K,V> floorEntry(K key); 161 * @return an entry with the least key greater than or equal to 168 Map.Entry<K,V> ceilingEntry(K key) [all...] |
/toolchain/binutils/binutils-2.25/ld/testsuite/ld-pe/ |
exports.d | 3 Entry 0 00000000 00000000 Export Directory \[\.edata \(or where ever we found it\)\]
|