tags:

views:

97

answers:

2
+2  Q: 

Intrusive lists

I've not been able to find too much information about them online. What are they and when are they typically used?

Thanks.

+6  A: 

This page of boost's website explains the difference : http://www.boost.org/doc/libs/1_43_0/doc/html/intrusive/intrusive_vs_nontrusive.html

Scharron
+5  A: 

An intrusive list is one where the pointer to the next list node is stored in the same structure as the node data. This is normally A Bad Thing, as it ties the data to the specific list implementation. Most class libraries (for example, the C++ Standard Library) use non-intrusive lists, where the data knows nothing about the list (or other container) implementation.

anon
Thanks for the input. If I could, I would have accepted both answers.
Konrad