Jay,
May be
you can try a hash table and put in the value as a Vector of objects. This
would be a quick solution.
Before you add any new object try and check if it is in the
hash table with it's key. If it is then get the Vector from the hash table and
add new element to the vector and then put it back.
You
have to do little house keeping but it should work.
Thanks,
Vikram
Vikram Mahuvakar
Celera
Genomics
850
Lincoln Centre Drive
Foster City, CA 94404
(650)-638-6847
[EMAIL PROTECTED]
-----Original Message-----
From: A mailing list for Enterprise JavaBeans development [mailto:[EMAIL PROTECTED]]On Behalf Of Jay Baker
Sent: Wednesday, September 08, 1999 1:28 PM
To: [EMAIL PROTECTED]
Subject: GURUS : NEEDED -- Bucket classOK 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
