> There are cases where LinkedList has good performances (mainly > insert/remove in the middle of the list), but it's the slowest for stacks.
That is a less absolute statement. I was missing that context. =:o) For stacks the ArrayList is obviously faster as soon as maximum length is reached. Have fun, Paulo > -----Original Message----- > From: Sylvain Wallez [mailto:[EMAIL PROTECTED]] > Sent: Monday, January 28, 2002 4:01 PM > > > Paulo Gaspar wrote: > > >>-----Original Message----- > >>From: Berin Loritsch [mailto:[EMAIL PROTECTED]] > >>Sent: Monday, January 28, 2002 3:11 PM > >> > >> > >>LinkedList? That is the slowest list we have! > >> > > > >That really depends on what you are doing. > > > >It is not much slower to iterate trough it than any > >other list and it can obviously be faster to update > >it than to update an ArrayList. > > > >"Thinking in Java" (http://www.mindview.net/Books/TIJ/) > >had some interesting tables with the result of > >several comparative performance tests in the 1st > >edition (I still did not look at the 2nd edition). > > > > > >Have fun, > >Paulo Gaspar > > > There are cases where LinkedList has good performances (mainly > insert/remove in the middle of the list), but it's the slowest for stacks. > > See http://marc.theaimsgroup.com/?l=xml-cocoon-dev&m=101136593301059&w=2 > for a recent discussion on this subject. > > Sylvain > > -- > Sylvain Wallez > Anyware Technologies - http://www.anyware-tech.com --------------------------------------------------------------------- To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, email: [EMAIL PROTECTED]
