2023年6月22日发(作者：)

TreeView节点上移下移排序 ///

/// 选中节点上移⽅法 ///

/// private void SetTreeNodeUp(TreeNode node) { if ((node == null) || (de) == null) return; TreeNode newNode = (TreeNode)(); //数据表的移动 if ( == 1) { object[] _rowData = [].ItemArray; [].ItemArray = [ - 1].ItemArray; [ - 1].ItemArray = _rowData; } if ( == 2) { DataTable dt = new DataTable(); dt = (DataTable)SearchChildDataTableArr[]; object[] _rowData = [].ItemArray; [].ItemArray = [ - 1].ItemArray; [ - 1].ItemArray = _rowData; } //节点的移动 if (de != null) { if ( != null) ( , newNode); else (, newNode); } else if ( != null) (, newNode); else (, newNode); edNode = newNode; (node); } ///

/// 选中节点下移⽅法 ///

/// private void SetTreeNodeDown(TreeNode node) { if ((node == null) || (de) == null) return; TreeNode newNode = (TreeNode)(); //数据表的移动 if ( == 1) { object[] _rowData = [].ItemArray; [].ItemArray = [ + 1].ItemArray; [ + 1].ItemArray = _rowData; } if ( == 2) { DataTable dt = new DataTable(); dt = (DataTable)SearchChildDataTableArr[]; object[] _rowData = [].ItemArray; [].ItemArray = [ + 1].ItemArray; [ + 1].ItemArray = _rowData; } //节点的移动 if (de != null) { if ( != null) (, newNode); else (, newNode); } else if ( != null) (newNode); else (newNode); edNode = newNode; (node); }