On Wed, 8 Sep 1999, Jay Baker wrote:
> OK gurus ;)
>
> We are in need of a class that acts like a bucket. That is,
> something like a hash table, but does NOT get overwritten if another
> object with the same key is added. The same key must allow multiple
> values.
>
> And here is the catch, it has to be 1.1 compatible. But don't worry
> about that too much. Can anybody help me out with a data structure
> like this?
Not on this list, hopefully.
Milt Epstein
Research Programmer
Software/Systems Development Group
Computing and Communications Services Office (CCSO)
University of Illinois at Urbana-Champaign (UIUC)
[EMAIL PROTECTED]
___________________________________________________________________________
To unsubscribe, send email to [EMAIL PROTECTED] and include in the body
of the message "signoff SERVLET-INTEREST".
Archives: http://archives.java.sun.com/archives/servlet-interest.html
Resources: http://java.sun.com/products/servlet/external-resources.html
LISTSERV Help: http://www.lsoft.com/manuals/user/user.html
