zoukankan      html  css  js  c++  java
  • 递归展开tree所有节点

    public static client void expandTree(FormTreeControl _formTreeControl, TreeItemIdx _treeItemIdx, int _toLevel = 0, int _level = 0)

    {

        FormTreeItem    formTreeItem;

        TreeItemIdx     treeItemIdx = _treeItemIdx;

        int             level       = _level;

     

        while(treeItemIdx)

        {

            formTreeItem = _formTreeControl.getItem(treeItemIdx);

            level++;

     

            if (!formTreeItem.stateExpandedOnce())

            {

                _formTreeControl.expand(formTreeItem.idx());

            }

     

            if (_formTreeControl.getChild(formTreeItem.idx()))

            {

                if (!formTreeItem.children())

                {

                    formTreeItem.children(true);

                    _formTreeControl.setItem(formTreeItem);

                    _formTreeControl.expand(formTreeItem.idx());

                }

     

                if (!_toLevel ||

                    _toLevel > level)

                {

                    SysFormTreeControl::expandTree(_formTreeControl,_formTreeControl.getChild(formTreeItem.idx()), _toLevel, level);

                }

            }

            else

            {

                if (formTreeItem.children())

                {

                    formTreeItem.children(false);

                    _formTreeControl.setItem(formTreeItem);

                }

            }

     

            treeItemIdx = _formTreeControl.getNextSibling(formTreeItem.idx());

        }

    }

  • 相关阅读:
    hdu 5795 A Simple Nim 博弈sg函数
    hdu 5724 Chess 博弈sg+状态压缩
    hdu 3094 A tree game 树上sg
    2017"百度之星"程序设计大赛
    hdu 6134 Battlestation Operational 莫比乌斯反演
    HDU 6143 Killer Names DP+快速密
    HDU 6107 Typesetting 倍增
    HDU 6096 String 排序 + 线段树 + 扫描线
    HDU 6086 Rikka with String AC自动机 + DP
    HDU 6073 Matching In Multiplication dfs遍历环 + 拓扑
  • 原文地址:https://www.cnblogs.com/perock/p/2291339.html
Copyright © 2011-2022 走看看