• To support this, I created a little recursive traversal function that walks all the nodes of a gnosis.xml.objectify object.

    为此创建了一个小型递归便利函数来遍历gnosis . xml . objectify对象中的所有节点

    youdao

  • Another difference is that, internally, the zipper version USES a linear tail-recursive traversal of the data structure instead of a recursive traversal.

    另外一项差异在于,在zippers版本内部使用的是数据结构线性尾递归遍非递归遍历。

    youdao

  • 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.

    通过一个条件跳转指令之后放置无用数据并且有规划地确保跳转条件总是跳转成功,能够欺骗递归遍历方法

    youdao

  • This traversal is interesting because it is iterative, not recursive, which is a key difference between zipper traversal and the prior clojure.walk implementation.

    这种非常有趣,因为迭代的,不是递归的,这是zippers 遍历之前的 clojure.walk 实现之间主要差别

    youdao

  • Recursive and non recursive implementation of binary tree traversal, the use of queues to achieve the level of binary tree traversal.

    利用递归实现中序遍,利用队列实现二叉树层次遍历。

    youdao

  • Recursive and non recursive implementation of binary tree traversal, the use of queues to achieve the level of binary tree traversal.

    利用递归实现中序遍,利用队列实现二叉树层次遍历。

    youdao

$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定