通过仔细地观察读写序列计数，可以进一步确定访问是顺序的还是随机的。
By looking at the read and write sequence counts in detail, you can further determine if the access is sequential or random.
在接下来两篇文章中，我们将探讨更强大、更方便的数据结构的应用：有序列表和随机访问字典。
In the next two articles, we'll explore the use of much more powerful and convenient data structures: ordered lists and random-access dictionaries.
如果标准序列容器支持随机访问，则指针容器也同样支持；例如。
If the standard sequence supports random access, so does the pointer container; for example.
应用推荐