traversal
n. [计] 遍历;横越;横断物
2025-01-06 21:14 浏览次数 1
n. [计] 遍历;横越;横断物
Recursive Traversal递归遍历
traversal algorithm遍历算法
breadth traversal广度遍历
traversal instability横波不稳定
postorder traversal后序遍历
website traversal网站遍历
traversal method遍历方法
traversal type[计]
traversal record遍历记录
this is because traversal operators always return lists, even if there is only one item, or none, in the result.
这是因为遍历操作符总返回列表,即使结果中只有一个或没有项时也是如此。
though there are other traversal methods, those discussed here cover most of the typical needs.
虽然还有一些遍历函数没有提到,但这里覆盖了大多数常见的需求。
this is certainly more convenient than the traversal methods i discussed.
这无疑比我所讨论的遍历方法更方便。
all traversal operations start from the current focus owner or from another component virtually considered as the focus owner.
所有遍历操作都从当前的焦点所有者或从另一个被虚拟的认作焦点所有者的组件开始。
each component in a focus traversal cycle has its own previous and next component.
焦点遍历循环中每个组件都有自己的上一个组件和下一个组件。
xml document traversal and content-to-intermediate representation conversion are domain specific.
xml文档遍历和 「内容到中介」表示转换是特定于域的。
an attacker may use directory traversal and cross-site ccripting during a scan phase and then hit it with an sql injection or an rfi in the exploit phase.
在扫描阶段,攻击者可能会利用路径遍历和跨站点脚本;在攻击阶段,黑客可能会利用sql注入或远程文件包含进行攻击。
further, you can effectively use closure composition and mapping to define the action and effect traversal of the collection!
而且,可以有效地使用闭包复合和映射来定义集合的动作和效果遍历。
a traversal can end at a single node, or at several nodes, or at no nodes at all.
遍历可以结束于单个节点、或多个节点,或者在根本没有节点处结束。
the third part of the traversal expression is a boolean expression.
遍历表达式的第三部分是布尔表达式。
later sections in this article explore the core functions in the library and how it uses its powerful selectors and filters to make dom traversal easy and straightforward.
本文后面的小节探索这个库的核心函数,以及这个库如何使用它的强大的选择器和过滤器使dom遍历更加简单明了。
translating tasks into a useful structure is done through the strong parsing and dom traversal capabilities of a command-line php script.
将任务转换成一个有用的结构是通过命令行php脚本的强解析和dom遍历功能完成的。
because of the similarities between the two types of access, i「ll focus exclusively on traversal access in this article.
因为两种存取之间存在相似性,所以我在这篇文章只侧重于遍历存取。
note that creating your own focus traversal policy is a complex task.
请注意,创建您自己的焦点遍历策略是一项复杂的任务。
you can use this technique on the results of traversal expressions, which are lists.
可以对遍历表达式的结果(它们是列表)使用该技术。
you can track focus traversal activity originated by the mouse.
跟蹤由鼠标引起的焦点遍历行为。
this method can take another component as its argument, and will then transfer focus to the component that follows in the focus traversal cycle.
该方法可以把另一个组件作为它的参数,然后把焦点传递给焦点遍历循环中紧接着的那个组件。
as you can see, the file traversal is depth first but not necessarily in any alphabetical order within a directory.
正如您所见到的,该文件是深度优先遍历,但不一定在任何目录内按字母顺序来进行。
as a developer, you need to be aware of the new focus traversal behaviors when you create any new programs.
作为一个开发者,当您创建任何新程序时,您需要清楚新的焦点遍历方式。
as you」ve already seen, traversal and direct access require positional knowledge of the articles.
正如已经看到的,遍历存取和直接存取都需要知道图书的位置。
in general, both direct and traversal access require knowledge of the internal node structure.
一般来说,直接存取和遍历存取都需要知道内部节点的结构。
as you can see, daisy chaining allows you to concatenate several dom traversal statements together.
如您所见,菊花链方式可以将几个dom遍历语句连接起来。