以上来源于: WordNet
The job is now set to enter the Guinness Book of Records as the highest rope access work ever completed.
而他们的工作,正被吉尼斯世界纪录审核,有望成为已完成的世界上最高的降绳操作。
And, in most data-processing routines, sequential access to a rope's characters is what's required, in which case a rope iterator can provide amortized o (1) access speed.
而且,在多数数据处理例程中,都需要对rope字符进行顺序访问,在这种情况下,rope的迭代器能够提供分摊的o(1)访问速度。
As I mentioned in the overview section, random character access on a rope with many internal nodes is approximately o (log n), so traversal is o (n log n).
就像我在概述一节中提到过的,在拥有许多内部节点的rope上随机访问字符的时间大约为o (log n),所以遍历时间为o (nlog n)。
应用推荐