Lines Matching refs:Entry

51         Map.Entry<String, String> newest = null;
52 for (Map.Entry<String, String> e : m.entrySet()) {
72 Map.Entry<String, String> newest = null;
73 for (Map.Entry<String, String> e : m.entrySet()) {
81 for (Map.Entry<String, String> e : m.entrySet()) {
104 Map.Entry<String, String> newest = null;
105 for (Map.Entry<String, String> e : m.entrySet()) {
114 for (Map.Entry<String, String> e : m.entrySet()) {
131 Map.Entry<String, String> newest = null;
132 for (Map.Entry<String, String> e : m.entrySet()) {
149 Map.Entry<String, String> newest = null;
150 for (Map.Entry<String, String> e : m.entrySet()) {
159 for (Map.Entry<String, String> e : m.entrySet()) {
175 Map.Entry<String, String> newest = null;
176 for (Map.Entry<String, String> e : m.entrySet()) {
192 Map.Entry<String, String> newest = null;
193 for (Map.Entry<String, String> e : m.entrySet()) {
201 for (Map.Entry<String, String> e : m.entrySet()) {
217 Map.Entry<String, String> newest = null;
218 for (Map.Entry<String, String> e : m.entrySet()) {
233 protected boolean removeEldestEntry(Entry eldest) {
319 Iterator<? extends Map.Entry<?, ?>> it = map.entrySet().iterator();
321 Map.Entry<?, ?> expected = it.next();
331 * Check that {@code LinkedHashMap.Entry} compiles and refers to
332 * {@link java.util.Map.Entry}, which is required for source
336 assertEquals(Map.Entry.class, LinkedHashMap.Entry.class);
340 * Checks that there is no nested class named 'Entry' in LinkedHashMap.
343 * version of LinkedHashMap that does not have a nested Entry class,
347 String forbiddenClassName = "java.util.LinkedHashMap$Entry";
422 private static Map.Entry<?, ?> eldest(LinkedHashMap<?,?> map) {
427 private static void assertEntry(Object key, Object value, Map.Entry<?, ?> entry) {