If no random values are used in the game, you can just log the input changes of the user and replay them later.
若果游戏没有使用随机值,你只需记录输入的变化然后重复它们就行了。
TPC-C is an OLTP benchmark which requires efficient use of large memory, intensive random read/write I/O, and has extremely intensive database log activity.
TPC-C 是一种 OLTP 基准,要求有效地使用大量内存,大量的随机 read/write I/O,并且有很密集的数据库日志活动。
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)。
应用推荐