zoukankan      html  css  js  c++  java
  • js 树的几个小技巧

    function s()
       {
    var clickedNodeIndex=left_TreeView1.clickedNodeIndex;
       
    var nodeArray=new Array();
       
    var i=clickedNodeIndex.lastIndexOf('.');
       
    var pIndex;
       
    if(i==-1){
             nodeArray
    =left_TreeView1.getChildren();
                 }
         
    else
    {
    pIndex
    =clickedNodeIndex.substring(0,i);
    var pNode=left_TreeView1.getTreeNode(pIndex);
    nodeArray
    =pNode.getChildren();
    }
    for(i=0;i<nodeArray.length;i++)
    {
    var index;
    if(pIndex==null)
    {index 
    = i + '';
    }
    else
    {index 
    = pIndex + ';' + i;}
    var cNode;
    cNode
    =nodeArray[i];
    if(index!=clickedNodeIndex)
    {cNode.setAttribute('Expanded',
    false);}}}

      
    function GetNode()
          {
             
    var choose;
             
    var indexid;
             indexid
    =left_TreeView1.clickedNodeIndex;
             
    if (left_TreeView1.getTreeNode(indexid).getAttribute('Checked'))
              { 
                choose
    =true;
               }
              
    else
              { 
                 choose
    =false;
               }
         
         
                 
    var Nodelist=new Array();
                Nodelist
    =left_TreeView1.getChildren();
                
    for(j=0;j<Nodelist.length ;j++)
                {
     
                    
    if  (indexid.charAt(0)=='0|| indexid.charAt(0)=='2|| indexid.charAt(0)=='3|| indexid.charAt(0)=='1')
                  {
                   
                   
    if (j!=indexid.charAt(0)) 
                    {
                        
    var temp=j+'';
                  
                       left_TreeView1.getTreeNode(temp).setAttribute('Checked',
    false);
                 
                       
    var no=new Array();
                        no
    =left_TreeView1.getTreeNode(temp).getChildren();
                        
    for(k=0;k<no.length ;k++)
                         {
                            
    var temp1=temp+'.'+k;
                            left_TreeView1.getTreeNode(temp1).setAttribute('Checked',
    false);
                         }
                     }
                  }
                 }
                       
                
    if (choose==true
                {
                   
               }
                  
    else
                {
                  
                 } 
                 
               
    var child=indexid.charAt(0);
                
    var temp3= new Array();
                temp3
    =left_TreeView1.getTreeNode(child).getChildren();
                  document.all.left_TextBox1.value
    ='';var flag_select=0 ;
                  
    for(l=0;l<temp3.length ;l++)
                         {
                            
    var temp4=child+'.'+l;
                            
                           
    if ( left_TreeView1.getTreeNode(temp4).getAttribute('Checked')==true)
                                {
                                   document.all.left_TextBox1.value
    = document.all.left_TextBox1.value+left_TreeView1.getTreeNode(temp4).getAttribute('NodeData')+'|';
                                   flag_select
    =flag_select+1;
                                    
                                }
                               
    if (flag_select>0)
                            
                               {  document.all.left_TextBox2.value
    =indexid.charAt(0);
                             
                                } 
                              
    else
                             { 
                              document.all.left_TextBox2.value
    ='';
                               }
                         }


                 
    var NodeArray=new Array();
                 NodeArray
    =left_TreeView1.getTreeNode(indexid).getChildren();
                
    for(i=0;i<NodeArray.length;i++)
               {
                  
    var tempindex=indexid+'.'+i;
                  left_TreeView1.getTreeNode(tempindex).setAttribute('Checked',choose);
                  
    if (choose==true)
                      {
                       document.all.left_TextBox1.value
    ='0';
                       document.all.left_TextBox2.value
    =indexid;
                      }
                 
    else
                      {
                      document.all.left_TextBox1.value
    ='';;
                        document.all.left_TextBox2.value
    ='';;
                      }
                  }


        
            }
  • 相关阅读:
    NVelocity语法
    Linux C socket 编程之UDP
    MFC之Radio Button按钮学习 转载
    动态加载DLL
    JS中 判断一个整数是偶数还是奇数,并输出判断结果。
    JS中判断一个整数,属于哪个范围:大于0;小于0;等于0
    JS输入分数,判定成绩等级(if和switch两种写法)
    JS中根据输入的三个数字,判断是这一年的第几天。
    JS中开发一款软件,根据公式(身高108)*2=体重,可以有10斤左右的浮动。来观察测试者体重是否合适。
    php 多语言(UTF8编码)导出Excel、CSV乱码解决办法之导出UTF8编码的Excel、CSV
  • 原文地址:https://www.cnblogs.com/gwazy/p/118021.html
Copyright © 2011-2022 走看看