DevExpress TreeList使用
using System;
using System.Collections.Generic;
using System.Drawing;
using System.Windows.Forms;
using DevExpress.XtraBars;
using DevExpress.XtraTreeList;
using DevExpress.XtraTreeList.Nodes; namespace DevExpressUtilHelpV3
{
public static class TreeListToolV3
{
public delegate string BuildPathRule(string nodeText, string fullPathInfo);
/// <summary>
/// 获取选中节点到根节点的所有信息
/// </summary>
/// <param name="focusedNode">TreeListNode</param>
/// <param name="columnID">列名称</param>
/// <param name="buildPathRule">规则委托</param>
/// <returns>路径信息</returns>
public static string FullPathInfo(this TreeListNode focusedNode, string columnID, BuildPathRule buildPathRule)
{
if (focusedNode == null)
throw new ArgumentNullException("focusedNode");
if (string.IsNullOrEmpty("columnID"))
throw new ArgumentNullException("columnID");
string _fullPathInfo = string.Empty;
_fullPathInfo = focusedNode.GetDisplayText(columnID);
while (focusedNode.ParentNode != null)
{
focusedNode = focusedNode.ParentNode;
string _nodeText = focusedNode.GetDisplayText(columnID).Trim();
_fullPathInfo = buildPathRule(_nodeText, _fullPathInfo);
}
return _fullPathInfo;
}
public delegate bool CompareNodeRule(TreeListNode focusedNode);
/// <summary>
/// 获取筛选节点到根节点的所有信息
/// </summary>
/// <param name="focusedNode">TreeListNode</param>
/// <param name="columnID">列名称</param>
/// <param name="compareNodeRule">规则委托</param>
/// <param name="buildPathRule">规则委托</param>
/// <returns>路径信息</returns>
public static string FilterPathInfo(this TreeListNode focusedNode, string columnID, CompareNodeRule compareNodeRule, BuildPathRule buildPathRule)
{
if (focusedNode == null)
throw new ArgumentNullException("focusedNode");
if (string.IsNullOrEmpty("columnID"))
throw new ArgumentNullException("columnID");
string _fullPathInfo = string.Empty;
_fullPathInfo = focusedNode.GetDisplayText(columnID);
while (focusedNode.ParentNode != null)
{
focusedNode = focusedNode.ParentNode;
if (compareNodeRule(focusedNode))
{
string _nodeText = focusedNode.GetDisplayText(columnID).Trim();
_fullPathInfo = buildPathRule(_nodeText, _fullPathInfo);
}
}
return _fullPathInfo;
}
/// <summary>
/// 递归遍历树节点
/// </summary>
/// <param name="tree"></param>
/// <param name="opreateRule"></param>
public static void LoopTree(this TreeList tree, Action<TreeListNode> opreateRule)
{
if (tree == null)
throw new ArgumentNullException("tree");
foreach (TreeListNode node in tree.Nodes)
{
opreateRule(node);
if (node.Nodes.Count > )
{
LoopTreeNodes(node, opreateRule);
}
}
}
/// <summary>
/// 递归遍历TreeListNode节点
/// </summary>
/// <param name="node"></param>
/// <param name="opreateRule"></param>
public static void LoopTreeNodes(this TreeListNode node, Action<TreeListNode> opreateRule)
{
if (node == null)
throw new ArgumentNullException("node");
foreach (TreeListNode _childNode in node.Nodes)
{
opreateRule(_childNode);
LoopTreeNodes(_childNode, opreateRule);
}
}
/// <summary>
/// 递归遍历TreeListNode,当opreateRule返回false停止循环
/// </summary>
/// <param name="node">TreeListNode</param>
/// <param name="opreateRule">Func<TreeListNode, bool></param>
public static void LoopTreeNodes_Break(this TreeListNode node, Func<TreeListNode, bool> opreateRule)
{
if (node == null)
throw new ArgumentNullException("node");
foreach (TreeListNode _childNode in node.Nodes)
{
if (!opreateRule(_childNode))
break;
LoopTreeNodes_Break(_childNode, opreateRule);
}
}
/// <summary>
/// 递归遍历TreeListNode,当opreateRule返回false跳出循环,直接进入下次循环
/// </summary>
/// <param name="node">TreeListNode</param>
/// <param name="opreateRule">Func<TreeListNode, bool></param>
public static void LoopTreeNodes_Continue(this TreeListNode node, Func<TreeListNode, bool> opreateRule)
{
if (node == null)
throw new ArgumentNullException("node");
foreach (TreeListNode _childNode in node.Nodes)
{
if (!opreateRule(_childNode))
continue;
LoopTreeNodes_Continue(_childNode, opreateRule);
}
}
public delegate bool CheckNodeRule(TreeListNode fucusedNode);
public delegate void CheckNodeNullRule();
/// <summary>
/// 节点为null检查
/// </summary>
/// <param name="fucusedNode">TreeListNode</param>
/// <param name="checkNodeRule">若为NULL,处理逻辑</param>
/// <returns>TreeListNode</returns>
public static TreeListNode CheckNull(this TreeListNode fucusedNode, CheckNodeNullRule checkNodeRule)
{
if (fucusedNode == null)
{
checkNodeRule();
return null;
}
return fucusedNode;
}
/// <summary>
/// 正对节点的检查逻辑
/// </summary>
/// <param name="fucusedNode">TreeListNode</param>
/// <param name="checkNodeRule">检查逻辑代码[委托]</param>
/// <returns>TreeListNode</returns>
public static TreeListNode Check(this TreeListNode fucusedNode, CheckNodeRule checkNodeRule)
{
if (fucusedNode != null)
return checkNodeRule(fucusedNode) == true ? fucusedNode : null;
return null;
}
/// <summary>
/// 水平滚动条
/// </summary>
/// <param name="tree">TreeList</param>
public static void HorzScroll(this TreeList tree)
{
if (tree == null)
throw new ArgumentNullException("tree");
tree.OptionsView.AutoWidth = false;
tree.BestFitColumns();
tree.HorzScrollVisibility = ScrollVisibility.Always;
}
/// <summary>
/// 为TreeList附加右键菜单
/// MouseUp(object sender, MouseEventArgs e)事件中调用
/// </summary>
/// <param name="tree">TreeList</param>
/// <param name="e">MouseEventArgs</param>
/// <param name="menu">PopupMenu</param>
/// <param name="attachMenuRule">AttachMenuRule</param>
public static void AttachMenu(this TreeList tree, MouseEventArgs e, PopupMenu menu, Func<TreeListNode, bool> attachMenuRule)
{
if (tree == null)
throw new ArgumentNullException("tree");
if (menu == null)
throw new ArgumentNullException("menu");
if (e.Button == MouseButtons.Right && Control.ModifierKeys == Keys.None && tree.State == TreeListState.Regular)
{
Point _point = new Point(Cursor.Position.X, Cursor.Position.Y);
TreeListHitInfo _hitInfo = tree.CalcHitInfo(e.Location);
if (_hitInfo.HitInfoType == HitInfoType.Cell)
tree.SetFocusedNode(_hitInfo.Node);
if (attachMenuRule(tree.FocusedNode))
menu.ShowPopup(_point);
}
}
/// <summary>
/// 设置父节点的状态AfterCheckNode(object sender, NodeEventArgs e)
/// </summary>
/// <param name="node"></param>
/// <param name="check"></param>
public static void ProcessNodeCheckState(this TreeListNode node, CheckState check)
{
if (node == null)
throw new ArgumentNullException("node");
SetCheckedChildNodes(node, check);
SetCheckedParentNodes(node, check);
}
/// <summary>
/// 设置子节点CheckState
/// </summary>
/// <param name="node"></param>
/// <param name="check"></param>
private static void SetCheckedChildNodes(TreeListNode node, CheckState check)
{
if (node != null)
{
node.LoopTreeNodes((TreeListNode _node) =>
{
_node.CheckState = check;
});
}
}
/// <summary>
/// 设置父节点CheckState
/// </summary>
/// <param name="node"></param>
/// <param name="check"></param>
private static void SetCheckedParentNodes(TreeListNode node, CheckState check)
{
if (node.ParentNode != null)
{
bool _checkStatus = false;
CheckState _nodeState;
node.LoopTreeNodes_Break((TreeListNode _node) =>
{
_nodeState = _node.CheckState;
if (!check.Equals(_nodeState))
{
_checkStatus = !_checkStatus;
return false;//跳出循环
}
return true;//继续循环
});
node.ParentNode.CheckState = _checkStatus ? CheckState.Indeterminate : check;
SetCheckedParentNodes(node.ParentNode, check);
}
}
/// <summary>
/// 根据CheckState获取TreeListNode
/// </summary>
/// <param name="tree">TreeList</param>
/// <param name="state">CheckState</param>
/// <param name="GetNodesByStateRule">返回True的时候继续</param>
/// <returns>TreeListNode集合</returns>
public static List<TreeListNode> GetNodesByState(this TreeList tree, CheckState state, Func<TreeListNode, bool> GetNodesByStateRule)
{
if (tree == null)
throw new ArgumentNullException("tree");
List<TreeListNode> _checkNodes = new List<TreeListNode>();
tree.LoopTree((TreeListNode node) =>
{
if (GetNodesByStateRule(node))
{
if (node.CheckState == state)
_checkNodes.Add(node);
}
});
return _checkNodes;
}
}
}
DevExpress TreeList使用的更多相关文章
- Devexpress TreeList控件绑定显示父子节点对像
今天一位同事咨询Devexpress TreeList控件绑定自动显示父子节点对像,但结果是不会显示带父子节点关系,而是将所有的节点作为父节点显示出来了,对像类的代码如下 public class I ...
- 如何让DevExpress TreeList的每个结点高亮显示?
概述:如何让DevExpress TreeList的每个节点高亮显示? 如何让DXperience TreeList的每个节点高亮显示? 效果如下: private void treeList1_Cu ...
- How to easily create popup menu for DevExpress treelist z
http://www.itjungles.com/how-to-easily-create-popup-menu-for-devexpress-treelist.html Adding popup m ...
- DevExpress TreeList使用教程之绑定多级树
DevExpress TreeList使用教程之绑定多级树 概述:TreeList控件可以同时显示树结构和其他数据列,即在一个列上建立父子关系展开或收缩,同时还可以显示其他列的内容.在TreeLi ...
- DevExpress TreeList 全选和反选 z
/// <summary> /// 全选树 /// </summary> /// <param name="tree">树控件</para ...
- Devexpress treelist 树形控件 实现带三种状态的CheckBox
树形控件是使用频率很高的一种控件.对于属性控件往往需要下面两个功能 1.TreeList带有CheckBox,并且节点要有三种状态(所有的子节点都选中,所有的子节点都没选择,一部分子节点选中).使用 ...
- Devexpress TreeList选择父级联动
Treelist当显示复选框后,父级和子级的复选框没有关联,使用过程中很不便,如图所示 自己给treelist添加父子级联动 /// <summary> /// 初始化TreeList,父 ...
- DevExpress TreeList 拖动时中如何判断源节点作为目标节点的子节点还是兄弟节点
目的:只允许同级拖动. 两个判断: 1.原节点(假设为:S)的父级如果不等于目标节点(假设为:T)的父节点,那么发生了跨级,即非同级移动.这个判断很容易. 2.S.T是同一级的,但是S是移动到T下一级 ...
- Devexpress TreeList 展开和折叠当前选中节点
1.展开: private void barButtonItem6_ItemClick(object sender, DevExpress.XtraBars.ItemClickEventArgs e) ...
- DevExpress TreeList用法总结
http://blog.itpub.net/29251214/viewspace-774395/ http://blog.csdn.net/czp_huster/article/details/501 ...
随机推荐
- 前端读者 | CSS三角形和饼图
@羯瑞 三角形 .triangle{width:0;height:0;border-width:50px;border-style:solid;border-color:red blue green ...
- LOJ #6280. 数列分块入门 4-分块(区间加法、区间求和)
#6280. 数列分块入门 4 内存限制:256 MiB时间限制:500 ms标准输入输出 题目类型:传统评测方式:文本比较 上传者: hzwer 提交提交记录统计测试数据讨论 题目描述 给出一个 ...
- java汉字获取首字母
前言 在项目中很多时候我们需要获取姓名或者名称的首字母或者全拼,以用于模糊查询或者字母查询,在这里分享一个实例:供小伙伴们参考. 导入jar包 <dependency> <group ...
- Linux的重定向与管道
(1).输出重定向 定义:将命令的标准输出结果保存到指定的文件中,而不是直接显示在显示器上. 输出重定向使用>和>>操作符. 语法:cmd > filename,表示将标准输出 ...
- Python开发基础-Day14正则表达式和re模块
正则表达式 就其本质而言,正则表达式(或 re)是一种小型的.高度专业化的编程语言,(在Python中)它内嵌在Python中,并通过 re 模块实现.正则表达式模式被编译成一系列的字节码,然后由用 ...
- nyoj 1007 GCD(数学题 欧拉函数的应用)
GCD 描述 The greatest common divisor GCD(a,b) of two positive integers a and b,sometimes written (a,b) ...
- luogu P1002 过河卒
题目描述 棋盘上A点有一个过河卒,需要走到目标B点.卒行走的规则:可以向下.或者向右.同时在棋盘上C点有一个对方的马,该马所在的点和所有跳跃一步可达的点称为对方马的控制点.因此称之为“马拦过河卒”. ...
- 【DFS】【打表】Lattice Animals
[ZOJ2669]Lattice Animals Time Limit: 5 Seconds Memory Limit: 32768 KB Lattice animal is a set o ...
- [Luogu1462]通往奥格瑞玛的道路
题目大意: 一个n个点,m条边的图,每个边有一个边权,每个点也有一个点权. 现在要找一条从1到n的路径,保证边权和不超过b的情况下,最大点权尽量小. 问最大点权最小能是多少? 思路: 二分答案,然后D ...
- JVM命令-java服务器故障排查
一.top(Linux命令) 执行top命令: (查看进程15477的详细情况,下文用到) 系统信息(前五行): 第1行:Top 任务队列信息(系统运行状态及平均负载),与uptime命令结果相 ...