Talk:Unrolled linked list

Untitled

std::deque. prefer over std::list and std::vector. unfortunately noone does. sad. — Preceding unsigned comment added by 84.176.232.207 (talk) 00:48, 11 September 2006 (UTC)[reply]

Actually, std::deque is typically implemented using a variant of the dynamic array where active elements are placed in the middle of the array. There are implementations of std::list and std::deque based on unrolled linked lists, though. Deco 00:59, 11 September 2006 (UTC)[reply]

Skip lists are not similar to this. —Preceding unsigned comment added by 221.162.27.131 (talk) 13:53, 2 March 2008 (UTC)[reply]

Comment from top of article by User:Costaluiz:

This article is in need of references that can demonstrate the performance measures presented. Please, add your contribution in that respect if you can. Complete examples or case study would be greatly appreciated.

Dcoetzee 00:48, 1 April 2009 (UTC)[reply]