无限级javascript树形菜单

 

<html>

<head>
<title>无限级树形菜单</title>
<style>
#A1 td { vertical-align: top; }
#A1 td.bj { font-family: Wingdings; color: #FF9933; text-align: center; }
#A1 td.bj , #A1 td.kg { width: 24; }
#A1 a:link , #A1 a: visited   { color: #cc0080; text-decoration: none; }
#A1 a:hover { color: #0ff080; text-decoration: none; }
</style>

<script language="JavaScript">

function m_start(name,tt)     //菜单组开始
{
   document.writeln('<tr><td class="bj">'+(tt==1?'1':'0')+'</td>');
   document.writeln('<td><a href="#" οnclick="zgmm()">'+name+'</a></td>');
   document.writeln('</tr>');
   document.writeln('<tr style="display: '+(tt==1?'block':'none')+';">');
   document.writeln('<td class="bj"> </td>');
   document.writeln('<td>');
   document.writeln('<table border="0" cellpadding="0" cellspacing="0">');
}

function m_end()     //菜单组结束
{
   document.writeln('</table></td></tr>');
}

function add_Sub(name,url,kj)     //添加菜单项
{
   document.writeln('<tr><td class="bj">2</td><td>');
   document.writeln('<a target="'+kj+'" href="'+url+'">'+name+'</a>');
   document.writeln('</td></tr>');
}

function zgmm()
{
//当前发生事件的对象的父对象的上一个兄弟对象
   var ero = event.srcElement.parentElement.previousSibling;
//当前发生事件的对象的父对象的父对象的下一个兄弟对象
   var mo = event.srcElement.parentElement.parentElement.nextSibling;
   mo.style.display = (mo.style.display=="none")?"block":"none";
   ero.innerHTML = (mo.style.display=="none")?"0":"1";
}
</script>
</head>

<body>

<table border="0" cellpadding="0" cellspacing="0" width="100%" id="A1">
<script language="JavaScript">
//    说明:
//    菜单组开始,m_start(name,tt); name为菜单组名称,tt为1菜单组初始时展开,为0不展开
//    菜单组结束:m_end();
//    添加菜单项:add_Sub("菜单项名称","url地址","框架名");
m_start("root",0);
m_start("1.1",0);
   m_start("1.1.1",0);
     add_Sub("1.1.1.1","http://www.csdn.net/","_blank");
     add_Sub("1.1.1.2","#","_blank");
     add_Sub("1.1.1.3","#","_blank");
   m_end();
   m_start("1.1.2",0);
     add_Sub("1.1.2.1","#","_blank");
     add_Sub("1.1.2.2","#","_blank");
     add_Sub("1.1.2.3","#","_blank");
   m_end();
     m_start("1.1.3",0);
     add_Sub("1.1.3.1","#","_blank");
     add_Sub("1.1.3.2","#","_blank");
     add_Sub("1.1.3.3","#","_blank");
   m_end();
   add_Sub("1.1.4","#","_blank");
   add_Sub("1.1.5","#","_blank");
   add_Sub("1.1.6","#","_blank");
m_end();
m_start("1.2",0);
   add_Sub("1.2.1","#","_blank");
   add_Sub("1.2.2","#","_blank");
   add_Sub("1.2.3","#","_blank");
m_end();
m_start("1.3",0);
   add_Sub("1.3.1","#","_blank");
   add_Sub("1.3.2","#","_blank");
   add_Sub("1.3.3","#","_blank");
m_end();
add_Sub("1.4","#","_blank");
add_Sub("1.5","#","_blank");
m_end();

</script>
</table>

</body>

</html>

  • 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、付费专栏及课程。

余额充值