31   Pointer next;  member
35       : next(n), num_entries(count) {}  in BucketHeader()
38     return next.load(std::memory_order_relaxed) == this;  in IsSkipListBucket()
544     assert(skip_list_bucket_header->Counting_header.next.load(  in GetSkipListBucketHeader()
565         header->next.load(std::memory_order_acquire));  in GetLinkListFirstNode()
651         reinterpret_cast<Node*>(header->next.load(std::memory_order_relaxed));  in Insert()
664       Node* next = cur->Next();  in Insert()  local
667       assert((cur == first) || (next == nullptr) ||  in Insert()
668              KeyIsAfterNode(next->key, cur));  in Insert()
672         cur = next;  in Insert()
688       header->next.store(static_cast<void*>(x), std::memory_order_release);  in Insert()
809     Node* next = x->Next();  in FindGreaterOrEqualInBucket()  local
812     assert((x == head) || (next == nullptr) || KeyIsAfterNode(next->key, x));  in FindGreaterOrEqualInBucket()
815       x = next;  in FindGreaterOrEqualInBucket()