149 elem->next() = after->next();
150 after->next() = elem;
198 list.
the_last->next() = after->next();
199 after->next() = list.
first();
215 if (after->next() ==
last())
217 after->next() = after->next()->next();
222 void remove(
const T *elem)
235 for (; after !=
the_last; after = after->next())
236 if (after->next() == elem)
253 if (
the_first != 0 && list.the_first != 0)
255 assert(
find(list.first()));
256 assert(
find(list.last()));
267 for (; after->next() != list.the_first; after = after->next())
272 after->next() = list.the_last->next();
310 return (elem ==
the_last) ? 0 : elem->next();
320 for (num = 1; test !=
the_last; test = test->next())
357 assert(part.
find(end));
358 part.
the_last =
const_cast<T*
>(end);
383 for (elem =
first(); elem; elem =
next(elem))
385 elem->next() =
reinterpret_cast<T*
>(
reinterpret_cast<char*
>(elem->next()) + delta);
392 #ifdef ENABLE_CONSISTENCY_CHECKS