java中map怎么遍历,Java中怎么遍历Map的所有的元素

Java中怎样遍历Map的所有的元素

JDK1.4中

view plaincopy to clipboardprint?

Map map = new HashMap();

Iterator it = map.entrySet().iterator();

while (it.hasNext()) {

Map.Entry entry = (Map.Entry) it.next();

Object key = entry.getKey();

Object value = entry.getValue();

}

Map map = new HashMap();

Iterator it = map.entrySet().iterator();

while (it.hasNext()) {

Map.Entry entry = (Map.Entry) it.next();

Object key = entry.getKey();

Object value = entry.getValue();

}JDK1.5中,应用新特性For-Each循环

view plaincopy to clipboardprint?

Map m = new HashMap();

for(Object o : map.keySet()){

map.get(o);

}

Map m = new HashMap();

for(Object o : map.keySet()){

map.get(o);

}返回的 set 中的每个元素都是一个 Map.Entry 类型。

view plaincopy to clipboardprint?

private Hashtable emails = new Hashtable();

private Hashtable emails = new Hashtable();  另外 我们可以先把hashMap 转为集合Collection,再迭代输出,不过得到的对象

view plaincopy to clipboardprint?

//方法一: 用entrySet()

Iterator it = emails.entrySet().iterator();

while(it.hasNext()){

Map.Entry m=(Map.Entry)it.next();

logger.info("email-" + m.getKey() + ":" + m.getValue());

}

// 方法二:jdk1.5支持,用entrySet()和For-Each循环()

for (Map.Entry m : emails.entrySet()) {

logger.info("email-" + m.getKey() + ":" + m.getValue());

}

// 方法三:用keySet()

Iterator it = emails.keySet().iterator();

while (it.hasNext()){

String key;

key=(String)it.next();

logger.info("email-" + key + ":" + emails.get(key));

}

// 方法五:jdk1.5支持,用keySEt()和For-Each循环

for(Object m: emails.keySet()){

logger.info("email-" + m+ ":" + emails.get(m));

}

//方法一: 用entrySet()

Iterator it = emails.entrySet().iterator();

while(it.hasNext()){

Map.Entry m=(Map.Entry)it.next();

logger.info("email-" + m.getKey() + ":" + m.getValue());

}

// 方法二:jdk1.5支持,用entrySet()和For-Each循环()

for (Map.Entry m : emails.entrySet()) {

logger.info("email-" + m.getKey() + ":" + m.getValue());

}

// 方法三:用keySet()

Iterator it = emails.keySet().iterator();

while (it.hasNext()){

String key;

key=(String)it.next();

logger.info("email-" + key + ":" + emails.get(key));

}

// 方法五:jdk1.5支持,用keySEt()和For-Each循环

for(Object m: emails.keySet()){

logger.info("email-" + m+ ":" + emails.get(m));

}

Map    aa    =    new    HashMap();      aa.put("tmp1",    new    Object());      //追加      替换用同样的函数.      aa.remove("temp1");                        //删除      for    (Iterator    i    =    aa.values().iterator();    i.hasNext();    )    {              Object    temp    =    i.next();      }          //遍历

来个完整的,包含TreeSet的元素内部排序的

view plaincopy to clipboardprint?

public static void main(String[] args) {

ArrayList list = new ArrayList();

HashMap hash = new HashMap();

TreeMap treeMap = new TreeMap();

list.add("a");

list.add("b");

list.add("c");

hash.put(3, 3);

hash.put(4, 4);

hash.put(5, 5);

hash.put(6, 6);

hash.put(1, 1);

hash.put(2, 2);

treeMap.put(1, 1);

treeMap.put(2, 2);

treeMap.put(3, 3);

treeMap.put(4, 4);

treeMap.put(5, 5);

treeMap.put(6, 6);

//list遍历

for(String m: list){

System.out.println(m);

}

// hashmap entrySet() 遍历

for(Map.Entry m: hash.entrySet()){

System.out.println(m.getKey()+"---"+m.getValue());

}

//hashmap keySet() 遍历

for(Object m: hash.keySet()){

System.out.println(m+"---"+hash.get(m));

}

// treemap keySet()遍历

for(Object m: treeMap.keySet()){

System.out.println(m+"---"+treeMap.get(m));

}

}

文章转载自网管之家:http://www.bitscn.com/pdb/java/200806/143985_2.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值