Instance learning (Classification of upper and lower levels)

Data Table Department

Departid partition name

01 level 1 01

0101 Level 2 0101

0102 Level 2 0102

02 Level 1 02

0201 Level 2 0201

0202 Level 2 0202

1. /// <Summary>
2. /// Bind the navigation tree
3. /// </Summary>
4. Protected void bindtree ()
5. {
6. // Obtain the tree data
7. Dataset DS = me. executedataset ("select * from Department ");
9. // Overwrite the parent node
10. Datarow [] DR1 = Ds. Tables [0]. Select ("Len (departid) = 2 ");
11. For (INT I = 0; I <dr1.length; I ++)
12. {
13. Int count;
14. Treenode = new treenode ();
15. Treenode. Text = DR1 [I] ["pipeline name"]. tostring ();
16. // Treenode. navigateurl = ""; // "../" + DR1 [I] ["remark"]; // navigate here and set fields.
17. // Treenode. Target = "Main ";
18. Treenode. selectaction = treenodeselectaction. Expand;
19. Treenode. imageurl = "../images/book.gif ";
20. This. TV _nav.nodes.add (treenode );
22. // Overwrite the subnode
23. Count = 0;
24. Datarow [] DR2 = Ds. tables [0]. select ("Len (departid) = 4 and substring (departid, 1, 2) = '" + DR1 [I] ["departid"] + "'");
25. If (dr1.length> 0)
26. {
27. For (Int J = 0; j <dr2.length; j ++)
28. {
29. // Add the permission judgment logic here.
30. // If (qxdm. indexof ("" + DR2 [J] ["lmbh"]) <0)
31. // Continue;
32. Treenode childnode = new treenode ();
33. Childnode. Text = DR2 [J] ["Your name"]. tostring ();
34. Childnode. navigateurl = "../" + DR2 [J] ["remark"]. tostring ();
35. Childnode. Target = "Main ";
36. Childnode. imageurl = "../images/book.gif ";
37. Treenode. childnodes. Add (childnode );
38. Count = count + 1;
39. }
40. }
41. // If there are no small classes, delete them together.
42. If (COUNT = 0)
43. TV _nav.nodes.remove (treenode );
44. }
45. }