Searched refs:Entry (Results 1 - 25 of 78) sorted by relevance

1234

/dalvik/dx/src/com/android/dx/dex/code/
H A DCatchTable.java49 public Entry get(int n) {
50 return (Entry) get0(n);
59 public void set(int n, Entry entry) {
75 Entry thisEntry = get(i);
76 Entry otherEntry = other.get(i);
93 * Entry in a catch list.
95 public static class Entry implements Comparable<Entry> { class in class:CatchTable
112 public Entry(int start, int end, CatchHandlerList handlers) { method in class:CatchTable.Entry
141 if (other instanceof Entry) {
[all...]
H A DCatchHandlerList.java48 public Entry get(int n) {
49 return (Entry) get0(n);
75 Entry entry = get(i);
110 Entry last = get(size - 1);
122 set0(n, new Entry(exceptionType, handler));
131 public void set(int n, Entry entry) {
147 Entry thisEntry = get(i);
148 Entry otherEntry = other.get(i);
165 * Entry in the list.
167 public static class Entry implement class in class:CatchHandlerList
180 public Entry(CstType exceptionType, int handler) { method in class:CatchHandlerList.Entry
[all...]
H A DPositionList.java76 PositionList.Entry[] arr = new PositionList.Entry[sz];
99 arr[at] = new PositionList.Entry(insn.getAddress(), pos);
131 public Entry get(int n) {
132 return (Entry) get0(n);
141 public void set(int n, Entry entry) {
146 * Entry in a position list.
148 public static class Entry { class in class:PositionList
161 public Entry (int address, SourcePosition position) { method in class:PositionList.Entry
H A DLocalList.java59 public Entry get(int n) {
60 return (Entry) get0(n);
69 public void set(int n, Entry entry) {
118 * Entry in a local list.
120 public static class Entry implements Comparable<Entry> { class in class:LocalList
141 public Entry(int address, Disposition disposition, RegisterSpec spec) { method in class:LocalList.Entry
174 if (!(other instanceof Entry)) {
178 return (compareTo((Entry) other) == 0);
189 public int compareTo(Entry othe
[all...]
H A DStdCatchBuilder.java126 ArrayList<CatchTable.Entry> resultList =
127 new ArrayList<CatchTable.Entry>(len);
172 CatchTable.Entry entry =
185 CatchTable.Entry entry =
266 * Makes a {@link CatchTable#Entry} for the given block range and
274 private static CatchTable.Entry makeEntry(BasicBlock start,
286 return new CatchTable.Entry(startAddress.getAddress(),
/dalvik/libcore/security/src/main/java/org/apache/harmony/security/asn1/
H A DInformationObjectSet.java40 private final Entry[][] pool;
48 pool = new Entry[capacity][size];
59 Entry[] list = pool[index];
73 list[i] = new Entry(oid, object);
80 Entry[] list = pool[index];
98 private static class Entry { class in class:InformationObjectSet
103 public Entry(int[] oid, Object object) { method in class:InformationObjectSet.Entry
/dalvik/libcore/luni/src/main/java/org/apache/harmony/luni/util/
H A DTwoKeyHashMap.java41 private Set<Map.Entry<String, V>> entrySet;
47 private Entry<E, K, V>[] arr;
89 arr = new Entry[arrSize + 1];
105 public Set<Map.Entry<String, V>> entrySet() {
129 Entry<E, K, V> e = removeEntry(key1, key2);
158 Entry<E, K, V> e = arr[index];
190 Entry<E, K, V>[] newArr = new Entry[newArrSize + 1];
193 Entry<E, K, V> entry = arr[i];
195 Entry<
294 public static class Entry<E, K, V> implements Map.Entry<String, V> { class in class:TwoKeyHashMap
301 public Entry(int hash, E key1, K key2, V value, Entry<E, K, V> next) { method in class:TwoKeyHashMap.Entry
[all...]
/dalvik/libcore/luni/src/main/java/java/util/
H A DWeakHashMap.java42 Entry<K, V>[] elementData;
52 private static <K, V> Entry<K, V>[] newEntryArray(int size) {
53 return new Entry[size];
56 private static final class Entry<K, V> extends WeakReference<K> implements class in class:WeakHashMap
57 Map.Entry<K, V> {
64 Entry<K, V> next;
67 R get(Map.Entry<K, V> entry);
70 Entry(K key, V object, ReferenceQueue<K> queue) { method in class:WeakHashMap.Entry
93 if (!(other instanceof Map.Entry)) {
96 Map.Entry<
[all...]
H A DAbstractMap.java62 Iterator<Map.Entry<K, V>> it = entrySet().iterator();
88 Iterator<Map.Entry<K, V>> it = entrySet().iterator();
107 * an instance of {@link Map.Entry}. As the set is backed by this map,
112 public abstract Set<Map.Entry<K, V>> entrySet();
137 for (Entry<K, V> entry : entrySet()) {
168 Iterator<Map.Entry<K, V>> it = entrySet().iterator();
171 Map.Entry<K, V> entry = it.next();
178 Map.Entry<K, V> entry = it.next();
197 Iterator<Map.Entry<K, V>> it = entrySet().iterator();
238 Iterator<Map.Entry<
[all...]
H A DMapEntry.java21 * MapEntry is an internal class which provides an implementation of Map.Entry.
23 class MapEntry<K, V> implements Map.Entry<K, V>, Cloneable {
55 if (object instanceof Map.Entry) {
56 Map.Entry<?, ?> entry = (Map.Entry<?, ?>) object;
H A DMap.java34 * {@code Map.Entry} is a key/value mapping contained in a {@code Map}.
36 public static interface Entry<K,V> { interface in interface:Map
38 * Compares the specified object to this {@code Map.Entry} and returns if they
39 * are equal. To be equal, the object must be an instance of {@code Map.Entry} and have the
45 * {@code Map.Entry}, {@code false} otherwise.
116 * an instance of {@link Map.Entry}. As the {@code Set} is backed by this {@code Map},
121 public Set<Map.Entry<K,V>> entrySet();
H A DEnumMap.java51 private static class Entry<KT extends Enum<KT>, VT> extends class in class:EnumMap
57 Entry(KT theKey, VT theValue, EnumMap<KT, VT> em) { method in class:EnumMap.Entry
70 if (object instanceof Map.Entry) {
71 Map.Entry<KT, VT> entry = (Map.Entry<KT, VT>) object;
302 return type.get(new Entry<KT, VT>((KT) enumMap.keys[prePosition],
308 AbstractSet<Map.Entry<KT, VT>> {
323 if (object instanceof Map.Entry) {
324 Object enumKey = ((Map.Entry) object).getKey();
325 Object enumValue = ((Map.Entry) objec
[all...]
H A DIdentityHashMap.java100 if (object instanceof Map.Entry) {
101 Map.Entry<?, ?> entry = (Map.Entry) object;
187 AbstractSet<Map.Entry<KT, VT>> {
211 associatedMap.remove(((Map.Entry) object).getKey());
219 if (object instanceof Map.Entry) {
221 .getEntry(((Map.Entry) object).getKey());
229 public Iterator<Map.Entry<KT, VT>> iterator() {
230 return new IdentityHashMapIterator<Map.Entry<KT, VT>, KT, VT>(
231 new MapEntry.Type<Map.Entry<K
[all...]
H A DHashtable.java60 private static final Entry[] EMPTY_TABLE
101 private transient Set<Entry<K, V>> entrySet;
185 for (Entry<? extends K, ? extends V> e : map.entrySet()) {
429 for (Entry<? extends K, ? extends V> e : map.entrySet()) {
618 * element in the set is a {@link Map.Entry}. The set is backed by this
624 public synchronized Set<Entry<K, V>> entrySet() {
625 Set<Entry<K, V>> es = entrySet;
664 private static class HashtableEntry<K, V> implements Entry<K, V> {
695 if (!(o instanceof Entry)) {
698 Entry<
[all...]
H A DHashMap.java74 private static final Entry[] EMPTY_TABLE
121 private transient Set<Entry<K, V>> entrySet;
208 for (Entry<? extends K, ? extends V> e : map.entrySet()) {
716 * an instance of {@link Map.Entry}. As the set is backed by this map,
721 public Set<Entry<K, V>> entrySet() {
722 Set<Entry<K, V>> es = entrySet;
726 static class HashMapEntry<K, V> implements Entry<K, V> {
754 if (!(o instanceof Entry)) {
757 Entry<?, ?> e = (Entry<
[all...]
/dalvik/libcore/luni/src/test/java/org/apache/harmony/luni/tests/java/util/
H A DMapEntryTest.java32 @TestTargetClass(Map.Entry.class)
34 Map.Entry me = null;
99 me = (Map.Entry)i.next();
119 Map.Entry me1 = (Map.Entry)i.next();
133 Map.Entry me1 = (Map.Entry)i.next();
144 me = (Map.Entry)i.next();
H A DWeakHashMapTest.java63 Set<Map.Entry<Object, Object>> entrySet = weakMap.entrySet();
66 Iterator<Map.Entry<Object, Object>> it = entrySet.iterator();
68 Map.Entry<Object, Object> entry = it.next();
73 assertTrue("Assert 3: Entry not in entry set", entrySet
/dalvik/dx/src/com/android/dx/dex/file/
H A DDebugInfoEncoder.java94 private final LocalList.Entry[] lastEntryForReg;
120 lastEntryForReg = new LocalList.Entry[regSize];
194 ArrayList<PositionList.Entry> sortedPositions = buildSortedPositions();
195 ArrayList<LocalList.Entry> methodArgs = extractMethodArguments();
286 LocalList.Entry entry = locals.get(curLocalIdx++);
288 LocalList.Entry prevEntry = lastEntryForReg[reg];
349 ArrayList<PositionList.Entry> sortedPositions)
369 private void emitHeader(ArrayList<PositionList.Entry> sortedPositions,
370 ArrayList<LocalList.Entry> methodArgs) throws IOException {
376 PositionList.Entry entr
[all...]
H A DCatchStructs.java147 for (Map.Entry<CatchHandlerList, Integer> mapping :
165 CatchHandlerList.Entry entry = list.get(i);
204 CatchTable.Entry one = table.get(i);
249 CatchTable.Entry entry = table.get(i);
276 for (Map.Entry<CatchHandlerList, Integer> mapping :
/dalvik/libcore/luni/src/main/java/org/apache/harmony/luni/internal/net/www/protocol/http/
H A DHeader.java26 import java.util.Map.Entry;
63 for (Entry<String, List<String>> next : map.entrySet()) {
83 for (Map.Entry<String, LinkedList<String>> next : this.keyTable
159 for (Map.Entry<String, LinkedList<String>> next : keyTable.entrySet()) {
/dalvik/libcore/security/src/main/java/java/security/
H A DUnresolvedPermissionCollection.java160 Map.Entry entry = (Map.Entry) iter.next();
180 Map.Entry entry = (Map.Entry) iter.next();
/dalvik/tests/062-character-encodings/src/
H A DMain.java12 for (Map.Entry<String, Charset> e : all.entrySet()) {
/dalvik/tests/063-process-manager/src/
H A DMain.java29 for (Map.Entry<Thread, StackTraceElement[]> entry :
/dalvik/libcore/luni/src/test/java/tests/api/java/util/
H A DLinkedHashMapTest.java53 protected boolean removeEldestEntry(Map.Entry e) {
224 Map.Entry newest = null;
225 for (Map.Entry<String, String> e : m.entrySet()) {
291 Map.Entry m = (Map.Entry) i.next();
313 Set<Map.Entry<String, String>> s1 = m1.entrySet();
516 Map.Entry<String, String>[] set = new Map.Entry[3];
517 Iterator<Map.Entry<String,String>> iterator = hm1.entrySet().iterator();
557 protected boolean removeEldestEntry(Map.Entry
[all...]
/dalvik/libcore/concurrent/src/main/java/java/util/concurrent/
H A DConcurrentHashMap.java143 transient Set<Map.Entry<K,V>> entrySet;
179 * out as a user-visible Map.Entry.
889 for (Map.Entry<? extends K, ? extends V> e : m.entrySet())
1011 public Set<Map.Entry<K,V>> entrySet() {
1012 Set<Map.Entry<K,V>> es = entrySet;
1111 * Custom Entry class used by EntryIterator.next(), that relays
1140 implements Iterator<Entry<K,V>>
1142 public Map.Entry<K,V> next() {
1187 final class EntrySet extends AbstractSet<Map.Entry<K,V>> {
1188 public Iterator<Map.Entry<
[all...]

Completed in 746 milliseconds

1234