leveldb源码实现的双向链表。
设计思想:
<1>链表由表头和表元素构成
<2>表头是一个特殊的表元素
<3>元素从表尾插入
链表实现:
class SnapshotImpl;
class SnapshotList
{
public:
SnapshotList()
{
list_.prev_ = &list_;
list_.next_ = &list_;
}
bool empty() const
{
return list_.next_ == &list_;
}
SnapshotImpl* oldest() const
{
assert(!empty());
return list_.next_;
}
SnapshotImpl* newest() const
{
assert(!empty());
return list_.prev_;
}
const SnapshotImpl* New(int seq)
{
SnapshotImpl* s = new SnapshotImpl;
s->number_ = seq;
s->list_ = this;
s->next_ = &list_;
s->prev_ = list_.prev_;
s->prev_->next_ = s;
s->next_->prev_ = s;
return s;
}
void Delete(const SnapshotImpl* s) {
assert(s->list_ == this);
s->prev_->next_ = s->next_;
s->next_->prev_ = s->prev_;
delete s;
}
private:
// Dummy head of doubly-linked list of snapshots
SnapshotImpl list_;
};
表元素:
// Abstract handle to particular state of a DB.
// A Snapshot is an immutable object and can therefore be safely
// accessed from multiple threads without any external synchronization.
class Snapshot
{
protected:
virtual ~Snapshot();
};
Snapshot::~Snapshot()
{
}
class SnapshotList;
// Snapshots are kept in a doubly-linked list in the DB.
// Each SnapshotImpl corresponds to a particular sequence number.
class SnapshotImpl : public Snapshot
{
public:
int number_; // const after creation
private:
friend class SnapshotList;
// SnapshotImpl is kept in a doubly-linked circular list
SnapshotImpl* prev_;
SnapshotImpl* next_;
SnapshotList* list_; // just for sanity checks
};
测试程序:
SnapshotList snapShotListHeader;
for(int nCount = 0; nCount < 100; ++nCount)
{
snapShotListHeader.New(nCount);
}
::std::cout << snapShotListHeader.oldest()->number_ << ::std::endl;
::std::cout << snapShotListHeader.newest()->number_ << ::std::endl;
getchar();