I am broadly in favour of this class. However, - I would like to see it extend LinkedList, so it can be used as a direct LL substitute - This then implies changes to the logic in certain methods (eg.getFirst(), getLast()) - I would like to see unit tests (There is a structure for unit tests, that means that you need to write very little as the superclass of the test does all the work of comparing against the List spec.)
Stephen ----- Original Message ----- From: "Jeff Varszegi" <[EMAIL PROTECTED]> To: "Jakarta Commons Developers List" <[EMAIL PROTECTED]>; <[EMAIL PROTECTED]> Sent: Friday, November 15, 2002 4:23 PM Subject: [collections][SUBMIT]A faster linked list > NodeCachingLinkedList is identical to LinkedList except in that it maintains an internal node > cache so it doesn't have to create new ones as often. > > Jeff > > > __________________________________________________ > Do you Yahoo!? > Yahoo! Web Hosting - Let the expert host your site > http://webhosting.yahoo.com ---------------------------------------------------------------------------- ---- > -- > To unsubscribe, e-mail: <mailto:[EMAIL PROTECTED]> > For additional commands, e-mail: <mailto:[EMAIL PROTECTED]> -- To unsubscribe, e-mail: <mailto:[EMAIL PROTECTED]> For additional commands, e-mail: <mailto:[EMAIL PROTECTED]>
