If you're going to respond to this totally off-topic question, please
do it privately and not on the list.
On Wed, 8 Sep 1999, Chris Pratt wrote:
> GURUS : NEEDED -- Bucket classIf I were you, I'd use a Hashtable and, when things
>are inserted into the table, create a Vector to hold the data values. The put and
>get code could go something like this:
>
> public void put (Object key,Object val) {
> Vector values = table.get(key);
> if(values == null) {
> values = new Vector();
> values.addElement(val);
> table.put(key,values);
> } else {
> values.addElement(val);
> }
> }
>
> public Vector get (Object key) {
> return (Vector)table.get(key).clone();
> }
>
> (*Chris*)
> ----- Original Message -----
> From: Jay Baker
> To: [EMAIL PROTECTED]
> Sent: Wednesday, September 08, 1999 1:27 PM
> Subject: GURUS : NEEDED -- Bucket class
>
>
> 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?
>
> Thanks in advance.
>
> Jay Baker
>
>
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
