A data structure with the linked list inline is the other way around, e.g.:

    class Foo {
      Foo *m_next;
      Foo *m_next_mru;
      Foo *m_next_sibling;
    };

With the STL implementation, only one list can have the item inlined; all the other linked lists need two indirections to get to the next element.