java-map

[color=blue]1: map 有用的例子:


public String execute() throws Exception {
Map map = new HashMap();
HashMap HashMap1 = new HashMap();
HashMap HashMap2 = null;
String str1 = null;
String str2 = null;
String column = null;
String value = null;
List listEmp = employManager.getAllEmployee(map);
StringBuffer strBuffer = new StringBuffer();
List newList = new ArrayList();
List newList2 = new ArrayList();

// 打印出字段名字
for (int i = 0; i < listEmp.size(); i++) {
Map map1 = (HashMap) listEmp.get(i);

Iterator ite = map1.entrySet().iterator();
while (ite.hasNext()) {
Map.Entry entry = (Map.Entry) ite.next();
str1 = String.valueOf(entry.getKey());
column = strBuffer.append(str1 + " ").toString();
}
if (i == 0) {
System.out.println(column);
newList.add(column);
Collections.sort(newList);
System.out.println("***对List排序完成***");

for (int a = 0; a < newList.size(); a++) {
System.out.println(newList.get(a));
}
}
}
// 打印出字段对应的值
for (int k = 0; k < listEmp.size(); k++) {
StringBuffer buffer = new StringBuffer();
HashMap map1 = (HashMap) listEmp.get(k);

Iterator ite = map1.entrySet().iterator();
while (ite.hasNext()) {
Map.Entry entry = (Map.Entry) ite.next();
str2 = String.valueOf(entry.getValue());
value = buffer.append(str2 + " ").toString();
//System.out.print(str2);
}
System.out.print(buffer);
newList.add(value);
Collections.sort(newList);
}

// 打印新组装的newList
System.out.println("打印新组装的newList");

//在新组装的List里面把filed和值分别分开 再重新放进新的list里面
for (int m = 0; m < newList.size(); m++) {
String ssss = null;
List listMap = null;
Map mapList = null;
int i = 0;
String ss = (String) newList.get(m);
String[] strA = ss.split(" ");
if (m == 0) {
for (i = 0; i < strA.length; i++) {
System.out.print(strA[i]);
HashMap1.put(i, strA[i]);
}
newList2.add(HashMap1);
System.out.println(HashMap1.size());
}
}

// 在新组装的list里面放进重新分布的field对应的值

for (int n = 0; n < newList.size(); n++) {
String ss = (String) newList.get(n);
System.out.println(ss);
HashMap2 = new HashMap();
if (n != 0) {
String[] array = ss.split(" ");
for (int i = 0; i < array.length; i++) {
System.out.println(array[i]);

HashMap2.put(i, array[i]);

}
newList2.add(HashMap2);
}

}
return SUCCESS;
}
}[/color]
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值