BuildingTreeMaker

package com.zx.services;

import java.util.Iterator;
import java.util.List;

import com.zx.pojos.UserBean;
import com.zx.views.tree.TreeNode;

public class BuildingTreeMaker
{

public static TreeNode makerTree ( )
{
UserInfoDao dao = new UserInfoDao();
int cnt = dao.getTotalCount();
UserBean[] users = dao.getUsers(0, cnt);
TreeNode p = new TreeNode("", "");
if ( users == null || users.length == 0 ) return p;
for ( int i = 0 ; i < users.length ; i++ )
{
UserBean user = users[i];
String buildname = user.getBuilding();
TreeNode node = p.findChild(buildname);
TreeNode houseNoNode = new TreeNode(String.valueOf(user.getId()),
user.getHouseno());
if ( node == null )
{
TreeNode buildingNode = new TreeNode(String.valueOf(user
.getId()), user.getBuilding());
p.addChild(buildingNode);
buildingNode.addChild(houseNoNode);
}
else
{
node.addChild(houseNoNode);
}
}
return p;
}

public static void print ( TreeNode tn )
{
if ( tn.isLeaf() )
{
System.out.println(" " + tn.getKey() + "-" + tn.getName());
}
else
{
//System.out.println(tn.getKey() + "-" + tn.getName());
List<TreeNode> children = tn.getChildren();
for ( Iterator<TreeNode> it = children.iterator() ; it.hasNext() ; )
{
print(it.next());
}
}
}

public static void main ( String[] a )
{
TreeNode t = BuildingTreeMaker.makerTree();
BuildingTreeMaker.print(t);
}

}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值