leveldb::SkipList< Key, Comparator >::Iterator Class Reference

#include <skiplist.h>

Collaboration diagram for leveldb::SkipList< Key, Comparator >::Iterator:

Public Member Functions
	Iterator (const SkipList *list)
bool	Valid () const
const Key &	key () const
void	Next ()
void	Prev ()
void	Seek (const Key &target)
void	SeekToFirst ()
void	SeekToLast ()

Private Attributes
const SkipList *	list_
Node *	node_

Detailed Description

template<typename Key, class Comparator>
class leveldb::SkipList< Key, Comparator >::Iterator

Definition at line 59 of file skiplist.h.

Constructor & Destructor Documentation

Iterator()

template<typename Key , class Comparator >

leveldb::SkipList< Key, Comparator >::Iterator::Iterator ( const SkipList *  list )

inlineexplicit

Definition at line 191 of file skiplist.h.

                                                                      {
  list_ = list;
  node_ = NULL;
}

Member Function Documentation

key()

template<typename Key , class Comparator >

const Key & leveldb::SkipList< Key, Comparator >::Iterator::key ( ) const

inline

Definition at line 202 of file skiplist.h.

                                                              {
  assert(Valid());
  return node_->key;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Next()

template<typename Key , class Comparator >

void leveldb::SkipList< Key, Comparator >::Iterator::Next ( )

inline

Definition at line 208 of file skiplist.h.

                                                   {
  assert(Valid());
  node_ = node_->Next(0);
}

Here is the call graph for this function:

Here is the caller graph for this function:

Prev()

template<typename Key , class Comparator >

void leveldb::SkipList< Key, Comparator >::Iterator::Prev ( )

inline

Definition at line 214 of file skiplist.h.

                                                   {
  // Instead of using explicit "prev" links, we just search for the
  // last node that falls before key.
  assert(Valid());
  node_ = list_->FindLessThan(node_->key);
  if (node_ == list_->head_) {
    node_ = NULL;
  }
}

Here is the call graph for this function:

Here is the caller graph for this function:

Seek()

template<typename Key, class Comparator >

void leveldb::SkipList< Key, Comparator >::Iterator::Seek ( const Key &  target )

inline

Definition at line 225 of file skiplist.h.

                                                                    {
  node_ = list_->FindGreaterOrEqual(target, NULL);
}

Here is the call graph for this function:

Here is the caller graph for this function:

SeekToFirst()

template<typename Key , class Comparator >

void leveldb::SkipList< Key, Comparator >::Iterator::SeekToFirst ( )

inline

Definition at line 230 of file skiplist.h.

                                                          {
  node_ = list_->head_->Next(0);
}

Here is the call graph for this function:

Here is the caller graph for this function:

SeekToLast()

template<typename Key , class Comparator >

void leveldb::SkipList< Key, Comparator >::Iterator::SeekToLast ( )

inline

Definition at line 235 of file skiplist.h.

                                                         {
  node_ = list_->FindLast();
  if (node_ == list_->head_) {
    node_ = NULL;
  }
}

Here is the call graph for this function:

Here is the caller graph for this function:

Valid()

template<typename Key , class Comparator >

bool leveldb::SkipList< Key, Comparator >::Iterator::Valid ( ) const

inline

Definition at line 197 of file skiplist.h.

                                                          {
  return node_ != NULL;
}

Here is the caller graph for this function:

Member Data Documentation

list_

template<typename Key, class Comparator>

const SkipList* leveldb::SkipList< Key, Comparator >::Iterator::list_

private

Definition at line 92 of file skiplist.h.

node_

template<typename Key, class Comparator>

Node* leveldb::SkipList< Key, Comparator >::Iterator::node_

private

Definition at line 93 of file skiplist.h.

---

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

• db/skiplist.h