下面是利用组合模式代替递归的一个样本,简单写了一下,并不一定符合组合模式的结构,但汲取了组合模式的思想,如果有表达不对的地方,欢迎拍砖!!
import java.util.HashMap;
import java.util.Iterator;
import java.util.Map;
import java.util.Set;
/**
* 版权 (c) 2010
* 保留所有权利。
*/
/**
* 描述:
*
* @author guosl
* 创建时间:Nov 2, 2010
*/
@SuppressWarnings("unchecked")
class Data{
public static HashMap data = new HashMap();
static{
HashMap a = new HashMap();
HashMap b = new HashMap();
HashMap c = new HashMap();
HashMap d = new HashMap();
a.put("b", b);
b.put("c", c);
a.put("d", d);
c.put("aaaaa", "aaaaaa");
c.put("bbbbb", "bbbbbb");
d.put("fffff", "ffffff");
d.put("ggggg", "gggggg");
data.put("a", a);
}
}
@SuppressWarnings("unchecked")
class MyNode{
private String key ;
private int level;
private HashMap parent;
public MyNode(String key,int level,HashMap parent){
this.key = key;
this.level = level;
this.parent = parent;
}
public void show(){
Object o = parent.get(key);
if (o instanceof HashMap){
HashMap temp = (HashMap)o;
Set list = temp.entrySet();
Iterator it = (Iterator) list.iterator();
for(;it.hasNext();){
Map.Entry entry = (Map.Entry)it.next();
MyNode node = new MyNode((String)entry.getKey(),this.level+1,temp);
node.show();
}
}else{
for(int i = 0 ; i < level ;i++){
System.out.print("-");
}
System.out.println(o);
}
}
}
public class NodeTest {
public static void main(String[] args){
MyNode node = new MyNode("a",0,Data.data);
node.show();
}
}