So you were actually creating this linked data structure.

因此，也就创建了这种彼此链接的数据结构。

youdao

A lookup data structure which is a linked list is then initialized.

然后初始化一个查找数据结构，这是一个链表。

youdao

So to construct a nonblocking linked list, tree, or hash table, we need to find a way to update multiple Pointers with CAS without leaving the data structure in an inconsistent state.

所以，要构建一个非阻塞的链表、树或哈希表，需要找到一种方式，可以用CAS更新多个指针，同时不会让数据结构处于不一致的状态。

youdao