@Test public void testMoveToTop() { for (int i = 0; i < 10; ++i) { map.put("hello" + i, "world"); } SortedHashMap.moveToTop(map, "hello9"); Set<String> keys = map.keySet(); assertEquals("hello9", keys.iterator().next()); }
public static void moveToTop(SortedHashMap linkedMap, Object key) { Entry e = linkedMap.getEntry(key); if (e != null) { e.moveToTop(linkedMap); } }
SortedHashMap extends AbstractMap<K, V> { public static void moveToTop(SortedHashMap linkedMap, Object key) { Entry e = linkedMap.getEntry(key); if (e != null) { e.moveToTop(linkedMap); } } }
SortedHashMap extends AbstractMap<K, V> { public static void moveToTop(SortedHashMap linkedMap, Object key) { Entry e = linkedMap.getEntry(key); if (e != null) { e.moveToTop(linkedMap); } } SortedHashMap();  SortedHashMap(int initialCapacity);  SortedHashMap(int initialCapacity, OrderingType orderingType);  SortedHashMap(int initialCapacity, float loadFactor, OrderingType orderingType); }
SortedHashMap extends AbstractMap<K, V> { public static void moveToTop(SortedHashMap linkedMap, Object key) { Entry e = linkedMap.getEntry(key); if (e != null) { e.moveToTop(linkedMap); } } SortedHashMap();  SortedHashMap(int initialCapacity);  SortedHashMap(int initialCapacity, OrderingType orderingType);  SortedHashMap(int initialCapacity, float loadFactor, OrderingType orderingType); V put(K key, V value); static void touch(SortedHashMap linkedMap, Object key, OrderingType orderingType); static void moveToTop(SortedHashMap linkedMap, Object key); static OrderingType getOrderingTypeByName(String orderingType); boolean containsKey(Object key); V get(Object key); void clear(); V remove(Object key); boolean containsValue(Object value); Set<K> keySet(); Collection<V> values(); Set<Map.Entry<K, V>> entrySet(); }
SortedHashMap extends AbstractMap<K, V> { public static void moveToTop(SortedHashMap linkedMap, Object key) { Entry e = linkedMap.getEntry(key); if (e != null) { e.moveToTop(linkedMap); } } SortedHashMap();  SortedHashMap(int initialCapacity);  SortedHashMap(int initialCapacity, OrderingType orderingType);  SortedHashMap(int initialCapacity, float loadFactor, OrderingType orderingType); V put(K key, V value); static void touch(SortedHashMap linkedMap, Object key, OrderingType orderingType); static void moveToTop(SortedHashMap linkedMap, Object key); static OrderingType getOrderingTypeByName(String orderingType); boolean containsKey(Object key); V get(Object key); void clear(); V remove(Object key); boolean containsValue(Object value); Set<K> keySet(); Collection<V> values(); Set<Map.Entry<K, V>> entrySet();  }