递归生成嵌套字典_UM-仿真秀干货文章

递归生成嵌套字典

TodayCAEer

3月前浏览181

proc generate_random_dict {depth} {

set dict {}

set num_keys [expr {int(rand()*5) + 1}]

for {set i 0} {$i < $num_keys} {incr i} {

set key "key$i"

if {$depth > 0} {

# Value is another dict

set value [generate_random_dict [expr {$depth - 1}]]

} else {

# Value is a string

set value "value$i"

}

dict set dict $key $value

}

return $dict

}

# set dict [generate_random_dict 3]

递归真的太重要了

来源：TodayCAEer

关于矢量的基础函数

proccalculate{points}{setnum_points[llength$points]if{$num_points<2||$num_points>4}{return-codeerror"Invalidnumberofpoints.Mustbe2,3,or4."}setlast_point[lindex$pointsend]switch$num_points{2{setpoint1[lindex$points0]setpoint2[lindex$points1]setvector[vecsub$point2$point1]setnormalized_vector[vecnormalize$vector]return[list$normalized_vector$point2]}3-4{setpoint1[lindex$points0]setpoint2[lindex$points1]setpoint3[lindex$points2]setvector1[vecsub$point2$point1]setvector2[vecsub$point3$point1]setnormal[veccross$vector1$vector2]setnormalized_normal[vecnormalize$normal]return[list$normalized_normal$last_point]}}}procvecsub{v1v2}{setresult[list]foreachi$v1j$v2{lappendresult[expr{$j-$i}]}return$result}procvecnormalize{v}{setlength0foreachi$v{setlength[expr{$length+$i*$i}]}setlength[expr{sqrt($length)}]setresult[list]foreachi$v{lappendresult[expr{$i/$length}]}return$result}procveccross{v1v2}{setx[expr{[lindex$v11]*[lindex$v22]-[lindex$v12]*[lindex$v21]}]sety[expr{[lindex$v12]*[lindex$v20]-[lindex$v10]*[lindex$v22]}]setz[expr{[lindex$v10]*[lindex$v21]-[lindex$v11]*[lindex$v20]}]return[list$x$y$z]}calculate{{-65.0463-298.55-61.6646}{38.73903-207.005-48.1097}}calculate{{-65.0463-298.55-61.6646}{38.73903-207.005-48.1097}{-51.713-230.822-49.622}}calculate{{-65.0463-298.55-61.6646}{38.73903-207.005-48.1097}{-51.713-230.822-49.622}{-44.304-262.711-49.416}}来源：TodayCAEer