Standard name for this type of linked list is the "intrusive linked list". There's an implementation for it in boost for c++ and here's another article about it: http://www.codeofhonor.com/blog/avoiding-game-crashes-relate...
external:
class Node<T> {
Node *next;
T *item;
}
class Node<T> {
Node *next;
T item;
}
typedef T Node<T>;
class <T> {
Node *next;
// members of T
};
The intrusive one allows the linked list to avoid memory allocations, and hold objects that are not copy- or move-able. The Boost page has a good table on the differences[1].
I'm actually not sure how much I agree w/ the codeofhorror article. They present the difference between a std::list holding raw pointers and an intrusive list with the title "Avoiding Game Crashes…"; if you want to avoid crashes, std::list<T> or std::list<std::unique_ptr<T>> (or even a shared_ptr, if appropriate); Of course std::list<T*> is error prone!
[1]: http://www.boost.org/doc/libs/1_55_0/doc/html/intrusive/intr...