Ext js

if(totalGap>0){

        var subtreeAux=node,numSubtrees=0;

          for(;subtreeAux1=null && subtreeAux!=leftAncestor;

                   subtreeAux =subtreeAux.previouseSibling)

                     numSubtrees++;

         if(subtreeAux!=null){

                 var subtreeMoveAux=node;

                 var singleGap=totalGap/numSubtrees;

             for(;subtreeMoveAux!=leftAncestor;

                 subtreeMoveAux=subtreeMoveAux.previousSibling){

                        subtreeMoveAux.prelim+=totalGap;

                        subtreeMoveAux.modifier+=totalGap;

                         totalGap-=singleGap;}}}

 

 

apportion:function(tree,node,level,prelim){

                  var firstChild=node.firstChild;

                  var firstChildLeftNeighbor=fristChild.leftNeighbor;

                  var j=1;

            for (var k=this.iMaxDepth-level;firstChild!=null&& j<=k;){

               var modifierSumRight=0,modifierSumLeft=0;

                var rightAncestor=firstChild;

                var leftAncestor=firstChildLeftNeighbor;

               for(var l=0; l<j;l++){

                   if(rightAncestor)rightAncestor=rightAncestor.parentNode;

                  if(leftAncestor) leftAncestor=leftAncestor.parentNode;

                  if(rightAncestor) modifierSumRight=rightAncestor.modifier||0;

                  if(leftAncestor) modifierSumLeft=leftAncestor.modifier||0;}

                  var nbprelim=firstChildLeftNeighbor?firstChildLeftNeighbor:prelim:0;

                 var fcprelim=nbprelim+modifierSumleft+

                                  this.getNodeSize(firstChildLeftNeighbor)+this.iSubtreeSeparation;

                 var totalGap=fcprelim-(firstChild.prelim+modifierSumRight);

                 if(totalGap>0)

                 if(!firstChildLeftNeighbor&&firstChild.parentNode.modifier<0)

                            firstChild.parentNode.modifier=0;

                     j++;

               if(firstChild.getChildrenCount()==0)firstChild=this.getLeftMost(node,0,j);

                 else firstChild=firstChild.firstChild;

               if(firstChild!=null)firstChildLeftNeighbor=firstChild.LeftNeighbor;}}

     

 

 

 

 

              

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值