public static void work(Map<String, Student> map) {
 Collection<Student> c = map.values();
 Iterator it = c.iterator();
 for (; it.hasNext();) {
 System.out.println(it.next());
 }
 }
  //利用keyset进行遍历,它的优点在于可以根据你所想要的key值得到你想要的 values,更具灵活性!!
 public static void workByKeySet(Map<String, Student> map) {
 Set<String> key = map.keySet();
 for (Iterator it = key.iterator(); it.hasNext();) {
 String s = (String) it.next();
 System.out.println(map.get(s));
 }
 }
  //比较复杂的一种遍历在这里,呵呵~~他很暴力哦,它的灵活性太强了,想得到什么就能得到什么~~
 public static void workByEntry(Map<String, Student> map) {
 Set<Map.Entry<String, Student>> set = map.entrySet();
 for (Iterator<Map.Entry<String, Student>> it = set.iterator(); it.hasNext();) {
 Map.Entry<String, Student> entry = (Map.Entry<String, Student>) it.next();
 System.out.println(entry.getKey() + "--->" + entry.getValue());
 }
 }
}