leveldb::SkipList< Key, Comparator >::Node Struct Reference

#include <skiplist.h>

Public Member Functions
	Node (const Key &k)
Node *	Next (int n)
void	SetNext (int n, Node *x)
Node *	NoBarrier_Next (int n)
void	NoBarrier_SetNext (int n, Node *x)

Public Attributes
Key const	key

Private Attributes
port::AtomicPointer	next_ [1]

Detailed Description

template<typename Key, class Comparator>
struct leveldb::SkipList< Key, Comparator >::Node

Definition at line 147 of file skiplist.h.

Constructor & Destructor Documentation

Node()

template<typename Key, class Comparator>

leveldb::SkipList< Key, Comparator >::Node::Node ( const Key &  k )

inlineexplicit

Definition at line 148 of file skiplist.h.

: key(k) { }

Member Function Documentation

Next()

template<typename Key, class Comparator>

Node* leveldb::SkipList< Key, Comparator >::Node::Next ( int  n )

inline

Definition at line 154 of file skiplist.h.

                    {
    assert(n >= 0);
    // Use an 'acquire load' so that we observe a fully initialized
    // version of the returned Node.
    return reinterpret_cast<Node*>(next_[n].Acquire_Load());
  }

Here is the caller graph for this function:

NoBarrier_Next()

template<typename Key, class Comparator>

Node* leveldb::SkipList< Key, Comparator >::Node::NoBarrier_Next ( int  n )

inline

Definition at line 168 of file skiplist.h.

                              {
    assert(n >= 0);
    return reinterpret_cast<Node*>(next_[n].NoBarrier_Load());
  }

NoBarrier_SetNext()

template<typename Key, class Comparator>

void leveldb::SkipList< Key, Comparator >::Node::NoBarrier_SetNext ( int  n, Node *  x  )

inline

Definition at line 172 of file skiplist.h.

                                         {
    assert(n >= 0);
    next_[n].NoBarrier_Store(x);
  }

SetNext()

template<typename Key, class Comparator>

void leveldb::SkipList< Key, Comparator >::Node::SetNext ( int  n, Node *  x  )

inline

Definition at line 160 of file skiplist.h.

                               {
    assert(n >= 0);
    // Use a 'release store' so that anybody who reads through this
    // pointer observes a fully initialized version of the inserted node.
    next_[n].Release_Store(x);
  }

Member Data Documentation

key

template<typename Key, class Comparator>

Key const leveldb::SkipList< Key, Comparator >::Node::key

Definition at line 150 of file skiplist.h.

next_

template<typename Key, class Comparator>

port::AtomicPointer leveldb::SkipList< Key, Comparator >::Node::next_[1]

private

Definition at line 179 of file skiplist.h.

---

The documentation for this struct was generated from the following file:

• db/skiplist.h