| 释义 |
- 1
Luckily, rope rebalancing is fast, and the determination of when to rebalance can be made automatically, for example by comparing the rope's length and depth. 幸运的是，rope的重新均衡操作非常迅速，至于应该何时进行重新均衡的决策也能够自动制定，例如通过比较rope的长度和深度来决定。 - 2
Table 4 contains the benchmark results of writing a rope with length 10,690,488 and depth 65 to a stream backed by an in-memory buffer. 表4包含的测评结果是将一个长度为10,690,488、深度为65的rope写入一个由内存缓冲区支持的流的结果。 - 3
But moving backward is more complicated, because internally the iterator performs a depth-first, preorder traversal of the Rope, visiting each of its leaf nodes. 但是向后移动要复杂些，因为迭代器内部执行的是深度优先算法，预先排好了Rope遍历的顺序，需要访问每个叶节点。
|