不用第归算法快速显示树，对于Oracle数据库(2)

            RootNode.Expand ();

            Cursor.Current =Cursors.Default ;

        }

// <summary>

        /// 构造一个动态数组，模拟树控件一个分叉的线性结构，每一次都是最新的线性结构，这整个控件关键地方

        /// </summary>

        /// <param name="strID">层次</param>

        /// <param name="MatID">物料编码</param>

        /// <param name="nodeF">父节点</param>

        /// <returns>构造的节点</returns>。

        private BQ_TreeNode MakeArray(string strID,string MatID,out BQ_TreeNode nodeF)  {

            try

            {

                BQ_TreeNode node=new BQ_TreeNode (MatID);          

                node.MatID =MatID;                                     

                BQ_TreeNode nodeRet=null;

                int nGrade=int.Parse (strID);

                if(nGrade==0)

                {

                }

                else

                {

                    if(alNode.Count>=nGrade+1)

                    {

                        alNode[nGrade]=node;

                        nodeRet=(BQ_TreeNode)alNode[nGrade-1];

                    }

                    else

                    {

                        alNode.Add (node);

                        nodeRet=(BQ_TreeNode)alNode[nGrade-1];

                    }

                }

                nodeF=nodeRet;

                return node;

      &n

上一页  [1] [2] [3] [4]  下一页

Copyright ＠ 2007-2012 敏韬网(敏而好学，文韬武略--MinTao.Net)（学习笔记） Inc All Rights Reserved.
闵涛 E_mail:admin@mintao.net(欢迎提供学习资源)

鄂公网安备 42011102001154号

站长：MinTao ICP备案号：鄂ICP备11006601号-18