查找树中的节点(text,tag,全路径)

   #region 查找节点
        /// <summary>
        /// 根据节点名查找节点
        /// </summary>
        /// <param name="treeview">查找的树</param>
        /// <param name="FindName">节点命</param>
        /// <returns>返回节点数组</returns>
        public TreeNode[] FindTreeNodeFromNodeName(TreeView treeview, string FindName)
        {
            return treeview.Nodes.Find(FindName, true);
        }

        /// <summary>
        /// 根据全路径查找节点
        /// </summary>
        /// <param name="treeview">要查找的树</param>
        /// <param name="fullPath">全路径</param>
        /// <returns>返回节点</returns>
        public TreeNode FindTreeNodeByNodeFullPath(TreeView treeview, string fullPath)
        {

            string nodeText = "";
            if (fullPath.IndexOf("\\") > 0)
            {
                nodeText = fullPath.Substring(fullPath.LastIndexOf("\\") + 1);
            }
            else
            {
                nodeText = fullPath;
            }
            TreeNode[] tns;
            tns = FindTreeNodeFromNodeName(treeview, nodeText);
            foreach (TreeNode tnode in tns)
            {
                if (tnode.FullPath == fullPath)
                {
                    return tnode;
                }
            }
            return null;

        }

        /// <summary>
        /// 查找树节点根据tag
        /// </summary>
        /// <param name="treeview">要查找的树</param>
        /// <param name="treeTag">treetag</param>
        /// <returns></returns>
        public TreeNode[] FindTreeNodeByNodeTag(TreeView treeview, string treeTag)
        {

            if (treeview.Nodes == null)
            {
                return null;
            }
            TreeNode[] treeNodeList = null;
            ArrayList treelist = new ArrayList();
            foreach (TreeNode  trnode in treeview.Nodes)
            {
                FindTreeNodeFromTag(trnode, treeTag, ref treelist);
            }

            if (treelist.Count > 0)
            {
                treeNodeList = new TreeNode[treelist.Count];
                for (int i = 0; i < treelist.Count; i++)
                {

                    treeNodeList[i] = (TreeNode)treelist[i];
               
                }
            }
            return treeNodeList;
       
        }

        /// <summary>
        ///  查找具体的tag
        /// </summary>
        /// <param name="trnode"></param>
        /// <param name="treeTag"></param>
        /// <param name="treelist"></param>
        private void FindTreeNodeFromTag(TreeNode trnode, string treeTag, ref ArrayList treelist)
        {
            if (trnode.Tag != null && trnode.Tag.ToString() == treeTag)
            {
                treelist.Add(trnode);
            }
            foreach (TreeNode anode in trnode.Nodes)
            {
                 FindTreeNodeFromTag(anode, treeTag,ref treelist);
            }


        }


        #endregion

转载于:https://www.cnblogs.com/zhbsh/archive/2011/05/26/2057732.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值