67 item->next_ = last_->next_;
68 last_ = last_->next_ = item;
72 last_ = item->next_ = item;
84 <<
"remove from empty list"
88 SLListBase::link *ret = last_->next_;
96 last_->next_ = ret->next_;
106 SLListBase::link *prev = iter.get_node();
113 for (iter.next(); iter !=
end(); iter.next())
115 SLListBase::link *
p = iter.get_node();
121 prev->next_ =
p->next_;