tree.cs

来自「企业网站前台后台源程序,用于大中小型企业网站后台程序开发」· CS 代码 · 共 68 行

using System;
using System.Data;
using Socut.Data;


namespace BLL
{
	/// <summary>
	/// tree 的摘要说明。
	/// </summary>
	public class tree
	{
	
/// <summary>
/// 后台树目录
/// </summary>
/// <returns></returns>
		public string tree_menu()
		{
			DataSet ds = new DataSet();
			CData myData = new CData();
			string tree = "";
			string sql = "select * from tree order by ID";
			ds = myData.GetDataSet(sql, 0, 0, "tree");
			foreach (DataRow dr in ds.Tables["tree"].Rows)
			{
				tree += "tree.nodes[\"" + dr["parentId"].ToString() + "_" + dr["id"] + "\"] =\"text:" + dr["text"] + ";";
				if (dr["hint"].ToString() != "") tree += "hint:" + dr["hint"] + ";";
				if (dr["icon"].ToString() != "") tree += "icon:" + dr["icon"] + ";";
				if (dr["data"].ToString() != "") tree += "data:" + dr["data"] + ";";
				if (dr["url"].ToString() != "") tree += "url:" + dr["url"] + ";";
				if (dr["target"].ToString() != "") tree += "target:" + dr["target"] + ";";
				if (dr["method"].ToString() != "") tree += "method:" + dr["method"] + ";";
				tree += "\"\n";


			} 
			return tree;
		}
/// <summary>
/// 产品类别信息
/// </summary>
/// <returns></returns>
		public string positon_sort()
		{
			DataSet ds = new DataSet();
			CData myData = new CData();
			string tree = "";
			string sql = "select * from THESORT order by ID";
			ds = myData.GetDataSet(sql, 0, 0, "tree");
			foreach (DataRow dr in ds.Tables["tree"].Rows)
			{
				tree += "tree.nodes[\"" + dr["parentId"].ToString() + "_" + dr["id"] + "\"] =\"text:" + dr["text"] + ";";
				if (dr["hint"].ToString() != "") tree += "hint:" + dr["hint"] + ";";
				if (dr["icon"].ToString() != "") tree += "icon:" + dr["icon"] + ";";
				if (dr["data"].ToString() != "") tree += "data:" + dr["data"] + ";";
				if (dr["url"].ToString() != "") tree += "url:" + dr["url"] + ";";
				if (dr["target"].ToString() != "") tree += "target:" + dr["target"] + ";";
				if (dr["method"].ToString() != "") tree += "method:" + dr["method"] + ";";
				tree += "\"\n";


			} 
			return tree;
		}
	}
}