zoukankan      html  css  js  c++  java
  • Winform TreeView 查找下一个节点

    转载:http://www.cnblogs.com/Ruiky/archive/2013/02/01/2888674.html

    public static class TreeViewHelper
        {
            private static IEnumerable<TreeNode> childNodes(this TreeNode node)
            {
                return node.Nodes.Cast<TreeNode>()
                           .SelectMany(x => x.selfAndChildNodes());
            }
     
            private static IEnumerable<TreeNode> selfAndChildNodes(this TreeNode node)
            {
                return new List<TreeNode>() { node }
                           .Union(node.Nodes.Cast<TreeNode>()
                           .SelectMany(x => x.selfAndChildNodes()));
            }
     
            private static IEnumerable<TreeNode> nextNodes(this TreeView tree, TreeNode node)
            {
                bool after = false;
                if (node.Parent == null)
                    return tree.Nodes.Cast<TreeNode>()
                               .Select(x => { bool b = after = after || (node == x); return new { x, b }; })
                               .Where(x => x.b && x.x != node)
                               .SelectMany(x => new List<TreeNode>() { x.x }.Union(x.x.childNodes()));
                else
                    return node.Parent.Nodes.Cast<TreeNode>()
                               .Select(x => { bool b = after = after || (node == x); return new { x, b }; })
                               .Where(x => x.b && x.x != node)
                               .SelectMany(x => new List<TreeNode>() { x.x }.Union(x.x.childNodes()))
                               .Union(tree.nextNodes(node.Parent));
            }
     
            public static IEnumerable<TreeNode> NextNodes(this TreeView tree, TreeNode node)
            {
                if (tree == null || node == null)
                    return new List<TreeNode>();
                return node.childNodes().Union(tree.nextNodes(node));
            }
     
            public static IEnumerable<TreeNode> NextNodes(this TreeView tree)
            {
                if (tree == null || tree.SelectedNode == null)
                    return new List<TreeNode>();
                return tree.NextNodes(tree.SelectedNode);
            }
        }
    

      

      如何调用:

    var tn = _Tv.NextNodes().FirstOrDefault(x => Regex.IsMatch(x.Text, "(?i)" + txtKey.Text.Trim()));

     if (tn == null)                

        MessageBox.Show("查找完毕");            

    else                

    _Tv.SelectedNode = tn;

    复制代码
    public static IEnumerable<TreeNode> TreeWhere(this TreeNodeCollection tds, Func<TreeNode, bool> Fun)
            {
                foreach (TreeNode item in tds)
                {
                    if (Fun(item))
                        yield return item;
    
                    var list = item.Nodes.TreeWhere(Fun);
                    foreach (var item1 in list)
                        yield return item1;
                }
            }
    复制代码

    如何调用:

     var tn = treeView1.Nodes.TreeWhere(x => Regex.IsMatch(x.Text, @"(?i)" + txtKey.Text.Trim()));

     
    分类: C#,WinForm
  • 相关阅读:
    兜底方案只能用来兜底,而不能完全依靠它---记一次数据库唯一索引DuplicateKeyException异常的优化
    不注重开发细节,活该你忙!
    二叉树存储
    并查集模板
    684. 冗余连接
    820. 单词的压缩编码
    1102. 得分最高的路径
    滑动窗口模板
    古道西风“瘦马”
    西江月·凉凉
  • 原文地址:https://www.cnblogs.com/51net/p/5927209.html
Copyright © 2011-2022 走看看