Hihi, I was just looking up what stud means and I can tell you I am amused :)
Concerning the issue: Thanks a lot for resolving this that quickly :) About finding out: I was investigating cache code to find out how it works and having worked on similar code it was obvious that removing something from the start of an array includes copying all the rest while a linked list just needs to shift a few pointers... Oliver On Tue, 30 Nov 2004 22:12:33 -0700, Larry Meadors <[EMAIL PROTECTED]> wrote: > Holy Crap! Yes. Definately yes. > > In a crude and very simple test of List.add(obj) and List.remove(0), add > takes about 0.86ms for LinkedList, and 0.67ms for ArrayList (per 1000 > operations). Not much difference there. > > The remove operation on the other hand took about 0.40ms for the > LinkedList, and 653.36ms for the ArrayList (again, per 1000 operations). > > I changed this in CVS. It should be in the next release. > > Oliver - you are a stud. How did you find that?! :-) > > Larry > > >>> [EMAIL PROTECTED] 11/30/04 5:02 PM >>> > > > Both FifoCacheController and LruCacheController use an ArrayList for > keyList. As keyList.remove(0) is executed many times wouldn't it be a > better idea to use something like LinkedList? >
