java递归实现权限树列表

 在写项目的权限管理模块、用户系统的时候经常碰见类似的树结构我们一般习惯称之为权限树,权限树应用的地方有很多,比较常见的有:权限管理时候的树状图,页面左侧的一二三级的菜单,物品分类的树状菜单。

在实际项目中这种权限结构,数据库设计一般是这样的:

CREATE TABLE `bh_module`  (
              `id` int(11) NOT NULL AUTO_INCREMENT COMMENT '模块id',
              `parent_id` int(12) NULL DEFAULT NULL COMMENT '父节点id',
              `parent_name` varchar(200) CHARACTER SET utf8 COLLATE utf8_general_ci NULL DEFAULT NULL COMMENT '父节点名称',
              `name` varchar(200) CHARACTER SET utf8 COLLATE utf8_general_ci NULL DEFAULT NULL COMMENT '模块名称',
              `module_code` varchar(20) CHARACTER SET utf8 COLLATE utf8_general_ci NULL DEFAULT NULL COMMENT '模块业务码',
              `remark` varchar(200) CHARACTER SET utf8 COLLATE utf8_general_ci NULL DEFAULT NULL COMMENT '模块说明',
              `created_at` datetime(0) NULL DEFAULT NULL COMMENT '创建时间',
              `creator` varchar(50) CHARACTER SET utf8 COLLATE utf8_general_ci NULL DEFAULT NULL COMMENT '创建者',
              `updated_at` datetime(0) NULL DEFAULT NULL COMMENT '修改时间',
              `modifier` varchar(50) CHARACTER SET utf8 COLLATE utf8_general_ci NULL DEFAULT NULL COMMENT '修改者',
              `delete_flag` int(2) NULL DEFAULT 0 COMMENT '删除标识 0为不删 1为删除',
              PRIMARY KEY (`id`) USING BTREE
) ;

java代码如下:

public class MenuTreeUtil {
private List<BhModule> nodes;
private List<BhRoleModule> checknodes;

/**
* 创建一个新的实例 Tree.
*
* @param nodes 将树的所有节点都初始化进来。
*/
public MenuTreeUtil(List<BhModule> nodes, List<BhRoleModule> checknodes) {
this.nodes = nodes;
this.checknodes = checknodes;
}

/**
* buildTree
* 描述: 创建树
*
* @return List<Map < String , Object>>
* @throws
* @since 1.0.0
*/
public List<BhModule> buildTreeGrid() {
List<BhModule> list = new ArrayList<BhModule>();
for (BhModule node : nodes) {
//这里判断父节点,需要自己更改判断
if (node.getParentId().equals(0L)) {
List<BhModule> childs = buildTreeGridChilds(node);
node.setChildren(childs);
list.add(node);
}
}
return list;
}

/**
* buildChilds
* 描述: 创建树下的节点。
*
* @param node
* @return List<Map < String , Object>>
* @throws
* @since 1.0.0
*/
private List<BhModule> buildTreeGridChilds(BhModule node) {
List<BhModule> list = new ArrayList<BhModule>();
List<BhModule> childNodes = getChilds(node);
for (BhModule childNode : childNodes) {
//System.out.println("childNode"+childNode.getMenuName());
List<BhModule> childs = buildTreeGridChilds(childNode);
childNode.setChildren(childs);
list.add(childNode);
}
return list;
}

/**
* getChilds
* 描述: 获取子节点
*
* @param parentNode
* @return List<Resource>
* @throws
* @since 1.0.0
*/
public List<BhModule> getChilds(BhModule parentNode) {
List<BhModule> childNodes = new ArrayList<BhModule>();
for (BhModule node : nodes) {
//System.out.println(node.getParentId()+"-------"+parentNode.getId());
//子节点和父节点作对比
if (node.getParentId().equals(parentNode.getId())) {
childNodes.add(node);
}
}
return childNodes;
}
}

handler中调用这个工具类:

MenuTreeUtil menuTreeUtil = new MenuTreeUtil(moduleList, null);
List<BhModule> treeGridList = menuTreeUtil.buildTreeGrid();

即可返回树列表,剩下的事就是前端解析了。

无限级Java递归) 2007-02-08 10:26 这几天,用java写了一个无限极的递归写的,可能代码不够简洁,性能不够好,不过也算是练习,这几天再不断改进。前面几个小图标的判断,搞死我了。 package com.nickol.servlet; import java.io.IOException; import java.io.PrintWriter; import java.sql.Connection; import java.sql.PreparedStatement; import java.sql.ResultSet; import java.util.ArrayList; import javax.servlet.ServletException; import javax.servlet.http.HttpServlet; import javax.servlet.http.HttpServletRequest; import javax.servlet.http.HttpServletResponse; import com.nickol.utility.DB; public class category extends HttpServlet { /** * The doGet method of the servlet. * * This method is called when a form has its tag value method equals to get. * * @param request the request send by the client to the server * @param response the response send by the server to the client * @throws ServletException if an error occurred * @throws IOException if an error occurred */ public void doGet(HttpServletRequest request, HttpServletResponse response) throws ServletException, IOException { response.setCharacterEncoding("utf-8"); response.setContentType("text/html"); PrintWriter out = response.getWriter(); out .println(""); out.println(""); out.println(" Category" + "" + "body{font-size:12px;}" + "" + "" + ""); out.println(" "); out.println(showCategory(0,0,new ArrayList(),"0")); out.println(" "); out.println(""); out.flush(); out.close(); } public String showCategory(int i,int n,ArrayList frontIcon,String countCurrent){ int countChild = 0; n++; String webContent = new String(); ArrayList temp = new ArrayList(); try{ Connection conn = DB.GetConn(); PreparedStatement ps = DB.GetPs("select * from category where pid = ?", conn); ps.setInt(1, i); ResultSet rs = DB.GetRs(ps); if(n==1){ if(rs.next()){ webContent += "";//插入结尾的减号 temp.add(new Integer(0)); } webContent += " ";//插入站点图标 webContent += rs.getString("cname"); webContent += "\n"; webContent += showCategory(Integer.parseInt(rs.getString("cid")),n,temp,"0"); } if(n==2){ webContent += "\n"; }else{ webContent += "\n"; } while(rs.next()){ for(int k=0;k<frontIcon.size();k++){ int iconStatic = ((Integer)frontIcon.get(k)).intValue(); if(iconStatic == 0){ webContent += "";//插入空白 }else if(iconStatic == 1){ webContent += "";//插入竖线 } } if(rs.isLast()){ if(checkChild(Integer.parseInt(rs.getString("cid")))){ webContent += "";//插入结尾的减号 temp = (ArrayList)frontIcon.clone(); temp.add(new Integer(0)); }else{ webContent += "";//插入结尾的直角 } }else{ if(checkChild(Integer.parseInt(rs.getString("cid")))){ webContent += "";//插入未结尾的减号 temp = (ArrayList)frontIcon.clone(); temp.add(new Integer(1)); }else{ webContent += "";//插入三叉线 } } if(checkChild(Integer.parseInt(rs.getString("cid")))){ webContent += " ";//插入文件夹图标 }else{ webContent += " ";//插入文件图标 } webContent += rs.getString("cname"); webContent += "\n"; webContent += showCategory(Integer.parseInt(rs.getString("cid")),n,temp,countCurrent+countChild); countChild++; } webContent += "\n"; DB.CloseRs(rs); DB.ClosePs(ps); DB.CloseConn(conn); }catch(Exception e){ e.printStackTrace(); } return webContent; } public boolean checkChild(int i){ boolean child = false; try{ Connection conn = DB.GetConn(); PreparedStatement ps = DB.GetPs("select * from category where pid = ?", conn); ps.setInt(1, i); ResultSet rs = DB.GetRs(ps); if(rs.next()){ child = true; } DB.CloseRs(rs); DB.ClosePs(ps); DB.CloseConn(conn); }catch(Exception e){ e.printStackTrace(); } return child; } } --------------------------------------------------------------------- tree.js文件 function changeState(countCurrent,countChild){ var object = document.getElementById("level" + countCurrent + countChild); if(object.style.display=='none'){ object.style.display='block'; }else{ object.style.display='none'; } var cursor = document.getElementById("cursor" + countCurrent + countChild); if(cursor.src.indexOf("images/tree_minus.gif")>=0) {cursor.src="images/tree_plus.gif";} else if(cursor.src.indexOf("images/tree_minusbottom.gif")>=0) {cursor.src="images/tree_plusbottom.gif";} else if(cursor.src.indexOf("images/tree_plus.gif")>=0) {cursor.src="images/tree_minus.gif";} else {cursor.src="images/tree_minusbottom.gif";} var folder = document.getElementById("folder" + countCurrent + countChild); if(folder.src.indexOf("images/icon_folder_channel_normal.gif")>=0){ folder.src = "images/icon_folder_channel_open.gif"; }else{ folder.src = "images/icon_folder_channel_normal.gif"; }
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值