47 first_ = last_ = item;
72 first_ = last_ = item;
91 DLListBase::link *ap = a->prev_;
100 ap->prev_->next_ = a;
110 a->next_->prev_ = ap;
113 a->prev_ = ap->prev_;
116 ap->next_ = a->next_;
130 DLListBase::link *an = a->
next_;
169 <<
"remove from empty list"
173 DLListBase::link *ret = first_;
174 first_ = first_->next_;
190 DLListBase::link *ret = item;
192 if (item == first_ && first_ == last_)
197 else if (item == first_)
199 first_ = first_->
next_;
200 first_->
prev_ = first_;
202 else if (item == last_)
204 last_ = last_->
prev_;
205 last_->
next_ = last_;
229 if (oldLink == first_ && first_ == last_)
234 else if (oldLink == first_)
239 else if (oldLink == last_)