In my case, I am planning to do an expunge when there are more old
entries than new entries (or plus a constant), so the "head" and "tail"
are likely of the same size.
I'll think about creating my own LinkedList. It will be nice to just
"break" at one link.
Thanks
Max
On 2/19/13 8:36 PM, P
On 19 February 2013 10:27, Weijun Wang wrote:
> I'm using LinkedList to maintain a history
Don't use LinkedList. Multiple benchmarks down the years have shown it
is almost always worse than ArrayList.
Stephen
> and the elements are ordered by
> their timestamps. Every now and then I would "exp
On 02/19/2013 01:24 PM, Peter Levart wrote:
On 02/19/2013 11:38 AM, Daniel Fuchs wrote:
On 2/19/13 11:27 AM, Weijun Wang wrote:
Hi All
I'm using LinkedList to maintain a history and the elements are ordered
by their timestamps. Every now and then I would "expunge" the list,
that
is to say, i
On 02/19/2013 11:38 AM, Daniel Fuchs wrote:
On 2/19/13 11:27 AM, Weijun Wang wrote:
Hi All
I'm using LinkedList to maintain a history and the elements are ordered
by their timestamps. Every now and then I would "expunge" the list, that
is to say, iterating through the list and when an element i
On 2/19/13 11:27 AM, Weijun Wang wrote:
Hi All
I'm using LinkedList to maintain a history and the elements are ordered
by their timestamps. Every now and then I would "expunge" the list, that
is to say, iterating through the list and when an element is old enough
all elements after (and includin
Hi All
I'm using LinkedList to maintain a history and the elements are ordered
by their timestamps. Every now and then I would "expunge" the list, that
is to say, iterating through the list and when an element is old enough
all elements after (and including) it will be removed. Currently I'm
