Lines Matching refs:Node

46   struct Node;
111     Node* node_;
124   Node* const head_;
134   Node** prev_;
141   Node* NewNode(const Key& key, int height);
149   bool KeyIsAfterNode(const Key& key, Node* n) const;
153   Node* FindGreaterOrEqual(const Key& key) const;
159   Node* FindLessThan(const Key& key, Node** prev = nullptr) const;
163   Node* FindLast() const;
168 struct SkipList<Key, Comparator>::Node {
169   explicit Node(const Key& k) : key(k) { }
175   Node* Next(int n) {
181   void SetNext(int n, Node* x) {
189   Node* NoBarrier_Next(int n) {
193   void NoBarrier_SetNext(int n, Node* x) {
200   std::atomic<Node*> next_[1];
204 typename SkipList<Key, Comparator>::Node*
207       sizeof(Node) + sizeof(std::atomic<Node*>) * (height - 1));
208   return new (mem) Node(key);
295 bool SkipList<Key, Comparator>::KeyIsAfterNode(const Key& key, Node* n) const {
301 typename SkipList<Key, Comparator>::Node* SkipList<Key, Comparator>::
308   Node* x = head_;
310   Node* last_bigger = nullptr;
313     Node* next = x->Next(level);
334 typename SkipList<Key, Comparator>::Node*
335 SkipList<Key, Comparator>::FindLessThan(const Key& key, Node** prev) const {
336   Node* x = head_;
339   Node* last_not_after = nullptr;
342     Node* next = x->Next(level);
364 typename SkipList<Key, Comparator>::Node* SkipList<Key, Comparator>::FindLast()
366   Node* x = head_;
369     Node* next = x->Next(level);
387   Node* x = head_;
391     Node* next = x->Next(level);
426   prev_ = reinterpret_cast<Node**>(
427             allocator_->AllocateAligned(sizeof(Node*) * kMaxHeight_));
475   Node* x = NewNode(key, height);
488   Node* x = FindGreaterOrEqual(key);