Intrusive lists are very different beasts than lists by value.
There are less allocations involved (perf and points of failure), values can be inserted on different lists without new allocations, deletion is O(1), elements can be heterogeneous (different sizes and types), etc
etc
I seldomly use linked lists, but most of the time i prefer them to be intrusive. There of course are intrusive list implementations on C++.
There are less allocations involved (perf and points of failure), values can be inserted on different lists without new allocations, deletion is O(1), elements can be heterogeneous (different sizes and types), etc
etc
I seldomly use linked lists, but most of the time i prefer them to be intrusive. There of course are intrusive list implementations on C++.