zoukankan      html  css  js  c++  java
  • 使用UltraWebTree时,如何在刷新后展开之前选中的节点,并绑定相关数据

    View Code
    /// <summary>
    /// 选择当前节点展开相关树形内容
    /// </summary>
    protected void ExtendTreeList()
    {
    object aa = this.treeList.SelectedNode.Tag;
    InitTree();

    if (this.treeList.Nodes.Count > 0)
    for (int i = 0; i < this.treeList.Nodes[0].Nodes.Count; i++)
    {
    if (this.treeList.Nodes[0].Nodes[i].Tag.ToString() == aa.ToString())
    {
    this.treeList.SelectedNode = this.treeList.Nodes[0].Nodes[i];
    treeList.Nodes[
    0].Nodes[i].Parent.Expanded = true;
    treeList.Nodes[
    0].Nodes[i].Expanded = true;
    }
    for (int j = 0; j < treeList.Nodes[0].Nodes[i].Nodes.Count; j++)
    {
    if (this.treeList.Nodes[0].Nodes[i].Nodes[j].Tag.ToString() == aa.ToString())
    {
    this.treeList.SelectedNode = this.treeList.Nodes[0].Nodes[i].Nodes[j];
    treeList.Nodes[
    0].Nodes[i].Nodes[j].Parent.Expanded = true;
    treeList.Nodes[
    0].Nodes[i].Nodes[j].Expanded = true;
    }
    for (int h = 0; h < treeList.Nodes[0].Nodes[i].Nodes[j].Nodes.Count; h++)
    {
    if (this.treeList.Nodes[0].Nodes[i].Nodes[j].Nodes[h].Tag.ToString() == aa.ToString())
    {
    this.treeList.SelectedNode = this.treeList.Nodes[0].Nodes[i].Nodes[j].Nodes[h];
    treeList.Nodes[
    0].Nodes[i].Nodes[j].Nodes[h].Parent.Expanded = true;
    treeList.Nodes[
    0].Nodes[i].Nodes[j].Nodes[h].Expanded = true;
    }
    for (int g = 0; g < treeList.Nodes[0].Nodes[i].Nodes[j].Nodes[h].Nodes.Count; g++)
    {
    if (this.treeList.Nodes[0].Nodes[i].Nodes[j].Nodes[h].Nodes[g].Tag.ToString() == aa.ToString())
    {
    this.treeList.SelectedNode = this.treeList.Nodes[0].Nodes[i].Nodes[j].Nodes[h].Nodes[g];
    treeList.Nodes[
    0].Nodes[i].Nodes[j].Nodes[h].Nodes[g].Parent.Expanded = true;

    }
    }
    }
    }
    }
    if (treeList.SelectedNode.Level == 0)
    {
    this.BindUser(-1);
    }
    else
    {
    this.BindUser(int.Parse(treeList.SelectedNode.Tag.ToString()));
    }
    }
  • 相关阅读:
    week8-A-区间选点
    C-TT的美梦
    B-dijkstra-TT的旅行日记
    week7-A-Floyd-TT的魔法猫
    Codeforces 437B The Child and Set (贡献+贪心)
    Codeforces 1236B Alice and the List of Presents(贡献)
    2019 牛客多校 第八场 B Beauty Values (贡献)
    Codeforces 1244G Running in Pairs 序列交换(贪心)
    Codeforces 1244F Chips(环修改,思维题)
    BZOJ 3784 树上的路径(点分治+ST+堆+贪心)待处理
  • 原文地址:https://www.cnblogs.com/zuifengke/p/2079874.html
Copyright © 2011-2022 走看看