To support this, I created a little recursive traversal function that walks all the nodes of a gnosis.xml.objectify object.
为此我创建了一个小型的递归便利函数来遍历gnosis . xml . objectify对象中的所有节点。
Another difference is that, internally, the zipper version USES a linear tail-recursive traversal of the data structure instead of a recursive traversal.
另外一项差异在于,在zippers版本内部使用的是数据结构的线性尾递归遍历,而非递归遍历。
The recursive traversal method can be fooled by placing garbage data after a conditional jump instruction and programmatically ensuring that the jump condition always succeeds.
通过在一个有条件跳转指令之后放置无用数据、并且有规划地确保跳转条件总是跳转成功,能够欺骗递归遍历方法。
应用推荐