RE: Massively OT, 'Closures in Java' [was Re: AW: [Patch] modifiedselector, style, remove unused code, slightly more lazy DigestAlgorithm.getValue (now with added source code -doh!)]

2005-02-28 Thread Phil Weighill-Smith
; -Original Message- > > From: Kev Jackson [mailto:[EMAIL PROTECTED] > > Sent: 28 February 2005 11:19 > > To: Ant Developers List > > Subject: Re: Massively OT, 'Closures in Java' [was Re: AW: > > [Patch] modifiedselector, style, remove unused code,

RE: Massively OT, 'Closures in Java' [was Re: AW: [Patch] modifiedselector, style, remove unused code, slightly more lazy DigestAlgorithm.getValue (now with added source code -doh!)]

2005-02-28 Thread Jose Alberto Fernandez
: Re: Massively OT, 'Closures in Java' [was Re: AW: > [Patch] modifiedselector, style, remove unused code, slightly > more lazy DigestAlgorithm.getValue (now with added source code -doh!)] > > > Jose Alberto Fernandez wrote: > > >AFAIU, LinkedList.get(N) requ

Re: Massively OT, 'Closures in Java' [was Re: AW: [Patch] modifiedselector, style, remove unused code, slightly more lazy DigestAlgorithm.getValue (now with added source code -doh!)]

2005-02-28 Thread Kev Jackson
Jose Alberto Fernandez wrote: AFAIU, LinkedList.get(N) requires traversing the list to position N on every call [O(n^2)], so usage of an iteratoe is much cheaper on this case as there is no array behind the scenes. Jose Alberto I've just worked out why it's ok to do it this way (with respect t

RE: Massively OT, 'Closures in Java' [was Re: AW: [Patch] modifiedselector, style, remove unused code, slightly more lazy DigestAlgorithm.getValue (now with added source code -doh!)]

2005-02-28 Thread Jose Alberto Fernandez
AFAIU, LinkedList.get(N) requires traversing the list to position N on every call [O(n^2)], so usage of an iteratoe is much cheaper on this case as there is no array behind the scenes. Jose Alberto > -Original Message- > From: Kev Jackson [mailto:[EMAIL PROTECTED] > Sent: 28 February 20