Better lists? (Was: glib dependency for the X Server)

[Bernardo Innocenti]

Adam Jackson wrote:

>> [...talking about performance of lists with modern processors...]
>>
> They're terrible when the items in the list are expected to be accessed among 
> multiple CPUs, because the pointers will usually share cachelines and pong 
> all over the place.  I can't think of any other reason why they would be 
> non-performant though.

Walking over list nodes also tends to trash the data cache,
but the same can be said of almost any data structure except
for vectors.

-- 
  // Bernardo Innocenti - Develer S.r.l., R&D dept.
\X/  http://www.develer.com/