Guy Korland wrote: > It seems like linkedList.clear() can be easily fixed to O(1) instead of O(n). The code is like that on purpose(!). It was done to help GC, in mustang IIRC. There really isn't a problem with clear() being O(n) - it's going to take at least O(n) to populate it, and in reality *many* times more cycles. Tom