Lines Matching refs:nlist
97 set nlist {}
99 lappend nlist [my Name2Node ${name}]
101 return ${nlist}
107 set nlist {}
109 lappend nlist [my Node2Name ${node}]
111 return ${nlist}
161 set nlist [my Names2NodeList {*}${args}]
162 set children [lreplace ${children} ${idx} ${idx} {*}${nlist}]
417 set nlist ""
431 lappend nlist ${node}
435 if { [llength ${nlist}] > 0 } {
436 ${pnode} insert ${index} {*}${nlist}
455 set nlist [my nodes]
457 set nlist ${name}
460 foreach name ${nlist} {
534 set nlist {}
538 lappend nlist ${name}
541 set names ${nlist}
544 set nlist {}
548 lappend nlist ${name}
551 set names ${nlist}
615 set nlist {}
620 lappend nlist ${node}
624 ${pnode} children [linsert ${children} ${index} {*}${nlist}]
956 # This method takes as input a list of nodes (nlist) and returns
958 method DecendOneLevelForward { nlist } {
960 foreach node ${nlist} {
966 # This method takes as input a list of nodes (nlist) and returns
968 method DecendOneLevelBackward { nlist } {
970 foreach node ${nlist} {
979 method BfsPreOrderWalk { nlist cmdprefix } {
980 if { [llength ${nlist}] == 0 } { return 0 }
981 foreach node ${nlist} {
988 if { [my BfsPreOrderWalk [my DecendOneLevelForward ${nlist}] ${cmdprefix}] != 0 } {
996 method BfsPostOrderWalk { nlist cmdprefix } {
997 if { [llength ${nlist}] == 0 } { return 0 }
998 if { [my BfsPostOrderWalk [my DecendOneLevelBackward ${nlist}] ${cmdprefix}] != 0 } {
1001 foreach node ${nlist} {
1013 method BfsBothOrderWalk { nlist cmdprefix } {
1014 if { [llength ${nlist}] == 0 } { return 0 }
1015 foreach node ${nlist} {
1022 my BfsBothOrderWalk [my DecendOneLevelForward ${nlist}] ${cmdprefix}
1023 foreach node [lreverse ${nlist}] {