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
=
'';;
}
}
}
查看全文
相关阅读:
出乎意料的else语句
2015年全国谷歌卫星地图离线数据存储方案
Convert Sorted List to Binary Search Tree
程序猿学习资料分享---爱分享的程序猿(新浪微博)
myeclipse中断点调试
J2EE之13个规范标准概念
ora-01036: 非法的变量名/编号
CCNA Cloud CLDFND 210-451 QUIZ: Server Virtualization
已知二叉树的先序遍历序列和中序遍历序列,输出该二叉树的后序遍历序列
UML类图中的几种关系总结
原文地址:https://www.cnblogs.com/gwazy/p/118021.html
最新文章
Android 开发佳站【转】
Android使用ViewFlipper实现左右滑动效果面
Android Develop【转】
Android实现左右滑动指引效果
Android 实现左右滑动效果ViewFlipper终结【转】
android开发_SimpleAdapter适配器
Android适配器Adapter学习
简单使用SimpleCursorAdapter
BaseAdapter使listview设置不同背景图片并添加selector
server环境信息【C#代码获取】
热门文章
最小生成树-并查集-Kruskal-zoj-2048-special judge
UVA 558 Wormholes 【SPFA 判负环】
HDU 4173 Party Location(计算几何,枚举)
决策树的数学原理
流媒体技术 rtp/rtcp/rtsp资料精华!
[Servlet]研究ServletContext对象
HDU 5212 Code
poj 1961 Period(KMP)
大整数的阶乘
Python!Are you kidding me?
Copyright © 2011-2022 走看看