27 Aug
2017
27 Aug
'17
12:36 a.m.
Whether that is faster or not depends on many factors, primarilly the use scenarios at hand. One can't make a general statement like that without specifics. One factor that could make a vector more efficient than a list is cache friendliness, but an intrusive list could exploit it as well if you manage the storage appropriately.
Examples please.
Examples of what, exactly?
ps. This is largely due to the cost of iteration between either technique. An intrusive list has the same iteration cost.