| /external/guava/guava/src/com/google/common/collect/ |
| 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...] |
| AbstractMapEntry.java | 22 import java.util.Map.Entry;
28 * methods of {@code Entry}.
33 abstract class AbstractMapEntry<K, V> implements Entry<K, V> {
47 if (object instanceof Entry) {
48 Entry<?, ?> that = (Entry<?, ?>) object;
|
| FilteredEntrySetMultimap.java | 22 import java.util.Map.Entry;
34 FilteredEntrySetMultimap(SetMultimap<K, V> unfiltered, Predicate<? super Entry<K, V>> predicate) {
59 Set<Entry<K, V>> createEntries() {
64 public Set<Entry<K, V>> entries() {
65 return (Set<Entry<K, V>>) super.entries();
|
| FilteredKeySetMultimap.java | 22 import java.util.Map.Entry;
61 public Set<Entry<K, V>> entries() {
62 return (Set<Entry<K, V>>) super.entries();
66 Set<Entry<K, V>> createEntries() {
70 class EntrySet extends Entries implements Set<Entry<K, V>> {
|
| /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...] |
| /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/ |
| SimpleImmutableEntryTest.java | 26 import java.util.Map.Entry;
35 static class NullEntry implements Entry {
53 Entry entryToPut = (Entry) map.entrySet().iterator().next();
54 Entry testEntry = new AbstractMap.SimpleImmutableEntry(entryToPut);
72 Entry entry = new AbstractMap.SimpleImmutableEntry<Integer, String>(1, "test"); local
73 assertEquals(1, entry.getKey());
74 entry = new AbstractMap.SimpleImmutableEntry(null, null);
75 assertNull(entry.getKey())
79 Entry entry = new AbstractMap.SimpleImmutableEntry<Integer, String>(1, "test"); local
86 Entry entry = new AbstractMap.SimpleImmutableEntry<Integer, String>(1, "test"); local
104 Entry entry = new AbstractMap.SimpleImmutableEntry<Integer, String>(1, "test"); local
[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...] |
| /system/core/include/utils/ |
| LruCache.h | 59 struct Entry {
62 Entry* parent;
63 Entry* child;
65 Entry(TKey key_, TValue value_) : key(key_), value(value_), parent(NULL), child(NULL) {
70 struct HashForEntry : public std::unary_function<Entry*, hash_t> {
71 size_t operator() (const Entry* entry) const {
72 return hash_type(entry->key);
76 struct EqualityForHashedEntries : public std::unary_function<Entry*, hash_t> {
77 bool operator() (const Entry* lhs, const Entry* rhs) const
174 Entry *entry = *find_result; local
202 Entry* entry = *find_result; local
[all...] |
| /external/guava/guava-testlib/src/com/google/common/collect/testing/google/ |
| 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/skia/src/effects/gradients/ |
| SkGradientBitmapCache.cpp | 12 struct SkGradientBitmapCache::Entry {
13 Entry* fPrev;
14 Entry* fNext;
20 Entry(const void* buffer, size_t size, const SkBitmap& bm)
29 ~Entry() { sk_free(fBuffer); }
46 Entry* entry = fHead; local
47 while (entry) {
48 Entry* next = entry->fNext
86 Entry* entry = fHead; local
111 Entry* entry = new Entry(buffer, len, bm); local
133 Entry* entry = fHead; local
[all...] |
| /packages/apps/Camera2/src/com/android/camera/async/ |
| ConcurrentBufferQueue.java | 55 * An entry can either be a {@link T} or a special "poison-pill" marker
58 private static class Entry<T> {
62 private Entry(T value, boolean closing) {
82 private final BlockingQueue<Entry<T>> mQueue;
111 List<Entry<T>> remainingElements = new ArrayList<>();
123 // {@link Entry}s indicating that the sequence has ended so they
135 for (Entry<T> entry : remainingElements) {
136 if (!entry.isClosingMarker()) {
137 mUnusedElementProcessor.process(entry.getValue())
[all...] |
| /libcore/ojluni/src/main/java/java/util/ |
| WeakHashMap.java | 38 * An entry in a <tt>WeakHashMap</tt> will automatically be removed when
42 * When a key has been discarded its entry is effectively removed from the map,
60 * <tt>WeakHashMap</tt> at some later time and be surprised that its entry
83 * the entry set to yield successively smaller numbers of elements.
159 Entry<K,V>[] table;
193 private Entry<K,V>[] newTable(int n) {
194 return (Entry<K,V>[]) new Entry[n];
303 Entry<K,V> e = (Entry<K,V>) x
602 Map.Entry<?,?> entry = (Map.Entry<?,?>)o; local
745 private Entry<K,V> entry = null; field in class:WeakHashMap.HashIterator
[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/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...] |
| /external/skia/tests/ |
| DynamicHashTest.cpp | 13 struct Entry {
17 static const int& GetKey(const Entry& entry) { return entry.key; }
22 class Hash : public SkTDynamicHash<Entry, int> {
31 typedef SkTDynamicHash<Entry, int> INHERITED;
39 Entry a = { 1, 2.0 };
40 Entry b = { 2, 3.0 };
41 Entry c = { 3, 4.0 };
42 Entry d = { 4, 5.0 }
[all...] |
| /frameworks/base/packages/SystemUI/src/com/android/systemui/statusbar/ |
| RemoteInputController.java | 34 private final ArrayList<WeakReference<NotificationData.Entry>> mOpen = new ArrayList<>();
44 public void addRemoteInput(NotificationData.Entry entry) {
45 Preconditions.checkNotNull(entry);
48 entry /* contains */, null /* remove */);
50 mOpen.add(new WeakReference<>(entry));
53 apply(entry);
56 public void removeRemoteInput(NotificationData.Entry entry) {
57 Preconditions.checkNotNull(entry);
[all...] |
| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/issues/issue103/ |
| FakeMap.java | 33 class FakeEntry implements java.util.Map.Entry<K, V> {
59 ArrayList<java.util.Map.Entry<K, V>> entries = new ArrayList<Map.Entry<K, V>>();
66 for (java.util.Map.Entry<K, V> entry : entries) {
67 if (entry.getKey().equals(arg0))
74 for (java.util.Map.Entry<K, V> entry : entries) {
75 if (entry.getValue().equals(arg0))
81 public Set<java.util.Map.Entry<K, V>> entrySet()
112 java.util.Map.Entry<K, V> entry = iter.next(); local
[all...] |
| /external/v8/src/compiler/ |
| liveness-analyzer.h | 84 void Lookup(int var) { entries_.push_back(Entry(Entry::kLookup, var)); }
85 void Bind(int var) { entries_.push_back(Entry(Entry::kBind, var)); }
86 void Checkpoint(Node* node) { entries_.push_back(Entry(node)); }
90 class Entry {
104 explicit Entry(Node* node) : kind_(kCheckpoint), var_(-1), node_(node) {}
105 Entry(Kind kind, int var) : kind_(kind), var_(var), node_(nullptr) {
132 ZoneDeque<Entry> entries_;
|
| /frameworks/base/tools/aapt2/ |
| StringPool.h | 50 class Entry;
68 Ref(Entry* entry);
70 Entry* mEntry;
91 StyleRef(StyleEntry* entry);
96 class Entry {
127 using const_iterator = std::vector<std::unique_ptr<Entry>>::const_iterator;
185 void sort(const std::function<bool(const Entry&, const Entry&)>& cmp);
200 std::vector<std::unique_ptr<Entry>> mStrings
[all...] |
