| /external/volley/src/main/java/com/android/volley/toolbox/ |
| NoCache.java | 27 public Entry get(String key) {
32 public void put(String key, Entry entry) {}
|
| /external/guava/guava/src/com/google/common/collect/ |
| ForwardingMapEntry.java | 24 import java.util.Map.Entry;
29 * A map entry which forwards all its method calls to another map entry.
31 * backing map entry as desired per the <a
44 * key equality, such as the entry of a {@code SortedMap} whose comparator is
56 extends ForwardingObject implements Map.Entry<K, V> {
62 @Override protected abstract Map.Entry<K, V> delegate();
96 if (object instanceof Entry) {
97 Entry<?, ?> that = (Entry<?, ?>) object
[all...] |
| AbstractNavigableMap.java | 43 public Entry<K, V> firstEntry() {
49 public Entry<K, V> lastEntry() {
55 public Entry<K, V> pollFirstEntry() {
61 public Entry<K, V> pollLastEntry() {
67 Entry<K, V> entry = firstEntry(); local
68 if (entry == null) {
71 return entry.getKey();
77 Entry<K, V> entry = lastEntry() local
[all...] |
| ForwardingNavigableMap.java | 62 public Entry<K, V> lowerEntry(K key) {
71 protected Entry<K, V> standardLowerEntry(K key) {
90 public Entry<K, V> floorEntry(K key) {
99 protected Entry<K, V> standardFloorEntry(K key) {
118 public Entry<K, V> ceilingEntry(K key) {
127 protected Entry<K, V> standardCeilingEntry(K key) {
146 public Entry<K, V> higherEntry(K key) {
155 protected Entry<K, V> standardHigherEntry(K key) {
174 public Entry<K, V> firstEntry() {
183 protected Entry<K, V> standardFirstEntry()
193 Entry<K, V> entry = firstEntry(); local
220 Entry<K, V> entry = lastEntry(); local
[all...] |
| DescendingMultiset.java | 58 @Override public Entry<E> pollFirstEntry() {
62 @Override public Entry<E> pollLastEntry() {
92 @Override public Entry<E> firstEntry() {
96 @Override public Entry<E> lastEntry() {
100 abstract Iterator<Entry<E>> entryIterator();
102 private transient Set<Entry<E>> entrySet;
104 @Override public Set<Entry<E>> entrySet() {
105 Set<Entry<E>> result = entrySet;
109 Set<Entry<E>> createEntrySet() {
115 @Override public Iterator<Entry<E>> iterator()
[all...] |
| /external/guava/guava-testlib/src/com/google/common/collect/testing/google/ |
| MapGenerators.java | 38 import java.util.Map.Entry;
50 @Override protected Map<String, String> create(Entry<String, String>[] entries) {
52 for (Entry<String, String> entry : entries) {
53 builder.put(entry.getKey(), entry.getValue());
61 @Override protected Map<String, String> create(Entry<String, String>[] entries) {
63 for (Entry<String, String> entry : entries) {
64 builder.put(entry.getKey(), entry.getValue())
135 Entry<String, Integer> entry = (Entry<String, Integer>) o; local
[all...] |
| AbstractMultimapTester.java | 31 import java.util.Map.Entry;
40 extends AbstractContainerTester<M, Map.Entry<K, V>> {
52 protected Map.Entry<K, V>[] createArrayWithNullKey() {
53 Map.Entry<K, V>[] array = createSamplesArray();
55 final Map.Entry<K, V> oldEntry = array[nullKeyLocation];
64 protected Map.Entry<K, V>[] createArrayWithNullValue() {
65 Map.Entry<K, V>[] array = createSamplesArray();
67 final Map.Entry<K, V> oldEntry = array[nullValueLocation];
76 protected Map.Entry<K, V>[] createArrayWithNullKeyAndValue() {
77 Map.Entry<K, V>[] array = createSamplesArray()
[all...] |
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/IR/ |
| PredIteratorCache.h | 44 BasicBlock **&Entry = BlockToPredsMap[BB];
45 if (Entry)
46 return Entry;
53 Entry = Memory.Allocate<BasicBlock *>(PredCache.size());
54 std::copy(PredCache.begin(), PredCache.end(), Entry);
55 return Entry;
|
| /external/swiftshader/third_party/llvm-7.0/llvm/tools/llvm-mca/ |
| TimelineView.cpp | 46 // Update the WaitTime entry which corresponds to this Index.
77 const WaitTimeEntry &Entry,
82 if (Entry.Executions == 0) {
86 unsigned Executions = Entry.Executions;
87 AverageTime1 = (double)Entry.CyclesSpentInSchedulerQueue / Executions;
88 AverageTime2 = (double)Entry.CyclesSpentInSQWhileReady / Executions;
89 AverageTime3 = (double)Entry.CyclesSpentAfterWBAndBeforeRetire / Executions;
143 const TimelineViewEntry &Entry,
150 for (unsigned I = 0, E = Entry.CycleDispatched; I < E; ++I)
153 if (Entry.CycleDispatched != Entry.CycleExecuted)
[all...] |
| /external/guava/guava/src/com/google/common/reflect/ |
| MutableTypeToInstanceMap.java | 82 @Override public Set<Entry<TypeToken<? extends B>, B>> entrySet() {
104 private final Entry<K, V> delegate;
106 static <K, V> Set<Entry<K, V>> transformEntries(final Set<Entry<K, V>> entries) {
107 return new ForwardingSet<Map.Entry<K, V>>() {
108 @Override protected Set<Entry<K, V>> delegate() {
111 @Override public Iterator<Entry<K, V>> iterator() {
123 private static <K, V> Iterator<Entry<K, V>> transformEntries(Iterator<Entry<K, V>> entries) {
124 return Iterators.transform(entries, new Function<Entry<K, V>, Entry<K, V>>()
[all...] |
| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| DescendingMultiset.java | 58 @Override public Entry<E> pollFirstEntry() {
62 @Override public Entry<E> pollLastEntry() {
92 @Override public Entry<E> firstEntry() {
96 @Override public Entry<E> lastEntry() {
100 abstract Iterator<Entry<E>> entryIterator();
102 private transient Set<Entry<E>> entrySet;
104 @Override public Set<Entry<E>> entrySet() {
105 Set<Entry<E>> result = entrySet;
109 Set<Entry<E>> createEntrySet() {
115 @Override public Iterator<Entry<E>> iterator()
[all...] |
| /external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/boxes/ |
| EC3SpecificBox.java | 15 List<Entry> entries = new LinkedList<Entry>();
26 for (Entry entry : entries) {
27 if (entry.num_dep_sub > 0) {
46 Entry e = new Entry();
68 for (Entry e : entries) {
85 public List<Entry> getEntries() {
89 public void setEntries(List<Entry> entries)
[all...] |
| /external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/boxes/mp4/samplegrouping/ |
| SampleToGroupBox.java | 31 * sample group. The table is compactly coded with each entry giving the index of the first sample of a run of
49 List<Entry> entries = new LinkedList<Entry>();
69 for (Entry entry : entries) {
70 IsoTypeWriter.writeUInt32(byteBuffer, entry.getSampleCount());
71 IsoTypeWriter.writeUInt32(byteBuffer, entry.getGroupDescriptionIndex());
85 entries.add(new Entry(l2i(IsoTypeReader.readUInt32(content)), l2i(IsoTypeReader.readUInt32(content))));
89 public static class Entry {
93 public Entry(long sampleCount, int groupDescriptionIndex)
131 Entry entry = (Entry) o; local
[all...] |
| /device/linaro/bootloader/OpenPlatformPkg/Platforms/Hisilicon/HiKey/HiKeyFastbootDxe/ |
| HiKeyFastbootDxe.c | 73 FASTBOOT_PARTITION_LIST *Entry;
76 Entry = (FASTBOOT_PARTITION_LIST *) GetFirstNode (&mPartitionListHead);
77 while (!IsNull (&mPartitionListHead, &Entry->Link)) {
78 NextEntry = (FASTBOOT_PARTITION_LIST *) GetNextNode (&mPartitionListHead, &Entry->Link);
80 RemoveEntryList (&Entry->Link);
81 FreePool (Entry);
83 Entry = NextEntry;
105 EFI_PARTITION_ENTRY *Entry;
116 // Read size of Partition entry and number of entries from GPT header
141 Entry = (EFI_PARTITION_ENTRY *)(Buffer + (2 * BlockSize));
[all...] |
| /device/linaro/bootloader/OpenPlatformPkg/Platforms/Hisilicon/HiKey960/HiKey960FastbootDxe/ |
| HiKey960FastbootDxe.c | 74 FASTBOOT_PARTITION_LIST *Entry;
77 Entry = (FASTBOOT_PARTITION_LIST *) GetFirstNode (&mPartitionListHead);
78 while (!IsNull (&mPartitionListHead, &Entry->Link)) {
79 NextEntry = (FASTBOOT_PARTITION_LIST *) GetNextNode (&mPartitionListHead, &Entry->Link);
81 RemoveEntryList (&Entry->Link);
82 FreePool (Entry);
84 Entry = NextEntry;
102 EFI_PARTITION_ENTRY *Entry;
116 // Read size of Partition entry and number of entries from GPT header
141 Entry = (EFI_PARTITION_ENTRY *)(Buffer + (2 * BlockSize));
[all...] |
| /external/clang/tools/diagtool/ |
| ListWarnings.cpp | 31 struct Entry {
35 Entry(llvm::StringRef diagN, llvm::StringRef flag)
38 bool operator<(const Entry &x) const { return DiagName < x.DiagName; }
42 static void printEntries(std::vector<Entry> &entries, llvm::raw_ostream &out) {
43 for (std::vector<Entry>::iterator it = entries.begin(), ei = entries.end();
53 std::vector<Entry> Flagged, Unflagged;
69 Entry entry(di->getName(),
72 if (entry.Flag.empty())
73 Unflagged.push_back(entry);
[all...] |
| /external/llvm/include/llvm/Support/ |
| ArrayRecycler.h | 43 // Remove an entry from the free list in Bucket[Idx] and return it.
48 FreeList *Entry = Bucket[Idx];
49 if (!Entry)
51 Bucket[Idx] = Entry->Next;
52 return reinterpret_cast<T*>(Entry);
55 // Add an entry to the free list at Bucket[Idx].
58 FreeList *Entry = reinterpret_cast<FreeList*>(Ptr);
61 Entry->Next = Bucket[Idx];
62 Bucket[Idx] = Entry;
|
| /external/llvm/lib/Target/WebAssembly/ |
| WebAssemblyPrepareForLiveIntervals.cpp | 91 MachineBasicBlock &Entry = *MF.begin();
101 // uses provide a definition. Insert IMPLICIT_DEFs in the entry block to
117 BuildMI(Entry, Entry.begin(), DebugLoc(),
122 // Move ARGUMENT_* instructions to the top of the entry block, so that their
124 for (auto MII = Entry.begin(), MIE = Entry.end(); MII != MIE; ) {
128 Entry.insert(Entry.begin(), MI);
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/DebugInfo/DWARF/ |
| DWARFDebugRangeList.cpp | 45 RangeListEntry Entry;
46 Entry.SectionIndex = -1ULL;
49 Entry.StartAddress = data.getRelocatedAddress(offset_ptr);
50 Entry.EndAddress =
51 data.getRelocatedAddress(offset_ptr, &Entry.SectionIndex);
56 return createError("invalid range list entry at offset 0x%" PRIx32,
59 if (Entry.isEndOfListEntry())
61 Entries.push_back(Entry);
89 // Base address of a range list entry is determined by the closest preceding
90 // base address selection entry in the same range list. It defaults to th
[all...] |
| /external/v8/src/ic/ |
| stub-cache.h | 35 struct Entry {
42 // Access cache for entry hash(name, map).
65 StubCache::Entry* first_entry(StubCache::Table table) {
77 // Setting the entry size such that the index is shifted by Name::kHashShift
105 // update strategy on updates is fairly clear and simple: Any existing entry
119 // Compute the entry for a given offset in exactly the same way as
122 // of sizeof(Entry). This makes it easier to avoid making mistakes
124 static Entry* entry(Entry* table, int offset) function in class:v8::internal::StubCache
[all...] |
| /device/linaro/bootloader/edk2/MdePkg/Library/BaseLib/ |
| LinkedList.c | 149 Adds the node Entry at the beginning of the doubly-linked list denoted by
153 If Entry is NULL, then ASSERT().
161 @param Entry A pointer to a node that is to be inserted at the beginning
171 IN OUT LIST_ENTRY *Entry
175 // ASSERT List not too long and Entry is not one of the nodes of List
177 ASSERT (InternalBaseLibIsNodeInList (ListHead, Entry, FALSE));
179 Entry->ForwardLink = ListHead->ForwardLink;
180 Entry->BackLink = ListHead;
181 Entry->ForwardLink->BackLink = Entry;
[all...] |
| /external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/authoring/tracks/ |
| ChangeTimeScaleTrack.java | 37 List<CompositionTimeToSample.Entry> ctts;
38 List<TimeToSampleBox.Entry> tts;
59 Queue<TimeToSampleBox.Entry> timeQueue = new LinkedList<TimeToSampleBox.Entry>(track.getDecodingTimeEntries());
73 TimeToSampleBox.Entry entry = timeQueue.poll(); local
74 left = entry.getCount() - 1;
75 currentDelta = entry.getDelta();
87 public List<TimeToSampleBox.Entry> getDecodingTimeEntries() {
91 public List<CompositionTimeToSample.Entry> getCompositionTimeEntries()
[all...] |
| CroppedTrack.java | 57 public List<TimeToSampleBox.Entry> getDecodingTimeEntries() {
64 LinkedList<TimeToSampleBox.Entry> returnDecodingEntries = new LinkedList<TimeToSampleBox.Entry>();
68 TimeToSampleBox.Entry e = new TimeToSampleBox.Entry(1, nuDecodingTime);
71 TimeToSampleBox.Entry e = returnDecodingEntries.getLast();
81 public List<CompositionTimeToSample.Entry> getCompositionTimeEntries() {
87 LinkedList<CompositionTimeToSample.Entry> returnDecodingEntries = new LinkedList<CompositionTimeToSample.Entry>();
91 CompositionTimeToSample.Entry e = new CompositionTimeToSample.Entry(1, nuDecodingTime)
[all...] |
| /device/linaro/bootloader/edk2/MdeModulePkg/Core/Dxe/Mem/ |
| Page.c | 21 // Entry for tracking the memory regions for each memory type to coalesce similar memory types
132 Internal function. Removes a descriptor entry.
134 @param Entry The entry to remove
139 IN OUT MEMORY_MAP *Entry
142 RemoveEntryList (&Entry->Link);
143 Entry->Link.ForwardLink = NULL;
145 if (Entry->FromPages) {
149 InsertTailList (&mFreeMemoryMapEntryList, &Entry->Link);
174 MEMORY_MAP *Entry;
[all...] |
| /device/linaro/bootloader/edk2/MdeModulePkg/Bus/Pci/EhciDxe/ |
| Ehci.h | 90 #define EFI_LIST_FOR_EACH(Entry, ListHead) \
91 for(Entry = (ListHead)->ForwardLink; Entry != (ListHead); Entry = Entry->ForwardLink)
97 #define EFI_LIST_FOR_EACH_SAFE(Entry, NextEntry, ListHead) \
98 for(Entry = (ListHead)->ForwardLink, NextEntry = Entry->ForwardLink;\
99 Entry != (ListHead); Entry = NextEntry, NextEntry = Entry->ForwardLink)
[all...] |
