DO NOT REPLY TO THIS EMAIL, BUT PLEASE POST YOUR BUG 
RELATED COMMENTS THROUGH THE WEB INTERFACE AVAILABLE AT
<http://nagoya.apache.org/bugzilla/show_bug.cgi?id=22826>.
ANY REPLY MADE TO THIS MESSAGE WILL NOT BE COLLECTED AND 
INSERTED IN THE BUG DATABASE.

http://nagoya.apache.org/bugzilla/show_bug.cgi?id=22826

[collections] List/Set implementation.





------- Additional Comments From [EMAIL PROTECTED]  2003-09-20 15:41 -------
I worked on this and got it all setup, however it has a problem with 
performance as it is based solely on the ArrayList class. All 
add/remove/contains etc have to scan the array to find the match, which will be 
slow.

The OrderedSet decorator can be made to implement List, and will perform better 
as it has both a List and Set internally.

Is there a case for both types?

---------------------------------------------------------------------
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL PROTECTED]

Reply via email to