对每一个非初始化堆指针存储，卡片标记算法可以只增加两到三个机器指令，并要求在小的收集时对所有脏卡片上的对象进行扫描。

Card marking algorithms can add as little as two or three machine instructions per non-initializing heap pointer store, and entails scanning any objects on dirty CARDS at minor collection time.

youdao

然后，第二个表被扫描，只扫描一次，那个函数引导我们到哈希表中适合的位置，并且从那里，你找到匹配的行指针。

Then the second table is scanned, only once, the function directs us to the proper slot in the hash table and from there you find the pointers to the matching rows.

youdao

最小的表首先被扫描，然后哈希表被填入相匹配的每个键的行指针。

The smallest table is scanned first, and the hash table is populated with Pointers to the rows that match each key.

youdao