zoukankan      html  css  js  c++  java
  • TreeView 查找指定节点

    /// <summary>
        /// 查找指定节点
        /// </summary>
        /// <param name="tnParent">节点</param>
        /// <param name="strValue">值</param>
        /// <returns></returns>
        private TreeNode FindNode(TreeNode tnParent, string strValue)
        {
            TreeNode treeNode2 = new TreeNode();
            string venueCode = "";
            if (tnParent == null) return null;
            if (tnParent.Value == strValue) return tnParent;
            tnParent.Expand();
            TreeNode tnRet = null;
            foreach (TreeNode tn in tnParent.ChildNodes)
            {
                //获得节点Value
                if (venueCode == "")
                {
                    //记录节点
                    treeNode2 = tn;
                    venueCode = tn.Value;
                }
                else
                {
                    //当选择节点发生变化时
                    if (venueCode != tn.Value)
                    {
                        treeNode2.Collapse();
                        venueCode = tn.Value;
                        treeNode2 = tn;
                    }
                }
    
                tnRet = FindNode(tn, strValue);
                if (tnRet != null) break;
            }
            return tnRet;
        }
    
    方法调用如下:
    //循环查找节点
    
    
    foreach (TreeNode node in this.TreeView1.Nodes)
    {
        TreeNode treeNode = FindNode(node, venueCode);
    
        if (treeNode != null)
        {
            treeNode.CollapseAll();
            treeNode.Selected = true;
            state = 1;
            break;
         }
    }
    
  • 相关阅读:
    C++中public、protected、private的差别
    TSP问题
    Android百日程序:绘画程序-画手指路径
    DFS csu1719 Boggle
    Oracle数据库imp
    <html>
    SWIFT学习笔记05
    Xcode7 真机免证书调试Cocos2D游戏
    mycat 不得不说的缘分
    HashMap和Hashtable的差别
  • 原文地址:https://www.cnblogs.com/hausthy/p/3916667.html
Copyright © 2011-2022 走看看