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());

        }

    }

  • 相关阅读:
    p2394 精度题
    线性筛素数
    poj3468 线段树的懒惰标记
    逆元
    2018 Multi-University Training Contest 2
    2018 Multi-University Training Contest 1
    判断素数遇到的问题
    Mergeable Stack(链表实现栈)
    组合数
    poj2594 机器人寻找宝藏(最小路径覆盖)
  • 原文地址:https://www.cnblogs.com/perock/p/2291339.html
Copyright © 2011-2022 走看看