1.Some frameworks also allow you to "daisy-chain" traversal functions, meaning you can concatenate traversal commands to one another.
有些框架可以使用“菊花链”遍历函数，表示可以将遍历命令互相连接。
2.As you can see, daisy chaining allows you to concatenate several DOM traversal statements together.
如您所见，菊花链方式可以将几个DOM遍历语句连接起来。
3.Obviously , remembering all this information becomes harder as the traversal path becomes longer , as is wont to happen for larger systems .
显然，随着遍历路径变得更长，记住所有这些信息就更困难，因此对于较大的系统来说并不实用。
4.Tokens form what is known as the traversal operator, which indicates that you wish to follow a particular arc from each resource.
记号形成遍历运算符，它表示您希望沿着来自每个资源的特定圆弧遍历。
5.User specified nodes as a starting point, the output of each node traversal visit Spanning Tree sequence and the corresponding set of edges.
以用户指定的节点为起点，分别输出每种遍历下的节点访问序列和相应生成树的边集。-one。
6.To support this, I created a little recursive traversal function that walks all the nodes of a gnosis. xml. objectify object.
为此我创建了一个小型的递归便利函数来遍历gnosis.xml.objectify对象中的所有节点。
7.Searches can have either a shallow scope (also referred to as shallow traversal) or a deep scope (also referred to as deep traversal).
搜索既可以有浅范围（也称为浅遍历），也可以有深范围（也称为深遍历）。
8.A final note: By inserting elements into a search tree and then performing an inorder traversal, we obtain the elements in sorted order.
最后请注意：通过插入到查找树元素，然后执行一个序遍历，我们得到有序的元素。
9.In the third part of a traversal expression, the context is one of the partial results from the first and second parts.
在遍历表达式的第三部分中，上下文是第一和第二部分的部分结果之一。
10.Since Neo4j is a database, each access to the graph structure - read, write, and traversal - are managed by an ACID transaction system.
由于Neo4j是个数据库，因此对图形结构的访问——读、写及遍历都是通过ACID事务系统进行管理的。