java 树形菜单遍历_java实现遍历树形菜单方法——service层

Service接口:

/**

* @Title: IVoteTreeService.java

* @Package org.Service

* @Description: TODO该方法的主要作用:

* @author A18ccms A18ccms_gmail_com

* @date 2017-5-6 下午10:42:10

* @version V1.0

*/

package org.Service;

import java.util.List;

import net.sf.json.JSONArray;

import net.sf.json.JSONObject;

import org.entity.VoteTree;

/**

*

* 项目名称:testTree

* 类名称:IVoteTreeService

* 类描述:

* 创建人:Mu Xiongxiong

* 创建时间:2017-5-6 下午10:42:10

* 修改人:Mu Xiongxiong

* 修改时间:2017-5-6 下午10:42:10

* 修改备注:

* @version

*

*/

public interface IVoteTreeService {

public JSONArray getTreeJson();

List treeList();

}

Service实现类:

/**

* @Title: VoteTreeServiceImpl.java

* @Package org.Service.impl

* @Description: TODO该方法的主要作用:

* @author A18ccms A18ccms_gmail_com

* @date 2017-5-6 下午10:43:10

* @version V1.0

*/

package org.Service.impl;

import java.util.ArrayList;

import java.util.HashMap;

import java.util.List;

import java.util.Map;

import net.sf.json.JSONArray;

import net.sf.json.JSONObject;

import org.Service.IVoteTreeService;

import org.dao.IVoteTreeDao;

import org.dao.impl.IVoteTreeDaoImpl;

import org.entity.VoteTree;

import org.junit.Test;

import com.alibaba.fastjson.JSON;

import com.sun.org.apache.xerces.internal.parsers.IntegratedParserConfiguration;

/**

*

* 项目名称:testTree

* 类名称:VoteTreeServiceImpl

* 类描述:

* 创建人:Mu Xiongxiong

* 创建时间:2017-5-6 下午10:43:10

* 修改人:Mu Xiongxiong

* 修改时间:2017-5-6 下午10:43:10

* 修改备注:

* @version

*

*/

public class VoteTreeServiceImpl implements IVoteTreeService {

IVoteTreeDao voteTreeDao = new IVoteTreeDaoImpl();

public JSONArray getTreeJson(){

Map treeMap = new HashMap();

Map treejsonMap = new HashMap();

treeMap.put("id",1);

treeMap.put("text", "用户");

treeMap.put("children", treeList());

JSONArray jsonObject = JSONArray.fromObject(treeMap);

return jsonObject;

}

@Override

public List treeList() {

List nextSubSet = new ArrayList();

//最小的level

Long minLevel =voteTreeDao.minId();

//一级目录

List friList = voteTreeDao.getFirstLevel(minLevel);

for (VoteTree voteTree : friList) {

//根据一级目录查找所有的子集

voteTree.setChildren(nextSubSet);

nextSubSet =voteTreeDao.getNextSubSet(voteTree);

}

return nextSubSet;

}

}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
无限级树(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、付费专栏及课程。

余额充值